Search
Search results for: software agents
-
Software Agents for Computer Network Security
PublicationThe chapter presents applications of multi-agent technology for design and implementation of agent-based systems intended to cooperatively solve several critical tasks in the area of computer network security. These systems are Agent-based Generator of Computer Attacks (AGCA), Multi-agent Intrusion Detection and Protection System (MIDPS), Agent-based Environment for Simulation of DDoS Attacks and Defense (AESAD) and Mobile Agent...
-
Agents in Simulation of Cyberattacks to Evaluate Security of Critical Infrastructures
PublicationIn the last years critical infrastructures have become highly dependent on the information technologies and exposed to cyberattacks. Because the effects of the attacks can be detrimental, it is crucial to comprehensively asses the security of the infrastructures' information systems. This chapter describes MAlSim - the simulator of malicious software based on software agents, developed for the needs of a testbed for critical infrastructures...
-
GROUP COMPOSER - System for Modeling Agents’ Team Building for Tasks
PublicationMulti-agent systems consist of many autonomous units, called agents, that can interact when trying to achieve their goals. The selection of interaction partners is called team formation. Three basic approaches can be considered to match multi-agent system resources to the problem at hand. To research the properties of different approaches, a software for modeling team formation in multi-agent systems has been created and is presented...
-
Topology Discovery of Hierarchical Ethernet LANs without SNMP support
PublicationThis paper presents an algorithm that allows for discovery of layer-2 hierarchical Ethernet network topology using agents running on selected end nodes. No SNMP, MIB, hardware, firmware, or operating system-level software modification is required. The method is based on transmission of customized Ethernet frames among installed software agents. It can be used to discover the topology of LAN or one VLAN segment as long as no MAC...
-
MAlSim - Mobile Agent Malware Simulator
PublicationOne of the problems related to the simulation of attacks against critical infrastructures is the lack of adequate tools for the simulation of malicious software (malware). Malware attacks are the most frequent in the Internet and they pose a serious threat against critical networked infrastructures. To address this issue we developed Mobile Agent Malware Simulator (MAISim). The framework uses the technology of mobile agents and...
-
Adapting a General Tool to Monitoring Multi-Agent Systems Through Virtual Host Layer Extenstion
PublicationNagios is a free software for IT infrastructure monitoring. Out-of-the-box it is not suited for monitoring multi-agent systems, because agents may dynamically join and leave the system or change roles. But Nagios' flexible configuration makes extensions possible. This paper presents and verifies Nagios configuration and extensions for monitoring multi-agent systems.
-
Student model representation for pedagogical virtual mentors
PublicationThe paper concerns technological aspects of virtual mentors construction, especially concentrating on the student model representation. The article distinguishes several types of information that is gathered by the pedagogical agents and other educational platforms, including student knowledge model, student progress tracking, interaction process patterns and learner preferences. A set of technologies used for the student model...
-
Optymalizacja strategii sieci inteligentnych agentów za pomocą programowania genetycznego w systemie rozproszonym realizującym paradygmat volunteer computing
PublicationDynamicznie rosnąca złożoność i wymagania w odniesieniu do rozproszonych systemów informatycznych utrudnia zarządzanie dostępnymi zasobami sprzętowymi i programistycznymi. Z tego powodu celem rozprawy jest opracowanie wielokryterialnej metody programowania genetycznego, która pozwala na optymalizację strategii zespołu inteligentnych agentów programistycznych w zakresie zarządzania systemem realizującym paradygmat volunteer computing....
-
Harmony Search for Self-configuration of Fault–Tolerant and Intelligent Grids
PublicationIn this paper, harmony search algorithms have been proposed to self-configuration of fault-tolerant grids for big data processing. Self-configuration of computer grids lies in the fact that new computer nodes are automatically configured by software agents and then integrated into the grid. A base node works due to several configuration parameters that define some aspects of data communications and energy power consumption. We...
-
An application of multi-agent system for ship’s power systems design
PublicationDesign process of transport ship power system consists of structure (topology) and component elements selection. Compliance with the requirements for static components does not guarantee optimal dynamic characteristics of entire power system. Design steps are difficult to formalize and as a consequence to this reason expert and multi-agent systems are used for solving selected design issues. In the paper distributed multi-agent...
-
Simulating Malware with MAlSim
PublicationThis paper describes MAlSim - Mobile Agent Malware Simulator - a mobile agent framework developed to address one of the most important problems related to the simulation of attacks against information systems i.e. the lack of adequate tools for reproducing behaviour of malicious software (malware). The framework can be deployed over the network of an arbitrary information system and it aims at simulating behaviour of each instance...
-
Simulating malware with MAlSim
PublicationThis paper describes MAlSim - Mobile Agent Malware Simulator - a mobile agent framework developed to address one of the most important problems related to the simulation of attacks against information systems, i.e. the lack of adequate tools for reproducing behaviour of malicious software (malware). The framework can be deployed over the network of an arbitrary information system and it aims at simulating behaviour of each instance...
-
Using human behavior to develop knowledge-based virtual organisations
PublicationPropozycja modelu opartego na zachowaniach ludzkich dla potrzeb budowy wirtuanych organizacji opartych na wiedzy.Virtual organizations promote dynamic interaction between individuals, groups, and organizations, who share their capabilities and resources to pursue a common goal and maximize their benefits. Among these resources, knowledge is a critical one that requires special attention in order to support problem-solving activities...
-
Intelligent Virtual Agents
Conferences -
Exploring ontological approach for user requirements elicitation in design of online virtual agents
PublicationEffective user requirements elicitation is a key factor for the success of software development projects. There are many qualitative and quantitative research studies that promulgate particular methods and show the application of user requirements elicitation in particular domains. However, few try to eliminate the burden of ambiguity in gathered data, naturally occurring in different groups of stakeholders. This paper deals with...
-
International Workshop on Intelligent Agents
Conferences -
IEEE Symposium on Intelligent Agents
Conferences -
The particle method for simulation of self-organization phenomena
PublicationThe aim of the work was to design, implement, and use, in a number of experiments, an abstract software environment (an artificial world)suitable for modelling systems consisting of many moving and interactingobjects distributed in space. The environment, named DigiHive, is directed towards modeling of complex systems manifested by processes of self-organization, self-reproduction and self modifications. The environment is mainly...
-
International Conference on Agents and Artificial Intelligence
Conferences -
Practical Applications of Agents and Multiagent Systems
Conferences -
Distributed Evacuation in Graphs with Multiple Exits
PublicationWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
International Workshop on Logic Programming and Multi-Agents
Conferences -
International Workshop on Agents and Data Mining Interaction
Conferences -
Time versus space trade-offs for randezvous in trees
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
A multi-agent method for periodicity detection in distributed events
PublicationMulti-agent systems working in constantly changing environments may be challenged by instantaneous unavailability of their autonomous agents caused e.g. by limited computing resources. A new method of self-organization of distributed service components is proposed, suitable for multi-agent systems. This method relies on particular agents carrying out separate analyzes of their individual processing loads or other specific events....
-
BeesyBees: A mobile agent-based middleware for a reliable and secure execution of service-based workflow applications in BeesyCluster
PublicationIntegrating distributed services into workflows comes with its own set of challenges, including security, coordination, fault tolerance and optimisation of execution time. This paper presents an architecture and implementation - nicknamed BeesyBees - that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middleware that allows users to access distributed resources as well as publish...
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublicationWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
Selected Features of Dynamic Voting
PublicationIn multi-agent systems composed of autonomous agents with local knowledge, it is often desirable to aggregate their knowledge in order to make an educated decision. One of the methods of agreeing to a common decision is voting. A new history-based dynamic weight protocol allows for identification of the agents which contribute to the correct system decision. The main advantage of this approach, compared to static weighted system...
-
The Use of an Autoencoder in the Problem of Shepherding
PublicationThis paper refers to the problem of shepherding clusters of passive agents consisting of a large number of objects by a team of active agents. The problem of shepherding and the difficulties that arise with the increasing number of data describing the location of agents have been described. Several methods for reducing the dimensionality of data are presented. Selected autoencoding method using a Restricted Boltzmann Machine is...
-
International Joint Conference on Autonomous Agents and Multiagent Systems
Conferences -
Experimental and Theoretical Insights into the Intermolecular Interactions in Saturated Systems of Dapsone in Conventional and Deep Eutectic Solvents
PublicationSolubility is not only a crucial physicochemical property for laboratory practice but also provides valuable insight into the mechanism of saturated system organization, as a measure of the interplay between various intermolecular interactions. The importance of these data cannot be overstated, particularly when dealing with active pharmaceutical ingredients (APIs), such as dapsone. It is a commonly used anti-inflammatory and...
-
UK travel agents’ evaluation of eLearning courses offered by destinations: an exploratory study.
PublicationThis study aims to develop an understanding of the use of e-learning courses created for travel agents by Destination Management Organizations (DMOs). It explores agents’ perceptions of such courses. The research examines the views of 304 UK-based travel agents using online survey and investigates whether age, sex, type of agency, work experience, and educational level have influence on e-learning uptake. The satisfaction of travel...
-
International KES Conference on Agents and Multiagent systems - Technologies and Applications (International KES Symposium on Agents and Multiagent systems - Technologies and Applications)
Conferences -
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
The XRD diffraction patterns of Ce0.9Gd0.1O2 prepared using modified Pechini/EDTA method
Open Research DataThe dataset includes XRD patterns of Ce0.9Gd0.1O2-s nanopowder (nanoparticles) prepared using modified Pechini method consisting of CA (citric acid), PEG (propylene glycol) and EDTA. Exact amount of metal nitrates were dissolved in water followed by addition of gelling agents and heated to 100C. Obtained gel was calcined at 600C for 4h. The powder...
-
Amino Acid and Peptide‐Based Antiviral Agents
PublicationA significant number of antiviral agents used in clinical practice are amino acids, short peptides, or peptidomimetics. Among them, several HIV protease inhibitors (e. g. lopinavir, atazanavir), HCV protease inhibitors (e. g. grazoprevir, glecaprevir), and HCV NS5A protein inhibitors have contributed to a significant decrease in mortality from AIDS and hepatitis. However, there is an ongoing need for the discovery of new antiviral...
-
Effect of User Mobility upon Trust Building among Autonomous Content Routers in an Information-Centric Network
PublicationThe capability of proactive in-network caching and sharing of content is one of the most important features of an informationcentric network (ICN). We describe an ICN model featuring autonomous agents controlling the content routers. Such agents are unlikely to share cached content with other agents without an incentive to do so. To stimulate cooperation between agents, we adopt a reputation and trust building scheme that is able...
-
Trust Dynamics Analysis of CTR Scheme Subversion under Virtual Anonymity and Trust-Unaware Partner Selection
PublicationWe propose a framework to study Markovian trust value dynamics in a centralized Computational Trust and Reputation (CTR) scheme under trust-unaware partner selection using a mean-value approximation. Analytically founded answers are sought to questions like: Can dishonest agents subvert the CTR scheme (i.e., acquire higher trust values than honest agents)? Is indirect reciprocity incentivized? Is there a qualitative impact of a...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Big Data Processing by Volunteer Computing Supported by Intelligent Agents
PublicationIn this paper, volunteer computing systems have been proposed for big data processing. Moreover, intelligent agents have been developed to efficiency improvement of a grid middleware layer. In consequence, an intelligent volunteer grid has been equipped with agents that belong to five sets. The first one consists of some user tasks. Furthermore, two kinds of semi-intelligent tasks have been introduced to implement a middleware...
-
The influence of combination of binding agents on fatigue properties of deep cold in-place recycled mixtures in Indirect Tensile Fatigue Test (ITFT)
PublicationThe publication presents fatigue properties of cold recycled mixtures for eight combinations of binding agents (cement and bituminous emulsion). Cold recycled mixtures were evaluated in Indirect Tensile Fatigue Test (ITFT) at the temperature of 20 C in controlled stress mode. As a function of horizontal stress, fatigue life is strongly influenced by combination of the binding agents. When fatigue life is analyzed as a function...
-
Trustworthiness and Subversion in Large Service- Oriented Multi-Agent Systems under Virtual Anonymity and Blind Provider Selection
PublicationTo promote honest service provision in multi-agent systems, a Computational Trustworthiness and Rating scheme collects service ratings and computes agents' trustworthiness levels (TLs). Studies of existing schemes fail to reflect closed-loop dynamics of TLs arising from the mutual influence of agents' behavior and TLs, and to capture relevant properties. Recent simulative and analytical models produce results tied to a particular...
-
Practical Application of Intelligent Agents and Multi-Agent Technology Conference
Conferences -
International Conference on Intelligent Agents, Web Technologies, and Internet Commerce
Conferences -
European Workshop on Modelling Autonomous Agents in a Multi-Agent World
Conferences -
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...