Search results for: graph neural network - Bridge of Knowledge

Search

Search results for: graph neural network

Filters

total: 2665
filtered: 2124

clear all filters


Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: graph neural network

  • Ship Resistance Prediction with Artificial Neural Networks

    Publication

    - Year 2015

    The paper is dedicated to a new method of ship’s resistance prediction using Artificial Neural Network (ANN). In the initial stage selected ships parameters are prepared to be used as a training and validation sets. Next step is to verify several network structures and to determine parameters with the highest influence on the result resistance. Finally, other parameters expected to impact the resistance are proposed. The research utilizes...

    Full text available to download

  • Graph security testing

    Set S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...

    Full text to download in external service

  • Comparative study of neural networks used in modeling and control of dynamic systems

    Publication

    In this paper, a diagonal recurrent neural network that contains two recurrent weights in the hidden layer is proposed for the designing of a synchronous generator control system. To demonstrate the superiority of the proposed neural network, a comparative study of performances, with two other neural network (1_DRNN) and the proposed second-order diagonal recurrent neural network (2_DRNN). Moreover, to confirm the superiority...

    Full text available to download

  • Constructing a map of an anonymous graph: applications of universal sequences

    Publication

    - LECTURE NOTES IN COMPUTER SCIENCE - Year 2010

    We study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...

    Full text to download in external service

  • Application of genetic algorithms in graph searching problem

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

  • Graph Decomposition for Memoryless Periodic Exploration

    Publication

    - ALGORITHMICA - Year 2012

    We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...

    Full text to download in external service

  • Neural Architecture Search for Skin Lesion Classification

    Deep neural networks have achieved great success in many domains. However, successful deployment of such systems is determined by proper manual selection of the neural architecture. This is a tedious and time-consuming process that requires expert knowledge. Different tasks need very different architectures to obtain satisfactory results. The group of methods called the neural architecture search (NAS) helps to find effective architecture...

    Full text available to download

  • Parallel tabu search for graph coloring problem

    Publication

    - Year 2006

    Tabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...

  • A survey of neural networks usage for intrusion detection systems

    In recent years, advancements in the field of the artificial intelligence (AI) gained a huge momentum due to the worldwide appliance of this technology by the industry. One of the crucial areas of AI are neural networks (NN), which enable commer‐ cial utilization of functionalities previously not accessible by usage of computers. Intrusion detection system (IDS) presents one of the domains in which neural networks are widely tested...

    Full text available to download

  • Coronas and Domination Subdivision Number of a Graph

    Publication

    In this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.

    Full text available to download

  • Zero-visibility cops and robber and the pathwidth of a graph

    Publication

    - JOURNAL OF COMBINATORIAL OPTIMIZATION - Year 2015

    We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...

    Full text to download in external service

  • On Tradeoffs Between Width- and Fill-like Graph Parameters

    In this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...

    Full text available to download

  • The convex domination subdivision number of a graph

    Publication

    Let G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...

    Full text available to download

  • Parallel immune system for graph coloring

    Publication

    - Year 2008

    This paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...

    Full text to download in external service

  • Non-monotone graph searching models

    Graph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...

  • Adding Interpretability to Neural Knowledge DNA

    Publication

    - CYBERNETICS AND SYSTEMS - Year 2022

    This paper proposes a novel approach that adds the interpretability to Neural Knowledge DNA (NK-DNA) via generating a decision tree. The NK-DNA is a promising knowledge representation approach for acquiring, storing, sharing, and reusing knowledge among machines and computing systems. We introduce the decision tree-based generative method for knowledge extraction and representation to make the NK-DNA more explainable. We examine...

    Full text available to download

  • Product Graph Invariants with Applications in the Theory of Information

    Publication

    - Year 2012

    There are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...

  • A construction for the hat problem on a directed graph

    Publication

    A team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...

    Full text available to download

  • An Automated Method for Biometric Handwritten Signature Authentication Employing Neural Networks

    Publication

    Handwriting biometrics applications in e-Security and e-Health are addressed in the course of the conducted research. An automated graphomotor analysis method for the dynamic electronic representation of the handwritten signature authentication was researched. The developed algorithms are based on dynamic analysis of electronically handwritten signatures employing neural networks. The signatures were acquired with the use of the...

    Full text available to download

  • Zero-Visibility Cops and Robber Game on a Graph

    Publication

    - LECTURE NOTES IN COMPUTER SCIENCE - Year 2013

    We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.

    Full text to download in external service

  • Neural Approximators for Variable-Order Fractional Calculus Operators (VO-FC)

    Publication

    - IEEE Access - Year 2022

    The paper presents research on the approximation of variable-order fractional operators by recurrent neural networks. The research focuses on two basic variable-order fractional operators, i.e., integrator and differentiator. The study includes variations of the order of each fractional operator. The recurrent neural network architecture based on GRU (Gated Recurrent Unit) cells functioned as a neural approximation for selected...

    Full text available to download

  • Modeling the impact of surface currents in a harbor using graph theory

    Publication

    - Zeszyty Naukowe Akademii Morskiej w Szczecinie - Year 2016

    Ensuring security in a harbor requires research into its infrastructure using spatial environmental data. This paper presents a methodology that defines the design of a graph for modeling the interactions between surface currents and moving objects. Combining this graph with port charts that integrate electronic navigation charts with coastal orthophotographs allows us to perform a multidimensional analysis. In addition, the complete...

    Full text available to download

  • Collision-Free Network Exploration

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

    - Year 2014

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

    Full text to download in external service

  • A Selection of Starting Points for Iterative Position Estimation Algorithms Using Feedforward Neural Networks

    Publication

    This article proposes the use of a feedforward neural network (FNN) to select the starting point for the first iteration in well-known iterative location estimation algorithms, with the research objective of finding the minimum size of a neural network that allows iterative position estimation algorithms to converge in an example positioning network. The selected algorithms for iterative position estimation, the structure of the...

    Full text available to download

  • Neural modelling of dynamic systems with time delays based on an adjusted NEAT algorithm

    Publication

    A problem related to the development of an algorithm designed to find an architecture of artificial neural network used for black-box modelling of dynamic systems with time delays has been addressed in this paper. The proposed algorithm is based on a well-known NeuroEvolution of Augmenting Topologies (NEAT) algorithm. The NEAT algorithm has been adjusted by allowing additional connections within an artificial neural network and...

    Full text to download in external service

  • Maritime Communications Network Development Using Virtualised Network Slicing of 5G Network

    Publication

    - Nase More - Year 2020

    The paper presents the review on perspectives of maritime systems development at the context of 5G systems implementation and their main properties. Firstly, 5G systems requirements and principles are discussed, which can be important for maritime applications. Secondly, the problems of network softwarisation, virtualisation and slicing, and possible types of services for potential implementation in 5G marine applications are described....

    Full text available to download

  • Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

    Publication

    - NEW JOURNAL OF PHYSICS - Year 2016

    We study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...

    Full text available to download

  • Towards neural knowledge DNA

    Publication

    - JOURNAL OF INTELLIGENT & FUZZY SYSTEMS - Year 2017

    In this paper, we propose the Neural Knowledge DNA, a framework that tailors the ideas underlying the success of neural networks to the scope of knowledge representation. Knowledge representation is a fundamental field that dedicates to representing information about the world in a form that computer systems can utilize to solve complex tasks. The proposed Neural Knowledge DNA is designed to support discovering, storing, reusing,...

    Full text available to download

  • Weakly convex domination subdivision number of a graph

    Publication

    - FILOMAT - Year 2016

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

    Full text available to download

  • Visual Features for Improving Endoscopic Bleeding Detection Using Convolutional Neural Networks

    Publication

    The presented paper investigates the problem of endoscopic bleeding detection in endoscopic videos in the form of a binary image classification task. A set of definitions of high-level visual features of endoscopic bleeding is introduced, which incorporates domain knowledge from the field. The high-level features are coupled with respective feature descriptors, enabling automatic capture of the features using image processing methods....

    Full text available to download

  • Distributed graph searching with a sense of direction

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

    Full text available to download

  • A MODEL FOR FORECASTING PM10 LEVELS WITH THE USE OF ARTIFICIAL NEURAL NETWORKS

    Publication

    - Year 2014

    This work presents a method of forecasting the level of PM10 with the use of artificial neural networks. Current level of particulate matter and meteorological data was taken into account in the construction of the model (checked the correlation of each variable and the future level of PM10), and unidirectional networks were used to implement it due to their ease of learning. Then, the configuration of the network (built on the...

    Full text available to download

  • Dynamically positioned ship steering making use of backstepping method and artificial neural networks

    The article discusses the issue of designing a dynamic ship positioning system making use of the adaptive vectorial backstepping method and RBF type arti cial neural networks. In the article, the backstepping controller is used to determine control laws and neural network weight adaptation laws. e arti cial neural network is applied at each time instant to approximate nonlinear functions containing parametric uncertainties....

    Full text available to download

  • Supply current signal and artificial neural networks in the induction motor bearings diagnostics

    Publication

    This paper contains research results of the diagnostics of induction motor bearings based on measurement of the supply current with usage of artificial neural networks. Bearing failure amount is greater than 40% of all engine failures, which makes their damage-free operation crucial. Tests were performed on motors with intentionally made bearings defects. Chapter 2 introduces the concept of artificial neural networks. It presents...

  • Selected Technical Issues of Deep Neural Networks for Image Classification Purposes

    In recent years, deep learning and especially Deep Neural Networks (DNN) have obtained amazing performance on a variety of problems, in particular in classification or pattern recognition. Among many kinds of DNNs, the Convolutional Neural Networks (CNN) are most commonly used. However, due to their complexity, there are many problems related but not limited to optimizing network parameters, avoiding overfitting and ensuring good...

    Full text available to download

  • Graph Representation Integrating Signals for Emotion Recognition and Analysis

    Data reusability is an important feature of current research, just in every field of science. Modern research in Affective Computing, often rely on datasets containing experiments-originated data such as biosignals, video clips, or images. Moreover, conducting experiments with a vast number of participants to build datasets for Affective Computing research is time-consuming and expensive. Therefore, it is extremely important to...

    Full text available to download

  • Application of the neural networks for developing new parametrization of the Tersoff potential for carbon

    Publication

    - TASK Quarterly - Year 2020

    Penta-graphene (PG) is a 2D carbon allotrope composed of a layer of pentagons having sp2- and sp3-bonded carbon atoms. A study carried out in 2018 has shown that the parameterization of the Tersoff potential proposed in 2005 by Ehrhart and Able (T05 potential) performs better than other potentials available for carbon, being able to reproduce structural and mechanical properties of the PG. In this work, we tried to improve the...

    Full text available to download

  • Distributed state estimation using a network of asynchronous processing nodes

    Publication

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

    Full text to download in external service

  • Distributed state estimation using a network of asynchronous processing nodes

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

    Full text to download in external service

  • Automatic Breath Analysis System Using Convolutional Neural Networks

    Publication

    Diseases related to the human respiratory system have always been a burden for the entire society. The situation has become particularly difficult now after the outbreak of the COVID-19 pandemic. Even now, however, it is not uncommon for people to consult their doctor too late, after the disease has developed. To protect patients from severe disease, it is recommended that any symptoms disturbing the respiratory system be detected...

    Full text to download in external service

  • Automatic Breath Analysis System Using Convolutional Neural Networks

    Publication

    Diseases related to the human respiratory system have always been a burden for the entire society. The situation has become particularly difficult now after the outbreak of the COVID-19 pandemic. Even now, however, it is common for people to consult their doctor too late, after the disease has developed. To protect patients from severe disease, it is recommended that any symptoms disturbing the respiratory system be detected as...

    Full text to download in external service

  • Network Approach to Increments of RR-intervals for Visualization of Dynamics of Cardiac Regulation

    Publication

    - Year 2014

    The transition network for RR -increments is pre- sented in a directed and weighted graph, with vertices represent- ing RR -increments and edges corresponding to the order in a sequence of increments. The adjacency matrix and the transition matrix of this network provide a graphical tool which could be useful in the assessment of cardiac regulation. As an example, the method is applied in detecting differences between diurnal activity...

    Full text to download in external service

  • Neural Modelling of Steam Turbine Control Stage

    Publication

    The paper describes possibility of steam turbine control stage neural model creation. It is of great importance because wider application of green energy causes severe conditions for control of energy generation systems operation Results of chosen steam turbine of 200 MW power measurements are applied as an example showing way of neural model creation. They serve as training and testing data of such neural model. Relatively simple...

    Full text to download in external service

  • Nordhaus-Gaddum results for the weakly convex domination number of a graph

    Artykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.

    Full text available to download

  • A novel approach exploiting properties of convolutional neural networks for vessel movement anomaly detection and classification

    Publication

    The article concerns the automation of vessel movement anomaly detection for maritime and coastal traffic safety services. Deep Learning techniques, specifically Convolutional Neural Networks (CNNs), were used to solve this problem. Three variants of the datasets, containing samples of vessel traffic routes in relation to the prohibited area in the form of a grayscale image, were generated. 1458 convolutional neural networks with...

    Full text available to download

  • Clothes Detection and Classification Using Convolutional Neural Networks

    Publication

    In this paper we describe development of a computer vision system for accurate detection and classification of clothes for e-commerce images. We present a set of experiments on well established architectures of convolutional neural networks, including Residual networks, SqueezeNet and Single Shot MultiBox Detector (SSD). The clothes detection network was trained and tested on DeepFashion dataset, which contains box annotations...

    Full text to download in external service

  • Automatic singing quality recognition employing artificial neural networks

    Publication

    Celem artykułu jest udowodnienie możliwości automatycznej oceny jakości technicznej głosów śpiewaczych. Pokrótce zaprezentowano w nim stworzoną bazę danych głosów śpiewaczych oraz zaimplementowane parametry. Przy pomocy sztucznych sieci neuronowych zaprojektowano system decyzyjny, który oceniono w pięciostopniowej skali jakość techniczną głosu. Przy pomocy metod statystycznych udowodniono, że wyniki generowane przez ten system...

    Full text available to download

  • Gesture Recognition With the Linear Optical Sensor and Recurrent Neural Networks

    In this paper, the optical linear sensor, a representative of low-resolution sensors, was investigated in the multiclass recognition of near-field hand gestures. The recurrent neural network (RNN) with a gated recurrent unit (GRU) memory cell was utilized as a gestures classifier. A set of 27 gestures was collected from a group of volunteers. The 27 000 sequences obtained were divided into training, validation, and test subsets....

    Full text available to download

  • INFLUENCE OF DATA NORMALIZATION ON THE EFFECTIVENESS OF NEURAL NETWORKS APPLIED TO CLASSIFICATION OF PAVEMENT CONDITIONS – CASE STUDY

    In recent years automatic classification employing machine learning seems to be in high demand for tele-informatic-based solutions. An example of such solutions are intelligent transportation systems (ITS), in which various factors are taken into account. The subject of the study presented is the impact of data pre-processing and normalization on the accuracy and training effectiveness of artificial neural networks in the case...

  • Hybrid of Neural Networks and Hidden Markov Models as a modern approach to speech recognition systems

    The aim of this paper is to present a hybrid algorithm that combines the advantages ofartificial neural networks and hidden Markov models in speech recognition for control purpos-es. The scope of the paper includes review of currently used solutions, description and analysis of implementation of selected artificial neural network (NN) structures and hidden Markov mod-els (HMM). The main part of the paper consists of a description...

    Full text available to download