Filters
total: 475
filtered: 441
Search results for: hermite polynomials.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublicationIn 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...
-
The prns butterfly synthesis in the FPGA
Publicationw 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ść...
-
Tight bounds on global edge and complete alliances in trees
PublicationIn 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
PublicationA 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...
-
Numerical Test for Stability Evaluation of Discrete-Time Systems
PublicationIn this paper, a new numerical test for stability evaluation of discrete-time systems is presented. It is based on modern root-finding techniques at the complex plane employing the Delaunay triangulation and Cauchy's Argument Principle. The method evaluates if a system is stable and returns possible values and multiplicities of unstable zeros of the characteristic equation. For state-space discrete-time models, the developed test...
-
Analytical method of modelling the geometric system of communication route
PublicationThe 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....
-
Infinite chromatic games
PublicationIn 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...
-
β-cyclodextrin-containing polymer based on renewable cellulose resources for effective removal of ionic and non-ionic toxic organic pollutants from water
PublicationA novel, bio-derived cyclodextrin-based trifunctional adsorbent has been successfully synthesized for efficient, rapid and simultaneous removal of a broad-spectrum of toxic ionic (anionic and cationic dyes) and non-ionic organic pollutants from water. The composition, morphology and the presence of functional groups in the obtained sorption material were characterized by elemental analysis, XRD, SEM, and FTIR spectroscopy. The...
-
Dedicated scheduling of tasks to minimize mean flow time
PublicationThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
On thermal stability of topological qubit in Kitaev's 4D model
PublicationWe analyse stability of the four-dimensional Kitaev model-a candidate for scalable quantum memory - in finite temperature within the weak coupling Markovian limit. It is shown that, below a critical temperature, certain topological qubit observables X and Z possess relaxation times exponentially long in the size of the system. Their construction involves polynomial in system size algorithm which uses as an input the results of...
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublicationThe paper presents a method of processing measurement data due to remove slowly varying component of the trend occurring in the recorded waveforms. Comparison of computational complexity and trend removal efficiency between some commonly used methods is presented. The impact of these procedures on probability distribution and power spectral density is shown. Effectiveness and computational complexity of these methods depend essentially...
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Kinetics of Intermetallic Phase Precipitation in Manual Metal Arc Welded Duplex Stainless Steels
PublicationThe article presents the influence of heat treatment on the kinetics of transformations in lean duplex LDX2101 steel and a weld made of standard duplex 2209 material, which was welded by manual metal arc welding. Changes in the microstructure, hardness, and magnetic phase content were analyzed after heat treatment was conducted at a temperature of 800 °C for a period ranging from 15 to 1440 min. Light and scanning microscopy, Vickers...
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublicationWe 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...
-
Laser Dissimilar Welding of AISI 430F and AISI 304 Stainless Steels
PublicationA dissimilar autogenous laser welded joint of AISI 430F (X12CrMoS17) martensitic stainless steel and AISI 304 (X5CrNi18-10) austenitic stainless steel was manufactured. The welded joint was examined by non-destructive visual testing and destructive testing by macro- and microscopic examination and hardness measurements. With reference to the ISO 13919-1 standard the welded joint was characterized by C level, due to the gas pores...
-
Multilevel model order reduction with generalized compression of boundaries for 3-d FEM electromagnetic analysis
PublicationThis paper presents a multilevel Model Order Reduction technique for a 3-D electromagnetic Finite Element Method analysis. The reduction process is carried out in a hierarchical way and involves several steps which are repeated at each level. This approach brings about versatility and allows one to efficiently analyze complex electromagnetic structures. In the proposed multilevel reduction the entire computational domain is covered...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe 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.
-
Local basis function estimators for identification of nonstationary systems
PublicationThe problem of identification of a nonstationary stochastic system is considered and solved using local basis function approximation of system parameter trajectories. Unlike the classical basis function approach, which yields parameter estimates in the entire analysis interval, the proposed new identification procedure is operated in a sliding window mode and provides a sequence of point (rather than interval) estimates. It is...
-
Analysis of features of stainless steels in dissimilar welded joints in chloride inducted corrosion
PublicationStainless steels of femtic-austenitic microstructure that means the duplex Cr-Ni-Mo steels, in comparison with austenitic steel includes less expensive nickel and has much better mechanical properties with good formability and corrosion resistance, even in environments containing chloride ions. Similar share of high chromium ferrite and austenite, which is characterized by high ductility, determines that the duplex steels have...
-
Improvement of opipramol base solubility by complexation with β-cyclodextrin
PublicationOpipramol (OPI), a tricyclic antidepressant and anxiolytic compound, is administered orally in the form of a dihydrochloride. Salt form of the drug has a higher solubility in water and hence bioavailability and stability. A similar effect can be achieved by closing the hydrophobic part of the drug molecule in the cyclodextrin cavity. The paper presents opipramol inclusion complexes with beta-cyclodextrin (β-CD) in 1:1 molar ratio....
-
Cyclodextrin polymers as efficient adsorbents for removing toxic non-biodegradable pimavanserin from pharmaceutical wastewaters
PublicationPresence of even small amount of active pharmaceutical ingredients in the environment carries risks tohuman and animal health, presenting an important issue. The paper presents issues related to the newdrug - pimavanserin (PMV). Biological treatment efficiency of pimavanserin (PMV) was evaluated usinglab-scale Sequencing Batch Reactor (SBR). It has been shown to have a negative effect on aquatic or-ganisms by classifying it as...
-
Degradation kinetics and mechanism of pentoxifylline by ultraviolet activated peroxydisulfate
PublicationDegradation of pentoxifylline (PTX) by sodium peroxydisulfate (SPDS) assisted by UV irradiation has been investigated in deionized water. The treatment was more favorable over direct photolysis or peroxydisulfate oxidation alone. The effects of various parameters, including different dosage of oxidant agent, PTX concentration, initial solution pH levels, and the presence of inorganic ions like chloride, nitrate and carbonate have...
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublicationA 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...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe 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...
-
Shaping of the turnout diverging track with variable curvature sections
PublicationThe paper presents an analytical method of shaping the turnout diverging railroad track with variable curvature segments on its length, which in an evident way distinguished it from a typical solution, made up of a single circular arc with no transition curves. Two separate causes including a linear and a nonlinear curvature one in the form of a polynomial have been examined. The obtained solutions of the problem have a universal...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe 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...
-
Heavy Duty Vehicle Fuel Consumption Modelling Based on Exploitation Data by Using Artificial Neural Networks
PublicationOne of the ways to improve the fuel economy of heavy duty trucks is to operate the combustion engine in its most efficient operating points. To do that, a mathematical model of the engine is required, which shows the relations between engine speed, torque and fuel consumption in transient states. In this paper, easy accessible exploitation data collected via CAN bus of the heavy duty truck were used to obtain a model of a diesel...
-
Approximation of Covariance Function with Application to Stochastic Mechanics.
PublicationW pracy przedstawiono koncepcję rozwinięć kanonicznych dla funkcji losowych oraz możliwość ich zastosowania w stochastycznej mechanice gruntów. Rozpatrzono rozkład widmowy, rozwinięcia Karhunena-Loevego oraz rozwinięcia ortogonalne zmodyfikowanymi wielomianami Hermite'a. Przeprowadzono analizę błędów dla zagadnienia warstwy gruntu o losowych parametrach sprężystych, uzyskano analityczne rozwiązanie systemu stochastycznego.
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublicationThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublicationWe 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,...
-
Interval incidence graph coloring
PublicationIn 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...
-
Insight into (Electro)magnetic Interactions within Facet-Engineered BaFe12O19/TiO2 Magnetic Photocatalysts
PublicationA series of facet-engineered TiO2/BaFe12O19 composites were synthesized through hydrothermal growth of both phases and subsequent deposition of the different, faceted TiO2 nanoparticles onto BaFe12O19 microplates. The well-defined geometry of the composite and uniaxial magnetic anisotropy of the ferrite allowed alternate interfaces between both phases and fixed the orientation between the TiO2 crystal structure and the remanent...
-
Solving Boundary Value Problems for Second Order Singularly Perturbed Delay Differential Equations by ε-Approximate Fixed-Point Method
PublicationIn this paper, the boundary value problem for second order singularly perturbed delay differential equation is reduced to a fixed-point problem v = Av with a properly chosen (generally nonlinear) operator A. The unknown fixed-point v is approximated by cubic spline vh defined by its values vi = vh(ti) at grid points ti, i = 0, 1, ... ,N. The necessary for construction the cubic spline and missing the first derivatives at the boundary...
-
The point estimate method in a reticulated shell reliability analysis
PublicationThe objective of this paper is to present an application of the point estimate method (PEM) that can determine the probabilistic moments for engineering structures. The method is reasonably robust and adequately accurate for a wide range of practical problems. It is a special case of numerical quadrature based on orthogonal polynomials. The main advantage of this method is that, unlike FORM or SORM, it is not necessary to carry...
-
Dispersive Delay Structures With Asymmetric Arbitrary Group-Delay Response Using Coupled-Resonator Networks With Frequency-Variant Couplings
PublicationThis article reports the design of coupled-resonatorbased microwave dispersive delay structures (DDSs) with arbitrary asymmetric-type group delay response. The design process exploits a coupling matrix representation of the DDS circuit as a network of resonators with frequency-variant couplings (FVCs). The group delay response is shaped using complex transmission zeros (TZs) created by dispersive cross-couplings. We also present an...
-
Representation of magnetic hysteresis in single-phase transformer for circuit simulations
PublicationThe paper presents a mathematical model for the hysteresis phenomenon in a multi-winding single-phase core type transformer. In the circuit transformer model, it is assumed that there is a flux common Φ to all windings as nonlinear and hysteretic function of the total currents Θ (Ampere turns) of all windings. To simulate magnetic behaviour of the iron core the feedback scalar Preisach model of hysteresis is developed. The Preisach...
-
Global edge alliances in graphs
PublicationIn 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...
-
Shared processor scheduling
PublicationWe 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...
-
Detoxification of the tricyclic antidepressant opipramol and its analog – IS-noh by UGT enzymes before and after activation by phase I enzymes in rat liver microsomes
PublicationThe present studies were carried out to evaluate the simultaneous one-pot metabolism of opipramol (IS-opi) and analog (IS-noh) by phase I and phase II enzymes present in rat liver microsomes (RLM) as an alternative to separate testing with recombinant enzymes. This approach allows for more time-saving and cost-effective screening of the metabolism of newly discovered drugs. We also considered that the lack of results for phase...
-
Photoresponsive Amide-Based Derivatives of Azobenzene-4,4′-Dicarboxylic Acid—Experimental and Theoretical Studies
PublicationAzobenzene derivatives are one of the most important molecular switches for biological and material science applications. Although these systems represent a well-known group of compounds, there remains a need to identify the factors influencing their photochemical properties in order to design azobenzene-based technologies in a rational way. In this contribution, we describe the synthesis and characterization of two novel amides...
-
Modeling the effect of parasitic capacitances on the dead-time distortion in multilevel NPC inverters
PublicationA simple model is derived and verified for evaluating the effect of parasitic capacitances on the dead-time related voltage distortion in multilevel NPC voltage source inverters. The model permits well-defined and precise compensation of dead-time distortion, exhibiting meaningful improvement on compensation methods neglecting the effects of parasitic capacitances. A simple formula is given for evaluating the capacitances as serial/parallel...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe 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...
-
Analysis of dynamics of a map-based neuron model via Lorenz maps
PublicationModeling nerve cells can facilitate formulating hypotheses about their real behavior and improve understanding of their functioning. In this paper, we study a discrete neuron model introduced by Courbage et al. [Chaos 17, 043109 (2007)], where the originally piecewise linear function defining voltage dynamics is replaced by a cubic polynomial, with an additional parameter responsible for varying the slope. Showing that on a large...
-
Measurements of the optical and thermal properties of the 2D black phosphorus coating
PublicationBlack phosphorus is a 2D material, which properties are still being discovered. In this paper, the sensitivity to the temperature of a few-layer black phosphorus coating deposited, on the surface of a microsphere-based fiber-optic sensor, by a dip-coating method is presented. The coating was investigated after 2, 3, and 5 deposition cycles and during temperature growth from 50 °C to 300 °C in an interferometric setup. The intensity...
-
The influence of solution annealing temperature on the properties of Lean Duplex 2101 welded joints in tubes
PublicationThe article presents a technology of TIG longitudinal welding without filler material (142) of heat exchanger tubes made of Lean Duplex 2101. The results of studies on the effect of heat treatment (solution annealing) on tensile strength, plasticity, delta ferrite and the structure of smooth tubes are shown. It was found, that the change in solution annealing temperature across the tested range has an impact on mechanical properties...
-
Convergence to equilibrium under a random Hamiltonian
PublicationWe analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse of the arithmetic average of the Bohr frequencies. To compute the average over a random basis, we compute the inverse of a matrix of overlaps of operators which permute four systems. We first...
-
Routing decisions independent of queuing delays in broadband leo networks
PublicationThis paper presents an analysis of queuing and propagation delays of Inter-Satellite Links (ISLs) in broadband Low-Earth Orbit (LEO) satellite networks. It is shown that queuing delays are negligible in all reasonable working conditions of the broadband ISL network. This fact makes it possible to simplify the routing protocols in such networks and permits using already known multi-commodity flow solutions for routing. The performance...
-
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublicationIn 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...