Filters
total: 1369
filtered: 1064
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: BIPARTITE GRAPHS
-
Graph Representation Integrating Signals for Emotion Recognition and Analysis
PublicationData 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...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublicationWe 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...
-
Analysis of Reconstituted Tripartite Complex Supports Avidity-based Recruitment of Hsp70 by Substrate Bound J-domain Protein
PublicationHsp70 are ubiquitous, versatile molecular chaperones that cyclically interact with substrate protein(s). The initial step requires synergistic interaction of a substrate and a J-domain protein (JDP) cochaperone, via its J-domain, with Hsp70 to stimulate hydrolysis of its bound ATP. This hydrolysis drives conformational changes in Hsp70 that stabilize substrate binding. However, because of the transient nature of substrate and JDP...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
On a matching distance between rooted phylogenetic trees
PublicationThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
Publication -
Modelling of energy flow in mechatronic systems. A bond graph approach
PublicationW referacie przedstawiono w sposób jednoliy modelowanie systemów mechatroniki metodą grafów wiązań (GW) w aspekcie symulacji przepływu energii. Omówiono ogólne założenia modelowania w ujęciu GW. Modelowanie przepływu energii rozważano na przykładzie napędu pojazdu hybrydowego PH-MAK.
-
Self-stabilizing algorithms for graph coloring with improved performance guarantees
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm kolorowania grafów oparty na konstrukcji drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm z gwarantowaną wielomianową liczbą ruchów, który dokładnie koloruje grafy dwudzielne.
-
Towards explainable motion prediction using heterogeneous graph representations
Publication -
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublicationW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Modelling of energy flow in electrical machines. A bond graph approach
PublicationPrzedstawiono w ujęcia grafów wiązań model przepływu energii/mocy w maszynach elektrycznych pracujących w hybrydowych systemach przetwarzania energii. Jako przykład do rozważań przyjęto system napędu trakcyjnego pojazdów hybrydowych.
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
PublicationThis 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...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publicationgenetic 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...
-
Modeling the impact of surface currents in a harbor using graph theory
PublicationEnsuring 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...
-
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublicationArtykuł 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.
-
Modelling of Objects Behaviour for Their Re-identification in Multi-camera Surveillance System Employing Particle Filters and Flow Graphs
PublicationAn extension of the re-identification method of modeling objects behavior in muti-camera surveillance systems, related to adding a particle filter to the decision-making algorithm is covered by the paper. A variety of tracking methods related to a single FOV (Field of Vision) are known, proven to be quite different for inter-camera tracking, especially in case of non-overlapping FOVs. The re-identification methods refer to the...
-
Grass a Kaszuby/i
Publication -
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Relativistic hydrodynamics on graphics processing units
Publication -
Stereoscopy in Graphics APIs for CAVE Applications
PublicationThe paper compares the advantages and disadvantages of a variety of Graphics Application Programming Interfaces (APIs) from the perspective of obtaining stereoscopy in applications written for a CAVE virtual reality environment. A number of problems have been diagnosed and an attempt has been made to solve them using OpenGL, DirectX 11 and 12, Vulkan, as well as the Unity Engine which can internally use DirectX, OpenGL and Vulkan,...
-
Engineer's graphic workshop. Historical review.
PublicationThe paper introduces the history of development of graphic engineering workshop within European culture. The fundamentals of scientific approach to this subject are dated back to the XVIII century. Owning to Gaspard Monge's works descriptive geometry rose to the rank of branch of mathematics. As the time passes we observe the endeavors aiming at accelerating and automating the process of engineering drawing. Since the XX century...
-
Impossible objects in geometry and graphic education
PublicationW artykule przedstawiono propozycję wprowadzenia do programu nauczania z geometrii przestrzennej i grafiki inżynierskiej obiektów niemożliwych (tworzonych między innymi przez M.C. Eschera). Celem analizy fenomenu obiektów niemożliwych w kontekście odwzorowań płaskich obiektów przestrzennych, a także percepcji przestrzeni jest wzbogacenie wyobrażni przestrzennej i kreatywności studentów.
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial 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: Complexity and Algorithms
PublicationIn 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:...
-
Emotion Recognition from Physiological Channels Using Graph Neural Network
PublicationIn recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn 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/.
-
Decision Support in Selecting a Reliable Strategy for Sustainable Urban Transport Based on Laplacian Energy of T-Spherical Fuzzy Graphs
Publication -
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
General grants and development – a relationship without a future? The effects of the structure of general grants on the development of local government units in Poland
PublicationThe purpose of this paper is to attempt to identify the reasons for the lack of relationship between general grant revenue and investment expenditure of local government units. The author formulated the hypothesis that there is no link between general grants and investment expenditure and that the reason for this are the current spending on education, absorbing the entire amount of general grants received by local government units....
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Mulimedia manuals for descriptive geometry and engineering graphics
PublicationThe article discusses issues connected with ICT (Information and Communication Technologies) implementation in Descriptive Geometry and Engineering Graphics Education. The presentation of the issues is supported by the author's multimedia manuals made in Multimedia Flash MX technology and published on the Gdańsk University of Technology net.
-
Optical glyphs based localization and identification system
PublicationThe paper presents a description of functioning of a platform supporting the detection of obstructive diseases in the respiratory system education process. A 16-parameter model of the respiratory system simulated in the MATLAB/Simulink environment was set in the role of the tested patient. It has been linked to the control layer, developed in the LabVIEW environment, using the SIT library (Simulation Interface Toolkit). This layer...
-
Basics on Commodities Risk Management for Grains Trading
PublicationCelem artykułu jest określenie rodzajów grup ryzyka występujących na rynku zbóż oraz przedstawienie możliwości ograniczania wystąpienia zjawisk niepożądanych. Pojawia się kwestia: w jakim stopniu podmioty rynku zbóż, a w szczególności producenci, powinni sami neutralizować występujące ryzyko, a kiedy powinni oczekiwać wsparcia ze strony instytucji państwowych. Coraz powszechniej zastosowanie znajdują instrumenty finansowe w postaci...
-
Günter Grass - kolekcja plus
Publication -
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet 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...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW 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.
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publication -
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
CD68 expression in aortocoronary saphenous vein bypass grafts
Publication -
Implementation of matrix-type FDTD algorithm on a graphics accelerator
PublicationArtykuł prezetuje implementację algorytmu FDTD w postaci macierzowej przeznaczonej dla kart graficznych. Wykazany został wzrost efektywności obliczeń numerycznych w odniesieniu do implementacji przeznaczonej dla procesora komputerowego.
-
The Choice of Exercises on Technical Graphics at the Specialization of Geodesy and Cartography
Publication -
System of specific grants for local government units in Poland
PublicationThe article analyses the system of specific grants in local governments in Poland. First, main revenue sources of local self-governments are presented. Their presentation is based upon the consideration of one of the basic important principles in democratic states today, i.e. decentralization. The text then, in more details, describes specific grants with respect to the European Charter of Local Self-Government. Subsequently, the...
-
Krylov Space Iterative Solvers on Graphics Processing Units
PublicationCUDA architecture was introduced by Nvidia three years ago and since then there have been many promising publications demonstrating a huge potential of Graphics Processing Units (GPUs) in scientific computations. In this paper, we investigate the performance of iterative methods such as cg, minres, gmres, bicg that may be used to solve large sparse real and complex systems of equations arising in computational electromagnetics.
-
Influence of the grains shape on the mechanical behavior of granular materials
PublicationDiscrete Element Method is a numerical method suitable for modeling geotechnical problems concerning granular media. In most cases simple forms of grains, like discs or spheres, are used. But these shapes are capable of soil behavior modeling up to a certain point only, they cannot reflect all of the features of the medium (large shear resistance and large volumetric change). In order to reflect the complex behavior of the real...
-
Research on Tool Temperature Dependence on Lapping Grains Size
PublicationCommonly used as a finishing operation, lapping has been used for achieving ultra-high finishes and close tolerances between mating pieces. Its carried out by applying loose abrasive grains between work and lap surfaces, and causing a relative motion between them resulting in a finish of multi-directional lay. The grains activity (sliding and rolling) in the working gap causes not only the material removal but also the temperature...
-
Grimm Grass 1 (Słówka Grimmów)
PublicationKrzysztof Wróblewski | Eksperyment: Ekslibris - ekslibris do powieści „Słówka Grimmów” Güntera Grassa LINK DO PREZENTACJI EKSLIBRISU → https://youtu.be/823ryLQzxas W swoim ekslibrisie Krzysztof Wróblewski sięgnął po technikę graficzną linorytu. Dzięki niej artysta osiągnął efekt powtarzalnego, dynamicznego znaku-plamy, który stanowi kwintesencję wypowiedzi z pogranicza sztuk wizualnych i literatury. Zainspirowany poezją konkretną,...
-
Grimm Grass 2 (Słówka Grimmów)
PublicationKrzysztof Wróblewski | Eksperyment: Ekslibris - ekslibris do powieści „Słówka Grimmów” Güntera Grassa LINK DO PREZENTACJI EKSLIBRISU → https://youtu.be/823ryLQzxas W swoim ekslibrisie Krzysztof Wróblewski sięgnął po technikę graficzną linorytu. Dzięki niej artysta osiągnął efekt powtarzalnego, dynamicznego znaku-plamy, który stanowi kwintesencję wypowiedzi z pogranicza sztuk wizualnych i literatury. Zainspirowany poezją konkretną,...
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublicationA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...