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
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.
The complex mapping z ← zα is important in dynamical application, but it is not received as much attention in the literature as the mapping z ← zα+c, for there is not fractal structure by using escape time algorit...
详细信息
In this paper, we investigate the deficiency of Goyal and Egenhofer's method for modeling cardinal directional relations between simple regions and provide the computational model based on the concept of mathemati...
详细信息
This paper deals with minimal multivariate rational interpolation. We discuss how to choose the minimal interpolation bases for given interpolation nodes, give out the existence conditions of the multivariate rational...
详细信息
This paper deals with minimal multivariate rational interpolation. We discuss how to choose the minimal interpolation bases for given interpolation nodes, give out the existence conditions of the multivariate rational interpolation function and construct the relative rational function as it exists. Furthermore, we point out that for pairwise different interpolation nodes the multivariate rational interpolation function exists for almost all interpolation data.
A novel structure learning algorithm for fuzzy neural networks (SLNN) is presented in this paper. The neurons of SLNN are created and adapted as online learning proceeds. The learning rule of SLNN is based on Hebbian ...
详细信息
A novel structure learning algorithm for fuzzy neural networks (SLNN) is presented in this paper. The neurons of SLNN are created and adapted as online learning proceeds. The learning rule of SLNN is based on Hebbian learning and a kernel winner-take-all algorithm - KWTA. KWTA not only can let SLNN be able to learn from new data but also can prevent losing the knowledge which has been learned earlier. To obtain a concise fuzzy rule, a pruning algorithm is adopted in SLNN which doesn't disobey the basic design philosophy of fuzzy system. Simulations are performed on the primary benchmark: circle-in-the-square. Comparison with ARTMAP and BP neural network indicates that better performance is achieved
The diameter protocol is recommended by IETF as AAA (authentication, authorization and accounting) protocol criterion for the next generation network. Because the IPv6 protocol will be widely applied in the intending ...
详细信息
The diameter protocol is recommended by IETF as AAA (authentication, authorization and accounting) protocol criterion for the next generation network. Because the IPv6 protocol will be widely applied in the intending all-IP network, mobile IPv6 application based on diameter protocol will play more important role in authentication, authorization and accounting. In this paper, the implementation of mobile node's authentication and authorization is presented with PANA (protocol for carrying authentication for network access) protocol. It is based on diameter protocol for the application expansion of mobile IPv6, which provides the supports to the basic AAA process of mobile IPv6 nodes and dynamic home agent distribution in the visited network and the secret key distribution. Finally, the correctness of this application expansion is testified with developing the design of protocol based on opendiameter
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...
详细信息
ISBN:
(纸本)0769525288
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.
Newton's algorithm for constructing univariate interpolation polynomial is well-known. In this paper, we generalize Newton's formula to multivariate Lagrange interpolation. For some type of subset ΧL, so-call...
详细信息
Newton's algorithm for constructing univariate interpolation polynomial is well-known. In this paper, we generalize Newton's formula to multivariate Lagrange interpolation. For some type of subset ΧL, so-called lower subset, of a tensor product grid, we present directly an interpolation basis of Newton type which spans a minimal degree interpolation space for Lagrange interpolation on ΧL. We show that this basis is always a Newton interpolation basis for arbitrary ordered set of point evaluation functionals.
To improve artificial intelligence (AI) of computer games is a hard problem. Qualitative spatial reasoning is utilized to solve this problem. In qualitative spatial reasoning various aspects of qualitative spatial rea...
详细信息
To improve artificial intelligence (AI) of computer games is a hard problem. Qualitative spatial reasoning is utilized to solve this problem. In qualitative spatial reasoning various aspects of qualitative spatial reasoning such as topology, direction, size and distance have been widely investigated in pervious literatures. Although, the combination works of two or more spatial aspects are more useful than the single one in computer game and other applications, most combining problems have not been discussed before. So a unified model for qualitative topology and distance information is proposed. Finally this method is applied to strategy computer games.
暂无评论