Filtry
wszystkich: 1498
wybranych: 1014
-
Katalog
- Publikacje 1014 wyników po odfiltrowaniu
- Czasopisma 39 wyników po odfiltrowaniu
- Konferencje 14 wyników po odfiltrowaniu
- Osoby 37 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 29 wyników po odfiltrowaniu
- Wydarzenia 2 wyników po odfiltrowaniu
- Dane Badawcze 362 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: DISCRETE WAVELET TRANSFORMATION
-
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...
-
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...
-
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...
-
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...
-
RESIDUE ANALYSIS OF ETU AND PTU BY LC/MS
PublikacjaDithiocarbamates (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
PublikacjaIn 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
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.
-
The impact of the Tri-City Ring Road on surface water of small endorheic wetlands
PublikacjaThe 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)
PublikacjaThe 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
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.
-
Effect of soil on the capacity of viscous dampers between adjacent buildings
PublikacjaThis 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
PublikacjaPolish 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.
-
The Current State-of-the-Art in the Determination of Pharmaceutical Residues in Environmental Matrices Using Hyphenated Techniques
PublikacjaSeveral 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
PublikacjaThe 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...
-
A Novel Approach to the Assessment of Cough Incidence
PublikacjaIn 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
PublikacjaIn 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”
PublikacjaIn 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...
-
Activation of N2O and SO2 by the P–B Bond System. Reversible Binding of SO2 by the P–O–B Geminal Frustrated Lewis Pair
PublikacjaHerein, 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.
-
Phototransformation of Amlodipine: Degradation Kinetics and Identification of Its Photoproducts
PublikacjaNowadays, monitoring focuses on the primary compounds and does not include degradation products formed during various biological and chemical processes. Transformation products may have the same effects to human health and the environment or sometimes they can be more toxic than the parent compound. Unfortunately, knowledge about the formation of degradation products is still limited, however, can be very important for the environmental...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn 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
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...
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe 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.
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
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.
-
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...
-
New potential functions for greedy independence and coloring
PublikacjaA 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
PublikacjaThe 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 partition dimension of trees
PublikacjaGiven 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 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 -
On the size of identifying codes in triangle-free graphs
PublikacjaIn 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...
-
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 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 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 note on total reinforcement in graphs
PublikacjaIn 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.
-
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.
-
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.
-
Infinite chromatic games
PublikacjaIn 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...
-
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...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe 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.