16775013
A Dynamic Trust Model for the Multi-agent Systems
Internet provides a fertile medium for new breeds of computer viruses. Many people who have access to a wealth of information via Internet are attacked by more computer viruses than they can effectively process. We present a dynamic computer virus detection model that can detect known viruses and previously unknown viruses to prevent information systems from damage. This model is inspired by biological immune systems that protect the body against damage from pathogens. The architecture of this model, the formal definitions of self nonself antigen, antibody, and vaccine gene library are introduced. Furthermore, the evolution of self and nonself, the generation of the antibody, the evolution of the virus vaccine gene, and the detection of the antigen are depicted. Experiment results show that this model has better capacity of self-adaptability and self-learning in detecting unknown viruses than traditional models.
16164261
Relevance Feedback for Sketch Retrieval Based on Linear Programming Classification
Relevance feedback plays as an important role in sketch retrieval as it does in existing content-based retrieval. This paper presents a method of relevance feedback for sketch retrieval by means of Linear Programming (LP) classification. A LP classifier is designed to do online training and feature selection simultaneously. Combined with feature selection, it can select a set of user-sensitive features and perform classification well facing a small number of training samples. Experiments prove the proposed method both effective and efficient for relevance feedback in sketch retrieval.
15542808
An Agent-based Policy Aware Framework for Web Services Security
The security of Web services has become one of the important research topics about the application of Web services. In this paper, we propose an agent-based policy aware framework for Web services security. In this framework, a policy language called ReiT which is a declarative language based on the rules and ontologies is introduced. The non-structural knowledge is represented by rules and the structural temporal knowledge is represented by ontology. Moreover, we propose a mixed reasoning mechanism to evaluate the ReiT policy. The access control policy including the context of the user and Web services is evaluated by the reasoner. In addition, we present a policy aware BOID agent to authorize the access control of the Web services. And we implement the policy aware BOID agent by extending the JADE platform.
2517026
On Dynamic and Concurrent Model of Web Service Components
The researches of Web service fasten on composition process, and are lack of the formalized description on dynamic attributes of service component itself. Aiming to these, a new dynamic and concurrent model of Web service component is presented. Firstly, this paper analyzes the process of state transition of service component under certain actions, and then depicts the dynamic transition process of service component with the state transition graph. At last, the physical representation method in memory and the algorithms to judge equivalence of state transition graph are given. Comparing with existing researches, the dynamic evolvement of service component under the actions is considered, and the algorithm to judge equivalence of service components provides an effective tool for model verification.
15536271
Encouraging Good Interactions in Open Agent Systems
In the open agent systems, agents have to meet how, when and with who interact. Trust and reputation play an important role in reduces the uncertain. However, existing trust metric is not effective when an agent strategically behaviors, such as sudden behavior or alter 'name'. This paper presents a novel trust metric, which can penalize behavior of the suddenly falling behavior and change 'name'.
43513684
A representation theorem for recovering contraction relations satisfying wci
A notion of an image structure associated with the canonical epistemic state is introduced. Based on it, we get a representation result for recovering contraction inference relations satisfying the condition weak conjunctive inclusion (wci) in terms of F-standard epistemic AGM states. In effect, this result establishes a representation theorem for belief contraction functions satisfying AGM postulates (k-1) - (k-7), and Rott's (wci) and (k-8c), and hence generalizes Rott's corresponding result in the finite framework.
28434248
Optimized Rate Allocation for Unbalanced Multiple Description Video Coding Over Unreliable Packet Network
14995264
A mixed-signal simulator for VHDL-AMS
13209883
An Approach for Dynamic Hardware /Software Partitioning Based on DPBIL
HW/SW partitioning is one of the key steps in high-level modeling of embedded system co-design. In some kinds of data-dependence applications, the partitioning environment is dynamic. An approach based on a kind of evolutionary algorithm called DPBIL is proposed for dynamic HW/SW partitioning problem. DPBIL is inspired by Dualism or complementarity in the nature and operates on a pair of dual probability vectors to adapt itself to the dynamic environment. We systematically constructed the system model, defined the dynamic environment and conducted experimental analysis via comparison with the existing method. To enhance the exploration performance of DPBIL, a threshold constraint mechanism is introduced. Experimental results indicated that our approach is feasible and efficient for dynamic HW/SW partitioning, and has much better performance than traditional ones.
11982779
A Wireless Intrusion Detection Method Based on Dynamic Growing Neural Network
In this paper an intrusion detection method based on dynamic growing neural network (DGNN) for wireless networking is presented. DGNN 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 overfitting the training data just like decision tree learning. The intrusion detection method is an anomaly detection method and the feature is selected from the packets. In the experiments, we first check the ability of the neural network and then use it to perform detection in a WLAN. The results show that it can detect new intrusion behavior and some improving methods are presented in the conclusions
13969356
Risk Informed Computer Economics
Grid computing continues to hold promise for the high-availability of a wide range of computational systems and techniques. It is suggested that Grids will attain greater acceptance by a larger audience of commercial end-users if binding Service Level Agreements (SLAs) are provided. We discuss Grid commoditization, the use of Grid technologies for financial risk analysis, and the potential formulation of the Grid Economy. Our aim is to predict availability and capability for risk analysis in and of Grids. The considerations involved may be more widely applicable to the configuration and management of related architectures including those of P2P systems and Clouds. In this paper, we explore and evaluate some of the factors involved in the automatic construction of SLAs for the Grid Economy.