Filtry
wszystkich: 1322
-
Katalog
- Publikacje 1019 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 21 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: MYCIELSKI GRAPHS
-
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 -
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)...
-
Two-Boson Correlations in Various One-Dimensional Traps
Publikacja -
Entanglement of Two Charged Bosons in Strongly Anisotropic Traps
Publikacja -
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...
-
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...
-
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...
-
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 -
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...
-
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 -
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.
-
AKCE International Journal of Graphs and Combinatorics
Czasopisma -
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ą....
-
AUSTRALIAN JOURNAL OF GRAPE AND WINE RESEARCH
Czasopisma -
Tourism Investment Gaps in Poland
Publikacja -
JOURNAL OF GRAPH THEORY
Czasopisma -
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ć...
-
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...
-
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...
-
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 -
Evaluating the Role of Circulating Dendritic Cells in Methimazole-Treated Pediatric Graves’ Disease Patients
Publikacja -
Computer graphics toos application for visualsation of measurements results of ship hull sections and blocks.
PublikacjaOpisano zakres minimalnych wymagań dla programu komputerowego, służącego do wizualizacji wyników pomiarów sekcji i bloków kadłuba okrętowego. Przedstawiono sposób przenoszenia danych z urządzenia pomiarowego do programu i pokazano przykłady pomiarów wykonanych na sekcjach zbudowanych w Stoczni Gdynia S.A.
-
Novel Drying Methods for Sustainable Upcycling of Brewers’ Spent Grains as a Plant Protein Source
Publikacja -
Civil Projects (Participatory), Company Funds and Small Grants as Factors Integrating Local Communities
Publikacja -
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Sweet grass protection against oxidative stress formation in the rat brain
Publikacja -
Concept of Multifactor Method and Non-Functional Requirements Solution to Increase Resilience through Functional Safety with Cybersecurity Analysis
PublikacjaIn the process of designing safety systems, an integrated approach in safety and cybersecurity analysis is necessary. The paper describes a new technique of increasing resilience through integrated analysis of functional safety and cybersecurity. It is a modeling methodology based on the combination of the multifactor method utilizing modified risk graphs, used previously for Safety Integrity Level (SIL) assessment, and the Non-Functional...
-
Conley-Morse graphs for a population model with harvesting. Case He-S1: Equal harvesting of juveniles and adults, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Hj-Se: Harvesting juveniles only, equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case He-Se: Equal harvesting and equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Hj-S1: Harvesting juveniles only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Ha-S1: Harvesting adults only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Conley-Morse graphs for a population model with harvesting. Case Ha-Se: Harvesting adults only, equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Isolation Number versus Domination Number of Trees
PublikacjaIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Interaction of HLA-DRB1 Alleles with CTLA-4 in the Predisposition to Graves' Disease: The Impact of DRB1*07
Publikacja -
Influence of analysis of features geometrical abrasive grains stress, strain and displacement of material in zone microgrinding
Publikacja -
CAVER Analyst 1.0: graphic tool for interactive visualization and analysis of tunnels and channels in protein structures
Publikacja -
Silicon nanoparticles enhanced the growth and reduced the cadmium accumulation in grains of wheat (Triticum aestivum L.)
Publikacja -
Modele i algorytmy dla grafowych struktur defensywnych
PublikacjaW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Polyhedral Ramsey Numbers
PublikacjaGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...