Search results for: hermite polynomials.
-
Equitable coloring of corona multiproducts of graphs
PublicationWe 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.
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn 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.
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublicationIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
Stratification of nano-pigments in anti-corrosive coatings by means of magnetic field
PublicationThe concept of self-stratification of coatings, although attractive, causes difficulties in its practical use, especially when pigments are added to the resins. An alternative way of obtaining a multilayer structure in a single step was presented. Using the inhomogeneous magnetic field and magnetically active components of the coating, the possibility of vertically graded differentiation of the one layer properties has been verified....
-
Protective and Suppressing Electromagnetic Interference Properties of Epoxy Coatings Containing Nano-Sized NiZn Ferrites
PublicationNano-crystalline ferrites with the chemical formula NixZn(1−x)Fe2O4, where x = 0, 0.2, 0.4, 0.6, 0.8, 1.0, were synthesized using a co-precipitation method. The obtained ferrites were investigated by X-ray diffraction (XRD). The corrosion inhibiting behavior of nano-sized ferrites was tested using carbon steel samples and 10% aqueous ferrite extracts. Results were compared with previous data obtained for micro-sized ceramic ferrites....
-
Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components
PublicationThe analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...
-
The XAS spectra of O-K edges, Fe-L edges in pristine, La-, and Nb-doped SFM in 3 states: as-prepared, reduced and reoxidized
Open Research DataThis dataset contains the normalized and exported to *.txt spectra for x-ray absorption spectroscopy. The samples analyzed were strontium ferrite molybdate based, doped with lanthanum and niobium. The powders were measured in as-prepared state (denoted in filename as AP), reduced (red) and reoxidized (reox). The filenames are written accordingly: Edge_(optional:...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationTwo 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...
-
The complexity of minimum-length path decompositions
PublicationWe 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...
-
Galerkin formulations of isogeometric shell analysis: Alleviating locking with Greville quadratures and higher-order elements
PublicationWe 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...
-
Results after grinding C45 steel
Open Research DataThe database contains results from nanoindenter, scanning microscope and also X-ray diffractometer. To determine the residual stresses and the size of the crystallites in the ferrite grains in the grinded surface layer, the Williamson Hall analysis of the X-ray diffraction patterns was performed. XRD diffraction patterns were also used to perform a...
-
A spline-based FE approach to modelling of high frequency dynamics of 1-D structures
PublicationIn this paper a computational methodology leading to the development of a new class of FEs, based on the application of continuous and smooth approximation polynomials, being splines, has been presented. Application of the splines as appropriately defined piecewise elemental shape functions led the authors to the formulation of a new approach for FEM, named as spFEM, where contrary to the well-known NURBS approach, the boundaries...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Residue-Pole Methods for Variability Analysis of S-parameters of Microwave Devices with 3D FEM and Mesh Deformation
PublicationThis 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...
-
Non-linear circuit model of a single doubly-fed induction machine formulated in natural axes for drive systems simulation purposes
PublicationMathematical modelling and a circuit model formulated in natural axes of a single doubly-fed induction machine, with the account of magnetic circuit nonlinearity are presented in the paper. Derivation of the model differential equations was based on Lagrange's energy method. State functions of magnetic elements in the model are non-linear and depend on all currents flowing in the machine windings and on the angle of rotor position....
-
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...
-
Technologie Rafineryjno-Petrochemiczne - projekt
e-Learning CoursesPROJEKT
-
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...
-
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ść...
-
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...
-
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...
-
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....
-
β-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.
-
The electrical conductivity of pristine, La-, and Nb-doped SFM measured in air and hydrogen atmospheres
Open Research DataThis dataset consists of an Excel sheet with the result of DC4W method of electrical measurements. The measurements were conducted on pristine strontium ferrite molubdate as well as ones doped with La and Nb. Additionally two samples co-doped with La and Ni/Co were analyzed. Pellets were prepared by high temperature sintering at 1400 deg. C, then cut...
-
The exemplary Kelvin probe microscopy studies of sensitized austenitic stainless steels
Open Research DataThe dataset summarizes the results of imaging the surface potential distribution using the Kelvin probe scanning technique. Due to the fact that the potential measured in this way is proportional to the electrochemical potential of metals or intermetallic phases, it is possible to assess the nobility differences of various alloy components. In the case...
-
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...
-
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...
-
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...
-
DLC coating in ring-on-ring sliding with water lubrication 10MPa/0.1m/s
Open Research DataWear 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
Open Research DataWear 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
Open Research DataWear 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
Open Research DataWear 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
Open Research DataWear 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
Open Research DataWear 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...
-
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...
-
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...
-
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....
-
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.
-
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...
-
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...