A general information integrating and sharing architecture is discussed, the components of the architecture are put forward, a data integrating method based on distributed data warehouse together with a information sh...
详细信息
A general information integrating and sharing architecture is discussed, the components of the architecture are put forward, a data integrating method based on distributed data warehouse together with a information sharing and multilevel serving method are specially described, the realization of the system is also presented.
As a distributed process calculus with localities and mobility of computational entities, Seal calculus is playing an important role in expressing key features such as security and mobility of Internet programming dir...
详细信息
ISBN:
(纸本)9780387446394
As a distributed process calculus with localities and mobility of computational entities, Seal calculus is playing an important role in expressing key features such as security and mobility of Internet programming directly. However, little implementation technique proposed for the calculus, partly due to the complication of inobile computation, which fusions three important techniques: concurrency, distribution and mobility at the same time. The abstract machine PSN for a distributed implementation of the Seal calculus is presented. In PSN the logical structure of a seal system and its physical distribution are separated which induces a more simple and clear implementation. Moreover, an operational semantics description of the Seal calculus based on PSN is given.
Classification and regression are most interesting problems in the fields of pattern recognition. The regression problem can be changed into binary classification problem and least squares support vector machine can b...
详细信息
A novel dynamic time delay neural network is proposed for ultrasonic motors identification and control in this paper. By introducing time delay neurons, the neural network identifier and controller of ultrasonic motor...
详细信息
In order to make 3D model representing Pinus Massoniana more realistic, field investigation and measurements were conducted in Wuyi Plantation in Zhangping City, Fujian Province, P.R. china. We measured parameters cha...
详细信息
In order to make 3D model representing Pinus Massoniana more realistic, field investigation and measurements were conducted in Wuyi Plantation in Zhangping City, Fujian Province, P.R. china. We measured parameters characteristic of Pinus Massoniana aerial architecture, then analyzed and quantified relationship between plant components and growth law. Based on the local-to-global model, the tree was decomposed into three components: a main trunk, several levels of brunches and leaves. We used above derived parameters to depict the structure and shape characteristics of Pinus Massoniana. Combined with polyhedron geometric modeling and parameterized procedural modeling, a parameterized procedural tree model is given with a hybrid representation method. Implementation of the interactive modeling tool was written in Visual C++, using OpenGL libraries. The model could reconstruct Pinus Massoniana at different ages by modifying parameters. And the same time, the 3D Pinus Massoniana scene was constructed by populating tree models in the digital elevation model.
An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antib...
详细信息
An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antibody's fitness and setting the dynamic threshold value. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance for preventing premature convergence.
Load balancing is a key issue in large-scale Object-Based Storage Systems. Many data replication and migration algorithms have been proposed for load balancing in distributed systems. However, the two operations, data...
详细信息
Load balancing is a key issue in large-scale Object-Based Storage Systems. Many data replication and migration algorithms have been proposed for load balancing in distributed systems. However, the two operations, data replication and migration, are studied separately. An adaptive load balancing algorithm is presented in this paper, which combines replication and migration in a uniform ***, this algorithm uses a hybrid load metric which reflects short-term and long-term load status. To solve the online problem with a changing workload, the algorithm employs an adaptive mechanism to keep track of the characteristics of workloads. The simulation results show that the algorithm with object replication and migration can markedly reduce the overall response time
Order-k Markov model can be used in many fields such as natural language understanding, coding, mobile path prediction and so on to make prediction and then control. But the model has to face the problem of state spac...
详细信息
Order-k Markov model can be used in many fields such as natural language understanding, coding, mobile path prediction and so on to make prediction and then control. But the model has to face the problem of state space expansion. Taking the mobile path prediction as the research background, the paper firstly proposes a step-k Markov model and validates its feasibility. Secondly, a hybrid Markov predictor model is put forward based on the step-k Markov model. The complexity of the hybrid Markov model is O(N) while the order-k Markov model is O(N 2 ). And the memory demand of the hybrid Markov model is O(N 2 ) while order-k Markov model is O(N 3 ). Finally, it is proved that the hybrid Markov predictor can get close performance with order-k Markov predictor at much lower expense by conditional entropy analysis and user mobility data analysis. Also it can alleviate the zero probability problem in order-k Markov model to some extent. The hybrid Markov predictor is more practical than order-k Markov predictor under WLAN
Within high performance backup/restore environment there are cases that require the retrieval of massive data with huge size from tape storage to disks. The data retrieval time affects the system utilization or the sy...
详细信息
Within high performance backup/restore environment there are cases that require the retrieval of massive data with huge size from tape storage to disks. The data retrieval time affects the system utilization or the system recovering speed. Some schemes were/will be proposed to place data across tape drives for minimized data retrieval latency. SimTape, a Java-based tape library simulator, is built to compare above mentioned allocation schemes which minimize data seek time and tape switch time respectively. This paper describes the development and application of SimTape's software simulation model, also, for the design and optimization of the record, readout and data recovery processes common to all existing tape library processes. The simulation model provides an accurate statistical report from which each scenario can be evaluated
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve...
详细信息
Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: genetic algorithm (GA) and particle swarm optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast saccharomyces cerevisiae transcription factor binding sites and CRP binding sites. The results on saccharomyces cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs sampler
暂无评论