Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a contr...Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.展开更多
New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given ra...New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.展开更多
This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the...This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the satellite orbit design and the orbit injection deviation are the causes for the initial shift velocity, whereas the atmospheric drag and the sun gravitational perturbation produce the shift acceleration. To deal with these shift factors, a shift control method is put forward, through such methods as orbit variation design, orbit altitude, and inclination keeping control. The simulation experiment and practical application have proved the effectiveness of this control method.展开更多
Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based...Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based on the authors' previous work,this paper proposes a receiver-controlled multi-node cooperation routing protocol,known as AODV-RCC. In this protocol,nodes form a cooperation group based on signal power. In a cooperation group,signal power between a partner and a transmitter,as well as signal power between the partner and the receiver,must be larger than the signal power between the transmitter and the receiver. Otherwise,the transmission will not benefit from cooperation. To avoid collision or congestion,each cooperation group only contains one partner. This partner offers both data and ACK cooperative retransmission. Its retransmission time should be shorter than the internal retry time of the transmitter's MAC layer,because it is better for the partner to retransmit firstly,as it offers a more reliable cooperative link. In AODV-RCC,it is the receiver that chooses the partner,because the link between the partner and the receiver is the most important. According to our simulation results,AODV-RCC shortens the end-to-end delay and increases the packet delivery ratio.展开更多
针对IEEE802.11e Medium Access Control层的QoS机制高负载时存在远端节点冲突和低优先级业务资源被耗尽的问题,提出在牺牲较小带宽的基础上增加一条忙音信道,取代CTS帧在数据信道上的广播,减少远端节点的冲突.仿真结果表明,该方案具有...针对IEEE802.11e Medium Access Control层的QoS机制高负载时存在远端节点冲突和低优先级业务资源被耗尽的问题,提出在牺牲较小带宽的基础上增加一条忙音信道,取代CTS帧在数据信道上的广播,减少远端节点的冲突.仿真结果表明,该方案具有较小的冲突概率,有效地减少了远端节点冲突.同时提出一个解决公平性问题的新思路:在避退时间发送忙音抢占信道,以期提高低优先级业务的接入概率.展开更多
This paper addresses the problem of the input design of large-scale complex networks.Two types of network components,redundant inaccessible strongly connected component(RISCC)and intermittent inaccessible strongly con...This paper addresses the problem of the input design of large-scale complex networks.Two types of network components,redundant inaccessible strongly connected component(RISCC)and intermittent inaccessible strongly connected component(IISCC)are defined,and a subnetwork called a driver network is developed.Based on these,an efficient method is proposed to find the minimum number of controlled nodes to achieve structural complete controllability of a network,in the case that each input can act on multiple state nodes.The range of the number of input nodes to achieve minimal control,and the configuration method(the connection between the input nodes and the controlled nodes)are presented.All possible input solutions can be obtained by this method.Moreover,we give an example and some experiments on real-world networks to illustrate the effectiveness of the method.展开更多
Version control is an urgent problem to be solved at present for data management. Based on the authors' hypertext data model with version control,some details about the storage strategy are discussed. A new strate...Version control is an urgent problem to be solved at present for data management. Based on the authors' hypertext data model with version control,some details about the storage strategy are discussed. A new strategy to define some key nodes within the version derivation graph is presented and some implementation details are described. At last, the performance of different strategies are compared with each other.展开更多
文摘Design of control strategies for gene regulatory networks is a challenging and important topic in systems biology. In this paper, the problem of finding both a minimum set of control nodes (control inputs) and a controller is studied. A control node corresponds to a gene that expression can be controlled. Here, a Boolean network is used as a model of gene regulatory networks, and control specifications on attractors, which represent cell types or states of cells, are imposed. It is important to design a gene regulatory network that has desired attractors and has no undesired attractors. Using a matrix-based representation of BNs, this problem can be rewritten as an integer linear programming problem. Finally, the proposed method is demonstrated by a numerical example on a WNT5A network, which is related to melanoma.
基金Supported by the National Natural Science Foundation of China(61402526,61502528)
文摘New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.
基金supported by the China Postdotoral Science Foundation(20060401004)
文摘This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the satellite orbit design and the orbit injection deviation are the causes for the initial shift velocity, whereas the atmospheric drag and the sun gravitational perturbation produce the shift acceleration. To deal with these shift factors, a shift control method is put forward, through such methods as orbit variation design, orbit altitude, and inclination keeping control. The simulation experiment and practical application have proved the effectiveness of this control method.
基金Sponsored by the Natural Scientific Research Innovation Foundation in Harbin Institute of Technology(Grant No.HIT.NSRIF.2013029)the National Science and Technology Major Project(Grant No.2012ZX03004003)+1 种基金the National Basic Research Development Program of China(973 Program)(Grant No.2013CB329003)the National Natural Science Foundation of China(Grant No.61201148 and No.61101123)
文摘Since wireless links in Ad hoc networks are more fragile than those in traditional wireless networks due to route flapping,multi-node cooperation plays an important role in ensuring the quality of service( QoS). Based on the authors' previous work,this paper proposes a receiver-controlled multi-node cooperation routing protocol,known as AODV-RCC. In this protocol,nodes form a cooperation group based on signal power. In a cooperation group,signal power between a partner and a transmitter,as well as signal power between the partner and the receiver,must be larger than the signal power between the transmitter and the receiver. Otherwise,the transmission will not benefit from cooperation. To avoid collision or congestion,each cooperation group only contains one partner. This partner offers both data and ACK cooperative retransmission. Its retransmission time should be shorter than the internal retry time of the transmitter's MAC layer,because it is better for the partner to retransmit firstly,as it offers a more reliable cooperative link. In AODV-RCC,it is the receiver that chooses the partner,because the link between the partner and the receiver is the most important. According to our simulation results,AODV-RCC shortens the end-to-end delay and increases the packet delivery ratio.
文摘针对IEEE802.11e Medium Access Control层的QoS机制高负载时存在远端节点冲突和低优先级业务资源被耗尽的问题,提出在牺牲较小带宽的基础上增加一条忙音信道,取代CTS帧在数据信道上的广播,减少远端节点的冲突.仿真结果表明,该方案具有较小的冲突概率,有效地减少了远端节点冲突.同时提出一个解决公平性问题的新思路:在避退时间发送忙音抢占信道,以期提高低优先级业务的接入概率.
基金supported in part by the National Natural Science Foundation of China(U1808205,62173079)the Natural Science Foundation of Hebei Province of China(F2000501005)。
文摘This paper addresses the problem of the input design of large-scale complex networks.Two types of network components,redundant inaccessible strongly connected component(RISCC)and intermittent inaccessible strongly connected component(IISCC)are defined,and a subnetwork called a driver network is developed.Based on these,an efficient method is proposed to find the minimum number of controlled nodes to achieve structural complete controllability of a network,in the case that each input can act on multiple state nodes.The range of the number of input nodes to achieve minimal control,and the configuration method(the connection between the input nodes and the controlled nodes)are presented.All possible input solutions can be obtained by this method.Moreover,we give an example and some experiments on real-world networks to illustrate the effectiveness of the method.
文摘Version control is an urgent problem to be solved at present for data management. Based on the authors' hypertext data model with version control,some details about the storage strategy are discussed. A new strategy to define some key nodes within the version derivation graph is presented and some implementation details are described. At last, the performance of different strategies are compared with each other.
