Filters
total: 2052
filtered: 1502
displaying 1000 best results Help
Search results for: algorithmic graph theory
-
Application of the theory of energy transformation systems to fatigue assessment of steel elements under multiaxial periodic loading
PublicationPraca dotyczy symulacji odporności zmęczeniowej elementów stalowych poddanych wieloosiowym obciążeniom okresowym w zakresie wysokocyklowym. W tym celu zdefiniowano jednoosiowe naprężenie sinusoidalne, równoważne w sensie trwałości zmęczeniowej materiału naprężeniu aktualnemu gdy każda jego kartezjańska składowa jest dana w postaci szeregu Fouriera. Warunki równoważności wynikają z teorii systemów transformacji energii i wiążą się...
-
Application of potential theory in calculating wave-induced vertical forces on horizontal cylinders near a plane boundary
PublicationHydrodynamiczne obciażenia wywołane falowaniem morskim działajace na poziomo ułożoną przy dnie rurę, rozpatrywane są w ujęciu dyfrakcyjnym przy założeniu istnienia funkcji potencjału. Potencjał zdefiniowano jako superpozycję potencjału fali inicjującej oraz potencjału perturbacji spowodowanej istnieniem obiektu przy dnie. Wyniki rozwiązań teoretycznych porównano z wynikami doswiadczeń przeprowadzonych w Wielkim Kanale falowym w...
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe 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...
-
Book Review: Vishwas Satgar (ed.), The Solidarity Economy Alternative: Emerging Theory and PracticeSatgarVishwas (ed.), The Solidarity Economy Alternative: Emerging Theory and Practice, University of KwaZulu-Natal Press: Durban, 2014; 332 pp.: ISBN 9781869142575, US$34.44
Publication -
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Systems of General Grants for Local Governments in Selected EU Countries Against the Background of the General Theory of Fiscal Policy
PublicationFiscal policy, including its expenditure aspect, is often discussed and analysed from a variety of angles in the literature on public finances, undoubtedly due to the major importance of this topic. However, not all areas of the expenditure part of fiscal policy have been subjected to in-depth analysis. One of the less discussed tools of fiscal policy consists of general purpose transfers, which are a certain type of expenditure...
-
Density Functional Theory Studies on Ir Spectra of the Triphenylene Derivatives. A Scaled Quantum Mechanical Force Field Approach
Publication -
Bond graph modeling of the new generation engine cooling systems = Zastosowanie metody grafów wiązań do modelowania nowej generacji układów chłodzenia silników spalinowych
PublicationW referacie szczegółowo opisano modele wymiany ciepła i przepływów w układzie chłodzenia. Metoda grafów wiązań okazała się szczególnie użyteczną dla modelowania skomplikowanych systemów energetycznych o różnych postaciach energii. Jako przykładu użyto obiegu chłodzenia silnika badawczego na hamowni silnikowej.
-
Dynamic analysis of the impact of the wind spectrum according to the theory of Davenport for lightweight structures of the roof in sports hall Czyzyna in Cracow.
PublicationThe main aim of this analysis is to characterize numerical simulations connected with modeling dynamic influence of wind on the lightweight structures of the roof in sports hall – “Czyżyna”. This hall is built in Cracow. The article also involves the proposals of the solutions connected with dynamic influence of the wind – Davenport’s method has been used. These proposals have not been taken into consideration at the detailed engineering...
-
Finite elements based on a first-order shear deformation moderate rotation shell theory with applications to the analysis of composite structures
Publication -
Ilościowy opis zagadnień inzynierii środowiska - teoria i praktyka = Quantitative description of environental engineering probles- theory and practice
PublicationOmówiono funkcjonalna strukturę metod obliczeniowych, stosowanych w inzynierii środowiska, w szczególności podczas projektowania obiektów technicznych. Zwrócono uwagę na charakterystykę kryteriów projektowych. Przedstawiono trzy przykłady problemów praktycznych, wskazując na błędy, popełnione podczas ich rozwiązywania.
-
Modelling of in-plane wave propagation in a plate using spectral element method and Kane–Mindlin theory with application to damage detection
Publication -
Density functional theory-based simulations of sum frequency generation spectra involving methyl stretching vibrations: effect of the molecular model on the deduced molecular orientation and comparison with an analytical approach
PublicationThe knowledge of the first hyperpolarizability tensor elements of molecular groups is crucial for a quantitative interpretation of the sum frequency generation (SFG) activity of thin organic films at interfaces. Here, the SFG response of the terminal methyl group of a dodecanethiol (DDT) monolayer has been interpreted on the basis of calculations performed at the density functional theory (DFT) level of approximation. In particular,...
-
Kα1,2x-ray linewidths, asymmetry indices, and[KM]shake probabilities in elements Ca to Ge and comparison with theory for Ca, Ti, and Ge
Publication -
Financial impact analysis of going public at the Warsaw Stock Exchange: Using Fuzzy Set Theory to understand behaviours of mature companies
Publication -
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
Can social enterprise contribute to creating sustainable rural communities? Using the lens of structuration theory to analyse the emergence of rural social enterprise
Publication -
Spectroscopic and cytotoxic characteristics of (p-cymene)Ru(II) complexes with bidentate coumarins and density functional theory comparison with selected Pd(II) complexes
PublicationThis paper presents the synthesis of two new (p-cymene)-ruthenium(II) complexes with the bidentate coumarin ligands. Both complexes were characterized by FTIR spectroscopy, 1H NMR, 13C NMR, MS, elemental analysis and DFT calculations. The X-ray structure of complex 3a was also solved. The cytotoxic properties of both complexes were examined on human leukemia NALM-6 and HL-60 cells and melanoma WM-115 cells. The complexes possess...
-
Bio and slide biobearings, their lubrication by non-newtonian fluids and application in non-conventional systems. Vol. 2, The theory of human joint unsteady lubrication.
PublicationW monografii przedstawiono zasady niestacjonarnego smarowania stawów człowieka o odkształcalnych chrząstkach i powierzchniach kostnych w polach indukcji magnetycznej. W opisie stochastycznym uwzględnione zostały nienewtonowskie, lepkosprężyste właściwości cieczy synowialnych jako czynnika smarującego. Monografia prezentuje rozkłady wartości ciśnienia i nośności stawów człowieka w warunkach niestacjonarnego smarowania dla drgań...
-
A constitutive model for concrete based on continuum theory with non-local softening coupled with eXtended Finite Element Method. Computational Modelling of Concrete Structures,
PublicationArtykuł omawia model połączony ciągły-nieciągły do modelowania stref lokalizacji i rys w betonie niezbrojonym. Obliczenia wykonano stosując rozszerzoną metodę elementów skończonych. Wyniki numeryczne porównano z doświadczeniami.
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet 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...
-
Periodic expansion in determining minimal sets of Lefschetz periods for Morse–Smale diffeomorphisms
PublicationWe apply the representation of Lefschetz numbers of iterates in the form of periodic expansion to determine the minimal sets of Lefschetz periods of Morse–Smale diffeomorphisms. Applying this approach we present an algorithmic method of finding the family of minimal sets of Lefschetz periods for Ng, a non-orientable compact surfaces without boundary of genus g. We also partially confirm the conjecture of Llibre and Sirvent (J Diff...
-
A Systematic Search for New Coupling Schemes of Cross-Coupled Resonator Bandpass Filters
PublicationIn this paper, a systematic approach to an extensive search for topologies of cross-coupled filters with generalized Chebyshev response is presented. The technique applies graph theory to find unique, nonisomorphic filter configurations, and tests whether a specific frequency response can be realized in a given set of topologies. The results of the search are then stored in a database of possible filter configurations.
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Analysis of impact of lossy audio compression on the robustness of watermark embedded in the DWT domain for non-blind copyright protection
PublicationA methodology of non-blind watermarking of the audio content is proposed. The outline of audio copyright problem and motivation for practical applications are discussed. The algorithmic theory pertaining watermarking techniques is briefly introduced. The system architecture together with employed workflows for embedding and extracting the watermarks are described. The implemented approach is described and obtained results are reported....
-
On-line Search in Two-Dimensional Environment
PublicationWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
Application of the theory of semi-markov processes to the development of a reliability model of an automotiv vrhicle = Zastosowanie teorii procesów semi-Markowa do opracowania modelu niezawodnościowego samochodu
PublicationW artykule przedstawiono możliwość zastosowania teorii procesów semi-Markowa (semimarkowskich) do opisu niezawodności samochodu, na przykładzie samochodu osobowego. W rozważaniach uwzględniony został samochód, w którym wyróżniono takie węzły konstrukcyjne (zespoły funkcjonalne) jak: silnik z układami zasilania czynnikami energetycznymi (paliwem, olejem smarowym i cieczą chłodzącą), sprzęgło, skrzynia biegów, wał napędowy, most...
-
The History of the Theory of Structures [Historia teorii konstrukcji] / K.-E. Kurrer. - Berlin : Ernst & Sohn, 2008.- 848 s. :501 rys. - Bibliogr. 1158 poz.
PublicationOmówiono angielskojęzyczne dzieło nt. historii teorii konstrukcji jako duże rozszerzenie wcześniejszej jego wersji niemieckojęzycznej. W opinii recenzenta w dziele tym zebrano i uporządkowano obszerny materiał przedmiotu, w dużej mierze - unikatowy.
-
Przepływ wody w ośrodkach nienasyconych o podwójnej porowatości: zastosowanie metody homogenizacji. Unsaturated water flow in double porosity media: application of the homogenization theory
PublicationPrzedstawiono model matematyczny przepływu w gruncie o podwójnej porowatości wyprowadzony metodą homogenizacji. Otrzymano równanie makroskopowe z parametrami efektywnymi i członem źródłowym. Przedstawiono wyniki przykładowych obliczeń numerycznych i porównania z modelem znanym z literatury.
-
“The Guardians of the Truth”: Journalists’ Resistance to the Algorithmization of Journalism
PublicationRegardless of the term used, be it “robot journalism,” “automated journalism,” “algorithmic journalism” or “machine-written journalism,” the process of automatic content creation and distribution is progressing in the newsrooms. Meanwhile, exercising control over the creation and distribution of news is considered a fundamental element of journalists’ professional identity. The article presents the results of research on the perception...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Algebraic periods and minimal number of periodic points for smooth self-maps of 1-connected 4-manifolds with definite intersection forms
PublicationLet M be a closed 1-connected smooth 4-manifolds, and let r be a non-negative integer. We study the problem of finding minimal number of r-periodic points in the smooth homotopy class of a given map f: M-->M. This task is related to determining a topological invariant D^4_r[f], defined in Graff and Jezierski (Forum Math 21(3):491–509, 2009), expressed in terms of Lefschetz numbers of iterations and local fixed point indices of...
-
Average Redundancy of the Shannon Code for Markov Sources
PublicationIt 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...
-
Study of the Flow Dynamics of Surface Water Masses in the Area of the Coastal Gulf of Gdansk
PublicationThe 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,...
-
(Lost) Pride and Prejudice. Journalistic Identity Negotiation Versus the Automation of Content
PublicationThe 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...
-
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/
PublicationThe 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)...
-
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublicationThe 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
PublicationThe 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...
-
A city is not a tree: a multi-city study on street network and urban life
PublicationChristopher 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
PublicationIn 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...
-
Dynamic F-free Coloring of Graphs
PublicationA 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...
-
On proper (1,2)‐dominating sets in graphs
PublicationIn 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...
-
On trees with double domination number equal to total domination number plus one
PublicationA 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,...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Rearrangeability in multicast Clos networks is NP-complete
PublicationPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Infinite chromatic games
PublicationIn 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...