Filtry
wszystkich: 2052
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: ALGORITHMIC GRAPH THEORY
-
Kongzhi Lilun Yu Yinyong/Control Theory and Applications
Czasopisma -
Management Theory and Studies for Rural Business and Infrastructure Development
Czasopisma -
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
Czasopisma -
International Journal of Computer Mathematics: Computer Systems Theory
Czasopisma -
International Journal of Qualitative Theory of Differential Equations and Applications
Czasopisma -
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS
Czasopisma -
Average Redundancy of the Shannon Code for Markov Sources
PublikacjaIt is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...
-
Leszek Ziemczonek dr
OsobyUniversity education 1973-1978 – Nicolaus Copernicus University in Toruń, University of Gdańsk in Gdańsk, Mathematical Physics, M. Sc. 1979 – Diploma of Postgraduate Studies, Pedagogics 1989 – Institute of Physics, Polish Academy of Sciences in Warsaw, Theoretical Physics, Ph. D. 2010-2012 – Diploma of Postgraduate Studies, Mathematics Training: · 09.1983 – Trieste (Italy) – International Centre for Theoretical Physics...
-
International Conference on Graph Transformations
Konferencje -
Conference on Algorithmic Aspects in Information and Management
Konferencje -
International Workshop on the Algorithmic Foundations of Robotics
Konferencje -
Workshop on Combinatorial and Algorithmic Aspects of Networking
Konferencje -
Study of the Flow Dynamics of Surface Water Masses in the Area of the Coastal Gulf of Gdansk
PublikacjaThe paper describes two methods of predicting the movement of small objects with surface water masses. One of the methods uses graph theory to describe the motion of water masses in port docks. The results of this study were compared to a simulation using the hydrodynamic numerical model M3D. The results obtained in a virtual environment were related to the experiments in the real world. In the coastal area of the Gulf of Gdansk,...
-
Karolina Zielińska-Dąbkowska dr inż. arch.
OsobyKarolina M. Zielinska-Dabkowska (dr inż. arch., Dipl.-Ing. Arch.[FH]) jest adiunktem na Wydziale Architektury Politechniki Gdańskiej. W roku 2002 ukończyła studia na Wydziale Architektury i Urbanistyki Politechniki Gdańskiej a w 2004 inżynierii architektonicznej na HAWK Hochschule für angewandte Wissenschaft und Kunst Hildesheim w Niemczech. Po studiach pracowała dla kilku firm o światowej renomie w Berlinie, Londynie, Nowym Jorku...
-
Krzysztof Goczyła prof. dr hab. inż.
OsobyKrzysztof Goczyła, profesor zwyczajny Politechniki Gdańskiej, informatyk, specjalista z inżynierii oprogramowania, inżynierii wiedzy i baz danych. Ukończył studia wyższe na Wydziale Elektroniki Politechniki Gdańskiej w 1976 r. jako magister inżynier elektronik w specjalności automatyka. Na Politechnice Gdańskiej pracuje od 1976. Na Wydziale Elektroniki PG w 1982 r. uzyskał doktorat z informatyki, a w 1999 r. habilitację. W 2012...
-
(Lost) Pride and Prejudice. Journalistic Identity Negotiation Versus the Automation of Content
PublikacjaThe objective of our research was to broaden the knowledge regarding the relationship between the work of journalists and their professional identity, and, in particular, to identify the attitudes of this professional group towards algorithmic content creation under conditions of liminality. Previously, the implementation of the technology of algorithmic content creation by media organisations was associated primarily with financial...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Dane BadawczeFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Możliwość oszacowania niezawodności silników o zapłonie samoczynnym z zastosowaniem teorii procesów semi-Markowa oraz podejmowania decyzji eksploatacyjnych z uwzględnieniem wiarygodności diagnozy o stanie technicznym tego rodzaju silników spalinowych = Possibility of estimating the reliability of diesel engines by applying the theory of semi-Markov processes and making operational decisions by considering reliability of diagnosis on technical state of this sort of combustion engines/
PublikacjaThe paper presents semi-Markov models of technical state transitions for diesel engines, useful for determining reliability of the engines. A possibility of application of a three-state model with a simplified matrix function, or even a two-state model, to determine reliability of the engines, has been described herein on examples of known from literature semi-Markov models, for the case when appropriate diagnosing systems (SDG)...
-
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Czasopisma -
New Writing-The International Journal for the Practice and Theory of Creative Writing
Czasopisma -
Labyrinth: An International Journal for Philosophy, Value Theory, and Sociocultural Hermeneutics
Czasopisma -
Politeia-Journal of Political Theory Political Philosophy and Sociology of Politics
Czasopisma -
Przedsiębiorstwo we współczesnej gospodarce - teoria i praktyka
Czasopisma -
Workshop on Algorithmic Aspects of Advanced Programming Languages
Konferencje -
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Workshop on Algorithms And Models For The Web Graph
Konferencje -
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublikacjaThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublikacjaThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
COLREGS compliance in Evolutionary Sets of Cooperating Ship Trajectories
PublikacjaIn general, Evolutionary Sets of Cooperating Ship Trajectories combine some of the assumptions of game theory with evolutionary programming and aim to find optimal set of cooperating trajectoriesof all ships involved in an encounter situation. In a two-ship encounter situation the method enables the operator of an on-board collision-avoidance system to predict the most probable behaviour of atarget and to plan the own manoeuvres...
-
Anita Jaśkiewicz-Sojak dr inż. arch.
OsobyAnita Jaśkiewicz-Sojak (dr inż. arch.) architekt, historyk architektury, konserwator zabytków. Adiunkt w Katedrze Historii, Teorii Architektury i Konserwacji Zabytków na Wydziale Architektury Politechniki Gdańskiej. Wykształcenie: studia architektoniczne i doktorskie na Politechnice Gdańskiej, historyczne na Uniwersytecie Gdańskim oraz podyplomowe konserwatorskie na Wydziale Architektury Politechniki Krakowskiej. Rozprawa doktorska...
-
Kuram ve uygulamada egitim yönetimi Educational Management: Theory & Practice
Czasopisma -
Enthymema-International Journal of Literary Criticism Literary Theory and Philosophy of Literature
Czasopisma -
Opir Materialiv i Teoria Sporud-Strength of Materials and Theory of Structures
Czasopisma -
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice
Czasopisma -
Kuram ve uygulamada eğitim yönetimi (Educational Management: Theory & Practice)
Czasopisma -
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
List of initial and final geometries of hybrid organic-inborganic perovskites
Dane BadawczeList of initial and optimized geometries of hybrid organic-inorganic perovskites. Calculations were performed on DFT level of theory. Those results were reported in the Influence of Orientational Disorder on the Optical Absorption Properties of the Hybrid Metal‐Halide Perovskite CH3NH3PbI3 publication. Geometries, HOMO, LUMO, Band gap energies are concatenated...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Maria Sołtysik prof. dr hab. inż. arch.
Osoby -
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Konferencje -
Szymon Kowalski mgr inż. arch.
OsobyAsystent naukowy w badaniach architektonicznych architektury średniowiecznej i nowożytnej w regionie Morza Bałtyckiego. Naukowo zajmuje się możliwościami zastosowania technologii wirtualnej rzeczywistości w kontekście konserwacji zabytków architektury i jej wpływu na teorię konserwatorską, a także rozwiązaniami zwiększającymi możliwości uczenia się studentów architektury.
-
On trees with double domination number equal to total domination number plus one
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. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...