Filtry
wszystkich: 521
wybranych: 426
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: discrete%20element%20method
-
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.
-
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,...
-
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.
-
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 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.
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
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...
-
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...
-
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...
-
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....
-
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...
-
Comparison of noise reduction methods in radiometric correlation measurements of two-phase liquid-gas flows
PublikacjaTwo-phase liquid-gas flows occur frequently in the mining, energy, chemical, and petrochemical industries. One of non-contact methods used to analyse these flows is the gamma ray absorption method. However, the signals received from radiation detectors contain a significant stochastic noise, which makes them difficult to analyse. The article describes four methods of noise reduction in cross-correlation measurements of water-air...
-
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...
-
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 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 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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Badania deformacji w materiałach sypkich podczas dynamicznego przepływu w silosach
PublikacjaMonografia stanowi próbę połączenia analizy zagadnień powstawania zmian objętościowych oraz pomiaru zmian koncentracji materialu sypkiego podczas opróżniania silosu. W pracy przedstwiono wyniki pomiarów wykonanych z zastooswaneim metody Particle Image Velocimetry, Electrical Capacitance Toomography oraz promieniowania rentgenowskiego. Zamieszczono równeiz wyniki obliczeń wykoanaych z zastooswaniem metody DEM (Discrete Element...
-
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...
-
A New Expression for the 3-D Dyadic FDTD-Compatible Green's Function Based on Multidimensional Z-Transform
PublikacjaIn this letter, a new analytic expression for the time-domain discrete Green's function (DGF) is derived for the 3-D finite-difference time-domain (FDTD) grid. The derivation employs the multidimensional Z-transform and the impulse response of the discretized scalar wave equation (i.e., scalar DGF). The derived DGF expression involves elementary functions only and requires the implementation of a single function in the multiple-precision...
-
Performance of ASON/GMPLS architecture in condition of wavelength conversion and without wavelength conversion
PublikacjaThe paper regards the problem of ASON/GMPLS performance in condition of wavelength and without wavelength conversion. The authors present influence analysis in condition of wavelength and non-wavelength conversion on the ASON/GMPLS control plane performance represented by mean Connection Set-up Time E (CST) and request loss probabilities. The offered traffic to the transport layer and request intensity have been changed for evaluation...
-
Modeling emotions for affect-aware applications
PublikacjaThe chapter concerns emotional states representation and modeling for software systems, that deal with human affect. A review of emotion representation models is provided, including discrete, dimensional and componential models. The paper provides also analysis of emotion models used in diverse types of affect-aware applications: games, mood trackers or tutoring systems. The analysis is supported with two design cases. The study...
-
Numerical solution analysis of fractional point kinetics and heat exchange in nuclear reactor
PublikacjaThe paper presents the neutron point kinetics and heat exchange models for the nuclear reactor. The models consist of a nonlinear system of fractional ordinary differential and algebraic equations. Two numerical algorithms are used to solve them. The first algorithm is application of discrete Grünwald-Letnikov definition of the fractional derivative in the model. The second involves building an analog scheme in the FOMCON Toolbox...
-
СИЛОВОЙ ПРЕОБРАЗОВАТЕЛЬ С АКТИВНЫМ ПОДАВЛЕНИЕМ ВЫСШИХ ГАРМОНИК ДЛЯ СИСТЕМ ЭЛЕКТРОСНАБЖЕНИЯ ЛЕТАТЕЛЬНЫХ АППАРАТОВ (Power converter with active suppression of higher harmonics for aircraft power supply systems)
PublikacjaПредставлены два алгоритма активной фильтрации для силового преобразователя с активным подавлением высших гармоник. Первый алгоритм основан на дискретном преобразовании Фурье: посредством синтезированной системы управления инвертированные измеренные высшие гармоники напряжения поступают на вход инвертора. Второй метод управления основан на алгоритме с использованием принципов самообучения, что значительно снижает потребность в...
-
Numerical solution of fractional neutron point kinetics in nuclear reactor
PublikacjaThis paper presents results concerning solutions of the fractional neutron point kinetics model for a nuclear reactor. Proposed model consists of a bilinear system of fractional and ordinary differential equations. Three methods to solve the model are presented and compared. The first one entails application of discrete Grünwald-Letnikov definition of the fractional derivative in the model. Second involves building an analog scheme...
-
Dynamics of quantum entanglement
PublikacjaA model of discrete dynamics of entanglement of a bipartite quantum state is considered. It involves a global unitary dynamics of the system and periodic actions of local bistochastic or decaying channel. For initially pure states the decay of entanglement is accompanied by an increase of von Neumann entropy of the system. We observe and discuss revivals of entanglement due to unitary interaction of subsystems. For some mixed states...
-
Quantum superadditivity in linear optics networks: Sending bits via multiple-access Gaussian channels
PublikacjaSuperadditivity effects of communication capacities are known in the case of discrete variable quantum channels. We describe the continuous variable analog of one of these effects in the framework of Gaussian multiple access channels (MACs). Classically, superadditivity-type effects are strongly restricted: For example, adding resources to one sender is never advantageous to other senders in sending their respective information...