Filters
total: 1621
filtered: 1286
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: DISCRETE CRACKS
-
New Concept of Numerical Ship Motion Modelling for Total Ship Operability Analysis by Integrating Ship and Environment Under One Overall System
PublicationThe paper presents a new concept of overall ship motion modelling for application to total ship operability. The delivered model is a multi-phase and includes both submerged part of ship’s hull and the surrounding water as a unique body. The Discrete Finite Element Method is applied. The model is successfully examined and illustrated for a selected AHTS.
-
A Nyquist filter of fractional delay
PublicationIn the paper a novel discrete-time FIR fractonal delay specjal filter is investigated. This is a Nyquist filter which, besides the traditional its attribute (interymbol interference (ISI) free property), has the ability to compensate for subsample transmission delay involved, for example, in multipath propagation channel. The performance of the filter is analysed and illustrated.
-
Weldability of high strength steel in underwater environment
PublicationThe article describes the problems with weldability of high-strength steels in the aquatic environment. The tendency of steel S355J2G3 and S500M to form cold cracks when welded in wet welding conditions has been experimentally evaluated. It was found that the tested steels have a high propensity to cracking. An experiment has been proposed and tested to evaluate the usefulness of the tempering bead technique as a method of improving...
-
On the Structure of Time in Computational Semantics of a Variable-Step Solver for Hybrid Behavior Analysis
PublicationHybrid dynamic systems combine continuous and discrete behavior. Often, computational approaches are employed to derive behaviors that approximate the analytic solution. An important part of this is the approximation of differential equation behavior by numerical integration. The accuracy and computational efficiency of the integration usually depend on the complexity of the method and its implicated approximation errors, especially...
-
Analysis of compressive forces in CFGFT cylindrical pillars and their coatings using laboratory tests and metric spaces
PublicationThe article discusses compressive forces tests in composite-concrete pillars with the use of laboratory active experiment including the factors and properties of materials which have a significant impact on the test results and their repeatability. A polymer composite based on glass fiber reinforced resin with different fiber beam angles (20, 55 and 85) was used as a buffer/coat of the pole. Due to the problems with direct comparison...
-
Flow Process Models for Pipeline Diagnosis
PublicationThis chapter examines the problem of modeling and parameterization of the transmission pipeline flow process. First, the base model for discrete time is presented, which is a reference for other developed models. Then, the diagonal approximation (AMDA) method is proposed, in which the tridiagonal sub-matrices of the recombination matrix are approximated by their diagonal counterparts, which allows for a simple determination of...
-
Periodic and chaotic dynamics in a map‐based neuron model
PublicationMap-based neuron models are an important tool in modeling neural dynamics and sometimes can be considered as an alternative to usually computationally costlier models based on continuous or hybrid dynamical systems. However, due to their discrete nature, rigorous mathematical analysis might be challenging. We study a discrete model of neuronal dynamics introduced by Chialvo in 1995. In particular, we show that its reduced one-dimensional...
-
Impact response of novel layered two stage fibrous composite slabs with different support type
PublicationThe performance of novel Layered Two Stage Fibrous Composite slabs (LTSFC) was pioneered under falling mass collisions using a combined experimental and numerical study. Such LTSFC slabs consist of three layers with and without the insertion of glass fibre mesh between the layers. LTSFC techniques were used to fabricate the composite slabs with three layers including 3%, 1.5%, and 3% of fibre content for the top, middle, and...
-
Active and Dynamic Graphical Code for Object Identification in Healthcare
PublicationA new approach for item marking using two dimensional discrete graphics markers. Proposed solution allow o change the code rapidly, upon request and in the case of thermal markers make the code invisible for unauthorized observers. Connecting the proposed codes with wearable multmedial platform such as eGlasses can create new possibilities in human-environment interaction.
-
Application of non-classical operational calculus to indicate hazards in numerical solutions of engineering problems
PublicationThe article addresses the application of non- classical operational calculus to approximative solutions of engineering problems. The engineering-sound examples show that a continuous–discrete problem transformation from differential unequivocal problem to a differential wildcard problem, triggering a change in solution quality. A number of approximative methods are capable to alter both quantitative and qualitative...
-
Wzmocnienie uszkodzonej belki typu T w przęśle wiaduktu drogowego
PublicationW artykule opisano metodę wzmocnienia belki prefabrykowanej typu T dźwigara wiaduktu drogowego uszkodzonej przez pojazd „wozidło”. Beton belki uległ zarysowaniom w wielu miejscach. Wystąpiły też ubytki otuliny strun sprężających. Zaproponowano naprawę i wzmocnienie przez dobetonowanie dodatkowej belki. Podczas naprawy zastosowano balastowanie przęsła w celu wciągnięcia nowego dźwigara do współpracy od ciężaru własnego i sprężenia....
-
Survivability weighted floodable length surfaces.
PublicationPraca przedstawia nowy typ krzywych grodziowych dla przedziałów poprzecznych, obliczanych dla zadanej wartości mnożnika si, traktowanego jako parametr. Krzywe takie są niezależne od aktualnego podziału grodziowego statku. Są niezmiernie użyteczne do otymalizowania podziału grodziowego w świetle probabilistycznych przepisów niezatapialności.
-
A comparison of geometric analogues of holographic reduced representations, original holographic reduced representations and binary spatter codes
PublicationGeometric Analogues of Holographic Reduced Representations (GA HRR) employ role-filler binding based on geometric products. Atomic objects are real-valued vectors in n-dimensional Euclidean space and complex statements belong to a hierarchy of multivectors. The paper reports a battery of tests aimed at comparison of GA HRR with Holographic Reduced Representation (HRR) and Binary Spatter Codes (BSC). Firstly, we perform a test of...
-
Operational causes of fatigue failures within the passages of gas turbine engines
PublicationThe short profile of a fatigue wear process of gas turbine engine's constructional elements has been introduced in the article. The primary causes of a fatigue cracks formation within the mechanical system as well as within the passages of the engine have been showed. Especial attention was devoted to the low-cycle fatigue, what is associated with unsteady thermal-flow processes being worked out in the passages.The selected damages...
-
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...
-
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...