Wyszukiwarka
Filtry
wszystkich: 40
Wyniki wyszukiwania dla: DISTRIBUTED ALGORITHM
-
A better practical algorithm for distributed graph coloring
Publikacja -
Distributed largest-first algorithm for graph coloring.
PublikacjaW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
Distributed Evolutionary Algorithm for Path Planning in Navigation Situation
PublikacjaThis article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...
-
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
Distributed measurement system with data transmission secured using XXTEA algorithm
PublikacjaThe paper deals with wireless data transmission security in the distributed measurement and control system. An overview of cryptographic algorithms was presented paying special attention to the algorithm dedicated to units with low processing power, which is important due to minimization of energy consumption. Measurement modules equipped with simple microcontrollers send data wirelessly to the central unit. The transmission was...
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Multi-criterion decision making in distributed systems by quantum evolutionary algorithms
PublikacjaDecision making by the AQMEA (Adaptive Quantum-based Multi-criterion Evolutionary Algorithm) has been considered for distributed computer systems. AQMEA has been extended by a chromosome representation with the registry of the smallest units of quantum information. Evolutionary computing with Q-bit chromosomes has been proofed to characterize by the enhanced population diversity than other representations, since individuals represent...
-
Optimization issues in distributed computing systems design
PublikacjaIn recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable...
-
Distributed Evacuation in Graphs with Multiple Exits
PublikacjaWe 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...
-
The distributed model predictive controller for the nuclear power plant turbo-generator set
PublikacjaTypically there are two main control loops with PI controllers operating at each turbo-generator set. In this paper a distributed model predictive controller DMPC, with local QDMC controllers for the turbine generator, is proposed instead of a typical PI controllers. The local QDMC controllers utilize step-response models for the controlled system components. These models parameters are determined based on the proposed black-box...
-
Grid Implementation of a Parallel Multiobjective Genetic Algorithm for Optimized Allocation of Chlorination Stations in Drinking Water Distribution Systems: Chojnice Case Study
PublikacjaSolving multiobjective optimization problems requires suitable algorithms to find a satisfactory approximation of a globally optimal Pareto front. Furthermore, it is a computationally demanding task. In this paper, the grid implementation of a distributed multiobjective genetic algorithm is presented. The distributed version of the algorithm is based on the island algorithm with forgetting island elitism used instead of a genetic...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublikacjaThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
PublikacjaConsider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given...
-
BeesyBees: A mobile agent-based middleware for a reliable and secure execution of service-based workflow applications in BeesyCluster
PublikacjaIntegrating 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...
-
Multi-criterion, evolutionary and quantum decision making in complex systems
PublikacjaMulti-criterion, evolutionary and quantum decision making supported by the Adaptive Quantum-based Multi-criterion Evolutionary Algorithm (AQMEA) has been considered for distributed complex systems. AQMEA had been developed to the task assignment problem, and then it has been applied to underwater vehicle planning as another benchmark three-criterion optimization problem. For evaluation of a vehicle trajectory three criteria have...
-
Multimodal Particle Swarm Optimization with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublikacjaIn this paper, a new meta-heuristic method of finding roots and poles of a complex function of a complex variable is presented. The algorithm combines an efficient space exploration provided by the particle swarm optimization (PSO) and the classification of root and pole occurrences based on the phase analysis of the complex function. The method initially generates two uniformly distributed populations of particles on the complex...
-
Further developments of parameterization methods of audio stream analysis for secuirty purposes
PublikacjaThe paper presents an automatic sound recognition algorithm intended for application in an audiovisual security monitoring system. A distributed character of security systems does not allow for simultaneous observation of multiple multimedia streams, thus an automatic recognition algorithm must be introduced. In the paper, a module for the parameterization and automatic detection of audio events is described. The spectral analyses...
-
Metaheuristic algorithms for optimization of resilient overlay computing systems
PublikacjaThe idea of distributed computing systems has been gaining much interest in recent years owing to the growing amount of data to be processed for both industrial and academic purposes. However, similar to other systems, also distributed computing systems are vulnerable to failures. Due to strict QoS requirements, survivability guarantees are necessary for provisioning of uninterrupted service. In this article, we focus on reliability...
-
Visual Traffic Noise Monitoring in Urban Areas
PublikacjaThe paper presents an advanced system for railway and road traffic noise monitoring in metropolitan areas. This system is a functional part of a more complex solution designed for environmental monitoring in cities utilizing analyses of sound, vision and air pollution, based on a ubiquitous computing approach. The system consists of many autonomous, universal measuring units and a multimedia server, which gathers, processes and...
-
Workshop on Algorithm Engineering
Konferencje -
Multi-agent graph searching and exploration algorithms
PublikacjaA 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...
-
Testing Stability of Digital Filters Using Multimodal Particle Swarm Optimization with Phase Analysis
PublikacjaIn this paper, a novel meta-heuristic method for evaluation of digital filter stability is presented. The proposed method is very general because it allows one to evaluate stability of systems whose characteristic equations are not based on polynomials. The method combines an efficient evolutionary algorithm represented by the particle swarm optimization and the phase analysis of a complex function in the characteristic equation....
-
Multiprocessor Implementation of Parallel Multiobjective Genetic Algorithm for Optimized Allocation of Chlorination Stations in Drinking Water Distribution System a New Water Quality Model Approach
PublikacjaThe Critical Infrastructure Systems (CISs) have received in recent years a considerable attention due to their heavy impact on sustainable development of modern societies. Most CISs may be classied as large scale complex systems of network structure, in uenced by strong interactions form the surrounding environment, internal and external interconnections. The later is a result of inter-CIS dependencies. The control, monitoring...
-
International Workshop on Combinatorial Algorithm
Konferencje -
Workshop on Algorithm Engineering and Experiments
Konferencje -
Self-Organising map neural network in the analysis of electromyography data of muscles acting at temporomandibular joint.
PublikacjaThe temporomandibular joint (TMJ) is the joint that via muscle action and jaw motion allows for necessary physiological performances such as mastication. Whereas mandible translates and rotates [1]. Estimation of activity of muscles acting at the TMJ provides a knowledge of activation pattern solely of a specific patient that an electromyography (EMG) examination was carried out [2]. In this work, a Self-Organising Maps (SOMs)...
-
Performance and Security Testing for Improving Quality of Distributed Applications Working in Public/Private Network Environments
PublikacjaThe goal of this dissertation is to create an integrated testing approach to distributed applications, combining both security and performance testing methodologies, allowing computer scientist to achieve appropriate balance between security and performance charakterstics from application requirements point of view. The constructed method: Multidimensional Approach to Quality Analysis (MA2QA) allows researcher to represent software...
-
Verification of algorithms determining wave loads on support structure of wind turbine
PublikacjaThe offshore wind turbines require determination of wave loads on their support structure. This structure is fixed and, therefore, this problem is reduced to solving only the diffraction problem, which is determined by Laplace equation and conditions on the following boundaries: on the support structure, on the sea free surface and on its bottom, and at infinity on free surface. The linear problem was applied to determine the wave...
-
Towards solving heterogeneous fleet vehicle routing problem with time windows and additional constraints: real use case study
PublikacjaIn advanced logistic systems, there is a need for a comprehensive optimization of the transport of goods, which would reduce costs. During past decades, several theoretical and practical approaches to solve vehicle routing problems (VRP) were proposed. The problem of optimal fleet management is often transformed to discrete optimization problem that relies on determining the most economical transport routes for a number of vehicles...
-
On a Recurrence Arising in Graph Compression
PublikacjaIn a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1p). A new node is created as long as...
-
Topology recognition and leader election in colored networks
PublikacjaTopology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Reliability data safety instrumented systems SIS from the functional safety analysis example critical instalation
Dane BadawczeThe dataset represents the results of an example of functional safety analysis systems is presented below. It is based on a control system, which consists of some basic components like sensors, programmable logic controllers and valves. It is a part of petrochemical critical installations. The communication between sensor logic controllers and actuators...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublikacjaWe 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...
-
The photocatalytic activity of MoS2 electrodes under sunlight illumination
Dane BadawczeThis dataset contains the results of the photocatalytic activities of the MoS2 and MoS2 modified by SnO2 were assessed through the photocatalytic reduction of Cr6+ under the sunlight illumination. In the experiment, 20 mg of the catalyst was distributed in the K2Cr2O7 aqueous solution (50 mL, 100 mg•L-1). The mixed solution was stirred for 30 min to...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo 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...
-
ALOFON corpus
Dane BadawczeThe ALOFON corpus is one of the multimodal database of word recordings in English, available at http://www.modality-corpus.org/. The ALOFON corpus is oriented towards the recording of the speech equivalence variants. For this purpose, a total of 7 people who are or speak English with native speaker fluency and a variety of Standard Southern British...
-
Brief Announcement: Energy Constrained Depth First Search
PublikacjaDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublikacjaWe 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...