Search results for: POLYNOMIAL%20CHAOS
-
A cryptic ribosome binding site, false signals in reporter systems and avoidance of protein translation chaos
PublicationThe expression of reporter gene may be induced by activation of cryptic signalling sequences, as we found while constructing the mutS-lacZ fusion gene. We cloned the Escherichia coli lacZ gene encoding beta-galactosidase into a plasmid vector carrying the Thermus thermophilus mutS gene. The clones expected to produce beta-galactosidase as the C-terminal fusion were selected for the complementation of beta-galactosidase activity...
-
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...
-
Parameter values for topological chaos in the reduced Chialvo model
Open Research DataThe following dataset is connected with a map-based neuron model introduced by D. Chialvo (Chaos, Solitons & Fractals, 5 (3-4) 1995). The reduced version of this model is a one dimensional discrete system which describes the evolution of the membrane voltage when the value of the second variable, the recovery variable, is fixed. We have recently...
-
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...
-
Global sensitivity analysis of membrane model of abdominal wall with surgical mesh
PublicationThe paper addresses the issue of ventral hernia repair. Finite Element simulations can be helpful in the optimization of hernia parameters. A membrane abdominal wall model is proposed in two variants: a healthy one and including hernia defect repaired by implant. The models include many uncertainties, e.g. due to variability of abdominal wall, intraabdominal pressure value etc. Measuring mechanical properties with high accuracy...
-
A Review: Applications of the Spectral Finite Element Method
PublicationThe 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...
-
SENSITIVITY ANALYSIS IN THE REHABILITATION OF HISTORIC TIMBER STRUCTURES ON THE EXAMPLES OF GREEK CATHOLIC CHURCHES IN POLISH SUBCARPATHIA
PublicationThis work concerns structural and sensitivity analysis of carpentry joints used in historic wooden buildings in south-eastern Poland and western Ukraine. These are primarily sacred buildings and the types of joints characteristic for this region are saddle notch and dovetail joints. Thus, in the study the authors focus on these types of corner log joints. Numerical models of the joints are defined and finite element simulations...
-
Portico Farmhouses of the Vistula Delta: Architecture, Current State and Finite Element Modelling of Timber Roof Truss under Material and Cross-section Uncertainty
PublicationThe article focuses on the oldest surviving I-type portico houses located in the Vistula Delta, which were built in the 17th and 18th centuries. The study describes the houses’ origins, structure, details of roof structures and technical condition, and it also includes numerical modelling of a roof truss and its mechanical analysis. Numerical models of the roof trusses are defined and analysed by means of the finite element method....
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn 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
PublicationA 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...
-
On the derivatives $\partial^{2}P_{\nu}(z)/\partial\nu^{2}$ and $\partial Q_{\nu}(z)/\partial\nu$ of the Legendre functions with respect to their degrees
PublicationWe provide closed-form expressions for the degree-derivatives $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=n}$ and $[\partial Q_{\nu}(z)/\partial\nu]_{\nu=n}$, with $z\in\mathbb{C}$ and $n\in\mathbb{N}_{0}$, where $P_{\nu}(z)$ and $Q_{\nu}(z)$ are the Legendre functions of the first and the second kind, respectively. For $[\partial^{2}P_{\nu}(z)/\partial\nu^{2}]_{\nu=n}$, we find that % \begin{displaymath} \frac{\partial^{2}P_{\nu}(z)}{\partial\nu^{2}}\bigg|_{\nu=n} =-2P_{n}(z)\Li_{2}\frac{1-z}{2}+B_{n}(z)\ln\frac{z+1}{2}+C_{n}(z), \end{displaymath} % where...
-
Fully Adaptive Savitzky-Golay Type Smoothers
PublicationThe 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...
-
Modelling of Abdominal Wall Under Uncertainty of Material Properties
PublicationThe paper concerns abdominal wall modelling. The accurate prediction and simulation of abdominal wall mechanics are important in the context of optimization of ventral hernia repair. The shell Finite Element model is considered, as the one which can be used in patient-specific approach due to relatively easy geometry generation. However, there are uncertainties in this issue, e.g. related to mechanical properties since the properties...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe 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”,...
-
Galerkin formulations with Greville quadrature rules for isogeometric shell analysis: Higher order elements and locking
PublicationWe 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...
-
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS
Journals -
Linear impedance of 40Na2O-20CaO-40P2O5 glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 40Na2O-20CaO-40P2O5 glass was measured by impedance spectroscopy method.
-
Bounds on isolated scattering number
PublicationThe 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
PublicationThe 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
Publicationthe 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 with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn 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:...
-
Linear impedance of 25Na2O–20CaO–5P2O5–50SiO2 glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 25Na2O–20CaO–5P2O5–50SiO2 glass was measured by impedance spectroscopy method.
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe 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...
-
Multi-fidelity robust aerodynamic design optimization under mixed uncertainty
PublicationThe objective of this paper is to present a robust optimization algorithm for computationally efficient airfoil design under mixed (inherent and epistemic) uncertainty using a multi-fidelity approach. This algorithm exploits stochastic expansions derived from the Non-Intrusive Polynomial Chaos (NIPC) technique to create surrogate models utilized in the optimization process. A combined NIPC expansion approach is used, where both...
-
Aproksymacja przebiegu trasy kolejowej na przykładzie krzywoliniowego odcinka połączenia Somonino-Gdańsk Osowa
PublicationW 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...
-
Linear impedance of 2Si3N4–98(40Na2O-20CaO-40P2O5) glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 2Si3N4–98(40Na2O-20CaO-40P2O5) glass was measured by impedance spectroscopy method.
-
Linear impedance of 0.5Si3N4–99.5(40Na2O-20CaO-40P2O5) glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 0.5Si3N4–99.5(40Na2O-20CaO-40P2O5) glass was measured by impedance spectroscopy method.
-
Linear impedance of 1Si3N4–99(40Na2O-20CaO-40P2O5) glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 1Si3N4–99(40Na2O-20CaO-40P2O5) glass was measured by impedance spectroscopy method.
-
Linear impedance of 1SiO2–99(40Na2O-20CaO-40P2O5) glass measured with impedance spectroscopy method at low temperature region
Open Research DataThe linear electrical properties of 1SiO2–99(40Na2O-20CaO-40P2O5) glass was measured by impedance spectroscopy method.
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublicationWe 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.
-
Towards hand grip force assessment by using EMG estimators
PublicationThe 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
PublicationWe 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.
-
Barbara Wikieł dr
People -
Heavy duty vehicle fuel consumption modelling using artificial neural networks
PublicationIn 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,...
-
A Simplified Method of Trend Removal to Determine Noise Observed During a Supercapacitor’s Discharging
PublicationIn 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...
-
Historical carpentry corner log joints—Numerical analysis within stochastic framework
PublicationThe paper presents the results of numerical analysis performed on historical, traditional carpentry corner logjoints of two basic topologies: the short-corner dovetail connection and the saddle notch connection. These types of carpentry joints are commonly used in currently preserved objects of wooden architecture. All connections have been modelled in pinewood, which has been defined in the Finite Element software MSC.Marc/Mentat...
-
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.
-
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.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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ść...
-
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....
-
Rigorous numerics for critical orbits in the quadratic family
PublicationWe develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...
-
Combinatorial-topological framework for the analysis of global dynamics
Publication -
Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate-blood pressure coupling quantified by entropy-based indices
PublicationWe introduce an entropy-based classification method for pairs of sequences (ECPS) for quantifying mutual dependencies in heart rate and beat-to-beat blood pressure recordings. The purpose of the method is to build a classifier for data in which each item consists of two intertwined data series taken for each subject. The method is based on ordinal patterns and uses entropy-like indices. Machine learning is used to select a subset...
-
Computing algebraic transfer entropy and coupling directions via transcripts
PublicationMost random processes studied in nonlinear time series analysis take values on sets endowed with a group structure, e.g., the real and rational numbers, and the integers. This fact allows to associate with each pair of group elements a third element, called their transcript, which is defined as the product of the second element in the pair times the first one. The transfer entropy of two such processes is called algebraic transfer...