Wyniki wyszukiwania dla: MOBILE AGENT - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: MOBILE AGENT

Wyniki wyszukiwania dla: MOBILE AGENT

  • MAlSim - Mobile Agent Malware Simulator

    Publikacja

    - Rok 2008

    One 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...

  • Anonymity Architecture for Mobile Agent Systems

    Publikacja

    - Rok 2007

    The paper presents a new security architecture for MAS, which supports anonymity of agent owners. The architecture is composed of two main elements: Module I: Untraceability Protocol Infrastructure and Module II: Additional Untraceability Support. Module I is based on the recently proposed untraceability protocol for MAS and it forms the core of the anonymity architecture, which can be supported by the ele- ments of the second...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Clearing directed subgraphs by mobile agents

    Publikacja

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Rok 2019

    We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...

    Pełny tekst do pobrania w portalu

  • Decontaminating Arbitrary Graphs by Mobile Agents: a Survey

    Publikacja

    A team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • BeesyBees: A mobile agent-based middleware for a reliable and secure execution of service-based workflow applications in BeesyCluster

    Integrating 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs

    Publikacja

    - Rok 2014

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Gossiping by energy-constrained mobile agents in tree networks

    Publikacja

    - THEORETICAL COMPUTER SCIENCE - Rok 2021

    Every 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks

    Publikacja

    - Rok 2014

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Rendezvous of heterogeneous mobile agents in edge-weighted networks

    We 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...

    Pełny tekst do pobrania w portalu

  • A Review of Traffic Analysis Attacks and Countermeasures in Mobile Agents' Networks

    Publikacja

    - Rok 2021

    For traditional, message-based communication, traffic analysis has been already studied for over three decades and during that time various attacks have been recognised. As far as mobile agents’ networks are concerned only a few, specific-scope studies have been conducted. This leaves a gap that needs to be addressed as nowadays, in the era of Big Data, the Internet of Things, Smart Infrastructures and growing concerns for privacy,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • An untraceability protocol for mobile agents and its enhanced security study

    Publikacja

    Artykuł przedstawia rozszerzoną analizę bezpieczeństwa zaproponowanego przez nas protokołu ochrony przed tropieniem (ang. untraceability protocol) dla agentów mobilnych. Jak dotąd, tak systematyczna analiza bezpieczeństwa nie została przeprowadzona. Co więcej, istniejące znane analizy bezpieczeństwa koncentrują się wyłącznie na atakujących wewnętrznych. Uważamy, że stworzona przez nas lista kontrolna ataków może posłużyć jako...

  • Quantum strategies for rendezvous and domination tasks on graphs with mobile agents

    Publikacja

    - PHYSICAL REVIEW A - Rok 2024

    This paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...

    Pełny tekst do pobrania w portalu

  • Performance analysis of untraceability protocols for mobile agents using an adaptable framework

    Publikacja

    Artykuł przedstawia środowisko oceny wydajności protokołów ochrony przed tropieniem agentów mobilnych oraz wyniki analiz przeprowadzonych za jego pomocą. Chociaż środowisko projektowano i implementowano z myślą o ewaluacji zaproponowanych przez nas protokołów ochrony przed tropieniem, w trakcie badań okazało się, że może ono zostać również wykorzystane do badań całej klasy protokołów bezpieczeństwa dla agentów mobilnych. Chodzi...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks

    Publikacja

    Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, are striving to meet without pre-agreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern and future applications. Quantum non-locality, like Bell inequality violation, has shown that in many...

    Pełny tekst do pobrania w portalu

  • Agent System for Managing Distributed Mobile Interactive Documents

    The MIND architecture of distributed mobile interactive document is a new processing model defined for facilitate informed decision-making in non-algorithmic decision-making processes carried out by knowledge-based organizations. The aim of this architecture is to change the static document to mobile agents, which are designed to implement the structure of the organization through autonomous migration between knowledge workers...

    Pełny tekst do pobrania w portalu

  • Agent System for Managing Distributed Mobile Interactive Documents in Knowledge-Based Organizations

    Publikacja

    - Rok 2012

    The MIND architecture of distributed mobile interactive document is a new processing model defined to facilitate obtaining a proper solution in knowledge processes carried out by knowledge-based organizations. Such organizations have an established structure that defines document templates and knowledge process. The aim of the MIND architecture is to change the static document to mobile agents, which are designed to implement the...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Software Agents for Computer Network Security

    Publikacja

    - Rok 2012

    The 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Collision-free network exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Rok 2017

    Mobile 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...

    Pełny tekst do pobrania w portalu

  • Collaborative Exploration of Trees by Energy-Constrained Mobile Robots

    Publikacja

    - THEORY OF COMPUTING SYSTEMS - Rok 2018

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Simulating Malware with MAlSim

    Publikacja

    - Rok 2008

    This 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

    Publikacja

    This 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Reliable Document-Centric Processing in Loosely Coupled Email-Based Systems

    Publikacja

    - Rok 2015

    Email is a simple way to exchange digital documents of any kind. The Mobile INteractive Document architecture (MIND) enables self-coordination and self-steering of document agent systems based on commonly available email services. In this paper, a mechanism for providing integrity and reliability of such an email based agent system is proposed to cope with message soft or hard bounces, user interrupts, and other unexpected events....

  • Collision-Free Network Exploration

    Publikacja
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - Rok 2014

    A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Smart Document-Centric Processing of Human Oriented Information Flows

    Publikacja

    Usually people prefer to focus on creative rather than repetitive and schematic work patterns. Still, they must spend a lot of time complying with the procedures, selecting the information they receive and repeatedly restoring the previous state of work. This paper proposes the Mobile INteractive Document architecture (MIND) - a document-centric uniform interface to provide both effective communication of content and coordination...

    Pełny tekst do pobrania w portalu

  • Evaluating Security and Resilience of Critical Networked Infrastructures after Stuxnet

    Publikacja

    - Rok 2013

    The chapter presents the current configuration of the simulation environment for the evaluations of the security and resilience of critical networked infrastructures, which enables simulations of Stuxnet-like attacks. The configuration includes new features added to the MAlSim - Mobile Agent Malware Simulator after the advent of Stuxnet in reference to the experiments aiming at the security evaluation of a power plant which we...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

    Publikacja

    - LECTURE NOTES IN COMPUTER SCIENCE - Rok 2010

    Two mobile agents, modeled as points starting at differentlocations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and epsilon-RV, when these points have to get at distance less than epsilon in the terrain. In any terrain, each agent chooses its trajectory, but...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • How to meet when you forget: log-space rendezvous in arbitrary graphs

    Publikacja

    - DISTRIBUTED COMPUTING - Rok 2011

    Two 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Multi-agent graph searching and exploration algorithms

    Publikacja

    - Rok 2020

    A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

    Pełny tekst do pobrania w portalu

  • Rafał Leszczyna dr hab. inż.

    Dr hab. inż. Rafał Leszczyna jest profesorem uczelni na Wydziale Zarządzania i Ekonomii Politechniki Gdańskiej. W lipcu 2020 r., na podstawie osiągnięcia naukowego w obszarze zarządzania cyberbezpieczeństwem infrastruktur krytycznych w sektorze elektroenergetycznym, uzyskał stopień doktora habilitowanego w dziedzinie nauk inżynieryjno-technicznych, dyscyplina informatyka techniczna i telekomunikacja. W latach 2004–2008 pracował...

  • Approach to security assessment of critical infrastructures' information systems

    Publikacja

    - IET Information Security - Rok 2011

    This study presents an approach to the security assessment of the information systems of critical infrastructures. The approach is based on the faithful reconstruction of the evaluated information system in a computer security laboratory followed by simulations of possible threats against the system. The evidence collected during the experiments, stored and organised using a proprietary system InSAW, may later be used for the creation...

    Pełny tekst do pobrania w portalu

  • Distributed Evacuation in Graphs with Multiple Exits

    Publikacja

    We 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Time versus space trade-offs for randezvous in trees

    Publikacja

    - DISTRIBUTED COMPUTING - Rok 2014

    Two 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...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The novel sterilization device: the prototype testing

    Publikacja

    - Scientific Reports - Rok 2023

    Currently, there are numerous methods that can be used to neutralize pathogens (i.e., devices, tools, or protective clothing), but the sterilizing agent must be selected so that it does not damage or change the properties of the material to which it is applied. Dry sterilization with hydrogen peroxide gas (VHP) in combination with UV-C radiation is well described and effective method of sterilization. This paper presents the design,...

    Pełny tekst do pobrania w portalu

  • Drawing maps with advice

    Publikacja

    W pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Human-Agent Interaction

    Konferencje

  • Interactive information and decision support system for urban and industrial air quality management based on multi-agent system

    Publikacja

    This article presents conception of interactive information and decision support system for urban and industrial air quality management. The emphasis of the project is on real-time analysis and multi-media information, and the support of distributed and mobile clients through the Internet. The approach integrates meteorological data and forecasts, air quality and emission monitoring, dynamic 3D simulation modelling and forecasting,...

  • Integration of Software Engineering and Agent Technology

    Konferencje

  • European Workshop on Multi-Agent Systems

    Konferencje

  • International Conference on Principles of Practice in Multi-Agent Systems

    Konferencje

  • Practical Application of Intelligent Agents and Multi-Agent Technology Conference

    Konferencje

  • European Workshop on Modelling Autonomous Agents in a Multi-Agent World

    Konferencje

  • International Workshop on Coordination, Organizations, Institutions, Norms and Ethics for Governance of Multi-Agent Systems (Workshop on Coordination, Organizations, Institutions and Norms in agent Systems [COIN])

    Konferencje

  • IEEE/WIC/ACM International Joint Conferences on Web Inteligence and Intelligent Agent Technology

    Konferencje

  • International Workshop on Human Aspects in Ambient Intelligence: Agent Technology, Human-Oriented Knowledge and Applications

    Konferencje

  • IEEE/WIC/ACM International Conference on Web Intelligence (previously joint with Intelligent Agent Technology WI-IAT)

    Konferencje