Search

• A distributed framework for simultaneous state and parameter estimation. • Subsystem decomposition considering parameters using community detection. • A distributed MHE scheme for maximum information extraction. In this paper, we consider distributed simultaneous state and parameter estimation for a class of nonlinear systems, for which the augmented model comprising both the states and the parameters is only partially observable. Specifically, we first illustrate how the sensitivity analysis (SA) can select variables for simultaneous state and parameter estimation. Then, a community structure detection (CSD) based process decomposition method is proposed for dividing the entire system into interconnected subsystems as the basis of distributed estimation. Next, we develop local moving horizon estimators based on the configured subsystem models, and the local estimators communicate with each other to exchange their estimates. Finally, an SA and CSD based distributed moving horizon estimation (DMHE) mechanism is proposed. The effectiveness of the proposed approach is illustrated using a chemical process consisting of four connected reactors. [ABSTRACT FROM AUTHOR]

• A systematic subsystem decomposition procedure for complex process systems for state estimation. • Three different distributed state estimation algorithms with detailed examples. • Extensive simulation results based on three commonly used distributed state estimation algorithms. In this work, a systematic subsystem decomposition procedure for complex process systems is proposed for distributed state estimation. In the proposed procedure, both the connectivity within a system and the strength of connections are taken into account. A nonlinear process is first presented by a directed graph in which a node denotes either a state or a measured output of the nonlinear process. In the directed graph, nodes are connected via weighted edges and the weights reflect the strength of connection between two nodes. Based on the weighted directed graph, community structure detection is used to divide all the variables into smaller groups, such that the intra-connection within each group is made much stronger than the interaction among different groups. Subsystem models that are appropriate for distributed state estimation are configured based on the variables assigned to the groups. A comparative study between the proposed procedure with a procedure based on unweighted directed graph is conducted through extensive simulations. In the simulations, a numerical example and a chemical process example are considered. Three commonly used distributed state estimation algorithms designed based on the two decomposition procedures are applied to the two examples. A few guidelines on when to use weighted graphs for decomposition for distributed state estimation are concluded. [ABSTRACT FROM AUTHOR]

Abstract We present an integrated approach to cluster and visualize character networks in fiction with the aid of computational and statistical methods. An unsupervised clustering algorithm, minimum span clustering (MSC), was applied to cluster fictional characters at various characteristic resolutions based on their activities in the novel. As a demonstration, we study the character network in Dream of the Red Chamber , the greatest novel in Chinese literature. The character network of the novel is found to exhibit properties of scale-free and small-world networks. Based on unsupervised cluster analyses, we construct and visualize the community structure of the network, and find a three-tiered structure of core, secondary, and peripheral characters. By treating the network as a weighted graph, we further analyze the centralities of characters to determine their importance in the network, and find that betweenness centrality, as a measure of characters' control over the flow of the narrative, is differentiated from other centrality measures for Dream of the Red Chamber. We believe that these analytic methods provide beneficial tools for applications such as autonomous novel writing. [ABSTRACT FROM AUTHOR]

The discovery and analysis of community structure in complex networks is a hot issue in recent years. In this paper, based on the fast greedy clustering algorithm CNM with the thought of local search, the introduction of the idea of node centrality and the optimal division of the central nodes and their neighbor nodes into correct communities, a new algorithm CNM-Centrality of detecting communities in complex networks is proposed. In order to verify the accuracy and efficiency of this algorithm, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks by LFR-benchmark. The experimental results indicate that this algorithm can identify the communities accurately and efficiently. Furthermore, this algorithm can also acquire higher values of modularity and NMI than the CNM, Infomap, Walktrap algorithms do. [ABSTRACT FROM AUTHOR]

Abstract: Community structure detection in complex networks has been intensively investigated in recent years. In this paper, we propose an adaptive approach based on ant colony clustering to discover communities in a complex network. The focus of the method is the clustering process of an ant colony in a virtual grid, where each ant represents a node in the complex network. During the ant colony search, the method uses a new fitness function to percept local environment and employs a pheromone diffusion model as a global information feedback mechanism to realize information exchange among ants. A significant advantage of our method is that the locations in the grid environment and the connections of the complex network structure are simultaneously taken into account in ants moving. Experimental results on computer-generated and real-world networks show the capability of our method to successfully detect community structures. [Copyright &y& Elsevier]