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...
-
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...
-
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...
-
International Joint Conference on Autonomous Agents and Multiagent Systems
Conferences -
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...
-
International KES Conference on Agents and Multiagent systems - Technologies and Applications (International KES Symposium on Agents and Multiagent systems - Technologies and Applications)
Conferences -
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...
-
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...
-
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...
-
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...
-
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...
-
Selection of derivatisation agents for chlorophenols determination with multicriteria decision analysis
PublicationThe paper shows very systematic method of selection of derivatisation agents for a given group of analytes. In this study 8 derivatisation agents are assessed for their capability to derivatise 8 chlorophenols. Multicriteria decision analysis is used to combine many objectives of derivatisation agents selection into single, easy to be interpreted numerical value. Three basic analyses were performed to obtain rankings with the aims...
-
Old Problems - New Solutions: Conversion of Capitals as a Tool for Shaping the Competitive Position in the Economic Field
PublicationThe acts and operations any social actor effectuates in each of the logically distinguished spheres of reality are conditioned by many factors, among which a reliable analysis of the strengths and weaknesses of an agent should be considered of utmost importance. The concept of capitals presented in this article divides the quantity of resources available to all acting agents into four main categories (which allows for determining...
-
Old Problems - New Solutions: Conversion of Capitals as a Tool for Shaping the Competitive Position in the Economic Field
PublicationThe acts and operations any social actor effectuates in each of the logically distinguished spheres of reality are conditioned by many factors, among which a reliable analysis of the strengths and weaknesses of an agent should be considered of utmost importance. The concept of capitals presented in this article divides the quantity of resources available to all acting agents into four main categories (which allows for determining...
-
Analytical data on molecular umbrella: cispentacin and molecular umbrella: fluorescent probe conjugates
Open Research DataAnalytical data (NMR, MS, FTIR) for nine conjugates of molecular umbrella with cispentacin, Lys(Mca) or Nap-NH2. The conjugates have been rationally designed as potential antifungal agents. 1H NMR and 13C NMR spectra were obtained at 500 MHz Varian Unity Plus spectrometer and the deuterated solvents were used as internal locks. High-resolution mass...
-
Multi-agent systems registration and maintenance of address mapping without agent self-registation
PublicationMonitoring of dynamic multi-agent systems, here agents are allowed to appear and disappear, and can migrate between network nodes is a complex tasks. Applying the traditional monitoring methods is not effective, as little can be assumed in advance about such environments. It is necessary to track changes in addressing and availability of agents to create and maintain mapping between agents and their network addresses. The...
-
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
PublicationTwo 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...
-
Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
PublicationRendezvous 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...
-
Collision-Free Network Exploration
PublicationA 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...
-
Multi-agent graph searching and exploration algorithms
PublicationA 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...
-
Application of genetic algorithms in graph searching problem
PublicationGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
GC Chromatograms for isomerization of alpha-pinene
Open Research DataData contain results of the catalytic tests for the isomerization of alpha-pinene for the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y,...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA 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...
-
TGA data of MXenes catalysts
Open Research DataData contain results from TGA measurement of the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y, where X:Y means the acids weight ratios. ...
-
Adsorption and desorption of N2 measurement of MXenes catalysts
Open Research DataData contain results from adsorption and desorption of N2 measurement of the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y, where X:Y...
-
XRD patterns of MXenes catalysts
Open Research DataData contain results from XRD measurements of the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y, where X:Y means the acids weight ratios....
-
Raman spectra of MXenes catalysts
Open Research DataData contain results from Raman spectroscopy of the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y, where X:Y means the acids weight ratios. ...
-
SEM images of MXene catalysts
Open Research DataData contain results SEM measurements of the Ti3C2Tx MXenes produced via acidic etching aluminum from MAX Phase (Ti3C2-Al-Ti3C2-Al-Ti3C2) using different etching agents, HF/HCl and HF/H2SO4 with different weight ratios (1:3, 1:4, and 1:5). The samples were labeled as MXene HF/HCl X:Y and MXene HF/H2SO4 X:Y, where X:Y means the acids weight ratios. MAX...
-
Mobile chromatographs and spectrometers for the analysis of chemical warfare agents
PublicationThis article describes the technological state of readiness regarding mobile chromatographs and spectrometers and their appiicability for the analysis of chemical warfare agents (CWAs), degradation products, simulants, and precursors.
-
The Snow Team Problem
PublicationWe 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~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Complex modulus of Cement Bitumen Treated Material Mixture (28 days of curing at 20C)
Open Research DataDataset presents data of complex modulus determined for cold recycled mixture – cement bitumen treated material mixture with 3 combinations of binding agents: 2% cement, 6% emulsion (C2E6), 6% cement, 6% emulsion (C6E6), 6% cement, 2% emulsion (C6E2). Mixture was designed according to Polish requirements for the base course of pavement. Mixture contains...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis 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...
-
Other specified bacterial agents as the cause of diseases classified to other chapters - Female, 55 - Tissue image [5050730010502011]
Open Research DataThis is the histopathological image of STOMACH tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Complex modulus of Cement Bitumen Treated Material Mixture C3E4 laboratory mixed/laboratory compacted (7-365 days of curing at 20C)
Open Research DataDataset presents data of complex modulus determined for cold recycled mixture – cement bitumen treated material mixture with following binding agents: 3% cement, 4% emulsion (C3E4). Mixture was designed according to Polish requirements for the base course of pavement. Mixture was mixed in laboratory conditions on the basis of materials obtained from...
-
Complex modulus of Cement Bitumen Treated Material Mixture C3E4 field mixed/laboratory compacted (7-365 days of curing at 20C)
Open Research DataDataset presents data of complex modulus determined for cold recycled mixture – cement bitumen treated material mixture with following binding agents: 3% cement, 4% emulsion (C3E4). Mixture was designed according to Polish requirements for the base course of pavement. Mixture was mixed in the field conditions and later compacted in laboratory. Mixture...
-
Deformation Sweep Test of Cement Bitumen Treated Material Mixture C3E5.5 (field obtained material; over 28 days of curing at 20C)
Open Research DataDataset presents data of results of deformation sweep test determined for cold recycled mixture – cement bitumen treated material mixture with following binding agents: 3% cement and 5.5% emulsion (C3E5.5). Mixture was designed according to Polish requirements for the base course of pavement. Mixture contains 60% of RAP material. Specimen size: f=100...
-
Multi-agent large-scale parallel crowd simulation with NVRAM-based distributed cache
PublicationThis paper presents the architecture, main components and performance results for a parallel and modu-lar agent-based environment aimed at crowd simulation. The environment allows to simulate thousandsor more agents on maps of square kilometers or more, features a modular design and incorporates non-volatile RAM (NVRAM) with a fail-safe mode that can be activated to allow to continue computationsfrom a recently analyzed state in...
-
Travel agents and destination management organizations: eLearning as a strategy to train tourism trade partners.
PublicationThis article offers an overview of the existing online courses run by national destination management organizations (DMOs) in order to better equip travel agents and tour operators in the sales activities of the tourism destinations. These online courses represent one of the B2B offers by DMOs and an interesting opportunity for travel agents, who are trying to find their identity and competitive advantage within the context of...
-
Particle swarm optimization algorithms for autonomous robots with deterministic leaders using space filling movements
PublicationIn this work the swarm behavior principles of Craig W. Reynolds are combined with deterministic traits. This is done by using leaders with motions based on space filling curves like Peano and Hilbert. Our goal is to evaluate how the swarm of agents works with this approach, supposing the entire swarm will better explore the entire space. Therefore, we examine different combinations of Peano and Hilbert with the already known swarm...
-
Agent System for Managing Distributed Mobile Interactive Documents
PublicationThe 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...
-
Green sample preparation techniques for chromatographic determination of small organic compounds
PublicationAccurate monitoring of the state of the environment requires the introduction of additional isolation and/or preconcentration step prior to the chromatographic determination. In this work the information about novel methodological and instrumental solutions in relation to different variants of microextraction techniques are presented. Attention is focused on analytical procedure and suitable analytical tools for extraction of the...
-
Big Data and the Internet of Things in Edge Computing for Smart City
PublicationRequests expressing collective human expectations and outcomes from city service tasks can be partially satisfied by processing Big Data provided to a city cloud via the Internet of Things. To improve the efficiency of the city clouds an edge computing has been introduced regarding Big Data mining. This intelligent and efficient distributed system can be developed for citizens that are supposed to be informed and educated by the...
-
Complex modulus of Cement Bitumen Treated Material Mixture C3E4 cores obtained from the field section (28-365 days of curing at the field and later in laboratory at 20C)
Open Research DataDataset presents data of complex modulus determined for cold recycled mixture – cement bitumen treated material mixture with following binding agents: 3% cement, 4% emulsion (C3E4). Mixture was designed according to Polish requirements for the base course of pavement. Specimen were obtained from the field at 28, 180, 270 and 365 days after compaction....
-
Fatigue data of Cement Bitumen Treated Material Mixture C3E5.5 (over 28 days of curing at 20C)
Open Research DataFatigue data of Cement Bitumen Treated Material Mixture C3E5.5 (over 28 days of curing at 20C)
-
Complex modulus of Cement Bitumen Treated Material Mixture C3E5.5 (over 28 days of curing at 20C)
Open Research DataDataset presents data of complex modulus determined for cold recycled mixture – cement bitumen treated material mixture with following binding agents: 3% cement and 5.5% emulsion (C3E5.5). Mixture was designed according to Polish requirements for the base course of pavement. Mixture contains 60% of RAP material. Specimen size: f=100 mm, h=130 mm. Specimen...
-
The Impact of Long-Time Chemical Bonds in Mineral-Cement-Emulsion Mixtures on Stiffness Modulus
PublicationDeep cold in-place recycling is the most popular method of reuse of existing old and deteriorated asphalt layers of road pavements. In Poland, in most cases, the Mineral-Cement-Emulsion mixture technology is used, but there are also applications combining foamed bitumen and cement. Mineral-Cement-Emulsion mixtures contain two different binding agents – cement as well as asphalt from the asphalt emulsion. Asphalt creates asphalt...
-
Retrofitted vibro-pressed pavement bricks and their impregnation in modern architecture.
PublicationRecent construction projects require new properties of concrete building materials. The paper describes the technological methods of retrofitting of vibro-pressed concrete pavement brick and shows the results of improving physical properties of concrete by application of different impregnation agents.
-
Agent System for Managing Distributed Mobile Interactive Documents in Knowledge-Based Organizations
PublicationThe 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...
-
Clearing directed subgraphs by mobile agents
PublicationWe 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...
-
Synthetic strategies in construction of organic low molecular-weight carrier-drug conjugates
PublicationInefficient transportation of polar metabolic inhibitors through cell membranes of eukaryotic and prokaryotic cells precludes their direct use as drug candidates in chemotherapy. One of the possible solutions to this problem is application of the ‘Trojan horse’ strategy, i.e. conjugation of an active substance with a molecular carrier of organic or inorganic nature, facilitating membrane penetration. In this work, the synthetic...
-
Algorithms and Tools for Intelligent Control of Critical Infrastructure Systems
PublicationCritical Infrastructure Systems (CIS) are spatially distributed and of a network structure. The dynamics are nonlinear, uncertain and with several time scales. There is a variety of different objectives to be reliably met under a wide range of operational conditions. The operational conditions are influenced by the disturbance inputs, operating ranges of the CIS, faults in the sensors and actuators and abnormalities occurring in...
-
Regenerative Drug Discovery Using Ear Pinna Punch Wound Model in Mice
PublicationThe ear pinna is a complex tissue consisting of the dermis, cartilage, muscles, vessels, and nerves. Ear pinna healing is a model of regeneration in mammals. In some mammals, including rabbits, punch wounds in the ear pinna close spontaneously; in common-use laboratory mice, they remain for life. Agents inducing ear pinna healing are potential regenerative drugs. We tested the effects of selected bioactive agents on 2 mm ear pinna...
-
Catalysts for advanced oxidation processes: Deep eutectic solvents-assisted synthesis – A review
PublicationNew catalyst synthesis techniques, including green materials, are extensively studied for heterogeneous photocatalytic advanced oxidation processes (AOPs) on spotlight of sustainable development. Deep eutectic solvents (DESs) started to be used in this field as environmentally friendly alternative to ionic liquids (ILs). During the catalyst synthesis, DESs can act as stabilizers, capping agents, structure directing agents, templates,...
-
A proposition for integrating elements of game universe by means of behavioral trees
PublicationModern computer games often involve autonomous beings collaborating and competing with each other to reach their objectives in the game universe. It seems only natural to use agent-oriented approach in such cases. This article identifies the rules of building a game universe as an environment for executing agents. The paper also covers a method for decomposing compound behaviors into behavioral trees. Dividing complex behaviors...
-
A Review of Traffic Analysis Attacks and Countermeasures in Mobile Agents' Networks
PublicationFor 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,...
-
Optical method supported by machine learning for dynamics of C‐reactive protein concentrations changes detection in biological matrix samples
PublicationIn this article we present the novel spectroscopy method supported with machine learning for real-time detection of infectious agents in wastewater. In the case of infectious diseases, wastewater monitoring can be used to detect the presence of inflammation biomarkers, such as the proposed C-reactive protein, for monitoring inflammatory conditions and mass screening during epidemics for early detection in communities of concern,...
-
Viral agents as the cause of diseases classified to other chapters - Female, 29 - Tissue image [9220729551203171]
Open Research DataThis is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Viral agents as the cause of diseases classified to other chapters - Female, 29 - Tissue image [9220729551203921]
Open Research DataThis is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Viral agents as the cause of diseases classified to other chapters - Female, 29 - Tissue image [9220729551207901]
Open Research DataThis is the histopathological image of CERVIX UTERI tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Multi agent grid systems
PublicationThis chapter presents an idea of merging grid and volunteer systemswith multi agent systems. It gives some basics concerning multi agentsystem and the most followed standard. Some deliberations concerningsuch an existing systems were made in order to finally present possibilities of introducing agents into the Comcute system.