Filtry
wszystkich: 1150
wybranych: 882
-
Katalog
- Publikacje 882 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 16 wyników po odfiltrowaniu
- Osoby 10 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 6 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 218 wyników po odfiltrowaniu
Filtry wybranego katalogu
Wyniki wyszukiwania dla: graph distance metric
-
Non-monotone graph searching models
PublikacjaGraph 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...
-
New Indoor Positioning Algorithm for Distance Measurements
PublikacjaIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere 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
PublikacjaA 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...
-
KOALA Graph Theory Internet Service
PublikacjaKOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discreate optimization. During the C2NIWA project, a library has been greatly ectended, the code refactored and enclosed with the internet service available in the public repository of thr project. Today it contains interconnected educational materials in the form...
-
Pawlak's flow graph extensions for video surveillance systems
PublikacjaThe idea of the Pawlak's flow graphs is applicable to many problems in various fields related to decision algorithms or data mining. The flow graphs can be used also in the video surveillance systems. Especially in distributed multi-camera systems which are problematic to be handled by human operators because of their limited perception. In such systems automated video analysis needs to be implemented. Important part of this analysis...
-
AGREE—Analytical GREEnness Metric Approach and Software
Publikacja -
AGREE—Analytical GREEnness Metric Approach and Software
PublikacjaGreen analytical chemistry focuses on making analytical procedures more environmentally benign and safer to humans. The amounts and toxicity of reagents, generated waste, energy requirements, the number of procedural steps, miniaturization, and automation are just a few of the multitude of criteria considered when assessing an analytical methodology’s greenness. The use of greenness assessment criteria requires dedicated tools. We...
-
Zero-Visibility Cops and Robber Game on a Graph
PublikacjaWe 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.
-
Graphs with equal domination and 2-distance domination numbers
PublikacjaW publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.
-
Modeling the impact of surface currents in a harbor using graph theory
PublikacjaEnsuring 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...
-
Characterizing the Scalability of Graph Convolutional Networks on Intel® PIUMA
PublikacjaLarge-scale Graph Convolutional Network (GCN) inference on traditional CPU/GPU systems is challenging due to a large memory footprint, sparse computational patterns, and irregular memory accesses with poor locality. Intel’s Programmable Integrated Unffied Memory Architecture (PIUMA) is designed to address these challenges for graph analytics. In this paper, a detailed characterization of GCNs is presented using the Open-Graph Benchmark...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublikacjaWe 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...
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublikacjaWe show that the average distance is submultiplicative and subadditive on the set of non-trivial connected graphs with respect to the strong product. We also give an application of the above-mentioned result.
-
Analysis of compressive forces in CFGFT cylindrical pillars and their coatings using laboratory tests and metric spaces
PublikacjaThe article discusses compressive forces tests in composite-concrete pillars with the use of laboratory active experiment including the factors and properties of materials which have a significant impact on the test results and their repeatability. A polymer composite based on glass fiber reinforced resin with different fiber beam angles (20, 55 and 85) was used as a buffer/coat of the pole. Due to the problems with direct comparison...
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
PublikacjaRekonstrukcja drzew ewolucji jest jednym z głównych celów w bioinformatyce. Drzewa filogenetyczne reprezentuje historię ewolucji i związki pokrewieństwa między różnymi gatunkami. W pracy proponujemy nową ogólną metodę określania odległości między nieukorzenionymi drzewami filogenetycznymi, szczególnie użyteczną dla dużych zbiorów gatunków. Następnie podajemy szczegółowe własności jednej metryki określonej przy użyciu tej metody...
-
A New Metric for Long-Range Transport Potential of Chemicals
Publikacja -
Weakly convex domination subdivision number of a graph
PublikacjaA 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...
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Graph Representation Integrating Signals for Emotion Recognition and Analysis
PublikacjaData 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...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublikacjaIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublikacjaArtykuł 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.
-
Accelerating Video Frames Classification With Metric Based Scene Segmentation
PublikacjaThis paper addresses the problem of the efficient classification of images in a video stream in cases, where all of the video has to be labeled. Realizing the similarity of consecutive frames, we introduce a set of simple metrics to measure that similarity. To use these observations for decreasing the number of necessary classifications, we propose a scene segmentation algorithm. Performed experiments have evaluated the acquired...
-
Curb-to-Barrier Face Distance Variation an a TB51 Bridge Barrier Crash Test Simulation
PublikacjaThis paper addresses the problem of road safety regarding barrier placement as relative to the curb. A short summary of existing regulations is presented. Numerical simulations using the explicit finite element system Ls- Dyna are shown. In the analysis, variable distance between the barrier and the curb is assumed. The obtained result reveals that the distance has little impact on the working width of the barrier.
-
Long Distance Vital Signs Monitoring with Person Identification for Smart Home Solutions
PublikacjaAbstract— Imaging photoplethysmography has already been proved to be successful in short distance (below 1m). However, most of the real-life use cases of measuring vital signs require the system to work at longer distances, to be both more reliable and convenient for the user. The possible scenarios that system designers must have in mind include monitoring of the vital signs of residents in nursing homes, disabled people, who...
-
Long Distance Geographically Distributed InfiniBand Based Computing
PublikacjaCollaboration between multiple computing centres, referred as federated computing is becom- ing important pillar of High Performance Computing (HPC) and will be one of its key components in the future. To test technical possibilities of future collaboration using 100 Gb optic fiber link (Connection was 900 km in length with 9 ms RTT time) we prepared two scenarios of operation. In the first one, Interdisciplinary Centre for Mathematical...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
Optimization of the distance between the vertical plates in the convective air heat exchanger
PublikacjaThis paper examines the influence of the distance between vertical plates on the intensity of free convective heat transfer along with the optimization of this distance. Experimental tests were carried out for one model channel of such an heat exchanger with widths , 0.085 and 0.18 m. This channel, open at the top and sides, was formed by two isothermal symmetrically heated parallel vertical plates of dimensions m and m. The influence...
-
Distance measurement errors in silent FM-CW sonar with matched filtering
PublikacjaThe secretiveness of sonar operation can be achieved by using continuous frequency-modulated sounding signalswith reduced power and significantly prolonged repeat time. The application of matched filtration in the sonarreceiver provides optimal conditions for detection against the background of white noise and reverberation, and avery good resolution of distance measurements of motionless targets. The article shows that target...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublikacjaArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publikacjagenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Measurement of distance, velocity and angle of arrival using FMCW-CW combined waveform
PublikacjaA procedure of tacking small flying object based on a general principle of FMCW and Doppler radar is presented. In order to increase measurement range, this technique uses active signal source on the moving object. For simultaneous measurements of distance, radial velocity and direction (AoA) as well as simplified synchronization a combined FMCW-CW waveform is proposed. The presented measurement system was realized and verified...
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublikacjaPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
Analysis of distance measurement errors in CW FM sonar with MLS code modulation
PublikacjaAlthough used in the classic silent sonar, the CW FM sounding signal has a major flaw which is its inaccuracy in determining the distance to a target. The authors of the article have developed a concept of silent sonar using frequency modulation signals switched by pseudorandom codes, already discussed in their previous work. This article presents a detailed analysis of errors in CW FM sonar with pseudo-random sequence code modulation...
-
Graph models of clos networks
Publikacja...
-
Forwarding and optical indices of a graph
PublikacjaW pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.
-
Mixed graph edge coloring
PublikacjaW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
On a Recurrence Arising in Graph Compression
PublikacjaIn a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1p). A new node is created as long as...
-
Parallel scheduling by graph ranking
PublikacjaNr dokum.: 73017Praca dotyczy jednego z nieklasycznych modeli kolorowania grafów - uporządkowanego kolorowania. Celem było uzyskanie wyników, które mogo być wykorzystane w praktycznych zastosowaniach tego modelu, do których należą: równoległe przetwarzanie zapytań w relacyjnych bazach danych, równoległa faktoryzacja macierzy metodą Choleskiego, równoległa asemblacja produktu z jego części składowych. W pracy wskazano uogólnienia...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Distance paired domination numbers of graphs
PublikacjaW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Distance learning trends: introducing new solutions to data analysis courses
PublikacjaNowadays data analysis of any kind becomes a piece of art. The same happens with the teaching processes of statistics, econometrics and other related courses. This is not only because we are facing (and are forced to) teach online or in a hybrid mode. Students expect to see not only the theoretical part of the study and solve some practical examples together with the instructor. They are waiting to see a variety of tools, tutorials,...
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
PublikacjaThis paper continues the work by Wang et al. [17]. Its goal is to verify the robustness of the NGCF (Neural Graph Collaborative Filtering) technique by assessing its ability to generalize across different datasets. To achieve this, we first replicated the experiments conducted by Wang et al. [17] to ensure that their replication package is functional. We received sligthly better results for ndcg@20 and somewhat poorer results for...
-
Electrolytic corrosion of water pipeline system in the remote distance from stray currents– case study
PublikacjaCase study of corrosion failure of urban water supply system caused by the harmful effects of stray currents was presented. The failure occurred at a site distant from the sources of these currents namely the tramway and railway traction systems. Diagnosis revealed the stray currents flow to pipeline over a remote distance of 800 ÷ 1,000 meters from the point of failure. At the point of failure stray currents flowed from the pipeline...
-
Examination method of the effect of the incidence angle of laser beam on distance measurement accuracy to surfaces with different colour and roughness
PublikacjaInterest in the influence of the incidence angle of a laser beam to distance measurements can be seen in many areas of science and technology: geodesy, glaciology, archaeology, machine automation, and others. This paper presents results of measurements of the effect of the incidence angle of a laser beam to distance measurements to the surfaces of different colour and roughness by Topcon's electro-optical total station with an...
-
Decision support system for design of long distance heat transportation system
PublikacjaDistrict Heating (DH) systems are commonly supplied using local heat sources. Nowadays, modern insulation materials allow for effective and economically viable heat transportation over long distances (over 20 km). The paper proposes a Decision Support System (DSS) for optimized selection of design and operating parameters of a long distance Heat Transportation System (HTS). The method allows for evaluation of feasibility and effectiveness...
-
Examining Impact of Speed Recommendation Algorithm Operating in Autonomous Road Signs on Minimum Distance between Vehicles
PublikacjaAn approach to a new kind of recommendation system design that suggests safe speed on the road is presented. Real data obtained on roads were used for the simulations. As part of a project related to autonomous road sign development, a number of measurements were carried out on both local roads and expressways. A speed recommendation model was created based on gathered traffic data employing the traffic simulator. Depending on...
-
Emotion Recognition from Physiological Channels Using Graph Neural Network
PublikacjaIn 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...