时滞离散神经网络的同步控制

利用既有效又便于实施的时滞状态反馈控制器,根据所给定的条件构造相应的不等式,研究了带有时滞的离散神经网络模型的同步控制问题,给出了该离散系统指数同步的充分条件.在设计同步控制的时候,没有假设激励函数的有界性、可微性和单调性,给出的条件简便易实施.数值结果进一步证明了该控制方法的有效性. 关键词： 离散神经网络 时滞 同步     

基于联合矩阵分解的节点多属性网络社团检测

发现复杂网络中的社团结构在社会网络、生物组织网络和在线网络等复杂网络中具备十分重要的意义. 针对社交媒体网络的社团检测通常需要利用两种信息源: 网络拓扑结构特征和节点属性特征, 丰富的节点内容属性信息为社团检测的增加了灵活性和挑战. 传统方法是要么仅针对这两者信息之一进行单独挖掘, 或者将两者信息得到的社团结果进行线性叠加判决, 不能有效进行信息源的融合. 本文将节点的多维属性特征作为社团划分的一种有效协同学习项进行研究, 将两者信息源进行融合分析, 提出了一种基于联合矩阵分解的节点多属性网络社团检测算法CDJMF, 提高了社团检测的有效性和鲁棒性. 实验表明, 本文所提的方法能够有效利用节点的属性信息指导社团检测, 具备更高的社团划分质量.     

Scheduling of high-speed rail traffic based on discrete-time movement model

In this paper, a new simulation approach for solving the mixed train scheduling problem on the high-speed double-track rail line is presented. Based on the discrete-time movement model, we propose control strategies for mixed train movement with different speeds on a high-speed double-track rail line, including braking strategy, priority rule, travelling strategy, and departing rule. A new detailed algorithm is also presented based on the proposed control strategies for mixed train movement. Moreover, we analyze the dynamic properties of rail traffic flow on a high-speed rail line. Using our proposed method, we can effectively simulate the mixed train schedule on a rail line. The numerical results demonstrate that an appropriate decrease of the departure interval can enhance the capacity, and a suitable increase of the distance between two adjacent stations can enhance the average speed. Meanwhile, the capacity and the average speed will be increased by appropriately enhancing the ratio of faster train number to slower train number from 1.     

Community detection in social networks based on improved Label Propagation Algorithm and balanced link density

Nowadays, community detection has been raised as one of the key research areas in the online social networks mining. One of the most common algorithms in this field is label propagation algorithm (LPA). Even though the LPA method has advantages such as simplicity in understanding and implementation, as well as linear time complexity, it has an important disadvantage of the uncertainty and instability in outcomes, that is, the algorithm detects and reports different combinations of communities in each run. This problem originates from the nature of random selection in the LPA method. In this paper, a novel method is proposed based on the LPA method and the inherent structure, that is, link density feature, of the input network. The proposed method uses a sensitivity parameter (balance parameter); by choosing the appropriate values for it, the desired qualities of the identified communities can be achieved. The proposed method is called Balanced Link Density-based Label Propagation (BLDLP). In comparison with the basic LPA, the proposed method has an advantage of certainty and stability in the output results, whereas its time complexity is still comparable with the basic LPA and of course lowers than many other approaches. The proposed method has been evaluated on real-world known datasets, such as the Facebook social network and American football clubs, and by comparing it with the basic LPA, the effectiveness of the proposed method in terms of the quality of the communities found and the time complexity has been shown.     

Efficient overlapping community detection in huge real-world networks

The detection of overlapping community structure in networks can give insight into the structures and functions of many complex systems. In this paper, we propose a simple but efficient overlapping community detection method for very large real-world networks. Taking a high-quality, non-overlapping partition generated by existing, efficient, non-overlapping community detection methods as input, our method identifies overlapping nodes between each pair of connected non-overlapping communities in turn. Through our analysis on modularity, we deduce that, to become an overlapping node without demolishing modularity, nodes should satisfy a specific condition presented in this paper. The proposed algorithm outputs high quality overlapping communities by efficiently identifying overlapping nodes that satisfy the above condition. Experiments on synthetic and real-world networks show that in most cases our method is better than other algorithms either in the quality of results or the computational performance. In some cases, our method is the only one that can produce overlapping communities in the very large real-world networks used in the experiments.     

A thermal flux-diffusing model for complex networks and its applications in community structure detection

We introduce a thermal flux-diffusing model for complex networks. Based on this model, we propose a physical method to detect the communities in the complex networks. The method allows us to obtain the temperature distribution of nodes in time that scales linearly with the network size. Then, the local community enclosing a given node can be easily detected for the reason that the dense connections in the local communities lead to the temperatures of nodes in the same community being close to each other. The community structure of a network can be recursively detected by randomly choosing the nodes outside the detected local communities. In the experiments, we apply our method to a set of benchmarking networks with known pre-determined community structures. The experiment results show that our method has higher accuracy and precision than most existing globe methods and is better than the other existing local methods in the selection of the initial node. Finally, several real-world networks are investigated.     

