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:...
-
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...
-
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.
-
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.
-
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...
-
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)....
-
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...
-
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....
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...