In this paper a new technique for ray tracing point-based models is *** approach offers a higher ray tracing speed in comparison with previous *** pre-process, we add an important attribute to each point for the purpo...
详细信息
In this paper a new technique for ray tracing point-based models is *** approach offers a higher ray tracing speed in comparison with previous *** pre-process, we add an important attribute to each point for the purpose of ray *** rendering, an algorithm of intersecting a ray with point geometry is demonstrated to get satisfied *** approach makes it possible to render high quality ray traced images with global *** performs well especially in the way of boundary *** have tested our idea for shadows, reflection and refraction.
In this paper, we formally define the problem of conformant planning with multi-valued state variables, namely multi-valued conformant planning task (MCPT), and present an algorithm for transforming conformant plannin...
详细信息
In this paper, we formally define the problem of conformant planning with multi-valued state variables, namely multi-valued conformant planning task (MCPT), and present an algorithm for transforming conformant planning problems specified in Planning Domain Definition Language (PDDL) into MCPTs. The algorithm can deal with the uncertainties of initial conditions and disjunctive goals according to two important relaxed conditions.
Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been rai...
详细信息
Peer-to-peer systems and applications are the hotspot of research of network applications. As peer-to-peer system has no central system and is deployed on an open network, new concerns regarding security have been raised. As an additional security measure, the intrusion detection system would help determine whether unauthorized users are attempting to access, have already accessed, or have compromised the network Intrusion detection, as the second line of defense, is an indispensable tool for highly survivable networks. In this paper two anomaly intrusion detection methods are proposed for peer-to-peer system. The main characters of the methods are that they can detect intrusion in real-time without any expert knowledge and attack signatures. One method uses hidden Markov model to check reflector DoS attacks, another based on adaptive resonance theory, which can learn the normal behavior with unsupervised method. The experimental P2P system is built on FreePastry 1.401 and JDK 1.5.0. The results have indicated that the methods can find DoS attacks immediately and find new intruders with low false alarm rate.
The fast-forward planning system (FF), which obtains heuristics via a relaxed planning graph to guide the enforced hill-climbing search strategy, has shown excellent performance in most STRIPS domains. When it comes t...
详细信息
The fast-forward planning system (FF), which obtains heuristics via a relaxed planning graph to guide the enforced hill-climbing search strategy, has shown excellent performance in most STRIPS domains. When it comes to ADL domains, FF handles actions with conditional effects in a way similar to factored expansion. The result is that enforced hill-climbing guided by the relaxed Graphplan always fails in some ADL domains. We have discovered that the reason behind this issue is the relaxed Graphplan's inability to handle relationships between actions' components. We propose a novel approach called delayed partly reasoning on a naive conditional-effects planning graph (DP-CEPG). We do not ignore action's delete effects and consider restricted induced component mutual exclusions between factored expanded actions. Preliminary results show that enforced hill-climbing while guided by DP-CEPG gains obvious improvements in most ADL problems in terms of both solution length and runtime.
To overcome the shortcomings of traditional search engines, advocates a prototype of semantic-based search engine, called CRAB. By combining technologies of semantic Web, information extraction (IE), natural language ...
详细信息
To overcome the shortcomings of traditional search engines, advocates a prototype of semantic-based search engine, called CRAB. By combining technologies of semantic Web, information extraction (IE), natural language processing (NLP) and a novel theme-based method, this framework can extract factual knowledge from Chinese natural language documents automatically. Instead of list of document links, results of user's query request returned from CRAB are semantically coherent reports generated intelligently, which can satisfy users greatly.
Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been...
详细信息
Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman's algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.
knowledge discovery in spatial databases represents a particular case of discovery, allowing the discovery of relationships that exist between spatial and non-spatial data. Spatial reasoning ought to play a very impor...
详细信息
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...
详细信息
In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting se...
详细信息
In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting set by the number of conflict sets corresponding to components, and the computing procedure is formalized by combining revised SE-tree (set enumeration tree) with closed nodes to generate all minimal hitting sets. Results show that because closed nodes are added into SE-tree, the search efficiency is highly improved. Furthermore, the proposed method is easy to be understood and implemented. Compared with other effective algorithms with completeness in some experimental tests, the diagnosis efficiency of our proposed method is higher, particularly for single- and double-fault diagnosis.
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 ...
详细信息
暂无评论