Search
Filters
total: 2659
filtered: 2118
-
Catalog
- Publications 2118 available results
- Journals 62 available results
- Conferences 55 available results
- Publishing Houses 1 available results
- People 70 available results
- Projects 4 available results
- e-Learning Courses 15 available results
- Events 4 available results
- Open Research Data 330 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: graph neural network
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn 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
PublicationA 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...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn 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.
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider 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...
-
Runge-Kutta bicharacteristic methods for first order partial functional di- fferential equations
PublicationW 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
PublicationGiven 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
PublicationA 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
PublicationThis 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...
-
Prognozirovanie svojstv betonov s pomoŝ'û iskusstvennyh nejronovyh setej
PublicationObserwacje 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
PublicationIn 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...
-
Limited selectivity of amperometric gas sensors operating in multicomponent gas mixtures and methods of selectivity improvement
PublicationIn 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...
-
Novel analytical method for detection of orange juice adulteration based on ultra-fast gas chromatography
PublicationThe 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,...
-
Equal Baseline Camera Array—Calibration, Testbed and Applications
PublicationThis 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...
-
Vehicle Detection with Self-Training for Adaptative Video Processing Embedded Platform
PublicationTraffic 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...
-
Mask Detection and Classification in Thermal Face Images
PublicationFace 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
PublicationThe 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...
-
Drawing maps with advice
PublicationW 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ć...
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Non-isolating 2-bondage in graphs
PublicationA 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 non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
BETWEEN IDEA AND INTERPRETATION - DESIGN PROCESS AUGMENTATION
PublicationThe following paper investigates the idea of reducing the human digital intervention to a minimum during the advanced design process. Augmenting the outcome attributes beyond the designer's capabilities by computational design methods, data collection, data computing and digital fabrication, altogether imitating the human design process. The primary technical goal of the research was verification of restrictions and abilities used...
-
Prediction of maximum tensile stress in plain-weave composite laminates with interacting holes via stacked machine learning algorithms: A comparative study
PublicationPlain weave composite is a long-lasting type of fabric composite that is stable enough when being handled. Open-hole composites have been widely used in industry, though they have weak structural performance and complex design processes. An extensive number of material/geometry parameters have been utilized for designing these composites, thereby an efficient computational tool is essential for that purpose. Different Machine Learning...
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublicationThe 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...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Musical Instrument Tagging Using Data Augmentation and Effective Noisy Data Processing
PublicationDeveloping signal processing methods to extract information automatically has potential in several applications, for example searching for multimedia based on its audio content, making context-aware mobile applications (e.g., tuning apps), or pre-processing for an automatic mixing system. However, the last-mentioned application needs a significant amount of research to reliably recognize real musical instruments in recordings....
-
LONG-TERM RISK CLASS MIGRATIONS OF NON-BANKRUPT AND BANKRUPT ENTERPRISES
PublicationThis paper investigates how the process of going bankrupt can be recognized much earlier by enterprises than by traditional forecasting models. The presented studies focus on the assessment of credit risk classes and on determination of the differences in risk class migrations between non-bankrupt enterprises and future insolvent firms. For this purpose, the author has developed a model of a Kohonen artificial neural network to...
-
A Novel Spatio–Temporal Deep Learning Vehicle Turns Detection Scheme Using GPS-Only Data
PublicationWhether the computer is driving your car or you are, advanced driver assistance systems (ADAS) come into play on all levels, from weather monitoring to safety. These modern-day ADASs use various assisting tools for drivers to keep the journey safe; these sophisticated tools provide early signals of numerous events, such as road conditions, emerging traffic scenarios, and weather warnings. Many urban applications, such as car-sharing...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublicationIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
Modelowanie przepływu pary przez okołodźwiękowe wieńce turbinowe z użyciem sztucznych sieci neuronoych
PublicationNiniejszy artykuł stanowi opis modelu przepływu pary przez okołodźwiękowe stopnie turbinowe, stworzonego w oparciu o sztuczne sieci neuronowe (SSN). Przedstawiony model neuronowy pozwala na wyznaczenie rozkładu wybranych parametrów w analizowanym przekroju kanału przepływowego turbiny dla rozpatrywanego zakresu wartości ciśnienia wlotowego.
-
The hat problem on cycles on at least nine vertices
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...
-
Algorithms for testing security in graphs
PublicationIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
2-Coloring number revisited
Publication2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Service-based Resilience via Shared Protection in Mission-critical Embedded Networks
PublicationMission-critical networks, which for example can be found in autonomous cars and avionics, are complex systems with a multitude of interconnected embedded nodes and various service demands. Their resilience against failures and attacks is a crucial property and has to be already considered in their design phase. In this paper, we introduce a novel approach for optimal joint service allocation and routing, leveraging virtualized...
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Model neuronowy jako alternatywa dla numerycznego modelu okołodźwiękowego przepływu pary przez palisadę turbinową.
PublicationWystępowanie skośnej fali uderzeniowej w przepływie pary przez palisadę turbinową stanowi zagrożenie dla bezpiecznej pracy turbiny oraz dla jej elementów konstrukcyjnych. Detekcja oraz lokalizacja fali uderzeniowej, a także rozpoznanie przyczyny jej powstawania, nie są możliwe do osiągnięcia na drodze pomiarowej. Analizę zjawisk zachodzących wewnątrz kanału przepływowego umożliwiają natomiast modele numeryczne oraz neuronowe. Zaletą...
-
Direct brain stimulation modulates encoding states and memory performance in humans
PublicationPeople often forget information because they fail to effectively encode it. Here, we test the hypothesis that targeted electrical stimulation can modulate neural encoding states and subsequent memory outcomes. Using recordings from neurosurgical epilepsy patients with intracranially implanted electrodes, we trained multivariate classifiers to discriminate spectral activity during learning that predicted remembering from forgetting,...
-
Controlled grafting of vinylic monomers on polyolefins: a robust mathematical modeling approach
PublicationExperimental and mathematical modeling analyses were used for controlling melt free-radical grafting of vinylic monomers on polyolefins and, thereby, reducing the disturbance of undesired cross-linking of polyolefins. Response surface, desirability function, and artificial intelligence methodologies were blended to modeling/optimization of grafting reaction in terms of vinylic monomer content, peroxide initiator concentration,...
-
Self-organising maps in the analysis of strains of human abdominal wall to identify areas of similar mechanical behaviour.
PublicationThe study refers to the application of a type of artificial neural network called the Self-Organising Map (SOM) for the identification of areas of the human abdominal wall that behave in a similar mechanical way. The research is based on data acquired during in vivo tests using the digital image correlation technique (DIC). The mechanical behaviour of the human abdominal wall is analysed during changing intra-abdominal pressure....
-
Wireless Link Selection Methods for Maritime Communication Access Networks—A Deep Learning Approach
PublicationIn recent years, we have been witnessing a growing interest in the subject of communication at sea. One of the promising solutions to enable widespread access to data transmission capabilities in coastal waters is the possibility of employing an on-shore wireless access infrastructure. However, such an infrastructure is a heterogeneous one, managed by many independent operators and utilizing a number of different communication...
-
Experimental tuning of AuAg nanoalloy plasmon resonances assisted by machine learning method
PublicationPlasmonic nanostructures based on AuAg nanoalloys were fabricated by thermal annealing of metallic films in an argon atmosphere. The nanoalloys were chosen because they can extend the wavelength range in which plasmon resonance occurs and thus allow the design of plasmonic platforms with the desired parameters. The influence of initial fabrication parameters and experimental conditions on the formation of nanostructures was investigated....
-
Bounds on the cover time of parallel rotor walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...