Filtry
wszystkich: 2730
wybranych: 2179
-
Katalog
- Publikacje 2179 wyników po odfiltrowaniu
- Czasopisma 62 wyników po odfiltrowaniu
- Konferencje 55 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 70 wyników po odfiltrowaniu
- Projekty 5 wyników po odfiltrowaniu
- Kursy Online 21 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 333 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: GRAPH NEURAL NETWORK
-
Scanning networks with cactus topology
PublikacjaThe 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...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublikacjaLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
On the Hat Problem on the Cycle C7
PublikacjaThe 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 a win. In this version every player can...
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Optimized Deep Learning Model for Flood Detection Using Satellite Images
PublikacjaThe increasing amount of rain produces a number of issues in Kerala, particularly in urban regions where the drainage system is frequently unable to handle a significant amount of water in such a short duration. Meanwhile, standard flood detection results are inaccurate for complex phenomena and cannot handle enormous quantities of data. In order to overcome those drawbacks and enhance the outcomes of conventional flood detection...
-
Neuroendocrine neoplasms of the small intestine and the appendix — update of the diagnostic and therapeutic guidelines (recommended by the Polish Network of Neuroendocrine Tumours) [Nowotwory neuroendokrynne jelita cienkiego i wyrostka robaczkowego — uaktualnione zasady diagnostyki i leczenia (rekomendowane przez Polską Sieć Guzów Neuroendokrynnych)]
Publikacja -
Update of the diagnostic and therapeutic guidelines for gastro-entero-pancreatic neuroendocrine neoplasms (recommended by the Polish Network of Neuroendocrine Tumours) [Aktualizacja zaleceń ogólnych dotyczących postępowania diagnostyczno-terapeutycznego w nowotworach neuroendokrynnych układu pokarmowego (rekomendowane przez Polską Sieć Guzów Neuroendokrynnych)]
Publikacja -
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Hat problem on odd cycles
PublikacjaThe 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 a win. In this version every player can...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Thermal Image Processing for Respiratory Estimation from Cubical Data with Expandable Depth
PublikacjaAs healthcare costs continue to rise, finding affordable and non-invasive ways to monitor vital signs is increasingly important. One of the key metrics for assessing overall health and identifying potential issues early on is respiratory rate (RR). Most of the existing methods require multiple steps that consist of image and signal processing. This might be difficult to deploy on edge devices that often do not have specialized...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Prediction of the Biogenic Amines Index of Poultry Meat Using an Electronic Nose
PublikacjaThe biogenic amines index of fresh chicken meat samples during refrigerated storage was predicted based on the headspace analysis using an electronic nose equipped with an array of electrochemical sensors. The reference biogenic amines index values were obtained using dispersive liquid–liquid microextraction–gas chromatography–mass spectrometry. A prototype electronic nose with modular construction and a dedicated sample chamber...
-
The Development of a Combined Method to Quickly Assess Ship Speed and Fuel Consumption at Different Powertrain Load and Sea Conditions
PublikacjaDecision support systems (DSS) recently have been increasingly in use during ships operation. They require realistic input data regarding different aspects of navigation. To address the optimal weather routing of a ship, which is one of the most promising field of DSS application, it is necessary to accurately predict an actually attainable speed of a ship and corresponding fuel consumption at given loading conditions and predicted...
-
Standard of living in Poland at regional level - classification with Kohonen self-organizing maps
PublikacjaThe standard of living is spatially diversified and its analyzes enable shaping regional policy. Therefore, it is crucial to assess the standard of living and to classify regions due to their standard of living, based on a wide set of determinants. The most common research methods are those based on composite indicators, however, they are not ideal. Among the current critiques moved to the use of composite...
-
Vehicle detector training with labels derived from background subtraction algorithms in video surveillance
PublikacjaVehicle detection in video from a miniature station- ary closed-circuit television (CCTV) camera is discussed in the paper. The camera provides one of components of the intelligent road sign developed in the project concerning the traffic control with the use of autonomous devices being developed. Modern Convolutional Neural Network (CNN) based detectors need big data input, usually demanding their manual labeling. In the presented...
-
Behavior Analysis and Dynamic Crowd Management in Video Surveillance System
PublikacjaA concept and practical implementation of a crowd management system which acquires input data by the set of monitoring cameras is presented. Two leading threads are considered. First concerns the crowd behavior analysis. Second thread focuses on detection of a hold-ups in the doorway. The optical flow combined with soft computing methods (neural network) is employed to evaluate the type of crowd behavior, and fuzzy logic aids detection...
-
A Study of Cross-Linguistic Speech Emotion Recognition Based on 2D Feature Spaces
PublikacjaIn this research, a study of cross-linguistic speech emotion recognition is performed. For this purpose, emotional data of different languages (English, Lithuanian, German, Spanish, Serbian, and Polish) are collected, resulting in a cross-linguistic speech emotion dataset with the size of more than 10.000 emotional utterances. Despite the bi-modal character of the databases gathered, our focus is on the acoustic representation...
-
Ranking Speech Features for Their Usage in Singing Emotion Classification
PublikacjaThis paper aims to retrieve speech descriptors that may be useful for the classification of emotions in singing. For this purpose, Mel Frequency Cepstral Coefficients (MFCC) and selected Low-Level MPEG 7 descriptors were calculated based on the RAVDESS dataset. The database contains recordings of emotional speech and singing of professional actors presenting six different emotions. Employing the algorithm of Feature Selection based...
-
Buried Object Characterization Using Ground Penetrating Radar Assisted by Data-Driven Surrogate-Models
PublikacjaThis work addresses artificial-intelligence-based buried object characterization using 3-D full-wave electromagnetic simulations of a ground penetrating radar (GPR). The task is to characterize cylindrical shape, perfectly electric conductor (PEC) object buried in various dispersive soil media, and in different positions. The main contributions of this work are (i) development of a fast and accurate data driven surrogate modeling...
-
An electronic nose for quantitative determination of gas concentrations
PublikacjaThe practical application of human nose for fragrance recognition is severely limited by the fact that our sense of smell is subjective and gets tired easily. Consequen tly, there is considerable need for an instrument that can be a substitution of the human sense of smell. Electronic nose devices from the mid 1980s are used in growing number of applications. They comprise an array of several electrochemical gas sensors...
-
Mixed-use buildings as the basic unit that shapes the housing environment of smart cities of the future
PublikacjaThe contemporary approach to creating the residential function is confronted with the trend of increasing the volume of buildings and expectations regarding the future urban environment focused on sustainable development. This paper presents an overview of the residential structure in the context of defined thematic scopes. Namely, it is a systemic approach to the problem of designing mixed-use buildings which create a modern residential...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Software tool for modelling of mechatronic systems with elastic continua
PublikacjaThe paper presents a systematic computational package for modelling and analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The constructed computer program enables the frequency domain analysis of a class of linear systems and to obtain reduced order model in the form of bond graph. Obtained modal bond graph can be directly exported into 20-Sim package to further processing including nonlinear...
-
Weighted 2-sections and hypergraph reconstruction
PublikacjaIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Neurocontrolled Car Speed System
PublikacjaThe features of the synthesis of neural controllers for the car speed control system are considered in this article. The task of synthesis is to determine the weight coefficients of neural networks that provide the implementation of proportional and proportional-integralderivative control laws. The synthesis of controllers is based on an approach that uses a reversed model of the standard. A model of the car speed control system with...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublikacjaW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublikacjaIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
Runge-Kutta bicharacteristic methods for first order partial functional di- fferential equations
PublikacjaW pracy prezentujemy nową klasę metod numerycznych dla równań różniczkowo-funkcyjnych. Są to metody bicharakterystyk Rungego-Kutty. Ponadto porównuje-my wprowadzone metody z metodami klasycznymi.
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublikacjaThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Drawing maps with advice
PublikacjaW pracy podejmujemy temat konstrukcji algorytmu dla agenta, który zostaje umieszczony w dowolnym wierzchołku grafu (wierzchołki są nierozróżnialne, krawędzie mają etykiety portów), po czym realizuje algorytm zmierzający do znalezienia drzewa spinającego grafu lub izomorficznej kopii grafu. Dla obu problemów podajemy asymptotycznie dokładne lub prawie dokładne oszacowania na ilość bitów dodatkowej informacji, którą agent musi otrzymać...
-
Prognozirovanie svojstv betonov s pomoŝ'û iskusstvennyh nejronovyh setej
PublikacjaObserwacje mózgu ludzkiego oraz podstawowych komórek z jakich się składa (neuronów), doprowadziły do prób modelowania niedużych układów połączonych neuronów. Układy te, zwane w literaturze jako sieci neuronowe lub sieci neuropodobne (ang. neural network) wykazują pewne cechy zbliżone do cech mózgu. Są nimi np. zdolność uczenia i kojarzenia. Choć znany obecnie model matematyczny neuronu jest dość skomplikowany, to zachęcające wyniki...
-
Comparison of the effectiveness of automatic EEG signal class separation algorithms
PublikacjaIn this paper, an algorithm for automatic brain activity class identification of EEG (electroencephalographic) signals is presented. EEG signals are gathered from seventeen subjects performing one of the three tasks: resting, watching a music video and playing a simple logic game. The methodology applied consists of several steps, namely: signal acquisition, signal processing utilizing z-score normalization, parametrization and...
-
Vehicle Detection with Self-Training for Adaptative Video Processing Embedded Platform
PublikacjaTraffic monitoring from closed-circuit television (CCTV) cameras on embedded systems is the subject of the performed experiments. Solving this problem encounters difficulties related to the hardware limitations, and possible camera placement in various positions which affects the system performance. To satisfy the hardware requirements, vehicle detection is performed using a lightweight Convolutional Neural Network (CNN), named...
-
Novel analytical method for detection of orange juice adulteration based on ultra-fast gas chromatography
PublikacjaThe food authenticity assessment is an increasingly important issue in food quality and safety. The application of an electronic nose based on ultra-fast gas chromatography technique enables rapid analysis of the volatile compounds from food samples. Due to the fact that this technique provides chemical profiling of natural products, it can be a powerful tool for authentication in combination with chemometrics. In this article,...
-
Limited selectivity of amperometric gas sensors operating in multicomponent gas mixtures and methods of selectivity improvement
PublikacjaIn recent years, smog and poor air quality have became a growing environmental problem. There is a need to continuously monitor the quality of the air. The lack of selectivity is one of the most important problems limiting the use of gas sensors for this purpose. In this study, the selectivity of six amperometric gas sensors is investigated. First, the sensors were calibrated in order to find a correlation between the concentration...
-
Mask Detection and Classification in Thermal Face Images
PublikacjaFace masks are recommended to reduce the transmission of many viruses, especially SARS-CoV-2. Therefore, the automatic detection of whether there is a mask on the face, what type of mask is worn, and how it is worn is an important research topic. In this work, the use of thermal imaging was considered to analyze the possibility of detecting (localizing) a mask on the face, as well as to check whether it is possible to classify...
-
INVESTIGATION OF THE LOMBARD EFFECT BASED ON A MACHINE LEARNING APPROACH
PublikacjaThe Lombard effect is an involuntary increase in the speaker’s pitch, intensity, and duration in the presence of noise. It makes it possible to communicate in noisy environments more effectively. This study aims to investigate an efficient method for detecting the Lombard effect in uttered speech. The influence of interfering noise, room type, and the gender of the person on the detection process is examined. First, acoustic parameters...
-
Equal Baseline Camera Array—Calibration, Testbed and Applications
PublikacjaThis paper presents research on 3D scanning by taking advantage of a camera array consisting of up to five adjacent cameras. Such an array makes it possible to make a disparity map with a higher precision than a stereo camera, however it preserves the advantages of a stereo camera such as a possibility to operate in wide range of distances and in highly illuminated areas. In an outdoor environment, the array is a competitive alternative...