Filters
total: 1621
-
Catalog
displaying 1000 best results Help
Search results for: DISCRETE CRACKS
-
EXPERIMENTAL AND THEORETICAL FLOW OF THE FORCES IN DEEP BEAMS WITH CANTILEVAR
PublicationThis article presents the results of experimental research carried out on deep beams with cantilever which was loaded throughout the depth. The main deep beam was directly simply supported on the one side. On the other side the deep beam was suspended in another deep member situated at right angles. All deep beams created a spatial arrangement. The paper is focused on the analysis of the cracks morphology and flow of the internal...
-
Causes of damage and methods of repairing floor made on polystyrene concrete
PublicationThe paper describes damages, tests and repair of the floor made on existing ceiling and expanded polystyrene concrete underlay. The floor was built on a reinforced concrete ceiling with an area of about 1050 m2. Significant damage in the form of cracks, detachments and unevenness was found in the floor. In order to determine the causes of damage, in situ tests and laboratory tests were carried out. It was found that the damage...
-
LDRAW based renders of LEGO bricks moving on a conveyor belt with extracted models
Open Research DataThe set contains renders of LEGO bricks moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. For each brick starting position, alignment and color was selected (simulating the brick falling down on the conveyour belt) and than 10 images was created while the brick was moved across the...
-
Two tests for adhesive bonding long term characterization: principles and applications
PublicationThis article describes recent refinement of the traditional wedge test technique used to characterize durability of the adhesive joints. We propose two types of measuring protocols to monitor precisely and continuously the propagation of an "effective" crack during long term mode I fracture mechanic test. First method is directly derived from the traditional wedge test technique and consist in monitoring the surface strain of adherent...
-
Fracture of aluminium joints bonded with epoxy adhesive reinforced by mmt nanoparticles
PublicationCrack propagation behavior was studied for aluminium/aluminum adhesive joints bonded with two epoxy adhesives: pure and reinforced with clay nanoparticles. The focus was also on the novel use of the constant displacement rate test to study adhesion/adhesives efficiency. The epoxy systems studied were: Epidian E6 produced from bisphenol A and epichlorohydrin, (''Organika -Sarzyna'' Poland); pure or strengthened with montmorillonit...
-
Bitumen Aging—Laboratory Simulation Methods Used in Practice and Selected Directions of Research on New Methods
PublicationChanges in the properties of bitumen binders that occur as a result of aging have a huge impact on the durability of products produced from them. In particular, asphalt pavements, which constitute the most common use of petroleum bitumen, are susceptible to damage resulting from the increasing stiffness of the bitumen during its life cycle. Increased stiffness of asphalt pavements reduces the pavement resistance to low-temperature...
-
Comments on “Closed Form Variable Fractional Time Delay Using FFT”
PublicationIn this letter drawbacks of the aforementioned paper are pointed out. The proposed approach is improved with minor modifications of the discrete frequency response. This allows for design of fractional delay filters which are close to optimal and can be efficiently implemented in the frequency domain using the sliding DFT based structure. Alternatively, the derived equivalent closed form formulae for offset windows can be used...
-
Odtwarzanie przebiegu trasy kolejowej o złożonym ukształtowaniu geometrycznym
PublicationKształt eksploatowanych torów kolejowych jest w niektórych sytuacjach bardzo złożony, a jednocześnie − jak wykazały przeprowadzone ciągłe pomiary satelitarne − niekiedy tak zdeformowany, że określenie kierunków głównych okazuje się niemożliwe.W pracy przedstawiono program komputerowy do odtwarzania przebiegu trasy kolejowej w takich właśnie przypadkach. Przygotowano zestaw funkcji realizujących połączenia prostych i łuków kołowych...
-
A note on total reinforcement in graphs
PublicationIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
A station strategy to deter backoff attacks in IEEE 802.11 LANs
PublicationDla konstrukcji strategii zapobiegającej atakom na mechanizm odczekania w sieciach lokalnych IEEE 802.11 zastosowano wybór konfiguracji MAC sterowany przez liczniki etapów gry z losowymi wartościami początkowymi. Wykazano, że przy pewnych warunkach nałożonych na rozkady prawdopodobieństwa liczników standardowe ustawienia parametrów MAC stają się punktem doskonałej równowagi strategicznej.
-
Easy and hard instances of arc ranking in directed graphs
PublicationArtykuł dotyczy uporządkowanego kolorowania łuków grafów skierowanych. Problem polega na takim przyporządkowaniu liczb łukom digrafu, aby każda skierowana ścieżka łącząca dwa łuki o tej samej liczbie (kolorze) zawierała łuk o kolorze wyższym. Praca podaje liniowy optymalny algorytm dla pewnego szczególnego przypadku, oraz zawiera dowód, iż problem ten jest obliczeniowo trudny dla 3-dzielnych acyklicznych digrafów i stałej liczby...
-
Total outer-connected domination numbers of trees
PublicationNiech G=(V,E) będzie grafem bez wierzchołków izolowanych. Zbiór wierzchołków D nazywamy zbiorem dominującym totalnym zewnętrznie spójnym jeżli każdy wierzchołek grafu ma sąsiada w D oraz podgraf indukowany przez V-D jest grafem spójnym. Moc najmniejszego zbioru D o takich własnościach nazywamy liczbą dominowania totalnego zewnątrznie spójnego. Praca m.in. zawiera dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego...
-
A note on the strength and minimum color sum of bipartite graphs
PublicationSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe 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...
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
A note on the weakly convex and convex domination numbers of a torus
PublicationW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Compact scheduling of zero–one time operations in multi-stage systems
Publication -
Open shop problem with zero-one time operations and integer release date/deadline intervals
Publication -
On the deficiency of bipartite graphs
Publication -
A polynomial algorithm for finding T-span of generalized cacti
Publication -
Edge ranking and searching in partial orders
PublicationArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Forwarding and optical indices of a graph
PublicationW pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
The complexity of the T-coloring problem for graphs with small degree.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
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.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
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...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Comparative modeling of shear localization in granular bodies with FEM and DEM
PublicationThe intention of the paper is to compare the calculations of shear zones in granular bodies using two different approaches: a continuum and a discrete one. In the first case, the FEM based on a micro-polar hypoplastic constitutive law was used. In the second case, the DEM was taken advantage of, where contact moments were taken into account to model grain roughness. The comparative calculations were performed for a passive case...
-
Investigation on Mode I Fracture Behavior of Hybrid Fiber-Reinforced Geopolymer Composites
PublicationRecent reports in the literature have shown that fber-reinforced geopolymer composites (FRGC) made with monofbers exhibit a signifcant enhancement in fracture energy. However, many aspects of the fracture performance of hybrid fberreinforced geopolymer composites (HFRGC) remain largely unexploited, and these are predominant for the structures. For the frst time, the mode I fracture energy of HFRGC is investigated. The mode I behavior...
-
Restoration and preservation of the reinforced concrete poles of fence at the former Auschwitz concentration and extermination camp
PublicationThe objective of this study was to assess the present state of the reinforced concrete poles of fence at the former Auschwitz I and Auschwitz II-Birkenau concentration and extermination camp. The poles were subjected to renovation about 10 years ago. After this time some deficiencies of applied renovation method were noticed. Cracks appeared between fresh and original part of concrete cover. Analysis of the reasons of these failures...
-
Restoration and preservation of the reinforced concrete poles of fence at the former Auschwitz concentration and extermination camp
PublicationThe objective of this study was to assess the present state of the reinforced concrete poles of fence at the former Auschwitz I and Auschwitz II-Birkenau concentration and extermination camp. The poles were subjected to renovation about 10 years ago. After this time some deficiencies of applied renovation method were noticed. Cracks appeared between fresh and original part of concrete cover. Analysis of the reasons of these failures...
-
Weldability of high strength steels in wet welding conditions
PublicationIn this paper are characterized problems of high strength steel weldability in underwater wet welding conditions. Water as a welding environment intensifies action of unfavourable factors which influence susceptibility to cold cracking of welded steel joints. The susceptibility to cold cracking of S355J2G3 steel and S500M steel in wet conditions was experimentally estimated (by using Tekken test). It was concluded that the steels...