Wyszukiwarka
Filtry
wszystkich: 1336
-
Katalog
- Publikacje 1031 wyników po odfiltrowaniu
- Czasopisma 39 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 46 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 7 wyników po odfiltrowaniu
- Kursy Online 23 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 150 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SUBCUBIC GRAPHS
-
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...
-
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...
-
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...
-
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...
-
Günter Grass - kolekcja plus
Publikacja -
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...
-
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.
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publikacja -
CD68 expression in aortocoronary saphenous vein bypass grafts
Publikacja -
System of specific grants for local government units in Poland
PublikacjaThe 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
PublikacjaCUDA 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.
-
The Choice of Exercises on Technical Graphics at the Specialization of Geodesy and Cartography
Publikacja -
Implementation of matrix-type FDTD algorithm on a graphics accelerator
PublikacjaArtykuł 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.
-
Research on Tool Temperature Dependence on Lapping Grains Size
PublikacjaCommonly 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...
-
Influence of the grains shape on the mechanical behavior of granular materials
PublikacjaDiscrete 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...
-
Conley-Morse graphs for a two-dimensional discrete neuron model (low resolution)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Conley-Morse graphs for a two-dimensional discrete neuron model (limited range)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Conley-Morse graphs for a two-dimensional discrete neuron model (full range)
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Grimm Grass 1 (Słówka Grimmów)
PublikacjaKrzysztof 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)
PublikacjaKrzysztof 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ą,...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
The Effectiveness of Catching Cutworm (Lepidoptera: Noctuidae: Noctuinae) (= Agrotinae) in Pheromone Traps and Light Traps, for Short-Term Forecasting
Publikacja -
CAUSALITY IN MODELS OF THERMAL PROCESSES IN SHIP ENGINE ROOMS WITH THE USE OF BOND GRAPH (BG) METHOD
PublikacjaWith a single approach to modeling elements of different physical nature, the method of Bond Graph (BG) is particularly well suited for modeling energy systems consisting of mechanical, thermal, electrical and hydraulic elements that operate in the power system engine room. The paper refers to the earlier presented new concept of thermal process modeling using the BG method. The authors own suggestions for determining causality...
-
Foundations and Trends in Computer Graphics and Vision
Czasopisma -
International Circular of Graphic Education and Research
Czasopisma -
NIH guide for grants and contracts (Online)
Czasopisma -
Synergies Afrique des Grands Lacs
Czasopisma -
Journal of Image and Graphics(United Kingdom)
Czasopisma -
Conley-Morse graphs for a non-linear Leslie population model with 2 varying parameters
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Conley-Morse graphs for a non-linear Leslie population model with 3 varying parameters
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "A database schema for the analysis of global dynamics of multiparameter systems" by Z. Arai, W. Kalies, H. Kokubu, K. Mischaikow, H. Oka, P. Pilarczyk, published in SIAM Journal on Applied Dynamical Systems (SIADS),...
-
Generation of large finite-element matrices on multiple graphics processors
PublikacjaThis paper presents techniques for generating very large finite-element matrices on a multicore workstation equipped with several graphics processing units (GPUs). To overcome the low memory size limitation of the GPUs, and at the same time to accelerate the generation process, we propose to generate the large sparse linear systems arising in finite-element analysis in an iterative manner on several GPUs and to use the graphics...
-
Implementation of FDTD-Compatible Green's Function on Graphics Processing Unit
PublikacjaIn this letter, implementation of the finite-difference time domain (FDTD)-compatible Green's function on a graphics processing unit (GPU) is presented. Recently, closed-form expression for this discrete Green's function (DGF) was derived, which facilitates its applications in the FDTD simulations of radiation and scattering problems. Unfortunately, implementation of the new DGF formula in software requires a multiple precision...
-
Nicotinamide phosphoribosyltransferase expression in thyroid glands of patients with Graves' disease
Publikacja -
Inner derivations of special subrings of matrix rings and outerplanar digraphs.
PublikacjaTematem artykułu jest specjalny podpierścień pierścienia macierzy wyznaczony przez relację oraz digraf reprezentujący tę relację. Rozważane są takie relacje, dla których reprezentujące je digrafy są zewnętrznie planarne. W tym przypadku zostały udowodnione warunki konieczne i wystarczające na to, aby różniczkowanie pierścienia było wewnętrzne.
-
Methods for displacement and rotation measurements of individual Taylor-Schneebeli grains.
PublikacjaW artykule przedtawiono autorską metodę pomiaru przemieszczeń oraz obrotów cząstek ośrodka analogowego Taylor-Schneebeli oraz propozycję interpretacji badań.
-
Neutrophil extracellular traps as the main source of eDNA
Publikacja -
Grape vinegars – characteristics, properties and safety of use
Publikacja -
SELECTED ASPECTS OF THE EVALUATION OF THE QUALITY OF GRAPE WINE
PublikacjaDevelopment of the domestic grape wine market has been presented. The number of grape wine producing entities, acreage, and volume of production over last five years are presented. The composition of red grape wine has been discussed involving health promoting aspects. Two methods of wine quality determination: analytical and sensory meth ods have been described. Physicochemical parameters influencing wine quali ty (acidity, sweetness)...
-
Impact of Cluster Zone Leaf Removal on Grapes cv. Regent Polyphenol Content by the UPLC-PDA/MS Method
Publikacja -
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
Graph Neural Networks and Structural Information on Ionic Liquids: A Cheminformatics Study on Molecular Physicochemical Property Prediction
PublikacjaIonic liquids (ILs) provide a promising solution in many industrial applications, such as solvents, absorbents, electrolytes, catalysts, lubricants, and many others. However, due to the enormous variety of their structures, uncovering or designing those with optimal attributes requires expensive and exhaustive simulations and experiments. For these reasons, searching for an efficient theoretical tool for finding the relationship...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublikacjaSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
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...
-
Ultrastructural variability of macrophages in the wall of selected aorto-coronary bypass grafts
Publikacja