加权网络权重自相似评判函数及其社团结构检测

提出了权重自相似性加权网络社团结构评判函数,并基于该函数提出一种谱分析算法检测社团结构,结果表明算法能将加权网络划分为同一社团内边权值分布均匀,而社团间边权值分布随机的社团结构.通过建立具有社团结构的加权随机网络分析了该算法的准确性,与WEO和WGN算法相比,在评判权重自相似的阈值系数取较小时,该算法具有较高的准确性.对于一个具有n个节点和c个社团的加权网络,社团结构检测的复杂度为O(cn2/2).通过设置评判权重自相似的阈值系数,可检测出能反映节点联系稳定性的层化性社团结构.这与传统意义上只将加权网络划分为社团中边权值较大而社团间边权值较小的标准不同,从另一个角度更好地提取了加权网络的结构信息.     

A weight’s agglomerative method for detecting communities in weighted networks based on weight’s similarity

This paper proposes the new definition of the community structure of the weighted networks that groups of nodes in which the edge's weights distribute uniformly but at random between them. It can describe the steady connections between nodes or some similarity between nodes' functions effectively. In order to detect the community structure efficiently, a threshold coefficient κ to evaluate the equivalence of edges' weights and a new weighted modularity based on the weight's similarity are proposed. Then, constructing the weighted matrix and using the agglomerative mechanism, it presents a weight's agglomerative method based on optimizing the modularity to detect communities. For a network with n nodes, the algorithm can detect the community structure in time O(n²log₂ⁿ). Simulations on networks show that the algorithm has higher accuracy and precision than the existing techniques. Furthermore, with the change of κ the algorithm discovers a special hierarchical organization which can describe the various steady connections between nodes in groups.     

Community detection based on the “clumpiness” matrix in complex networks

The “clumpiness” matrix of a network is used to develop a method to identify its community structure. A “projection space” is constructed from the eigenvectors of the clumpiness matrix and a border line is defined using some kind of angular distance in this space. The community structure of the network is identified using this borderline and/or hierarchical clustering methods. The performance of our algorithm is tested on some computer-generated and real-world networks. The accuracy of the results is checked using normalized mutual information. The effect of community size heterogeneity on the accuracy of the method is also discussed.     

Generating weighted community networks based on local events

Many realistic networks have community structures, namely, a network consists of groups of nodes within which links are dense but among which links are sparse. This paper proposes a growing network model based on local processes, the addition of new nodes intra-community and new links intra- or inter-community. Also, it utilizes the preferential attachment for building connections determined by nodes' strengths, which evolves dynamically during the growth of the system. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths.     

基于混沌神经网络的盲检测改进新算法

针对Hopfield神经网络的多起点问题,提出了一种新的基于混沌神经网络的盲信号检测算法,实现了二进制移相键控信号盲检测.据此进一步提出双sigmoid混沌神经网络模型,构造了新的能量函数,且证明了该模型的稳定性,并对网络参数进行配置.仿真实验表明:混沌神经网络能够避免局部极小点且具备较强的抗噪性能,双sigmoid混沌神经网络则继承了其所有的优点,且其收敛速度更快,仅需更短的接收数据即可到达全局真实平衡点,从而降低了算法的计算复杂度,减少了运行时间.     

Detecting local community structures in complex networks based on local degree central nodes

Detecting local communities in real-world graphs such as large social networks, web graphs, and biological networks has received a great deal of attention because obtaining complete information from a large network is still difficult and unrealistic nowadays. In this paper, we define the term local degree central node whose degree is greater than or equal to the degree of its neighbor nodes. A new method based on the local degree central node to detect the local community is proposed. In our method, the local community is not discovered from the given starting node, but from the local degree central node that is associated with the given starting node. Experiments show that the local central nodes are key nodes of communities in complex networks and the local communities detected by our method have high accuracy. Our algorithm can discover local communities accurately for more nodes and is an effective method to explore community structures of large networks.     

Critical phenomena in discrete-time interconnection networks

We present theoretical and numerical results for the performance of a multiprocessor network modeled as a ring and as a toroidal square lattice of nodes with local processors that generate messages for output ports/buffers. The output buffers are assumed to have infinite capacity, and the service time is deterministic. Two models are considered. One assumes that every processor generates messages with rate λ per time slot and per output port/buffer. The other model considers that the generation rate of a node depends on the intensity of the flow of arriving messages. Explicit expressions for the distribution of queue lengths, the average number of messages in the buffers, the average latency, and the critical network load depending on the distance between the source and the destination are obtained. Simulation results show excellent agreement with theoretical predictions based on the assumption of independent queues.     

