In planar linkage mechanisms,when dimensions of the mechanisms and one position of inputlink are given,there are,in general,two or more corresponding positions of output link even withthe dimensions of all links uncha...In planar linkage mechanisms,when dimensions of the mechanisms and one position of inputlink are given,there are,in general,two or more corresponding positions of output link even withthe dimensions of all links unchangable.So,prior to the analysis and synthesis of the mechanisms,we should determine the necessary assembling position.This paper presents a method to solve thisproblem for a sort of planar linkage mechanisms and provides a very simple rule for pivot four-barlinkage mechanism.展开更多
In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a no...In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a node community can be defined as a subgraph induced by a set of nodes, while a link community is a subgraph induced by a set of links. Although most researches pay more attention to identifying node communities in both unipartite and bipartite networks, some researchers have investigated the link community detection problem in unipartite networks. But current research pays little attention to the link community detection problem in bipartite networks. In this paper, we investigate the link community detection problem in bipartite networks, and formulate it into an integer programming model. We proposed a genetic algorithm for partition the bipartite network into overlapping link communities. Simulations are done on both artificial networks and real-world networks. The results show that the bipartite network can be efficiently partitioned into overlapping link communities by the genetic algorithm.展开更多
文摘In planar linkage mechanisms,when dimensions of the mechanisms and one position of inputlink are given,there are,in general,two or more corresponding positions of output link even withthe dimensions of all links unchangable.So,prior to the analysis and synthesis of the mechanisms,we should determine the necessary assembling position.This paper presents a method to solve thisproblem for a sort of planar linkage mechanisms and provides a very simple rule for pivot four-barlinkage mechanism.
文摘In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a node community can be defined as a subgraph induced by a set of nodes, while a link community is a subgraph induced by a set of links. Although most researches pay more attention to identifying node communities in both unipartite and bipartite networks, some researchers have investigated the link community detection problem in unipartite networks. But current research pays little attention to the link community detection problem in bipartite networks. In this paper, we investigate the link community detection problem in bipartite networks, and formulate it into an integer programming model. We proposed a genetic algorithm for partition the bipartite network into overlapping link communities. Simulations are done on both artificial networks and real-world networks. The results show that the bipartite network can be efficiently partitioned into overlapping link communities by the genetic algorithm.
