Adaptive Control of the Structural Balance for a Class of Complex Dynamical Networks

In social networks,the structural balance is a state of a group of individuals(nodes)with established mutual relationships(connection relationships)between them.It is easy to see that a social network can be described by a complex dynamical network model composed of the nodes subsystem(NS)and the connection relationships subsystem(CS),where the two subsystems are usually coupled with each other.It implies that the dynamic changes of nodes'states may cause the structural balance in CS.However,few papers have discussed the relationship between the structural balance and the specific dynamic changes of the nodes'states.This paper proposes a model of complex dynamical networks,and mainly focuses on the dynamic changes of states in NS which can lead to the structural balance in CS.It is proved that if each state in NS is doing a specific dynamic motion via the controller with the parameter adaptive law,then the CS can track a given structural balance matrix via the effective coupling and the structural balance can be achieved.Such a result can be regarded as an explanation of the relationship between the structural balance and the specific dynamic changes of the nodes'states.Finally,the simulations verify the effectiveness of the proposed method.

A New Method Based on Evolutionary Algorithm for Symbolic Network Weak Unbalance

The symbolic network adds the emotional information of the relationship,that is,the“+”and“-”information of the edge,which greatly enhances the modeling ability and has wide application in many fields.Weak unbalance is an important indicator to measure the network tension.This paper starts from the weak structural equilibrium theorem,and integrates the work of predecessors,and proposes the weak unbalanced algorithm EAWSB based on evolutionary algorithm.Experiments on the large symbolic networks Epinions,Slashdot and WikiElections show the effectiveness and efficiency of the proposed method.In EAWSB,this paper proposes a compression-based indirect representation method,which effectively reduces the size of the genotype space,thus making the algorithm search more complete and easier to get better solutions.

The Tension Balance Structure of China's Human Rights Development Path

The human rights white paper has in it the basic concepts of human rights,the form of the human rights system,and the mode of human rights practice in modern China.It is based on the tension balance structure between the historical feature and rationality,the cultural feature and similarity,the realistic feature and the common feature of human rights.Adhering to the historical nature of human rights rather than abstract rationality,and the cultural diversity and equality of human rights rather than one dominant model,and the particularity of human rights rather than universality is the pillar of China’s human rights philosophy,system,and practice.The human rights development path that combines the top-down leadership of China’s ruling party,the capability of the Chinese government in taking a holistic approach and the bottom-up driving force of the people is very different from the natural evolution path of the West.

Enhancing Navigability:An Algorithm for Constructing Tag Trees

Purpose： This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach： Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features：（1） the ancestors should be more representative than the descendants,（2） the semantic meaning along the ancestor-descendant paths needs to be coherent,（3） the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and（4） tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings： The proposed algorithm has been compared with a well-established solution Heymann Tag Tree（HTT）. The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project（ODP） classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations： A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications： The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value： Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold：（1） an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and（2） the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.

Investigation of the genetic etiology in male infertility with apparently balanced chromosomal structural rearrangements by genome sequencing

Apparently balanced chromosomal structural rearrangements are known to cause male infertility and account for approximately 1%of azoospermia or severe oligospermia.However,the underlying mechanisms of pathogenesis and etiologies are still largely unknown.Herein,we investigated apparently balanced interchromosomal structural rearrangements in six cases with azoospermia/severe oligospermia to comprehensively identify and delineate cryptic structural rearrangements and the related copy number variants.In addition,high read-depth genome sequencing(GS)(30-fold)was performed to investigate point mutations causative of male infertility.Mate-pair GS(4-fold)revealed additional structural rearrangements and/or copy number changes in 5 of 6 cases and detected a total of 48 rearrangements.Overall,the breakpoints caused truncations of 30 RefSeq genes,five of which were associated with spermatogenesis.Furthermore,the breakpoints disrupted 43 topological-associated domains.Direct disruptions or potential dysregulations of genes,which play potential roles in male germ cell development,apoptosis,and spermatogenesis,were found in all cases(n=6).In addition,high read-depth GS detected dual molecular findings in case MI6,involving a complex rearrangement and two point mutations in the gene DNAH1.Overall,our study provided the molecular characteristics of apparently balanced interchromosomal structural rearrangements in patients with male infertility.We demonstrated the complexity of chromosomal structural rearrangements,potential gene disruptions/dysregulation and single-gene mutations could be the contributing mechanisms underlie male infertility.

