Filtry
wszystkich: 2153
-
Katalog
- Publikacje 1645 wyników po odfiltrowaniu
- Czasopisma 46 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 65 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 7 wyników po odfiltrowaniu
- Kursy Online 51 wyników po odfiltrowaniu
- Wydarzenia 10 wyników po odfiltrowaniu
- Dane Badawcze 293 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: RANDOM GRAPHS
-
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW 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
PublikacjaPrzedstawiono 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.
-
Modelling of energy flow in mechatronic systems. A bond graph approach
PublikacjaW 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.
-
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...
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
Publikacja -
Towards explainable motion prediction using heterogeneous graph representations
Publikacja -
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...
-
Self-stabilizing algorithms for graph coloring with improved performance guarantees
PublikacjaW 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.
-
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...
-
Conley-Morse graphs for a two-patch vaccination model
Dane BadawczeThis dataset contains selected results of rigorous numerical computations described in Section 5 of the paper "Rich bifurcation structure in a two-patch vaccination model" by D.H. Knipl, P. Pilarczyk, G. Röst, published in SIAM Journal on Applied Dynamical Systems (SIADS), Vol. 14, No. 2 (2015), pp. 980–1017, doi: 10.1137/140993934.
-
An efficient algorithm for the longest tandem scattered subsequence problem.
PublikacjaReferat dotyczy zagadnienia wyznaczania najdłuższego podciągu podwójnego (typu x1,x2,...,xk,x1,x2,...,xk) dla zadanego ciągu znaków (y1,y2,...,yn). Podano algorytm o złożoności obliczeniowej O(n^2) i pamięciowej O(n) znajdujący optymalne rozwiązanie postawionego problemu.
-
Randomly Functionalized Polyethylenes: In Quest of Avoiding Catalyst Deactivation
PublikacjaWell-defined randomly functionalized polyolefins produced by catalysis form an interesting class of polymers with great potential for various applications. One of the major challenges for the production of these materials forms the incompatibility of the commonly used electrophilic group 4 metal based catalysts and the desired nucleophilic, especially protic functionalities like hydroxyl and carboxylic acid groups. Although pacification...
-
Modelling of Objects Behaviour for Their Re-identification in Multi-camera Surveillance System Employing Particle Filters and Flow Graphs
PublikacjaAn 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
Publikacja -
Optimal edge-coloring with edge rate constraints
PublikacjaWe 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....
-
Ciudad Paz-Ando
Czasopisma -
RAND JOURNAL OF ECONOMICS
Czasopisma -
Engineer's graphic workshop. Historical review.
PublikacjaThe 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
PublikacjaW 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.
-
Relativistic hydrodynamics on graphics processing units
Publikacja -
Stereoscopy in Graphics APIs for CAVE Applications
PublikacjaThe 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,...
-
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...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublikacjaProtection 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...
-
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...
-
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:...
-
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...
-
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/.
-
Decision Support in Selecting a Reliable Strategy for Sustainable Urban Transport Based on Laplacian Energy of T-Spherical Fuzzy Graphs
Publikacja -
Conductivity of two-dimensional composites with randomly distributed elliptical inclusions
Publikacja -
Application of Adomian decomposition method in analysis of displacements ofrandom subsoil
PublikacjaW pracy przedstawiono metodę dekompozycji Adomiana oraz jej zastosowanie do rozwiązania zagadnienia losowego ośrodka gruntowego. Rozpatrzono ważką warstwę gruntu, posadowioną na nieodkształcalnym podłożu, poddaną działaniu równomiernie rozłożonego pionowego obciążenia zewnętrznego. Przyjęto, że ośrodek jest sprężysty, a jego parametry są funkcjami losowymi. Uzyskano przybliżone rozwiązanie analityczne wraz z oceną zakresu jego...
-
2-Coloring number revisited
Publikacja2-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...
-
GRASS AND FORAGE SCIENCE
Czasopisma -
COMPUTERIZED MEDICAL IMAGING AND GRAPHICS
Czasopisma -
International Journal of Image and Graphics
Czasopisma -
Grafica-Journal of Graphic Design
Czasopisma -
Journal of Graphic Engineering and Design
Czasopisma -
Engineering Design Graphics Journal
Czasopisma -
Journal of Graphic Novels and Comics
Czasopisma -
Bounds on the Cover Time of Parallel Rotor Walks
PublikacjaThe 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 maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
In Situ Random Microseeding and Streak Seeding Used for Growth of Crystals of Cold-Adapted beta-D-Galactosidases: Crystal Structure of betaDG from Arthrobacter sp. 32cB
PublikacjaThere is an increasing demand for cold-adapted enzymes in a wide range of industrial branches. Nevertheless, structural information about them is still scarce. The knowledge of crystal structures is important to understand their mode of action and to design genetically engineered enzymes with enhanced activity. The most difficult task and the limiting step in structural studies of cold-adapted enzymes is their crystallization,...
-
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
PublikacjaThe 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....
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe 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...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe 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...
-
International Journal of Combinatorial Graph Theory and Applications
Czasopisma -
Mulimedia manuals for descriptive geometry and engineering graphics
PublikacjaThe 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.
-
Basics on Commodities Risk Management for Grains Trading
PublikacjaCelem 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...
-
Optical glyphs based localization and identification system
PublikacjaThe 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...
-
Günter Grass - kolekcja plus
Publikacja -
Geometry Parametric Model Order Reduction with Randomly Generated Projection Bases
PublikacjaIn this work, a reduced-order model for geometry parameters and fast frequency sweep is proposed. The Finite Element Method is used to solve time-harmonic Maxwell’s equations. Taking into account the electromagnetic field does not arbitrarily vary as a function of frequency and geometry parameters, a low dimension system manifold is identified. Thus, the original Finite Element problem can be approximated by a model of reduced...
-
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...