Filtry
wszystkich: 922
-
Katalog
Wyniki wyszukiwania dla: DISCRETE RADON TRANSFORM
-
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.
-
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 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...
-
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.
-
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.
-
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.
-
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 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 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...
-
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.
-
Equitable coloring of hypergraphs
PublikacjaA 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...
-
Weakly connected Roman domination in graphs
PublikacjaA 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...
-
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...
-
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 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...
-
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...
-
Analysis of the chemical composition of MnO-B2O3 glass
Dane BadawczeStructural and thermal properties of xMnO−(100−x)B2O3 (where x = 40, 50 and 60 mol%) glass samples have been investigated with the employment of various techniques. Fourier transform infrared spectroscopy results revealed the influence of MnO on glass matrix. Decrease of B–O bond-related band intensities has been observed. MnO addition was found to...
-
Myelodysplastic syndrome, NOS - Male, 65 - Tissue image [11290630017298681]
Dane BadawczeThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Myelodysplastic syndrome, NOS - Male, 65 - Tissue image [11290630017293141]
Dane BadawczeThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
A new open-source software developed for numerical simulations usingdiscrete modeling methods
PublikacjaThe purpose of this work is to present the development of an open-source software based on a discrete description of matter applied to study the behavior of geomaterials. This software uses Object Oriented Programming techniques, and its methodology design uses three different methods, which are the Discrete Element Method (DEM) [F. Donzé, S.A. Magnier, Formulation of a three-dimensional numerical model of brittle behavior, Geophys....
-
Comparative modeling of shear localization in granular bodies with FEM and DEM
PublikacjaThe 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...
-
Towards Contactless, Hand Gestures-Based Control of Devices
PublikacjaGesture-based intuitive interactions with electronic devices can be an important part of smart home systems. In this paper, we adapt the contactless linear gesture sensor for the navigation of smart lighting system. Set of handled gestures allow to propose two methods of active light source selection, continuous dimming, and turning on and off based on discrete gestures. The average gesture recognition accuracy was 97.58% in the...
-
Simulation model of IPMSM drive with rotor position estimator
PublikacjaThe paper presents a simulation model of electric drive consisting of: IPMSM motor, inverter and digital controller. The model was designed in Mathlab/Simulink. By modelling of the controller its discrete operation was taken into account in order to simulate precisely a specific sensorless control algorithm. A method for estimation of angular rotor position was proposed. Its mathematical algorithm was explained and errors were...
-
Curlicues generated by circle homeomorphisms
PublikacjaWe investigate the curves in the complex plane which are generated by sequences of real numbers being the lifts of the points on the orbit of an orientation preserving circle homeomorphism. Geometrical properties of these curves such as boundedness, superficiality, local discrete radius of curvature are linked with dynamical properties of the circle homeomorphism which generates them: rotation number and its continued fraction...
-
Comment on "Quantitative comparison of analysis methods for spectroscopic optical coherence tomography"
PublikacjaIn a recent paper by Bosschaart et al. [Biomed. Opt. Express 4, 2570 (2013)] various algorithms of time-frequency signal analysis have been tested for their performance in blood analysis with spectroscopic optical coherence tomography sOCT). The measurement of hemoglobin concentration and oxygen saturation based on blood absorption spectra have been considered. Short time Fourier transform (STFT) was found as the best method for...
-
Numerical modeling of the combustion in a lab-scale pulverized-coal fired combustion chamber
PublikacjaThis work presents results of numerical modeling of the combustion process inside a lab-scale drop-tube chamber, designed to investigate the slagging properties of the flue ashes, created through the solid fuel firing. Interaction between turbulence and chemistry is accounted by use of probability density function (PDF). FLUENT inputs for non-premixed combustion chemistry modeling are defined. A discrete second phase of the coal...
-
Numerical modeling of the combustion in a lab-scale pulverized-coal fired combustion chamber
PublikacjaThis work presents results of numerical modeling of the combustion process inside a lab-scale drop-tube chamber, designed to investigate the slagging properties of the flue ashes, created through the solid fuel firing. Interaction between turbulence and chemistry is accounted by use of probability density function (PDF). FLUENT inputs for non-premixed combustion chemistry modeling are defined. A discrete second phase of the coal...
-
Mode choice modelling for urban areas
PublikacjaThe article presents the question of mode choice modelling in a four-stage travel modelling process. The article indicates limitations of currently used simplified methods of mode choice modelling and presents the possibility of using a more detailed approach that accounts for additional, statistically significant factors with the use of advanced mathematical tools, discrete choice models. A need has also been identified to include...
-
Numerical Issues and Approximated Models for the Diagnosis of Transmission Pipelines
PublikacjaThe chapter concerns numerical issues encountered when the pipeline flow process is modeled as a discrete-time state-space model. In particular, issues related to computational complexity and computability are discussed, i.e., simulation feasibility which is connected to the notions of singularity and stability of the model. These properties are critical if a diagnostic system is based on a discrete mathematical model of the flow...
-
Międzynarodowa Szkoła Letnia na temat algorytmów
WydarzeniaKatedra Algorytmów i Modelowania Systemów WETI PG organizuje 4. edycję Międzynarodowej Szkoły Letniej na temat algorytmów dla problemów optymalizacji dyskretnej i głębokiego uczenia
-
Parameter and delay estimation of linear continuous-time systems
PublikacjaIn this paper the problem of on-line identification of non-stationary delay systems is considered. Dynamics of supervised industrial processes is described by ordinary differential equations. Discrete-time mechanization of their continuous-time representations is based on dedicated finite-horizon integrating filters. Least-squares and instrumental variable procedures implemented in recursive forms are applied for simultaneous identification...
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (ACM/IEEE/SCS Workshop on Parallel and Distributed Simulation)
Konferencje -
FFT spectrum based matching algorithm for activedynamic thermography
PublikacjaIn Active Dynamic thermography (ADT) sequences of consecutive temperature distributions are analyzed. In biomedical applications of ADT, the problems of a patient's movements in front of a thermal camera should be eliminated before data analysis. Complete mechanical stabilization of the patients is impossible due to natural voluntary and involuntary moves caused by pulse breathing, etc. This paper presents a simple and efficient...
-
A new approach to active noise and vibration control - [Part II: unknown frequency case]
PublikacjaThis paper presents a new approach to rejection of complex-valued sinusoidal disturbances acting at the output of a discrete-time stable linear plant with unknown and possibly timevarying dynamics. It is assumed that both the instantaneous frequency of the sinusoidal disturbance and its amplitude may be slowly varying with time and that the output signal is contaminated with wideband measurement noise. It is not assumed that a...
-
Influence analysis of selected parameters on the ASON/GMPLS control plane performance
PublikacjaThe paper regards the problem of ASON/GMPLS performance. The authors present influence analysis of selected parameters on the ASON/GMPLS control plane performance represented in mean Connection Set-up Time E(CST) and mean Connection Release Time E(CRT). The selected parameters are: offered traffic, request intensity and proportion of requests class. The influence analysis is performed with simulation method by using OMNeT++ discrete-event...
-
On–line Parameter and Delay Estimation of Continuous–Time Dynamic Systems
PublikacjaThe problem of on-line identification of non-stationary delay systems is considered. The dynamics of supervised industrial processes are usually modeled by ordinary differential equations. Discrete-time mechanizations of continuous-time process models are implemented with the use of dedicated finite-horizon integrating filters. Least-squares and instrumental variable procedures mechanized in recursive forms are applied for simultaneous...
-
Parameter and delay estimation of linear continuous-time systems
PublikacjaIn this paper the problem of on-line identification of non-stationary delay systems is considered. Dynamics of supervised industrial processes is usually described by ordinary differential equations. Discrete-time mechanization of their continuous-time representations is based on dedicated finite-horizon integrating filters. Least-squares and instrumental variable procedures implemented in recursive forms are applied for simultaneous...
-
Square root RC Nyquist filter of fractional delay
PublikacjaIn this paper we propose a discrete-time FIR (finite impulse response) filter which couples the role of square root Nyquist filter with fractional delay filter. This filter enables to substitute for a cascade of square root RC (SRRC) Nyquist filter and fractional delay filter in one device/algorithm. The aim is to compensate for transmission delay in communication system. Statistically defined performances, e.g. BER (bit error...
-
QoS Resource Reservation Mechanisms for Switched Optical Networks
PublikacjaThe paper regards the problem of resource reservation mechanisms for Quality of Service support in switched optical networks. The authors propose modifications and extensions for resources reservation strategy algorithms with resources pools, link capacity threshold and adaptive advance reservation approach. They examine proposed solutions in Automatically Switched Optical Network with Generalized Multi-Protocol Label Switching...
-
A novel method of local chirp-rate estimation of LFM chirp signals in the time-frequency domain
PublikacjaIn the paper, novel dynamic representations of a complex signal in the time-frequency domain are introduced. The proposed approach is based on using the gradient of the short-time Fourier transform complex phase. A channelized instantaneous complex frequency (CICF) and a complex local group delay (CLGD) are included in the presented signal representations. An application of the newly-introduced distributions is demonstrated by...
-
Research 1: Heterojunction of (P, S) co-doped g-C3N4 and 2D TiO2 for improved carbamazepine and acetaminophen photocatalytic degradation
Dane BadawczeThe first research article consisted on the synthesis of phosphorus and sulfur co-doped graphitic carbon nitride incorporated in 2D TiO2 structure for solar-driven degradation of emerging pollutants from the group of pharmaceuticals not susceptible to biodegradation. The hybrid photocatalysts with different loadings of (P, S)-doped g-C3N4 were characterized...
-
Structural and physico-mechanical properties of natural rubber/GTR composites devulcanized by microwaves: Influence of GTR source and irradiation time
PublikacjaGround tire rubber from car and truck was modified using microwave irradiation at variable time. The irradiated ground tire rubber was used as filler in composites based on natural rubber. The composites, with high content of ground tire rubber, were prepared using an internal batch mixer and subsequently cross-linked at 160℃. The influence of the ground tire rubber source (car/truck) and irradiation time on structure, physico-mechanical...
-
Evaluation of the fast impedance spectroscopy method in the laboratory measurement system
PublikacjaIn this paper the method for fast impedancespectroscopy of technical objects with very high impedance(|Zx| ≥ 1 GΩ) is evaluated by means of simulation and practicalexperiment. The method is based on excitation of an object, witha square pulse and measurements of voltage and currentresponses with DAQ card. The object impedance spectrum isobtained with use of continuous Fourier transform. Someimprovements of the method concerned...
-
Simple Fractal Calculus from Fractal Arithmetic
PublikacjaNon-Newtonian calculus that starts with elementary non-Diophantine arithmetic operations of a Burgin type is applicable to all fractals whose cardinality is continuum. The resulting definitions of derivatives and integrals are simpler from what one finds in the more traditional literature of the subject, and they often work in the cases where the standard methods fail. As an illustration, we perform a Fourier transform of a real-valued...
-
Electromagnetic Problems Requiring High-Precision Computations
PublikacjaAn overview of the applications of multiple-precision arithmetic in CEM was presented in this paper for the first time. Although double-precision floating-point arithmetic is sufficient for most scientific computations, there is an expanding body of electromagnetic problems requiring multiple-precision arithmetic. Software libraries facilitating these computations were described, and investigations requiring multiple-precision...
-
Asynchronous time difference of arrival (ATDOA) method
PublikacjaA new method for a location service in the asynchronous wireless sensor networks is outlined. This method, which is called asynchronous time difference of arrival (ATDOA), enables calculation of the position of a mobile node without knowledge of relative time differences (RTDs) between measuring sensors. The ATDOA method is based on the measurement of time difference of arrival between the node and the same sensor at the discrete...