This paper analyzes the fuzzy variable structure control algorithms for delay systems and describes the compensation mechanism of the integral factor to the effect of the delay. Based on the linearized model of the co...This paper analyzes the fuzzy variable structure control algorithms for delay systems and describes the compensation mechanism of the integral factor to the effect of the delay. Based on the linearized model of the congestion-avoidance flow-control mode of transmission control protocol (TCP), we present delay control algorithms for active queue management (AQM) and discuss the parameter tuning of the algorithms. The NS (network simulator) simulation results show that the proposed control scheme for the nonlinear TCP/AQM model has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions. Compared to other similar schemes, our algorithms perform better in terms of packet loss ratio, throughput and butter fluctuation.展开更多
Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planch...Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly.展开更多
This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA ...This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA molecules are used as the storage structure of the queue, and the basic bio-operations over the queue are described. Furthermore, the comparison between the queue of the electronic computer and that of DNA-based computer are elucidated. To prove the feasibility of our work, nucleotide encodings for an instance of queue are given out. All the biological technology mentioned in this paper can be practically implemented in the laboratory. Based on this work, other data structures could be developed in DNA-based computer.展开更多
A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and ro...A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and robustness with respect to the uncertainties of the round-trip time and the number of active connections. Ns simulations results show that the proposed design significantly outperforms the peer AQM schemes in terms of fluctuation in the queue length, packet throughput, and loss ratio. The conclusion is that proposed scheme is in favor of the achievement to AQM objectives due to its good transient and steady performance.展开更多
文摘This paper analyzes the fuzzy variable structure control algorithms for delay systems and describes the compensation mechanism of the integral factor to the effect of the delay. Based on the linearized model of the congestion-avoidance flow-control mode of transmission control protocol (TCP), we present delay control algorithms for active queue management (AQM) and discuss the parameter tuning of the algorithms. The NS (network simulator) simulation results show that the proposed control scheme for the nonlinear TCP/AQM model has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions. Compared to other similar schemes, our algorithms perform better in terms of packet loss ratio, throughput and butter fluctuation.
基金financially supported by the National Basic Research Program of China (Grant No.2006CB400502)the Promotion of 100 Young Talent Scientist Project of the Chinese Acad-emy of Sciences (8-057493)the Special Meteorology Project(GYHY(QX)2007-6-1)
文摘Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly.
基金This work was supportedin part by the National Nature Science Foundation of China (No.60474037and60004006) Programfor NewCentury Excellent Talents in University (NCET04 415) +1 种基金Specialized Research Fund for the Doctoral Programof Higher Educationfrom Educational Committee of China (No.20030255009) the Youth Foundation fromEducational Committee of Anhui Province(No.2005jql043) .
文摘This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA molecules are used as the storage structure of the queue, and the basic bio-operations over the queue are described. Furthermore, the comparison between the queue of the electronic computer and that of DNA-based computer are elucidated. To prove the feasibility of our work, nucleotide encodings for an instance of queue are given out. All the biological technology mentioned in this paper can be practically implemented in the laboratory. Based on this work, other data structures could be developed in DNA-based computer.
文摘A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and robustness with respect to the uncertainties of the round-trip time and the number of active connections. Ns simulations results show that the proposed design significantly outperforms the peer AQM schemes in terms of fluctuation in the queue length, packet throughput, and loss ratio. The conclusion is that proposed scheme is in favor of the achievement to AQM objectives due to its good transient and steady performance.
