The traditional spatio-temporal database stores the quantitative data such as coordinate. But the qualitative information is more close to human thought and requires less storage space and process time. The previous q...
详细信息
The traditional spatio-temporal database stores the quantitative data such as coordinate. But the qualitative information is more close to human thought and requires less storage space and process time. The previous qualitative spatio-temporal systems were all prototype systems which did not support general spatio-temporal relation model and data input. We design the qualitative spatio-temporal database (QSTDB) based on spatio-temporal reasoning. A general spatio-temporal relation framework is put forward and applied to QSTDB. GML data can be converted to QSTDB as input. Thus QSTDB is compatible to most current spatio-temporal relation models and spatio-temporal *** can be applied to qualitative spatio-temporal query,spatio-temporal ontologies, spatio-temporal data mining and way finding systems etc..
Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution effici...
详细信息
Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution efficiency, while ignore the fact that the communication cost is also the bottleneck for improving query efficiency. We propose an asynchronous updating algorithm for continuous queries of moving objects. Three types of continuous range queries are discussed in the paper. Theoretical analysis and experiment results show that our algorithm substantially outperforms the traditional synchronous updating algorithms at aspects of monitoring accuracy, communication cost and CPU load balance
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user inter...
详细信息
We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.
Continuous queries for moving objects are becoming more and more important due to the increasing number of application domains that deal with moving entities. The asynchronous updating algorithm for continuous queries...
详细信息
Continuous queries for moving objects are becoming more and more important due to the increasing number of application domains that deal with moving entities. The asynchronous updating algorithm for continuous queries of moving objects is superior to synchronous updating algorithms in communication cost. By improving Haibo Hu's rectangle safe region strategy we proposed a new continuous queries algorithm. Circle safe region and dynamic interval are adopted in our algorithm. Theory proof and experiment results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangle safe region algorithms in terms of monitoring accuracy, communication cost and CPU time. Furthermore, the mobile terminals need not have any computation ability in our algorithm.
Moving objects databases are becoming more and more popular due to the increasing number of application domains that deal with moving entities. Continuous queries are important in moving objects databases. We summariz...
详细信息
ISBN:
(纸本)1424404754
Moving objects databases are becoming more and more popular due to the increasing number of application domains that deal with moving entities. Continuous queries are important in moving objects databases. We summarize three types of continuous queries, but only two of them have been studied before. We proposed new algorithms to process the other two types of queries. Experiment results all show that our algorithms is excellent in monitoring accuracy, communication cost and CPU load balance.
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.
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
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
暂无评论