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.
Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method b...
详细信息
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
A novel self Adaptive Support Vector Clustering algorithm (ASVC) is proposed in this paper to cluster dataset with diverse dispersions. And a Kernel function is defined to measure affinity between multi-relational dat...
详细信息
A Spectrum-based Support Vector Algorithm (SSVA) to resolve semi-supervised classification for relational data is presented in this paper. SSVA extracts data representatives and groups them with spectral analysis. Lab...
详细信息
Designing a set of fuzzy neural networks can be considered as solving a multi-objective optimization problem. An algorithm for solving the multi-objective optimization problem is presented based on particle swarm opti...
详细信息
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.
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.
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
暂无评论