Filters
total: 1502
displaying 1000 best results Help
Search results for: DISCRETE WAVELET TRANSFORMATION
-
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...
-
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...
-
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...
-
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...
-
Frequency and time domain characteristics of digital control of electric vehicle in-wheel drives
PublicationIn-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...
-
Mode shapes of a beam and plate with defects, obtained by experimental modal analysis
Open Research DataThe DataSet contains the experimental results of the first mode shape for a beam and a plate.
-
Szkoła letnia na WETI
EventsKatedra 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.
-
RESIDUE ANALYSIS OF ETU AND PTU BY LC/MS
PublicationDithiocarbamates (DTCs) are important organosulfur compounds, which act as inhibitors of metal dependant and sulphydryl enzymes and have a serious consequence on biological systems. They possess variety of applications in agriculture as fungicides, as well as, in the rubber industry as vulcanization accelerators and antioxidants. In this way, DTCs are the main group of fungicides used to control approximately 400 pathogens of more...
-
Certain family of analytical solutions of nonlinear von Neumann equations
PublicationIn this paper we present a slight generalization of certain type of Darboux transformation, that may be used sub-sequently in a convenient way. This method allows to obtain families of solutions of nonlinear von Neumann equations, that are used in particular in DNA modeling.
-
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.
-
The impact of the Tri-City Ring Road on surface water of small endorheic wetlands
PublicationThe paper presents the results of the impact of the Tri-City Ring Road on small endorheic catchment basins. Particular attention was paid to pollution discharged from the road to the surface water, as well as changes in hydrological conditions in the vicinity of the road. In the study, surface water samples were analysed in terms of their electrolytic conductivity, pH and content of major minerals. GIS was also used to study transformation...
-
The treatment of wastewater containing pharmaceuticals in microcosm constructed wetlands: the occurrence of integrons (int1–2) and associated resistance genes (sul1–3, qacEΔ1)
PublicationThe aim of this study was to analyze the occurrence of sulfonamide resistance genes (sul1–3) and other genetic elements as antiseptic resistance gene (qacEΔ1) and class 1 and class 2 integrons (int1–2) in the upper layer of substrate and in the effluent of microcosm constructed wetlands (CWs) treating artificial wastewater containing diclofenac and sulfamethoxazole (SMX), which is a sulfonamide antibiotic. The bacteria in the substrate...
-
Simulations of Shear Zones and Cracks in Engineering Materials Using eXtended Finite Element Method
PublicationNumerical 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.
-
Effect of soil on the capacity of viscous dampers between adjacent buildings
PublicationThis study investigated the seismic pounding of two adjacent buildings considering soil–structure interaction (SSI). A comprehensive parametric study of buildings with different heights was performed to reveal the pounding-involved behaviour considering the soil effect. Wavelet transform has been conducted to gain insight into the differences in the frequency contents of the impact forces between fixed- and flexible-base adjacent...
-
Spatial planning on regional level
PublicationPolish spatial planning results from typical for countries of Central and Eastern Europe transition . They have undergone the transformation from decentralized management system based on the dominance of state to the system of representative democracy, based on self-government administration; also territorial on regional level.
-
Architectural and urban theories in urban regeneration
e-Learning CoursesThis course deals with key issues associated with contemporary architectural and urban teories associated with transformation and revitalization of the distressed / degradated areas and buildings / objects. The architectural topics will be presented by dr Ksenia Piątkowska and Prof. Lucyna Nyka, while urban topics will be discussed by Prof. Piotr Lorens. Particular topics and themes will be presented according to the individual...
-
The Current State-of-the-Art in the Determination of Pharmaceutical Residues in Environmental Matrices Using Hyphenated Techniques
PublicationSeveral thousand tons of pharmaceuticals and their transformation products (metabolites and degradation products) are introduced into the environment each year. They affect both human health and the environment, therefore, analytical procedures enabling the determination of a wide range of pharmaceuticals at trace levelswithminimal effort, time, and energy are required. Nowadays, hyphenated techniques are commonly applied in pharmaceutical...
-
The unstable thermoelectric effect in non-stoichiometric Cu2Se during the non-equilibrium phase transition
PublicationThe superionic α ↔ β phase transition in Cu1.96Se thermoelectric material is investigated by means of thermal analysis (DSC) and measurements of Seebeck coefficient and electrical conductivity. Results of the DSC measurements with 1–10 K/min heating and cooling rates show that the material is close to the equilibrium phase composition during the transformation. However, the kinetic limitation of the process exists, which is indicated...
-
UV-Vis-DR-TiO2 heated at 400-600oC in Ar or H2
Open Research DataThese data contain UV-Vis/DR spectra of TiO2 heated at 400-600oC in Ar or H2. Transformation of spectra to Kubelka-Munk function was performed together with determination of band gap.
-
A Novel Approach to the Assessment of Cough Incidence
PublicationIn this paper we consider the problem of identication of cough events in patients suffering from chronic respiratory diseases. The information about frequency of cough events is necessary to medical treatment. The proposed approach is based on bidirectional processing of a measured vibration signal - cough events are localized by combining the results of forward-time and backward-time analysis. The signal is at rst transformed...
-
Employing a biofeedback method based on hemispheric synchronization in effective learning
PublicationIn this paper an approach to build a brain computer-based hemispheric synchronization system is presented. The concept utilizes the wireless EEG signal registration and acquisition as well as advanced pre-processing methods. The influence of various filtration techniques of EOG artifacts on brain state recognition is examined. The emphasis is put on brain state recognition using band pass filtration for separation of individual...
-
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...
-
Łukasz Sienkiewicz dr hab.
PeopleGraduate of the Warsaw School of Economics, habilitated doctor in the field of social sciences in the discipline of management and quality science. University Associate professor at the Department of Entrepreneurship of the Faculty of Management and Economics of the Gdańsk University of Technology and coordinator of the Center for Economic, Social and Technological Transformation (C-TEST). Chairman of the Board of the Institute...
-
Activation of N2O and SO2 by the P–B Bond System. Reversible Binding of SO2 by the P–O–B Geminal Frustrated Lewis Pair
PublicationHerein, we present the first transformation of borylphosphine into borylphosphinite using nitrous oxide. Borylphosphine reacts with N2O via insertion of a single oxygen atom into the P−B bond and formation of a P−O−B bond system. Borylphosphine and borylphosphinite capture SO2 and activate it in an irreversible and reversible manner, respectively.
-
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.
-
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.
-
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 -
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.
-
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.
-
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...
-
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...
-
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...
-
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 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.
-
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.
-
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...