Search
Search results for: Graph algorithms
-
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)...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
Ontology-Driven Rule-Based Model for an Extension of Information Technology Infrastructure Library Processes
PublicationThe aim of this study is to present the stages for building a development model to create information technology (IT) systems for IT service providers. In order to ensure the consistency of the model, a novel solution is proposed where the stages of the model's construction are controlled using ontologies dedicated to the ITIL standard. In this article, a description of models used to assess the provider organization, with particular...
-
Distributed state estimation using a network of asynchronous processing nodes
PublicationWe consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...
-
Parallel Computations of Text Similarities for Categorization Task
PublicationIn this chapter we describe the approach to parallel implementation of similarities in high dimensional spaces. The similarities computation have been used for textual data categorization. A test datasets we create from Wikipedia articles that with their hyper references formed a graph used in our experiments. The similarities based on Euclidean distance and Cosine measure have been used to process the data using k-means algorithm....
-
Distributed state estimation using a network of asynchronous processing nodes
PublicationWe consider the problem of distributed state estimation of continuous-time stochastic processes using a~network of processing nodes. Each node performs measurement and estimation using the Kalman filtering technique, communicates its results to other nodes in the network, and utilizes similar results from the other nodes in its own computations. We assume that the connection graph of the network is not complete, i.e. not all nodes...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
The application of nonlinear curvature sections in the turnout diverging track
PublicationThe paper presents the analytical method of modelling the diverging track of railway turnout with nonlinear curvature sections. These sections were used for smoothing the graph of curvature in the extreme areas of turnout. The problem of the curvature distribution was identified with the use of differential equations. The resulting solutions are of universal nature for example the ability of assuming any values of curvature at...
-
Knowledge-based functional safety management using ProSIL software
PublicationIn the article the ProSIL software for computer aided functional safety management is presented. The software consists of three modules for the determination of the required SIL level (ProSILen) and verification of the SIL level (ProSILver). In the ProSIL the calibrated knowledge-based risk graph method for determining the required safety integrity level (SIL) of the safety functions identified in hazard analysis is implemented....
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Hat problem on the cycle C4
PublicationThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
The hat problem on a union of disjoint graphs
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Mitigation of Fake Data Content Poisoning Attacks in NDN via Blockchain
PublicationAbstract—Information-centric networks struggle with content poisoning attacks (CPAs), especially their stronger form called Fake Data CPA, in which an intruder publisher uploads content signed with stolen credentials. Following an existing graphinfection based approach leveraging the constrained time when stolen credentials are useful, we design a blockchain-based mitigation scheme for Named Data Networking architectures. We postulate...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
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...
-
On a matching distance between rooted phylogenetic trees
PublicationThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
Research into the Movements of Surface Water Masses in the Basins Adjacent to the Port
PublicationThis paper presents the results of the practical and simulation research into determining the routes of movement of small objects moving together with surface water masses in basins adjacent to the port. The results of this research were referenced against the modelling of routes of small objects in port channel basins. The results of practical research concerning the movement of small objects in basins adjacent to the port were...
-
Applying case studies to teaching architectural investment
PublicationCase studies enable students to encounter practical issues during their education. Experiments conducted in class employing this method often feature simplified models of real-world situations. However, they still enable students to encounter actual problems, to which theoretical knowledge is applied. In architectural education, students carrying out semester projects usually rely on data provided by the teacher, without wondering...
-
Dobór optymalnej liczby jednostek funcjonalnych dla realizacji syntezy wysokiego poziomu układów cyfrowych
PublicationW pracy przedstawiono algorytm MNP (ang. minimization the number of procesing elements) wyznaczający liczbę jednostek funkcjonalnych niezbędnych do syntezy wysokiego poziomu zadania opisanego grafem przepływu danych (DFG - ang. data flow graph). Liczba jednostek funkcjonalnych wyznaczana przez prezentowany algorytm jest optymalna zarówno z punktu widzenia kosztów wykonania układu, jak i szybkości jego działania. Rozwiązanie tego...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
A model, design, and implementation of an efficient multithreaded workflow execution engine with data streaming, caching, and storage constraints
PublicationThe paper proposes a model, design, and implementation of an efficient multithreaded engine for execution of distributed service-based workflows with data streaming defined on a per task basis. The implementation takes into account capacity constraints of the servers on which services are installed and the workflow data footprint if needed. Furthermore, it also considers storage space of the workflow execution engine and its cost....
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Wpływ struktur wsparcia na efektywność nauczania języka pisanego w środowisku e-learningowym
PublicationThe process of knowledge and language skills development during an online course can be very effective if student engagement in learning is achieved. This can be attained by introducing general and specific support mechanisms prior to the commencement of the course and during it. The former relates to the technological aspect, that is to familiarizing students with the functionalities of the virtual learning environment they will...
-
Mitigating Time-Constrained Stolen-Credentials Content Poisoning in an NDN Setting
PublicationNDN is a content-centric networking architecture using globally addressable information objects, created by publishers and cached by network nodes to be later accessed by subscribers. Content poisoning attacks consist in the substi-tution by an intruder publisher of bogus objects for genuine ones created by an honest publisher. With valid credentials stolen from an honest publisher, such attacks seem unstoppa-ble unless object...
-
Scanning networks with cactus topology
PublicationThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublicationThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
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...
-
CAUSALITY IN MODELS OF THERMAL PROCESSES IN SHIP ENGINE ROOMS WITH THE USE OF BOND GRAPH (BG) METHOD
PublicationWith a single approach to modeling elements of different physical nature, the method of Bond Graph (BG) is particularly well suited for modeling energy systems consisting of mechanical, thermal, electrical and hydraulic elements that operate in the power system engine room. The paper refers to the earlier presented new concept of thermal process modeling using the BG method. The authors own suggestions for determining causality...
-
Three levels of fail-safe mode in MPI I/O NVRAM distributed cache
PublicationThe paper presents architecture and design of three versions for fail-safe data storage in a distributed cache using NVRAM in cluster nodes. In the first one, cache consistency is assured through additional buffering write requests. The second one is based on additional write log managers running on different nodes. The third one benefits from synchronization with a Parallel File System (PFS) for saving data into a new file which...
-
Combining Road Network Data from OpenStreetMap with an Authoritative Database
PublicationComputer modeling of road networks requires detailed and up-to-date dataset. This paper proposes a method of combining authoritative databases with OpenStreetMap (OSM) system. The complete route is established by finding paths in the graph constructed from partial data obtained from OSM. In order to correlate data from both sources, a method of coordinate conversion is proposed. The algorithm queries road data from OSM and provides...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
COMPUTER-AIDED CONSTRUCTION AT DESIGNING REINFORCED CONCRETE COLUMNS AS PER EC
PublicationThe article presents the author’s computer program for designing and dimensioning columns in reinforced concrete structures taking into account phenomena affecting their behaviour and information referring to design as per EC. The computer program was developed with the use of C++ programming language. The program guides the user through particular dimensioning stages: from introducing basic data such as dimensions, concrete...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Determining and verifying the safety integrity level of the safety instrumented systems with the uncertainty and security aspects
PublicationSafety and security aspects consist of two different group of functional requirements for the control and protection systems. In the paper it is proposed that the security analysis results can be used as a factor increasing or decreasing the risk level. It concerns a process of determining required safety integrity level of given safety functions. The authors propose a new approach for functional safety risk analysis. In this case...
-
New Performance Indices for Power System Stabilizers
PublicationThe subject of the article is issues related to innovative indices for power system stabilizers (PSSs). These new indices will be able to quickly show which PSS (among many other PSSs) is not working properly and that advanced optimization and simulation methods should be used to improve the PSS settings. The authors note the fact that the acceptance requirements for PSSs are different in various power systems. Moreover, the authors...
-
Emotion Recognition from Physiological Channels Using Graph Neural Network
PublicationIn recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...
-
Communication and Load Balancing Optimization for Finite Element Electromagnetic Simulations Using Multi-GPU Workstation
PublicationThis paper considers a method for accelerating finite-element simulations of electromagnetic problems on a workstation using graphics processing units (GPUs). The focus is on finite-element formulations using higher order elements and tetrahedral meshes that lead to sparse matrices too large to be dealt with on a typical workstation using direct methods. We discuss the problem of rapid matrix generation and assembly, as well as...
-
Method of evaluation of lubricating ability of lube oils and fuels in energetistic formulation
PublicationThe paper presents an interpretation of operation of a boundary layer of a lubricating medium. A model of the homogeneous Poisson process has been proposed to assess the deterioration process of the layer's operation. The assessment considers the original interpretation of operation of a boundary layer, as a lubricity measure of a boundary layer of any lubricant. In the submitted proposal the operation of a boundary layer is understood...
-
Experimental and theoretical investigation of conformational states and noncovalent interactions in crystalline sulfonamides with a methoxyphenyl moiety
PublicationFour sulfonamide derivatives with a methoxyphenyl moiety, namely N-{4-[(2-methoxyphenyl)sulfamoyl] phenyl}acetamide (1a), N-{4-[(3-methoxyphenyl)sulfamoyl]phenyl}acetamide (1b), 4-amino-N-(2- methoxyphenyl)benzenesulfonamide (2a) and 4-amino-N-(3-methoxyphenyl)benzenesulfonamide (2b), have been synthesized and characterized physiochemically by CHNS, MS, FT-IR, 1H NMR, 13C NMR, PXRD and TG methods. Crystal structures were determined...
-
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...
-
Distributed graph searching with a sense of direction
PublicationIn 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...
-
Detecting type of hearing loss with different AI classification methods: a performance review
PublicationHearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...