Owing to the similarity between biological immune system and intrusion detection system, a four-layer model for network intrusion detection system based on Dendritic cells (DC) in danger theory is constructed . DC det...
详细信息
Owing to the similarity between biological immune system and intrusion detection system, a four-layer model for network intrusion detection system based on Dendritic cells (DC) in danger theory is constructed . DC detectors are introduced and a DC-based algorithm is proposed in this model. It involves comprehensive evaluation and improves the detection ability of undefined intrusion.
This article has analyzed the principle of JXTA network resources localization mechanism thoroughly. In view of the existing problem of JXTA network resource localization mechanism, proposes a new algorithm thinking w...
详细信息
This article has analyzed the principle of JXTA network resources localization mechanism thoroughly. In view of the existing problem of JXTA network resource localization mechanism, proposes a new algorithm thinking which combines small world and the interest weaken mechanism of rumors spread, and replaced the inherent strategy by using the dynamic long chain replacement to improve the problem of binding choose the rendezvous peer in the JXTA network.
Geographic Information System (GIS) has been widely used in the geotechnical engineering field, but it is incompetent in real-time computation. In this paper, the Geographic Information System based on distributed par...
详细信息
Geographic Information System (GIS) has been widely used in the geotechnical engineering field, but it is incompetent in real-time computation. In this paper, the Geographic Information System based on distributed parallel computation named GISPC is introduced. The implementation of domain decomposition on the server is the preprocessing of parallel computation. With the method of adopting MPI on Cluster of Workstation (COW) platform in the system, the parallel FEM codes can be implemented by C++ Object-Oriented Programming (OOP) technique. The large-scale geotechnical problems can be successfully solved on PC machine groups by using these techniques. And the system is capable of internet publication. It enables fast storage and retrieval of large amounts of information stored in the server through intranet and internet. The instance of Longtan high slope is shown to prove the applicability of these methods. The results show the feasibility of the proposed methods for the extensive application of GIS in geotechnical engineering.
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambients and introduces new constructs to ena...
详细信息
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambients and introduces new constructs to enable ambients and processes to be aware of the environment in which they are being executed. This results in a powerful calculus where mobility and context-awareness are first-class citizens. We present the syntax and a formal semantics of the calculus. We show that CCA can encode the pi-calculus, and illustrate the pragmatics of the calculus through a case study of a context-aware hospital bed.
In this paper we reinforce the benefits of a trust based approach in mobile multi-agent systems. Whilst we do not specify a trust model we provide a framework for property based trust, defining the observations which ...
详细信息
In this paper we reinforce the benefits of a trust based approach in mobile multi-agent systems. Whilst we do not specify a trust model we provide a framework for property based trust, defining the observations which underpin many pre-existing trust models. This framework maintains subjectivity which should be the basis of any trust based system yet enables entities to communicate and collaborate trust information regardless of the trust model used for deliberation. We also introduce dasiatrust communitiespsila as a representation of property based trust information thus enabling the collaboration of reputation information.
This paper addresses maximum a posteriori (MAP) estimation algorithm for multiple frequency offsets in distributed multiple inputs and multiple outputs (MIMO) system in the presence of prior information about frequenc...
详细信息
This paper addresses maximum a posteriori (MAP) estimation algorithm for multiple frequency offsets in distributed multiple inputs and multiple outputs (MIMO) system in the presence of prior information about frequency offsets. In this paper, the prior information is considered and the Cramer-Rao bound (CRB) for the problem at hand is derived. Additionally, taking advantage of prior information, the algorithm of maximum a posteriori is investigated. First, the variance of prior information can be estimated according to the range of frequency offsets. Then the MAP estimation will be used to estimate the frequency offsets. Compared with the maximum-likelihood estimation, simulation results illustrate the performance of MAP estimator achieve the CRB and the proposed algorithm can improve the efficiency of synchronization obviously, especially in low signal to noise ratio (SNR) environment.
The emergence of large-scale online social networks has attracted much interest in recent years, and the structure of online social networks has been rigorously studied in the last few years. However, to date, only se...
详细信息
This paper considers the implementation of parallel Grobner bases algorithms on distributed memory parallel computers like todays high performance computing clusters (HPC) in the Java computer algebra library (JAS). T...
详细信息
This paper considers the implementation of parallel Grobner bases algorithms on distributed memory parallel computers like todays high performance computing clusters (HPC) in the Java computer algebra library (JAS). The implementation of Grobner bases algorithms is part of the essential building blocks for any computation in algebraic geometry. There are various implementations of these algorithms in procedural programming languages. Our aim is an implementation in a modern object oriented programming language with generic data types, as it is provided by Java programming language. The proposed middle-ware uses a distributed list for the communication of the reduction bases and a distributed thread pool for running the reduction engines in different computers. Java object serialization is used to encode polynomial objects for network transport via Java networking facilities.
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P overlay network connecting the users....
详细信息
ISBN:
(纸本)9783642038686
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P overlay network connecting the users. This significantly enhances the user experience by relieving the source from dealing with all connections. Yet, the joining process resulting in a peer to be integrated in channel overlay usually requires a significant amount of time. As a consequence, switching from one channel to another is far to be as fast as in IPTV solutions provided by telco operators. In this paper, we tackle the issue of efficient channel switching in P2P IPTV system. This is to the best of our knowledge the first study on this topic. First, we conducted and analyzed a set of measurements of one of the most popular P2P systems (PPlive). These measurements reveal that;the set;of contacts that a joining peer receives from the central server are of the utmost importance in the start-up process. On those neigbors, depends the speed to acquire the first video frames to play. We then formulate the switching problem, and propose a simple distributed algorithm, as an illustration of the concept;which aims at leveraging the presence of peers in the network to fasten the switch process. The principle is that;each peer maintains as neighbors peers involved in other channels, providing peers with good contacts upon channel switching. Finally, simulations show that our approach leads to substantial improvements on the channel switching time. As our algorithmic solution does not have any prerequisite on the overlays, it appears to be all appealing add-on for existing P2P IPTV systems.
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and checking given compositions requires a...
详细信息
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and checking given compositions requires a common framework for expressing application needs, service features, and system characteristics. In this paper, we present such a framework that is based on situation calculus. We show that the automated composition problem can be reduced to an AI planning problem. We further illustrate the effectiveness of this approach with several examples.
暂无评论