Dynamic Balancing Structure Optimal Design for the Rotating Arc Sensor

Rotating arc sensor is a key device for automation welding. The vibration has a big influence on signal's correct collection and reliable automatic welding. In order to solve the vibration problem and the dynamic balancing design with the restricted space,a bearing force analysis based dynamic balancing structure optimal design is proposed and implemented with the help of Pro/Engineer( PROE) and automatic dynamic analysis of mechanical systems( ADAMS) virtual prototype technology, in which three parameters of the counterbalance are considered. The method is suitable for the practical online adjustment. The simulation result shows that optimal design based counterbalance structure and parameters can satisfy the space requirement with lower vibration. The methodology provides a new idea for dynamic balancing design and adjustment of rotating arc sensor with adjustable rotation radius.

Structure Balance and Opinions Dynamic in Signed Social Network

In this paper,the authors consider both the nodes’opinions dynamics and signed network edges’evolution.Simulated Annealing Algorithm is applied for searching the minimal global energy function,and bounded confidence model is used for nodes’opinions updating.The authors find that the local and global level of balance of signed network is consistent with collective opinions 2-polarization.This property is explainable in terms of the structure balance of the sign distributions on the nodes and edges.The level of balance and the final opinions polarization pattern are achieved depends on the initial density of signed network,and the percentage of initial positive edges.Numerical simulations of the proposed model display a rich and intuitive behavior of the opinions polarization processes.In particular,the authors show that opinions persistent fluctuations is consistent with minimal global the energy function.This work verify that signed social networks are indeed limited balanced,could be used to explain ubiquitous binary polarization phenomenon of real world.

Event-triggered bipartite consensus over cooperation-competition networks under DoS attacks

This paper addresses the bipartite consensus over cooperation-competition networks affected by denial-of-service(DoS) attacks.Consider that a network consists of multiple interactive agents, and the relationship between neighboring agents is cooperative or competitive. Meanwhile, information transmission among the agents is unavailable during the intervals of attacks. In order to save communication resources and exclude the Zeno behavior, an event-triggered scheme depending on the sampled-data information from neighboring agents is proposed, and efficient defense strategies in response to the attacks are put forward.Suppose that the frequency and duration of DoS attacks meet certain requirements, then according to the signed graph theory,the La Salle’s invariance principle, and the convergence of monotone sequences, the results of bipartite consensus via the eventtriggered protocol are provided, which are mainly related to the communication topology of the network, the sampling period,and the threshold parameters in the event-triggered scheme. It is shown that the bipartite consensus is realized even though the DoS attacks take place frequently. Furthermore, this paper discusses the bipartite consensus in the presence of DoS attacks with a random unsuccessful rate. Finally, numerical simulations illustrate the theoretical results.

The Dynamics of Two-State Public Opinion Propagation On Signed Networks

The formation of public opinion on the network is a hot issue in the field of complex network research, and some classical dynamic models are used to solve this problem. The signed network is a particular form of the complex network, which can adequately describe the amicable and hostile relationships in complex real-world systems. However, the methods for studying the dynamic process of public opinion propagation on signed networks still require to be further discussed. In this paper, the authors pay attention to the influence of negative edges in order to design a two-state public opinion propagation mechanism suitable for signed networks. The authors first set the interaction rules between nodes and the transition rules of node states and then apply the model to synthetic and real-world signed networks. The simulation results show that there is a critical value of the negative edge ratio.When the negative edge ratio exceeds this critical value, the evolutionary result of public opinion will change from a consistent state to a split state. This conclusion is also consistent with the distribution result of opinions within communities in the signed network. Besides, the research on the network structural balance shows that the model makes the network evolve in a more balanced direction.

Bipartite Consensus of Linear Multi-Agent Systems by Distributed Event-Triggered Control

For multi-agent systems with competitive and collaborative relationships,signed graph can more intuitively express the characteristics of their interactive networks.In this paper,the bipartite consensus is investigated for multi-agent systems with structurally balanced signed graph.In order to reduce actuation burden in dynamical network environment,the event-triggering strategy is applied to bipartite consensus protocol for the multi-agent systems.The triggered condition for each agent is designed by using its own information and transmitted information of its neighbors at sampling instant and make the number of triggers of the whole systems be reduced.Based on the distributed eventtriggered control,some sufficient conditions are derived to guarantee the leaderless and leader-following bipartite consensus.Finally,some numerical examples are shown to demonstrate the effectiveness of the theoretical results.