The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditiona...The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME （Ad Hoc Distributed Mutual Exclusion）; it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport＇s timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.展开更多
This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fau...This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.展开更多
Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A s...Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A simple approximate theory and extensive Monte Carlo computer simulations were used to calculate the steady-state phase diagrams and bulk densities. It is found that the phase diagram for local inhomogeneity in TASEP with different hopping rates p is qualitatively similar to homogeneous models. Interestingly, there is a saturation point pair （a＊, fl＊） for the system, which is decided by parameters p and q. There are three stationary phases in the system, when parameter p is fixed （i.e., p=0.8）, with the increase of the parameter q, the region of LD/LD and HD/HD phase increases and the HD/LD is the only phase which the region shrinks. The analytical results are in good agreement with simulations.展开更多
近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive wri...近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive write)模型,采用波前式并行推进的方法直接计算编辑距离矩阵D,设计了一个允许k-差别的近似串匹配动态规划并行算法,该算法使用(m+1)个处理器,时间复杂度为O(n),算法理论上达到线性加速;采取水平和斜向双并行计算编辑距离矩阵D的方法,设计了一个使用a(m+1)个处理器和O(n/a+m)时间的、可伸缩的、允许k-差别的近似串匹配动态规划并行算法,+<11mna.基于分治策略,通过灵活拆分总线和合并子总线动态重构光总线系统,并充分利用光总线的消息播送技术和并行计算前缀和的方法,实现了汉明距离的并行计算,设计了两个基于LARPBS(linear arrays with reconfigurable pipelined bus system)模型的通信高效、可扩放的允许k-误配的近似串匹配并行算法,其中一个算法使用n个处理器,时间为O(m);另一个为常数时间算法,使用mn个处理器.展开更多
In order to increase the expression of mdrl genetransfectcd using retroviral vcctors, we constructedtwo retroviral vectors (LmdrlSN and MSCV-mdrl)containing mdrl cDNA and compared the expressionof mdrl gene with anoth...In order to increase the expression of mdrl genetransfectcd using retroviral vcctors, we constructedtwo retroviral vectors (LmdrlSN and MSCV-mdrl)containing mdrl cDNA and compared the expressionof mdrl gene with another vector pHamdrl/A(Pastan et al. Proc Natl Acad Sci USA 85: 4486,1986) in NIH.3T3 cells. The LmdrlSN was made展开更多
基金the Application Fundamental Research Foundation of Sichuan Province, China(04JY029-017-2)the Innovation Fund for Small Technology-based Firms China(04JY029-017-2)
文摘The solution of distributed mutual exclusion is difficult in Ad hoc networks owing to dynamic topologies and mobility. Based on the analysis of the properties of Ad hoc networks and the disadvantages of the traditional algorithms, an improved Ad hoc system model was given and a novel algorithm was presented as AHDME （Ad Hoc Distributed Mutual Exclusion）; it was based on the token-asking algorithms. It utilized broadcast to search for the token and to decrease the message complexity of multi-hop Ad hoc networks. Lamport＇s timestamp was improved to ensure the time sequence and to prevent nodes from starvation. When compared to traditional algorithms, AHDME does not require the fixed size of request queues and the global system information, which adapts itself to the frequent arrival/departures and the limited computing capability of nodes in Ad hoc networks. Performance analysis and simulation results show that the AHDME algorithm has low message complexity, small space complexity, and short response delay.
基金supported by the National Natural Science Foundation of China(61473144)
文摘This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified.
基金Project(2011FZ050) supported by Applied Basic Research Program of Yunnan Provincial Science and Technology Department,ChinaProject(2011J084) supported by Master Program of Yunnan Province Education Department,China
文摘Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A simple approximate theory and extensive Monte Carlo computer simulations were used to calculate the steady-state phase diagrams and bulk densities. It is found that the phase diagram for local inhomogeneity in TASEP with different hopping rates p is qualitatively similar to homogeneous models. Interestingly, there is a saturation point pair （a＊, fl＊） for the system, which is decided by parameters p and q. There are three stationary phases in the system, when parameter p is fixed （i.e., p=0.8）, with the increase of the parameter q, the region of LD/LD and HD/HD phase increases and the HD/LD is the only phase which the region shrinks. The analytical results are in good agreement with simulations.
文摘近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive write)模型,采用波前式并行推进的方法直接计算编辑距离矩阵D,设计了一个允许k-差别的近似串匹配动态规划并行算法,该算法使用(m+1)个处理器,时间复杂度为O(n),算法理论上达到线性加速;采取水平和斜向双并行计算编辑距离矩阵D的方法,设计了一个使用a(m+1)个处理器和O(n/a+m)时间的、可伸缩的、允许k-差别的近似串匹配动态规划并行算法,+<11mna.基于分治策略,通过灵活拆分总线和合并子总线动态重构光总线系统,并充分利用光总线的消息播送技术和并行计算前缀和的方法,实现了汉明距离的并行计算,设计了两个基于LARPBS(linear arrays with reconfigurable pipelined bus system)模型的通信高效、可扩放的允许k-误配的近似串匹配并行算法,其中一个算法使用n个处理器,时间为O(m);另一个为常数时间算法,使用mn个处理器.
文摘In order to increase the expression of mdrl genetransfectcd using retroviral vcctors, we constructedtwo retroviral vectors (LmdrlSN and MSCV-mdrl)containing mdrl cDNA and compared the expressionof mdrl gene with another vector pHamdrl/A(Pastan et al. Proc Natl Acad Sci USA 85: 4486,1986) in NIH.3T3 cells. The LmdrlSN was made