Overlapping community detection using a generative model for networks

Detecting overlapping communities is a challenging task in analyzing networks, where nodes may belong to more than one community. Many present methods optimize quality functions to extract the communities from a network. In this paper, we present a probabilistic method for detecting overlapping communities using a generative model. The model describes the probability of generating a network with the model parameters, which reflect the communities in the network. The community memberships of each node are determined based on a probabilistic approach using those model parameters, whose values can be obtained by fitting the model to the network. This method has the advantage that the node participation degrees in each community are also computed. The proposed method is compared with some other community detection methods on both synthetic networks and real-world networks. The experiments show that this method is efficient at detecting overlapping communities and can provide better performance on the networks where a majority of nodes belong to more than one community.     

Emergent collective behaviors on coopetition networks

Cooperation and competition are two typical interactional relationships for intra-networks and inter-networks. This paper investigates the modeling of coopetition networks and the collective dynamics on such networks. The coopetition networks are firstly modeled by directed signed graphs. The evolutionary relationships among individuals on the coopetition networks are described by a neighbor-based dynamics model, which is also called multi-agent system (MAS). Then, under a weak connectivity assumption that the signed network has a spanning tree, some sufficient conditions are derived for the consensus, polarization or fragmentation behaviors of the MAS with the help of the structural balance theory. At the same time, signless Laplacian matrix and signed Laplacian matrix are introduced to analyze the collective dynamics of the MAS on coopetition networks. Finally, simulation results are provided to demonstrate the emergence of diverse collective behaviors on coopetition networks.     

Overlapping Community Detection Based on Attribute Augmented Graph

There is a wealth of information in real-world social networks. In addition to the topology information, the vertices or edges of a social network often have attributes, with many of the overlapping vertices belonging to several communities simultaneously. It is challenging to fully utilize the additional attribute information to detect overlapping communities. In this paper, we first propose an overlapping community detection algorithm based on an augmented attribute graph. An improved weight adjustment strategy for attributes is embedded in the algorithm to help detect overlapping communities more accurately. Second, we enhance the algorithm to automatically determine the number of communities by a node-density-based fuzzy k-medoids process. Extensive experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively detect overlapping communities with fewer parameters compared to the baseline methods.     

On learning and energy-entropy dependence in recurrent and nonrecurrent signed networks

Learning of patterns by neural networks obeying general rules of sensory transduction and of converting membrane potentials to spiking frequencies is considered. Any finite number of cellsA can sample a pattern playing on any finite number of cells without causing irrevocable sampling bias ifA = orA =. Total energy transfer from inputs ofA to outputs of depends on the entropy of the input distribution. Pattern completion on recall trials can occur without destroying perfect memory even ifA = by choosing the signal thresholds sufficiently large. The mathematical results are global limit and oscillation theorems for a class of nonlinear functional-differential systems.The preparation of this work was supported in part by the National Science Foundation (GP 9003), the Office of Naval Research (N00014-67-A-024-OQ16), and the A.P. Sloan Foundation.     

Community detection in complex networks by density-based clustering

We proposed a method to find the community structure in a complex network by density-based clustering. Physical topological distance is introduced in density-based clustering for determining a distance function of specific influence functions. According to the distribution of the data, the community structures are uncovered. The method keeps a better connection mode of the community structure than the existing algorithms in terms of modularity, which can be viewed as a basic characteristic of community detection in the future. Moreover, experimental results indicate that the proposed method is efficient and effective to be used for community detection of medium and large networks.     

Coverage performance analysis of multi-camera networks based on observing reliability model

Coverage control is a fundamental problem in sensor networks, which has been explored thoroughly based on a traditional scalar sensing model. However, camera sensors are different from traditional scalar sensors as different cameras from different positions can form distinct views of the target. Hence, Target size and geometric structure of camera nodes can greatly influence the surveillance ability of a camera network. In view of this, a novel observation reliability model of a camera network is proposed, and relationship between surveillance ability and observing reliability for the target is studied. On the basis, a camera network coverage model which considers about obstacles and interesting area of the environment is investigated, and optimized by dynamic planning method. Simulation results show that our method can effectively improve the target capture rate of the network and also we can observe the target from a better view.     

Anticontrol of chaos for discrete-time fuzzy hyperbolic model with uncertain parameters

This paper proposes a new method to chaotify the discrete-time fuzzy hyperbolic model （DFHM） with uncertain parameters. A simple nonlinear state feedback controller is designed for this purpose. By revised Marotto theorem, it is proven that the chaos generated by this controller satisfies the Li-Yorke definition. An example is presented to demonstrate the effectiveness of the approach.