Filtry
wszystkich: 1361
-
Katalog
- Publikacje 1056 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: UNICYCLIC GRAPHS
-
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ń.
-
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)...
-
Neutrophil extracellular traps as the main source of eDNA
Publikacja -
Grape vinegars – characteristics, properties and safety of use
Publikacja -
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...
-
Mechanical characteristics of welded joints between different stainless steels grades
Publikacjanvestigation of mechanical characteristics of welded joints is one of the most important tasks that allow determining their functional properties. Due to the very high, still rising, cost of some stainless steels it is justified, on economic grounds, welding austenitic stainless steel with steels that are corrosion-resistant like duplex ones. According to forecasts the price of...
-
EMG and gaze based interaction with graphic interface of smart glasses application
PublikacjaIn this paper we investigate the effectiveness of the interaction using eye tracking and electromyography. Smart glasses requires reliable interfaces for controlling the graphic content displayed directly in front of the user's eye. Presented research is related with the eGlasses project, which is focused on the development of an open platform in the form of multisensory electronic glasses and related interaction methods. One of...
-
Ultrastructural variability of macrophages in the wall of selected aorto-coronary bypass grafts
Publikacja -
Imaging of grains and internal stresses in GO Fe-Si alloy with Barkhauseneffects
PublikacjaBadano próbki stali transformatorowej Fe-Si ze strukturą zorientowaną (GO). Polowy efekt Barkhausena wykorzystano do zobrazowania ziaren pod warstwą ochronną a poziom naprężeń wewnętrznych wyznaczono wykorzystując mechaniczny efekt Barkhausena.
-
Embedded Representations of Wikipedia Categories
PublikacjaIn this paper, we present an approach to building neural representations of the Wikipedia category graph. We test four different methods and examine the neural embeddings in terms of preservation of graphs edges, neighborhood coverage in representation space, and their influence on the results of a task predicting parent of two categories. The main contribution of this paper is application of neural representations for improving the...
-
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...
-
Non-disjoint Decomposition Using r-admissibility and Graph Coloring and Its Application in Index Generation Functions Minimization
Publikacja -
Metaheurystyki sztucznej inteligencji w wybranych grach komputerowych
PublikacjaW pracy omówiono trzy metaheurystyki sztucznej inteligencji, które mogą stać się źródłem inspiracji dla projektantów gier komputerowych. Pokazano, w jaki sposób zastosowano algorytm mrówkowy, algorytm genetyczny i algorytm tabu search w grach komputerowych zaprojektowanych przez studentów Politechniki Gdańskiej. W szczególności, odniesiono się do problematyki wyznaczania trajektorii przemieszczających się obiektów...
-
Two-Boson Correlations in Various One-Dimensional Traps
Publikacja -
Entanglement of Two Charged Bosons in Strongly Anisotropic Traps
Publikacja -
Evaluating Asymmetric N-Grams as Spell-Checking Mechanism
PublikacjaTypical approaches to string comparing marks two strings as either different or equal without taking into account any similarity measures. Being able to judge similarity is however required for spelling error corrections, as we want to find the best match for a given word. In this paper we present a bi2quadro-grams method for spelling errors correction. The method proposed uses different n-grams dimension for the source (checked)...
-
Thick film traps with an irregular film. Preparation and evaluation.
PublikacjaOpisano nową metodę wytwarzania otwartych pułapek kapilarnych do wzbogacania lotnych związków organicznych z próbek gazowych. Badanie właściwości tego typu pułapek wykazało, że spadek ich sprawności chromatograficznej w porównaniu z pułapkami z filmem regularnym, jest rzędu 20-30%. Opracowana technologia jest bardzo prosta i pozwala na szybkie i tanie wytwarzanie dużych ilości pułapek z grubymi filmami również przez niewyspecjalizowane...
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
International Journal of Image, Graphics and Signal Processing
Czasopisma -
Proceedings of the ACM on Computer Graphics and Interactive Techniques
Czasopisma -
Effect of structure modification with potassium on grains layer creation process and phase transitions
PublikacjaZbadano szkła germanianowo-ołowiowe i krzemianowo bizutowe. Wartwy metalicznych granul wytwarzano w nich poprzez redukcję powierzchni w atmosferze wodoru. Praca dotyczy wpływu potasu na tworzenie się warstwy granul oraz na procesy topnienia i krzepnięcia granul w trakcie obróbki termicznej.
-
Shipowner’s Impact on Planned Maintenance System Database Quality Grades Resemblance Equalization
Publikacja -
Artificial Neural Networks in Classification of Steel Grades Based on Non-Destructive Tests
Publikacja -
Perpetrators from Treblinka: interdisciplinary investigations of seven single graves with “Trawniki Men”
Publikacja -
The application of GIS and 3D graphic software to visual impact assessment of wind turbines
Publikacja -
Optimizing the computation of a parallel 3D finite difference algorithm for graphics processing units
PublikacjaThis paper explores the possibilities of using a graphics processing unit for complex 3D finite difference computation via MUSTA‐FORCE and WENO algorithms. We propose a novel algorithm based on the new properties of CUDA surface memory optimized for 2D spatial locality and compare it with 3D stencil computations carried out via shared memory, which is currently considered to be the best approach. A case study was performed for...
-
Model silnika spalinowego w formie grafów wiązań (GW).A model of the IC engine in the form of the bond graph (BG).
PublikacjaPrzedstawiono uzasadnienie użycia metody grafów wiązań do do modelowania silnika spalinowego jako źródła energii w systemach energetycznych składających się z elementów o różnej naturze fizycznej, na przykład w pojazdach hybrydowych. Przedstawiono propozycję formalizacji charakterystyki silników spalinowych wynikającą z przyjętej metody modelowania. Analityczną formę charakterystyki przedstawiono jako wielowymiarową funkcję wektorową....
-
Tourism Investment Gaps in Poland
Publikacja -
AKCE International Journal of Graphs and Combinatorics
Czasopisma -
AUSTRALIAN JOURNAL OF GRAPE AND WINE RESEARCH
Czasopisma -
JOURNAL OF GRAPH THEORY
Czasopisma -
Mohammad Malikan dr inż.
OsobyMohammad Malikan studied Ph.D. at the Department of Mechanics of Materials and Structures at the Gdańsk University of Technology. He was the first person who graduated in the new form of the doctoral education system of Poland (Doctoral School). He has worked as a mechanical engineer and designer for several years in CAD/CAE fields in various industries, such as feed production lines, machinery, elevator, oil, etc. His main research...
-
Drawing maps with advice
PublikacjaW 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ć...
-
Improvement of Imperfect String Matching Based on Asymetric n-Grams
PublikacjaTypical approaches to string comparing treats them as either different or identical without taking into account the possibility of misspelling of the word. In this article we present an approach we used for improvement of imperfect string matching that allows one to reconstruct potential string distortions. The proposed method increases the quality of imperfect string matching, allowing the lookup of misspelled words without significant...
-
Ultra thick open tubular traps with an increased inner diameter.
PublikacjaPrzeanalizowano zagadnienia związane z zastosowaniem otwartych pułapek kapilarnych z grubym nieregularnym filmem polidimetylosiloksanu do wzbogacania lotnych związków organicznych. Przeprowadzone rozważania teoretyczne oraz prace eksperymentalne wykazały, że zwiększenie średnicy wewnętrznej pułapek może znacząco polepszyć ich właściwości. Dla danego natężenia przepływu próbki oraz danego stosunku objętości faz w pułapce, liczba...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublikacjaLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Recurrence times in the Morse sets 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.
-
Switched-capacitor DC-DC converters in arbitrary switching mode - topologically derived resistive models based on incremental graph approach.
PublikacjaIn the preceding paper we reviewed some of modeling approaches aimed at systematic formulation and solution of switched capacitor DC-DC converters. In our review, special attention was paid to computationally efficient and mathematically elegant methods. In so doing we had tried to demonstrate the virtues of unified Incremental Graph (IG) approach. Incremental Graph is, in concept, a tool originally created for analysis and synthesis...
-
Association between Age at Diagnosis of Graves' Disease and Variants in Genes Involved in Immune Response
Publikacja -
Evaluating the Role of Circulating Dendritic Cells in Methimazole-Treated Pediatric Graves’ Disease Patients
Publikacja -
Regulatory B Cells Involvement in Autoimmune Phenomena Occurring in Pediatric Graves’ Disease Patients
Publikacja