Filters
total: 1750
filtered: 1389
-
Catalog
- Publications 1389 available results
- Journals 16 available results
- Conferences 20 available results
- Publishing Houses 1 available results
- People 20 available results
- Projects 5 available results
- e-Learning Courses 12 available results
- Events 2 available results
- Open Research Data 285 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: COLORING AGENT
-
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
On Optimal Backbone Coloring of Split and Threshold Graphs with Pairwise Disjoint Stars
Publication -
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
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...
-
Safe-Guarded Agent Design Pattern for Mechatronic Systems
Publication -
OROMACS: A Design Framework for Multi-agent Control System
Publication -
An Agent-Based Simulated Annealing Algorithm for Data Reduction
Publication -
Agent-Based Data Reduction Using Ensemble Technique
Publication -
Evolution of concept of agent system for information technology evaluation
Publication -
Multi-agent large-scale parallel crowd simulation
PublicationThis paper presents design, implementation and performance results of a new modular, parallel, agent-based and large scale crowd simulation environment. A parallel application, implemented with C and MPI, was implemented and run in this parallel environment for simulation and visualization of an evacuation scenario at Gdansk University of Technology, Poland and further in the area of districts of Gdansk. The application uses a...
-
Cancer-selective, single agent chemoradiosensitising gold nanoparticles
PublicationTwo nanometre gold nanoparticles (AuNPs), bearing sugar moieties and/or thiol-polyethylene glycol-amine (PEG-amine), were synthesised and evaluated for their in vitro toxicity and ability to radiosensitise cells with 220 kV and 6 MV X-rays, using four cell lines representing normal and cancerous skin and breast tissues. Acute 3 h exposure of cells to AuNPs, bearing PEG-amine only or a 50:50 ratio of alpha-galactose derivative and...
-
Fluctuation-Enhanced Sensing for Biological Agent Detection and Identification
PublicationPrzedstawiono wcześniejsze wyniki badań dotyczące trzech różnych sposobów wykrywania obecności substancji biologicznych za pomocą zjawisk fluktuacyjnych: 1) wirusów wnikających do komórek, 2) zapachów emitowanych przez mikroby, 3) rozkładu widma i wartości chwilowych szumów podczas rozpraszania światła używanego do wykrywania zarodników na podstawie wyznaczenia współczynnika dyfuzji opisująceo ich ruch.We survey and show our earlier...
-
Project Team Management Supported by an Agent-Based Model
PublicationThis work is a continuation of a series of works about research into the use of multi-agent systems to support IT project management. Previous studies have shown the possibility of using a multi-agent in order to optimize management decisions concerning the selection of methods for project implementation. It was noted that the project manager's decisions are influenced by three fundamental parameters: the entropy of the project,...
-
Agent-based social network as a simulation of a market behaviour
PublicationRecent years and the outbreak of world's economic crisis in 2008 proved the crucial importance of reliable analysis of market dynamics. However, werarely apply models of proper detail level (the global prosperity forecast of 2007 can be seen as a grim proof). The behaviour of individuals and companies is far from being ideal and rational. Many claims that the economic paradigm of rational expectations (coming from J. Muth and R....
-
Dissociative electron attachment to the radiosensitizing chemotherapeutic agent hydroxyurea
PublicationDissociative electron attachment to hydroxyurea was studied in the gas phase for electron energies ranging from zero to 9 eV in order to probe its radiosensitizing capabilities. The experiments were carried out using a hemispherical electron monochromator coupled with a quadrupole mass spectrometer. Diversified fragmentation of hydroxyurea was observed upon low energy electron attachment and here we highlight the major dissociation...
-
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....
-
Searching by Heterogeneous Agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
A note on fast approximate backbone coloring of split graphs with star--like backbones
PublicationDla grafu G = (V, E) z wyróżnionym podgrafem H, kolorowanie szkieletowe jest zdefiniowane jako odwzorowanie c spełniające |c(u) - c(v)| > 1 dla każdej krawędzi z E(H) oraz |c(u) - c(v)| > 0 dla każdej krawędzi z E(G). W pracy przedstawiono 1-przybliżony algorytm kolorowania szkieletowego split grafów ze skojarzeniem w szkielecie o złożoności O(|V|) oraz 1-przybliżony algorytm dla split grafów z rozłącznymi gwiazdami w szkielecie.
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Some results concerning the complexity of restricted colorings of graphs
Publication -
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Mesoporous Silica Nanospheres Functionalized by Tio2 as a Photoactive Antibacterial Agent
Publication -
Conjugate of Enkephalin and Temporin Peptides as a Novel Therapeutic Agent for Sepsis
Publication -
Agent-Based Population Learning Algorithm for RBF Network Tuning
Publication -
Implementation and performance evaluation of the agent-based algorithm for ANN training
Publication -
Agent-Based Approach to RBF Network Training with Floating Centroids
Publication -
An Experimental Study of Scenarios for the Agent-Based RBF Network Design
Publication -
History-based dynamic weight voting for multi-agent systems
PublicationTaking decision in multi-agent systems may involve voting. Two basic voting protocols are surveyed in the paper. Then, a new history-based dynamic weight voting is proposed. This voting protocol allows for identification of the agents which contribute to the correct system decision. The proposed solution is contrasted with majority voting and with weighted average voting, to show its advantages
-
A Human Behaviour Model Agent for Testing of Voluntary Computing Systems
PublicationPaper presents a design and performance of a voluntary-based distributed computing system testing agent, implementing a human behaviour model. The agent, nicknamed iRobot, was designed and implemented to enable controlled, large scale testing of core algorithms of Comcute - a new voluntary distributed computing platform complementary to BOINC. The main agent design goals were: emulation of human behaviour when browsing web pages,...
-
Detection of immunological agent by optical fiber sensor: preliminary study
PublicationThe objective of this study is the application of optical methods for detection of immunological agent concentration. As the agent we used the Cyclaid, produced by Apotex Inc. In this article we investigated different Cyclaid concentrations in water. We used a Fabry-Pérot interferometer working in a reflective mode, the measurements were performed with source with central wavelength λ = 1550 nm. The preliminary investigation have...
-
Machine Learning in Multi-Agent Systems using Associative Arrays
PublicationIn this paper, a new machine learning algorithm for multi-agent systems is introduced. The algorithm is based on associative arrays, thus it becomes less complex and more efficient substitute of artificial neural networks and Bayesian networks, which is confirmed by performance measurements. Implementation of machine learning algorithm in multi-agent system for aided design of selected control systems allowed to improve the performance...
-
Validation of an Agent and Ontology-based Information Technology Assessment System
PublicationThe aim of this paper is to present a new method of the validation of an Agent and Ontology-based Information Technology Assessment System. In the introduction part of the paper, the characteristics of the proposed multi-agent system are presented. Next, some important details regarding the ontology functionality of this system are described and an approach to its verification process is proposed. The approach employs semantic...
-
Supporting Software Project Management Processes Using the Agent System
PublicationThe natural development of information technology area stimulates intense growth of various technologies which support basic organization processes. The range of technologies implies appropriate management thereof, as well as accurate correspondence with conducted activities. Abandonment of activities within individual branches in favour of project approach to performed assignments (especially those connected with software development)...
-
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...
-
Multi-Agent Signal Filtering for Electrical Energy Demand Management
PublicationConsumers participating in electrical energy Demand Response (DR) programs may be exposed to energy-use related decisions at instants of time which are generally hard to predict. This is especially cumbersome to residential consumers who are less capable of investing in special equipment, or devoting significant time to analyze information and take decisions. To ease residential consumer participation, a multi-agent system proposed...
-
Stabilizing agents and protein stability
PublicationBiałka są kluczowymi elementami żywych organizmów, jak również efektywnymi katalizatorami w biotechnologii i medycynie. Szybki rozwój wielu gałęzi biotechnologii wiąże się z coraz większym zapotrzebowaniem na produkty białkowe charakteryzujące się wysoką stabilnością. Jednym ze sposobów osiągnięcia większej stabilności białek jest wykorzystanie małych związków organicznych, tzw. osmolitów. Do tej grupy związków należą aminokwasy,...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Graphene Oxide-Based Nanocomposites Decorated with Silver Nanoparticles as an Antibacterial Agent
Publication -
A Prototype of Educational Agent in Distance Learning Environment - Virtual Student Assistant
PublicationW zdalnym nauczaniu pojawia się wiele systemów wspierających, z których niezwykle ciekawym przykładem są agenty edukacyjne. Wśród wielu rodzajów agentów edukacyjnych wyróżnia się osobistych asystentów, których rolą jest organizacyjna pomoc osobie zdobywającej wiedzę. Artykuł jest poświęcony zaimplementowanemu na Wydziale ETI Politechniki Gdańskiej prototypowi agenta edukacyjnego o nazwie WAS (Wirtualny Asystent Studenta). Pokazana...
-
Moisture damage mechanism and material selection of HMA with amine antistripping agent
Publication