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 (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new ...
详细信息
Identification of transcription factor binding sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a new approach to predict TFBS. This approach uses position weight matrix (PWM) to represent binding sites and uses genetic algorithm (GA) to search the best matrix. A new coding method so called multiple-variable coding is proposed in GA. We apply it on two transcription factors rebl and mgl. The result shows that this approach can find most of the known sites, which indicates that this method is very effective
We present an efficient algorithm for detecting collisions and self-collisions between highly deformable mass models, which is a combination of newly developed stochastic method and particle swarm optimization (PSO) a...
详细信息
We present an efficient algorithm for detecting collisions and self-collisions between highly deformable mass models, which is a combination of newly developed stochastic method and particle swarm optimization (PSO) algorithm. In stochastic collision detection, user can balance performance and detection quality by sampling primitive pairs within the models. To accelerate detecting process in the primitive pair space, we introduce PSO algorithm to complete the optimization for the first time. And in the end of this paper, we give the precision and efficiency evaluation about the algorithm and find it might be a reasonable choice for deformable models in collision detection
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
In this paper a new point-based rendering method for ray tracing is presented. An oriented spherical patch that passes a surface point is used to approximate the vicinity of that *** this paper the spherical patch tog...
详细信息
In this paper a new point-based rendering method for ray tracing is presented. An oriented spherical patch that passes a surface point is used to approximate the vicinity of that *** this paper the spherical patch together with the surface point is called "Spherical Patch Point" (SPP). Due to property of curvature, SPP can achieve similar visual quality compared with previous methods with much fewer points. This paper defines new point attributes for the purpose of efficiently locating the intersection between incoming ray and ***, an algorithm of intersecting a ray with point geometry is proposed. The algorithm can achieve a higher rendering speed in comparison with previous methods. The presented technique deals well with shadow, reflection and refraction.
In this paper a new technique for computing and ray tracing point based geometry is presented. It uses a novel point primitive that is called "Spherical Patch Point" (SPP) to approximate the vicinity of a su...
详细信息
In this paper a new technique for computing and ray tracing point based geometry is presented. It uses a novel point primitive that is called "Spherical Patch Point" (SPP) to approximate the vicinity of a surface point. Due to property of curvature, SPP can achieve similar visual quality compared with previous methods with much fewer primitives for the cost of a few additional bytes per point and thus makes a significant reduction in rendering time. During pre-process,important attributes are added to each SPP for the purpose of ray tracing. During rendering, an intersection algorithm different from previous ones has been demonstrated to get satisfied results. The proposed technique makes it possible to render high quality ray traced images with global illumination using SPPs. It offers a higher ray tracing speed in comparison with previous methods.
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.
A dynamic growing neural network (DGNN) for supervised learning of pattern recognition or unsupervised learning of clustering is presented. The main ideas included in DGNN are growing, resonance, and post-prune. DGNN ...
详细信息
A dynamic growing neural network (DGNN) for supervised learning of pattern recognition or unsupervised learning of clustering is presented. The main ideas included in DGNN are growing, resonance, and post-prune. DGNN is called dynamic growing because it is based on the Hebbian learning rule and adds new neurons under certain conditions. When DGNN performs supervised learning, resonance will happen if the winner can't match the training example; this rule combines the ART/ARTMAP neural network and WTA learning rule. When DGNN performs unsupervised learning, post-prune is carried out to prevent over fitting the training data just like decision tree learning. DGNN's prune rule is based on the distance threshold. DGNN has some advantages: learning not only is stable because it grows under certain conditions; but also it is faster than back-propagation rules and favorable learned predictive accuracy in small, noisy, online or offline data sets. Three classes of simulations are performed on the primary benchmarks: circle-in-the-square and two-spirals-apart benchmarks are used to check DGNN's supervised learning and compare it with ARTMAP and BP neural networks; DGNN's unsupervised learning ability is checked on UCI Machine Learning Archive's Synthetic Control Chart Time Series data set
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.
暂无评论