Wyszukiwarka
Filtry
wszystkich: 159
Wyniki wyszukiwania dla: POLYNOMIAL TIME
-
TreeCmp: Comparison of Trees in Polynomial Time
PublikacjaMetryki filogenetyczne umożliwiają ocenę jakości wyników analizy filogenetycznej oraz wiarygodności algorytmów przeprowadzających taką analizę. Aplikacja TreeCmp oferuje efektywne, wielomianowe implementacje ośmiu takich metryk (dla drzew nieukorzenionych i zawierających korzeń) zdefiniowanych dla dowolnych filogenez (nie koniecznie binarnych). Program ten jako pierwszy umożliwia wyznaczanie nowych metryk, definiowanych w oparciu...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Equitable 4-coloring of cacti and edge-cacti in polynomial time
PublikacjaRozważono problem wyznaczania sprawiedliwej liczby chromatycznej kaktusów i drzew wielokątowych bez trójkątów i krawędzi wiszących. Podano wielomianowy algorytm wyznaczający pokolorowanie optymalne, oparty na paradygmacie programowania dynamicznego. Tym samym znaleziona została kolejna klasa grafów planarnych, dla której kolorowanie sprawiedliwe jawi się jako zagadnienie obliczeniowo łatwe.
-
Ship Evolutionary Trajectory Planning Method with Application of Polynomial Interpolation
PublikacjaPaper presents the application of evolutionary algorithms and polynomial interpolation in ship evolutionary trajectory planning method. Evolutionary algorithms allows to find a coIlision free trajectory in real time, while polynomial interpolation allows to model smooth trajectory which keeps continuity of velocity and acceleration values along path. Combination of this two methods allows to find trajectory, which under some assumptions,...
-
Experimental Comparison of Straight Lines and Polynomial Interpolation Modeling Methods in Ship Evolutionary Trajectory Planning Problem
PublikacjaPaper presents the application of evolutionary algorithms and polynomial interpolation in ship evolutionary trajectory planning method and its comparison to classic approach, where trajectory is modeled by straight lines. Evolutionary algorithms are group of methods that allows\ to find a collision free trajectory in real time, while polynomial interpolation allows to model smooth trajectory, which keeps continuity of velocity...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
Application of regularized Savitzky–Golay filters to identification of time-varying systems
PublikacjaSavitzky–Golay (SG) filtering is a classical signal smoothing technique based on the local least squares approximation of the analyzed signal by a linear combination of known functions of time (originally — powers of time, which corresponds to polynomial approximation). It is shown that the regularized version of the SG algorithm can be successfully applied to identification of time-varying finite impulse response (FIR) systems....
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Stability analysis of interconnected discrete-time fractional-order LTI state-space systems
PublikacjaIn this paper, a stability analysis of interconnected discrete-time fractional-order (FO) linear time-invariant (LTI) state-space systems is presented. A new system is formed by interconnecting given FO systems using cascade, feedback, parallel interconnections. The stability requirement for such a system is that all zeros of a non-polynomial characteristic equation must be within the unit circle on the complex z-plane. The obtained...
-
Fully Adaptive Savitzky-Golay Type Smoothers
PublikacjaThe problem of adaptive signal smoothing is consid-ered and solved using the weighted basis function approach. Inthe special case of polynomial basis and uniform weighting theproposed method reduces down to the celebrated Savitzky-Golaysmoother. Data adaptiveness is achieved via parallel estimation.It is shown that for the polynomial and harmonic bases andcosinusoidal weighting sequences, the competing signal estimatescan be computed...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Properties of the triset metric for phylogenetic trees
Publikacjathe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublikacjaThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
Shared multi-processor scheduling
PublikacjaWe study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
A Simplified Method of Trend Removal to Determine Noise Observed During a Supercapacitor’s Discharging
PublikacjaIn this paper, new method of trend removal is proposed. This is a simplified method based on Empirical Mode Decomposition (EMD). The method was applied for voltage time series observed during supercapacitor discharging process. It assured the determination of an additive noise component after subtracting the identified trend component. We analyzed voltage time series observed between the terminals of the supercapacitor when discharged...
-
Shared processor scheduling
PublikacjaWe study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublikacjaIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
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...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
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...
-
Aproksymacja przebiegu trasy kolejowej na przykładzie krzywoliniowego odcinka połączenia Somonino-Gdańsk Osowa
PublikacjaW artykule zaprezentowano wyniki wyznaczenia współrzędnych przebiegu trasy kolejowej metodami aproksymacji wielomianowej i interpolacji krzywą kubiczną w oparciu o pomiary czasu rzeczywistego GPS zrealizowane z wykorzystanie polskiej aktywnej sieci geodezyjnej ASG-EUPOS. Rozważania teoretyczne poparte zostały praktycznym przykładem aplikacyjnym opartym o zrealizowane pomiary inwentaryzacyjne zmodernizowanego odcinka toru kolejowego...
-
Restricted open shop scheduling
PublikacjaIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
DLC coating in ring-on-ring sliding with water lubrication 10MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 10MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: WATER. Tribometer: PT-3. Overall test time >15h. The test was augmented by vibration...
-
DLC coating in ring-on-ring sliding with saline solution (0.9% wt.) lubrication 20MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 20MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: SALINE SOLUTION (0.9% wt.). Tribometer: PT-3. Overall test time >15h. The test was augmented...
-
DLC coating in ring-on-ring sliding with saline solution (0.9% wt.) lubrication 10MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 10MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: SALINE SOLUTION (0.9% wt.). Tribometer: PT-3. Overall test time >15h. The test was augmented...
-
DLC coating in ring-on-ring sliding with water lubrication 20MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 20MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: WATER. Tribometer: PT-3. Overall test time >15h. The test was augmented by vibration...
-
DLC coating doped with W in ring-on-ring sliding with water lubrication 20MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of 1% W (tungsten) doped DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 20MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: WATER. Tribometer: PT-3. Overall test time >15h. The test was...
-
DLC coating doped with W in ring-on-ring sliding with water lubrication 10MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of 1% W (tungsten) doped DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 10MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: WATER. Tribometer: PT-3. Overall test time >15h. The test was...
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
DLC coating doped with W in ring-on-ring sliding with saline solution (0.9% wt.) lubrication 20MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of 1% W (tungsten) doped DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 20MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: SALINE SOLUTION (0.9% wt.). Tribometer: PT-3. Overall test time >15h....
-
DLC coating doped with W in ring-on-ring sliding with saline solution (0.9% wt.) lubrication 10MPa/0.1m/s
Dane BadawczeWear tests in sliding friction of 1% W (tungsten) doped DLC coating on 1.4021 (EN 10088-1) heat treated stainless steel. Ring - on - ring contact in unidirectional sliding, DLC-W over DLC-W. Mean contact stress: 10MPa. Sliding velocity: 0,1 m/s. Mean friction radius: 9.5mm. Lubricant: SALINE SOLUTION (0.9% wt.). Tribometer: PT-3. Overall test time >15h....
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Shared processor scheduling of multiprocessor jobs
PublikacjaWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
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...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
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...
-
Galerkin formulations of isogeometric shell analysis: Alleviating locking with Greville quadratures and higher-order elements
PublikacjaWe propose new quadrature schemes that asymptotically require only four in-plane points for Reissner–Mindlin shell elements and nine in-plane points for Kirchhoff–Love shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree p of the elements. The quadrature points are Greville abscissae associated with pth-order B-spline basis functions whose continuities depend on the specific...
-
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...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
Release Kinetics Studies of Early-Stage Volatile Secondary Oxidation Products of Rapeseed Oil Emitted during the Deep-Frying Process
PublikacjaThe research concerns the use of proton transfer reaction mass spectrometer to track real-time emissions of volatile secondary oxidation products released from rapeseed oil as a result of deep-frying of potato cubes. Therefore, it was possible to observe a sudden increase of volatile organic compound (VOC) emissions caused by immersion of the food, accompanied by a sudden release of steam from a potato cube and a decrease of the...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublikacjaIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Clearing directed subgraphs by mobile agents
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Distributed Evacuation in Graphs with Multiple Exits
PublikacjaWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Improved Empirical Coefficients for Estimating Water Vapor Weighted Mean Temperature over Europe for GNSS Applications
PublikacjaDevelopment of the so-called global navigation satellite system (GNSS) meteorology is based on the possibility of determining a precipitable water vapor (PWV) from a GNSS zenith wet delay (ZWD). Conversion of ZWD to the PWV requires application of water vapor weighted mean temperature (Tm) measurements, which can be done using a surface temperature (Ts) and its linear dependency to the Tm. In this study we analyzed up to 24 years...
-
Jeffreys heat conduction in coupled semispaces subjected to interfacial heating
PublikacjaA Jeffreys heat conduction problem for coupled semispaces subjected to the action of an interfacial heat source was defined. An analytical solution of the problem was derived for a polynomial specific power of the heat source using the Laplace transform approach. The asymptotic and parametric analysis was performed for different ratios of thermal conductivities , thermal diffusivities , thermal relaxation times and coefficients...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
A Review: Applications of the Spectral Finite Element Method
PublikacjaThe Spectral Finite Element Technique (SFEM) has Several Applications in the Sciences, Engineering, and Mathematics, which will be Covered in this Review Article. The Spectral Finite Element Method (SFEM) is a Variant of the Traditional Finite Element Method FEM that Makes use of Higher Order Basis Functions (FEM). One of the most Fundamental Numerical Techniques Employed in the Numerical Simulation is the SFEM, which Outperforms...
-
Harnessing digital technologies for poverty reduction. Evidence for low-income and lower-middle income countries
PublikacjaThis paper contributes to understanding the relationship between ICT deployment and poverty alleviation in developing countries. It assess the digital technologies contribution to poverty reduction, through different channels of impact, like education, labor market, income and ICTtrade related activities. Using the sample of 40 developing countries between 1990 and 2019, it relies on macro data extracted from the World Bank Development...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
A Novel Approach to Fully Nonlinear Mathematical Modeling of Tectonic Plates
PublikacjaThe motion of the Earth's layers due to internal pressures is simulated in this research with an efficient mathematical model. The Earth, which revolves around its axis of rotation and is under internal pressure, will change the shape and displacement of the internal layers and tectonic plates. Applied mathematical models are based on a new approach to shell theory involving both two and three-dimensional approaches. It is the...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Noise sources in Raman spectroscopy of biological objects
PublikacjaWe present an overview of noise sources deteriorating the quality of the recorded biological Raman spectra and the ability to determine the specimen composition. The acquired Raman spectra exhibit intense additive noise components or drifts because of low intensity of the scattered light. Therefore we have to apply expensive or bulky measurement setups to limit their inherent noise or to apply additional signal processing to reduce...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublikacjaStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Mechanical analysis of eccentric defected bilayer graphene sheets considering the van der Waals force
PublikacjaIn this article, we have tried to simulate nonlinear bending analysis of a double-layered graphene sheet which contains a geometrical imperfection based on an eccentric hole. The first-order shear deformation theory is considered to obtain the governing equations. Also, the nonlinear von Kármán strain field has been assumed in order to obtain large deformations. Whereas the double-layered graphene sheet has been considered, the...
-
Methods of trend removal in electrochemical noise data – overview
PublikacjaIn this paper we shall review popular methods of trend removal from electrochemical noise time records. The basic principles of operation of the six most popular methods are explained. The proposed methods are: high - pass filtering, Moving Average Removal, polynomial detrending, wavelet detrending, Empirical Mode Decomposition and Variational Mode Decomposition. Estimation of trend removal quality...
-
Simulation of the weight averaging of pulse frequency modulated sensor output signal
Dane BadawczeThe aim of the research is investigation of the efficiency of weight averaging of pulse frequency modulated signal. It was shown that from the point of view of the reduction of the sampling error the best are polynomial weighing functions, for which the maximum of this component error decreases proportionally to the appropriate power of the number of...
-
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
PublikacjaWe study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one...
-
Towards Changes of Macro-Economic Structures in Middle Eastern Countries. Empirical Evidence for 1970–2018
PublikacjaMiddle East countries share a wide bundle of specific structural economic features and one of the latest is a high dependency of these economies on fossil fuels, which is quantitatively demonstrated through the share of oil and gas revenues in total export, but also in gross domestic product composition. This high economic dependency on natural resources on one hand has recently generated a material wealth of Middle Eastern countries...
-
Efficient Surrogate Modeling and Design Optimization of Compact Integrated On-Chip Inductors Based on Multi-Fidelity EM Simulation Models
PublikacjaHigh-performance and small-size on-chip inductors play a critical role in contemporary radio-frequency integrated circuits. This work presents a reliable surrogate modeling technique combining low-fidelity EM simulation models, response surface approximations based on kriging interpolation, and space mapping technology. The reported method is useful for the development of broadband and highly accurate data-driven models of integrated...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Implementation of discrete convolution using polynomial residue representation
PublikacjaConvolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx...
-
Discrete convolution based on polynomial residue representation
PublikacjaThis paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS...
-
Testing Stability of Digital Filters Using Optimization Methods with Phase Analysis
PublikacjaIn this paper, novel methods for the evaluation of digital-filter stability are investigated. The methods are based on phase analysis of a complex function in the characteristic equation of a digital filter. It allows for evaluating stability when a characteristic equation is not based on a polynomial. The operation of these methods relies on sampling the unit circle on the complex plane and extracting the phase quadrant of a function...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Galerkin formulations with Greville quadrature rules for isogeometric shell analysis: Higher order elements and locking
PublikacjaWe propose new Greville quadrature schemes that asymptotically require only four in-plane points for Reissner-Mindlin (RM) shell elements and nine in-plane points for Kirchhoff-Love (KL) shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree of the elements. For polynomial degrees 5 and 6, the approach delivers high accuracy, low computational cost, and alleviates membrane and...
-
Polynomial description of dynamic impedance spectrogram—introduction to a new impedance analysis method
PublikacjaThis paper presents a polynomial description of spectrograms obtained using Dynamic Electrochemical Impedance Spectroscopy. A method to fit the polynomial degree correctly is discussed. A simple electrical system of a diode connected in parallel with a capacitor was used for testing. Dynamic impedance measurements during potentiodynamic polarization were conducted. This paper presents an alternative analysis method that allows...
-
Application of shifted Chebyshev polynomial-based Rayleigh–Ritz method and Navier’s technique for vibration analysis of a functionally graded porous beam embedded in Kerr foundation
PublikacjaPresent study is dealt with the applicability of shifted Chebyshev polynomial based Rayleigh-Ritz method and Navier’s technique on free vibration of Functionally Graded (FG) beam with uniformly distributed porosity along the thickness of the beam. The material properties such as Young’s modulus, mass density, and Poisson’s ratio are also considered to vary along the thickness of the FG beam as per the power-law exponent model....
-
Polynomial triset metric for unrooted phylogenetic trees
Publikacjathe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
Rapid Multi-band Patch Antenna Yield Estimation Using Polynomial Chaos-Kriging
PublikacjaYield estimation of antenna systems is important to check their robustness with respect to the uncertain sources. Since the Monte Carlo sampling-based real physics simulation model evaluations are computationally intensive, this work proposes the polynomial chaos-Kriging (PC-Kriging) metamodeling technique for fast yield estimation. PC-Kriging integrates the polynomial chaos expansion (PCE) as the trend function of Kriging metamodel...
-
Towards hand grip force assessment by using EMG estimators
PublikacjaThe purpose of this study was to propose a method to assess individual regression (calibration) curves to establish a relationship between an isometric grip force and surface electromyography (EMG) estimator. In this study 18 healthy volunteers (12 male (23.0 ± 2.0 years) and 6 female (23.2 ± 0.7 years)) had been examined. Ten EMG estimators (mean absolute value, root mean square, entropy, energy, turns per second, mean of zero...
-
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.
-
Heavy duty vehicle fuel consumption modelling using artificial neural networks
PublikacjaIn this paper an artificial neural network (ANN) approach to modelling fuel consumption of heavy duty vehicles is presented. The proposed method uses easy accessible data collected via CAN bus of the truck. As a benchmark a conventional method, which is based on polynomial regression model, is used. The fuel consumption is measured in two different tests, performed by using a unique test bench to apply the load to the engine. Firstly,...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Residue-Pole Methods for Variability Analysis of S-parameters of Microwave Devices with 3D FEM and Mesh Deformation
PublikacjaThis paper presents a new approach for variability analysis of microwave devices with a high dimension of uncertain parameters. The proposed technique is based on modeling an approximation of system by its poles and residues using several modeling methods, including ordinary kriging, Adaptive Polynomial Chaos (APCE), and Support Vector Machine Regression (SVM). The computational cost is compared with the traditional Monte-Carlo...
-
The prns butterfly synthesis in the FPGA
Publikacjaw pracy przedstawiono sprzętową implementację elementarnych obliczeń, określanych jako obliczenia motylkowe, dla splotu realizowanego z użyciem wielomianowego systemu resztowego(ang. polynomial residue number system - prns). obliczenia są wykonywane z zastosowaniem reprezentacji systemu diminished-1. opisano syntezę układu realizującego obliczenie motylkowe w środowisku xilinx w układzie virtex 4. podano również wymaganą ilość...
-
Analytical method of modelling the geometric system of communication route
PublikacjaThe paper presents a new analytical approach to modelling the curvature of a communication route by making use of differential equations. The method makes it possible to identify both linear and nonlinear curvature. It enables us to join curves of the same or opposite signs of curvature. Solutions of problems for linear change of curvature and selected variants of nonlinear curvature in polynomial and trigonometric form were analyzed....