Filtry
wszystkich: 908
-
Katalog
Wyniki wyszukiwania dla: discrete radon transform
-
PROPERTIES OF ONE DIMENSIONAL OPEN-CHANNEL STEADY FLOW EQUATIONS
PublikacjaIn this paper properties of discrete forms of one dimensional steady gradually varied flow equations are discussed. Such forms of flow equations are obtained as a result of approximation of their differential forms, which is required to solve them numerically. For such purpose explicit or implicit numerical approximation schemes for ordinary differential equations can be applied. It turns out that dependently on the chosen approximation...
-
Modulated crystal structures - periodicity in more than three dimensions
PublikacjaThe initial definition of a crystal was that it is an object with flat faces. When diffraction studies were developed it turned out that crystal consists of a highly ordered particles and it is possible to isolate a small unique part of their structure - a unit cell - and the definition has been changed to rely on this fact. Nowadays by a crystal we mean any solid having an essentially discrete diffraction diagram. It is because...
-
Short Term Monitor of Photodegradation Processes in Ranitidine Hydrochloride Observed by FTIR and ATR FTIR
PublikacjaThe effects of degradation of ranitidine hydrochloride exposed to UVB radiation (l = 310 nm) and oxygen in a weathering chamber were studied by Fourier Transform Infrared spectroscopy (FTIR) and Attenuated Total Reflectance Fourier Transform Infrared spectroscopy (ATR-FTIR). ATR-FTIR profile indicated that the degradation was spatially heterogeneous. Significant amounts of photoproducts were detected only in a directly...
-
Parametric impulsive noise detector for corrupted audio signals based on hidden Markow model
PublikacjaThe paper addresses the problem of impulsive noise detection for audio signals. A structure of threshold parameter detectors using modelingof signals was introduced. the algorithm of the noise detection, based on discrete-time hidden Markow model (HMM)of whitened audio signal is elaborated
-
Using concentrated spectrogram for analysis of audio acoustic signals
PublikacjaThe paper presents results of time-frequency analysis of audio acoustic signals using the method of Concentrated Spectrograph also known as ''Cross-spectral method'' or ''Reassignment method''. Presented algorithm involves signal's local group delay and channelized instantaneous frequency to relevantly redistribute all Short-time Fourier transform lines in time-frequency plain. The main intention of the paper is to compare various...
-
Preliminary Investigation on Auto-Thermal Extrusion of Ground Tire Rubber
PublikacjaGround tire rubber (GTR) was processed using an auto-thermal extrusion as a prerequisite to green reclaiming of waste rubbers. The reclaimed GTR underwent a series of tests: thermogravimetric analysis combined with Fourier-transform infrared spectroscopy (TGA-FTIR), scanning electron microscopy (SEM), Fourier-transform infrared spectroscopy (FTIR), and static headspace and gas chromatography-mass spectrometry (SHS-GC-MS) in order...
-
Audio codec employing frequency-derived tonality measure
PublikacjaA transform codec employing efficient algorithm for detection of spectral tonal components is presented. The tonality measure used in MPEG psychoacoustic model is replaced with the method providing adequate tonality estimates even if the tonal components are deeply frequency modulated. The reliability of hearing threshold estimated using psychoacoustic model with standardized tonality measure and the proposed one is investigated...
-
Sources and fate of microplastics in marine and beach sediments of the Southern Baltic Sea—a preliminary study
PublikacjaMicroplastics’ sources and fate in marine bottom and beach sediments of strongly polluted Baltic Sea have been investigated.Microplastics were extracted using sodium chloride. Their qualitative identification was conducted using micro-Fourier-transform infrared spectroscopy (μFT-IR).
-
Szkoła letnia na WETI
WydarzeniaKatedra Algorytmów i Modelowania Systemów WETI organizuje szkołę letnią pt.: "Gdansk Summer School of Advanced Science on Algorithms for Discrete Optimization" dla osób zainteresowanych algorytmiką i teorią grafów.
-
New Concept of Numerical Ship Motion Modelling for Total Ship Operability Analysis by Integrating Ship and Environment Under One Overall System
PublikacjaThe 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
PublikacjaIn 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.
-
Flow Process Models for Pipeline Diagnosis
PublikacjaThis 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...
-
On the Structure of Time in Computational Semantics of a Variable-Step Solver for Hybrid Behavior Analysis
PublikacjaHybrid 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...
-
Frequency and time domain characteristics of digital control of electric vehicle in-wheel drives
PublikacjaIn-wheel electric drives are promising as actuators in active safety systems of electric and hybrid vehicles. This new function requires dedicated control algorithms, making it essential to deliver models that reflect better the wheel-torque control dynamics of electric drives. The timing of digital control events, whose importance is stressed in current research, still lacks an analytical description allowing for modeling its...
-
Periodic and chaotic dynamics in a map‐based neuron model
PublikacjaMap-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...
-
Analysis of compressive forces in CFGFT cylindrical pillars and their coatings using laboratory tests and metric spaces
PublikacjaThe 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...
-
Lamb wave-based monitoring of shear failure of an adhesive lap joint
PublikacjaThe paper presents a study on the elastic wave propagation in adhesive joints of steel plates subjected to tensile loading. A single lap joint was chosen for analysis because of its simplicity and plurality of applications. Experimental investigations consisted of the uniaxial extension of prepared specimens. Force and displacement values were recorded by a testing machine. Simultaneously, guided Lamb waves were excited and signals...
-
Numerical solutions for blood flow in elastic vessels
PublikacjaWe consider the differential–algebraic system for the blood flow and pressure in the systemic arteries. By the operator splitting method, we transform the system into the hyperbolic one, introduce the bicharacteristics, and perform the time–space nonuniform discretization, obtaining the innovative difference scheme. Our results are illustrated with numerical experiments.
-
Experimental verification and comparison of mode shape-based damage detection methods
PublikacjaThis paper presents experimental verification and comparison of damage detection methods based on changes in mode shapes such as: mode shape curvature (MSC), modal assurance criterion (MAC), strain energy (SE), modified Laplacian operator (MLO), generalized fractal dimension (GFD) and Wavelet Transform (WT).
-
Joanna Czerska dr inż.
OsobyJoanna Czerska jestem człowiekiem, którego misją i pasją jest rozwój ludzi i organizacji. Moje motto to: „Nie ma takiej fantazji, której wola i rozum ludzki nie zdołałby przekształcić w rzeczywistość.” William Shakespeare W życiu kieruję się wartościami szacunku, pracy zespołowej i pozytywnego nastawienia. To one mnie definiują i decydują o tym jakim jest człowiekiem.Moja przygoda z Lean rozpoczęła się, podczas pisania pracy...
-
Application of non-classical operational calculus to indicate hazards in numerical solutions of engineering problems
PublikacjaThe 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...
-
Active and Dynamic Graphical Code for Object Identification in Healthcare
PublikacjaA 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.
-
A fast time-frequency multi-window analysis using a tuning directional kernel
PublikacjaIn this paper, a novel approach for time-frequency analysis and detection, based on the chirplet transform and dedicated to non-stationary as well as multi-component signals, is presented. Its main purpose is the estimation of spectral energy, instantaneous frequency (IF), spectral delay (SD), and chirp rate (CR) with a high time-frequency resolution (separation ability) achieved by adaptive fitting of the transform kernel. We...
-
Magdalena Radoń dr inż.
Osoby -
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence
PublikacjaWe resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth's recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth's recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.
-
Simulations of Shear Zones and Cracks in Engineering Materials Using eXtended Finite Element Method
PublikacjaNumerical simulations of cracks and shear zones in quasi-brittle materials are presented. Extended Finite Element Method is used to describe both cracks and shear zones. In a description of tensile cracks, a Rankine criterion is assumed. A discrete Mohr-Coulomb law is adopted for simulations of shear zones. Results of simple numerical tests: unixial tension, bending and biaxial compression are demonstrated.
-
Global edge alliances in graphs
PublikacjaIn 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...
-
On the super domination number of lexicographic product graphs
PublikacjaThe 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...
-
The complexity of the T-coloring problem for graphs with small degree
Publikacja -
Some results concerning the complexity of restricted colorings of graphs
Publikacja -
Compact scheduling of zero–one time operations in multi-stage systems
Publikacja -
Open shop problem with zero-one time operations and integer release date/deadline intervals
Publikacja -
On the deficiency of bipartite graphs
Publikacja -
A polynomial algorithm for finding T-span of generalized cacti
Publikacja -
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven 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,...
-
Edge ranking and searching in partial orders
PublikacjaArtykuł 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
PublikacjaW 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.
-
Total outer-connected domination numbers of trees
PublikacjaNiech 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 graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublikacjaWe 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...
-
A station strategy to deter backoff attacks in IEEE 802.11 LANs
PublikacjaDla 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
PublikacjaArtykuł 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...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublikacjaW 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.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, 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...
-
A note on the strength and minimum color sum of bipartite graphs
PublikacjaSiłą 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.
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublikacjaDla 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
PublikacjaW pracy określone są liczby liczby dominowania i dominowania wypukłego torusów, czyli iloczynów kartezjańskich dwóch cykli.
-
Interval incidence coloring of bipartite graphs
PublikacjaIn 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
PublikacjaIn 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...
-
Three-fast-searchable graphs
PublikacjaIn 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...