To conduct a systemic analysis of biological networks function distribution and function modules, we present a semiautomatic method to achieve independent and intact GO slim (InitGO) based on graph operations and GO h...
详细信息
To conduct a systemic analysis of biological networks function distribution and function modules, we present a semiautomatic method to achieve independent and intact GO slim (InitGO) based on graph operations and GO hierarchy structure. Our method is packed into a user-friendly Cytoscape plugin named InitGO. The application of InitGO to yeast transcriptional factors regulatory network shows that the network has function modularity, offering evidence that our method is effective for defining function modules. InitGO plugin and source codes are available on request from the authors.
It has been reported that function implementations in biological systems, including transcriptional regulatory networks (TRN), show modular architecture. Analyzing functional modularity of biological networks can desc...
详细信息
It has been reported that function implementations in biological systems, including transcriptional regulatory networks (TRN), show modular architecture. Analyzing functional modularity of biological networks can describe characteristics of function implementation and their "position" in biology systems from the systems perspective. Defining functional modules naturally, we bring up a novel measurement, cohesive degree (CD), to characterize the modularity. From this character, we know that not all of the corresponding modules of function annotations take on good modularity. Considering the ratio of the non-cohesive (zero-CD value) modules, TRN's functional modularity is also weaker than that of other biological network and integral ones. And, this is not caused by data integrity, but by the topology of itself. In fact, the modularity implementation of biological systems is mainly accomplished through the cooperation of several types of networks, not by TRN alonely.
To deal with the scalable and fast unbiased sampling problems in unstructured P2P systems, a sampling method based on multi-peer adaptive random walk (SMARW) is proposed. In the method, based on the multi-peer random ...
详细信息
The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is k...
详细信息
The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. We present firstly a technique founded on the use weapon cell, which enables one-to-many mapping about weapon-target to become one-to-one mapping. Next, we introduce a framework of solving the WTA problem. Based on this framework, an approximation algorithm that is grounded on the rules about weapon cells and targets is proposed. Finally, the simulative results show that the proposed algorithm indeed is very efficient.
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit...
详细信息
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.
The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based...
详细信息
The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, the update of key-attributes is separated from user update requests. key-Updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to the nodes having maximum or minimum latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including buffer preprocessing and update-log processing is applied to detect and reconcile conflicts, and then conflicts are solved by policies as last-writer-win and divide-and-rule. Lastly, update-log management method and maintenance method brought by node failure and network partitioning are discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency maintenance method, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.
Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This...
详细信息
Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This paper presents two means, stream partition (SP) and stream compression (SC), to optimize streams on Imagine. The results of simulation show that SP and SC can make stream applications take full advantage of the parallel clusters, pipelines and three-level memory hierarchy of the Imagine processor, and then reduce the execution time of stream programs.
In this paper, according to the resource management problems brought by a large number of replicas, a multi-replica clustering management method based on limited-coding is proposed. In this method, according to the pr...
详细信息
In this paper, according to the resource management problems brought by a large number of replicas, a multi-replica clustering management method based on limited-coding is proposed. In this method, according to the process of creating new replicas from existent single replica, replicas are partitioned into different hierarchies and clusters. Then replicas are coded and managed based on the user-defined limited-coding rule consisting of replica hierarchy and replica sequence, which can also dispose the alteration of clusters caused by dynamic adjustments on replicas (replica addition or replica removal) effectively. After that, a management model of centralization in local and peer to peer in wide area is adopted to organize replicas, and the cost of reconciling consistency can be greatly depressed combining with defined minimal-time of update propagation. The relevance between the coding rule and the number of replicas, and the solutions to replica failure and replica recover are discussed. The results of the performance evaluation show that the clustering method is an efficient way to manage a large number of replicas, achieving good scalability, not sensitive to moderate node failure, and adapting well to applications with frequent updates.
Data replication introduces well-known consistency issues. This paper puts forward the question about data dependence in data consistency, which embodies pseudo-conflict updates and update dependency. According to tha...
详细信息
暂无评论