On Uniqueness of Conjugacy of Continuous and Piecewise Monotone Functions
Directory of Open Access Journals (Sweden)
Ciepliński Krzysztof
2009-01-01
Full Text Available We investigate the existence and uniqueness of solutions of the functional equation , , where are closed intervals, and , are some continuous piecewise monotone functions. A fixed point principle plays a crucial role in the proof of our main result.
On Uniqueness of Conjugacy of Continuous and Piecewise Monotone Functions
Directory of Open Access Journals (Sweden)
Krzysztof Ciepliński
2009-01-01
Full Text Available We investigate the existence and uniqueness of solutions φ:I→J of the functional equation φ(f(x=F(φ(x, x∈I, where I,J are closed intervals, and f:I→I, F:J→J are some continuous piecewise monotone functions. A fixed point principle plays a crucial role in the proof of our main result.
Convergence of the natural approximations of piecewise monotone interval maps.
Haydn, Nicolai
2004-06-01
We consider piecewise monotone interval mappings which are topologically mixing and satisfy the Markov property. It has previously been shown that the invariant densities of the natural approximations converge exponentially fast in uniform pointwise topology to the invariant density of the given map provided its derivative is piecewise Lipshitz continuous. We provide an example of a map which is Lipshitz continuous and for which the densities converge in the bounded variation norm at a logarithmic rate. This shows that in general one cannot expect exponential convergence in the bounded variation norm. Here we prove that if the derivative of the interval map is Holder continuous and its variation is well approximable (gamma-uniform variation for gamma>0), then the densities converge exponentially fast in the norm.
Contribution to the ergodic theory of piecewise monotone continuous maps
Faller, Bastien
2008-01-01
This thesis is devoted to the ergodic theory of the piecewise monotone continuous maps of the interval. The coding is a classical approach for these maps. Thanks to the coding, we get a symbolic dynamical system which is almost isomorphic to the initial dynamical system. The principle of the coding is very similar to the one of expansion of real numbers. We first define the coding in a perspective similar to the one of the expansions of real numbers; this perspective was already adopted by Ré...
Dynamical zeta functions for piecewise monotone maps of the interval
Ruelle, David
2004-01-01
Consider a space M, a map f:M\\to M, and a function g:M \\to {\\mathbb C}. The formal power series \\zeta (z) = \\exp \\sum ^\\infty _{m=1} \\frac {z^m}{m} \\sum _{x \\in \\mathrm {Fix}\\,f^m} \\prod ^{m-1}_{k=0} g (f^kx) yields an example of a dynamical zeta function. Such functions have unexpected analytic properties and interesting relations to the theory of dynamical systems, statistical mechanics, and the spectral theory of certain operators (transfer operators). The first part of this monograph presents a general introduction to this subject. The second part is a detailed study of the zeta functions associated with piecewise monotone maps of the interval [0,1]. In particular, Ruelle gives a proof of a generalized form of the Baladi-Keller theorem relating the poles of \\zeta (z) and the eigenvalues of the transfer operator. He also proves a theorem expressing the largest eigenvalue of the transfer operator in terms of the ergodic properties of (M,f,g).
On the Kamke-Muller conditions, monotonicity and continuity for bi-modal piecewise-smooth systems
O'Donoghue, Yoann; Mason, Oliver; Middleton, Rick
2012-01-01
We show that the Kamke-Muller conditions for bimodal piecewise-smooth systems are equivalent to simple conditions on the vector elds dening the system. As a consequence, we show that for a specic class of such systems, monotonicity is equivalent to continuity. Furthermore, we apply our results to derive a stability condition for piecewise positive linear systems.
Caneco, Acilina; Rocha, Jose; Gracio, Clara
2009-01-01
In this paper is presented a relationship between the synchronization and the topological entropy. We obtain the values for the coupling parameter, in terms of the topological entropy, to achieve synchronization of two unidirectional and bidirectional coupled piecewise linear maps. In addition, we prove a result that relates the synchronizability of two m-modal maps with the synchronizability of two conjugated piecewise linear maps. An application to the unidirectional and bidirectional coupl...
Shape preserving rational bi-cubic function
Directory of Open Access Journals (Sweden)
Malik Zawwar Hussain
2012-11-01
Full Text Available The study is dedicated to the development of shape preserving interpolation scheme for monotone and convex data. A rational bi-cubic function with parameters is used for interpolation. To preserve the shape of monotone and convex data, the simple data dependent constraints are developed on these parameters in each rectangular patch. The developed scheme of this paper is confined, cheap to run and produce smooth surfaces.
Nie, Xiaobing; Zheng, Wei Xing
2015-05-01
This paper is concerned with the problem of coexistence and dynamical behaviors of multiple equilibrium points for neural networks with discontinuous non-monotonic piecewise linear activation functions and time-varying delays. The fixed point theorem and other analytical tools are used to develop certain sufficient conditions that ensure that the n-dimensional discontinuous neural networks with time-varying delays can have at least 5(n) equilibrium points, 3(n) of which are locally stable and the others are unstable. The importance of the derived results is that it reveals that the discontinuous neural networks can have greater storage capacity than the continuous ones. Moreover, different from the existing results on multistability of neural networks with discontinuous activation functions, the 3(n) locally stable equilibrium points obtained in this paper are located in not only saturated regions, but also unsaturated regions, due to the non-monotonic structure of discontinuous activation functions. A numerical simulation study is conducted to illustrate and support the derived theoretical results.
Nie, Xiaobing; Zheng, Wei Xing; Cao, Jinde
2015-11-01
The problem of coexistence and dynamical behaviors of multiple equilibrium points is addressed for a class of memristive Cohen-Grossberg neural networks with non-monotonic piecewise linear activation functions and time-varying delays. By virtue of the fixed point theorem, nonsmooth analysis theory and other analytical tools, some sufficient conditions are established to guarantee that such n-dimensional memristive Cohen-Grossberg neural networks can have 5(n) equilibrium points, among which 3(n) equilibrium points are locally exponentially stable. It is shown that greater storage capacity can be achieved by neural networks with the non-monotonic activation functions introduced herein than the ones with Mexican-hat-type activation function. In addition, unlike most existing multistability results of neural networks with monotonic activation functions, those obtained 3(n) locally stable equilibrium points are located both in saturated regions and unsaturated regions. The theoretical findings are verified by an illustrative example with computer simulations.
Monotone data visualization using rational trigonometric spline interpolation.
Ibraheem, Farheen; Hussain, Maria; Hussain, Malik Zawwar
2014-01-01
Rational cubic and bicubic trigonometric schemes are developed to conserve monotonicity of curve and surface data, respectively. The rational cubic function has four parameters in each subinterval, while the rational bicubic partially blended function has eight parameters in each rectangular patch. The monotonicity of curve and surface data is retained by developing constraints on some of these parameters in description of rational cubic and bicubic trigonometric functions. The remaining parameters are kept free to modify the shape of curve and surface if required. The developed algorithm is verified mathematically and demonstrated graphically.
Monotone Data Visualization Using Rational Trigonometric Spline Interpolation
Directory of Open Access Journals (Sweden)
Farheen Ibraheem
2014-01-01
Full Text Available Rational cubic and bicubic trigonometric schemes are developed to conserve monotonicity of curve and surface data, respectively. The rational cubic function has four parameters in each subinterval, while the rational bicubic partially blended function has eight parameters in each rectangular patch. The monotonicity of curve and surface data is retained by developing constraints on some of these parameters in description of rational cubic and bicubic trigonometric functions. The remaining parameters are kept free to modify the shape of curve and surface if required. The developed algorithm is verified mathematically and demonstrated graphically.
Positivity Preserving Interpolation Using Rational Bicubic Spline
Directory of Open Access Journals (Sweden)
Samsul Ariffin Abdul Karim
2015-01-01
Full Text Available This paper discusses the positivity preserving interpolation for positive surfaces data by extending the C1 rational cubic spline interpolant of Karim and Kong to the bivariate cases. The partially blended rational bicubic spline has 12 parameters in the descriptions where 8 of them are free parameters. The sufficient conditions for the positivity are derived on every four boundary curves network on the rectangular patch. Numerical comparison with existing schemes also has been done in detail. Based on Root Mean Square Error (RMSE, our partially blended rational bicubic spline is on a par with the established methods.
Positivity and Monotonicity Preserving Biquartic Rational Interpolation Spline Surface
Directory of Open Access Journals (Sweden)
Xinru Liu
2014-01-01
Full Text Available A biquartic rational interpolation spline surface over rectangular domain is constructed in this paper, which includes the classical bicubic Coons surface as a special case. Sufficient conditions for generating shape preserving interpolation splines for positive or monotonic surface data are deduced. The given numeric experiments show our method can deal with surface construction from positive or monotonic data effectively.
Combinatorics of bicubic maps with hard particles
Bouttier, J.; Di Francesco, P.; Guitter, E.
2005-05-01
We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by the use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class of 'admissible' trees with possibly doubly occupied edges and summing them with appropriate signed weights. The proof relies on an extension of the cutting procedure allowing for the presence on the maps of special non-sectile edges. The admissible trees are characterized by simple local rules, allowing eventually for an exact enumeration of planar bicubic maps with hard particles. We also discuss generalizations for maps with particles subject to more general exclusion rules and show how to re-derive the enumeration of quartic maps with Ising spins in the present framework of admissible trees. We finally comment on a possible interpretation in terms of branching processes.
The Order of Monotone Piecewise Cubic Interpolation.
1981-08-02
diedi+1) onto the boundary of 1,; Figure 2-4: Step 3 of the Two-Sweep Algoritm . -7- Forward Sweep. On the Backward Sweep, only the first component...short-coming of the Two-Sweep Algoritm is that it may move a point (di 1 ) much farther than necessary when projecting it into i. This problem is
Steganography Based on Integer Wavelet Transform and Bicubic Interpolation
Directory of Open Access Journals (Sweden)
N. Ajeeshvali
2012-11-01
Full Text Available Steganography is the art and science of hiding information in unremarkable cover media so as not to observe any suspicion. It is an application under information security field, being classified under information security, Steganography will be characterized by having set of measures that rely on strengths and counter attacks that are caused by weaknesses and vulnerabilities. The aim of this paper is to propose a modified high capacity image steganography technique that depends on integer wavelet transform with acceptable levels of imperceptibility and distortion in the cover image as a medium file and high levels of security. Bicubic interpolation causes overshoot, which increases acutance (apparent sharpness. The Bicubic algorithm is frequently used for scaling images and video for display. The algorithm preserves fine details of the image better than the common bilinear algorithm.
Project management under uncertainty beyond beta: The generalized bicubic distribution
Directory of Open Access Journals (Sweden)
José García Pérez
2016-01-01
Full Text Available The beta distribution has traditionally been employed in the PERT methodology and generally used for modeling bounded continuous random variables based on expert’s judgment. The impossibility of estimating four parameters from the three values provided by the expert when the beta distribution is assumed to be the underlying distribution has been widely debated. This paper presents the generalized bicubic distribution as a good alternative to the beta distribution since, when the variance depends on the mode, the generalized bicubic distribution approximates the kurtosis of the Gaussian distribution better than the beta distribution. In addition, this distribution presents good properties in the PERT methodology in relation to moderation and conservatism criteria. Two empirical applications are presented to demonstrate the adequateness of this new distribution.
Institute of Scientific and Technical Information of China (English)
WANG Renhong; ZHU Chungang
2004-01-01
The piecewise algebraic variety is a generalization of the classical algebraic variety. This paper discusses some properties of piecewise algebraic varieties and their coordinate rings based on the knowledge of algebraic geometry.
Theoretical Particle Limiting Velocity From The Bicubic Equation: Neutrino Example
Soln, Josip
2014-01-01
There has been a lot of interest in measuring the velocities of massive elementary particles, particularly the neutrinos. Some neutrino experi- ments at first observed superluminal neutrinos, thus violating the velocity of light c as a limiting velocity. But, after eliminating some mistakes, such as, for the OPERA experiments plugging the cable correctly and calibrat- ing the clock correctly, the measured neutrino velocity complied with c. Pursuing the theoretical side of particle limiting velocities, here directly from the special relativistic kinematics, in which all physical quantities are in the overall mathematical consistency with each other, one treats formally the velocity of light c as yet to be deduced particle limiting ve- locity, and derives the bicubic equation for the particle limiting velocity in the arbitrary reference frame.
MONOTONIZATION IN GLOBAL OPTIMIZATION
Institute of Scientific and Technical Information of China (English)
WU ZHIYOU; BAI FUSHENG; ZHANG LIANSHENG
2005-01-01
A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existingconvexification and concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.
REAL PIECEWISE ALGEBRAIC VARIETY
Institute of Scientific and Technical Information of China (English)
Ren-hong Wang; Yi-sheng Lai
2003-01-01
We give definitions of real piecewise algebraic variety and its dimension. By using the techniques of real radical ideal, P-radical ideal, affine Hilbert polynomial, Bernstein-net form of polynomials on simplex, and decomposition of semi-algebraic set, etc., we deal with the dimension of the real piecewise algebraic variety and real Nullstellensatz in Cμ spline ring.
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
It is a small step toward the Koszul-type algebras. The piecewise-Koszul algebras are,in general, a new class of quadratic algebras but not the classical Koszul ones, simultaneously they agree with both the classical Koszul and higher Koszul algebras in special cases. We give a criteria theorem for a graded algebra A to be piecewise-Koszul in terms of its Yoneda-Ext algebra E(A), and show an A∞-structure on E(A). Relations between Koszul algebras and piecewise-Koszul algebras are discussed. In particular, our results are related to the third question of Green-Marcos.
Monotone Boolean approximation
Energy Technology Data Exchange (ETDEWEB)
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
Energy Technology Data Exchange (ETDEWEB)
Korshunov, A D [S.L. Sobolev Institute for Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk (Russian Federation)
2003-10-31
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years.
Toda Equations and Piecewise Polynomiality for Mixed Double Hurwitz Numbers
Goulden, I. P.; Guay-Paquet, Mathieu; Novak, Jonathan
2016-04-01
This article introduces mixed double Hurwitz numbers, which interpolate combinatorially between the classical double Hurwitz numbers studied by Okounkov and the monotone double Hurwitz numbers introduced recently by Goulden, Guay-Paquet and Novak. Generalizing a result of Okounkov, we prove that a certain generating series for the mixed double Hurwitz numbers solves the 2-Toda hierarchy of partial differential equations. We also prove that the mixed double Hurwitz numbers are piecewise polynomial, thereby generalizing a result of Goulden, Jackson and Vakil.
Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions
Directory of Open Access Journals (Sweden)
Tahira Sumbal Shaikh
2012-01-01
Full Text Available This paper is concerned with the problem of positive and convex data visualization in the form of positive and convex surfaces. A rational bi-cubic partially blended function with eight free parameters in its description is introduced and applied to visualize the shape of positive data and convex data. The developed schemes in this paper have unique representations. Visual models of surfaces attain smoothness.
Piecewise flat gravitational waves
Energy Technology Data Exchange (ETDEWEB)
Van de Meent, Maarten, E-mail: M.vandeMeent@uu.nl [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, PO Box 80.195, 3508 TD Utrecht (Netherlands)
2011-04-07
We examine the continuum limit of the piecewise flat locally finite gravity model introduced by 't Hooft. In the linear weak field limit, we find the energy-momentum tensor and metric perturbation of an arbitrary configuration of defects. The energy-momentum turns out to be restricted to satisfy certain conditions. The metric perturbation is mostly fixed by the energy-momentum except for its lightlike modes which reproduce linear gravitational waves, despite no such waves being present at the microscopic level.
Van der Veken, Frederik F
2014-01-01
Wilson lines, being comparators that render non-local operator products gauge invariant, are extensively used in QCD calculations, especially in small-$x$ calculations, calculations concerning validation of factorisation schemes and in calculations for constructing or modelling parton density functions. We develop an algorithm to express piecewise path ordered exponentials as path ordered integrals over the separate segments, and apply it on linear segments, reducing the number of diagrams needed to be calculated. We show how different linear path topologies can be related using their colour structure. This framework allows one to easily switch results between different Wilson line structures, which is especially useful when testing different structures against each other, e.g. when checking universality properties of non-perturbative objects.
Introduction to Piecewise Differentiable Equations
Scholtes, Stefan
2012-01-01
This brief provides an elementary introduction to the theory of piecewise differentiable functions with an emphasis on differentiable equations. In the first chapter, two sample problems are used to motivate the study of this theory. The presentation is then developed using two basic tools for the analysis of piecewise differentiable functions: the Bouligand derivative as the non smooth analogue of the classical derivative concept and the theory of piecewise affine functions as the combinatorial tool for the study of this approximation function. In the end, the results are combined to develop
Grammatical Complexity of One—Dimensional Maps with Mutiple Monotone Intervals
Institute of Scientific and Technical Information of China (English)
YiWANG
1999-01-01
The piecewise monotonic maps on an interval are studied with the tools from the theory of formal language, A necessary and sufficient condition for the languages being regular is obtained.A result about the relation between languages and maps is proved for the continuous case.
Guionnet, A
2012-01-01
By solving a free analog of the Monge-Amp\\`ere equation, we prove a non-commutative analog of Brenier's monotone transport theorem: if an $n$-tuple of self-adjoint non-commutative random variables $Z_{1},...,Z_{n}$ satisfies a regularity condition (its conjugate variables $\\xi_{1},...,\\xi_{n}$ should be analytic in $Z_{1},...,Z_{n}$ and $\\xi_{j}$ should be close to $Z_{j}$ in a certain analytic norm), then there exist invertible non-commutative functions $F_{j}$ of an $n$-tuple of semicircular variables $S_{1},...,S_{n}$, so that $Z_{j}=F_{j}(S_{1},...,S_{n})$. Moreover, $F_{j}$ can be chosen to be monotone, in the sense that $F_{j}=\\mathscr{D}_{j}g$ and $g$ is a non-commutative function with a positive definite Hessian. In particular, we can deduce that $C^{*}(Z_{1},...,Z_{n})\\cong C^{*}(S_{1},...,S_{n})$ and $W^{*}(Z_{1},...,Z_{n})\\cong L(\\mathbb{F}(n))$. Thus our condition is a useful way to recognize when an $n$-tuple of operators generate a free group factor. We obtain as a consequence that the q-deforme...
Quantized, piecewise linear filter network
DEFF Research Database (Denmark)
Sørensen, John Aasted
1993-01-01
A quantization based piecewise linear filter network is defined. A method for the training of this network based on local approximation in the input space is devised. The training is carried out by repeatedly alternating between vector quantization of the training set into quantization classes an...
The Bezout Number of Piecewise Algebraic Curves
Institute of Scientific and Technical Information of China (English)
Dian Xuan GONG; Ren Hong WANG
2012-01-01
Based on the discussion of the number of roots of univariate spline and the common zero points of two piecewise algebraic curves,a lower upbound of Bezout number of two piecewise algebraic curves on any given non-obtuse-angled triangulation is found.Bezout number of two piecewise algebraic curves on two different partitions is also discussed in this paper.
Notes on Piecewise-Koszul Algebras
Institute of Scientific and Technical Information of China (English)
Jia Feng L(U); Xiao Lan YU
2011-01-01
The relationships between piecewise-Koszul algebras and other "Koszul-type" algebras are discussed.. The Yoneda-Ext algebra and the dual algebra of a piecewise-Koszul algebra are studied, and a sufficient condition for the dual algebra A to be piecewise-Koszul is given. Finally, by studying the trivial extension algebras of the path algebras of Dynkin quivers in bipartite orientation, we give explicit constructions for piecewise-Koszul algebras with arbitrary "period" and piecewise-Koszul algebras with arbitrary "jump-degree".
Large Scale Isosurface Bicubic Subdivision-Surface Wavelets for Representation and Visualization
Energy Technology Data Exchange (ETDEWEB)
Bertram, M.; Duchaineau, M.A.; Hamann, B.; Joy, K.I.
2000-01-05
We introduce a new subdivision-surface wavelet transform for arbitrary two-manifolds with boundary that is the first to use simple lifting-style filtering operations with bicubic precision. We also describe a conversion process for re-mapping large-scale isosurfaces to have subdivision connectivity and fair parameterizations so that the new wavelet transform can be used for compression and visualization. The main idea enabling our wavelet transform is the circular symmetrization of the filters in irregular neighborhoods, which replaces the traditional separation of filters into two 1-D passes. Our wavelet transform uses polygonal base meshes to represent surface topology, from which a Catmull-Clark-style subdivision hierarchy is generated. The details between these levels of resolution are quickly computed and compactly stored as wavelet coefficients. The isosurface conversion process begins with a contour triangulation computed using conventional techniques, which we subsequently simplify with a variant edge-collapse procedure, followed by an edge-removal process. This provides a coarse initial base mesh, which is subsequently refined, relaxed and attracted in phases to converge to the contour. The conversion is designed to produce smooth, untangled and minimally-skewed parameterizations, which improves the subsequent compression after applying the transform. We have demonstrated our conversion and transform for an isosurface obtained from a high-resolution turbulent-mixing hydrodynamics simulation, showing the potential for compression and level-of-detail visualization.
Stable piecewise polynomial vector fields
Directory of Open Access Journals (Sweden)
Claudio Pessoa
2012-09-01
Full Text Available Let $N={y>0}$ and $S={y<0}$ be the semi-planes of $mathbb{R}^2$ having as common boundary the line $D={y=0}$. Let $X$ and $Y$ be polynomial vector fields defined in $N$ and $S$, respectively, leading to a discontinuous piecewise polynomial vector field $Z=(X,Y$. This work pursues the stability and the transition analysis of solutions of $Z$ between $N$ and $S$, started by Filippov (1988 and Kozlova (1984 and reformulated by Sotomayor-Teixeira (1995 in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields $Z_{epsilon}$, defined by averaging $X$ and $Y$. This family approaches $Z$ when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002 providing conditions on $(X,Y$ for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on $mathbb{R}^2$. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.
Piecewise-adaptive decomposition methods
Energy Technology Data Exchange (ETDEWEB)
Ramos, J.I. [Room I-320-D, E.T.S. Ingenieros Industriales, Universidad de Malaga, Plaza El Ejido, s/n, 29013 Malaga (Spain)], E-mail: jirs@lcc.uma.es
2009-05-30
Piecewise-adaptive decomposition methods are developed for the solution of nonlinear ordinary differential equations. These methods are based on some theorems that show that Adomian's decomposition method is a homotopy perturbation technique and coincides with Taylor's series expansions for autonomous ordinary differential equations. Piecewise-decomposition methods provide series solutions in intervals which are subject to continuity conditions at the end points of each interval, and their adaption is based on the use of either a fixed number of approximants and a variable step size, a variable number of approximants and a fixed step size or a variable number of approximants and a variable step size. It is shown that the appearance of noise terms in the decomposition method is related to both the differential equation and the manner in which the homotopy parameter is introduced, especially for the Lane-Emden equation. It is also shown that, in order to avoid the use of numerical quadrature, there is a simple way of introducing the homotopy parameter in the two first-order ordinary differential equations that correspond to the second-order Thomas-Fermi equation. It is also shown that the piecewise homotopy perturbation methods presented here provide more accurate results than a modified Adomian decomposition technique which makes use of Pade approximants and the homotopy analysis method, for the Thomas-Fermi equation.
Monotone partitions and almost partitions
Bonanzinga, M.; Cammaroto, F.; van Mill, J.; Pansera, B.A.
2014-01-01
In this paper we are interested in monotone versions of partitionability of topological spaces and weak versions thereof. We identify several classes of spaces with these properties by constructing trees of open sets with various properties.
Control and estimation of piecewise affine systems
Xu, Jun
2014-01-01
As a powerful tool to study nonlinear systems and hybrid systems, piecewise affine (PWA) systems have been widely applied to mechanical systems. Control and Estimation of Piecewise Affine Systems presents several research findings relating to the control and estimation of PWA systems in one unified view. Chapters in this title discuss stability results of PWA systems, using piecewise quadratic Lyapunov functions and piecewise homogeneous polynomial Lyapunov functions. Explicit necessary and sufficient conditions for the controllability and reachability of a class of PWA systems are
Smoothing of Piecewise Linear Paths
Directory of Open Access Journals (Sweden)
Michel Waringo
2008-11-01
Full Text Available We present an anytime-capable fast deterministic greedy algorithm for smoothing piecewise linear paths consisting of connected linear segments. With this method, path points with only a small influence on path geometry (i.e. aligned or nearly aligned points are successively removed. Due to the removal of less important path points, the computational and memory requirements of the paths are reduced and traversing the path is accelerated. Our algorithm can be used in many different applications, e.g. sweeping, path finding, programming-by-demonstration in a virtual environment, or 6D CNC milling. The algorithm handles points with positional and orientational coordinates of arbitrary dimension.
Why Monotonous Repetition is Unsatisfying
Salingaros, Nikos A
2011-01-01
Human beings prefer ordered complexity and not randomness in their environment, a result of our perceptual system evolving to interpret natural forms. We also recognize monotonously repeating forms as unnatural. Although widespread in today's built environment, such forms generate reactions ranging from boredom to unease. Christopher Alexander has introduced rules for generating forms adapted to natural geometries, which show structured variation with multiple symmetries in a hierarchy of scales. It turns out to be impossible to generate monotonously repeating forms by following those rules. As it is highly probable that traditional artifacts, buildings, and cities were created instinctively using a version of the same rules, this is the reason we never find monotonously repeating forms in traditional cultures.
Algebra-Geometry of Piecewise Algebraic Varieties
Institute of Scientific and Technical Information of China (English)
Chun Gang ZHU; Ren Hong WANG
2012-01-01
Algebraic variety is the most important subject in classical algebraic geometry.As the zero set of multivariate splines,the piecewise algebraic variety is a kind generalization of the classical algebraic variety.This paper studies the correspondence between spline ideals and piecewise algebraic varieties based on the knowledge of algebraic geometry and multivariate splines.
DEFF Research Database (Denmark)
Gravesen, Jens
2005-01-01
t is shown that a closed polygon with an odd number of vertices is the median of exactly one piecewise planar cylinder and one piecewise planar Möbius band, intersecting each other orthogonally. A closed polygon with an even number of vertices is in the generic case neither the median of a piecew...
Monotonicity of social welfare optima
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Østerdal, Lars Peter Raahave
2010-01-01
This paper considers the problem of maximizing social welfare subject to participation constraints. It is shown that for an income allocation method that maximizes a social welfare function there is a monotonic relationship between the incomes allocated to individual agents in a given coalition...... (with at least three members) and its participation constraint if and only if the aggregate income to that coalition is always maximized. An impossibility result demonstrates that there is no welfare maximizing allocation method in which agents' individual incomes monotonically increase in society......'s income. Thus, for any such allocation method, there are situations where some agents have incentives to prevent society in becoming richer....
A WENO-type slope-limiter for a family of piecewise polynomial methods
Engwirda, Darren
2016-01-01
A new, high-order slope-limiting procedure for the Piecewise Parabolic Method (PPM) and the Piecewise Quartic Method (PQM) is described. Following a Weighted Essentially Non-Oscillatory (WENO)-type paradigm, the proposed slope-limiter seeks to reconstruct smooth, non-oscillatory piecewise polynomial profiles as a non-linear combination of the natural and monotone-limited PPM and PQM interpolants. Compared to existing monotone slope-limiting techniques, this new strategy is designed to improve accuracy at smooth extrema, while controlling spurious oscillations in the neighbourhood of sharp features. Using the new slope-limited PPM and PQM interpolants, a high-order accurate Arbitrary-Lagrangian-Eulerian framework for advection-dominated flows is constructed, and its effectiveness is examined using a series of one- and two-dimensional benchmark cases. It is shown that the new WENO-type slope-limiting techniques offer a significant improvement in accuracy compared to existing strategies, allowing the PPM- and PQ...
Enhanced piecewise regression based on deterministic annealing
Institute of Scientific and Technical Information of China (English)
ZHANG JiangShe; YANG YuQian; CHEN XiaoWen; ZHOU ChengHu
2008-01-01
Regression is one of the important problems in statistical learning theory. This paper proves the global convergence of the piecewise regression algorithm based on deterministic annealing and continuity of global minimum of free energy w.r.t temperature, and derives a new simplified formula to compute the initial critical temperature. A new enhanced piecewise regression algorithm by using "migration of prototypes" is proposed to eliminate "empty cell" in the annealing process. Numerical experiments on several benchmark datasets show that the new algo-rithm can remove redundancy and improve generalization of the piecewise regres-sion model.
A Characterization of Generalized Monotone Normed Cones
Institute of Scientific and Technical Information of China (English)
S.ROMAGUERA; E.A.S(A)NCHEZ-P(E)REZ; O.VALERO
2007-01-01
Let C be a cone and consider a quasi-norm p defined on it. We study the structure of the couple (C, p) as a topological space in the case where the function p is also monotone. We characterize when the topology of a quasi-normed cone can be defined by means of a monotone norm. We also define and study the dual cone of a monotone normed cone and the monotone quotient of a general cone.We provide a decomposition theorem which allows us to write a cone as a direct sum of a monotone subcone that is isomorphic to the monotone quotient and other particular subcone.
Testing Monotonicity of Pricing Kernels
Timofeev, Roman
2007-01-01
In this master thesis a mechanism to test mononicity of empirical pricing kernels (EPK) is presented. By testing monotonicity of pricing kernel we can determine whether utility function is concave or not. Strictly decreasing pricing kernel corresponds to concave utility function while non-decreasing EPK means that utility function contains some non-concave regions. Risk averse behavior is usually described by concave utility function and considered to be a cornerstone of classical behavioral ...
Piecewise polynomial solutions to linear inverse problems
DEFF Research Database (Denmark)
Hansen, Per Christian; Mosegaard, K.
1996-01-01
We have presented a new algorithm PP-TSVD that computes piecewise polynomial solutions to ill-posed problems, without a priori knowledge about the positions of the break points. In particular, we can compute piecewise constant functions that describe layered models. Such solutions are useful, e.g.......g., in seismological problems, and the algorithm can also be used as a preprocessor for other methods where break points/discontinuities must be incorporated explicitly....
Monotonicity of chi-square test statistics
Ryu, Keunkwan
2003-01-01
This paper establishes monotonicity of the chi-square test statistic. As the more efficient parameter estimator is plugged into the test statistic, the degrees of freedom of the resulting chi-square test statistic monotonically increase.
Vibration Analysis of Rectangular Plates with One or More Guided Edges via Bicubic B-Spline Method
Directory of Open Access Journals (Sweden)
W.J. Si
2005-01-01
Full Text Available A simple and accurate method is proposed for the vibration analysis of rectangular plates with one or more guided edges, in which bicubic B-spline interpolation in combination with a new type of basis cubic B-spline functions is used to approximate the plate deflection. This type of basis cubic B-spline functions can satisfy simply supported, clamped, free, and guided edge conditions with easy numerical manipulation. The frequency characteristic equation is formulated based on classical thin plate theory by performing Hamilton's principle. The present solutions are verified with the analytical ones. Fast convergence, high accuracy and computational efficiency have been demonstrated from the comparisons. Frequency parameters for 13 cases of rectangular plates with at least one guided edge, which are possible by approximate or numerical methods only, are presented. These results are new in literature.
Institute of Scientific and Technical Information of China (English)
Zhu Yiqing; Hu Bin; Li Hui; Jiang Fengyun
2005-01-01
In this paper, the spatial-temporal gravity variation patterns of the northeastern margin of Qinghai-Xizang (Tibet) Plateau in 1992～ 2001 are modeled using bicubic spline interpolation functions and the relations of gravity change with seismicity and tectonic movement are discussed preliminarily. The results show as follows: ① Regionalgravitational field changes regularly and the gravity abnormity zone or gravity concentration zone appears in the earthquake preparation process; ② In the significant time period, the gravity variation shows different features in the northwest, southeast and northeast parts of the surveyed region respectively, with Lanzhou as its boundary; ③ The gravity variation distribution is basically identical to the strike of tectonic fault zone of the region, and the contour of gravity variation is closely related to the fault distribution.
Some Generalizations of Monotonicity Condition and Applications
Institute of Scientific and Technical Information of China (English)
虞旦盛; 周颂平
2006-01-01
@@ O Introduction It is well known that there are a great number of interesting results in Fourier analysis established by assuming monotonicity of coefficients, and many of them have been generalized by loosing the condition to quasi-monotonicity, O-regularly varying quasi-monotonicity, etc..
Traveling waves in a nonlocal, piecewise linear reaction-diffusion population model
Autry, E. A.; Bayliss, A.; Volpert, V. A.
2017-08-01
We consider an analytically tractable switching model that is a simplification of a nonlocal, nonlinear reaction-diffusion model of population growth where we take the source term to be piecewise linear. The form of this source term allows us to consider both the monostable and bistable versions of the problem. By transforming to a traveling frame and choosing specific kernel functions, we are able to reduce the problem to a system of algebraic equations. We construct solutions and examine the propagation speed and monotonicity of the resulting waves.
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming
2009-01-01
The calculus of communicating systems, CCS, was introduced by Robin Milner as a calculus for modelling concurrent systems. Subsequently several techniques have been developed for analysing such models in order to get further insight into their dynamic behaviour. In this paper we present a static...... analysis for approximating the control structure embedded within the models. We formulate the analysis as an instance of a monotone framework and thus draw on techniques that often are associated with the efficient implementation of classical imperative programming languages. We show how to construct...
Piecewise polynomial representations of genomic tracks.
Tarabichi, Maxime; Detours, Vincent; Konopka, Tomasz
2012-01-01
Genomic data from micro-array and sequencing projects consist of associations of measured values to chromosomal coordinates. These associations can be thought of as functions in one dimension and can thus be stored, analyzed, and interpreted as piecewise-polynomial curves. We present a general framework for building piecewise polynomial representations of genome-scale signals and illustrate some of its applications via examples. We show that piecewise constant segmentation, a typical step in copy-number analyses, can be carried out within this framework for both array and (DNA) sequencing data offering advantages over existing methods in each case. Higher-order polynomial curves can be used, for example, to detect trends and/or discontinuities in transcription levels from RNA-seq data. We give a concrete application of piecewise linear functions to diagnose and quantify alignment quality at exon borders (splice sites). Our software (source and object code) for building piecewise polynomial models is available at http://sourceforge.net/projects/locsmoc/.
On the sample monotonization problem
Takhanov, R. S.
2010-07-01
The problem of finding a maximal subsample in a training sample consisting of the pairs “object-answer” that does not violate monotonicity constraints is considered. It is proved that this problem is NP-hard and that it is equivalent to the problem of finding a maximum independent set in special directed graphs. Practically important cases in which a partial order specified on the set of answers is a complete order or has dimension two are considered in detail. It is shown that the second case is reduced to the maximization of a quadratic convex function on a convex set. For this case, an approximate polynomial algorithm based on linear programming theory is proposed.
Directory of Open Access Journals (Sweden)
Zhiwei Pan
2016-05-01
Full Text Available Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation (DIC algorithms. In this paper, a global look-up table strategy with cubic B-spline interpolation is developed for the DIC method based on the inverse compositional Gauss–Newton (IC-GN algorithm. The performance of this strategy, including accuracy, precision, and computation efficiency, is evaluated through a theoretical and experimental study, using the one with widely employed bicubic interpolation as a benchmark. The global look-up table strategy with cubic B-spline interpolation improves significantly the accuracy of the IC-GN algorithm-based DIC method compared with the one using the bicubic interpolation, at a trivial price of computation efficiency.
Piecewise deterministic Markov processes : an analytic approach
Alkurdi, Taleb Salameh Odeh
2013-01-01
The subject of this thesis, piecewise deterministic Markov processes, an analytic approach, is on the border between analysis and probability theory. Such processes can either be viewed as random perturbations of deterministic dynamical systems in an impulsive fashion, or as a particular kind of
N(o)ther-type theorem of piecewise algebraic curves
Institute of Scientific and Technical Information of China (English)
WANG Renhong; ZHU Chungang
2004-01-01
The piecewise algebraic curve is a generalization of the classical algebraic curve.This paper describes the improvement of the Nother-type theorem of piecewise algebraic curves on the star region.Moreover,the Nother-type theorem of piecewise algebraic curves on the cross-cut partition is discussed.
Monotonic Allocation Schemes in Clan Games
Voorneveld, M.; Tijs, S.H.; Grahn, S.
2000-01-01
Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition reflecting the decreasing marginal contribution of non-clan members to growing coalitions.This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation
Monotone models for prediction in data mining
Velikova, M.V.
2006-01-01
This dissertation studies the incorporation of monotonicity constraints as a type of domain knowledge into a data mining process. Monotonicity constraints are enforced at two stages¿data preparation and data modeling. The main contributions of the research are a novel procedure to test the degree of
Monotonic Stable Solutions for Minimum Coloring Games
Hamers, H.J.M.; Miquel, S.; Norde, H.W.
2011-01-01
For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)). We show that a minimum coloring game on a graph G has a population monotonic allocation scheme if and only if G is (P4,
Monotonicity-preserving linear multistep methods
Hundsdorfer, W.; Ruuth, S.J.; Spiteri, R.J.
2002-01-01
In this paper we provide an analysis of monotonicity properties for linear multistep methods. These monotonicity properties include positivity and the diminishing of total variation. We also pay particular attention to related boundedness properties such as the total-variation-bounded (TVB) property
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as speci
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as
Monotone Hurwitz numbers in genus zero
Goulden, I P; Novak, Jonathan
2012-01-01
Hurwitz numbers count branched covers of the Riemann sphere with specified ramification data, or equivalently, transitive permutation factorizations in the symmetric group with specified cycle types. Monotone Hurwitz numbers count a restricted subset of the branched covers counted by the Hurwitz numbers, and have arisen in recent work on the the asymptotic expansion of the Harish-Chandra-Itzykson-Zuber integral. In this paper we begin a detailed study of monotone Hurwitz numbers. We prove two results that are reminiscent of those for classical Hurwitz numbers. The first is the monotone join-cut equation, a partial differential equation with initial conditions that characterizes the generating function for monotone Hurwitz numbers in arbitrary genus. The second is our main result, in which we give an explicit formula for monotone Hurwitz numbers in genus zero.
Piecewise flat embeddings for hyperspectral image analysis
Hayes, Tyler L.; Meinhold, Renee T.; Hamilton, John F.; Cahill, Nathan D.
2017-05-01
Graph-based dimensionality reduction techniques such as Laplacian Eigenmaps (LE), Local Linear Embedding (LLE), Isometric Feature Mapping (ISOMAP), and Kernel Principal Components Analysis (KPCA) have been used in a variety of hyperspectral image analysis applications for generating smooth data embeddings. Recently, Piecewise Flat Embeddings (PFE) were introduced in the computer vision community as a technique for generating piecewise constant embeddings that make data clustering / image segmentation a straightforward process. In this paper, we show how PFE arises by modifying LE, yielding a constrained ℓ1-minimization problem that can be solved iteratively. Using publicly available data, we carry out experiments to illustrate the implications of applying PFE to pixel-based hyperspectral image clustering and classification.
Decomposed Implicit Models of Piecewise - Linear Networks
Directory of Open Access Journals (Sweden)
J. Brzobohaty
1992-05-01
Full Text Available The general matrix form of the implicit description of a piecewise-linear (PWL network and the symbolic block diagram of the corresponding circuit model are proposed. Their decomposed forms enable us to determine quite separately the existence of the individual breakpoints of the resultant PWL characteristic and their coordinates using independent network parameters. For the two-diode and three-diode cases all the attainable types of the PWL characteristic are introduced.
MAP estimators for piecewise continuous inversion
Dunlop, M. M.; Stuart, A. M.
2016-10-01
We study the inverse problem of estimating a field u a from data comprising a finite set of nonlinear functionals of u a , subject to additive noise; we denote this observed data by y. Our interest is in the reconstruction of piecewise continuous fields u a in which the discontinuity set is described by a finite number of geometric parameters a. Natural applications include groundwater flow and electrical impedance tomography. We take a Bayesian approach, placing a prior distribution on u a and determining the conditional distribution on u a given the data y. It is then natural to study maximum a posterior (MAP) estimators. Recently (Dashti et al 2013 Inverse Problems 29 095017) it has been shown that MAP estimators can be characterised as minimisers of a generalised Onsager-Machlup functional, in the case where the prior measure is a Gaussian random field. We extend this theory to a more general class of prior distributions which allows for piecewise continuous fields. Specifically, the prior field is assumed to be piecewise Gaussian with random interfaces between the different Gaussians defined by a finite number of parameters. We also make connections with recent work on MAP estimators for linear problems and possibly non-Gaussian priors (Helin and Burger 2015 Inverse Problems 31 085009) which employs the notion of Fomin derivative. In showing applicability of our theory we focus on the groundwater flow and EIT models, though the theory holds more generally. Numerical experiments are implemented for the groundwater flow model, demonstrating the feasibility of determining MAP estimators for these piecewise continuous models, but also that the geometric formulation can lead to multiple nearby (local) MAP estimators. We relate these MAP estimators to the behaviour of output from MCMC samples of the posterior, obtained using a state-of-the-art function space Metropolis-Hastings method.
Embedding loop quantum cosmology without piecewise linearity
Engle, Jonathan
2013-01-01
An important goal is to understand better the relation between full loop quantum gravity (LQG) and the simplified, reduced theory known as loop quantum cosmology (LQC), {\\em directly at the quantum level}. Such a firmer understanding would increase confidence in the reduced theory as a tool for formulating predictions of the full theory, as well as permitting lessons from the reduced theory to guide further development in the full theory. The present paper constructs an embedding of the usual state space of LQC into that of standard LQG, that is, LQG based on \\textit{piecewise analytic paths}. The embedding is well-defined even prior to solving the diffeomorphism constraint, at no point is a graph fixed, and at no point is the piecewise linear category used. This motivates for the first time a definition of operators in LQC corresponding to holonomies along non-piecewise-linear paths, without changing the usual kinematics of LQC in any way. The new embedding intertwines all operators corresponding to such hol...
Embedding loop quantum cosmology without piecewise linearity
Engle, Jonathan
2013-04-01
An important goal is to understand better the relation between full loop quantum gravity (LQG) and the simplified, reduced theory known as loop quantum cosmology (LQC), directly at the quantum level. Such a firmer understanding would increase confidence in the reduced theory as a tool for formulating predictions of the full theory, as well as permitting lessons from the reduced theory to guide further development in the full theory. This paper constructs an embedding of the usual state space of LQC into that of standard LQG, that is, LQG based on piecewise analytic paths. The embedding is well defined even prior to solving the diffeomorphism constraint, at no point is a graph fixed and at no point is the piecewise linear category used. This motivates for the first time a definition of operators in LQC corresponding to holonomies along non-piecewise linear paths, without changing the usual kinematics of LQC in any way. The new embedding intertwines all operators corresponding to such holonomies, and all elements in its image satisfy an operator equation which classically implies homogeneity and isotropy. The construction is made possible by a recent result proven by Fleischhack. Communicated by P Singh
Viable harvest of monotone bioeconomic models
De Lara, Michel; Cabrera, Hector Ramirez
2009-01-01
Some monospecies age class models, as well as specific multi-species models (with so-called technical interactions), exhibit useful monotonicity properties. This paper deals with discrete time monotone bioeconomics dynamics in the presence of state and control constraints. In practice, these latter ``acceptable configurations'' represent production and preservation requirements to be satisfied for all time, and they also possess monotonicity properties. A state $\\state$ is said to belong to the viability kernel if there exists a trajectory, of states and controls, starting from $\\state$ and satisfying the constraints. Under monotonicity assumptions, we present upper and lower estimates of the viability kernel. This helps delineating domains where a viable management is possible. Numerical examples, in the context of fisheries management, for the Chilean sea bass (\\emph{Dissostichus eleginoides}) and Alfonsino (\\emph{Beryx splendens}) are given.
Hyperbolic monotonicity in the Hilbert ball
Directory of Open Access Journals (Sweden)
Reich Simeon
2006-01-01
Full Text Available We first characterize -monotone mappings on the Hilbert ball by using their resolvents and then study the asymptotic behavior of compositions and convex combinations of these resolvents.
H∞ controller synthesis of piecewise discrete time linear systems
Institute of Scientific and Technical Information of China (English)
Gang FENG
2003-01-01
This paper presents an H∞ controller design method for piecewise discrete time linear systems based on a piecewise quadratic Lyapunov function. It is shown that the resulting closed loop system is globally stable with guaranteed H∞ perfomance and the controller can be obtained by solvng a set of bilinear matrix inequalities. It has been shown that piecewise quadratic Lyapnnov functions are less conservative than the global quadratic Lyapunov functions. A simulation example is also given to illustrate the advantage of the proposed approach.
[Optimizing algorithm design of piecewise linear classifier for spectra].
Lan, Tian-Ge; Fang, Yong-Hua; Xiong, Wei; Kong, Chao; Li, Da-Cheng; Dong, Da-Ming
2008-11-01
Being able to identify pollutant gases quickly and accurately is a basic request of spectroscopic technique for envirment monitoring for spectral classifier. Piecewise linear classifier is simple needs less computational time and approachs nonlinear boundary beautifully. Combining piecewise linear classifier and linear support vector machine which is based on the principle of maximizing margin, an optimizing algorithm for single side piecewise linear classifier was devised. Experimental results indicate that the piecewise linear classifier trained by the optimizing algorithm proposed in this paper can approach nonolinear boundary with fewer super_planes and has higher veracity for classification and recognition.
Piecewise Silence in Discrete Cosmological Models
Clifton, Timothy; Rosquist, Kjell
2014-01-01
We consider a family of cosmological models in which all mass is confined to a regular lattice of identical black holes. By exploiting the reflection symmetry about planes that bisect these lattices into identical halves, we are able to consider the evolution of a number of geometrically distinguished surfaces that exist within each of them. We show that gravitational waves are effectively trapped within small chambers for all time, and are not free to propagate throughout the space-time. Each chamber therefore evolves as if it were in isolation from the rest of the universe. We call this phenomenon "piecewise silence".
Piecewise Linear Model-Based Image Enhancement
Directory of Open Access Journals (Sweden)
Fabrizio Russo
2004-09-01
Full Text Available A novel technique for the sharpening of noisy images is presented. The proposed enhancement system adopts a simple piecewise linear (PWL function in order to sharpen the image edges and to reduce the noise. Such effects can easily be controlled by varying two parameters only. The noise sensitivity of the operator is further decreased by means of an additional filtering step, which resorts to a nonlinear model too. Results of computer simulations show that the proposed sharpening system is simple and effective. The application of the method to contrast enhancement of color images is also discussed.
Bayesian regression of piecewise homogeneous Poisson processes
Directory of Open Access Journals (Sweden)
Diego Sevilla
2015-12-01
Full Text Available In this paper, a Bayesian method for piecewise regression is adapted to handle counting processes data distributed as Poisson. A numerical code in Mathematica is developed and tested analyzing simulated data. The resulting method is valuable for detecting breaking points in the count rate of time series for Poisson processes. Received: 2 November 2015, Accepted: 27 November 2015; Edited by: R. Dickman; Reviewed by: M. Hutter, Australian National University, Canberra, Australia.; DOI: http://dx.doi.org/10.4279/PIP.070018 Cite as: D J R Sevilla, Papers in Physics 7, 070018 (2015
Monotone Rank and Separations in Computational Complexity
Li, Yang D
2011-01-01
In the paper, we introduce the concept of monotone rank, and using it as a powerful tool, we obtain several important and strong separation results in computational complexity. We show a super-exponential separation between monotone and non-monotone computation in the non-commutative model, and thus give the answer to a longstanding open problem posed by Nisan \\cite{Nis1991} in algebraic complexity. More specifically, we exhibit a homogeneous algebraic function $f$ of degree $d$ ($d$ even) on $n$ variables with the monotone algebraic branching program (ABP) complexity $\\Omega(n^{d/2})$ and the non-monotone ABP complexity $O(d^2)$. We propose a relaxed version of the famous Bell's theorem\\cite{Bel1964}\\cite{CHSH1969}. Bell's theorem basically states that local hidden variable theory cannot predict the correlations produced by quantum mechanics, and therefore is an impossibility result. Bell's theorem heavily relies on the diversity of the measurements. We prove that even if we fix the measurement, infinite amo...
Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly.
Moore, Tyler G; Garzon, Max H; Deaton, Russell J
2015-01-01
Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale. Algorithmic self-assembly models the product of self-assembly as the output of some computational process, and attempts to control the process of assembly algorithmically. Though providing fundamental insights, these computational models have yet to fully account for the randomness that is inherent in experimental realizations, which tend to be based on trial and error methods. In order to develop a method of analysis that addresses experimental parameters, such as error and yield, this work focuses on the capability of assembly systems to produce a pre-determined set of target patterns, either accurately or perhaps only approximately. Self-assembly systems that assemble patterns that are similar to the targets in a significant percentage are "strong" assemblers. In addition, assemblers should predominantly produce target patterns, with a small percentage of errors or junk. These definitions approximate notions of yield and purity in chemistry and manufacturing. By combining these definitions, a criterion for efficient assembly is developed that can be used to compare the ability of different assembly systems to produce a given target set. Efficiency is a composite measure of the accuracy and purity of an assembler. Typical examples in algorithmic assembly are assessed in the context of these metrics. In addition to validating the method, they also provide some insight that might be used to guide experimentation. Finally, some general results are established that, for efficient assembly, imply that every target pattern is guaranteed to be assembled with a minimum common positive probability, regardless of its size, and that a trichotomy exists to characterize the global behavior of typical efficient, monotonic self-assembly systems
Probabilistic Analysis of Pattern Formation in Monotonic Self-Assembly.
Directory of Open Access Journals (Sweden)
Tyler G Moore
Full Text Available Inspired by biological systems, self-assembly aims to construct complex structures. It functions through piece-wise, local interactions among component parts and has the potential to produce novel materials and devices at the nanoscale. Algorithmic self-assembly models the product of self-assembly as the output of some computational process, and attempts to control the process of assembly algorithmically. Though providing fundamental insights, these computational models have yet to fully account for the randomness that is inherent in experimental realizations, which tend to be based on trial and error methods. In order to develop a method of analysis that addresses experimental parameters, such as error and yield, this work focuses on the capability of assembly systems to produce a pre-determined set of target patterns, either accurately or perhaps only approximately. Self-assembly systems that assemble patterns that are similar to the targets in a significant percentage are "strong" assemblers. In addition, assemblers should predominantly produce target patterns, with a small percentage of errors or junk. These definitions approximate notions of yield and purity in chemistry and manufacturing. By combining these definitions, a criterion for efficient assembly is developed that can be used to compare the ability of different assembly systems to produce a given target set. Efficiency is a composite measure of the accuracy and purity of an assembler. Typical examples in algorithmic assembly are assessed in the context of these metrics. In addition to validating the method, they also provide some insight that might be used to guide experimentation. Finally, some general results are established that, for efficient assembly, imply that every target pattern is guaranteed to be assembled with a minimum common positive probability, regardless of its size, and that a trichotomy exists to characterize the global behavior of typical efficient, monotonic
The Melnikov method and subharmonic orbits in a piecewise smooth system
Granados, A; Seara, T M
2012-01-01
In this work we consider a two-dimensional piecewise smooth system, defined in two domains separated by the switching manifold $x=0$. We assume that there exists a piecewise-defined continuous Hamiltonian that is a first integral of the system. We also suppose that the system possesses an invisible fold-fold at the origin and two heteroclinic orbits connecting two hyperbolic critical points on either side of $x=0$. Finally, we assume that the region closed by these heteroclinic connections is fully covered by periodic orbits surrounding the origin, whose periods monotonically increase as they approach the heteroclinic connection. When considering a non-autonomous ($T$-periodic) Hamiltonian perturbation of amplitude $\\varepsilon$, using an impact map, we rigorously prove that, for every $n$ and $m$ relatively prime and $\\varepsilon>0$ small enough, there exists a $nT$-periodic orbit impacting $2m$ times with the switching manifold at every period if a modified subharmonic Melnikov function possesses a simple z...
Piecewise power laws in individual learning curves.
Donner, Yoni; Hardy, Joseph L
2015-10-01
The notion that human learning follows a smooth power law (PL) of diminishing gains is well-established in psychology. This characteristic is observed when multiple curves are averaged, potentially masking more complex dynamics underpinning the curves of individual learners. Here, we analyzed 25,280 individual learning curves, each comprising 500 measurements of cognitive performance taken from four cognitive tasks. A piecewise PL (PPL) model explained the individual learning curves significantly better than a single PL, controlling for model complexity. The PPL model allows for multiple PLs connected at different points in the learning process. We also explored the transition dynamics between PL curve component pieces. Performance in later pieces typically surpassed that in earlier pieces, after a brief drop in performance at the transition point. The transition rate was negatively associated with age, even after controlling for overall performance. Our results suggest at least two processes at work in individual learning curves: locally, a gradual, smooth improvement, with diminishing gains within a specific strategy, which is modeled well as a PL; and globally, a discrete sequence of strategy shifts, in which each strategy is better in the long term than the ones preceding it. The piecewise extension of the classic PL of practice has implications for both individual skill acquisition and theories of learning.
Renormalizable two-parameter piecewise isometries.
Lowenstein, J H; Vivaldi, F
2016-06-01
We exhibit two distinct renormalization scenarios for two-parameter piecewise isometries, based on 2π/5 rotations of a rhombus and parameter-dependent translations. Both scenarios rely on the recently established renormalizability of a one-parameter triangle map, which takes place if and only if the parameter belongs to the algebraic number field K=Q(5) associated with the rotation matrix. With two parameters, features emerge which have no counterpart in the single-parameter model. In the first scenario, we show that renormalizability is no longer rigid: whereas one of the two parameters is restricted to K, the second parameter can vary continuously over a real interval without destroying self-similarity. The mechanism involves neighbouring atoms which recombine after traversing distinct return paths. We show that this phenomenon also occurs in the simpler context of Rauzy-Veech renormalization of interval exchange transformations, here regarded as parametric piecewise isometries on a real interval. We explore this analogy in some detail. In the second scenario, which involves two-parameter deformations of a three-parameter rhombus map, we exhibit a weak form of rigidity. The phase space splits into several (non-convex) invariant components, on each of which the renormalization still has a free parameter. However, the foliations of the different components are transversal in parameter space; as a result, simultaneous self-similarity of the component maps requires that both of the original parameters belong to the field K.
Piecewise-Planar Parabolic Reflectarray Antenna
Hodges, Richard; Zawadzki, Mark
2009-01-01
The figure shows a dual-beam, dualpolarization Ku-band antenna, the reflector of which comprises an assembly of small reflectarrays arranged in a piecewise- planar approximation of a parabolic reflector surface. The specific antenna design is intended to satisfy requirements for a wide-swath spaceborne radar altimeter, but the general principle of piecewise-planar reflectarray approximation of a parabolic reflector also offers advantages for other applications in which there are requirements for wideswath antennas that can be stowed compactly and that perform equally in both horizontal and vertical polarizations. The main advantages of using flat (e.g., reflectarray) antenna surfaces instead of paraboloidal or parabolic surfaces is that the flat ones can be fabricated at lower cost and can be stowed and deployed more easily. Heretofore, reflectarray antennas have typically been designed to reside on single planar surfaces and to emulate the focusing properties of, variously, paraboloidal (dish) or parabolic antennas. In the present case, one approximates the nominal parabolic shape by concatenating several flat pieces, while still exploiting the principles of the planar reflectarray for each piece. Prior to the conception of the present design, the use of a single large reflectarray was considered, but then abandoned when it was found that the directional and gain properties of the antenna would be noticeably different for the horizontal and vertical polarizations.
The monotonic and fatigue behavior of CFCCs
Energy Technology Data Exchange (ETDEWEB)
Miriyala, N.; Liaw, P.K.; McHargue, C.J. [Univ. of Tennessee, Knoxville, TN (United States); Snead, L.L. [Oak Ridge National Laboratory, TN (United States)
1996-04-01
Flexure tests were performed to study the fabric orientation effects on the monotonic and fatigue behavior of two commercially available continuous fiber reinforced ceramic composites (CFCCs), namely (i) Nicalon fiber fabric reinforced alumina (Al{sub 2}O{sub 3}) matrix composite fabricated by a direct molten metal oxidation (DIMOX) process and, (ii) Nicalon fiber fabric reinforced silicon carbide (SiC) matrix composite fabricated by an isothermal chemical vapor infiltration (ICVI) process. The fabric orientation effects on the monotonic and fatigue behavior were strong in the Nicalon/Al{sub 2}O{sub 3} composite, while they were relatively weak in the Nicalon/SiC composite.
Weighted monotonicity inequalities for unbounded operators
Hoa, Dinh Trung
2011-01-01
Let $\\tau$ be a faithful normal semifinite trace on a von Neumann algebra $\\mathcal{M}$. For a continuous nonnegative convex monotone nondecreasing function $f$ on convex subset $\\Omega$ of $\\mathbb{R}$ and weight nonnegative Borel function $w$ we consider weighted monotonicity inequalities of the form {equation*} \\tau(w(A)^{1/2}f(A)w(A)^{1/2}) \\le \\tau (w(A)^{1/2}f(B)w(A)^{1/2}), {equation*} where $A$ and $B$ are unbounded operators affiliated with respect to algebra $\\mathcal{M}$.
The piecewise constant method in gait design through optimization
Institute of Scientific and Technical Information of China (English)
Yizhen Wei
2014-01-01
The objective of this paper is to introduce the piecewise constant method in gait design of a planar, under actuated, five-link biped robot model and to discuss the advantages and disadvantages. The piecewise constant method transforms the dynamic optimal control problem into a static problem.
Using piecewise sinusoidal basis functions to blanket multiple wire segments
CSIR Research Space (South Africa)
Lysko, AA
2009-06-01
Full Text Available This paper discusses application of the piecewise sinusoidal (PWS) basis function (BF) over a chain of several wire segments, for example as a multiple domain basis function. The usage of PWS BF is compared to results based on the piecewise linear...
Michalek, Jan; Capek, Martin
2013-05-01
Image registration tasks are often formulated in terms of minimization of a functional consisting of a data fidelity term penalizing the mismatch between the reference and the target image, and a term enforcing smoothness of shift between neighboring pairs of pixels (a min-sum problem). Most methods for deformable image registration use some form of interpolation between matching control points. The interpolation makes it impossible to account for isolated discontinuities in the deformation field that may appear, e.g., when a physical slice of a microscopy specimen is ruptured by the cutting tool. For registration of neighboring physical slices of microscopy specimens with discontinuities, Janácek proposed an L¹-distance data fidelity term and a total variation (TV) smoothness term, and used a graph-cut (GC) based iterative steepest descent algorithm for minimization. The L¹-TV functional is nonconvex; hence a steepest descent algorithm is not guaranteed to converge to the global minimum. Schlesinger presented transformation of max-sum problems to minimization of a dual quantity called problem power, which is--contrary to the original max-sum functional--convex. Based on Schlesinger's solution to max-sum problems we developed an algorithm for L¹-TV minimization by iterative multi-label steepest descent minimization of the convex dual problem. For Schlesinger's subgradient algorithm we proposed a novel step control heuristics that considerably enhances both speed and accuracy compared with standard step size strategies for subgradient methods. It is shown experimentally that our subgradient scheme achieves consistently better image registration than GC in terms of lower values both of the composite L¹-TV functional, and of its components, i.e., the L¹ distance of the images and the transformation smoothness TV, and yields visually acceptable results even in cases where the GC based algorithm fails. The new algorithm allows easy parallelization and can thus be sped up by running on multi-core graphic processing units.
Monotone Comparative Statics for the Industry Composition
DEFF Research Database (Denmark)
Laugesen, Anders Rosenstand
2015-01-01
We let heterogeneous firms face decisions on a number of complementary activities in a monopolistically-competitive industry. The endogenous level of competition and selection regarding entry and exit of firms introduces a wedge between monotone comparative statics (MCS) at the firm level and MCS...
On a Monotone Ill-posed Problem
Institute of Scientific and Technical Information of China (English)
Nguyen BUONG
2005-01-01
A class of a posteriori parameter choice strategies for the operator version of Tikhonovregularization (including variants of Morozov's and Arcangeli's methods) is proposed and used in investigating the rate of convergence of the regularized solution for ill-posed nonlinear equation involving a monotone operator in Banach space.
Population Monotonic Path Schemes for Simple Games
Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.
2006-01-01
A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as the pa
Monotone method for nonlinear nonlocal hyperbolic problems
Directory of Open Access Journals (Sweden)
Azmy S. Ackleh
2003-02-01
Full Text Available We present recent results concerning the application of the monotone method for studying existence and uniqueness of solutions to general first-order nonlinear nonlocal hyperbolic problems. The limitations of comparison principles for such nonlocal problems are discussed. To overcome these limitations, we introduce new definitions for upper and lower solutions.
Limit points of the monotonic schemes
Salomon, J
2005-01-01
Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor), Zhu & Rabitz or the general form of Maday & Turinici. This paper presents an analysis of the limit set of controls provided by these algorithms and a proof of convergence in a particular case.
REGULAR RELATIONS AND MONOTONE NORMAL ORDERED SPACES
Institute of Scientific and Technical Information of China (English)
XU XIAOQUAN; LIU YINGMING
2004-01-01
In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the UrysohnNachbin lemma is presented which is quite different from the classical one.
Monotonicity and bounds on Bessel functions
Directory of Open Access Journals (Sweden)
Larry Landau
2000-07-01
Full Text Available survey my recent results on monotonicity with respect to order of general Bessel functions, which follow from a new identity and lead to best possible uniform bounds. Application may be made to the "spreading of the wave packet" for a free quantum particle on a lattice and to estimates for perturbative expansions.
Strong monotonicity for analytic ordinary differential equations
Directory of Open Access Journals (Sweden)
Sebastian Walcher
2009-09-01
Full Text Available We present a necessary and sufficient criterion for the flow of an analytic ordinary differential equation to be strongly monotone; equivalently, strongly order-preserving. The criterion is given in terms of the reducibility set of the derivative of the right-hand side. Some applications to systems relevant in biology and ecology, including nonlinear compartmental systems, are discussed.
A monotonic archive for pareto-coevolution.
de Jong, Edwin D
2007-01-01
Coevolution has already produced promising results, but its dynamic evaluation can lead to a variety of problems that prevent most algorithms from progressing monotonically. An important open question therefore is how progress towards a chosen solution concept can be achieved. A general solution concept for coevolution is obtained by viewing opponents or tests as objectives. In this setup known as Pareto-coevolution, the desired solution is the Pareto-optimal set. We present an archive that guarantees monotonicity for this solution concept. The algorithm is called the Incremental Pareto-Coevolution Archive (IPCA), and is based on Evolutionary Multi-Objective Optimization (EMOO). By virtue of its monotonicity, IPCA avoids regress even when combined with a highly explorative generator. This capacity is demonstrated on a challenging test problem requiring both exploration and reliability. IPCA maintains a highly specific selection of tests, but the size of the test archive nonetheless grows unboundedly. We therefore furthermore investigate how archive sizes may be limited while still providing approximate reliability. The LAyered Pareto-Coevolution Archive (LAPCA) maintains a limited number of layers of candidate solutions and tests, and thereby permits a trade-off between archive size and reliability. The algorithm is compared in experiments, and found to be more efficient than IPCA. The work demonstrates how the approximation of a monotonic algorithm can lead to algorithms that are sufficiently reliable in practice while offering better efficiency.
Limit properties of monotone matrix functions
Behrndt, Jussi; Hassi, Seppo; de Snoo, Henk; Wietsma, Rudi
2012-01-01
The basic objects in this paper are monotonically nondecreasing n x n matrix functions D(center dot) defined on some open interval l = (a, b) of R and their limit values D(a) and D(b) at the endpoints a and b which are, in general, selfadjoint relations in C-n. Certain space decompositions induced b
Concerns on Monotonic Imbalance Bounding Matching Methods
Yatracos, Yannis G.
2013-01-01
Concerns are expressed for the Monotonic Imbalance Bounding (MIB) property (Iacus et al. 2011) and for MIB matching because i) the definition of the MIB property leads to inconsistencies and the nature of the imbalance measure is not clearly defined, ii) MIB property does not generalize Equal Percent Bias Reducing (EPBR) property, iii) MIB matching does not provide statistical information available with EPBR matching.
Nonparametric confidence intervals for monotone functions
Groeneboom, P.; Jongbloed, G.
2015-01-01
We study nonparametric isotonic confidence intervals for monotone functions. In [Ann. Statist. 29 (2001) 1699–1731], pointwise confidence intervals, based on likelihood ratio tests using the restricted and unrestricted MLE in the current status model, are introduced. We extend the method to the trea
Competitive learning of monotone Boolean functions
2014-01-01
We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances.
Nonparametric confidence intervals for monotone functions
Groeneboom, P.; Jongbloed, G.
2015-01-01
We study nonparametric isotonic confidence intervals for monotone functions. In [Ann. Statist. 29 (2001) 1699–1731], pointwise confidence intervals, based on likelihood ratio tests using the restricted and unrestricted MLE in the current status model, are introduced. We extend the method to the
Edit Distance to Monotonicity in Sliding Windows
DEFF Research Database (Denmark)
Chan, Ho-Leung; Lam, Tak-Wah; Lee, Lap Kei
2011-01-01
of a data stream is becoming well-understood over the past few years. Motivated by applications on network quality monitoring, we extend the study to estimating the edit distance to monotonicity of a sliding window covering the w most recent items in the stream for any w ≥ 1. We give a deterministic...
New concurrent iterative methods with monotonic convergence
Energy Technology Data Exchange (ETDEWEB)
Yao, Qingchuan [Michigan State Univ., East Lansing, MI (United States)
1996-12-31
This paper proposes the new concurrent iterative methods without using any derivatives for finding all zeros of polynomials simultaneously. The new methods are of monotonic convergence for both simple and multiple real-zeros of polynomials and are quadratically convergent. The corresponding accelerated concurrent iterative methods are obtained too. The new methods are good candidates for the application in solving symmetric eigenproblems.
Classification Trees for Problems with Monotonicity Constraints
R. Potharst (Rob); A.J. Feelders
2002-01-01
textabstractFor classification problems with ordinal attributes very often the class attribute should increase with each or some of the explaining attributes. These are called classification problems with monotonicity constraints. Classical decision tree algorithms such as CART or C4.5 generally do
Dynamics of delayed piecewise linear systems
Directory of Open Access Journals (Sweden)
Laszlo E. Kollar
2003-02-01
Full Text Available In this paper the dynamics of the controlled pendulum is investigated assuming backlash and time delays. The upper equilibrium of the pendulum is stabilized by a piecewise constant control force which is the linear combination of the sampled values of the angle and the angular velocity of the pendulum. The control force is provided by a motor which drives one of the wheels of the cart through an elastic teeth belt. The contact between the teeth of the gear (rigid and the belt (elastic introduces a nonlinearity known as ``backlash" and causes the oscillation of the controlled pendulum around its upper equilibrium. The processing and sampling delays in the determination of the control force tend to destabilize the controlled system as well. We obtain conditions guaranteeing that the pendulum remains in the neighborhood of the upper equilibrium. Experimental findings obtained on a computer controlled inverted pendulum cart structure are also presented showing good agreement with the simulation results.
Piecewise deterministic processes in biological models
Rudnicki, Ryszard
2017-01-01
This book presents a concise introduction to piecewise deterministic Markov processes (PDMPs), with particular emphasis on their applications to biological models. Further, it presents examples of biological phenomena, such as gene activity and population growth, where different types of PDMPs appear: continuous time Markov chains, deterministic processes with jumps, processes with switching dynamics, and point processes. Subsequent chapters present the necessary tools from the theory of stochastic processes and semigroups of linear operators, as well as theoretical results concerning the long-time behaviour of stochastic semigroups induced by PDMPs and their applications to biological models. As such, the book offers a valuable resource for mathematicians and biologists alike. The first group will find new biological models that lead to interesting and often new mathematical questions, while the second can observe how to include seemingly disparate biological processes into a unified mathematical theory, and...
Incompressible flows with piecewise constant density
Danchin, Raphaël
2012-01-01
We investigate the incompressible Navier-Stokes equations with variable density. The aim is to prove existence and uniqueness results in the case of discontinuous ini- tial density. In dimension n = 2, 3, assuming only that the initial density is bounded and bounded away from zero, and that the initial velocity is smooth enough, we get the local-in-time existence of unique solutions. Uniqueness holds in any dimension and for a wider class of velocity fields. Let us emphasize that all those results are true for piecewise constant densities with arbitrarily large jumps. Global results are established in dimension two if the density is close enough to a positive constant, and in n-dimension if, in addition, the initial velocity is small. The Lagrangian formula- tion for describing the flow plays a key role in the analysis that is proposed in the present paper.
Institute of Scientific and Technical Information of China (English)
Joong-Hyun Rhim; Doo-Yeoun Cho; Kyu-Yeul Lee; Tae-Wan Kim
2006-01-01
We propose a method that automatically generates discrete bicubic G1 continuous B-spline surfaces that interpolate the curve network of a ship hullform. First, the curves in the network are classified into two types: boundary curves and "reference curves". The boundary curves correspond to a set of rectangular (or triangular) topological type that can be represented with tensor-product (or degenerate) B-spline surface patches. Next, in the interior of the patches,surface fitting points and cross boundary derivatives are estimated from the reference curves by constructing "virtual" isoparametric curves. Finally, a discrete G1 continuous B-spline surface is generated by a surface fitting algorithm. Several smooth ship hullform surfaces generated from curve networks corresponding to actual ship hullforms demonstrate the quality of the method.
Output feedback controller design for uncertain piecewise linear systems
Institute of Scientific and Technical Information of China (English)
Jianxiong ZHANG; Wansheng TANG
2007-01-01
This paper proposes output feedback controller design methods for uncertain piecewise linear systems based on piecewise quadratic Lyapunov function. The α-stability of closed-loop systems is also considered. It is shown that the output feedback controller design procedure of uncertain piecewise linear systems with α-stability constraint can be cast as solving a set of bilinear matrix inequalities (BMIs). The BMIs problem in this paper can be solved iteratively as a set of two convex optimization problems involving linear matrix inequalities (LMIs) which can be solved numerically efficiently. A numerical example shows the effectiveness of the proposed methods.
Estimation of the Bezout number for piecewise algebraic curve
Institute of Scientific and Technical Information of China (English)
WANG; Renhong(王仁宏); XU; Zhiqiang(许志强)
2003-01-01
A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper, a conjecture on triangulation is confirmed. The relation between the piecewise linear algebraiccurve and four-color conjecture is also presented. By Morgan-Scott triangulation, we will show the instabilityof Bezout number of piecewise algebraic curves. By using the combinatorial optimization method, an upperbound of the Bezout number defined as the maximum finite number of intersection points of two piecewisealgebraic curves is presented.
Monotone operators and "bigger conjugate" functions
Bauschke, Heinz H; Wang, Xianfu; Yao, Liangjin
2011-01-01
We study a question posed by Stephen Simons in his 2008 monograph involving "bigger conjugate" (BC) functions and the partial infimal convolution. As Simons demonstrated in his monograph, these function have been crucial to the understanding and advancement of the state-of-the-art of harder problems in monotone operator theory, especially the sum problem. In this paper, we provide some tools for further analysis of BC--functions which allow us to answer Simons' problem in the negative. We are also able to refute a similar but much harder conjecture which would have generalized a classical result of Br\\'ezis, Crandall and Pazy. Our work also reinforces the importance of understanding unbounded skew linear relations to construct monotone operators with unexpected properties.
Convex functions, monotone operators and differentiability
Phelps, Robert R
1993-01-01
The improved and expanded second edition contains expositions of some major results which have been obtained in the years since the 1st edition. Theaffirmative answer by Preiss of the decades old question of whether a Banachspace with an equivalent Gateaux differentiable norm is a weak Asplund space. The startlingly simple proof by Simons of Rockafellar's fundamental maximal monotonicity theorem for subdifferentials of convex functions. The exciting new version of the useful Borwein-Preiss smooth variational principle due to Godefroy, Deville and Zizler. The material is accessible to students who have had a course in Functional Analysis; indeed, the first edition has been used in numerous graduate seminars. Starting with convex functions on the line, it leads to interconnected topics in convexity, differentiability and subdifferentiability of convex functions in Banach spaces, generic continuity of monotone operators, geometry of Banach spaces and the Radon-Nikodym property, convex analysis, variational princ...
Complexity of Non-Monotonic Logics
Thomas, Michael
2010-01-01
Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been considered, e.g., extension with default rules, extension with modal belief operators, or modification of the semantics. In this survey we consider a logical formalism from each of the above possibilities, namely Reiter's default logic, Moore's autoepistemic logic and McCarthy's circumscription. Additionally, we consider abduction, where one is not interested in inferences from a given knowledge base but in computing possible explanations for an observation with respect to a given knowledge base. Complexity results for different reasoning tasks for propositional variants of these logics have been studied already in the nineties. In recent years, however, a renewed interest in complexity issues can be observed. One current focal approach is to consider parameterized problems and ...
Linear Inviscid Damping for Monotone Shear Flows
Zillinger, Christian
2014-01-01
In this article we prove linear stability, inviscid damping and scattering of the 2D Euler equations around regular, strictly monotone shear flows $(U(y),0)$ in a periodic channel under Sobolev perturbations. We treat the settings of an infinite channel, $\\mathbb{T} \\times \\mathbb{R}$, as well as a finite channel, $\\mathbb{T} \\times [0,1]$, with impermeable boundary. We first prove inviscid damping with optimal algebraic rates for strictly monotone shear flows under the assumption of controlling the regularity of the scattered vorticity. Subsequently, we establish linear stability of the scattering equation in Sobolev spaces under perturbations which are of not too large wave-length with respect to $x$, depending on $U''$.
Improved selection in totally monotone arrays
Energy Technology Data Exchange (ETDEWEB)
Mansour, Y. (Harvard Univ., Cambridge, MA (United States). Aiken Computation Lab.); Park, J.K. (Sandia National Labs., Albuquerque, NM (United States)); Schieber, B. (International Business Machines Corp., Yorktown Heights, NY (United States). Thomas J. Watson Research Center); Sen, S. (AT and T Bell Labs., Murray Hill, NJ (United States))
1991-01-01
This paper's main result is an O(({radical}{bar m}lgm)(n lg n) + mlg n)-time algorithm for computing the kth smallest entry in each row of an m {times} n totally monotone array. (A two-dimensional A = a(i,j) is totally monotone if for all i{sub 1} < i{sub 2} and j{sub 1} < j{sup 2}, < a(i{sub 1},j{sub 2}) implies a(i{sub 2},j{sub 1})). For large values of k (in particular, for k=(n/2)), this algorithm is significantly faster than the O(k(m+n))-time algorithm for the same problem due to Kravets and Park. An immediate consequence of this result is an O(n{sup 3/2} lg{sup 2}n)-time algorithm for computing the kth nearest neighbor of each vertex of a convex n-gon. In addition to the main result, we also give an O(n lg m)-time algorithm for computing an approximate median in each row of an m {times} n totally monotone array; this approximate median is an entry whose rank in its row lies between (n/4) and (3n/4) {minus} 1. 20 refs., 3 figs.
Edit Distance to Monotonicity in Sliding Windows
Chan, Ho-Leung; Lee, Lap-Kei; Pan, Jiangwei; Ting, Hing-Fung; Zhang, Qin
2011-01-01
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decreasing with respect to the numerical value. The space complexity of estimating the edit distance to monotonicity of a data stream is becoming well-understood over the past few years. Motivated by applications on network quality monitoring, we extend the study to estimating the edit distance to monotonicity of a sliding window covering the $w$ most recent items in the stream for any $w \\ge 1$. We give a deterministic algorithm which can return an estimate within a factor of $(4+\\eps)$ using $O(\\frac{1}{\\eps^2} \\log^2(\\eps w))$ space. We also extend the study in two directions. First, we consider a stream where each item is associated with a value from a partial ordered set. We give a randomized $(4+\\epsilon)$-approximate algorithm using $O(\\frac{1}{\\epsilon^2} \\log \\epsilon^2 w \\log w)$ space. Second, we consider an out-of-order strea...
Weak monotonicity inequality and partial regularity for harmonic maps
Institute of Scientific and Technical Information of China (English)
沈尧天; 严树森
1999-01-01
The notion of locally weak monotonicity inequality for weakly harmonic maps is introduced and various results on this class of maps are obtained. For example, the locally weak monotonicity inequality is nearly equivalent to the ε-regularity.
Monotonic Loading of Circular Surface Footings on Clay
DEFF Research Database (Denmark)
Ibsen, Lars Bo; Barari, Amin
2011-01-01
Appropriate modeling of offshore foundations under monotonic loading is a significant challenge in geotechnical engineering. This paper reports experimental and numerical analyses, specifically investigating the response of circular surface footings during monotonic loading and elastoplastic beha...
Harnessing piecewise-linear systems to construct dynamic logic architecture.
Peng, Haipeng; Yang, Yixian; Li, Lixiang; Luo, Hong
2008-09-01
This paper explores piecewise-linear systems to construct dynamic logic architecture. We present three schemes to obtain various basic logic gates, adders, and memory by using piecewise-linear systems. These schemes can switch easily among different operational roles by changing parameters. The proposed schemes are computationally efficient and easy to use. It is convenient for us to study and analyze them with the theory of linear systems.
A prototype piecewise-linear dynamic attenuator
Hsieh, Scott S.; Peng, Mark V.; May, Christopher A.; Shunhavanich, Picha; Fleischmann, Dominik; Pelc, Norbert J.
2016-07-01
The piecewise-linear dynamic attenuator has been proposed as a mechanism in CT scanning for personalizing the x-ray illumination on a patient- and application-specific basis. Previous simulations have shown benefits in image quality, scatter, and dose objectives. We report on the first prototype implementation. This prototype is reduced in scale and speed and is integrated into a tabletop CT system with a smaller field of view (25 cm) and longer scan time (42 s) compared to a clinical system. Stainless steel wedges were machined and affixed to linear actuators, which were in turn held secure by a frame built using rapid prototyping technologies. The actuators were computer-controlled, with characteristic noise of about 100 microns. Simulations suggest that in a clinical setting, the impact of actuator noise could lead to artifacts of only 1 HU. Ring artifacts were minimized by careful design of the wedges. A water beam hardening correction was applied and the scan was collimated to reduce scatter. We scanned a 16 cm water cylinder phantom as well as an anthropomorphic pediatric phantom. The artifacts present in reconstructed images are comparable to artifacts normally seen with this tabletop system. Compared to a flat-field reference scan, increased detectability at reduced dose is shown and streaking is reduced. Artifacts are modest in our images and further refinement is possible. Issues of mechanical speed and stability in the challenging clinical CT environment will be addressed in a future design.
A-monotonicity and applications to nonlinear variational inclusion problems
Directory of Open Access Journals (Sweden)
Ram U. Verma
2004-01-01
Full Text Available A new notion of the A-monotonicity is introduced, which generalizes the H-monotonicity. Since the A-monotonicity originates from hemivariational inequalities, and hemivariational inequalities are connected with nonconvex energy functions, it turns out to be a useful tool proving the existence of solutions of nonconvex constrained problems as well.
On the strong monotonicity of the CABARET scheme
Ostapenko, V. V.
2012-03-01
The strong monotonicity of the CABARET scheme with single flux correction is analyzed as applied to the linear advection equation. It is shown that the scheme is strongly monotone (has the NED property) at Courant numbers r ∈ (0,0,5), for which it is monotone. Test computations illustrating this property of the CABARET scheme are presented.
Testing Manifest Monotonicity Using Order-Constrained Statistical Inference
Tijmstra, Jesper; Hessen, David J.; van der Heijden, Peter G. M.; Sijtsma, Klaas
2013-01-01
Most dichotomous item response models share the assumption of latent monotonicity, which states that the probability of a positive response to an item is a nondecreasing function of a latent variable intended to be measured. Latent monotonicity cannot be evaluated directly, but it implies manifest monotonicity across a variety of observed scores,…
Wehrl entropy, Lieb conjecture and entanglement monotones
Mintert, F; Mintert, Florian; Zyczkowski, Karol
2004-01-01
We propose to quantify the entanglement of pure states of $N \\times N$ bipartite quantum system by defining its Husimi distribution with respect to $SU(N)\\times SU(N)$ coherent states. The Wehrl entropy is minimal if and only if the pure state analyzed is separable. The excess of the Wehrl entropy is shown to be equal to the subentropy of the mixed state obtained by partial trace of the bipartite pure state. This quantity, as well as the generalized (R{\\'e}nyi) subentropies, are proved to be Schur--convex, so they are entanglement monotones and may be used as alternative measures of entanglement.
Topological recursion and a quantum curve for monotone Hurwitz numbers
Do, Norman; Dyer, Alastair; Mathews, Daniel V.
2017-10-01
Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In this paper, we prove that monotone Hurwitz numbers arise from the topological recursion of Eynard and Orantin applied to a particular spectral curve. We furthermore derive a quantum curve for monotone Hurwitz numbers. These results extend the collection of enumerative problems known to be governed by the paradigm of topological recursion and quantum curves, as well as the list of analogues between monotone Hurwitz numbers and their classical counterparts.
The Monotonicity Puzzle: An Experimental Investigation of Incentive Structures
Directory of Open Access Journals (Sweden)
Jeannette Brosig
2010-05-01
Full Text Available Non-monotone incentive structures, which - according to theory - are able to induce optimal behavior, are often regarded as empirically less relevant for labor relationships. We compare the performance of a theoretically optimal non-monotone contract with a monotone one under controlled laboratory conditions. Implementing some features relevant to real-world employment relationships, our paper demonstrates that, in fact, the frequency of income-maximizing decisions made by agents is higher under the monotone contract. Although this observed behavior does not change the superiority of the non-monotone contract for principals, they do not choose this contract type in a significant way. This is what we call the monotonicity puzzle. Detailed investigations of decisions provide a clue for solving the puzzle and a possible explanation for the popularity of monotone contracts.
Piecewise nonlinear image registration using DCT basis functions
Gan, Lin; Agam, Gady
2015-03-01
The deformation field in nonlinear image registration is usually modeled by a global model. Such models are often faced with the problem that a locally complex deformation cannot be accurately modeled by simply increasing degrees of freedom (DOF). In addition, highly complex models require additional regularization which is usually ineffective when applied globally. Registering locally corresponding regions addresses this problem in a divide and conquer strategy. In this paper we propose a piecewise image registration approach using Discrete Cosine Transform (DCT) basis functions for a nonlinear model. The contributions of this paper are three-folds. First, we develop a multi-level piecewise registration framework that extends the concept of piecewise linear registration and works with any nonlinear deformation model. This framework is then applied to nonlinear DCT registration. Second, we show how adaptive model complexity and regularization could be applied for local piece registration, thus accounting for higher variability. Third, we show how the proposed piecewise DCT can overcome the fundamental problem of a large curvature matrix inversion in global DCT when using high degrees of freedoms. The proposed approach can be viewed as an extension of global DCT registration where the overall model complexity is increased while achieving effective local regularization. Experimental evaluation results provide comparison of the proposed approach to piecewise linear registration using an affine transformation model and a global nonlinear registration using DCT model. Preliminary results show that the proposed approach achieves improved performance.
Convex functions, monotone operators and differentiability
Phelps, Robert R
1989-01-01
These notes start with an introduction to the differentiability of convex functions on Banach spaces, leading to the study of Asplund spaces and their intriguing relationship to monotone operators (and more general set-values maps) and Banach spaces with the Radon-Nikodym property. While much of this is classical, some of it is presented using streamlined proofs which were not available until recently. Considerable attention is paid to contemporary results on variational principles and perturbed optimization in Banach spaces, exhibiting their close connections with Asplund spaces. An introductory course in functional analysis is adequate background for reading these notes which can serve as the basis for a seminar of a one-term graduate course. There are numerous excercises, many of which form an integral part of the exposition.
Generalized convexity, generalized monotonicity recent results
Martinez-Legaz, Juan-Enrique; Volle, Michel
1998-01-01
A function is convex if its epigraph is convex. This geometrical structure has very strong implications in terms of continuity and differentiability. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Here again, the geo metrical structure of the level sets implies some continuity and differentiability properties for quasiconvex functions. Optimality conditions and duality can be derived for optimization problems involving such functions as well. Over a period of about fifty years, quasiconvex and other generalized convex functions have been considered in a variety of fields including economies, man agement science, engineering, probability and applied sciences in accordance with the need of particular applications. During the last twenty-five years, an increase of research activities in this field has been witnessed. More recently generalized monotonicity of maps has been studied. It relates to generalized conve...
Piecewise Filter of Infrared Image Based on Moment Theory
Institute of Scientific and Technical Information of China (English)
GAO Yang; LI Yan-jun; ZHANG Ke
2007-01-01
The disadvantages of IR images mostly include high noise, blurry edge and so on. The characteristics make the existent smoothing methods ineffective in preserving edge. To solve this problem, a piecewise moment filter (PMF) is put forward. By using moment and piecewise linear theory, the filter can preserve edge. Based on the statistical model of random noise, a related-coefficient method is presented to estimate the variance of noise. The edge region and model are then detected by the estimated variance. The expectation of first-order derivatives is used in getting the reliable offset of edge.At last, a fast moment filter of double-stair edge model is used to gain the piecewise smoothing results and reduce the calculation. The experimental result shows that the new method has a better capability than other methods in suppressing noise and preserving edge.
RESERVOIR DESCRIPTION BY USING A PIECEWISE CONSTANT LEVEL SET METHOD
Institute of Scientific and Technical Information of China (English)
Hongwei Li; Xuecheng Tai; Sigurd Ivar Aanonsen
2008-01-01
We consider the permeability estimation problem in two-phase porous media flow. We try to identify the permeability field by utilizing both the production data from wells as well as inverted seismic data. The permeability field is assumed to be piecewise constant, or can be approximated well by a piecewise constant function. A variant of the level set method, called Piecewise Constant Level Set Method is used to represent the interfaces between the regions with different permeability levels. The inverse problem is solved by minimizing a functional, and TV norm regularization is used to deal with the ill-posedness. We also use the operator-splitting technique to decompose the constraint term from the fidelity term. This gives us more flexibility to deal with the constraint and helps to stabilize the algorithm.
Piecewise-linearized methods for oscillators with limit cycles
Energy Technology Data Exchange (ETDEWEB)
Ramos, J.I. [Room I-320-D, E.T.S. Ingenieros Industriales, Universidad de Malaga, Plaza El Ejido, s/n 29013 Malaga (Spain)] e-mail: jirs@lcc.uma.es
2006-03-01
A piecewise linearization method based on the linearization of nonlinear ordinary differential equations in small intervals, that provides piecewise analytical solutions in each interval and smooth solutions everywhere, is developed for the study of the limit cycles of smooth and non-smooth, conservative and non-conservative, nonlinear oscillators. It is shown that this method provides nonlinear maps for the displacement and velocity which depend on the previous values through the nonlinearity and its partial derivatives with respect to time, displacement and velocity, and yields non-standard finite difference formulae. It is also shown by means of five examples that the piecewise linearization method presented here is more robust and yields more accurate (in terms of displacement, energy and frequency) solutions than the harmonic balance procedure, the method of slowly varying amplitude and phase, and other non-standard finite difference equations.
Continuous Approximations of a Class of Piecewise Continuous Systems
Danca, Marius-F.
In this paper, we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piecewise continuous functions. By using techniques from the theory of differential inclusions, the underlying piecewise functions can be locally or globally approximated. The approximation results can be used to model piecewise continuous-time dynamical systems of integer or fractional-order. In this way, by overcoming the lack of numerical methods for differential equations of fractional-order with discontinuous right-hand side, unattainable procedures for systems modeled by this kind of equations, such as chaos control, synchronization, anticontrol and many others, can be easily implemented. Several examples are presented and three comparative applications are studied.
Existence of homoclinic connections in continuous piecewise linear systems.
Carmona, Victoriano; Fernández-Sánchez, Fernando; García-Medina, Elisabeth; Teruel, Antonio E
2010-03-01
Numerical methods are often used to put in evidence the existence of global connections in differential systems. The principal reason is that the corresponding analytical proofs are usually very complicated. In this work we give an analytical proof of the existence of a pair of homoclinic connections in a continuous piecewise linear system, which can be considered to be a version of the widely studied Michelson system. Although the computations developed in this proof are specific to the system, the techniques can be extended to other piecewise linear systems.
Virtual estimator for piecewise linear systems based on observability analysis.
Morales-Morales, Cornelio; Adam-Medina, Manuel; Cervantes, Ilse; Vela-Valdés, Luis G; Beltrán, Carlos Daniel García
2013-02-27
This article proposes a virtual sensor for piecewise linear systems based on observability analysis that is in function of a commutation law related with the system's outpu. This virtual sensor is also known as a state estimator. Besides, it presents a detector of active mode when the commutation sequences of each linear subsystem are arbitrary and unknown. For the previous, this article proposes a set of virtual estimators that discern the commutation paths of the system and allow estimating their output. In this work a methodology in order to test the observability for piecewise linear systems with discrete time is proposed. An academic example is presented to show the obtained results.
Virtual Estimator for Piecewise Linear Systems Based on Observability Analysis
Morales-Morales, Cornelio; Adam-Medina, Manuel; Cervantes, Ilse; Vela-Valdés and, Luis G.; García Beltrán, Carlos Daniel
2013-01-01
This article proposes a virtual sensor for piecewise linear systems based on observability analysis that is in function of a commutation law related with the system's outpu. This virtual sensor is also known as a state estimator. Besides, it presents a detector of active mode when the commutation sequences of each linear subsystem are arbitrary and unknown. For the previous, this article proposes a set of virtual estimators that discern the commutation paths of the system and allow estimating their output. In this work a methodology in order to test the observability for piecewise linear systems with discrete time is proposed. An academic example is presented to show the obtained results. PMID:23447007
An analogue of Polya's theorem for piecewise holomorphic functions
Buslaev, V. I.
2015-12-01
A well-known result due to Polya for a function given by its holomorphic germ at z=∞ is extended to the case of a piecewise holomorphic function on an arbitrary compact set in \\overline{ C}. This result is applied to the problem of the existence of compact sets that have the minimum transfinite diameter in the external field of the logarithmic potential of a negative unit charge among all compact sets such that a certain multivalued analytic function is single-valued and piecewise holomorphic on their complement. Bibliography: 13 titles.
Stability of dynamical systems on the role of monotonic and non-monotonic Lyapunov functions
Michel, Anthony N; Liu, Derong
2015-01-01
The second edition of this textbook provides a single source for the analysis of system models represented by continuous-time and discrete-time, finite-dimensional and infinite-dimensional, and continuous and discontinuous dynamical systems. For these system models, it presents results which comprise the classical Lyapunov stability theory involving monotonic Lyapunov functions, as well as corresponding contemporary stability results involving non-monotonicLyapunov functions.Specific examples from several diverse areas are given to demonstrate the applicability of the developed theory to many important classes of systems, including digital control systems, nonlinear regulator systems, pulse-width-modulated feedback control systems, and artificial neural networks. The authors cover the following four general topics: - Representation and modeling of dynamical systems of the types described above - Presentation of Lyapunov and Lagrange stability theory for dynamical sy...
Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
Hundsdorfer, W.
2011-04-29
In this paper nonlinear monotonicity and boundedness properties are analyzed for linear multistep methods. We focus on methods which satisfy a weaker boundedness condition than strict monotonicity for arbitrary starting values. In this way, many linear multistep methods of practical interest are included in the theory. Moreover, it will be shown that for such methods monotonicity can still be valid with suitable Runge-Kutta starting procedures. Restrictions on the stepsizes are derived that are not only sufficient but also necessary for these boundedness and monotonicity properties. © 2011 Springer Science+Business Media, LLC.
On the monotonicity of multidimensional finite difference schemes
Kovyrkina, O.; Ostapenko, V.
2016-10-01
The classical concept of monotonicity, introduced by Godunov for linear one-dimensional difference schemes, is extended to multidimensional case. Necessary and sufficient conditions of monotonicity are obtained for linear multidimensional difference schemes of first order. The constraints on the numerical viscosity are given that ensure the monotonicity of a difference scheme in the multidimensional case. It is proposed a modification of the second order multidimensional CABARET scheme that preserves the monotonicity of one-dimensional discrete solutions and, as a result, ensures higher smoothness in the computation of multidimensional discontinuous solutions. The results of two-dimensional test computations illustrating the advantages of the modified CABARET scheme are presented.
Limit Cycles and Bifurcation in Piecewise-Analytic Systems: 1. General Theory
Banks, S.P.; Khathur, Saadi. A.
1989-01-01
The existence of limit cycles and periodic doubling bifurcations in piecewise-linear and piecewise-analytic systems is studied. Some theoretical sufficient conditions are obtained directly in terms of the right hand sided of the system.
Development and evaluation of the piecewise Prony method for evoked potential analysis.
Garoosi, V; Jansen, B H
2000-12-01
A new method is presented to decompose nonstationary signals into a summation of oscillatory components with time varying frequency, amplitude, and phase characteristics. This method, referred to as piecewise Prony method (PPM), is an improvement over the classical Prony method, which can only deal with signals containing components with fixed frequency, amplitude and phase, and monotonically increasing or decreasing rate of change. PPM allows the study of the temporal profile of post-stimulus signal changes in single-trial evoked potentials (EPs), which can lead to new insights in EP generation. We have evaluated this method on simulated data to test its limitations and capabilities, and also on single-trial EPs. The simulation experiments showed that the PPM can detect amplitude changes as small as 10%, rate changes as small as 10%, and 0.15 Hz of frequency changes. The capabilities of the PPM were demonstrated using single electroencephalogram/EP trials of flash visual EPs recorded from one normal subject. The trial-by-trial results confirmed that the stimulation drastically attenuates the alpha activity shortly after stimulus presentation, with the alpha activity returning about 0.5 s later. The PPM results also provided evidence that delta activity undergoes phase alignment following stimulus presentation.
Characterization of well-posedness of piecewise linear systems
Imura, J.-I.; Schaft, van der A.J.
1998-01-01
One of the basic issues in the study of hybrid systems is the well-posedness (existence and uniqueness of solutions) problem of discontinuous dynamical systems. This paper addresses this problem for a class of piecewise-linear discontinuous systems under the definition of solutions of Carath\\'eodory
Characterization of well-posedness of piecewise linear systems
Imura, Jun-ichi; Schaft, van der Arjan
2000-01-01
One of the basic issues in the study of hybrid systems is the well-posedness (existence and uniqueness of solutions) problem of discontinuous dynamical systems. The paper addresses this problem for a class of piecewise-linear discontinuous systems under the definition of solutions of Caratheodory. T
Characterization of Well-Posedness of Piecewise-Linear Systems
Imura, Jun-ichi; Schaft, Arjan van der
2000-01-01
One of the basic issues in the study of hybrid systems is the well-posedness (existence and uniqueness of solutions) problem of discontinuous dynamical systems. The paper addresses this problem for a class of piecewise-linear discontinuous systems under the definition of solutions of Carathéodory. T
On the dynamic analysis of piecewise-linear networks
Heemels, WPMH; Camlibel, MK; Schumacher, JM
2002-01-01
Piecewise-linear (PL) modeling is often used to approximate the behavior of nonlinear circuits. One of the possible PL modeling methodologies is based on the linear complementarity problem, and this approach has already been used extensively in the circuits and systems community for static networks.
Combinatorial Vector Fields for Piecewise Affine Control Systems
DEFF Research Database (Denmark)
Wisniewski, Rafal; Larsen, Jesper Abildgaard
2008-01-01
This paper is intended to be a continuation of Habets and van Schuppen (2004) and Habets, Collins and van Schuppen (2006), which address the control problem for piecewise-affine systems on an arbitrary polytope or a family of these. Our work deals with the underlying combinatorics of the underlyi...
Safety Verification of Piecewise-Deterministic Markov Processes
DEFF Research Database (Denmark)
Wisniewski, Rafael; Sloth, Christoffer; Bujorianu, Manuela
2016-01-01
We consider the safety problem of piecewise-deterministic Markov processes (PDMP). These are systems that have deterministic dynamics and stochastic jumps, where both the time and the destination of the jumps are stochastic. Specifically, we solve a p-safety problem, where we identify the set...
A family of quantization based piecewise linear filter networks
DEFF Research Database (Denmark)
Sørensen, John Aasted
1992-01-01
A family of quantization-based piecewise linear filter networks is proposed. For stationary signals, a filter network from this family is a generalization of the classical Wiener filter with an input signal and a desired response. The construction of the filter network is based on quantization of...
Monotone measures of ergodicity for Markov chains
Directory of Open Access Journals (Sweden)
J. Keilson
1998-01-01
Full Text Available The following paper, first written in 1974, was never published other than as part of an internal research series. Its lack of publication is unrelated to the merits of the paper and the paper is of current importance by virtue of its relation to the relaxation time. A systematic discussion is provided of the approach of a finite Markov chain to ergodicity by proving the monotonicity of an important set of norms, each measures of egodicity, whether or not time reversibility is present. The paper is of particular interest because the discussion of the relaxation time of a finite Markov chain [2] has only been clean for time reversible chains, a small subset of the chains of interest. This restriction is not present here. Indeed, a new relaxation time quoted quantifies the relaxation time for all finite ergodic chains (cf. the discussion of Q1(t below Equation (1.7]. This relaxation time was developed by Keilson with A. Roy in his thesis [6], yet to be published.
Remarks on a monotone Markov chain
Directory of Open Access Journals (Sweden)
P. Todorovic
1987-01-01
Full Text Available In applications, considerations on stochastic models often involve a Markov chain {ζn}0∞ with state space in R+, and a transition probability Q. For each x R+ the support of Q(x,. is [0,x]. This implies that ζ0≥ζ1≥…. Under certain regularity assumptions on Q we show that Qn(x,Bu→1 as n→∞ for all u>0 and that 1−Qn(x,Bu≤[1−Q(x,Bu]n where Bu=[0,u. Set τ0=max{k;ζk=ζ0}, τn=max{k;ζk=ζτn−1+1} and write Xn=ζτn−1+1, Tn=τn−τn−1. We investigate some properties of the imbedded Markov chain {Xn}0∞ and of {Tn}0∞. We determine all the marginal distributions of {Tn}0∞ and show that it is asymptotically stationary and that it possesses a monotonicity property. We also prove that under some mild regularity assumptions on β(x=1−Q(x,Bx, ∑1n(Ti−a/bn→dZ∼N(0,1.
Robust Monotone Iterates for Nonlinear Singularly Perturbed Boundary Value Problems
Directory of Open Access Journals (Sweden)
Boglaev Igor
2009-01-01
Full Text Available This paper is concerned with solving nonlinear singularly perturbed boundary value problems. Robust monotone iterates for solving nonlinear difference scheme are constructed. Uniform convergence of the monotone methods is investigated, and convergence rates are estimated. Numerical experiments complement the theoretical results.
Regularization and Iterative Methods for Monotone Variational Inequalities
Directory of Open Access Journals (Sweden)
Xiubin Xu
2010-01-01
Full Text Available We provide a general regularization method for monotone variational inequalities, where the regularizer is a Lipschitz continuous and strongly monotone operator. We also introduce an iterative method as discretization of the regularization method. We prove that both regularization and iterative methods converge in norm.
LIMITED MEMORY BFGS METHOD FOR NONLINEAR MONOTONE EQUATIONS
Institute of Scientific and Technical Information of China (English)
Weijun Zhou; Donghui Li
2007-01-01
In this paper, we propose an algorithm for solving nonlinear monotone equations by combining the limited memory BFGS method (L-BFGS) with a projection method. We show that the method is globally convergent if the equation involves a Lipschitz continuous monotone function. We also present some preliminary numerical results.
Monotone complete C*-algebras and generic dynamics
Saitô, Kazuyuki
2015-01-01
This monograph is about monotone complete C*-algebras, their properties and the new classification theory. A self-contained introduction to generic dynamics is also included because of its important connections to these algebras. Our knowledge and understanding of monotone complete C*-algebras has been transformed in recent years. This is a very exciting stage in their development, with much discovered but with many mysteries to unravel. This book is intended to encourage graduate students and working mathematicians to attack some of these difficult questions. Each bounded, upward directed net of real numbers has a limit. Monotone complete algebras of operators have a similar property. In particular, every von Neumann algebra is monotone complete but the converse is false. Written by major contributors to this field, Monotone Complete C*-algebras and Generic Dynamics takes readers from the basics to recent advances. The prerequisites are a grounding in functional analysis, some point set topology and an eleme...
Demetriou, I. C.
2002-09-01
Methods are presented for least squares data smoothing by using the signs of divided differences of the smoothed values. Professor M.J.D. Powell initiated the subject in the early 1980s and since then, theory, algorithms and FORTRAN software make it applicable to several disciplines in various ways. Let us consider n data measurements of a univariate function which have been altered by random errors. Then it is usual for the divided differences of the measurements to show sign alterations, which are probably due to data errors. We make the least sum of squares change to the measurements, by requiring the sequence of divided differences of order m to have at most q sign changes for some prescribed integer q. The positions of the sign changes are integer variables of the optimization calculation, which implies a combinatorial problem whose solution can require about O(nq) quadratic programming calculations in n variables and n-m constraints. Suitable methods have been developed for the following cases. It has been found that a dynamic programming procedure can calculate the global minimum for the important cases of piecewise monotonicity m=1,q[greater-or-equal, slanted]1 and piecewise convexity/concavity m=2,q[greater-or-equal, slanted]1 of the smoothed values. The complexity of the procedure in the case of m=1 is O(n2+qn log2 n) computer operations, while it is reduced to only O(n) when q=0 (monotonicity) and q=1 (increasing/decreasing monotonicity). The case m=2,q[greater-or-equal, slanted]1 requires O(qn2) computer operations and n2 quadratic programming calculations, which is reduced to one and n-2 quadratic programming calculations when m=2,q=0, i.e. convexity, and m=2,q=1, i.e. convexity/concavity, respectively. Unfortunately, the technique that receives this efficiency cannot generalize for the highly nonlinear case m[greater-or-equal, slanted]3,q[greater-or-equal, slanted]2. However, the case m[greater-or-equal, slanted]3,q=0 is solved by a special strictly
The Number of Monotone and Self-Dual Boolean Functions
Directory of Open Access Journals (Sweden)
Haviarova L.
2014-12-01
Full Text Available In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Ratio Monotonicity of Polynomials Derived from Nondecreasing Sequences
Chen, William Y C; Zhou, Elaine L F
2010-01-01
The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of P(x+c) for any $c\\geq 1$ due to Llamas and Mart\\'{\\i}nez-Bernal. As a consequence, we obtain the ratio monotonicity of the Boros-Moll polynomials obtained by Chen and Xia without resorting to the recurrence relations of the coefficients.
Piecewise linear and Boolean models of chemical reaction networks
Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir
2014-01-01
Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions (xn/(Jn + xn)). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent n is large. However, while the case of small constant J appears in practice, it is not well understood. We provide a mathematical analysis of this limit, and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator. PMID:25412739
Discretization of Fractional Differential Equations by a Piecewise Constant Approximation
Angstmann, Christopher N; McGann, Anna V
2016-01-01
There has recently been considerable interest in using a nonstandard piecewise approximation to formulate fractional order differential equations as difference equations that describe the same dynamical behaviour and are more amenable to a dynamical systems analysis. Unfortunately, due to mistakes in the fundamental papers, the difference equations formulated through this process do not capture the dynamics of the fractional order equations. We show that the correct application of this nonstandard piecewise approximation leads to a one parameter family of fractional order differential equations that converges to the original equation as the parameter tends to zero. A closed formed solution exists for each member of this family and leads to the formulation of a difference equation that is of increasing order as time steps are taken. Whilst this does not lead to a simplified dynamical analysis it does lead to a numerical method for solving the fractional order differential equation. The method is shown to be eq...
Piecewise quartic polynomial curves with a local shape parameter
Han, Xuli
2006-10-01
Piecewise quartic polynomial curves with a local shape parameter are presented in this paper. The given blending function is an extension of the cubic uniform B-splines. The changes of a local shape parameter will only change two curve segments. With the increase of the value of a shape parameter, the curves approach a corresponding control point. The given curves possess satisfying shape-preserving properties. The given curve can also be used to interpolate locally the control points with GC2 continuity. Thus, the given curves unify the representation of the curves for interpolating and approximating the control polygon. As an application, the piecewise polynomial curves can intersect an ellipse at different knot values by choosing the value of the shape parameter. The given curve can approximate an ellipse from the both sides and can then yield a tight envelope for an ellipse. Some computing examples for curve design are given.
A 3D Facial Expression Tracking Method Using Piecewise Deformations
Directory of Open Access Journals (Sweden)
Jing Chi
2013-02-01
Full Text Available We present a new fast method for 3D facial expression tracking based on piecewise non-rigid deformations. Our method takes as input a video-rate sequence of face meshes that record the shape and time-varying expressions of a human face, and deforms a source mesh to match each input mesh to output a new mesh sequence with the same connectivity that reflects the facial shape and expressional variations. In mesh matching, we automatically segment the source mesh and estimate a non-rigid transformation for each segment to approximate the input mesh closely. Piecewise non-rigid transformation significantly reduces computational complexity and improves tracking speed because it greatly decreases the unknowns to be estimated. Our method can also achieve desired tracking accuracy because segmentation can be adjusted automatically and flexibly to approximate arbitrary deformations on the input mesh. Experiments demonstrate the efficiency of our method.
Piecewise linear and Boolean models of chemical reaction networks.
Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir
2014-12-01
Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.
Virtual Estimator for Piecewise Linear Systems Based on Observability Analysis
Directory of Open Access Journals (Sweden)
Ilse Cervantes
2013-02-01
Full Text Available This article proposes a virtual sensor for piecewise linear systems based on observability analysis that is in function of a commutation law related with the system’s outpu. This virtual sensor is also known as a state estimator. Besides, it presents a detector of active mode when the commutation sequences of each linear subsystem are arbitrary and unknown. For the previous, this article proposes a set of virtual estimators that discern the commutation paths of the system and allow estimating their output. In this work a methodology in order to test the observability for piecewise linear systems with discrete time is proposed. An academic example is presented to show the obtained results.
Border Collision Bifurcations in Two Dimensional Piecewise Smooth Maps
Banerjee, S; Banerjee, Soumitro; Grebogi, Celso
1999-01-01
Recent investigations on the bifurcations in switching circuits have shown that many atypical bifurcations can occur in piecewise smooth maps which can not be classified among the generic cases like saddle-node, pitchfork or Hopf bifurcations occurring in smooth maps. In this paper we first present experimental results to establish the theoretical problem: the development of a theory and classification of the new type of bifurcations resulting from border collision. We then present a systematic analysis of such bifurcations by deriving a normal form --- the piecewise linear approximation in the neighborhood of the border. We show that there can be eleven qualitatively different types of border collision bifurcations depending on the parameters of the normal form, and these are classified under six cases. We present a partitioning of the parameter space of the normal form showing the regions where different types of bifurcations occur. This theoretical framework will help in explaining bifurcations in all syst...
Algebraic reconstruction of piecewise-smooth functions from integral measurements
Batenkov, Dmitry; Yomdin, Yosef
2011-01-01
This paper presents some results on a well-known problem in Algebraic Signal Sampling and in other areas of applied mathematics: reconstruction of piecewise-smooth functions from their integral measurements (like moments, Fourier coefficients, Radon transform, etc.). Our results concern reconstruction (from the moments or Fourier coefficients) of signals in two specific classes: linear combinations of shifts of a given function, and "piecewise $D$-finite functions" which satisfy on each continuity interval a linear differential equation with polynomial coefficients. In each case the problem is reduced to a solution of a certain type of non-linear algebraic system of equations ("Prony-type system"). We recall some known methods for explicitly solving such systems in one variable, and provide extensions to some multi-dimensional cases. Finally, we investigate the local stability of solving the Prony-type systems.
Rectification of aerial images using piecewise linear transformation
Liew, L. H.; Lee, B. Y.; Wang, Y. C.; Cheah, W. S.
2014-02-01
Aerial images are widely used in various activities by providing visual records. This type of remotely sensed image is helpful in generating digital maps, managing ecology, monitoring crop growth and region surveying. Such images could provide insight into areas of interest that have lower altitude, particularly in regions where optical satellite imaging is prevented due to cloudiness. Aerial images captured using a non-metric cameras contain real details of the images as well as unexpected distortions. Distortions would affect the actual length, direction and shape of objects in the images. There are many sources that could cause distortions such as lens, earth curvature, topographic relief and the attitude of the aircraft that is used to carry the camera. These distortions occur differently, collectively and irregularly in the entire image. Image rectification is an essential image pre-processing step to eliminate or at least reduce the effect of distortions. In this paper, a non-parametric approach with piecewise linear transformation is investigated in rectifying distorted aerial images. The non-parametric approach requires a set of corresponding control points obtained from a reference image and a distorted image. The corresponding control points are then applied with piecewise linear transformation as geometric transformation. Piecewise linear transformation divides the image into regions by triangulation. Different linear transformations are employed separately to triangular regions instead of using a single transformation as the rectification model for the entire image. The result of rectification is evaluated using total root mean square error (RMSE). Experiments show that piecewise linear transformation could assist in improving the limitation of using global transformation to rectify images.
A spectral gap for transer operators of piecewise expanding maps
Thomine, Damien
2010-01-01
We provide a simplified proof of the existence, under some assumptions, of a spectral gap for the Perron-Frobenius operator of piecewise uniformly expanding maps on Riemannian manifolds when acting on some Sobolev spaces. Its consequences include, among others, the existence of invariant physical measures, and an exponential decay of correlations for suitable observables. These features are then adapted to different function spaces (functions with bounded variation or bounded oscillation), so as to give a new insight of - and generalize - earlier results.
Bifurcations and Chaos in Time Delayed Piecewise Linear Dynamical Systems
Senthilkumar, D. V.; Lakshmanan, M.
2004-01-01
We reinvestigate the dynamical behavior of a first order scalar nonlinear delay differential equation with piecewise linearity and identify several interesting features in the nature of bifurcations and chaos associated with it as a function of the delay time and external forcing parameters. In particular, we point out that the fixed point solution exhibits a stability island in the two parameter space of time delay and strength of nonlinearity. Significant role played by transients in attain...
Considerations Related to Interpolation of Experimental Data Using Piecewise Functions
Directory of Open Access Journals (Sweden)
Stelian Alaci
2016-12-01
Full Text Available The paper presents a method for experimental data interpolation by means of a piecewise function, the points where the form of the function changes being found simultaneously with the other parameters utilized in an optimization criterion. The optimization process is based on defining the interpolation function using a single expression founded on the Heaviside function and regarding the optimization function as a generalised infinitely derivable function. The exemplification of the methodology is made via a tangible example.
Directory of Open Access Journals (Sweden)
Plubtieng Somyot
2009-01-01
Full Text Available Abstract We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
Directory of Open Access Journals (Sweden)
Somyot Plubtieng
2009-01-01
Full Text Available We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
On the Monotone Iterative Method for Set Valued Equation
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
This paper deals with the monotone iterative method for set- valued operator equation in ordered normed space. Some results for the case of single valued operator are generalized here, as an application, a discontinuous nonlinear differential equation problem is discussed.
Monotone method for initial value problem for fractional diffusion equation
Institute of Scientific and Technical Information of China (English)
ZHANG Shuqin
2006-01-01
Using the method of upper and lower solutions and its associated monotone iterative, consider the existence and uniqueness of solution of an initial value problem for the nonlinear fractional diffusion equation.
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
Kulik, Ariel; Tamir, Tami
2011-01-01
Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $\\alpha$-approximation algorithm for the continuous relaxation implies a randomized $(\\alpha - \\eps)$-approximation algorithm for the discrete problem. We use this relation to improve the best known approximation ratio for the problem to $1/4- \\eps$, for any $\\eps > 0$, and to obtain a nearly optimal $(1-e^{-1}-\\eps)-$approximation ratio for the monotone case, for any $\\eps>0$. We further show that the probabilistic domain ...
Action-Maslov Homomorphism for Monotone Symplectic Manifolds
Branson, Mark
2009-01-01
We explore conditions under which the action-Maslov homomorphism vanishes on monotone symplectic manifolds. Our strategy involves showing that the units in the quantum homology, and thus the Seidel element, have a very specific form. Then we use induction to show that other relevant Gromov-Witten invariants vanish. We prove that these conditions hold for monotone products of projective spaces and for the Grassmannian of 2-planes in $\\C^4$.
Completely monotonic functions related to logarithmic derivatives of entire functions
DEFF Research Database (Denmark)
Pedersen, Henrik Laurberg
2011-01-01
The logarithmic derivative l(x) of an entire function of genus p and having only non-positive zeros is represented in terms of a Stieltjes function. As a consequence, (-1)p(xml(x))(m+p) is a completely monotonic function for all m ≥ 0. This generalizes earlier results on complete monotonicity...... of functions related to Euler's psi-function. Applications to Barnes' multiple gamma functions are given....
Isotonicity of the projection onto the monotone cone
Németh, A B
2012-01-01
A wedge (i.e., a closed nonempty set in the Euclidean space stable under addition and multiplication with non-negative scalars) induces by a standard way a semi-order (a reflexive and transitive binary relation) in the space. The wedges admitting isotone metric projection with respect to the semi-order induced by them are characterized. The obtained result is used to show that the monotone wedge (called monotone cone in regression theory) admits isotone projection.
Monotonic loading of circular surface footings on clay
Energy Technology Data Exchange (ETDEWEB)
Ibsen, Lars Bo; Barari, Amin [Aalborg University, Aalborg (Denmark)
2011-12-15
Appropriate modeling of offshore foundations under monotonic loading is a significant challenge in geotechnical engineering. This paper reports experimental and numerical analyses, specifically investigating the response of circular surface footings during monotonic loading and elastoplastic behavior during reloading. By using the findings presented in this paper, it is possible to extend the model to simulate the vertical-load displacement response of offshore bucket foundations.
Convergence for pseudo monotone semiflows on product ordered topological spaces
Yi, Taishan; Huang, Lihong
In this paper, we consider a class of pseudo monotone semiflows, which only enjoy some weak monotonicity properties and are defined on product-ordered topological spaces. Under certain conditions, several convergence principles are established for each precompact orbit of such a class of semiflows to tend to an equilibrium, which improve and extend some corresponding results already known. Some applications to delay differential equations are presented.
Layered neural networks with non-monotonic transfer functions
Katayama, Katsuki; Sakata, Yasuo; Horiguchi, Tsuyoshi
2003-01-01
We investigate storage capacity and generalization ability for two types of fully connected layered neural networks with non-monotonic transfer functions; random patterns are embedded into the networks by a Hebbian learning rule. One of them is a layered network in which a non-monotonic transfer function of even layers is different from that of odd layers. The other is a layered network with intra-layer connections, in which the non-monotonic transfer function of inter-layer is different from that of intra-layer, and inter-layered neurons and intra-layered neurons are updated alternately. We derive recursion relations for order parameters for those layered networks by the signal-to-noise ratio method. We clarify that the storage capacity and the generalization ability for those layered networks are enhanced in comparison with those with a conventional monotonic transfer function when non-monotonicity of the transfer functions is selected optimally. We also point out that some chaotic behavior appears in the order parameters for the layered networks when non-monotonicity of the transfer functions increases.
Nther-type theorem of piecewise algebraic curves on triangulation
Institute of Scientific and Technical Information of China (English)
2007-01-01
The piecewise algebraic curve is a kind generalization of the classical algebraic curve. Nther-type theorem of piecewise algebraic curves on the cross-cut partition is very important to construct the Lagrange interpolation sets for a bivariate spline space.In this paper,using the properties of bivariate splines,the Nther-type theorem of piecewise algebraic curves on the arbitrary triangulation is presented.
Stability Analysis of Uncertain Discrete-Time Piecewise Linear Systems with Time Delays
Institute of Scientific and Technical Information of China (English)
Ou Ou; Hong-Bin Zhang; Jue-Bang Yu
2009-01-01
This paper considers the stability analysis of uncertain discrete-time piecewise linear systems with time delays based on piecewise Lyapunov-Krasovskii functionals. It is shown that the stability can be established for the control systems if there is a piecewise Lyapunov-Krasovskii functional, and moreover, the functional can be obtained by solving a set of linear matrix inequalities (LMIs) that are numerically feasible. A numerical example is given to demonstrate the efficiency and advantage of the proposed method.
N(o)ther-type theorem of piecewise algebraic curves on triangulation
Institute of Scientific and Technical Information of China (English)
Chun-gang ZHU; Ren-hong WANG
2007-01-01
The piecewise algebraic curve is a kind generalization of the classical algebraic curve.N(o)ther-type theorem of piecewise algebraic curves on the cross-cut partition is very important to construct the Lagrange interpolation sets for a bivariate spline space. In this paper, using the properties of bivariate splines, the N(o)ther-type theorem of piecewise algebraic curves on the arbitrary triangulation is presented.
Border-Collision Bifurcations and Chaotic Oscillations in a Piecewise-Smooth Dynamical System
DEFF Research Database (Denmark)
Zhusubaliyev, Z.T.; Soukhoterin, E.A.; Mosekilde, Erik
2002-01-01
Many problems of engineering and applied science result in the consideration of piecewise-smooth dynamical systems. Examples are relay and pulse-width control systems, impact oscillators, power converters, and various electronic circuits with piecewise-smooth characteristics. The subject...... of investigation in the present paper is the dynamical model of a constant voltage converter which represents a three-dimensional piecewise-smooth system of nonautonomous differential equations. A specific type of phenomena that arise in the dynamics of piecewise-smooth systems are the so-called border...
The Cayley-Bacharach Theorem for Continuous Piecewise Algebraic Curves over Cross-cut Triangulations
Institute of Scientific and Technical Information of China (English)
Renhong WANG; Shaofan WANG
2011-01-01
A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper,we propose the Cayley-Bacharach theorem for continuous piecewise algebraic curves over cross-cut triangulations.We show that,if two continuous piecewise algebraic curves of degrees m and n respectively meet at mnT distinct points over a cross-cut triangulation,where T denotes the number of cells of the triangulation,then any continuous piecewise algebraic curve of degree m + n - 2 containing all but one point of them also contains the last point.
Non-Zenoness of piecewise affine dynamical systems and affine complementarity systems with inputs
Institute of Scientific and Technical Information of China (English)
Le Quang THUAN
2014-01-01
In the context of continuous piecewise affine dynamical systems and affine complementarity systems with inputs, we study the existence of Zeno behavior, i.e., infinite number of mode transitions in a finite-length time interval, in this paper. The main result reveals that continuous piecewise affine dynamical systems with piecewise real-analytic inputs do not exhibit Zeno behavior. Applied the achieved result to affine complementarity systems with inputs, we also obtained a similar conclusion. A direct benefit of the main result is that one can apply smooth ordinary differential equations theory in a local manner for the analysis of continuous piecewise affine dynamical systems with inputs.
Driving performance impairments due to hypovigilance on monotonous roads.
Larue, Grégoire S; Rakotonirainy, Andry; Pettitt, Anthony N
2011-11-01
Drivers' ability to react to unpredictable events deteriorates when exposed to highly predictable and uneventful driving tasks. Highway design reduces the driving task mainly to a lane-keeping manoeuvre. Such a task is monotonous, providing little stimulation and this contributes to crashes due to inattention. Research has shown that driver's hypovigilance can be assessed with EEG measurements and that driving performance is impaired during prolonged monotonous driving tasks. This paper aims to show that two dimensions of monotony - namely road design and road side variability - decrease vigilance and impair driving performance. This is the first study correlating hypovigilance and driver performance in varied monotonous conditions, particularly on a short time scale (a few seconds). We induced vigilance decrement as assessed with an EEG during a monotonous driving simulator experiment. Road monotony was varied through both road design and road side variability. The driver's decrease in vigilance occurred due to both road design and road scenery monotony and almost independently of the driver's sensation seeking level. Such impairment was also correlated to observable measurements from the driver, the car and the environment. During periods of hypovigilance, the driving performance impairment affected lane positioning, time to lane crossing, blink frequency, heart rate variability and non-specific electrodermal response rates. This work lays the foundation for the development of an in-vehicle device preventing hypovigilance crashes on monotonous roads.
Feedback control design for discrete-time piecewise affine systems
Institute of Scientific and Technical Information of China (English)
XU Jun; XIE Li-hua
2007-01-01
This paper investigates the design of state feedback and dynamic output feedback stabilizing controllers for discrete-time piecewise affine (PWA) systems. The main objective is to derive design methods that will incorporate the partition information of the PWA systems so as to reduce the design conservatism embedded in existing design methods. We first introduce a transformation that converts the feedback control design problem into a bilinear matrix inequality (BMI) problem. Then, two iterative algorithms are proposed to compute the feedback controllers characterized by the BMI. Several simulation examples are given to demonstrate the advantages of the proposed design.
Collisions in piecewise flat gravity in 3+1 dimensions
Energy Technology Data Exchange (ETDEWEB)
Van de Meent, Maarten, E-mail: M.vandeMeent@uu.n [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, PO Box 80.195, 3508 TD Utrecht (Netherlands)
2010-07-21
We consider the (3 + 1)-dimensional locally finite gravity model proposed by 't Hooft (2008 Found. Phys. 38 733-57). In particular we revisit the problem of resolving collisions of string defects. We provide a new geometric description of the configurations of strings using piecewise flat manifolds and use it to resolve a more general class of collisions. We argue that beyond certain bounds for the deficiency/surplus angles no resolutions may be found that satisfy the imposed causality conditions.
Guidance law based on piecewise constant control for hypersonic gliders
Hull, David G.; Seguin, Jean-Marie
A midcourse guidance law is developed for the descent of a hypersonic glider to a fixed target on the ground. It is based on an optimal piecewise constant control (N intervals) obtained from an approximate physical model (flat earth, exponential atmosphere, parabolic drag polar, etc). The resulting optimal control equations can be integrated either analytically or by quadrature, and the guidance algorithm requires the solution of 2N+1 nonlinear algebraic equations. The guidance law is implemented in a realistic glider simulation, the intercept is achieved, and final velocities within 14 percent of the true values are obtained for the downrange and crossranges considered.
Mixing with piecewise isometries on a hemispherical shell
Park, Paul P.; Umbanhowar, Paul B.; Ottino, Julio M.; Lueptow, Richard M.
2016-07-01
We introduce mixing with piecewise isometries (PWIs) on a hemispherical shell, which mimics features of mixing by cutting and shuffling in spherical shells half-filled with granular media. For each PWI, there is an inherent structure on the hemispherical shell known as the exceptional set E, and a particular subset of E, E+, provides insight into how the structure affects mixing. Computer simulations of PWIs are used to visualize mixing and approximations of E+ to demonstrate their connection. While initial conditions of unmixed materials add a layer of complexity, the inherent structure of E+ defines fundamental aspects of mixing by cutting and shuffling.
Piecewise-linear maps and their application to financial markets
Directory of Open Access Journals (Sweden)
Fabio Tramontana
2016-08-01
Full Text Available The goal of this paper is to review some work on agent-based financial market models in which the dynamics is driven by piecewise-linear maps. As we will see, such models allow deep analytical insights into the functioning of financial markets, may give rise to unexpected dynamics effects, allow explaining a number of important stylized facts of financial markets, and offer novel policy recommendations. However, much remains to be done in this rather new research field. We hope that our paper attracts more scientists to this area.
A Parallel Encryption Algorithm Based on Piecewise Linear Chaotic Map
Directory of Open Access Journals (Sweden)
Xizhong Wang
2013-01-01
Full Text Available We introduce a parallel chaos-based encryption algorithm for taking advantage of multicore processors. The chaotic cryptosystem is generated by the piecewise linear chaotic map (PWLCM. The parallel algorithm is designed with a master/slave communication model with the Message Passing Interface (MPI. The algorithm is suitable not only for multicore processors but also for the single-processor architecture. The experimental results show that the chaos-based cryptosystem possesses good statistical properties. The parallel algorithm provides much better performance than the serial ones and would be useful to apply in encryption/decryption file with large size or multimedia.
Lower Bounds of the Discretization for Piecewise Polynomials
Lin, Qun; Xu, Jinchao
2011-01-01
Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\\in [1, \\infty]$ $$ \\inf_{v_h\\in V_h}\\|u-v_h\\|_{j,p,\\Omega,h} \\le C h^{r-j} |u|_{r,p,\\Omega},\\quad 0\\le j\\le r. $$ In this paper, we prove that, roughly speaking, if $u\
Bifurcation Structures in a Bimodal Piecewise Linear Map
Directory of Open Access Journals (Sweden)
Anastasiia Panchuk
2017-05-01
Full Text Available In this paper we present an overview of the results concerning dynamics of a piecewise linear bimodal map. The organizing principles of the bifurcation structures in both regular and chaotic domains of the parameter space of the map are discussed. In addition to the previously reported structures, a family of regions closely related to the so-called U-sequence is described. The boundaries of distinct regions belonging to these structures are obtained analytically using the skew tent map and the map replacement technique.
An I(2) cointegration model with piecewise linear trends
DEFF Research Database (Denmark)
Kurita, Takamitsu; Bohn Nielsen, Heino; Rahbæk, Anders
2011-01-01
This paper presents likelihood analysis of the I(2) cointegrated vector autoregression which allows for piecewise linear deterministic terms. Limiting behaviour of the maximum likelihood estimators are derived, which is used to further derive the limiting distribution of the likelihood ratio...... statistic for the cointegration ranks, extending Nielsen and Rahbek. The provided asymptotic theory extends also the results in Johansen et al. where asymptotic inference is discussed in detail for one of the cointegration parameters. An empirical analysis of US consumption, income and wealth, 1965...
Piecewise linear manifolds: Einstein metrics and Ricci flows
Schrader, Robert
2016-05-01
This article provides an attempt to extend concepts from the theory of Riemannian manifolds to piecewise linear (p.l.) spaces. In particular we propose an analogue of the Ricci tensor, which we give the name of an Einstein vector field. On a given set of p.l. spaces we define and discuss (normalized) Einstein flows. p.l. Einstein metrics are defined and examples are provided. Criteria for flows to approach Einstein metrics are formulated. Second variations of the total scalar curvature at a specific Einstein space are calculated. Dedicated to Ludwig Faddeev on the occasion of his 80th birthday.
Estimating monotonic rates from biological data using local linear regression.
Olito, Colin; White, Craig R; Marshall, Dustin J; Barneche, Diego R
2017-03-01
Accessing many fundamental questions in biology begins with empirical estimation of simple monotonic rates of underlying biological processes. Across a variety of disciplines, ranging from physiology to biogeochemistry, these rates are routinely estimated from non-linear and noisy time series data using linear regression and ad hoc manual truncation of non-linearities. Here, we introduce the R package LoLinR, a flexible toolkit to implement local linear regression techniques to objectively and reproducibly estimate monotonic biological rates from non-linear time series data, and demonstrate possible applications using metabolic rate data. LoLinR provides methods to easily and reliably estimate monotonic rates from time series data in a way that is statistically robust, facilitates reproducible research and is applicable to a wide variety of research disciplines in the biological sciences. © 2017. Published by The Company of Biologists Ltd.
Monotone traveling wavefronts of the KPP-Fisher delayed equation
Gomez, Adrian
2010-01-01
In the early 2000's, Gourley (2000), Wu et al. (2001), Ashwin et al. (2002) initiated the study of the positive wavefronts in the delayed Kolmogorov-Petrovskii-Piskunov-Fisher equation. Since then, this model has become one of the most popular objects in the studies of traveling waves for the monostable delayed reaction-diffusion equations. In this paper, we give a complete solution to the problem of existence and uniqueness of monotone waves in the KPP-Fisher equation. We show that each monotone traveling wave can be found via an iteration procedure. The proposed approach is based on the use of special monotone integral operators (which are different from the usual Wu-Zou operator) and appropriate upper and lower solutions associated to them. The analysis of the asymptotic expansions of the eventual traveling fronts at infinity is another key ingredient of our approach.
Ultimate generalization to monotonicity for uniform convergence of trigonometric series
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
Chaundy and Jolliffe proved that if {a n } is a non-increasing (monotonic) real sequence with lim n →∞ a n = 0, then a necessary and sufficient condition for the uniform convergence of the series ∑∞ n=1 a n sin nx is lim n →∞ na n = 0. We generalize (or weaken) the monotonic condition on the coefficient sequence {a n } in this classical result to the so-called mean value bounded variation condition and prove that the generalized condition cannot be weakened further. We also establish an analogue to the generalized Chaundy-Jolliffe theorem in the complex space.
Vector optimization and monotone operators via convex duality recent advances
Grad, Sorin-Mihai
2014-01-01
This book investigates several duality approaches for vector optimization problems, while also comparing them. Special attention is paid to duality for linear vector optimization problems, for which a vector dual that avoids the shortcomings of the classical ones is proposed. Moreover, the book addresses different efficiency concepts for vector optimization problems. Among the problems that appear when the framework is generalized by considering set-valued functions, an increasing interest is generated by those involving monotone operators, especially now that new methods for approaching them by means of convex analysis have been developed. Following this path, the book provides several results on different properties of sums of monotone operators.
Chaotic dynamics and diffusion in a piecewise linear equation.
Shahrear, Pabel; Glass, Leon; Edwards, Rod
2015-03-01
Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.
Chaotic dynamics and diffusion in a piecewise linear equation
Energy Technology Data Exchange (ETDEWEB)
Shahrear, Pabel, E-mail: pabelshahrear@yahoo.com [Department of Mathematics, Shah Jalal University of Science and Technology, Sylhet–3114 (Bangladesh); Glass, Leon, E-mail: glass@cnd.mcgill.ca [Department of Physiology, 3655 Promenade Sir William Osler, McGill University, Montreal, Quebec H3G 1Y6 (Canada); Edwards, Rod, E-mail: edwards@uvic.ca [Department of Mathematics and Statistics, University of Victoria, P.O. Box 1700 STN CSC, Victoria, British Columbia V8W 2Y2 (Canada)
2015-03-15
Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.
Model Based Adaptive Piecewise Linear Controller for Complicated Control Systems
Directory of Open Access Journals (Sweden)
Tain-Sou Tsay
2014-01-01
Full Text Available A model based adaptive piecewise linear control scheme for industry processes with specifications on peak overshoots and rise times is proposed. It is a gain stabilized control technique. Large gain is used for large tracking error to get fast response. Small gain is used between large and small tracking error for good performance. Large gain is used again for small tracking error to cope with large disturbance. Parameters of the three-segment piecewise linear controller are found by an automatic regulating time series which is function of output characteristics of the plant and reference model. The time series will be converged to steady values after the time response of the considered system matching that of the reference model. The proposed control scheme is applied to four numerical examples which have been compensated by PID controllers. Parameters of PID controllers are found by optimization method. It gives an almost command independent response and gives significant improvements for response time and performance.
Regular and chaotic dynamics of a piecewise smooth bouncer
Energy Technology Data Exchange (ETDEWEB)
Langer, Cameron K., E-mail: c.k.langer@tcu.edu; Miller, Bruce N., E-mail: b.miller@tcu.edu [Department of Physics and Astronomy, Texas Christian University, Fort Worth, Texas 76129 (United States)
2015-07-15
The dynamical properties of a particle in a gravitational field colliding with a rigid wall moving with piecewise constant velocity are studied. The linear nature of the wall's motion permits further analytical investigation than is possible for the system's sinusoidal counterpart. We consider three distinct approaches to modeling collisions: (i) elastic, (ii) inelastic with constant restitution coefficient, and (iii) inelastic with a velocity-dependent restitution function. We confirm the existence of distinct unbounded orbits (Fermi acceleration) in the elastic model, and investigate regular and chaotic behavior in the inelastic cases. We also examine in the constant restitution model trajectories wherein the particle experiences an infinite number of collisions in a finite time, i.e., the phenomenon of inelastic collapse. We address these so-called “sticking solutions” and their relation to both the overall dynamics and the phenomenon of self-reanimating chaos. Additionally, we investigate the long-term behavior of the system as a function of both initial conditions and parameter values. We find the non-smooth nature of the system produces novel bifurcation phenomena not seen in the sinusoidal model, including border-collision bifurcations. The analytical and numerical investigations reveal that although our piecewise linear bouncer is a simplified version of the sinusoidal model, the former not only captures essential features of the latter but also exhibits behavior unique to the discontinuous dynamics.
Piecewise multivariate modelling of sequential metabolic profiling data
Directory of Open Access Journals (Sweden)
Nicholson Jeremy K
2008-02-01
Full Text Available Abstract Background Modelling the time-related behaviour of biological systems is essential for understanding their dynamic responses to perturbations. In metabolic profiling studies, the sampling rate and number of sampling points are often restricted due to experimental and biological constraints. Results A supervised multivariate modelling approach with the objective to model the time-related variation in the data for short and sparsely sampled time-series is described. A set of piecewise Orthogonal Projections to Latent Structures (OPLS models are estimated, describing changes between successive time points. The individual OPLS models are linear, but the piecewise combination of several models accommodates modelling and prediction of changes which are non-linear with respect to the time course. We demonstrate the method on both simulated and metabolic profiling data, illustrating how time related changes are successfully modelled and predicted. Conclusion The proposed method is effective for modelling and prediction of short and multivariate time series data. A key advantage of the method is model transparency, allowing easy interpretation of time-related variation in the data. The method provides a competitive complement to commonly applied multivariate methods such as OPLS and Principal Component Analysis (PCA for modelling and analysis of short time-series data.
Non-equilibrium Thermodynamics of Piecewise Deterministic Markov Processes
Faggionato, A.; Gabrielli, D.; Ribezzi Crivellari, M.
2009-10-01
We consider a class of stochastic dynamical systems, called piecewise deterministic Markov processes, with states ( x, σ)∈Ω×Γ, Ω being a region in ℝ d or the d-dimensional torus, Γ being a finite set. The continuous variable x follows a piecewise deterministic dynamics, the discrete variable σ evolves by a stochastic jump dynamics and the two resulting evolutions are fully-coupled. We study stationarity, reversibility and time-reversal symmetries of the process. Increasing the frequency of the σ-jumps, the system behaves asymptotically as deterministic and we investigate the structure of its fluctuations (i.e. deviations from the asymptotic behavior), recovering in a non Markovian frame results obtained by Bertini et al. (Phys. Rev. Lett. 87(4):040601, 2001; J. Stat. Phys. 107(3-4):635-675, 2002; J. Stat. Mech. P07014, 2007; Preprint available online at http://www.arxiv.org/abs/0807.4457, 2008), in the context of Markovian stochastic interacting particle systems. Finally, we discuss a Gallavotti-Cohen-type symmetry relation with involution map different from time-reversal.
Smoothing a Piecewise-Smooth: An Example from Plankton Population Dynamics
DEFF Research Database (Denmark)
Piltz, Sofia Helena
2016-01-01
In this work we discuss a piecewise-smooth dynamical system inspired by plankton observations and constructed for one predator switching its diet between two different types of prey. We then discuss two smooth formulations of the piecewise-smooth model obtained by using a hyperbolic tangent...
High resolution A/D conversion based on piecewise conversion at lower resolution
Terwilliger, Steve
2012-06-05
Piecewise conversion of an analog input signal is performed utilizing a plurality of relatively lower bit resolution A/D conversions. The results of this piecewise conversion are interpreted to achieve a relatively higher bit resolution A/D conversion without sampling frequency penalty.
Piecewise Linear-Linear Latent Growth Mixture Models with Unknown Knots
Kohli, Nidhi; Harring, Jeffrey R.; Hancock, Gregory R.
2013-01-01
Latent growth curve models with piecewise functions are flexible and useful analytic models for investigating individual behaviors that exhibit distinct phases of development in observed variables. As an extension of this framework, this study considers a piecewise linear-linear latent growth mixture model (LGMM) for describing segmented change of…
Bifurcation in a Class of Planar Piecewise Smo oth Systems with 3-parameters
Institute of Scientific and Technical Information of China (English)
Liu Yuan-yuan; Chai Zhen-hua; Ma Fu-ming(Communicated)
2014-01-01
This paper is concerned with the bifurcation properties on the line of discontinuity of planar piecewise smooth systems. The existence of equilibria and periodic solutions with sliding motion in a class of planar piecewise smooth systems with 3-parameters is investigated in this paper using the theory of differential inclu-sion and tools of Poincar´e maps.
Digital architecture for a piecewise-linear arbitrary-waveform generator
Indian Academy of Sciences (India)
VICTOR M JIMENEZ-FERNANDEZ; HECTOR VAZQUEZ-LEAL; PABLO S LUNA-LOZANO; J L VAZQUEZ-BELTRAN; G GARCIA-SANTIAGO; E VALDES-ORTEGA
2016-08-01
In this paper a digital architecture for generating piecewise-linear arbitrary waveforms is presented. The proposed design is able to generate a piecewise-linear periodic signal by only using a minimum number of input data (breakpoints). The generator circuit implements a hybrid scheme which takes advantage of two methods: the purely piecewise-linear interpolation and the lookup-table structure. From the piecewise-linear method exploits the characteristic of a reduced memory requirement as well as the capability of automatically construct a waveform by repetitive (iterative) function evaluations. From lookup-table makes use of the simplicity in hardware implementation and the higher processing speed. In order to verify the performance of thisproposal, three piecewise-linear waveforms have been successfully implemented in a ATMEGA32 microcontroller. Experimental results show a fast execution speed and a reduced memory demand in the proposed circuit realization.
MONOTONE ITERATION FOR ELLIPTIC PDEs WITH DISCONTINUOUS NONLINEAR TERMS
Institute of Scientific and Technical Information of China (English)
Zou Qingsong
2005-01-01
In this paper, we use monotone iterative techniques to show the existence of maximal or minimal solutions of some elliptic PDEs with nonlinear discontinuous terms. As the numerical analysis of this PDEs is concerned, we prove the convergence of discrete extremal solutions.
Modeling non-monotone risk aversion using SAHARA utility functions
A. Chen; A. Pelsser; M. Vellekoop
2011-01-01
We develop a new class of utility functions, SAHARA utility, with the distinguishing feature that it allows absolute risk aversion to be non-monotone and implements the assumption that agents may become less risk averse for very low values of wealth. The class contains the well-known exponential and
L^p solutions of reflected BSDEs under monotonicity condition
Rozkosz, Andrzej
2012-01-01
We prove existence and uniqueness of L^p solutions of reflected backward stochastic differential equations with p-integrable data and generators satisfying the monotonicity condition. We also show that the solution may be approximated by the penalization method. Our results are new even in the classical case p=2.
A monotonic method for solving nonlinear optimal control problems
Salomon, Julien
2009-01-01
Initially introduced in the framework of quantum control, the so-called monotonic algorithms have shown excellent numerical results when dealing with various bilinear optimal control problems. This paper aims at presenting a unified formulation of such procedures and the intrinsic assumptions they require. In this framework, we prove the feasibility of the general algorithm. Finally, we explain how these assumptions can be relaxed.
On Some Conjectures on the Monotonicity of Some Arithmetical Sequences
2012-01-01
THE MONOTONICITY OF SOME ARITHMETICAL SEQUENCES ∗ Florian Luca † Centro de Ciencias Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089...visit of P. S. to the Centro de Ciencias Matemáticas de la UNAM in Morelia in August 2012. During the preparation of this paper, F. L. was supported in
Interval Routing and Minor-Monotone Graph Parameters
Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van
2006-01-01
We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the k
Multivariate Regression with Monotone Missing Observation of the Dependent Variables
Raats, V.M.; van der Genugten, B.B.; Moors, J.J.A.
2002-01-01
Multivariate regression is discussed, where the observations of the dependent variables are (monotone) missing completely at random; the explanatory variables are assumed to be completely observed.We discuss OLS-, GLS- and a certain form of E(stimated) GLS-estimation.It turns out that
Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes
Norde, H.W.; Moretti, S.; Tijs, S.H.
2001-01-01
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegati
Size monotonicity and stability of the core in hedonic games
Dimitrov, Dinko; Sung, Shao Chin
2011-01-01
We show that the core of each strongly size monotonic hedonic game is not empty and is externally stable. This is in sharp contrast to other sufficient conditions for core non-emptiness which do not even guarantee the existence of a stable set in such games.
Monotone missing data and repeated controls of fallible authors
Raats, V.M.
2004-01-01
Chapters 2 and 3 focus on repeated audit controls with categorical variables. Chapter 4 and 5 introduce and analyse a very general multivariate regression model for (monotone) missing data. In the final Chapter 6 the previous chapters are combined into a more realistic model for repeated audit contr
A POTENTIAL REDUCTION ALGORITHM FOR MONOTONE VARIATIONAL INEQUALITY PROBLEMS
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
A potential reduction algorithm is proposed for the solution of monotone variational inequality problems. At each step of the algorithm, a system of linear equations is solved to get the search direction and the Armijo's rule is used to determine the stepsize.It is proved that the algorithm is globally convergent. Computational results are reported.
Relaxing monotonicity in the identification of local average treatment effects
DEFF Research Database (Denmark)
Huber, Martin; Mellace, Giovanni
In heterogeneous treatment effect models with endogeneity, the identification of the local average treatment effect (LATE) typically relies on an instrument that satisfies two conditions: (i) joint independence of the potential post-instrument variables and the instrument and (ii) monotonicity...
Incorporating "Unconscious Reanalysis" into an Incremental, Monotonic Parser
Sturt, P
1995-01-01
This paper describes an implementation based on a recent model in the psycholinguistic literature. We define a parsing operation which allows the reanalysis of dependencies within an incremental and monotonic processing architecture, and discuss search strategies for its application in a head-initial language (English) and a head-final language (Japanese).
Interval Routing and Minor-Monotone Graph Parameters
Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van
2006-01-01
We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the
Reasoning Biases, Non-Monotonic Logics, and Belief Revision
Dutilh Novaes, Catarina; Veluwenkamp, Herman
2017-01-01
A range of formal models of human reasoning have been proposed in a number of fields such as philosophy, logic, artificial intelligence, computer science, psychology, cognitive science etc.: various logics (epistemic logics; non-monotonic logics), probabilistic systems (most notably, but not exclusi
Some Researches on Real Piecewise Algebraic Curves%实分片代数曲线的某些研究
Institute of Scientific and Technical Information of China (English)
朱春钢; 王仁宏
2008-01-01
The piecewise algebraic curve,defined by a bivariate spline,is a generalization of the classical algebraic curve.In this palper,we present some researches on real piecewise algebraic curves using elementary algebra.A real piecewise algebraic curve is studied according to the fact that a real spline for the curve is indefinite,definite or semidefinite(nondefinite).Moreover,the isolated points of a real piecewise algebraic curve is also discussed.
An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm
Directory of Open Access Journals (Sweden)
Yuping Hu
2014-01-01
Full Text Available An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.
Complete parameterization of piecewise-polynomial interpolation kernels.
Blu, Thierry; Thévenaz, Philippe; Unser, Michael
2003-01-01
Every now and then, a new design of an interpolation kernel appears in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. We propose to ease this burden by providing an explicit formula that can generate every possible piecewise-polynomial kernel given its degree, its support, its regularity, and its order of approximation. This formula contains a set of coefficients that can be chosen freely and do not interfere with the four main design parameters; it is thus easy to tune the design to achieve any additional constraints that the designer may care for.
Detecting ecological breakpoints: a new tool for piecewise regression
Directory of Open Access Journals (Sweden)
Alessandro Ferrarini
2011-06-01
Full Text Available Simple linear regression tries to determine a linear relationship between a given variable X (predictor and a dependent variable Y. Since most of the environmental problems involve complex relationships, X-Y relationship is often better modeled through a regression where, instead of fitting a single straight line to the data, the algorithm allows the fitting to bend. Piecewise regressions just do it, since they allow emphasize local, instead of global, rules connecting predictor and dependent variables. In this work, a tool called RolReg is proposed as an implementation of Krummel's method to detect breakpoints in regression models. RolReg, which is freely available upon request from the author, could useful to detect proper breakpoints in ecological laws.
Piecewise Sliding Mode Decoupling Fault Tolerant Control System
Directory of Open Access Journals (Sweden)
Rafi Youssef
2010-01-01
Full Text Available Problem statement: Proposed method in the present study could deal with fault tolerant control system by using the so called decentralized control theory with decoupling fashion sliding mode control, dealing with subsystems instead of whole system and to the knowledge of the author there is no known computational algorithm for decentralized case, Approach: In this study we present a decoupling strategy based on the selection of sliding surface, which should be in piecewise sliding surface partition to apply the PwLTool which have as purpose in our case to delimit regions where sliding mode occur, after that as Results: We get a simple linearized model selected in those regions which could depict the complex system, Conclusion: With the 3 water tank level system as example we implement this new design scenario and since we are interested in networked control system we believe that this kind of controller implementation will not be affected by network delays.
The Piecewise Cubic Method (PCM) for computational fluid dynamics
Lee, Dongwook; Faller, Hugues; Reyes, Adam
2017-07-01
We present a new high-order finite volume reconstruction method for hyperbolic conservation laws. The method is based on a piecewise cubic polynomial which provides its solutions a fifth-order accuracy in space. The spatially reconstructed solutions are evolved in time with a fourth-order accuracy by tracing the characteristics of the cubic polynomials. As a result, our temporal update scheme provides a significantly simpler and computationally more efficient approach in achieving fourth order accuracy in time, relative to the comparable fourth-order Runge-Kutta method. We demonstrate that the solutions of PCM converges at fifth-order in solving 1D smooth flows described by hyperbolic conservation laws. We test the new scheme on a range of numerical experiments, including both gas dynamics and magnetohydrodynamics applications in multiple spatial dimensions.
The Piecewise Cubic Method (PCM) for Computational Fluid Dynamics
Lee, Dongwook; Reyes, Adam
2016-01-01
We present a new high-order finite volume reconstruction method for hyperbolic conservation laws. The method is based on a piecewise cubic polynomial which provides its solutions a fifth-order accuracy in space. The spatially reconstructed solutions are evolved in time with a fourth-order accuracy by tracing the characteristics of the cubic polynomials. As a result, our temporal update scheme provides a significantly simpler and computationally more efficient approach in achieving fourth order accuracy in time, relative to the comparable fourth-order Runge-Kutta method. We demonstrate that the solutions of PCM converges in fifth-order in solving 1D smooth flows described by hyperbolic conservation laws. We test the new scheme in a range of numerical experiments, including both gas dynamics and magnetohydrodynamics applications in multiple spatial dimensions.
An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm
Hu, Yuping; Wang, Zhijian
2014-01-01
An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack. PMID:24592159
Controllability and Observability Criteria for Linear Piecewise Constant Impulsive Systems
Directory of Open Access Journals (Sweden)
Hong Shi
2012-01-01
Full Text Available Impulsive differential systems are an important class of mathematical models for many practical systems in physics, chemistry, biology, engineering, and information science that exhibit impulsive dynamical behaviors due to abrupt changes at certain instants during the dynamical processes. This paper studies the controllability and observability of linear piecewise constant impulsive systems. Necessary and sufficient criteria for reachability and controllability are established, respectively. It is proved that the reachability is equivalent to the controllability under some mild conditions. Then, necessary and sufficient criteria for observability and determinability of such systems are established, respectively. It is also proved that the observability is equivalent to the determinability under some mild conditions. Our criteria are of the geometric type, and they can be transformed into algebraic type conveniently. Finally, a numerical example is given to illustrate the utility of our criteria.
A new approach to piecewise linear Wilson lines
Van der Veken, Frederik F
2014-01-01
Wilson lines are key objects in many QCD calculations. They are parallel transporters of the gauge field that can be used to render non-local operator products gauge invariant, which is especially useful for calculations concerning validation of factorization schemes and in calculations for constructing or modelling parton density functions. We develop an algorithm to express Wilson lines that are defined on piecewise linear paths in function of their Wilson segments, reducing the number of diagrams needed to be calculated. We show how different linear path topologies can be related using their color structure. This framework allows one to easily switch results between different Wilson line structures, which is helpful when testing different structures against each other, e.g. when checking universality properties of non-perturbative objects.
Gravitational backreaction on piecewise linear cosmic string loops
Wachter, Jeremy M.; Olum, Ken D.
2017-01-01
We calculate the metric and affine connection due to a piecewise linear cosmic string loop, and the effect of gravitational backreaction for the Garfinkle-Vachaspati loop with four straight segments. As expected, backreaction reduces the size of the loop, in accord with the energy going into gravitational waves. The "square" (maximally symmetric) loop evaporates without changing shape, but for all other loops in this class, the kinks become less sharp and segments between kinks become curved. If the loop is close to the square case, it will evaporate before its kinks are significantly changed; if it is far from square, the opening out of the kinks is much faster than evaporation of the loop.
Gravitational back reaction on piecewise linear cosmic string loops
Wachter, Jeremy M
2016-01-01
We calculate the metric and affine connection due to a piecewise linear cosmic string loop, and the effect of gravitational back reaction for the Garfinkle-Vachaspati loop with four straight segments. As expected, back reaction reduces the size of the loop, in accord with the energy going into gravitational waves. The "square" loop whose generators lie at right angles evaporates without changing shape, but in all other cases, the kinks become less sharp and segments between kinks become curved. If the loop is close to the square case, the loop will evaporate before its kinks are significantly changed; if it is far from square, the opening out of the kinks is much faster than evaporation of the loop. In more realistic loops, the curvature of the straight segments due to gravitational back reaction may lead to cusps which did not exist in the original shape with the bending of the string concentrated at kinks.
Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics
Directory of Open Access Journals (Sweden)
J. Petrzela
2012-04-01
Full Text Available This paper shows the influence of piecewise-linear approximation on the global dynamics associated with autonomous third-order dynamical systems with the quadratic vector fields. The novel method for optimal nonlinear function approximation preserving the system behavior is proposed and experimentally verified. This approach is based on the calculation of the state attractor metric dimension inside a stochastic optimization routine. The approximated systems are compared to the original by means of the numerical integration. Real electronic circuits representing individual dynamical systems are derived using classical as well as integrator-based synthesis and verified by time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is briefly discussed, especially from the viewpoint of the higher-order dynamical systems. Future topics and perspectives are also provided
Elasticity in Amorphous Solids: Nonlinear or Piecewise Linear?
Dubey, Awadhesh K; Procaccia, Itamar; Shor, Carmel A B Z; Singh, Murari
2016-02-26
Quasistatic strain-controlled measurements of stress versus strain curves in macroscopic amorphous solids result in a nonlinear-looking curve that ends up either in mechanical collapse or in a steady state with fluctuations around a mean stress that remains constant with increasing strain. It is therefore very tempting to fit a nonlinear expansion of the stress in powers of the strain. We argue here that at low temperatures the meaning of such an expansion needs to be reconsidered. We point out the enormous difference between quenched and annealed averages of the stress versus strain curves and propose that a useful description of the mechanical response is given by a stress (or strain) -dependent shear modulus for which a theoretical evaluation exists. The elastic response is piecewise linear rather than nonlinear.
Autocalibrating Tiled Projectors on Piecewise Smooth Vertically Extruded Surfaces.
Sajadi, Behzad; Majumder, Aditi
2011-09-01
In this paper, we present a novel technique to calibrate multiple casually aligned projectors on fiducial-free piecewise smooth vertically extruded surfaces using a single camera. Such surfaces include cylindrical displays and CAVEs, common in immersive virtual reality systems. We impose two priors to the display surface. We assume the surface is a piecewise smooth vertically extruded surface for which the aspect ratio of the rectangle formed by the four corners of the surface is known and the boundary is visible and segmentable. Using these priors, we can estimate the display's 3D geometry and camera extrinsic parameters using a nonlinear optimization technique from a single image without any explicit display to camera correspondences. Using the estimated camera and display properties, the intrinsic and extrinsic parameters of each projector are recovered using a single projected pattern seen by the camera. This in turn is used to register the images on the display from any arbitrary viewpoint making it appropriate for virtual reality systems. The fast convergence and robustness of this method is achieved via a novel dimension reduction technique for camera parameter estimation and a novel deterministic technique for projector property estimation. This simplicity, efficiency, and robustness of our method enable several coveted features for nonplanar projection-based displays. First, it allows fast recalibration in the face of projector, display or camera movements and even change in display shape. Second, this opens up, for the first time, the possibility of allowing multiple projectors to overlap on the corners of the CAVE-a popular immersive VR display system. Finally, this opens up the possibility of easily deploying multiprojector displays on aesthetic novel shapes for edutainment and digital signage applications.
Piecewise Mapping in HEVC Lossless Intra-prediction Coding.
Sanchez, Victor; Auli-Llinas, Francesc; Serra-Sagrista, Joan
2016-05-19
The lossless intra-prediction coding modality of the High Efficiency Video Coding (HEVC) standard provides high coding performance while allowing frame-by-frame basis access to the coded data. This is of interest in many professional applications such as medical imaging, automotive vision and digital preservation in libraries and archives. Various improvements to lossless intra-prediction coding have been proposed recently, most of them based on sample-wise prediction using Differential Pulse Code Modulation (DPCM). Other recent proposals aim at further reducing the energy of intra-predicted residual blocks. However, the energy reduction achieved is frequently minimal due to the difficulty of correctly predicting the sign and magnitude of residual values. In this paper, we pursue a novel approach to this energy-reduction problem using piecewise mapping (pwm) functions. Specifically, we analyze the range of values in residual blocks and apply accordingly a pwm function to map specific residual values to unique lower values. We encode appropriate parameters associated with the pwm functions at the encoder, so that the corresponding inverse pwm functions at the decoder can map values back to the same residual values. These residual values are then used to reconstruct the original signal. This mapping is, therefore, reversible and introduces no losses. We evaluate the pwm functions on 4×4 residual blocks computed after DPCM-based prediction for lossless coding of a variety of camera-captured and screen content sequences. Evaluation results show that the pwm functions can attain maximum bit-rate reductions of 5.54% and 28.33% for screen content material compared to DPCM-based and block-wise intra-prediction, respectively. Compared to Intra- Block Copy, piecewise mapping can attain maximum bit-rate reductions of 11.48% for camera-captured material.
Non-monotonic effect of confinement on the glass transition
Varnik, Fathollah; Franosch, Thomas
2016-04-01
The relaxation dynamics of glass forming liquids and their structure are influenced in the vicinity of confining walls. This effect has mostly been observed to be a monotonic function of the slit width. Recently, a qualitatively new behaviour has been uncovered by Mittal and coworkers, who reported that the single particle dynamics in a hard-sphere fluid confined in a planar slit varies in a non-monotonic way as the slit width is decreased from five to roughly two particle diametres (Mittal et al 2008 Phys. Rev. Lett. 100 145901). In view of the great potential of this effect for applications in those fields of science and industry, where liquids occur under strong confinement (e.g. nano-technology), the number of researchers studying various aspects and consequences of this non-monotonic behaviour has been rapidly growing. This review aims at providing an overview of the research activity in this newly emerging field. We first briefly discuss how competing mechanisms such as packing effects and short-range attraction may lead to a non-monotonic glass transition scenario in the bulk. We then analyse confinement effects on the dynamics of fluids using a thermodynamic route which relates the single particle dynamics to the excess entropy. Moreover, relating the diffusive dynamics to the Widom’s insertion probability, the oscillations of the local dynamics with density at moderate densities are fairly well described. At high densities belonging to the supercooled regime, however, this approach breaks down signaling the onset of strongly collective effects. Indeed, confinement introduces a new length scale which in the limit of high densities and small pore sizes competes with the short-range local order of the fluid. This gives rise to a non-monotonic dependence of the packing structure on confinement, with a corresponding effect on the dynamics of structural relaxation. This non-monotonic effect occurs also in the case of a cone-plate type channel, where the degree
A Hybrid Approach to Proving Memory Reference Monotonicity
Oancea, Cosmin E.
2013-01-01
Array references indexed by non-linear expressions or subscript arrays represent a major obstacle to compiler analysis and to automatic parallelization. Most previous proposed solutions either enhance the static analysis repertoire to recognize more patterns, to infer array-value properties, and to refine the mathematical support, or apply expensive run time analysis of memory reference traces to disambiguate these accesses. This paper presents an automated solution based on static construction of access summaries, in which the reference non-linearity problem can be solved for a large number of reference patterns by extracting arbitrarily-shaped predicates that can (in)validate the reference monotonicity property and thus (dis)prove loop independence. Experiments on six benchmarks show that our general technique for dynamic validation of the monotonicity property can cover a large class of codes, incurs minimal run-time overhead and obtains good speedups. © 2013 Springer-Verlag.
Measurement of non-monotonic Casimir forces between silicon nanostructures
Tang, L.; Wang, M.; Ng, C. Y.; Nikolic, M.; Chan, C. T.; Rodriguez, A. W.; Chan, H. B.
2017-01-01
Casimir forces are of fundamental interest because they originate from quantum fluctuations of the electromagnetic field. Apart from controlling this force via the optical properties of materials, a number of novel geometries have been proposed to generate repulsive and/or non-monotonic Casimir forces between bodies separated by vacuum gaps. Experimental realization of these geometries, however, is hindered by the difficulties in alignment when the bodies are brought into close proximity. Here, using an on-chip platform with integrated force sensors and actuators, we circumvent the alignment problem and measure the Casimir force between two surfaces with nanoscale protrusions. We demonstrate that the force depends non-monotonically on the displacement. At some displacements, the Casimir force leads to an effective stiffening of the nanomechanical spring. Our findings pave the way for exploiting the Casimir force in nanomechanical systems using structures of complex and non-conventional shapes.
A Monotonic Precise Current DAC for Sensor Applications
Directory of Open Access Journals (Sweden)
P. Horsky
2008-12-01
Full Text Available In this paper a 17 bit monotonic precise current DAC for sensor applications is described. It is working in a harsh automotive environment in a wide temperature range with high output voltage swing and low current consumption. To guarantee monotonicity current division and segmentation techniques are used. To improve the output impedance, the accuracy and the voltage compliance of the DAC, two active cascoding loops and one follower loop are used. The resolution of the DAC is further increased by applying pulse width modulation to one fine LSB current. To achieve low power consumption unused coarse current sources are switched off. Several second order technological effects influencing final performance and circuits dealing with them are discussed.
Computation of Optimal Monotonicity Preserving General Linear Methods
Ketcheson, David I.
2009-07-01
Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal methods even among classes involving very high order accuracy and that use many steps and/or stages. The optimality of some recently proposed methods is verified, and many more efficient methods are found. We use similar algorithms to find optimal strong stability preserving linear multistep methods of both explicit and implicit type, including methods for hyperbolic PDEs that use downwind-biased operators.
Rational functions with maximal radius of absolute monotonicity
Loczi, Lajos
2014-05-19
We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p Runge-Kutta methods for initial value problems and the radius of absolute monotonicity governs the numerical preservation of properties like positivity and maximum-norm contractivity. We construct a function with p=2 and R>2s, disproving a conjecture of van de Griend and Kraaijevanger. We determine the maximum attainable radius for functions in several one-parameter families of rational functions. Moreover, we prove earlier conjectured optimal radii in some families with 2 or 3 parameters via uniqueness arguments for systems of polynomial inequalities. Our results also prove the optimality of some strong stability preserving implicit and singly diagonally implicit Runge-Kutta methods. Whereas previous results in this area were primarily numerical, we give all constants as exact algebraic numbers.
Block Monotone Iterative Algorithms for Variational Inequalities with Nonlinear Operators
Institute of Scientific and Technical Information of China (English)
Ming-hui Ren; Jin-ping Zeng
2008-01-01
Some block iterative methods for solving variational inequalities with nonlinear operators are proposed. Monotone convergence of the algorithms is obtained. Some comparison theorems are also established.Compared with the research work in given by Pao in 1995 for nonlinear equations and research work in given by Zeng and Zhou in 2002 for elliptic variational inequalities, the algorithms proposed in this paper are independent of the boundedness of the derivatives of the nonlinear operator.
Monotonic Property in Field Algebra of G-Spin Model
Institute of Scientific and Technical Information of China (English)
蒋立宁
2003-01-01
Let F be the field algebra of G-spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G. The paper builds a correspondence between D(H) and the D(H)-invariant sub-C*-algebra AH in F, and proves that the correspondence is strictly monotonic.
Modeling argumentation based semantics using non-monotonic reasoning
2005-01-01
Argumentation theory is an alternative style of formalizing non-monotonic reasoning. It seems, argumentation theory is a suitable framework for practical and uncertain reasoning, where arguments support conclusions. Dung's approach is an unifying framework which has played an influential role on argumentation research and Artificial Intelligence. Even though the success of the argumentation theory, it seems that argumentation theory is so far from being efficiently implemented like the logic ...
Nonparametric estimation for hazard rate monotonously decreasing system
Institute of Scientific and Technical Information of China (English)
Han Fengyan; Li Weisong
2005-01-01
Estimation of density and hazard rate is very important to the reliability analysis of a system. In order to estimate the density and hazard rate of a hazard rate monotonously decreasing system, a new nonparametric estimator is put forward. The estimator is based on the kernel function method and optimum algorithm. Numerical experiment shows that the method is accurate enough and can be used in many cases.
Stability and monotonicity of Lotka-Volterra type operators
Mukhamedov, Farrukh
2009-01-01
In the present paper, we study Lotka-Volterra (LV) type operators defined in finite dimensional simplex. We prove that any LV type operator is a surjection of the simplex. After, we introduce a new class of LV-type operators, called $M$LV type. We prove convergence of their trajectories and study certain its properties. Moreover, we show that such kind of operators have totaly different behavior than ${\\mathbf{f}}$-monotone LV type operators.
Analysis and control for a new chaotic system via piecewise linear feedback
Energy Technology Data Exchange (ETDEWEB)
Zhang Jianxiong [Institute of Systems Engineering, Tianjin University, Tianjin 300072 (China)], E-mail: jxzhang@tju.edu.cn; Tang Wansheng [Institute of Systems Engineering, Tianjin University, Tianjin 300072 (China)
2009-11-30
This paper presents a new three-dimensional chaotic system containing two system parameters and a nonlinear term in the form of arc-hyperbolic sine function. The complicated dynamics are studied by virtue of theoretical analysis, numerical simulation and Lyapunov exponents spectrum. The system proposed is converted to an uncertain piecewise linear system. Then, based on piecewise quadratic Lyapunov function technique, the global control of the new chaotic system with {alpha}-stability constraint via piecewise linear state feedback is studied, where the optimal controller maximizing the decay rate {alpha} can be obtained by solving an optimization problem under bilinear matrix inequalities (BMIs) constraints.
Nther-type theorem of piecewise algebraic curves on quasi-cross-cut partition
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Nther’s theorem of algebraic curves plays an important role in classical algebraic geometry. As the zero set of a bivariate spline, the piecewise algebraic curve is a generalization of the classical algebraic curve. Nther-type theorem of piecewise algebraic curves is very important to construct the Lagrange interpolation sets for bivariate spline spaces. In this paper, using the characteristics of quasi-cross-cut partition, properties of bivariate splines and results in algebraic geometry, the Nther-type theorem of piecewise algebraic curves on the quasi-cross-cut is presented.
N(o)ther-type theorem of piecewise algebraic curves on quasi-cross-cut partition
Institute of Scientific and Technical Information of China (English)
ZHU ChunGang; WANG RenHong
2009-01-01
Nother's theorem of algebraic curves plays an important role in classical algebraic geome-try. As the zero set of a bivariate spline, the piecewise algebraic curve is a generalization of the classical algebraic curve. Nother-type theorem of piecewise algebraic curves is very important to construct the Lagrange interpolation sets for bivariate spline spaces. In this paper, using the characteristics of quasi-cross-cut partition, properties of bivariate splines and results in algebraic geometry, the Nother-type theorem of piecewise algebraic curves on the quasi-cross-cut is presented.
Piecewise Linear Analysis for Pseudo-elasticity of Shape Memory Alloy (SMA)
Institute of Scientific and Technical Information of China (English)
WANG Xiao-dong; DU Xiao-wei; SUN Guo-jun
2005-01-01
Based on the Brinson constitutive model of SMA, a piecewise linear model for the hysteresis loop of pseudo-elasticity is proposed and applied in the analysis of responses of an SMA-spring-mass system under initial velocity activation. The histories of displacement and velocity of the mass, and the response of stress of SMA are calculated with Brinson's model and the piecewise linear model. The difference of results of the two models is not significant. The calculation with piecewise-linear model needs no iteration and is highly efficient.
Monotone traveling wavefronts of the KPP-Fisher delayed equation
Gomez, Adrian; Trofimchuk, Sergei
In the early 2000's, Gourley (2000), Wu et al. (2001), Ashwin et al. (2002) initiated the study of the positive wavefronts in the delayed Kolmogorov-Petrovskii-Piskunov-Fisher equation u(t,x)=Δu(t,x)+u(t,x)(1-u(t-h,x)), u⩾0, x∈R. Since then, this model has become one of the most popular objects in the studies of traveling waves for the monostable delayed reaction-diffusion equations. In this paper, we give a complete solution to the problem of existence and uniqueness of monotone waves in Eq. (*). We show that each monotone traveling wave can be found via an iteration procedure. The proposed approach is based on the use of special monotone integral operators (which are different from the usual Wu-Zou operator) and appropriate upper and lower solutions associated to them. The analysis of the asymptotic expansions of the eventual traveling fronts at infinity is another key ingredient of our approach.
Solving the power flow equations: a monotone operator approach
Energy Technology Data Exchange (ETDEWEB)
Dvijotham, Krishnamurthy [California Inst. of Technology (CalTech), Pasadena, CA (United States); Low, Steven [California Inst. of Technology (CalTech), Pasadena, CA (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-07-21
The AC power flow equations underlie all operational aspects of power systems. They are solved routinely in operational practice using the Newton-Raphson method and its variants. These methods work well given a good initial “guess” for the solution, which is always available in normal system operations. However, with the increase in levels of intermittent generation, the assumption of a good initial guess always being available is no longer valid. In this paper, we solve this problem using the theory of monotone operators. We show that it is possible to compute (using an offline optimization) a “monotonicity domain” in the space of voltage phasors. Given this domain, there is a simple efficient algorithm that will either find a solution in the domain, or provably certify that no solutions exist in it. We validate the approach on several IEEE test cases and demonstrate that the offline optimization can be performed tractably and the computed “monotonicity domain” includes all practically relevant power flow solutions.
Breaking the continuity of a piecewise linear map
Directory of Open Access Journals (Sweden)
Schenke Björn
2012-08-01
Full Text Available Knowledge about the behavior of discontinuous piecewise-linear maps is important for a wide range of applications. An efficient way to investigate the bifurcation structure in 2D parameter spaces of such maps is to detect specific codimension-2 bifurcation points, called organizing centers, and to describe the bifurcation structure in their neighborhood. In this work, we present the organizing centers in the 1D discontinuous piecewise-linear map in the generic form, which can be used as a normal form for these bifurcations in other 1D discontinuous maps with one discontinuity. These organizing centers appear when the continuity of the system function is broken in a fixed point. The type of an organizing center depends on the slopes of the piecewise-linear map. The organizing centers that occur if the slopes have an absolute value smaller than one were already described in previous works, so we concentrate on presenting the organizing centers that occur if one or both slopes have absolute values larger than one. By doing this, we also show that the behavior for each organizing center can be explained using four basic bifurcation scenarios: the period incrementing and the period adding scenarios in the periodic domain, as well as the bandcount incrementing and the bandcount adding scenarios in the chaotic domain. Les connaissances sur le comportement d’applications linéaires par morceaux discontinues sont importantes pour de nombreuses applications. Une méthode puissante pour étudier la structure de bifurcation dans les espaces de paramètre 2D de telles applications est de détecter des points de bifurcation spécifiques de codimension 2, appelés centres organisateurs, et de décrire la structure de bifurcation dans leur voisinage. Dans ce travail, nous présentons les centres organisateurs pour une application linéaire par morceaux discontinue 1D sous forme générique, ce qui peut être utilisé comme une forme normale pour ces
Perfect Sampling of Markov Chains with Piecewise Homogeneous Events
Bušić, Ana; Pin, Furcy
2010-01-01
Perfect sampling is a technique that uses coupling arguments to provide a sample from the stationary distribution of a Markov chain in a finite time without ever computing the distribution. This technique is very efficient if all the events in the system have monotonicity property. However, in the general (non-monotone) case, this technique needs to consider the whole state space, which limits its application only to chains with a state space of small cardinality. We propose here a new approach for the general case that only needs to consider two trajectories. Instead of the original chain, we use two bounding processes (envelopes) and we show that, whenever they couple, one obtains a sample under the stationary distribution of the original chain. We show that this new approach is particularly effective when the state space can be partitioned into pieces where envelopes can be easily computed. We further show that most Markovian queueing networks have this property and we propose efficient algorithms for some...
Directory of Open Access Journals (Sweden)
Feng Qi
2014-10-01
Full Text Available The authors find the absolute monotonicity and complete monotonicity of some functions involving trigonometric functions and related to estimates the lower bounds of the first eigenvalue of Laplace operator on Riemannian manifolds.
Non-monotonic reasoning in conceptual modeling and ontology design: A proposal
CSIR Research Space (South Africa)
Casini, G
2013-06-01
Full Text Available and modeling of defeasible information and non-monotonic reasoning services. Here we formalize a possible way of introducing non-monotonic reasoning into ORM2 schemas, enriching the language with special set of new constraints....
Mixed Monotonicity of Partial First-In-First-Out Traffic Flow Models
Coogan, Samuel; Arcak, Murat; Kurzhanskiy, Alexander A.
2015-01-01
In vehicle traffic networks, congestion on one outgoing link of a diverging junction often impedes flow to other outgoing links, a phenomenon known as the first-in-first-out (FIFO) property. Simplified traffic models that do not account for the FIFO property result in monotone dynamics for which powerful analysis techniques exist. FIFO models are in general not monotone, but have been shown to be mixed monotone - a generalization of monotonicity that enables similarly powerful analysis techni...
Border-Collision Bifurcations and Chaotic Oscillations in a Piecewise-Smooth Dynamical System
DEFF Research Database (Denmark)
Zhusubaliyev, Z.T.; Soukhoterin, E.A.; Mosekilde, Erik
2002-01-01
Many problems of engineering and applied science result in the consideration of piecewise-smooth dynamical systems. Examples are relay and pulse-width control systems, impact oscillators, power converters, and various electronic circuits with piecewise-smooth characteristics. The subject...... of investigation in the present paper is the dynamical model of a constant voltage converter which represents a three-dimensional piecewise-smooth system of nonautonomous differential equations. A specific type of phenomena that arise in the dynamics of piecewise-smooth systems are the so-called border......-collision bifurcations. The paper contains a detailed analysis of this type of bifurcational transition in the dynamics of the voltage converter, in particular, the merging and subsequent disappearance of cycles of different types, change of solution type, and period-doubling, -tripling, -quadrupling and -quintupling...
Construction of a Class of Four-Dimensional Piecewise Affine Systems with Homoclinic Orbits
Wu, Tiantian; Yang, Xiao-Song
2016-06-01
Based on mathematical analysis, this paper provides a methodology to ensure the existence of homoclinic orbits in a class of four-dimensional piecewise affine systems. In addition, an example is provided to illustrate the effectiveness of the method.
Invariant Measures with Bounded Variation Densities for Piecewise Area Preserving Maps
Zhang, Yiwei
2011-01-01
We investigate the properties of absolutely continuous invariant probability measures (ACIPs) for piecewise area preserving maps (PAPs) on $\\mathbb{R}^d$. This class of maps unifies piecewise isometries (PWIs) and piecewise hyperbolic maps where Lebesgue measure is locally preserved. In particular for PWIs, we use a functional approach to explore the relationship between topological transitivity and uniqueness of ACIPs, especially those measures with bounded variation densities. Our results "partially" answer one of the fundamental questions posed in \\cite{Goetz03} - determine all invariant non-atomic probability Borel measures in piecewise rotations. When reducing to interval exchange transformations (IETs), we demonstrate that for non-uniquely ergodic IETs with two or more ACIPs, these ACIPs have very irregular densities (namely of unbounded variation and discontinuous everywhere) and intermingle with each other.
Real zeros of the zero-dimensional parametric piecewise algebraic variety
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi- algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and suffcient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and suffcient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex.
Vision servoing of robot systems using piecewise continuous controllers and observers
Wang, H. P.; Vasseur, C.; Christov, N.; Koncar, V.
2012-11-01
This paper deals with the visual servoing of X-Y robot systems using low cost CCD camera. The proposed approach is based on the theory of piecewise continuous systems which are a particular class of hybrid systems with autonomous switching and controlled impulses. Visual trajectory tracking systems comprising piecewise continuous controllers and observers, are developed. Real-time results are given to illustrate the effectiveness of the proposed visual control system.
Hirata, Yoshito; Aihara, Kazuyuki
2012-06-01
We introduce a low-dimensional description for a high-dimensional system, which is a piecewise affine model whose state space is divided by permutations. We show that the proposed model tends to predict wind speeds and photovoltaic outputs for the time scales from seconds to 100 s better than by global affine models. In addition, computations using the piecewise affine model are much faster than those of usual nonlinear models such as radial basis function models.
Decomposition of piecewise-polynomial model of a predistorter for power amplifier
2015-01-01
Decomposition of piecewise-polynomial model of a predistorter has been performed taking into account the alteration dynamics of the complex envelope’s magnitude for the signal, which is converted by an amplifier. Decomposition model provides higher accuracy of nonlinear distortions compensation for signals in the amplifier compared with piecewise-polynomial model of a predistorter. Comparative analysis of predistorters’ models has been carried out for the linearization of the Wiener–Hammerste...
A Piecewise Linear Fitting Technique for Multivalued Two-dimensional Paths
Directory of Open Access Journals (Sweden)
V.M. Jimenez-Fernandez
2013-10-01
Full Text Available This paper presents a curve-fitting technique for multivalued two-dimensional piecewise-linear paths. The proposed method is based on a decomposed formulation of the canonical piecewise linear model description of Chua and Kang. The path is treated as a parametric system of two position equations (x(k, y(k, where k is an artificial parameter to map each variable (x and y into an independent k-domain.
Wavelets centered on a knot sequence: piecewise polynomial wavelets on a quasi-crystal lattice
Atkinson, Bruce W; Geronimo, Jeffrey S; Hardin, Douglas P
2011-01-01
We develop a general notion of orthogonal wavelets `centered' on an irregular knot sequence. We present two families of orthogonal wavelets that are continuous and piecewise polynomial. As an application, we construct continuous, piecewise quadratic, orthogonal wavelet bases on the quasi-crystal lattice consisting of the $\\tau$-integers where $\\tau$ is the golden-mean. The resulting spaces then generate a multiresolution analysis of $L^2(\\mathbf{R})$ with scaling factor $\\tau$.
Optimal Piecewise Linear Basis Functions in Two Dimensions
Energy Technology Data Exchange (ETDEWEB)
Brooks III, E D; Szoke, A
2009-01-26
We use a variational approach to optimize the center point coefficients associated with the piecewise linear basis functions introduced by Stone and Adams [1], for polygonal zones in two Cartesian dimensions. Our strategy provides optimal center point coefficients, as a function of the location of the center point, by minimizing the error induced when the basis function interpolation is used for the solution of the time independent diffusion equation within the polygonal zone. By using optimal center point coefficients, one expects to minimize the errors that occur when these basis functions are used to discretize diffusion equations, or transport equations in optically thick zones (where they approach the solution of the diffusion equation). Our optimal center point coefficients satisfy the requirements placed upon the basis functions for any location of the center point. We also find that the location of the center point can be optimized, but this requires numerical calculations. Curiously, the optimum center point location is independent of the values of the dependent variable on the corners only for quadrilaterals.
Piecewise linear hypersurfaces using the marching cubes algorithm
Roberts, Jonathan C.; Hill, Steve
1999-03-01
Surface visualization is very important within scientific visualization. The surfaces depict a value of equal density (an isosurface) or display the surrounds of specified objects within the data. Likewise, in two dimensions contour plots may be used to display the information. Thus similarly, in four dimensions hypersurfaces may be formed around hyperobjects. These surfaces (or contours) are often formed from a set of connected triangles (or lines). These piecewise segments represent the simplest non-degenerate object of that dimension and are named simplices. In four dimensions a simplex is represented by a tetrahedron, which is also known as a 3- simplex. Thus, a continuous n dimensional surface may be represented by a lattice of connected n-1 dimensional simplices. This lattice of connected simplices may be calculated over a set of adjacent n dimensional cubes, via for example the Marching Cubes Algorithm. We propose that the methods of this local-cell tiling method may be usefully- applied to four dimensions and potentially to N-dimensions. Thus, we organize the large number of traversal cases and major cases; introduce the notion of a sub-case (that enables the large number of cases to be further reduced); and describe three methods for implementing the Marching Cubes lookup table in four-dimensions.
Piecewise linear models for the quasiperiodic transition to chaos
Campbell, D K; Tresser, C; Uherka, D J; Campbell, David K; Galeeva, Roza; Tresser, Charles; Uherka, David J
1995-01-01
We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking and the quasi-periodic transition to chaos. For instance, for these families, we obtain complete solutions to several questions still largely unanswered for families of smooth circle maps. Our main results describe (1) the sets of maps in these families having some prescribed rotation interval; (2) the boundaries between zero and positive topological entropy and between zero length and non-zero length rotation interval; and (3) the structure and bifurcations of the attractors in one of these families. We discuss the interpretation of these maps as low-order spline approximations to the classic ``sine-circle'' map and examine more generally the implications of our results for the case of smooth circle maps. We also mention a possible connection to recent experiments on mode...
Piecewise linear mapping algorithm for SAR raw data compression
Institute of Scientific and Technical Information of China (English)
QI HaiMing; YU WeiDong; CHEN Xi
2008-01-01
When the saturation degree (SD) of space-borne SAR raw data is high, the performance of conventional block adaptive quantization (BAQ) deteriorates obviously. In order to overcome the drawback, this paper studies the mapping between the average signal magnitude (ASM) and the standard deviation of the input signal (SDIS) to the A/D from the original reference. Then, it points out the mistake of the mapping and introduces the concept of the standard deviation of the output signal (SDOS) from the A/D. After that, this paper educes the mapping between the ASM and SDOS from the A/D. Monte-Carlo experiment shows that none of the above two mappings is the optimal in the whole set of SD. Thus, this paper proposes the concept of piecewise linear mapping and the searching algorithm in the whole set of SD. According to the linear part, this paper gives the certification and analytical value of k and for nonlinear part, and utilizes the searching algorithm mentioned above to search the corresponding value of k. Experimental results based on simulated data and real data show that the performance of new algorithm is better than conventional BAQ when raw data is in heavy SD.
One Line or Two? Perspectives on Piecewise Regression
Energy Technology Data Exchange (ETDEWEB)
R.P. Ewing; D.W. Meek
2006-10-12
Sometimes we are faced with data that could reasonably be represented either as a single line, or as two or more line segments. How do we identify the best breakpoint(s), and decide how many segments are ''really'' present? Most of us are taught to distrust piecewise regression, because it can be easily abused. The best method for identifying the breakpoint varies according to specifics of the data; for example, the minimum sum of squares method excels for ''well-behaved'' data. In some cases, hidden Markov methods are more likely to succeed than are more ''obvious'' methods. Likewise, the most appropriate method for deciding between one or two lines depends on your expectations and understanding of the data: an unexpected break requires more justification than an expected one, and some decision criteria (e.g., the Akaike Information Criterion) are less strict than others (e.g., the Bayesian Information Criterion). This presentation will review some options and make specific, practical recommendations.
Interactive seismic interpretation with piecewise global energy minimization
Hollt, Thomas
2011-03-01
Increasing demands in world-wide energy consumption and oil depletion of large reservoirs have resulted in the need for exploring smaller and more complex oil reservoirs. Planning of the reservoir valorization usually starts with creating a model of the subsurface structures, including seismic faults and horizons. However, seismic interpretation and horizon tracing is a difficult and error-prone task, often resulting in hours of work needing to be manually repeated. In this paper, we propose a novel, interactive workflow for horizon interpretation based on well positions, which include additional geological and geophysical data captured by actual drillings. Instead of interpreting the volume slice-by-slice in 2D, we propose 3D seismic interpretation based on well positions. We introduce a combination of 2D and 3D minimal cost path and minimal cost surface tracing for extracting horizons with very little user input. By processing the volume based on well positions rather than slice-based, we are able to create a piecewise optimal horizon surface at interactive rates. We have integrated our system into a visual analysis platform which supports multiple linked views for fast verification, exploration and analysis of the extracted horizons. The system is currently being evaluated by our collaborating domain experts. © 2011 IEEE.
A Piecewise Hysteresis Model for a Damper of HIS System
Directory of Open Access Journals (Sweden)
Kaidong Tian
2016-01-01
Full Text Available A damper of the hydraulically interconnected suspension (HIS system, as a quarter HIS, is prototyped and its damping characteristic is tested to characterize the damping property. The force-velocity characteristic of the prototype is analyzed based on a set of testing results and accordingly a piecewise hysteresis model for the damper is proposed. The proposed equivalent parametric model consists of two parts: hysteresis model in low speed region and saturation model in high speed region which are used to describe the hysteresis phenomenon in low speed and nonhysteresis phenomenon in high speed, respectively. The parameters of the model are identified based on genetic algorithm by setting the constraints of parameters according to their physical significances and the corresponding testing results. The advantages of the model are highlighted by comparing to the nonhysteresis model and the permanent hysteresis model. The numerical simulation results are compared with the testing results to validate the accuracy and effectiveness of the proposed model. Finally, to further verify the proposed model’s wide applicability under different excitation conditions, its results are compared to the testing results in three-dimensional space. The research in this paper is significant for the dynamic analysis of the HIS vehicle.
The N(o)ther and Riemann-Roch type theorems for piecewise algebraic curve
Institute of Scientific and Technical Information of China (English)
Yi-sheng LAI; Ren-hong WANG
2007-01-01
A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function. In this paper, the N(o)ther type theorems for Cμ piecewise algebraic curves are obtained.The theory of the linear series of sets of places on the piecewise algebraic curve is also established.In this theory, singular cycles are put into the linear series, and a complete series of the piecewise algebraic curves consists of all effective ordinary cycles in an equivalence class and all effective singular cycles which are equivalent specifically to any effective ordinary cycle in the equivalence class. This theory is a generalization of that of linear series of the algebraic curve. With this theory and the fundamental theory of multivariate splines on smoothing cofactors and global conformality conditions,and the results on the general expression of multivariate splines, we get a formula on the index, the order and the dimension of a complete series of the irreducible Cμ piecewise algebraic curves and the degree, the genus and the smoothness of the curves, hence the Riemann-Roch type theorem of the Cμpiecewise algebraic curve is established.
The Nother and Riemann-Roch type theorems for piecewise algebraic curve
Institute of Scientific and Technical Information of China (English)
2007-01-01
A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function. In this paper, the Nother type theorems for Cμpiecewise algebraic curves are obtained. The theory of the linear series of sets of places on the piecewise algebraic curve is also established. In this theory, singular cycles are put into the linear series, and a complete series of the piecewise algebraic curves consists of all effective ordinary cycles in an equivalence class and all effective singular cycles which are equivalent specifically to any effective ordinary cycle in the equivalence class. This theory is a generalization of that of linear series of the algebraic curve. With this theory and the fundamental theory of multivariate splines on smoothing cofactors and global conformality conditions, and the results on the general expression of multivariate splines, we get a formula on the index, the order and the dimension of a complete series of the irreducible Cμpiecewise algebraic curves and the degree, the genus and the smoothness of the curves, hence the Riemann-Roch type theorem of the Cμpiecewise algebraic curve is established.
Monotonicity Formula and Regularity for General Free Discontinuity Problems
Bucur, Dorin; Luckhaus, Stephan
2014-02-01
We give a general monotonicity formula for local minimizers of free discontinuity problems which have a critical deviation from minimality, of order d - 1. This result allows us to prove partial regularity results (that is closure and density estimates for the jump set) for a large class of free discontinuity problems involving general energies associated to the jump set, as for example free boundary problems with Robin conditions. In particular, we give a short proof to the De Giorgi-Carriero-Leaci result for the Mumford-Shah functional.
The Non-Monotonic Effect of Financing Constraints on Investment
DEFF Research Database (Denmark)
Hirth, Stefan; Viswanatha, Marc
We analyze investment timing in a discrete-time framework with two possible investment dates, which is an extension of the model by Lyandres (2007). While Lyandres could only show non-monotonicity of investment in market frictions, we derive an investment threshold that is U-shaped in the firm's ......'s liquid funds, a result similar to the infinite-horizon model by Boyle and Guthrie (2003). However, due to the tractability of our model, we can more clearly explain the relevant trade-offs leading to the U-shape....
Stability of generalized monotonicity with respect to their characterizations
An, P T
2002-01-01
We show that known types of generalized monotone maps are not stable with respect to their characterizations (i.e., the characterizations are not maintained during an arbitrary map of this type is disturbed by an element with sufficiently small norm) then introduce s-quasimonotone maps, which are stable with respect to their characterization. For gradient maps, s-quasimonotonicity is related to s-quasiconvexity of the underlying function. A necessary and sufficient condition for a univariate polynomial to be s-quasimonotone is given. Furthermore, some stability properties of a-quasiconvex functions are presented.
Deterministic homogenization of parabolic monotone operators with time dependent coefficients
Directory of Open Access Journals (Sweden)
Gabriel Nguetseng
2004-06-01
Full Text Available We study, beyond the classical periodic setting, the homogenization of linear and nonlinear parabolic differential equations associated with monotone operators. The usual periodicity hypothesis is here substituted by an abstract deterministic assumption characterized by a great relaxation of the time behaviour. Our main tool is the recent theory of homogenization structures by the first author, and our homogenization approach falls under the two-scale convergence method. Various concrete examples are worked out with a view to pointing out the wide scope of our approach and bringing the role of homogenization structures to light.
A Neurodynamic Model to Solve Nonlinear Pseudo-Monotone Projection Equation and Its Applications.
Eshaghnezhad, Mohammad; Effati, Sohrab; Mansoori, Amin
2016-09-29
In this paper, a neurodynamic model is given to solve nonlinear pseudo-monotone projection equation. Under pseudo-monotonicity condition and Lipschitz continuous condition, the projection neurodynamic model is proved to be stable in the sense of Lyapunov, globally convergent, globally asymptotically stable, and globally exponentially stable. Also, we show that, our new neurodynamic model is effective to solve the nonconvex optimization problems. Moreover, since monotonicity is a special case of pseudo-monotonicity and also since a co-coercive mapping is Lipschitz continuous and monotone, and a strongly pseudo-monotone mapping is pseudo-monotone, the neurodynamic model can be applied to solve a broader classes of constrained optimization problems related to variational inequalities, pseudo-convex optimization problem, linear and nonlinear complementarity problems, and linear and convex quadratic programming problems. Finally, several illustrative examples are stated to demonstrate the effectiveness and efficiency of our new neurodynamic model.
Testing monotonicity of a hazard: asymptotic distribution theory
Groeneboom, Piet
2011-01-01
Two new test statistics are introduced to test the null hypotheses that the sampling distribution has an increasing hazard rate on a specified interval [0,a]. These statistics are empirical L_1-type distances between the isotonic estimates, which use the monotonicity constraint, and either the empirical distribution function or the empirical cumulative hazard. They measure the excursions of the empirical estimates with respect to the isotonic estimates, due to local non-monotonicity. Asymptotic normality of the test statistics, if the hazard is strictly increasing on [0,a], is established under mild conditions. This is done by first approximating the global empirical distance by an distance with respect to the underlying distribution function. The resulting integral is treated as sum of increasingly many local integrals to which a CLT can be applied. The behavior of the local integrals is determined by a canonical process: the difference between the stochastic process x -> W(x)+x^2 where W is standard two-sid...
DATA PREORDERING IN GENERALIZED PAV ALGORITHM FOR MONOTONIC REGRESSION
Institute of Scientific and Technical Information of China (English)
Oleg Burdakov; Anders Grimvall; Oleg Sysoev
2006-01-01
Monotonic regression (MR) is a least distance problem with monotonicity constraints induced by a partially ordered data set of observations. In our recent publication [In Ser.Nonconvex Optimization and Its Applications, Springer-Verlag, (2006) 83, pp. 25-33],the Pool-Adjacent-Violators algorithm (PAV) was generalized from completely to partially ordered data sets (posets). The new algorithm, called GPAV, is characterized by the very low computational complexity, which is of second order in the number of observations.It treats the observations in a consecutive order, and it can follow any arbitrarily chosen topological order of the poset of observations. The GPAV algorithm produces a sufficiently accurate solution to the MR problem, but the accuracy depends on the chosen topological order. Here we prove that there exists a topological order for which the resulted GPAV solution is optimal. Furthermore, we present results of extensive numerical experiments,from which we draw conclusions about the most and the least preferable topological orders.
The regularized monotonicity method: detecting irregular indefinite inclusions
DEFF Research Database (Denmark)
Garde, Henrik; Staboulis, Stratos
2017-01-01
In inclusion detection in electrical impedance tomography, the support of perturbations (inclusion) from a known background conductivity is typically reconstructed from idealized continuum data modelled by a Neumann-to-Dirichlet map. Only few reconstruction methods apply when detecting indefinite...... of approximative measurement models, including the Complete Electrode Model, hence making the method robust against modelling error and noise. In particular, we demonstrate that for a convergent family of approximative models there exists a sequence of regularization parameters such that the outer shape...... of the inclusions is asymptotically exactly characterized. Finally, a peeling-type reconstruction algorithm is presented and, for the first time in literature, numerical examples of monotonicity reconstructions for indefinite inclusions are presented....
Convex analysis and monotone operator theory in Hilbert spaces
Bauschke, Heinz H
2017-01-01
This reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, ma...
Monotonic childhoods: representations of otherness in research writing
Directory of Open Access Journals (Sweden)
Denise Marcos Bussoletti
2011-12-01
Full Text Available This paper is part of a doctoral thesis entitled “Monotonic childhoods – a rhapsody of hope”. It follows the perspective of a critical psychosocial and cultural study, and aims at discussing the other’s representation in research writing, electing childhood as an allegorical and refl ective place. It takes into consideration, by means of analysis, the drawings and poems of children from the Terezin ghetto during the Second World War. The work is mostly based on Serge Moscovici’s Social Representation Theory, but it is also in constant dialogue with other theories and knowledge fi elds, especially Walter Benjamin’s and Mikhail Bakhtin’s contributions. At the end, the paper supports the thesis that conceives poetics as one of the translation axes of childhood cultures.
PPA BASED PREDICTION-CORRECTION METHODS FOR MONOTONE VARIATIONAL INEQUALITIES
Institute of Scientific and Technical Information of China (English)
He Bingsheng; Jiang Jianlin; Qian Maijian; Xu Ya
2005-01-01
In this paper we study the proximal point algorithm (PPA) based predictioncorrection (PC) methods for monotone variational inequalities. Each iteration of these methods consists of a prediction and a correction. The predictors are produced by inexact PPA steps. The new iterates are then updated by a correction using the PPA formula. We present two profit functions which serve two purposes: First we show that the profit functions are tight lower bounds of the improvements obtained in each iteration. Based on this conclusion we obtain the convergence inexactness restrictions for the prediction step. Second we show that the profit functions are quadratically dependent upon the step lengths, thus the optimal step lengths are obtained in the correction step. In the last part of the paper we compare the strengths of different methods based on their inexactness restrictions.
Strong convergence theorems for maximal monotone mappings in Banach spaces
Zegeye, Habtu
2008-07-01
Let E be a uniformly convex and 2-uniformly smooth real Banach space with dual E*. Let be a Lipschitz continuous monotone mapping with A-1(0)[not equal to][empty set]. For given u,x1[set membership, variant]E, let {xn} be generated by the algorithm xn+1:=[beta]nu+(1-[beta]n)(xn-[alpha]nAJxn), n[greater-or-equal, slanted]1, where J is the normalized duality mapping from E into E* and {[lambda]n} and {[theta]n} are real sequences in (0,1) satisfying certain conditions. Then it is proved that, under some mild conditions, {xn} converges strongly to x*[set membership, variant]E where Jx*[set membership, variant]A-1(0). Finally, we apply our convergence theorems to the convex minimization problems.
A COMPARISON OF DIFFERENT CONTRACTION METHODS FOR MONOTONE VARIATIONAL INEQUALITIES
Institute of Scientific and Technical Information of China (English)
Bingsheng He; Xiang Wang; Junfeng Yang
2009-01-01
It is interesting to compare the efficiency of two methods when their computational loads in each iteration are equal. In this paper, two classes of contraction methods for monotone variational inequalities are studied in a unified framework. The methods of both classes can be viewed as prediction-correction methods, which generate the same test vector in the prediction step and adopt the same step-size rule in the correction step. The only difference is that they use different search directions. The computational loads of each iteration of the different classes are equal. Our analysis explains theoretically why one class of the contraction methods usually outperforms the other class. It is demonstrated that many known methods belong to these two classes of methods. Finally, the presented numerical results demonstrate the validity of our analysis.
A new non-monotone fitness scaling for genetic algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The properties of selection operators in the genetic algorithm (GA) are studied in detail. It is indicated that the selection of operations is significant for both improving the general fitness of a population and leading to the schema deceptiveness. The stochastic searching characteristics of GA are compared with those of heuristic methods. The influence of selection operators on the GA' s exploration and exploitation is discussed, and the performance of selection operators is evaluated with the premature convergence of the GA taken as an example based on One-Max function. In order to overcome the schema deceptiveness of the GA, a new type of fitness scaling, non monotone scaling, is advanced to enhance the evolutionary ability of a population. The effectiveness of the new scaling method is tested by a trap function and a needle-in-haystack (NiH) function.
MINLIP for the Identification of Monotone Wiener Systems
Pelckmans, Kristiaan
2010-01-01
This paper studies the MINLIP estimator for the identification of Wiener systems consisting of a sequence of a linear FIR dynamical model, and a monotonically increasing (or decreasing) static function. Given $T$ observations, this algorithm boils down to solving a convex quadratic program with $O(T)$ variables and inequality constraints, implementing an inference technique which is based entirely on model complexity control. The resulting estimates of the linear submodel are found to be almost consistent when no noise is present in the data, under a condition of smoothness of the true nonlinearity and local Persistency of Excitation (local PE) of the data. This result is novel as it does not rely on classical tools as a 'linearization' using a Taylor decomposition, nor exploits stochastic properties of the data. It is indicated how to extend the method to cope with noisy data, and empirical evidence contrasts performance of the estimator against other recently proposed techniques.
A new approximate proximal point algorithm for maximal monotone operator
Institute of Scientific and Technical Information of China (English)
HE; Bingsheng(何炳生); LIAO; Lizhi(廖立志); YANG; Zhenhua(杨振华)
2003-01-01
The problem concerned in this paper is the set-valued equation 0 ∈ T(z) where T is a maximal monotone operator. For given xk and βk ＞ 0, some existing approximate proximal point algorithms take xk+1 = xk such that xk +ek∈ xk + βkT(xk) and||ek|| ≤ηk||xk - xk||, where {ηk} is a non-negative summable sequence. Instead of xk+1 = xk, the new iterate of the proposing method is given by xk+1 = PΩ[xk - ek], where Ω is the domain of T and PΩ(@) denotes the projection on Ω. The convergence is proved under a significantly relaxed restriction supk＞0 ηk ＜ 1.
Dose reduction using a dynamic, piecewise-linear attenuator
Energy Technology Data Exchange (ETDEWEB)
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Fleischmann, Dominik [Department of Radiology, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-02-15
Purpose: The authors recently proposed a dynamic, prepatient x-ray attenuator capable of producing a piecewise-linear attenuation profile customized to each patient and viewing angle. This attenuator was intended to reduce scatter-to-primary ratio (SPR), dynamic range, and dose by redistributing flux. In this work the authors tested the ability of the attenuator to reduce dose and SPR in simulations. Methods: The authors selected four clinical applications, including routine full field-of-view scans of the thorax and abdomen, and targeted reconstruction tasks for an abdominal aortic aneurysm and the pancreas. Raw data were estimated by forward projection of the image volume datasets. The dynamic attenuator was controlled to reduce dose while maintaining peak variance by solving a convex optimization problem, assuminga priori knowledge of the patient anatomy. In targeted reconstruction tasks, the noise in specific regions was given increased weighting. A system with a standard attenuator (or “bowtie filter”) was used as a reference, and used either convex optimized tube current modulation (TCM) or a standard TCM heuristic. The noise of the scan was determined analytically while the dose was estimated using Monte Carlo simulations. Scatter was also estimated using Monte Carlo simulations. The sensitivity of the dynamic attenuator to patient centering was also examined by shifting the abdomen in 2 cm intervals. Results: Compared to a reference system with optimized TCM, use of the dynamic attenuator reduced dose by about 30% in routine scans and 50% in targeted scans. Compared to the TCM heuristics which are typically used withouta priori knowledge, the dose reduction is about 50% for routine scans. The dynamic attenuator gives the ability to redistribute noise and variance and produces more uniform noise profiles than systems with a conventional bowtie filter. The SPR was also modestly reduced by 10% in the thorax and 24% in the abdomen. Imaging with the dynamic
Payoff-monotonic game dynamics and the maximum clique problem.
Pelillo, Marcello; Torsello, Andrea
2006-05-01
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result from graph theory that formulates the maximum clique problem as a standard (continuous) quadratic program and exploits the dynamical properties of these models, which, under a certain symmetry assumption, possess a Lyapunov function. In this letter, we generalize previous work along these lines in several respects. We introduce a wide family of game-dynamic equations known as payoff-monotonic dynamics, of which replicator dynamics are a special instance, and show that they enjoy precisely the same dynamical properties as standard replicator equations. These properties make any member of this family a potential heuristic for solving standard quadratic programs and, in particular, the maximum clique problem. Extensive simulations, performed on random as well as DIMACS benchmark graphs, show that this class contains dynamics that are considerably faster than and at least as accurate as replicator equations. One problem associated with these models, however, relates to their inability to escape from poor local solutions. To overcome this drawback, we focus on a particular subclass of payoff-monotonic dynamics used to model the evolution of behavior via imitation processes and study the stability of their equilibria when a regularization parameter is allowed to take on negative values. A detailed analysis of these properties suggests a whole class of annealed imitation heuristics for the maximum clique problem, which are based on the idea of varying the parameter during the imitation optimization process in a principled way, so as to avoid unwanted inefficient solutions. Experiments show that the proposed annealing procedure does help to avoid poor local optima by initially driving the dynamics toward promising regions in
Piecewise-homogeneous model for electron side injection into linear plasma waves
Energy Technology Data Exchange (ETDEWEB)
Golovanov, A.A., E-mail: agolovanov256@gmail.com; Kostyukov, I.Yu., E-mail: kost@appl.sci-nnov.ru
2016-09-01
An analytical piecewise-homogeneous model for electron side injection into linear plasma waves is developed. The dynamics of transverse betatron oscillations are studied. Based on the characteristics of the transversal motion the longitudinal motion of electrons is described. The electron parameters for which the electron trapping and subsequent acceleration are possible are estimated. The analytical results are verified by numerical simulations in the scope of the piecewise-homogeneous model. The results predicted by this model are also compared to the results given by a more realistic inhomogeneous model. - Highlights: • A piecewise-homogeneous model of side injection into a linear wakefield is developed. • The dynamics of betatron oscillations in the focusing phase is analytically studied. • The area of parameters for electron trapping is determined. • The model is compared to a more realistic inhomogeneous model.
Multi-Dimensional Piece-Wise Self-Affine Fractal Interpolation Model
Institute of Scientific and Technical Information of China (English)
ZHANG Tong; ZHUANG Zhuo
2007-01-01
Iterated function system (IFS) models have been used to represent discrete sequences where the attractor of the IFS is piece-wise self-affine in R2 or R3 (R is the set of real numbers). In this paper, the piece-wise self-affine IFS model is extended from R3 to Rn (n is an integer greater than 3), which is called the multi-dimensional piece-wise self-affine fractal interpolation model. This model uses a "mapping partial derivative", and a constrained inverse algorithm to identify the model parameters. The model values depend continuously on all the model parameters, and represent most data which are not multi-dimensional self-affine in Rn. Therefore, the result is very general. The class of functions obtained is much more diverse because their values depend continuously on all of the variables, with all the coefficients of the possible multi-dimensional affine maps determining the functions.
Strong Stationary Duality for M\\"obius Monotone Markov Chains: Unreliable Networks
Lorek, Pawel
2011-01-01
For Markov chains with a partially ordered finite state space we show strong stationary duality under the condition of M\\"obius monotonicity of the chain. We show relations of M\\"obius monotonicity to other definitions of monotone chains. We give examples of dual chains in this context which have transitions only upwards. We illustrate general theory by an analysis of nonsymmetric random walks on the cube with an application to networks of queues.
On a correspondence between regular and non-regular operator monotone functions
DEFF Research Database (Denmark)
Gibilisco, P.; Hansen, Frank; Isola, T.
2009-01-01
We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information.......We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information....
Non-monotonic dynamics and crosstalk in signaling pathways and their implications for pharmacology
van Wijk, Roeland; Tans, Sander J.; Wolde, Pieter Rein Ten; Mashaghi, Alireza
2015-06-01
Currently, drug discovery approaches commonly assume a monotonic dose-response relationship. However, the assumption of monotonicity is increasingly being challenged. Here we show that for two simple interacting linear signaling pathways that carry two different signals with different physiological responses, a non-monotonic input-output relation can arise with simple network topologies including coherent and incoherent feed-forward loops. We show that non-monotonicity of the response functions has severe implications for pharmacological treatment. Fundamental constraints are imposed on the effectiveness and toxicity of any drug independent of its chemical nature and selectivity due to the specific network structure.
Institute of Scientific and Technical Information of China (English)
Igor Boglaev; Matthew Hardy
2008-01-01
This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type.To solve the nonlinear weighted average finite difference scheme for the partial differential equation,we construct a monotone domain decomposition algorithm based on a Schwarz alternating method and a box-domain decomposition.This algorithm needs only to solve linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear discrete problem. The rate of convergence of the monotone domain decomposition algorithm is estimated.Numerical experiments are presented.
Meneses, Domingos De Sousa; Rousseau, Benoit; Echegut, Patrick; Matzen, Guy
2007-06-01
A new expression of dielectric function model based on piecewise polynomials is introduced. Its association with spline and more recent shape preserving interpolation algorithms allows easy reproduction of every kind of experimental spectra and thus retrieval of all the linear optical functions of a material. Based on a pure mathematical framework, the expression of the model is always applicable and does not necessitate any knowledge of the microscopic mechanisms of absorption responsible for the optical response. The potential of piecewise polynomial dielectric functions is shown through synthetic examples and the analysis of experimental spectra.
A Piecewise Affine Hybrid Systems Approach to Fault Tolerant Satellite Formation Control
DEFF Research Database (Denmark)
Grunnet, Jacob Deleuran; Larsen, Jesper Abildgaard; Bak, Thomas
2008-01-01
In this paper a procedure for modelling satellite formations including failure dynamics as a piecewise-affine hybrid system is shown. The formulation enables recently developed methods and tools for control and analysis of piecewise-affine systems to be applied leading to synthesis of fault...... tolerant controllers and analysis of the system behaviour given possible faults. The method is illustrated using a simple example involving two satellites trying to reach a specific formation despite of actuator faults occurring....
Passive Fault-tolerant Control of Discrete-time Piecewise Affine Systems against Actuator Faults
DEFF Research Database (Denmark)
Tabatabaeipour, Seyed Mojtaba; Izadi-Zamanabadi, Roozbeh; Bak, Thomas
2012-01-01
In this paper, we propose a new method for passive fault-tolerant control of discrete time piecewise affine systems. Actuator faults are considered. A reliable piecewise linear quadratic regulator (LQR) state feedback is designed such that it can tolerate actuator faults. A sufficient condition...... for the exis- tence of a passive fault-tolerant controller is derived and formulated as the feasibility of a set of linear matrix inequalities (LMIs). The upper bound on the performance cost can be minimized using a convex optimization problem with LMI constraints which can be solved efficiently. The approach...
DEFF Research Database (Denmark)
Ahmadi, Mohamadreza; Mojallali, Hamed; Wisniewski, Rafal
2012-01-01
This paper addresses the robust stability and control problem of uncertain piecewise linear switched systems where, instead of the conventional Carathe ́odory solutions, we allow for Filippov solutions. In other words, in contrast to the previous studies, solutions with infinite switching in finite...... time along the facets and on faces of arbitrary dimensions are also taken into account. Firstly, based on earlier results, the stability problem of piecewise linear systems with Filippov solutions is translated into a number of linear matrix inequality feasibility tests. Subsequently, a set of matrix...
A Piecewise Affine Hybrid Systems Approach to Fault Tolerant Satellite Formation Control
DEFF Research Database (Denmark)
Grunnet, Jacob Deleuran; Larsen, Jesper Abildgaard; Bak, Thomas
2008-01-01
In this paper a procedure for modelling satellite formations including failure dynamics as a piecewise-affine hybrid system is shown. The formulation enables recently developed methods and tools for control and analysis of piecewise-affine systems to be applied leading to synthesis of fault...... tolerant controllers and analysis of the system behaviour given possible faults. The method is illustrated using a simple example involving two satellites trying to reach a specific formation despite of actuator faults occurring....
Global behaviour of a predator-prey like model with piecewise constant arguments.
Kartal, Senol; Gurcan, Fuat
2015-01-01
The present study deals with the analysis of a predator-prey like model consisting of system of differential equations with piecewise constant arguments. A solution of the system with piecewise constant arguments leads to a system of difference equations which is examined to study boundedness, local and global asymptotic behaviour of the positive solutions. Using Schur-Cohn criterion and a Lyapunov function, we derive sufficient conditions under which the positive equilibrium point is local and global asymptotically stable. Moreover, we show numerically that periodic solutions arise as a consequence of Neimark-Sacker bifurcation of a limit cycle.
The Cauchy Boundary Value Problems on Closed Piecewise Smooth Manifolds in Cn
Institute of Scientific and Technical Information of China (English)
Liang Yu LIN; Chun Hui QIU
2004-01-01
Suppose that D is a bounded domain with a piecewise C1 smooth boundary in Cn. Let ψ∈ C1+α((б)D). By using the Hadamard principal value of the higher order singular integral and solid angle coefficient method of points on the boundary, we give the Plemelj formula of the higher order singular integral with the Bochner-Martinelli kernel, which has integral density ψ. Moreover,by means of the Plemelj formula and methods of complex partial differential equations, we discuss the corresponding Cauchy boundary value problem with the Bochner-Martinelli kernel on a closed piecewise smooth manifold and obtain its unique branch complex harmonic solution.
Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates
Borodin, Allan; Ye, Yuli
2012-01-01
Result diversification has many important applications in databases, operations research, information retrieval, and finance. In this paper, we study and extend a particular version of result diversification, known as max-sum diversification. More specifically, we consider the setting where we are given a set of elements in a metric space and a set valuation function $f$ defined on every subset. For any given subset $S$, the overall objective is a linear combination of $f(S)$ and the sum of the distances induced by $S$. The goal is to find a subset $S$ satisfying some constraints that maximizes the overall objective. This problem is first studied by Gollapudi and Sharma for modular set functions and for sets satisfying a cardinality constraint. We consider an extension of the modular case to the monotone submodular case, for which the previous algorithm no longer applies. Interestingly, we are able to match the 2-approximation using a natural, but different greedy algorithm. We then further extend the problem...
Non-monotonicity of trace distance under tensor products
Energy Technology Data Exchange (ETDEWEB)
Maziero, Jonas, E-mail: jonas.maziero@ufsm.br [Universidade Federal de Santa Maria (UFSM), RS (Brazil). Departamento de Fisica
2015-10-15
The trace distance (TD) possesses several of the good properties required for a faithful distance measure in the quantum state space. Despite its importance and ubiquitous use in quantum information science, one of its questionable features, its possible non-monotonicity under taking tensor products of its arguments (NMuTP), has been hitherto unexplored. In this article, we advance analytical and numerical investigations of this issue considering different classes of states living in a discrete and finite dimensional Hilbert space. Our results reveal that although this property of TD does not show up for pure states and for some particular classes of mixed states, it is present in a non-negligible fraction of the regarded density operators. Hence, even though the percentage of quartets of states leading to the NMuTP drawback of TD and its strength decrease as the system's dimension grows, this property of TD must be taken into account before using it as a figure of merit for distinguishing mixed quantum states. (author)
Completely Monotone Multisequences, Symmetric Probabilities and a Normal Limit Theorem
Indian Academy of Sciences (India)
J C Gupta
2000-11-01
Let G, be the set of all partial completely monotone multisequences of order and degree , i.e., multisequences (1, 2,$\\ldots$ ,k), 1, 2,$\\ldots$ , = 0, 1, 2,$\\ldots$ ,1 + 2 + \\$cdots$ + ≤ n, (0,0,$\\ldots$ ,0) = 1 and $(-1)^{_0}^{_0}$ (1, 2,$\\ldots$ ,)≥ 0 whenever 0 ≤ -(1 + 2 +$\\cdots$ +) where (1, 2,$\\ldots$ ,)=(1+1, 2,$\\ldots$ ,)+ (1,2+1,$\\ldots$ ,)+$\\cdots$ + (1, 2,$\\ldots$ ,+1)-(1,2,$\\ldots$ ,)$. Further, let $\\prod_{n,k}$ be the set of all symmetric probabilities on ${0, 1, 2,\\ldots ,k}^{n}$. We establish a one-to-one correspondence between the sets G, and $\\prod_{n, k}$ and use it to formulate and answer interesting questions about both. Assigning to G, the uniform probability measure, we show that, as → ∞ , any fixed section {(1, 2,$\\ldots$ ,), 1 ≤ $\\sum ≤ }, properly centered and normalized, is asymptotically multivariate normal. That is, $\\left\\{\\sqrt{\\left(\\binom{n+k}{k}\\right)}((1, 2,\\ldots ,)-c_0(1, 2,\\ldots ,), 1≤ _1+2+\\cdots +_k≤ m\\right\\}$ converges weakly to MVN[0,]; the centering constants 0(1, 2,$\\ldots$ ,) and the asymptotic covariances depend on the moments of the Dirichlet $(1, 1,\\ldots ,1; 1)$ distribution on the standard simplex in .
Directory of Open Access Journals (Sweden)
Zhinan Xia
2015-07-01
Full Text Available In this article, we show sufficient conditions for the existence, uniqueness and attractivity of piecewise weighted pseudo almost periodic classical solution of nonlinear impulsive integro-differential equations. The working tools are based on the fixed point theorem and fractional powers of operators. An application to impulsive integro-differential equations is presented.
Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries
Directory of Open Access Journals (Sweden)
Shay Kels
2010-07-01
Full Text Available The metric average is a binary operation between sets in Rn which is used in the approximation of set-valued functions. We introduce an algorithm that applies tools of computational geometry to the computation of the metric average of 2D sets with piecewise linear boundaries.
Model predictive control for Max-Plus-Linear and piecewise affine systems
Necoara, I.
2006-01-01
This Ph.D. thesis considers the development of new analysis and control techniques for special classes of hybrid systems and discrete event systems. Two particular classes of hybrid systems (piecewise affine systems and max-min-plus-scaling systems), and two particular classes of discrete event
Moses, Tim
2013-01-01
The purpose of this study was to evaluate the use of adjoined and piecewise linear approximations (APLAs) of raw equipercentile equating functions as a postsmoothing equating method. APLAs are less familiar than other postsmoothing equating methods (i.e., cubic splines), but their use has been described in historical equating practices of…
Directory of Open Access Journals (Sweden)
Pradeep Kumar
2013-10-01
Full Text Available The objective of this article is to prove the existence of piecewise continuous mild solutions to impulsive functional differential equation with iterated deviating arguments in a Banach space. The results are obtained by using the theory of analytic semigroups and fixed point theorems.
Robust Stabilization for Uncertain Control Systems Using Piecewise Quadratic Lyapunov Functions
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
The sufficient condition based on piecewise quadratic simultaneous Lyapunov functions for robust stabilizationof uncertain control systems via a constant linear state feedback control law is obtained. The objective is to use a robuststability criterion that is less conservative than the usual quadratic stability criterion. Numerical example is given, show-ing the advanteges of the proposed method.
Institute of Scientific and Technical Information of China (English)
冯月才
2004-01-01
The oscillatory and asymptotic behavior of a class of first order nonlinear neutral differential equation with piecewise constant delay and with diverse deviating arguments are considered. We prove that all solutions of the equation are nonoscillatory and give sufficient criteria for asymptotic behavior of nonoscillatory solutions of equation.
Robust observer-based fault estimation and accommodation of discrete-time piecewise linear systems
DEFF Research Database (Denmark)
Tabatabaeipour, Mojtaba; Bak, Thomas
2013-01-01
In this paper a new integrated observer-based fault estimation and accommodation strategy for discrete-time piecewise linear (PWL) systems subject to actuator faults is proposed. A robust estimator is designed to simultaneously estimate the state of the system and the actuator fault. Then, the es...
DEFF Research Database (Denmark)
Tabatabaeipour, Seyed Mojtaba; Bak, Thomas
2012-01-01
In this paper we consider the problem of fault estimation and accommodation for discrete time piecewise linear systems. A robust fault estimator is designed to estimate the fault such that the estimation error converges to zero and H∞ performance of the fault estimation is minimized. Then...
Transitions from phase-locked dynamics to chaos in a piecewise-linear map
DEFF Research Database (Denmark)
Zhusubaliyev, Z.T.; Mosekilde, Erik; De, S.
2008-01-01
place via border-collision fold bifurcations. We examine the transition to chaos through torus destruction in such maps. Considering a piecewise-linear normal-form map we show that this transition, by virtue of the interplay of border-collision bifurcations with period-doubling and homoclinic...
Model predictive control for Max-Plus-Linear and piecewise affine systems
Necoara, I.
2006-01-01
This Ph.D. thesis considers the development of new analysis and control techniques for special classes of hybrid systems and discrete event systems. Two particular classes of hybrid systems (piecewise affine systems and max-min-plus-scaling systems), and two particular classes of discrete event s
Method of folding a piecewise polynomial function in the delta function integral representation
Energy Technology Data Exchange (ETDEWEB)
Lee, D.K.
1978-12-01
A simple procedure is presented for determining the folded form of a piecewise polynomial function in the delta function integral representation. The procedure is useful in evaluating the autocorrelation function by means of the algebraic convolution technique developed by Polge and Hasy (IEEE Trans. Comput. pp. 970-975, Nov 1973).
The global convergence of the non-quasi-Newton methods with non-monotone line search
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
The non-quasi-Newton methods for unconstrained optimization was investigated. Non-monotone line search procedure is introduced, which is combined with the non-quasi-Newton family. Under the uniform convexity assumption on objective function, the global convergence of the non-quasi-Newton family was proved.Numerical experiments showed that the non-monotone line search was more effective.
How to project onto the monotone nonnegative cone using Pool Adjacent Violators type algorithms
Németh, A B
2012-01-01
The metric projection onto an order nonnegative cone from the metric projection onto the corresponding order cone is derived. Particularly, we can use Pool Adjacent Violators-type algorithms developed for projecting onto the monotone cone for projecting onto the monotone nonnegative cone too.
An analysis of the stability and monotonicity of a kind of control models
Directory of Open Access Journals (Sweden)
LU Yifa
2013-06-01
Full Text Available The stability and monotonicity of control systems with parameters are considered.By the iterative relationship of the coefficients of characteristic polynomials and the Mathematica software,some sufficient conditions for the monotonicity and stability of systems are given.
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems i
A novel complex-system-view-based method for system effectiveness analysis: Monotonic indexes space
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Based on the characteristics of the complex system, this paper presents a novel method, the monotonic indexes space method, for the effectiveness analysis of the complex system. First, it presents some basic concepts and assumption such as the monotonic indexes space, monotonic indexes requirement locus, etc. Second, based on the assumption that indexes are monotonic for the requirements, an algorithm is proposed and applied to numerical approximation of monotonic indexes requirement locus with hyperboxes. Third, this paper proposes two algorithms for acquiring intersection of several monotonic indexes requirement locus. Fourth, this paper proposes the monotonic-index- space based system analysis model such as the system evaluation model, the sensitivity analysis model for indexes. Based on the practical requirement, the concept of fuzzy monotonic indexes requirement locus and the corresponding analysis model are introduced. Finally, this paper applies the above-mentioned models to analyze the effectiveness of a notional anti-stealth-air-defense information system. And the outputs show that the method is promising.
Effects of temperature on monotonic and fatigue properties of carbon fibre epoxy cross ply laminates
Matsuhisa, Y.; King, J.
1993-01-01
The effects of test temperature on damage accumulation behaviour has been studied using "Torayca" T800H / #3631 in conditions of monotonic and fatigue loading. The damage accumulation behaviour was found to vary as a function of the test temperature, with the effect of temperature on the damage behaviour being different between monotonic and fatigue loading.
Effects of temperature on monotonic and fatigue properties of carbon fibre epoxy cross ply laminates
Energy Technology Data Exchange (ETDEWEB)
Matsuhisa, Y. (Composite Materials Research Labs., Toray Industries Inc., Ehime (Japan)); King, J.E. (Composite Materials Research Labs., Toray Industries Inc., Ehime (Japan) Dept. of Materials Science and Metallurgy, Univ. of Cambridge (United Kingdom))
1993-11-01
The effects of test temperature on damage accumulation behaviour has been studied using ''Torayca'' T800H/[3631] in conditions of monotonic and fatigue loading. The damage accumulation behaviour was found to vary as a function of the test temperature, with the effect of temperature on the damage behaviour being different between monotonic and fatigue loading. (orig.).
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems
Kovyrkina, O. A.; Ostapenko, V. V.
2016-05-01
The monotonicity of the CABARET scheme approximating a hyperbolic differential equation with a sign-changing characteristic field is analyzed. Monotonicity conditions for this scheme are obtained in domains where the characteristics have a sign-definite propagation velocity and near sonic lines, on which the propagation velocity changes its sign. These properties of the CABARET scheme are illustrated by test computations.
Tijs, S.H.; Moretti, S.; Brânzei, R.; Norde, H.W.
2005-01-01
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost monotonic allocation rule for mcst-problems i
Computation of displacements for nonlinear elastic beam models using monotone iterations
Directory of Open Access Journals (Sweden)
Philip Korman
1988-01-01
Full Text Available We study displacement of a uniform elastic beam subject to various physically important boundary conditions. Using monotone methods, we discuss stability and instability of solutions. We present computations, which suggest efficiency of monotone methods for fourth order boundary value problems.
Fused Lasso Screening Rules via the Monotonicity of Subdifferentials.
Wang, Jie; Fan, Wei; Ye, Jieping
2015-09-01
Fused Lasso is a popular regression technique that encodes the smoothness of the data. It has been applied successfully to many applications with a smooth feature structure. However, the computational cost of the existing solvers for fused Lasso is prohibitive when the feature dimension is extremely large. In this paper, we propose novel screening rules that are able to quickly identity the adjacent features with the same coefficients. As a result, the number of variables to be estimated can be significantly reduced, leading to substantial savings in computational cost and memory usage. To the best of our knowledge, the proposed approach is the first attempt to develop screening methods for the fused Lasso problem with general data matrix. Our major contributions are: 1) we derive a new dual formulation of fused Lasso that comes with several desirable properties; 2) we show that the new dual formulation of fused Lasso is equivalent to that of the standard Lasso by two affine transformations; 3) we propose a novel framework for developing effective and efficient screening rules for fused Lasso via the monotonicity of the subdifferentials (FLAMS). Some appealing features of FLAMS are: 1) our methods are safe in the sense that the detected adjacent features are guaranteed to have the same coefficients; 2) the dataset needs to be scanned only once to run the screening, whose computational cost is negligible compared to that of solving the fused Lasso; (3) FLAMS is independent of the solvers and can be integrated with any existing solvers. We have evaluated the proposed FLAMS rules on both synthetic and real datasets. The experiments indicate that FLAMS is very effective in identifying the adjacent features with the same coefficients. The speedup gained by FLAMS can be orders of magnitude.
Local Monotonicity and Isoperimetric Inequality on Hypersurfaces in Carnot groups
Directory of Open Access Journals (Sweden)
Francesco Paolo Montefalcone
2010-12-01
Full Text Available Let G be a k-step Carnot group of homogeneous dimension Q. Later on we shall present some of the results recently obtained in [32] and, in particular, an intrinsic isoperimetric inequality for a C2-smooth compact hypersurface S with boundary @S. We stress that S and @S are endowed with the homogeneous measures n????1 H and n????2 H , respectively, which are actually equivalent to the intrinsic (Q - 1-dimensional and (Q - 2-dimensional Hausdor measures with respect to a given homogeneous metric % on G. This result generalizes a classical inequality, involving the mean curvature of the hypersurface, proven by Michael and Simon [29] and Allard [1], independently. One may also deduce some related Sobolev-type inequalities. The strategy of the proof is inspired by the classical one and will be discussed at the rst section. After reminding some preliminary notions about Carnot groups, we shall begin by proving a linear isoperimetric inequality. The second step is a local monotonicity formula. Then we may achieve the proof by a covering argument.We stress however that there are many dierences, due to our non-Euclidean setting.Some of the tools developed ad hoc are, in order, a \\blow-up" theorem, which holds true also for characteristic points, and a smooth Coarea Formula for the HS-gradient. Other tools are the horizontal integration by parts formula and the 1st variation formula for the H-perimeter n????1H already developed in [30, 31] and then generalized to hypersurfaces having non-empty characteristic set in [32]. These results can be useful in the study of minimal and constant horizontal mean curvature hypersurfaces in Carnot groups.
Bi-cubic non-uniform B-spline surface reconstruction for slice contours%断层轮廓的双三次非均匀B样条曲面重构
Institute of Scientific and Technical Information of China (English)
王瑜; 郑津津; 周洪军; 沈连婠
2011-01-01
A surface reconstruction method from the slice contours was proposed. First, feature points were extracted based on curvature feature, and they were resampled in order to get a unification of sampling points in each line (column). Then, the sampling points were interpolated to get a bi-cubic non-uniform B-spline surface. Finally, nodes were inserted on the surface based on distance feature at a certain control accuracy, and the new control points through the least-squares approximation method were calculated to get approximate surface within the permissible range error. Based on the characteristics of slice contours, B-spline cycle and non-cycle B-spline combined, and the calculation of closed and non-closed surface was discussed. It was found that the combination of interpolation and approximation makes the algorithm more rapid and practical.%针对断层图像数据,提出了一种曲面重构的方法.依据曲率特征首先提取各层特征点,对其重采样使每行(列)获得统一的采样点数;再对采样点插值得到非均匀双三次B样条曲面;最后,在一定控制精度下对曲面依据距离特征进行节点插入,通过最小二乘逼近法算出新的控制顶点,从而得到误差在容许范围内的逼近曲面.根据断层轮廓的特点,本算法综合运用了周期B样条和非周期B样条,讨论了封闭曲面和非封闭曲面的计算方法.另外插值和逼近的结合应用使该算法更快速、实用.
Energy Technology Data Exchange (ETDEWEB)
Angelis, G I; Kotasidis, F A; Matthews, J C [Imaging, Proteomics and Genomics, MAHSC, University of Manchester, Wolfson Molecular Imaging Centre, Manchester (United Kingdom); Reader, A J [Montreal Neurological Institute, McGill University, Montreal (Canada); Lionheart, W R, E-mail: georgios.angelis@mmic.man.ac.uk [School of Mathematics, University of Manchester, Alan Turing Building, Manchester (United Kingdom)
2011-07-07
Iterative expectation maximization (EM) techniques have been extensively used to solve maximum likelihood (ML) problems in positron emission tomography (PET) image reconstruction. Although EM methods offer a robust approach to solving ML problems, they usually suffer from slow convergence rates. The ordered subsets EM (OSEM) algorithm provides significant improvements in the convergence rate, but it can cycle between estimates converging towards the ML solution of each subset. In contrast, gradient-based methods, such as the recently proposed non-monotonic maximum likelihood (NMML) and the more established preconditioned conjugate gradient (PCG), offer a globally convergent, yet equally fast, alternative to OSEM. Reported results showed that NMML provides faster convergence compared to OSEM; however, it has never been compared to other fast gradient-based methods, like PCG. Therefore, in this work we evaluate the performance of two gradient-based methods (NMML and PCG) and investigate their potential as an alternative to the fast and widely used OSEM. All algorithms were evaluated using 2D simulations, as well as a single [{sup 11}C]DASB clinical brain dataset. Results on simulated 2D data show that both PCG and NMML achieve orders of magnitude faster convergence to the ML solution compared to MLEM and exhibit comparable performance to OSEM. Equally fast performance is observed between OSEM and PCG for clinical 3D data, but NMML seems to perform poorly. However, with the addition of a preconditioner term to the gradient direction, the convergence behaviour of NMML can be substantially improved. Although PCG is a fast convergent algorithm, the use of a (bent) line search increases the complexity of the implementation, as well as the computational time involved per iteration. Contrary to previous reports, NMML offers no clear advantage over OSEM or PCG, for noisy PET data. Therefore, we conclude that there is little evidence to replace OSEM as the algorithm of choice
Potechin, Aaron
2011-01-01
L (Logarithmic space) versus NL (Non-deterministic logarithmic space) is one of the great open problems in computational complexity theory. In the paper "Bounds on monotone switching networks for directed connectivity", we separated monotone analogues of L and NL using a model called the switching network model. In particular, by considering inputs consisting of just a path and isolated vertices, we proved that any monotone switching network solving directed connectivity on $N$ vertices must have size at least $N^{\\Omega(\\lg(N))}$ and this bound is tight. If we could show a similar result for general switching networks solving directed connectivity, then this would prove that $L \
Energy Technology Data Exchange (ETDEWEB)
Bailey, T S; Chang, J H; Warsa, J S; Adams, M L
2010-12-22
We present a new spatial discretization of the discrete-ordinates transport equation in two-dimensional Cartesian (X-Y) geometry for arbitrary polygonal meshes. The discretization is a discontinuous finite element method (DFEM) that utilizes piecewise bi-linear (PWBL) basis functions, which are formally introduced in this paper. We also present a series of numerical results on quadrilateral and polygonal grids and compare these results to a variety of other spatial discretizations that have been shown to be successful on these grid types. Finally, we note that the properties of the PWBL basis functions are such that the leading-order piecewise bi-linear discontinuous finite element (PWBLD) solution will satisfy a reasonably accurate diffusion discretization in the thick diffusion limit, making the PWBLD method a viable candidate for many different classes of transport problems.
Automated Controller Synthesis for non-Deterministic Piecewise-Affine Hybrid Systems
DEFF Research Database (Denmark)
Grunnet, Jacob Deleuran
a computational tree logic formula and refining the resulting solution to a catalogue of piecewise-affine controllers. The method has been implemented as aMatlab toolbox, PAHSCTRL , using linear matrix inequality feasibility computations for finding the discrete abstraction, UppAal Tiga for solving the discrete...... formations. This thesis uses a hybrid systems model of a satellite formation with possible actuator faults as a motivating example for developing an automated control synthesis method for non-deterministic piecewise-affine hybrid systems (PAHS). The method does not only open an avenue for further research...... in fault tolerant satellite formation control, but can be used to synthesise controllers for a wide range of systems where external events can alter the system dynamics. The synthesis method relies on abstracting the hybrid system into a discrete game, finding a winning strategy for the game meeting...
Energy Technology Data Exchange (ETDEWEB)
Bailey, T.S.; Adams, M.L. [Texas A M Univ., Dept. of Nuclear Engineering, College Station, TX (United States); Yang, B.; Zika, M.R. [Lawrence Livermore National Lab., Livermore, CA (United States)
2005-07-01
We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses piecewise linear weight and basis functions in the finite element approximation, and it can be applied on arbitrary polygonal (2-dimensional) or polyhedral (3-dimensional) grids. We show that this new PWL method gives solutions comparable to those from Palmer's finite-volume method. However, since the PWL method produces a symmetric positive definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids. (authors)
Energy Technology Data Exchange (ETDEWEB)
Bailey, T S; Adams, M L; Yang, B; Zika, M R
2005-07-15
We develop a piecewise linear (PWL) Galerkin finite element spatial discretization for the multi-dimensional radiation diffusion equation. It uses piecewise linear weight and basis functions in the finite element approximation, and it can be applied on arbitrary polygonal (2D) or polyhedral (3D) grids. We show that this new PWL method gives solutions comparable to those from Palmer's finite-volume method. However, since the PWL method produces a symmetric positive definite coefficient matrix, it should be substantially more computationally efficient than Palmer's method, which produces an asymmetric matrix. We conclude that the Galerkin PWL method is an attractive option for solving diffusion equations on unstructured grids.
DEFF Research Database (Denmark)
Tabatabaeipour, Seyed Mojtaba; Bak, Thomas
2012-01-01
In this paper we consider the problem of fault estimation and accommodation for discrete time piecewise linear systems. A robust fault estimator is designed to estimate the fault such that the estimation error converges to zero and H∞ performance of the fault estimation is minimized. Then......, the estimate of fault is used to compensate for the effect of the fault. Hence, using the estimate of fault, a fault tolerant controller using a piecewise linear static output feedback is designed such that it stabilizes the system and provides an upper bound on the H∞ performance of the faulty system....... Sufficient conditions for the existence of robust fault estimator and fault tolerant controller are derived in terms of linear matrix inequalities. Upper bounds on the H∞ performance can be minimized by solving convex optimization problems with linear matrix inequality constraints. The efficiency...
Resonance near Border-Collision Bifurcations in Piecewise-Smooth, Continuous Maps
Simpson, D J W
2010-01-01
Mode-locking regions (resonance tongues) formed by border-collision bifurcations of piecewise-smooth, continuous maps commonly exhibit a distinctive sausage-like geometry with pinch points called "shrinking points". In this paper we extend our unfolding of the piecewise-linear case [{\\em Nonlinearity}, 22(5):1123-1144, 2009] to show how shrinking points are destroyed by nonlinearity. We obtain a codimension-three unfolding of this shrinking point bifurcation for $N$-dimensional maps. We show that the destruction of the shrinking points generically occurs by the creation of a curve of saddle-node bifurcations that smooth one boundary of the sausage, leaving a kink in the other boundary.
Identification of Wiener systems with nonlinearity being piecewise-linear function
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
Identification of the Wiener system with the nonlinear block being a piecewise-linear function is considered in the paper, generalizing the results given by H. E. Chen to the case of noisy observation. Recursive algorithms are given for estimating all unknown parameters contained in the system, and their strong consistency is proved. The estimation method is similar to that used by H. E. Chen for Hammerstein systems with the same nonlinearity. However, the assumption imposed by H. E. Chen on the availability of an upper bound for the nonsmooth points of the piecewise-linear function has been removed in this paper with the help of designing an additional algorithm for estimating the upper bound.
Directory of Open Access Journals (Sweden)
H. Vazquez-Leal
2014-01-01
Full Text Available We present a homotopy continuation method (HCM for finding multiple operating points of nonlinear circuits composed of devices modelled by using piecewise linear (PWL representations. We propose an adaptation of the modified spheres path tracking algorithm to trace the homotopy trajectories of PWL circuits. In order to assess the benefits of this proposal, four nonlinear circuits composed of piecewise linear modelled devices are analysed to determine their multiple operating points. The results show that HCM can find multiple solutions within a single homotopy trajectory. Furthermore, we take advantage of the fact that homotopy trajectories are PWL curves meant to replace the multidimensional interpolation and fine tuning stages of the path tracking algorithm with a simple and highly accurate procedure based on the parametric straight line equation.
Normal form and limit cycle bifurcation of piecewise smooth differential systems with a center
Wei, Lijun; Zhang, Xiang
2016-07-01
In this paper we prove that any Σ-center (either nondegenerate or degenerate) of a planar piecewise Cr smooth vector field Z is topologically equivalent to that of Z0: (x ˙ , y ˙) = (- 1 , 2 x) for y ≥ 0, (x ˙ , y ˙) = (1 , 2 x) for y ≤ 0, and that the homeomorphism between Z and Z0 is Cr smoothness when restricted to each side of the switching line except at the center p. We illustrate by examples that there are degenerate Σ-centers whose flows are conjugate to that of Z0, and also there exist nondegenerate Σ-centers whose flows cannot be conjugate to that of Z0. Finally applying the normal form Z0 together with the piecewise smooth equivalence, we study the number of limit cycles which can be bifurcated from the Σ-center of Z.
Jump bifurcations in some degenerate planar piecewise linear differential systems with three zones
Euzébio, Rodrigo; Pazim, Rubens; Ponce, Enrique
2016-06-01
We consider continuous piecewise-linear differential systems with three zones where the central one is degenerate, that is, the determinant of its linear part vanishes. By moving one parameter which is associated to the equilibrium position, we detect some new bifurcations exhibiting jump transitions both in the equilibrium location and in the appearance of limit cycles. In particular, we introduce the scabbard bifurcation, characterized by the birth of a limit cycle from a continuum of equilibrium points. Some of the studied bifurcations are detected, after an appropriate choice of parameters, in a piecewise linear Morris-Lecar model for the activity of a single neuron activity, which is usually considered as a reduction of the celebrated Hodgkin-Huxley equations.
Directory of Open Access Journals (Sweden)
Essam R. El-Zahar
2016-01-01
Full Text Available A reliable algorithm is presented to develop piecewise approximate analytical solutions of third- and fourth-order convection diffusion singular perturbation problems with a discontinuous source term. The algorithm is based on an asymptotic expansion approximation and Differential Transform Method (DTM. First, the original problem is transformed into a weakly coupled system of ODEs and a zero-order asymptotic expansion of the solution is constructed. Then a piecewise smooth solution of the terminal value reduced system is obtained by using DTM and imposing the continuity and smoothness conditions. The error estimate of the method is presented. The results show that the method is a reliable and convenient asymptotic semianalytical numerical method for treating high-order singular perturbation problems with a discontinuous source term.
On piecewise interpolation techniques for estimating solar radiation missing values in Kedah
Energy Technology Data Exchange (ETDEWEB)
Saaban, Azizan; Zainudin, Lutfi [School of Science Quantitative, UUMCAS, Universiti Utara Malaysia, 06010 Sintok, Kedah (Malaysia); Bakar, Mohd Nazari Abu [Faculty of Applied Science, Universiti Teknologi MARA, 02600 Arau, Perlis (Malaysia)
2014-12-04
This paper discusses the use of piecewise interpolation method based on cubic Ball and Bézier curves representation to estimate the missing value of solar radiation in Kedah. An hourly solar radiation dataset is collected at Alor Setar Meteorology Station that is taken from Malaysian Meteorology Deparment. The piecewise cubic Ball and Bézier functions that interpolate the data points are defined on each hourly intervals of solar radiation measurement and is obtained by prescribing first order derivatives at the starts and ends of the intervals. We compare the performance of our proposed method with existing methods using Root Mean Squared Error (RMSE) and Coefficient of Detemination (CoD) which is based on missing values simulation datasets. The results show that our method is outperformed the other previous methods.
Set-membership state estimation for discrete time piecewise affine systems using zonotopes
DEFF Research Database (Denmark)
Tabatabaeipour, Mojtaba; Stoustrup, Jakob
2013-01-01
This paper presents a method for guaranteed state estimation of discrete time piecewise affine systems with unknown but bounded noise and disturbance. Using zonotopic set representations, the proposed method computes the set of states that are consistent with the model, observation, and bounds...... on the noise and disturbance such that the real state of the system is guaranteed to lie in this set. Because in piecewise affine systems, the state space is partitioned into a number of polyhedral sets, at each iteration the intersection of the zonotopes containing a set-valued estimation of the states...... with each of the polyhedral partitions must be computed. We use an analytic method to compute the intersection as a zonotope and minimize the size of the intersection. A numerical example is provided to illuminate the algorithm....
A Lyapunov method for stability analysis of piecewise-affine systems over non-invariant domains
Rubagotti, Matteo; Zaccarian, Luca; Bemporad, Alberto
2016-05-01
This paper analyses stability of discrete-time piecewise-affine systems, defined on possibly non-invariant domains, taking into account the possible presence of multiple dynamics in each of the polytopic regions of the system. An algorithm based on linear programming is proposed, in order to prove exponential stability of the origin and to find a positively invariant estimate of its region of attraction. The results are based on the definition of a piecewise-affine Lyapunov function, which is in general discontinuous on the boundaries of the regions. The proposed method is proven to lead to feasible solutions in a broader range of cases as compared to a previously proposed approach. Two numerical examples are shown, among which a case where the proposed method is applied to a closed-loop system, to which model predictive control was applied without a-priori guarantee of stability.
Wu, Tiantian; Yang, Xiao-Song
2016-05-01
Based on mathematical analysis, this paper provides a methodology to ensure the existence of heteroclinic cycles in a class of four-dimensional piecewise affine systems. In addition, examples are provided to illustrate the effectiveness of the method.
A New 3-D Piecewise-Linear System for Chaos Generation
Directory of Open Access Journals (Sweden)
Z. Elhadj
2007-06-01
Full Text Available We propose in this paper a new simple continuous-time piecewise-linear three dimensional system for chaos generation. Nonlinearity in this model is introduced by the characteristic function of the Chua's circuit given in [1]. Simulated results of some chaotic attractors are shown and justified numerically via computing the largest Lyapunov exponent. The possibility and the robustness of the circuitry realization is also given and discussed.
Su, Yan; Jun, Xie Cheng
2006-08-01
An algorithm of combining LZC and arithmetic coding algorithm for image compression is presented and both theory deduction and simulation result prove the correctness and feasibility of the algorithm. According to the characteristic of context-based adaptive binary arithmetic coding and entropy, LZC was modified to cooperate the optimized piecewise arithmetic coding, this algorithm improved the compression ratio without any additional time consumption compared to traditional method.
Cao, YY; Lam, J.
2001-01-01
This paper is concerned with simultaneous linear-quadratic (LQ) optimal control design for a set of LTI systems via piecewise constant output feedback. First, the discrete-time simultaneous LQ optimal control design problem is reduced to solving a set of coupled matrix inequalities and an iterative LMI algorithm is presented to compute the feedback gain. Then, simultaneous stabilization and simultaneous LQ optimal control design of a set of LTI continuous-time systems are considered via perio...
Numerical Stability of Differential Equations with Piecewise Constant Arguments of Mixed Type
Institute of Scientific and Technical Information of China (English)
Qi WANG
2013-01-01
This paper deals with the stability analysis of the Euler-Maclaurin method for differential equations with piecewise constant arguments of mixed type.The expression of analytical solution is derived and the stability regions of the analytical solution are given.The necessary and sufficient conditions under which the numerical solution is asymptotically stable are discussed.The conditions under which the analytical stability region is contained in the numerical stability region are obtained and some numerical examples are given.
Directory of Open Access Journals (Sweden)
S. S. Motsa
2012-01-01
Full Text Available This paper centres on the application of the new piecewise successive linearization method (PSLM in solving the chaotic and nonchaotic Chen system. Numerical simulations are presented graphically and comparison is made between the PSLM and Runge-Kutta-based methods. The work shows that the proposed method provides good accuracy and can be easily extended to other dynamical systems including those that are chaotic in nature.
Piecewise-polynomial and cascade models of predistorter for linearization of power amplifier
2012-01-01
To combat non-linear signal distortions in a power amplifier we suggest using predistorter with cascade structure in which first and second nodes have piecewise-polynomial and polynomial models. On example of linearizing the Winner–Hammerstein amplifier model we demonstrate that cascade structure of predistorter improves precision of amplifier’s linearization. To simplify predistorter’s synthesis the degree of polynomial model used in first node should be moderate, while precision should be i...
Passive Fault Tolerant Control of Piecewise Affine Systems Based on H Infinity Synthesis
DEFF Research Database (Denmark)
Gholami, Mehdi; Cocquempot, vincent; Schiøler, Henrik
2011-01-01
In this paper we design a passive fault tolerant controller against actuator faults for discretetime piecewise affine (PWA) systems. By using dissipativity theory and H analysis, fault tolerant state feedback controller design is expressed as a set of Linear Matrix Inequalities (LMIs). In the cur......). In the current paper, the PWA system switches not only due to the state but also due to the control input. The method is applied on a large scale livestock ventilation model....
Stability Analysis of Periodic Orbits in a Class of Duffing-Like Piecewise Linear Vibrators
El Aroudi, A.
2014-09-01
In this paper, we study the dynamical behavior of a Duffing-like piecewise linear (PWL) springmass-damper system for vibration-based energy harvesting applications. First, we present a continuous time single degree of freedom PWL dynamical model of the system. From this PWL model, numerical simulations are carried out by computing frequency response and bifurcation diagram under a deterministic harmonic excitation for different sets of system parameter values. Stability analysis is performed using Floquet theory combined with Fillipov method.
The Diffusion Coefficient For Piecewise Expanding Maps Of The Interval With Metastable States
Dolgopyat, Dmitry
2010-01-01
Consider a piecewise smooth expanding map of the interval possessing several invariant subintervals and the same number of ergodic absolutely continuous invariant probability measures (ACIMs). After this system is perturbed to make the subintervals lose their invariance in such a way that there is a unique ACIM, we show how to approximate the diffusion coefficient for an observable of bounded variation by the diffusion coefficient of a related continuous time Markov chain.
Institute of Scientific and Technical Information of China (English)
2008-01-01
In general normed spaces,we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior.We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function.Moreover,we provide necessary and suffcient conditions about the existence of weak(sharp) Pareto solutions.
Oscillation region of a piecewise-smooth model of the vocal folds
Lucero, Jorge C.; Gajo, Cristiane A.
2006-01-01
The two-mass model of the vocal folds is a popular representation of their dynamical structure used in phonation studies. This paper presents an analysis of a recent piecewise-smooth version of the model. This version has two equilibrium positions, and in one of them (the initial prephonatory position) the system is nondifferentiable. Standard methods of stability analysis do not apply for that position, because they require smoothness of the system. A geometrical approac...
Quantization of a class of piecewise affine transformations on the torus
De Bièvre, S; De Bievre, S; Giachetti, R
1995-01-01
We present a unified framework for the quantization of a family of discrete dynamical systems of varying degrees of ``chaoticity". The systems to be quantized are piecewise affine maps on the two-torus, viewed as phase space, and include the automorphisms, translations and skew translations. We then treat some discontinuous transformations such as the Baker map and the sawtooth-like maps. Our approach extends some ideas from geometric quantization and it is both conceptually and calculationally simple.
Monotone Iterative Technique for Duffie-Epstein Type Backward Stochastic Differential Equations
Institute of Scientific and Technical Information of China (English)
SUN Xiao-jun; WU Yue
2005-01-01
For Duffle-Epstein type Backward Stochastic Differential Equations, the comparison theorem is proved. Based on the comparison theorem, by monotone iterative technique, the existence of the minimal and maximal solutions of the equations are proved.
Monotonicity in the Sample Size of the Length of Classical Confidence Intervals
Kagan, Abram M
2012-01-01
It is proved that the average length of standard confidence intervals for parameters of gamma and normal distributions monotonically decrease with the sample size. The proofs are based on fine properties of the classical gamma function.
Criteria for Response Monotonicity Preserving in Approximation of Fractional Order Systems
Institute of Scientific and Technical Information of China (English)
Mohammad Saleh Tavazoei
2016-01-01
In approximation of fractional order systems,a significant objective is to preserve the important properties of the original system.The monotonicity of time/frequency responses is one of these properties whose preservation is of great importance in approximation process.Considering this importance,the issues of monotonicity preservation of the step response and monotonicity preservation of the magnitude-frequency response are independently investigated in this paper.In these investigations,some conditions on approximating filters of fractional operators are found to guarantee the preservation of step/magnitude-frequency response monotonicity in approximation process.These conditions are also simplified in some special cases.In addition,numerical simulation results are presented to show the usefulness of the obtained conditions.
Zimmermann, Karl-Heinz; Achtziger, Wolfgang
2001-09-01
The size of a systolic array synthesized from a uniform recurrence equation, whose computations are mapped by a linear function to the processors, matches the problem size. In practice, however, there exist several limiting factors on the array size. There are two dual schemes available to derive arrays of smaller size from large-size systolic arrays based on the partitioning of the large-size arrays into subarrays. In LSGP, the subarrays are clustered one-to-one into the processors of a small-size array, while in LPGS, the subarrays are serially assigned to a reduced-size array. In this paper, we propose a common methodology for both LSGP and LPGS based on polyhedral partitionings of large-size k-dimensional systolic arrays which are synthesized from n-dimensional uniform recurrences by linear mappings for allocation and timing. In particular, we address the optimization problem of finding optimal piecewise linear timing functions for small-size arrays. These are mappings composed of linear timing functions for the computations of the subarrays. We study a continuous approximation of this problem by passing from piecewise linear to piecewise quasi-linear timing functions. The resultant problem formulation is then a quadratic programming problem which can be solved by standard algorithms for nonlinear optimization problems.
Dolgin, Madlena; Einziger, Pinchas D
2010-05-01
Image reconstruction in electrical impedance tomography is, generally, an ill-posed nonlinear inverse problem. Regularization methods are widely used to ensure a stable solution. Herein, we present a case study, which uses a novel electrical impedance tomography method for reconstruction of layered biological tissues with piecewise continuous plane-stratified profiles. The algorithm implements the recently proposed reconstruction scheme for piecewise constant conductivity profiles, utilizing Legendre expansion in conjunction with improved Prony method. It is shown that the proposed algorithm is capable of successfully reconstructing piecewise continuous conductivity profiles with moderate slop. This reconstruction procedure, which calculates both the locations and the conductivities, repetitively provides inhomogeneous depth discretization, i.e., the depths grid is not equispaced. Incorporation of this specific inhomogeneous grid in the widely used mean least square reconstruction procedure results in a stable and accurate reconstruction, whereas, the commonly selected equispaced depth grid leads to unstable reconstruction. This observation establishes the main result of our investigation, highlighting the impact of physical phenomenon (the image series expansion) on electrical impedance tomography, leading to a physically motivated stabilization of the inverse problem, i.e., an inhomogeneous depth discretization renders an inherent regularization of the mean least square algorithm. The effectiveness and the significance of inhomogeneous discretization in electrical impedance tomography reconstruction procedure is further demonstrated and verified via numerical simulations.
Davies, David L.; Smith, Peter H.; Liutermoza, John F.
1980-06-01
Profile analysis and piecewise correlation techniques for measuring internal machine part clearances by digital processing of industrial radiographs are described in this paper. These methods were developed at the Image and Pattern Analysis Laboratory of Pratt & Whitney Aircraft Group. Profile analysis requires mathematical modeling of the expected optical density of a radiograph as a function of machine part position. Part separations are estimated on the basis of individual image scan lines. A final part separation estimate is produced by fitting a polynominal to the individual estimates and correcting for imaging and processing degradations which are simulated using a mathematical model. Piecewise correlation involves an application of image registration where radiographs are correlated in a piecewise fashion to allow inference of the relative motion of machine parts in a time varying series of images. Each image is divided into segments which are dominated by a small number of features. Segments from one image are cross-correlated with subsequent images to identify machine part motion in image space. Correlation peak magnitude is used in assessing the confidence that a particular motion has occurred between images. The rigid feature motion of machine parts requires image registration by discon-tinuous parts. This method differs from the continuous deformations one encounters in perspective projective transformations characteristic of remote sensing applications.
Weak-noise limit of a piecewise-smooth stochastic differential equation.
Chen, Yaming; Baule, Adrian; Touchette, Hugo; Just, Wolfram
2013-11-01
We investigate the validity and accuracy of weak-noise (saddle-point or instanton) approximations for piecewise-smooth stochastic differential equations (SDEs), taking as an illustrative example a piecewise-constant SDE, which serves as a simple model of Brownian motion with solid friction. For this model, we show that the weak-noise approximation of the path integral correctly reproduces the known propagator of the SDE at lowest order in the noise power, as well as the main features of the exact propagator with higher-order corrections, provided the singularity of the path integral associated with the nonsmooth SDE is treated with some heuristics. We also show that, as in the case of smooth SDEs, the deterministic paths of the noiseless system correctly describe the behavior of the nonsmooth SDE in the low-noise limit. Finally, we consider a smooth regularization of the piecewise-constant SDE and study to what extent this regularization can rectify some of the problems encountered when dealing with discontinuous drifts and singularities in SDEs.
A HYBRID TECHNIQUE FOR PAPR REDUCTION OF OFDM USING DHT PRECODING WITH PIECEWISE LINEAR COMPANDING
Directory of Open Access Journals (Sweden)
Thammana Ajay
2016-06-01
Full Text Available Orthogonal Frequency Division Multiplexing (OFDM is a fascinating approach for wireless communication applications which require huge amount of data rates. However, OFDM signal suffers from its large Peak-to-Average Power Ratio (PAPR, which results in significant distortion while passing through a nonlinear device, such as a transmitter high power amplifier (HPA. Due to this high PAPR, the complexity of HPA as well as DAC also increases. For the reduction of PAPR in OFDM many techniques are available. Among them companding is an attractive low complexity technique for the OFDM signal’s PAPR reduction. Recently, a piecewise linear companding technique is recommended aiming at minimizing companding distortion. In this paper, a collective piecewise linear companding approach with Discrete Hartley Transform (DHT method is expected to reduce peak-to-average of OFDM to a great extent. Simulation results shows that this new proposed method obtains significant PAPR reduction while maintaining improved performance in the Bit Error Rate (BER and Power Spectral Density (PSD compared to piecewise linear companding method.
New contractivity condition in a population model with piecewise constant arguments
Muroya, Yoshiaki
2008-10-01
In this paper, we improve contractivity conditions of solutions for the positive equilibrium of the following differential equation with piecewise constant arguments: where r(t) is a nonnegative continuous function on [0,+[infinity]), r(t)[not identical with]0, , bi[greater-or-equal, slanted]0, i=0,1,2,...,m, and . In particular, for the case a=0 and m[greater-or-equal, slanted]1, we really improve the known three type conditions of the contractivity for solutions of this model (see for example, [Y. Muroya, A sufficient condition on global stability in a logistic equation with piecewise constant arguments, Hokkaido Math. J. 32 (2003) 75-83]). For the other case a[not equal to]0 and m[greater-or-equal, slanted]1, under the condition , the obtained result partially improves the known results on the contractivity of solutions for the positive equilibrium of this model given by the author [Y. Muroya, Persistence, contractivity and global stability in logistic equations with piecewise constant delays, J. Math. Anal. Appl. 270 (2002) 602-635] and others.
Monotone methods for solving a boundary value problem of second order discrete system
Directory of Open Access Journals (Sweden)
Wang Yuan-Ming
1999-01-01
Full Text Available A new concept of a pair of upper and lower solutions is introduced for a boundary value problem of second order discrete system. A comparison result is given. An existence theorem for a solution is established in terms of upper and lower solutions. A monotone iterative scheme is proposed, and the monotone convergence rate of the iteration is compared and analyzed. The numerical results are given.
On the rate of convergence of the maximum likelihood estimator of a k-monotone density
Institute of Scientific and Technical Information of China (English)
WELLNER; Jon; A
2009-01-01
Bounds for the bracketing entropy of the classes of bounded k-monotone functions on [0,A] are obtained under both the Hellinger distance and the Lp(Q) distance,where 1 p < ∞ and Q is a probability measure on [0,A].The result is then applied to obtain the rate of convergence of the maximum likelihood estimator of a k-monotone density.
On the rate of convergence of the maximum likelihood estimator of a K-monotone density
Institute of Scientific and Technical Information of China (English)
GAO FuChang; WELLNER Jon A
2009-01-01
Bounds for the bracketing entropy of the classes of bounded K-monotone functions on [0, A] are obtained under both the Hellinger distance and the LP(Q) distance, where 1 ≤ p < ∞ and Q is a probability measure on [0, A]. The result is then applied to obtain the rate of convergence of the maximum likelihood estimator of a K-monotone density.
Cuong LE VAN; Morhaim, Lisa; Vailakis, Yiannis
2008-01-01
We propose a new approach to the issue of existence and uniqueness of solutions to the Bellman equation, exploiting an emerging class of methods, called monotone map methods, pioneered in the work of Krasnosel’skii (1964) and Krasnosel’skii-Zabreiko (1984). The approach is technically simple and intuitive. It is derived from geometric ideas related to the study of fixed points for monotone concave operators defined on partially order spaces.
MIXED MONOTONE ITERATIVE TECHNIQUES FOR SEMILINEAR EVOLUTION EQUATIONS IN BANACH SPACES
Institute of Scientific and Technical Information of China (English)
王良龙; 王志成
2004-01-01
This paper is concerned with initial value problems for semilinear evolution equations in Banach spaces. The abstract iterative schemes are constructed by combining the theory of semigroups of linear operators and the method of mixed monotone iterations. Some existence results on minimal and maximal (quasi)solutions are established for abstract semilinear evolution equations with mixed monotone or mixed quasimonotone nonlinear terms. To illustrate the main results, applications to ordinary differential equations and partial differential equations are also given.
Global Attractivity Results for Mixed-Monotone Mappings in Partially Ordered Complete Metric Spaces
Directory of Open Access Journals (Sweden)
Kalabušić S
2009-01-01
Full Text Available We prove fixed point theorems for mixed-monotone mappings in partially ordered complete metric spaces which satisfy a weaker contraction condition than the classical Banach contraction condition for all points that are related by given ordering. We also give a global attractivity result for all solutions of the difference equation , where satisfies mixed-monotone conditions with respect to the given ordering.
Global Attractivity Results for Mixed-Monotone Mappings in Partially Ordered Complete Metric Spaces
Directory of Open Access Journals (Sweden)
Dž. Burgić
2009-01-01
Full Text Available We prove fixed point theorems for mixed-monotone mappings in partially ordered complete metric spaces which satisfy a weaker contraction condition than the classical Banach contraction condition for all points that are related by given ordering. We also give a global attractivity result for all solutions of the difference equation zn+1=F(zn,zn−1, n=2,3,…, where F satisfies mixed-monotone conditions with respect to the given ordering.
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Chikalov, Igor
2013-01-01
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
Directory of Open Access Journals (Sweden)
Heinz Werner Höppel
2012-02-01
Full Text Available The monotonic and cyclic deformation behavior of ultrafine-grained metastable austenitic steel AISI 304L, produced by severe plastic deformation, was investigated. Under monotonic loading, the martensitic phase transformation in the ultrafine-grained state is strongly favored. Under cyclic loading, the martensitic transformation behavior is similar to the coarse-grained condition, but the cyclic stress response is three times larger for the ultrafine-grained condition.
Directory of Open Access Journals (Sweden)
Miguel Angel Luque-Fernandez
2016-10-01
Full Text Available Abstract Background In population-based cancer research, piecewise exponential regression models are used to derive adjusted estimates of excess mortality due to cancer using the Poisson generalized linear modelling framework. However, the assumption that the conditional mean and variance of the rate parameter given the set of covariates x i are equal is strong and may fail to account for overdispersion given the variability of the rate parameter (the variance exceeds the mean. Using an empirical example, we aimed to describe simple methods to test and correct for overdispersion. Methods We used a regression-based score test for overdispersion under the relative survival framework and proposed different approaches to correct for overdispersion including a quasi-likelihood, robust standard errors estimation, negative binomial regression and flexible piecewise modelling. Results All piecewise exponential regression models showed the presence of significant inherent overdispersion (p-value <0.001. However, the flexible piecewise exponential model showed the smallest overdispersion parameter (3.2 versus 21.3 for non-flexible piecewise exponential models. Conclusion We showed that there were no major differences between methods. However, using a flexible piecewise regression modelling, with either a quasi-likelihood or robust standard errors, was the best approach as it deals with both, overdispersion due to model misspecification and true or inherent overdispersion.
Health inequality and non-monotonicity of the health related social welfare function.
Dutta, Indranil
2007-03-01
In a recent paper in this journal Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] have strongly argued for the use of a non-monotonic health related social welfare function. This note discusses both the limitations of the measure proposed by Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] and the problems associated with their empirics. We are able to show how non-monotonicity may lead to paradoxical results and policies. Further we examine the empirics of Abasolo and Tsuchiya [Abasolo, I., Tsuchiya, A., 2004. Exploring social welfare functions and violation of monotonicity: an example from inequalities in health. Journal of Health Economics 23, 313-329] and provide an alternative explanation to the observed patterns in the data that do not violate monotonicity. Finally we briefly mention why the Atkinson-Sen framework may be more appropriate as a way forward.
Monotone Iterative Method for Set-valued Quasilinear Elliptic Boundary Value Problems
Institute of Scientific and Technical Information of China (English)
SUN Le-lin; XU Di-hong; CHENG Jian; Li Rong-hua
2001-01-01
@@1. Problem and Assumptions This paper deals with the solutions of the following differential inclusion problem: Au ∈f(x,u), x ∈ Ω; (1) u =0, x∈ Ω, whereAu(x)=Ω RN is a bounded domain with piecewise Lipschitz boundary Ω , Du = (D1 u, D2 u,…,DNu), Diu = , i = 1,2,…, N, and f: Ω × R→2R is a set-valued unction.
Scaling Effect of Area-Averaged NDVI: Monotonicity along the Spatial Resolution
Directory of Open Access Journals (Sweden)
Hiroki Yoshioka
2012-01-01
Full Text Available Changes in the spatial distributions of vegetation across the globe are routinely monitored by satellite remote sensing, in which the reflectance spectra over land surface areas are measured with spatial and temporal resolutions that depend on the satellite instrumentation. The use of multiple synchronized satellite sensors permits long-term monitoring with high spatial and temporal resolutions. However, differences in the spatial resolution of images collected by different sensors can introduce systematic biases, called scaling effects, into the biophysical retrievals. This study investigates the mechanism by which the scaling effects distort normalized difference vegetation index (NDVI. This study focused on the monotonicity of the area-averaged NDVI as a function of the spatial resolution. A monotonic relationship was proved analytically by using the resolution transform model proposed in this study in combination with a two-endmember linear mixture model. The monotonicity allowed the inherent uncertainties introduced by the scaling effects (error bounds to be explicitly determined by averaging the retrievals at the extrema of theresolutions. Error bounds could not be estimated, on the other hand, for non-monotonic relationships. Numerical simulations were conducted to demonstrate the monotonicity of the averaged NDVI along spatial resolution. This study provides a theoretical basis for the scaling effects and develops techniques for rectifying the scaling effects in biophysical retrievals to facilitate cross-sensor calibration for the long-term monitoring of vegetation dynamics.
Goreac, D
2010-01-01
We aim at characterizing viability, invariance and some reachability properties of controlled piecewise deterministic Markov processes (PDMPs). Using analytical methods from the theory of viscosity solutions, we establish criteria for viability and invariance in terms of the first order normal cone. We also investigate reachability of arbitrary open sets. The method is based on viscosity techniques and duality for some associated linearized problem. The theoretical results are applied to general On/Off systems, Cook's model for haploinssuficiency, and a stochastic model for bacteriophage lambda.
A three-layer preon star model from exact piecewise-continuous solutions of Einstein's equations
Pazameta, Zoran
2012-01-01
A metric of Birkhoffian form is employed to model a hybrid astrophysical compact object consisting of a preon gas core, a mantle of electrically charged hot quark-gluon plasma, and an outer envelope of charged hadronic matter which is matched to an exterior Reissner-Nordstr\\"om vacuum. The piecewise-continuous metric and the pressure and density functions consist of polynomials that are everywhere well-behaved. Boundary conditions at each interface yield estimates for physical parameters applicable to each layer, and to the star as a whole.
Analytic, piecewise solution to the Lane-Emden equation for stars with complex density profiles
Miller, Jeff; Bogdanovic, Tamara
2017-01-01
The polytropic models of stars are used for a variety of applications in computational astrophysics. These are typically obtained by numerically solving the Lane-Emden equation for a star in hydrostatic equilibrium under assumption that the pressure and density within the star obey the polytropic equation of state. We present an efficient analytic, piecewise differentiable solution to the Lane-Emden equation which allows “stitching” of different polytropes to represent complex pressure and density profiles. This approach can be used to model stars with distinct properties in their cores and envelopes, such as the evolved red giant and horizontal branch stars.
On the Convergence of Piecewise Linear Strategic Interaction Dynamics on Networks
Gharesifard, Bahman
2015-09-11
We prove that the piecewise linear best-response dynamical systems of strategic interactions are asymptotically convergent to their set of equilibria on any weighted undirected graph. We study various features of these dynamical systems, including the uniqueness and abundance properties of the set of equilibria and the emergence of unstable equilibria. We also introduce the novel notions of social equivalence and social dominance on directed graphs, and demonstrate some of their interesting implications, including their correspondence to consensus and chromatic number of partite graphs. Examples illustrate our results.
Topological invariants in forced piecewise-linear FitzHugh-Nagumo-like systems
Energy Technology Data Exchange (ETDEWEB)
Duarte, Jorge E-mail: jduarte@deq.isel.pt; Ramos, J. Sousa. E-mail: sramos@math.ist.utl.pt
2005-03-01
Mathematical models for periodically-forced excitable systems arise in many biological and physiological contexts. Chaotic dynamics of a forced piecewise-linear Fitzhugh-Nagumo-like system under large-amplitude forcing was identified by Othmer and Xie in their work [J. Math. Biol. 39 (1999) 139]. Using kneading theory we study the topological entropy of some chaotic return maps associated with a singular system. Finally we introduce a new topological invariant to distinguish isentropic dynamics and we exhibit numerical results about maps with the same topological entropy, that suggest the existence of a relation between the parameters A and {theta}, when T is fixed.
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
In the paper,we investigate the problem of finding a piecewise output feedback control law for an uncertain affine system such that the resulting closed-loop output satisfies a desired linear temporal logic (LTL) specification.A two-level hierarchical approach is proposed to solve the problem in a triangularized output space.In the lower level,we explore whether there exists a robust output feedback control law to make the output starting in a simplex either remains in it or leaves via a specific facet.In t...
Regularity of absolutely continuous invariant measures for piecewise expanding unimodal maps
Contreras, Fabián; Dolgopyat, Dmitry
2016-09-01
Let f:[0,1]\\to [0,1] be a piecewise expanding unimodal map of class C k+1, with k≥slant 1 , and μ =ρ \\text{d}x the (unique) SRB measure associated to it. We study the regularity of ρ. In particular, points N where ρ is not differentiable has zero Hausdorff dimension, but is uncountable if the critical orbit of f is dense. This improves on a work of Szewc (1984). We also obtain results about higher orders of differentiability of ρ in the sense of Whitney.
Piecewise oblique boundary treatment for the elastic-plastic wave equation on a cartesian grid
Giese, Guido
2009-11-01
Numerical schemes for hyperbolic conservation laws in 2-D on a Cartesian grid usually have the advantage of being easy to implement and showing good computational performances, without allowing the simulation of “real-world” problems on arbitrarily shaped domains. In this paper a numerical treatment of boundary conditions for the elastic-plastic wave equation is developed, which allows the simulation of problems on an arbitrarily shaped physical domain surrounded by a piece-wise smooth boundary curve, but using a PDE solver on a rectangular Cartesian grid with the afore-mentioned advantages.
Explicit Piecewise Smooth Solutions of Landau-Lifshitz Equation with Discontinuous External Field
Institute of Scientific and Technical Information of China (English)
Gan-shan Yang; Yun-zhang Zhang; Li-min Liu
2009-01-01
In this paper,we shall construct some explicit piecewise smooth(global continuous)solutions as well as blow up solutions to the multidimensional Landau-Lifshitz equation,subject to the external magnetic fields being both discontinuous and unbounded.When the external magnetic field is continuous,some explicit exact smooth solutions and blow up solution are also constructed.We also establish some necessary and sufficient conditions to ensure that the solution of multidimensional Landau-Lifshitz equation with external magnetic field converges to the solution of equation without external magnetic field when the external magnetic field tends to zero.
Phase patterns in finite oscillator networks with insights from the piecewise linear approximation
Goldstein, Daniel
2015-03-01
Recent experiments on spatially extend arrays of droplets containing Belousov-Zhabotinsky reactants have shown a rich variety of spatio-temporal patterns. Motivated by this experimental set up, we study a simple model of chemical oscillators in the highly nonlinear excitable regime in order to gain insight into the mechanism giving rise to the observed multistable attractors. When coupled, these two attractors have different preferred phase synchronizations, leading to complex behavior. We study rings of coupled oscillators and observe a rich array of oscillating patterns. We combine Turing analysis and a piecewise linear approximation to better understand the observed patterns.
Energy Technology Data Exchange (ETDEWEB)
Vereshchagin, D.A. [Theoretical Physics Department, Kaliningrad State University, A. Nevsky st. 14, Kaliningrad (Russian Federation); Leble, S.B. [Theoretical Physics Department, Kaliningrad State University, A. Nevsky st. 14, Kaliningrad (Russian Federation) and Theoretical Physics and Mathematical Methods Department, Gdansk University of Technology, ul. Narutowicza 11/12, Gdansk (Poland)]. E-mail: leble@mifgate.pg.gda.pl; Solovchuk, M.A. [Theoretical Physics Department, Kaliningrad State University, A. Nevsky st. 14, Kaliningrad (Russian Federation)]. E-mail: solovchuk@yandex.ru
2006-01-02
The system of hydrodynamic-type equations for a stratified gas in gravity field is derived from BGK equation by method of piecewise continuous distribution function. The obtained system of the equations generalizes the Navier-Stokes one at arbitrary Knudsen numbers. The problem of a wave disturbance propagation in a rarefied gas is explored. The verification of the model is made for a limiting case of a homogeneous medium. The phase velocity and attenuation coefficient values are in an agreement with former fluid mechanics theories; the attenuation behavior reproduces experiment and kinetics-based results at more wide range of the Knudsen numbers.
An I(2) Cointegration Model with Piecewise Linear Trends: Likelihood Analysis and Application
DEFF Research Database (Denmark)
Kurita, Takamitsu; Nielsen, Heino Bohn; Rahbæk, Anders
for the cointegration ranks, extending the result for I(2) models with a linear trend in Nielsen and Rahbek (2007) and for I(1) models with piecewise linear trends in Johansen, Mosconi, and Nielsen (2000). The provided asymptotic theory extends also the results in Johansen, Juselius, Frydman, and Goldberg (2009) where...... asymptotic inference is discussed in detail for one of the cointegration parameters. To illustrate, an empirical analysis of US consumption, income and wealth, 1965 - 2008, is performed, emphasizing the importance of a change in nominal price trends after 1980....
A low-power piecewise linear analog to digital converter for use in particle tracking
Energy Technology Data Exchange (ETDEWEB)
Valencic, V.; Deval, P. [MEAD Microelectronics S.A., St. Sulpice (Switzerland)]|[EPFL, Lausanne (Switzerland). Electronics Labs.; Anghinolfi, F. [CERN, Geneva (Switzerland); Bonino, R.; Marra, D. La; Kambara, Hisanori [Univ. of Geneva (Switzerland)
1995-08-01
This paper describes a low-power piecewise linear A/D converter. A 5MHz {at} 5V with 25mW power consumption prototype has been implemented in a 1.5{micro}m CMOS process. The die area excluding pads is 5mm{sup 2}. 11-bit absolute accuracy is obtained with a new DC offset plus charge injection compensation technique used in the comparators scheme. This ADC with large dynamic range and high resolution is developed for the readout of a tracker and/or preshower in the future LHC experiments.
2016-01-01
response variable taking on ordinal values 1 to C and a 1x vector of explanatory variables , , the proportional odds model is given by...I N S T I T U T E F O R D E F E N S E A N A L Y S E S Regularization for Continuously Observed Ordinal Response Variables with Piecewise...response variable , quality of video provided by the Shadow to friendly ground units, was measured on an ordinal scale continuously over time. Functional
An Approach to Formulation of FNLP with Complex Piecewise Linear Membership Functions
Institute of Scientific and Technical Information of China (English)
闻博; 李宏光
2014-01-01
Traditionally, extra binary variables are demanded to formulate a fuzzy nonlinear programming (FNLP) problem with piecewise linear membership functions (PLMFs). However, this kind of methodology usually suffers increasing computational burden associated with formulation and solution, particularly in the face of complex PLMFs. Motivated by these challenges, this contribution introduces a novel approach free of additional binary variables to formulate FNLP with complex PLMFs, leading to superior performance in reducing computational complexity as well as simplifying formulation. A depth discussion about the approach is conducted in this paper, along with a numerical case study to demonstrate its potential benefits.
Bifurcation of piecewise-linear nonlinear vibration system of vehicle suspension
Institute of Scientific and Technical Information of China (English)
Shun ZHONG; Yu-shu CHEN
2009-01-01
A kinetic model of the piecewise-linear nonlinear suspension system that consists of a dominant spring and an assistant spring is established.Bifurcation of the resonance solution to a suspension system with two degrees of freedom is investigated with the singularity theory.Transition sets of the system and 40 groups of bifurcation diagrams are obtained.The local bifurcation is found,and shows the overall characteristics of bifurcation.Based on the relationship between parameters and the topological bifurcation solutions,motion characteristics with different parameters are obtained.The results provides a theoretical basis for the optimal control of vehicle suspension system parameters.
Maglevanny, I. I.; Smolar, V. A.
2016-01-01
We introduce a new technique of interpolation of the energy-loss function (ELF) in solids sampled by empirical optical spectra. Finding appropriate interpolation methods for ELFs poses several challenges. The sampled ELFs are usually very heterogeneous, can originate from various sources thus so called "data gaps" can appear, and significant discontinuities and multiple high outliers can be present. As a result an interpolation based on those data may not perform well at predicting reasonable physical results. Reliable interpolation tools, suitable for ELF applications, should therefore satisfy several important demands: accuracy and predictive power, robustness and computational efficiency, and ease of use. We examined the effect on the fitting quality due to different interpolation schemes with emphasis on ELF mesh optimization procedures and we argue that the optimal fitting should be based on preliminary log-log scaling data transforms by which the non-uniformity of sampled data distribution may be considerably reduced. The transformed data are then interpolated by local monotonicity preserving Steffen spline. The result is a piece-wise smooth fitting curve with continuous first-order derivatives that passes through all data points without spurious oscillations. Local extrema can occur only at grid points where they are given by the data, but not in between two adjacent grid points. It is found that proposed technique gives the most accurate results and also that its computational time is short. Thus, it is feasible using this simple method to address practical problems associated with interaction between a bulk material and a moving electron. A compact C++ implementation of our algorithm is also presented.
DEFF Research Database (Denmark)
Garde, Henrik; Staboulis, Stratos
2016-01-01
demonstrate that for admissible choices of regularization parameters the inhomogeneities are detected, and under reasonable assumptions, asymptotically exactly characterized. Moreover, we rigorously associate this result with the complete electrode model, and describe how a computationally cheap monotonicity......The inverse problem of electrical impedance tomography is severely ill-posed, meaning that, only limited information about the conductivity can in practice be recovered from boundary measurements of electric current and voltage. Recently it was shown that a simple monotonicity property...... of the related Neumann-to-Dirichlet map can be used to characterize shapes of inhomogeneities in a known background conductivity. In this paper we formulate a monotonicity-based shape reconstruction scheme that applies to approximative measurement models, and regularizes against noise and modelling error. We...
Energy Technology Data Exchange (ETDEWEB)
Erol, V. [Department of Computer Engineering, Institute of Science, Okan University, Istanbul (Turkey); Netas Telecommunication Inc., Istanbul (Turkey)
2016-04-21
Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known monotones for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. The study on these monotones has been a hot topic in quantum information [1-7] in order to understand the role of entanglement in this discipline. It can be observed that from any arbitrary quantum pure state a mixed state can obtained. A natural generalization of this observation would be to consider local operations classical communication (LOCC) transformations between general pure states of two parties. Although this question is a little more difficult, a complete solution has been developed using the mathematical framework of the majorization theory [8]. In this work, we analyze the relation between entanglement monotones concurrence and negativity with respect to majorization for general two-level quantum systems of two particles.
Comparison of boundedness and monotonicity properties of one-leg and linear multistep methods
Mozartova, A.
2015-05-01
© 2014 Elsevier B.V. All rights reserved. One-leg multistep methods have some advantage over linear multistep methods with respect to storage of the past results. In this paper boundedness and monotonicity properties with arbitrary (semi-)norms or convex functionals are analyzed for such multistep methods. The maximal stepsize coefficient for boundedness and monotonicity of a one-leg method is the same as for the associated linear multistep method when arbitrary starting values are considered. It will be shown, however, that combinations of one-leg methods and Runge-Kutta starting procedures may give very different stepsize coefficients for monotonicity than the linear multistep methods with the same starting procedures. Detailed results are presented for explicit two-step methods.
Erol, V.
2016-04-01
Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known monotones for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. The study on these monotones has been a hot topic in quantum information [1-7] in order to understand the role of entanglement in this discipline. It can be observed that from any arbitrary quantum pure state a mixed state can obtained. A natural generalization of this observation would be to consider local operations classical communication (LOCC) transformations between general pure states of two parties. Although this question is a little more difficult, a complete solution has been developed using the mathematical framework of the majorization theory [8]. In this work, we analyze the relation between entanglement monotones concurrence and negativity with respect to majorization for general two-level quantum systems of two particles.
STRONG CONVERGENCE OF MONOTONE HYBRID METHOD FOR FIXED POINT ITERATION PROCESSES
Institute of Scientific and Technical Information of China (English)
Yongfu SU; Xiaolong QIN
2008-01-01
K. Nakajo and W. Takahashi in 2003 proved the strong convergence theorems for nonexpansive mappings, nonexpansive semigroups, and proximal point algorithm for zero point of monotone operators in Hilbert spaces by using the hybrid method in mathematical programming. The purpose of this paper is to modify the hybrid iteration method of K. Nakajo and W. Takahashi through the monotone hybrid method, and to prove strong convergence theorems. The convergence rate of iteration process of the monotone hybrid method is faster than that of the iteration process of the hybrid method of K. Nakajo and W. Takahashi. In the proofs in this article, Cauchy sequence method is used to avoid the use of the demiclosedness principle and Opial's condition.
The Role of Monotonicity in the Epistemic Analysis of Strategic Games
Directory of Open Access Journals (Sweden)
Jonathan A. Zvesper
2010-10-01
Full Text Available It is well-known that in finite strategic games true common belief (or common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski’s Fixpoint Theorem.
Stochastic Monotone Markov Integrated Semigroups%随机单调Markov积分半群
Institute of Scientific and Technical Information of China (English)
文兴易; 李扬荣
2009-01-01
In this paper we discuss the relationship between monotone of Markov integrated semigroups and transition functions,which are closely linked with each other for continuous time Markov chains.By this a necessary and sufficient condition for the minimal q-semigroup to be stochastic monotone is given in terms of their q-matrix only.%讨论了Markov积分半群的单调性和转移函数的单调性的等价性,并得到最小的Q半群是单调的充要条件.
DEFF Research Database (Denmark)
Garde, Henrik
2017-01-01
Detecting inhomogeneities in the electrical conductivity is a special case of the inverse problem in electrical impedance tomography, that leads to fast direct reconstruction methods. One such method can, under reasonable assumptions, exactly characterize the inhomogeneities based on monotonicity....... For a fair comparison, exact matrix characterizations are used when probing the monotonicity relations to avoid errors from numerical solution to PDEs and numerical integration. Using a special factorization of the Neumann-to-Dirichlet map also makes the non-linear method as fast as the linear method...
Xiao, Jie
2009-01-01
Two optimal monotone integral principles (equivalently for the Laplacian, two sharp iso-weighted-volume inequalities) are established through extending the first and second integral bounds of H. Weinberger for the Green functions (i.e., fundamental solutions) of uniformly elliptic equations in terms of the layer-cake formula, a one-dimensional monotone integral principle, and the isoperimetric and Jenson's inequalities with sharp constants. Surprisingly, a special setting of the first principle can be used to not only verify the low-dimensional P\\'olya conjecture for the principal eigenvalue of the Laplacian but also to characterize the geometry of the Nash inequality for a strong uniform elliptic equation.
Ellis, Jules L
2014-04-01
It is shown that a unidimensional monotone latent variable model for binary items implies a restriction on the relative sizes of item correlations: The negative logarithm of the correlations satisfies the triangle inequality. This inequality is not implied by the condition that the correlations are nonnegative, the criterion that coefficient H exceeds 0.30, or manifest monotonicity. The inequality implies both a lower bound and an upper bound for each correlation between two items, based on the correlations of those two items with every possible third item. It is discussed how this can be used in Mokken's (A theory and procedure of scale-analysis, Mouton, The Hague, 1971) scale analysis.
A Mathematical Model for Non-monotonic Deposition Profiles in Deep Bed Filtration Systems
DEFF Research Database (Denmark)
Yuan, Hao; Shapiro, Alexander
2011-01-01
A mathematical model for suspension/colloid flow in porous media and non-monotonic deposition is proposed. It accounts for the migration of particles associated with the pore walls via the second energy minimum (surface associated phase). The surface associated phase migration is characterized...... by advection and diffusion/dispersion. The proposed model is able to produce a nonmonotonic deposition profile. A set of methods for estimating the modeling parameters is provided in the case of minimal particle release. The estimation can be easily performed with available experimental information...... condition for producing non-monotonic deposition profiles. The described physics by the additional equation may be different in different experimental settings....
Piecewise Function Hysteretic Model for Cold-Formed Steel Shear Walls with Reinforced End Studs
Directory of Open Access Journals (Sweden)
Jihong Ye
2017-01-01
Full Text Available Cold-formed steel (CFS shear walls with concrete-filled rectangular steel tube (CFRST columns as end studs can upgrade the performance of mid-rise CFS structures, such as the vertical bearing capacity, anti-overturning ability, shear strength, and fire resistance properties, thereby enhancing the safety of structures. A theoretical hysteretic model is established according to a previous experimental study. This model is described in a simple mathematical form and takes nonlinearity, pinching, strength, and stiffness deterioration into consideration. It was established in two steps: (1 a discrete coordinate method was proposed to determine the load-displacement skeleton curve of the wall, by which governing deformations and their corresponding loads of the hysteretic loops under different loading cases can be obtained; afterwards; (2 a piecewise function was adopted to capture the hysteretic loop relative to each governing deformation, the hysteretic model of the wall was further established, and additional criteria for the dominant parameters of the model were stated. Finally, the hysteretic model was validated by experimental results from other studies. The results show that elastic lateral stiffness Ke and shear capacity Fp are key factors determining the load-displacement skeleton curve of the wall; hysteretic characteristics of the wall with reinforced end studs can be fully reflected by piecewise function hysteretic model, moreover, the model has intuitional expressions with clear physical interpretations for each parameter, paving the way for predicting the nonlinear dynamic responses of mid-rise CFS structures.
DEFF Research Database (Denmark)
Gholami, M.; Cocquempot, V.; Schiøler, H.
2014-01-01
An active fault tolerant control (AFTC) method is proposed for discrete-time piecewise affine (PWA) systems. Only actuator faults are considered. The AFTC framework contains a supervisory scheme, which selects a suitable controller in a set of controllers such that the stability and an acceptable...... the reference signal while the control inputs are bounded. The PFTC problem is transformed into a feasibility problem of a set of LMIs. The method is applied on a large-scale live-stock ventilation model.......An active fault tolerant control (AFTC) method is proposed for discrete-time piecewise affine (PWA) systems. Only actuator faults are considered. The AFTC framework contains a supervisory scheme, which selects a suitable controller in a set of controllers such that the stability and an acceptable...... performance of the faulty system are held. The design of the supervisory scheme is not considered here. The set of controllers is composed of a normal controller for the fault-free case, an active fault detection and isolation controller for isolation and identification of the faults, and a set of passive...
A Neurodynamic Approach for Real-Time Scheduling via Maximizing Piecewise Linear Utility.
Guo, Zhishan; Baruah, Sanjoy K
2016-02-01
In this paper, we study a set of real-time scheduling problems whose objectives can be expressed as piecewise linear utility functions. This model has very wide applications in scheduling-related problems, such as mixed criticality, response time minimization, and tardiness analysis. Approximation schemes and matrix vectorization techniques are applied to transform scheduling problems into linear constraint optimization with a piecewise linear and concave objective; thus, a neural network-based optimization method can be adopted to solve such scheduling problems efficiently. This neural network model has a parallel structure, and can also be implemented on circuits, on which the converging time can be significantly limited to meet real-time requirements. Examples are provided to illustrate how to solve the optimization problem and to form a schedule. An approximation ratio bound of 0.5 is further provided. Experimental studies on a large number of randomly generated sets suggest that our algorithm is optimal when the set is nonoverloaded, and outperforms existing typical scheduling strategies when there is overload. Moreover, the number of steps for finding an approximate solution remains at the same level when the size of the problem (number of jobs within a set) increases.
Tatsii, R. M.; Pazen, O. Yu.
2016-03-01
A constructive scheme for the construction of a solution of a mixed problem for the heat conduction equation with piecewise-continuous coefficients coordinate-dependent in the final interval is suggested and validated in the present work. The boundary conditions are assumed to be most general. The scheme is based on: the reduction method, the concept of quasi-derivatives, the currently accepted theory of the systems of linear differential equations, the Fourier method, and the modified method of eigenfunctions. The method based on this scheme should be related to direct exact methods of solving mixed problems that do not employ the procedures of constructing Green's functions or integral transformations. Here the theorem of eigenfunction expansion is adapted for the case of coefficients that have discontinuity points of the 1st kind. The results obtained can be used, for example, in investigating the process of heat transfer in a multilayer slab under conditions of ideal thermal contact between the layers. A particular case of piecewise-continuous coefficients is considered. A numerical example of calculation of a temperature field in a real four-layer building slab under boundary conditions of the 3rd kind (conditions of convective heat transfer) that model the phenomenon of fire near one of the external surfaces is given.
GRMHD Simulations of Binary Neutron Star Mergers with Piecewise Polytropic Equations of State
Giacomazzo, Bruno
2015-04-01
We present new results of fully general relativistic magnetohydrodynamic (GRMHD) simulations of binary neutron star (BNS) mergers performed with the Whisky code. Our new simulations consider both equal and unequal-mass systems and describe the NS matter via piecewise polytropic equations of state (EOSs). BNS mergers are powerful sources of gravitational waves (GWs) that can be detected by ground based detectors, such as advanced Virgo and LIGO, and they are also thought to be behind the central engine powering short gamma-ray bursts. In our simulations we therefore focus both on the GW emission and on the dynamics of matter and magnetic fields, both in the case a black hole is promptly formed and in the case of the formation of a long-lived magnetized NS. Since the EOS has an important role in both GW emission and matter dynamics, our simulations employ piecewise polytropic EOSs composed by seven pieces, four for the low-density regions (including the crust) and three for the core, in order to more accurately match physically motivated EOSs. Thermal effects are also included in order to more properly describe the post-merger dynamics.
The stiffness variation of a micro-ring driven by a traveling piecewise-electrode.
Li, Yingjie; Yu, Tao; Hu, Yuh-Chung
2014-09-16
In the practice of electrostatically actuated micro devices; the electrostatic force is implemented by sequentially actuated piecewise-electrodes which result in a traveling distributed electrostatic force. However; such force was modeled as a traveling concentrated electrostatic force in literatures. This article; for the first time; presents an analytical study on the stiffness variation of microstructures driven by a traveling piecewise electrode. The analytical model is based on the theory of shallow shell and uniform electrical field. The traveling electrode not only applies electrostatic force on the circular-ring but also alters its dynamical characteristics via the negative electrostatic stiffness. It is known that; when a structure is subjected to a traveling constant force; its natural mode will be resonated as the traveling speed approaches certain critical speeds; and each natural mode refers to exactly one critical speed. However; for the case of a traveling electrostatic force; the number of critical speeds is more than that of the natural modes. This is due to the fact that the traveling electrostatic force makes the resonant frequencies of the forward and backward traveling waves of the circular-ring different. Furthermore; the resonance and stability can be independently controlled by the length of the traveling electrode; though the driving voltage and traveling speed of the electrostatic force alter the dynamics and stabilities of microstructures. This paper extends the fundamental insights into the electromechanical behavior of microstructures driven by electrostatic forces as well as the future development of MEMS/NEMS devices with electrostatic actuation and sensing.
Piecewise linear approach to an archetypal oscillator for smooth and discontinuous dynamics.
Cao, Qingjie; Wiercigroch, Marian; Pavlovskaia, Ekaterina E; Thompson, J Michael T; Grebogi, Celso
2008-02-28
In a recent paper we examined a model of an arch bridge with viscous damping subjected to a sinusoidally varying central load. We showed how this yields a useful archetypal oscillator which can be used to study the transition from smooth to discontinuous dynamics as a parameter, alpha, tends to zero. Decreasing this smoothness parameter (a non-dimensional measure of the span of the arch) changes the smooth load-deflection curve associated with snap-buckling into a discontinuous sawtooth. The smooth snap-buckling curve is not amenable to closed-form theoretical analysis, so we here introduce a piecewise linearization that correctly fits the sawtooth in the limit at alpha=0. Using a Hamiltonian formulation of this linearization, we derive an analytical expression for the unperturbed homoclinic orbit, and make a Melnikov analysis to detect the homoclinic tangling under the perturbation of damping and driving. Finally, a semi-analytical method is used to examine the full nonlinear dynamics of the perturbed piecewise linear system. A chaotic attractor located at alpha=0.2 compares extremely well with that exhibited by the original arch model: the topological structures are the same, and Lyapunov exponents (and dimensions) are in good agreement.
Implementation of nonlinear registration of brain atlas based on piecewise grid system
Liu, Rong; Gu, Lixu; Xu, Jianrong
2007-12-01
In this paper, a multi-step registration method of brain atlas and clinical Magnetic Resonance Imaging (MRI) data based on Thin-Plate Splines (TPS) and Piecewise Grid System (PGS) is presented. The method can help doctors to determine the corresponding anatomical structure between patient image and the brain atlas by piecewise nonlinear registration. Since doctors mostly pay attention to particular Region of Interest (ROI), and a global nonlinear registration is quite time-consuming which is not suitable for real-time clinical application, we propose a novel method to conduct linear registration in global area before nonlinear registration is performed in selected ROI. The homogenous feature points are defined to calculate the transform matrix between patient data and the brain atlas to conclude the mapping function. Finally, we integrate the proposed approach into an application of neurosurgical planning and guidance system which lends great efficiency in both neuro-anatomical education and guiding of neurosurgical operations. The experimental results reveal that the proposed approach can keep an average registration error of 0.25mm in near real-time manner.
Gardini, Laura; Fournier-Prunaret, Danièle; Chargé, Pascal
2011-06-01
In recent years, the study of chaotic and complex phenomena in electronic circuits has been widely developed due to the increasing number of applications. In these studies, associated with the use of chaotic sequences, chaos is required to be robust (not occurring only in a set of zero measure and persistent to perturbations of the system). These properties are not easy to be proved, and numerical simulations are often used. In this work, we consider a simple electronic switching circuit, proposed as chaos generator. The object of our study is to determine the ranges of the parameters at which the dynamics are chaotic, rigorously proving that chaos is robust. This is obtained showing that the model can be studied via a two-dimensional piecewise smooth map in triangular form and associated with a one-dimensional piecewise linear map. The bifurcations in the parameter space are determined analytically. These are the border collision bifurcation curves, the degenerate flip bifurcations, which only are allowed to occur to destabilize the stable cycles, and the homoclinic bifurcations occurring in cyclical chaotic regions leading to chaos in 1-piece.
Group lassoing change-points in piecewise-constant AR processes
Angelosante, Daniele; Giannakis, Georgios B.
2012-12-01
Regularizing the least-squares criterion with the total number of coefficient changes, it is possible to estimate time-varying (TV) autoregressive (AR) models with piecewise-constant coefficients. Such models emerge in various applications including speech segmentation, biomedical signal processing, and geophysics. To cope with the inherent lack of continuity and the high computational burden when dealing with high-dimensional data sets, this article introduces a convex regularization approach enabling efficient and continuous estimation of TV-AR models. To this end, the problem is cast as a sparse regression one with grouped variables, and is solved by resorting to the group least-absolute shrinkage and selection operator (Lasso). The fresh look advocated here permeates benefits from advances in variable selection and compressive sampling to signal segmentation. An efficient block-coordinate descent algorithm is developed to implement the novel segmentation method. Issues regarding regularization and uniqueness of the solution are also discussed. Finally, an alternative segmentation technique is introduced to improve the detection of change instants. Numerical tests using synthetic and real data corroborate the merits of the developed segmentation techniques in identifying piecewise-constant TV-AR models.
Shen, Ji Yao; Abu-Saba, Elias G.; Mcginley, William M.; Sharpe, Lonnie, Jr.; Taylor, Lawrence W., Jr.
1992-01-01
Distributed parameter modeling offers a viable alternative to the finite element approach for modeling large flexible space structures. The introduction of the transfer matrix method into the continuum modeling process provides a very useful tool to facilitate the distributed parameter model applied to some more complex configurations. A uniform Timoshenko beam model for the estimation of the dynamic properties of beam-like structures has given comparable results. But many aeronautical and aerospace structures are comprised of non-uniform sections or sectional properties, such as aircraft wings and satellite antennas. This paper proposes a piecewise continuous Timoshenko beam model which is used for the dynamic analysis of tapered beam-like structures. A tapered beam is divided into several segments of uniform beam elements. Instead of arbitrarily assumed shape functions used in finite element analysis, the closed-form solution of the Timoshenko beam equation is used. Application of the transfer matrix method relates all the elements as a whole. By corresponding boundary conditions and compatible conditions a characteristic equation for the global tapered beam has been developed, from which natural frequencies can be derived. A computer simulation is shown in this paper, and compared with the results obtained from the finite element analysis. While piecewise continuous Timoshenko beam model decreases the number of elements significantly; comparable results to the finite element method are obtained.
Saito, Asaki; Yasutomi, Shin-ichi; Tamura, Jun-ichi; Ito, Shunji
2015-06-01
We introduce a true orbit generation method enabling exact simulations of dynamical systems defined by arbitrary-dimensional piecewise linear fractional maps, including piecewise linear maps, with rational coefficients. This method can generate sufficiently long true orbits which reproduce typical behaviors (inherent behaviors) of these systems, by properly selecting algebraic numbers in accordance with the dimension of the target system, and involving only integer arithmetic. By applying our method to three dynamical systems—that is, the baker's transformation, the map associated with a modified Jacobi-Perron algorithm, and an open flow system—we demonstrate that it can reproduce their typical behaviors that have been very difficult to reproduce with conventional simulation methods. In particular, for the first two maps, we show that we can generate true orbits displaying the same statistical properties as typical orbits, by estimating the marginal densities of their invariant measures. For the open flow system, we show that an obtained true orbit correctly converges to the stable period-1 orbit, which is inherently possessed by the system.
Spectral analysis and an area-preserving extension of a piecewise linear intermittent map
Miyaguchi, Tomoshige; Aizawa, Yoji
2007-06-01
We investigate the spectral properties of a one-dimensional piecewise linear intermittent map, which has not only a marginal fixed point but also a singular structure suppressing injections of the orbits into neighborhoods of the marginal fixed point. We explicitly derive generalized eigenvalues and eigenfunctions of the Frobenius-Perron operator of the map for classes of observables and piecewise constant initial densities, and it is found that the Frobenius-Perron operator has two simple real eigenvalues 1 and λdɛ(-1,0) and a continuous spectrum on the real line [0,1]. From these spectral properties, we also found that this system exhibits a power law decay of correlations. This analytical result is found to be in a good agreement with numerical simulations. Moreover, the system can be extended to an area-preserving invertible map defined on the unit square. This extended system is similar to the baker transformation, but does not satisfy hyperbolicity. A relation between this area-preserving map and a billiard system is also discussed.
Energy Technology Data Exchange (ETDEWEB)
Ramos, J.I. [Universidad de Malaga, E.T.S. Ingenieros Industriales, Room I-320-D, Plaza El Ejido, s/n, 29013 Malaga (Spain)]. E-mail: jirs@lcc.uma.es
2006-06-15
An approximate method based on piecewise linearization is developed for the determination of periodic orbits of nonlinear oscillators. The method is based on Taylor series expansions, provides piecewise analytical solutions in three-point intervals which are continuous everywhere and explicit three-point difference equations which are P-stable and have an infinite interval of periodicity. It is shown that the method presented here reduces to the well-known Stoermer technique, is second-order accurate, and yields, upon applying Taylor series expansion and a Pade approximation, another P-stable technique whenever the Jacobian is different from zero. The method is generalized for single degree-of-freedom problems that contain the velocity, and (approximate) analytical solutions are presented. Finally, by introducing the inverse of a vector and the vector product and quotient, and using Taylor series expansions and a Pade approximation, the method has been generalized to multiple degree-of-freedom problems and results in explicit three-point finite difference equations which only involve vector multiplications.
A piecewise-integration method for simulating the influence of external forcing on climate
Institute of Scientific and Technical Information of China (English)
Zhifu Zhang; Chongjian Qiu; Chenghai Wang
2008-01-01
Climate drift occurs in most general circulation models (GCMs) as a result of incomplete physical and numerical representation of the complex climate system,which may cause large uncertainty in sensitivity experiments evaluating climate response to changes in external forcing.To solve this problem,we propose a piecewise-integration method to reduce the systematic error in climate sensitivity studies.The observations are firstly assimilated into a numerical model by using the dynamic relaxation technique to relax to the current state of atmosphere,and then the assimilated fields are continuously used to reinitialize the simulation to reduce the error of climate simulation.When the numerical model is integrated with changed external forcing,the results can be split into two parts,background and perturbation fields,and the background is the state before the external forcing is changed.The piecewise-integration method is used to continuously reinitialize the model with the assimilated field,instead of the background.Therefore,the simulation error of the model with the external forcing can be reduced.In this way,the accuracy of climate sensitivity experiments is greatly improved.Tests with a simple low-order spectral model show that this approach can significantly reduce the uncertainty of climate sensitivity experiments.
Yang, Xitao; Yuan, Rong
2006-10-01
In the first part of this paper, we obtain a new property on the module containment for almost periodic functions. Based on it, we establish the module containment of an almost periodic solution for a class of differential equations with piecewise constant delays. In the second part, we investigate the existence, uniqueness and exponential stability of a positive almost periodic and quasi-periodic solution for a certain class of logistic differential equations with a piecewise constant delay. The module containment for the almost periodic solution is established.
The role of monotonicity in the epistemic analysis of strategic games
Apt, K.R.; Zvesper, J.A.
2010-01-01
It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality no
Lesaja, G.; Roos, C.
2011-01-01
We present an interior-point method for monotone linear complementarity problems over symmetric cones (SCLCP) that is based on barrier functions which are defined by a large class of univariate functions, called eligible kernel functions. This class is fairly general and includes the classical logar
Institute of Scientific and Technical Information of China (English)
李中夫; 刘应明
1994-01-01
This paper discusses the problem of simple representation of multi-place functions from the viewpoint of "simple approximation". We prove that a class of associative functions, which have a wide range of applications, can be approximately represented by a monotone 1-place function and addition.
Non-monotonic size dependence of diffusion and levitation effect: a mode-coupling theory analysis.
Nandi, Manoj Kumar; Banerjee, Atreyee; Bhattacharyya, Sarika Maitra
2013-03-28
We present a study of diffusion of small tagged particles in a solvent, using mode coupling theory (MCT) analysis and computer simulations. The study is carried out for various interaction potentials. For the first time, using MCT, it is shown that only for strongly attractive interaction potential with allowing interpenetration between the solute-solvent pair the diffusion exhibits a non-monotonic solute size dependence which has earlier been reported in simulation studies [P. K. Ghorai and S. Yashonath, J. Phys. Chem. B 109, 5824-5835 (2005)]. For weak attractive and repulsive potential the solute size dependence of diffusion shows monotonic behaviour. It is also found that for systems where the interaction potential does not allow solute-solvent interpenetration, the solute cannot explore the neck of the solvent cage. Thus these systems even with strong attractive interaction will never show any non-monotonic size dependence of diffusion. This non-monotonic size dependence of diffusion has earlier been connected to levitation effect [S. Yashonath and P. Santikary, J. Phys. Chem. 98, 6368 (1994)]. We also show that although levitation is a dynamic phenomena, the effect of levitation can be obtained in the static radial distribution function.
A Min-max Relation for Monotone Path Systems in Simple Regions
DEFF Research Database (Denmark)
Cameron, Kathleen
1996-01-01
A monotone path system (MPS) is a finite set of pairwise disjointpaths (polygonal arcs) in the plane such that every horizontal line intersectseach of the paths in at most one point. We consider a simple polygon in thexy-plane which bounds the simple polygonal (closed) region D. Let T and B betwo...
On extension results for n-cyclically monotone operators in reflexive Banach spaces
Bot, Radu Ioan
2009-01-01
In this paper we provide some extension results for n-cyclically monotone operators in reflexive Banach spaces by making use of the Fenchel duality. In this way we give a positive answer to a question posed by Bauschke and Wang in [4].
Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings
Institute of Scientific and Technical Information of China (English)
WEI Li; SU Yong-fu; ZHOU Hai-yun
2008-01-01
In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.
Directory of Open Access Journals (Sweden)
Boubakari Ibrahimou
2013-01-01
maximal monotone with and . Using the topological degree theory developed by Kartsatos and Quarcoo we study the eigenvalue problem where the operator is a single-valued of class . The existence of continuous branches of eigenvectors of infinite length then could be easily extended to the case where the operator is multivalued and is investigated.
Bifurcations of a predator-prey model with non-monotonic response function
Broer, H.W.; Naudot, Vincent; Roussarie, Robert; Saleh, Khairul
2005-01-01
A 2-dimensional predator-prey model with five parameters is investigated, adapted from the Volterra-Lotka system by a non-monotonic response function. A description of the various domains of structural stability and their bifurcations is given. The bifurcation structure is reduced to four organising
Computation of non-monotonic Lyapunov functions for continuous-time systems
Li, Huijuan; Liu, AnPing
2017-09-01
In this paper, we propose two methods to compute non-monotonic Lyapunov functions for continuous-time systems which are asymptotically stable. The first method is to solve a linear optimization problem on a compact and bounded set. The proposed linear programming based algorithm delivers a CPA1
Pospelov, A. I.
2016-08-01
Adaptive methods for the polyhedral approximation of the convex Edgeworth-Pareto hull in multiobjective monotone integer optimization problems are proposed and studied. For these methods, theoretical convergence rate estimates with respect to the number of vertices are obtained. The estimates coincide in order with those for filling and augmentation H-methods intended for the approximation of nonsmooth convex compact bodies.
Chen, Baojiang; Qin, Jing
2014-05-10
In statistical analysis, a regression model is needed if one is interested in finding the relationship between a response variable and covariates. When the response depends on the covariate, then it may also depend on the function of this covariate. If one has no knowledge of this functional form but expect for monotonic increasing or decreasing, then the isotonic regression model is preferable. Estimation of parameters for isotonic regression models is based on the pool-adjacent-violators algorithm (PAVA), where the monotonicity constraints are built in. With missing data, people often employ the augmented estimating method to improve estimation efficiency by incorporating auxiliary information through a working regression model. However, under the framework of the isotonic regression model, the PAVA does not work as the monotonicity constraints are violated. In this paper, we develop an empirical likelihood-based method for isotonic regression model to incorporate the auxiliary information. Because the monotonicity constraints still hold, the PAVA can be used for parameter estimation. Simulation studies demonstrate that the proposed method can yield more efficient estimates, and in some situations, the efficiency improvement is substantial. We apply this method to a dementia study.
On the Monotonicity and Log-Convexity of a Four-Parameter Homogeneous Mean
Directory of Open Access Journals (Sweden)
Yang Zhen-Hang
2008-01-01
Full Text Available Abstract A four-parameter homogeneous mean is defined by another approach. The criterion of its monotonicity and logarithmically convexity is presented, and three refined chains of inequalities for two-parameter mean values are deduced which contain many new and classical inequalities for means.
Travelling Wave Solutions in Delayed Reaction Diffusion Systems with Partial Monotonicity
Institute of Scientific and Technical Information of China (English)
Jian-hua Huang; Xing-fu Zou
2006-01-01
This paper deals with the existence of travelling wave fronts of delayed reaction diffusion systems with partial quasi-monotonicity. We propose a concept of "desirable pair of upper-lower solutions", through which a subset can be constructed. We then apply the Schauder's fixed point theorem to some appropriate operator in this subset to obtain the existence of the travelling wave fronts.
Generic Form of Bayesian Monte Carlo For Models With Partial Monotonicity
Rajabalinejad, M.
2012-01-01
This paper presents a generic method for the safety assessments of models with partial monotonicity. For this purpose, a Bayesian interpolation method is developed and implemented in the Monte Carlo process. integrated approach is the generalization of the recently developed techniques used in safet
Generic form of Bayesian Monte Carlo for models with partial monotonicity
Rajabalinejad, M.; Spitas, C.
2012-01-01
This paper presents a generic method for the safety assessments of models with partial monotonicity. For this purpose, a Bayesian interpolation method is developed and implemented in the Monte Carlo process. integrated approach is the generalization of the recently developed techniques used in safet
Stochastic Approximations and Monotonicity of a Single Server Feedback Retrial Queue
2012-01-01
This paper focuses on stochastic comparison of the Markov chains to derive some qualitative approximations for an M/G/1 retrial queue with a Bernoulli feedback. The main objective is to use stochastic ordering techniques to establish various monotonicity results with respect to arrival rates, service time distributions, and retrial parameters.
Stochastic Approximations and Monotonicity of a Single Server Feedback Retrial Queue
Directory of Open Access Journals (Sweden)
Mohamed Boualem
2012-01-01
Full Text Available This paper focuses on stochastic comparison of the Markov chains to derive some qualitative approximations for an M/G/1 retrial queue with a Bernoulli feedback. The main objective is to use stochastic ordering techniques to establish various monotonicity results with respect to arrival rates, service time distributions, and retrial parameters.
A cross-monotonic cost sharing method for the facility location game with service installation costs
Institute of Scientific and Technical Information of China (English)
XU DaChuan
2009-01-01
In this paper, we consider the metric uncapacitated facility location game with service installation costs. Our main result is an 11-approximate cross-monotonic cost-sharing method under the assumption that the installation cost depends only on the service type.
A cross-monotonic cost sharing method for the facility location game with service installation costs
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In this paper,we consider the metric uncapacitated facility location game with service installation costs. Our main result is an 11-approximate cross-monotonic cost-sharing method under the assumption that the installation cost depends only on the service type.
Variable selection in monotone single-index models via the adaptive LASSO.
Foster, Jared C; Taylor, Jeremy M G; Nan, Bin
2013-09-30
We consider the problem of variable selection for monotone single-index models. A single-index model assumes that the expectation of the outcome is an unknown function of a linear combination of covariates. Assuming monotonicity of the unknown function is often reasonable and allows for more straightforward inference. We present an adaptive LASSO penalized least squares approach to estimating the index parameter and the unknown function in these models for continuous outcome. Monotone function estimates are achieved using the pooled adjacent violators algorithm, followed by kernel regression. In the iterative estimation process, a linear approximation to the unknown function is used, therefore reducing the situation to that of linear regression and allowing for the use of standard LASSO algorithms, such as coordinate descent. Results of a simulation study indicate that the proposed methods perform well under a variety of circumstances and that an assumption of monotonicity, when appropriate, noticeably improves performance. The proposed methods are applied to data from a randomized clinical trial for the treatment of a critical illness in the intensive care unit.
Non-Payoff Monotonic Dynamics in an Evolutionary Game of Courtship
Chacoma, Andrés; Zanette, Damián H
2015-01-01
We propose an evolutionary coordination game to formalize a simplified model of the evolution of strategies during human courtship. The dynamics, derived from the consideration of experimental observations on human social behavior driven by self-esteem, turns out to be non-payoff monotonic. This property gives rise to nontrivial evolution in the players' strategies, which we study both numerically and analytically.
Zhang, Hongbin; Feng, Gang
2008-10-01
This paper is concerned with stability analysis and H(infinity) decentralized control of discrete-time fuzzy large-scale systems based on piecewise Lyapunov functions. The fuzzy large-scale systems consist of J interconnected discrete-time Takagi-Sugeno (T-S) fuzzy subsystems, and the stability analysis is based on Lyapunov functions that are piecewise quadratic. It is shown that the stability of the discrete-time fuzzy large-scale systems can be established if a piecewise quadratic Lyapunov function can be constructed, and moreover, the function can be obtained by solving a set of linear matrix inequalities (LMIs) that are numerically feasible. The H(infinity) controllers are also designed by solving a set of LMIs based on these powerful piecewise quadratic Lyapunov functions. It is demonstrated via numerical examples that the stability and controller synthesis results based on the piecewise quadratic Lyapunov functions are less conservative than those based on the common quadratic Lyapunov functions.
DEFF Research Database (Denmark)
Foglia, Aligi; Gottardi, Guido; Govoni, Laura;
2015-01-01
The response of bucket foundations on sand subjected to planar monotonic and cyclic loading is investigated in the paper. Thirteen monotonic and cyclic laboratory tests on a skirted footing model having a 0.3 m diameter and embedment ratio equal to 1 are presented. The loading regime reproduces t...
Le Quang, Thuan; Camlibel, M. K.
2014-01-01
In this paper, we deal with the well-posedness (in the sense of existence and uniqueness of solutions) and nature of solutions for discontinuous bimodal piecewise affine systems in a differential inclusion setting. First, we show that the conditions guaranteeing uniqueness of Filippov solutions in t
DEFF Research Database (Denmark)
Wolf, Paul A.; Jørgensen, Jakob Sauer; Schmidt, Taly G.
2013-01-01
A sparsity-exploiting algorithm intended for few-view Single Photon Emission Computed Tomography (SPECT) reconstruction is proposed and characterized. The algorithm models the object as piecewise constant subject to a blurring operation. To validate that the algorithm closely approximates the true...
Automated Controller Synthesis for non-Deterministic Piecewise-Affine Hybrid Systems
DEFF Research Database (Denmark)
Grunnet, Jacob Deleuran
formations. This thesis uses a hybrid systems model of a satellite formation with possible actuator faults as a motivating example for developing an automated control synthesis method for non-deterministic piecewise-affine hybrid systems (PAHS). The method does not only open an avenue for further research......To further advance space based science the need for ever more precise measurement techniques increases. One of the most promising new ideas are satellite formations where accurate spatial control of multiple spacecraft can be used to create very large virtual apertures or very sensitive...... interferometric measurements. Control of satellite formations presents a whole new set of challenges for spacecraft control systems requiring advances in actuation, sensing, communication, and control algorithms. Specifically having the control system duplicated onto multiple satellites increases the possibility...
Mixed-Mode Oscillations in a piecewise linear system with multiple time scale coupling
Fernández-García, S.; Krupa, M.; Clément, F.
2016-10-01
In this work, we analyze a four dimensional slow-fast piecewise linear system with three time scales presenting Mixed-Mode Oscillations. The system possesses an attractive limit cycle along which oscillations of three different amplitudes and frequencies can appear, namely, small oscillations, pulses (medium amplitude) and one surge (largest amplitude). In addition to proving the existence and attractiveness of the limit cycle, we focus our attention on the canard phenomena underlying the changes in the number of small oscillations and pulses. We analyze locally the existence of secondary canards leading to the addition or subtraction of one small oscillation and describe how this change is globally compensated for or not with the addition or subtraction of one pulse.
Piecewise Smooth Dynamical Systems Theory: The Case of the Missing Boundary Equilibrium Bifurcations
Hogan, S. J.; Homer, M. E.; Jeffrey, M. R.; Szalai, R.
2016-10-01
We present two codimension-one bifurcations that occur when an equilibrium collides with a discontinuity in a piecewise smooth dynamical system. These simple cases appear to have escaped recent classifications. We present them here to highlight some of the powerful results from Filippov's book Differential Equations with Discontinuous Righthand Sides (Kluwer, 1988). Filippov classified the so-called boundary equilibrium collisions without providing their unfolding. We show the complete unfolding here, for the first time, in the particularly interesting case of a node changing its stability as it collides with a discontinuity. We provide a prototypical model that can be used to generate all codimension-one boundary equilibrium collisions, and summarize the elements of Filippov's work that are important in achieving a full classification.
Directory of Open Access Journals (Sweden)
Hwanyub Joo
2015-01-01
Full Text Available This paper addresses the output regulation problem of synchronous buck converters with piecewise-constant load fluctuations via linear parameter varying (LPV control scheme. To this end, an output-error state-space model is first derived in the form of LPV systems so that it can involve a mismatch error that temporally arises from the process of generating a feedforward control. Then, to attenuate the mismatch error in parallel with improving the transient behavior of the converter, this paper proposes an LMI-based stabilization condition capable of achieving both H∞ and pole-placement objectives. Finally, the simulation and experimental results are provided to show the validity of our approach.
Ultra-high-frequency piecewise-linear chaos using delayed feedback loops
Cohen, Seth D.; Rontani, Damien; Gauthier, Daniel J.
2012-12-01
We report on an ultra-high-frequency (>1 GHz), piecewise-linear chaotic system designed from low-cost, commercially available electronic components. The system is composed of two electronic time-delayed feedback loops: A primary analog loop with a variable gain that produces multi-mode oscillations centered around 2 GHz and a secondary loop that switches the variable gain between two different values by means of a digital-like signal. We demonstrate experimentally and numerically that such an approach allows for the simultaneous generation of analog and digital chaos, where the digital chaos can be used to partition the system's attractor, forming the foundation for a symbolic dynamics with potential applications in noise-resilient communications and radar.
Generalized Methods and Solvers for Noise Removal from Piecewise Constant Signals
Little, Max A
2010-01-01
Removing noise from piecewise constant (PWC) signals, is a challenging signal processing problem arising in many practical contexts. For example, in exploration geosciences, noisy drill hole records need separating into stratigraphic zones, and in biophysics, jumps between molecular dwell states need extracting from noisy fluorescence microscopy signals. Many PWC denoising methods exist, including total variation regularization, mean shift clustering, stepwise jump placement, running medians, convex clustering shrinkage and bilateral filtering; conventional linear signal processing methods are fundamentally unsuited however. This paper shows that most of these methods are associated with a special case of a generalized functional, minimized to achieve PWC denoising. The minimizer can be obtained by diverse solver algorithms, including stepwise jump placement, convex programming, finite differences, iterated running medians, least angle regression, regularization path following, and coordinate descent. We intr...
Video Enhancement Using Adaptive Spatio-Temporal Connective Filter and Piecewise Mapping
Directory of Open Access Journals (Sweden)
Wang Chao
2008-01-01
Full Text Available This paper presents a novel video enhancement system based on an adaptive spatio-temporal connective (ASTC noise filter and an adaptive piecewise mapping function (APMF. For ill-exposed videos or those with much noise, we first introduce a novel local image statistic to identify impulse noise pixels, and then incorporate it into the classical bilateral filter to form ASTC, aiming to reduce the mixture of the most two common types of noises—Gaussian and impulse noises in spatial and temporal directions. After noise removal, we enhance the video contrast with APMF based on the statistical information of frame segmentation results. The experiment results demonstrate that, for diverse low-quality videos corrupted by mixed noise, underexposure, overexposure, or any mixture of the above, the proposed system can automatically produce satisfactory results.
Video Enhancement Using Adaptive Spatio-Temporal Connective Filter and Piecewise Mapping
Directory of Open Access Journals (Sweden)
Shi-Qiang Yang
2008-06-01
Full Text Available This paper presents a novel video enhancement system based on an adaptive spatio-temporal connective (ASTC noise filter and an adaptive piecewise mapping function (APMF. For ill-exposed videos or those with much noise, we first introduce a novel local image statistic to identify impulse noise pixels, and then incorporate it into the classical bilateral filter to form ASTC, aiming to reduce the mixture of the most two common types of noisesÃ¢Â€Â”Gaussian and impulse noises in spatial and temporal directions. After noise removal, we enhance the video contrast with APMF based on the statistical information of frame segmentation results. The experiment results demonstrate that, for diverse low-quality videos corrupted by mixed noise, underexposure, overexposure, or any mixture of the above, the proposed system can automatically produce satisfactory results.
Mandrekar, Pratik
2011-01-01
We study the properties of least time trajectories for particles moving on a two dimensional surface which consists of piecewise homogeneous regions. The particles are assumed to move with different constant speeds on different regions and on the boundary between regions. The speed of the particle is assumed to be highest when it moves along the edges formed by the boundary of two regions. We get an analogous behavior to Snell's Law of light refraction, but in a more generalized form. The model could be used for studying properties of animal and insect trails which tend to form predominantly along edges. The model predicts three types of behavior for the trajectories near a corner forming edge: fully edge following, partial edge following and complete avoidance of the edge, which are indeed observed in natural ant trails.
Synchronization regions of two pulse-coupled electronic piecewise linear oscillators
Rubido, N.; Cabeza, C.; Kahan, S.; Ramírez Ávila, G. M.; Marti, Arturo C.
2011-03-01
Stable synchronous states of different order were analytically, numerically and experimentally characterized in pulse-coupled light-controlled oscillators (LCOs). The Master-Slave (MS) configuration was studied in conditions where different time-scale parameters were tuned under varying coupling strength. Arnold tongues calculated analytically - based on the piecewise two-time-scale model for LCOs - and obtained numerically were consistent with experimental results. The analysis of the stability pattern and tongue shape for (1 : n) synchronization was based on the construction of return maps representing the Slave LCO evolution induced by the action of the Master LCO. The analysis of these maps showed that both tongue shape and stability pattern remained invariant. Considering the wide variation range of LCO parameters, the obtained results could have further applications on ethological models.
Generic fractal structure of finite parts of trajectories of piecewise smooth Hamiltonian systems
Hildebrand, R.; Lokutsievskiy, L. V.; Zelikin, M. I.
2013-03-01
Piecewise smooth Hamiltonian systems with tangent discontinuity are studied. A new phenomenon is discovered, namely, the generic chaotic behavior of finite parts of trajectories. The approach is to consider the evolution of Poisson brackets for smooth parts of the initial Hamiltonian system. It turns out that, near second-order singular points lying on a discontinuity stratum of codimension two, the system of Poisson brackets is reduced to the Hamiltonian system of the Pontryagin Maximum Principle. The corresponding optimization problem is studied and the topological structure of its optimal trajectories is constructed (optimal synthesis). The synthesis contains countably many periodic solutions on the quotient space by the scale group and a Cantor-like set of nonwandering points (NW) having fractal Hausdorff dimension. The dynamics of the system is described by a topological Markov chain. The entropy is evaluated, together with bounds for the Hausdorff and box dimension of (NW).
Data-based identification and control of nonlinear systems via piecewise affine approximation.
Lai, Chow Yin; Xiang, Cheng; Lee, Tong Heng
2011-12-01
The piecewise affine (PWA) model represents an attractive model structure for approximating nonlinear systems. In this paper, a procedure for obtaining the PWA autoregressive exogenous (ARX) (autoregressive systems with exogenous inputs) models of nonlinear systems is proposed. Two key parameters defining a PWARX model, namely, the parameters of locally affine subsystems and the partition of the regressor space, are estimated, the former through a least-squares-based identification method using multiple models, and the latter using standard procedures such as neural network classifier or support vector machine classifier. Having obtained the PWARX model of the nonlinear system, a controller is then derived to control the system for reference tracking. Both simulation and experimental studies show that the proposed algorithm can indeed provide accurate PWA approximation of nonlinear systems, and the designed controller provides good tracking performance.
Two-Dimensional Bumps in Piecewise Smooth Neural Fields with Synaptic Depression
Bressloff, Paul C.
2011-01-01
We analyze radially symmetric bumps in a two-dimensional piecewise-smooth neural field model with synaptic depression. The continuum dynamics is described in terms of a nonlocal integrodifferential equation, in which the integral kernel represents the spatial distribution of synaptic weights between populations of neurons whose mean firing rate is taken to be a Heaviside function of local activity. Synaptic depression dynamically reduces the strength of synaptic weights in response to increases in activity. We show that in the case of a Mexican hat weight distribution, sufficiently strong synaptic depression can destabilize a stationary bump solution that would be stable in the absence of depression. Numerically it is found that the resulting instability leads to the formation of a traveling spot. The local stability of a bump is determined by solutions to a system of pseudolinear equations that take into account the sign of perturbations around the circular bump boundary. © 2011 Society for Industrial and Applied Mathematics.
Yuan, Xiao-Tong; Yan, Shuicheng
2012-04-01
We investigate Newton-type optimization methods for solving piecewise linear systems (PLSs) with nondegenerate coefficient matrix. Such systems arise, for example, from the numerical solution of linear complementarity problem, which is useful to model several learning and optimization problems. In this letter, we propose an effective damped Newton method, PLS-DN, to find the exact (up to machine precision) solution of nondegenerate PLSs. PLS-DN exhibits provable semiiterative property, that is, the algorithm converges globally to the exact solution in a finite number of iterations. The rate of convergence is shown to be at least linear before termination. We emphasize the applications of our method in modeling, from a novel perspective of PLSs, some statistical learning problems such as box-constrained least squares, elitist Lasso (Kowalski & Torreesani, 2008), and support vector machines (Cortes & Vapnik, 1995). Numerical results on synthetic and benchmark data sets are presented to demonstrate the effectiveness and efficiency of PLS-DN on these problems.
Energy Technology Data Exchange (ETDEWEB)
Budantsev, M. V., E-mail: budants@isp.nsc.ru; Lavrov, R. A.; Pogosov, A. G.; Zhdanov, E. Yu.; Pokhabov, D. A. [Russian Academy of Sciences, Rzhanov Institute of Semiconductor Physics, Siberian Branch (Russian Federation)
2011-02-15
Extraordinary piecewise parabolic behavior of the magnetoresistance has been experimentally detected in the two-dimensional electron gas with a dense triangular lattice of antidots, where commensurability magnetoresistance oscillations are suppressed. The magnetic field range of 0-0.6 T can be divided into three wide regions, in each of which the magnetoresistance is described by parabolic dependences with high accuracy (comparable to the experimental accuracy) and the transition regions between adjacent regions are much narrower than the regions themselves. In the region corresponding to the weakest magnetic fields, the parabolic behavior becomes almost linear. The observed behavior is reproducible as the electron gas density changes, which results in a change in the resistance by more than an order of magnitude. Possible physical mechanisms responsible for the observed behavior, including so-called 'memory effects,' are discussed.
An Adaptive Piecewise Curve-Fitting Package Using a Look-Ahead Strategy.
1981-01-01
LOOK-AHEAD STRATEGY# ,PI -lNGC- ;EI AqF AUTHO~fqj T-8 CC’NTPA:T DFZ -CNALN NJIMiiEP BlD C.Platt G. D. /aylor ’_,_.____--_-__ T-EPiRORMINGO CRAWANIH 44VN...8. SMTH= 6. TOL= . 100 . KNOTS ARE INDICATED BY 0. .700E-01 .600E-01 .500E-01 .400E-01 .300E-01 .2OCE-01 * IOCE-01 0 . . I I I I I I l I I I I I I I I...SMTH= 1, TOL= . 100 . KNOTS ARE INDICATED BY 0. * IOOE-01 X a. .. I0E+01 .200E+01 .300E-C PIECEWISE POLYNOMIAL APPROX. USING (DISCRETE) L2 APPROX
Directory of Open Access Journals (Sweden)
Dufan Wu
2013-01-01
Full Text Available Dual energy CT has the ability to give more information about the test object by reconstructing the attenuation factors under different energies. These images under different energies share identical structures but different attenuation factors. By referring to the fully sampled low-energy image, we show that it is possible to greatly reduce the sampling rate of the high-energy image in order to lower dose. To compensate the attenuation factor difference between the two modalities, we use piecewise polynomial fitting to fit the low-energy image to the high-energy image. During the reconstruction, the result is constrained by its distance to the fitted image, and the structural information thus can be preserved. An ASD-POCS-based optimization schedule is proposed to solve the problem, and numerical simulations are taken to verify the algorithm.
Development of New Loan Payment Models with Piecewise Geometric Gradient Series
Directory of Open Access Journals (Sweden)
Erdal Aydemir
2014-12-01
Full Text Available Engineering economics plays an important role in decision making. Also, the cash flows, time value of money and interest rates are the most important research fields in mathematical finance. Generalized formulae obtained from a variety of models with the time value of money and cash flows are inadequate to solve some problems. In this study, a new generalized formulae is considered for the first time and derived from a loan payment model which is a certain number of payment amount determined by customer at the beginning of payment period and the other repayments with piecewise linear gradient series. As a result, some numerical examples with solutions are given for the developed models.
Liu, Xuele
2016-01-01
Finding new phase is a fundamental task in physics. Landau's theory explained the deep connection between symmetry breaking and phase transition commonly occurring in magnetic, superconducting and super uid systems. The discovery of the quantum Hall effect led to Z topological phases which could be different for same symmetry and are characterized by the discrete values of the Berry phases. By studying 1D trimer lattices we report new phases characterized by Berry phases which are piecewise continuous rather than discrete numbers. The phase transition occurs at the discontinuity point. With time-dependent changes, trimer lattices also give a 2D phases characterized by very specific 2D Berry phases of half period. These Berry phases change smoothly within a phase while change discontinuously at the transition point. We further demonstrate the existence of adiabatic pumping for each phase and gain assisted enhanced pumping. The non-reciprocity of the pumping process makes the system a good optical diode.
Averaging for a Fully-Coupled Piecewise Deterministic Markov Process in Infinite Dimension
Genadot, Alexandre
2011-01-01
In this paper, we consider the generalized Hodgkin-Huxley model introduced by Austin in \\cite{Austin}. This model describes the propagation of an action potential along the axon of a neuron at the scale of ion channels. Mathematically, this model is a fully-coupled Piecewise Deterministic Markov Process (PDMP) in infinite dimension. We introduce two time scales in this model in considering that some ion channels open and close at faster jump rates than others. We perform a slow-fast analysis of this model and prove that asymptotically this two time scales model reduces to the so called averaged model which is still a PDMP in infinite dimension for which we provide effective evolution equations and jump rates.
Locomotion of C. elegans: a piecewise-harmonic curvature representation of nematode behavior.
Directory of Open Access Journals (Sweden)
Venkat Padmanabhan
Full Text Available Caenorhabditis elegans, a free-living soil nematode, displays a rich variety of body shapes and trajectories during its undulatory locomotion in complex environments. Here we show that the individual body postures and entire trails of C. elegans have a simple analytical description in curvature representation. Our model is based on the assumption that the curvature wave is generated in the head segment of the worm body and propagates backwards. We have found that a simple harmonic function for the curvature can capture multiple worm shapes during the undulatory movement. The worm body trajectories can be well represented in terms of piecewise sinusoidal curvature with abrupt changes in amplitude, wavevector, and phase.
Nie, Xiaobing; Zheng, Wei Xing
2015-11-01
In this paper, we discuss the coexistence and dynamical behaviors of multiple equilibrium points for recurrent neural networks with a class of discontinuous nonmonotonic piecewise linear activation functions. It is proved that under some conditions, such n -neuron neural networks can have at least 5(n) equilibrium points, 3(n) of which are locally stable and the others are unstable, based on the contraction mapping theorem and the theory of strict diagonal dominance matrix. The investigation shows that the neural networks with the discontinuous activation functions introduced in this paper can have both more total equilibrium points and more locally stable equilibrium points than the ones with continuous Mexican-hat-type activation function or discontinuous two-level activation functions. An illustrative example with computer simulations is presented to verify the theoretical analysis.
3D Aware Correction and Completion of Depth Maps in Piecewise Planar Scenes
Thabet, Ali Kassem
2015-04-16
RGB-D sensors are popular in the computer vision community, especially for problems of scene understanding, semantic scene labeling, and segmentation. However, most of these methods depend on reliable input depth measurements, while discarding unreliable ones. This paper studies how reliable depth values can be used to correct the unreliable ones, and how to complete (or extend) the available depth data beyond the raw measurements of the sensor (i.e. infer depth at pixels with unknown depth values), given a prior model on the 3D scene. We consider piecewise planar environments in this paper, since many indoor scenes with man-made objects can be modeled as such. We propose a framework that uses the RGB-D sensor’s noise profile to adaptively and robustly fit plane segments (e.g. floor and ceiling) and iteratively complete the depth map, when possible. Depth completion is formulated as a discrete labeling problem (MRF) with hard constraints and solved efficiently using graph cuts. To regularize this problem, we exploit 3D and appearance cues that encourage pixels to take on depth values that will be compatible in 3D to the piecewise planar assumption. Extensive experiments, on a new large-scale and challenging dataset, show that our approach results in more accurate depth maps (with 20 % more depth values) than those recorded by the RGB-D sensor. Additional experiments on the NYUv2 dataset show that our method generates more 3D aware depth. These generated depth maps can also be used to improve the performance of a state-of-the-art RGB-D SLAM method.
Interior region-of-interest reconstruction using a small, nearly piecewise constant subregion.
Taguchi, Katsuyuki; Xu, Jingyan; Srivastava, Somesh; Tsui, Benjamin M W; Cammin, Jochen; Tang, Qiulin
2011-03-01
To develop a method to reconstruct an interior region-of-interest (ROI) image with sufficient accuracy that uses differentiated backprojection (DBP) projection onto convex sets (POCS) [H. Kudo et al., "Tiny a priori knowledge solves the interior problem in computed tomography," Phys. Med. Biol. 53, 2207-2231 (2008)] and a tiny knowledge that there exists a nearly piecewise constant subregion. The proposed method first employs filtered backprojection to reconstruct an image on which a tiny region P with a small variation in the pixel values is identified inside the ROI. Total variation minimization [H. Yu and G. Wang, "Compressed sensing based interior tomography," Phys. Med. Biol. 54, 2791-2805 (2009); W. Han et al., "A general total variation minimization theorem for compressed sensing based interior tomography," Int. J. Biomed. Imaging 2009, Article 125871 (2009)] is then employed to obtain pixel values in the subregion P, which serve as a priori knowledge in the next step. Finally, DBP-POCS is performed to reconstruct f(x,y) inside the ROI. Clinical data and the reconstructed image obtained by an x-ray computed tomography system (SOMATOM Definition; Siemens Healthcare) were used to validate the proposed method. The detector covers an object with a diameter of approximately 500 mm. The projection data were truncated either moderately to limit the detector coverage to Ø 350 mm of the object or severely to cover Ø199 mm. Images were reconstructed using the proposed method. The proposed method provided ROI images with correct pixel values in all areas except near the edge of the ROI. The coefficient of variation, i.e., the root mean square error divided by the mean pixel values, was less than 2.0% or 4.5% with the moderate or severe truncation cases, respectively, except near the boundary of the ROI. The proposed method allows for reconstructing interior ROI images with sufficient accuracy with a tiny knowledge that there exists a nearly piecewise constant
Yao, Weigang; Liou, Meng-Sing
2016-08-01
To preserve nonlinearity of a full-order system over a range of parameters of interest, we propose an accurate and robust nonlinear modeling approach by assembling a set of piecewise linear local solutions expanded about some sampling states. The work by Rewienski and White [1] on micromachined devices inspired our use of piecewise linear local solutions to study nonlinear unsteady aerodynamics. These local approximations are assembled via nonlinear weights of radial basis functions. The efficacy of the proposed procedure is validated for a two-dimensional airfoil moving with different pitching motions, specifically AGARD's CT2 and CT5 problems [27], in which the flows exhibit different nonlinear behaviors. Furthermore, application of the developed aerodynamic model to a two-dimensional aero-elastic system proves the approach is capable of predicting limit cycle oscillations (LCOs) by using AGARD's CT6 [28] as a benchmark test. All results, based on inviscid solutions, confirm that our nonlinear model is stable and accurate, against the full model solutions and measurements, and for predicting not only aerodynamic forces but also detailed flowfields. Moreover, the model is robust for inputs that considerably depart from the base trajectory in form and magnitude. This modeling provides a very efficient way for predicting unsteady flowfields with varying parameters because it needs only a tiny fraction of the cost of a full-order modeling for each new condition-the more cases studied, the more savings rendered. Hence, the present approach is especially useful for parametric studies, such as in the case of design optimization and exploration of flow phenomena.
The Stiffness Variation of a Micro-Ring Driven by a Traveling Piecewise-Electrode
Directory of Open Access Journals (Sweden)
Yingjie Li
2014-09-01
Full Text Available In the practice of electrostatically actuated micro devices; the electrostatic force is implemented by sequentially actuated piecewise-electrodes which result in a traveling distributed electrostatic force. However; such force was modeled as a traveling concentrated electrostatic force in literatures. This article; for the first time; presents an analytical study on the stiffness variation of microstructures driven by a traveling piecewise electrode. The analytical model is based on the theory of shallow shell and uniform electrical field. The traveling electrode not only applies electrostatic force on the circular-ring but also alters its dynamical characteristics via the negative electrostatic stiffness. It is known that; when a structure is subjected to a traveling constant force; its natural mode will be resonated as the traveling speed approaches certain critical speeds; and each natural mode refers to exactly one critical speed. However; for the case of a traveling electrostatic force; the number of critical speeds is more than that of the natural modes. This is due to the fact that the traveling electrostatic force makes the resonant frequencies of the forward and backward traveling waves of the circular-ring different. Furthermore; the resonance and stability can be independently controlled by the length of the traveling electrode; though the driving voltage and traveling speed of the electrostatic force alter the dynamics and stabilities of microstructures. This paper extends the fundamental insights into the electromechanical behavior of microstructures driven by electrostatic forces as well as the future development of MEMS/NEMS devices with electrostatic actuation and sensing.
Energy Technology Data Exchange (ETDEWEB)
Salini, K. [School of Physics, IISER TVM, CET Campus, Thiruvananthapuram, Kerala 695 016 (India); Prabhu, R.; Sen, Aditi [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India); Sen, Ujjwal, E-mail: ujjwal@hri.res.in [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India)
2014-09-15
Monogamy of quantum correlation measures puts restrictions on the sharability of quantum correlations in multiparty quantum states. Multiparty quantum states can satisfy or violate monogamy relations with respect to given quantum correlations. We show that all multiparty quantum states can be made monogamous with respect to all measures. More precisely, given any quantum correlation measure that is non-monogamic for a multiparty quantum state, it is always possible to find a monotonically increasing function of the measure that is monogamous for the same state. The statement holds for all quantum states, whether pure or mixed, in all finite dimensions and for an arbitrary number of parties. The monotonically increasing function of the quantum correlation measure satisfies all the properties that are expected for quantum correlations to follow. We illustrate the concepts by considering a thermodynamic measure of quantum correlation, called the quantum work deficit.
Estimation of a monotone percentile residual life function under random censorship.
Franco-Pereira, Alba M; de Uña-Álvarez, Jacobo
2013-01-01
In this paper, we introduce a new estimator of a percentile residual life function with censored data under a monotonicity constraint. Specifically, it is assumed that the percentile residual life is a decreasing function. This assumption is useful when estimating the percentile residual life of units, which degenerate with age. We establish a law of the iterated logarithm for the proposed estimator, and its n-equivalence to the unrestricted estimator. The asymptotic normal distribution of the estimator and its strong approximation to a Gaussian process are also established. We investigate the finite sample performance of the monotone estimator in an extensive simulation study. Finally, data from a clinical trial in primary biliary cirrhosis of the liver are analyzed with the proposed methods. One of the conclusions of our work is that the restricted estimator may be much more efficient than the unrestricted one.
Monotonic and Cyclic Behavior of DIN 34CrNiMo6 Tempered Alloy Steel
Directory of Open Access Journals (Sweden)
Ricardo Branco
2016-04-01
Full Text Available This paper aims at studying the monotonic and cyclic plastic deformation behavior of DIN 34CrNiMo6 high strength steel. Monotonic and low-cycle fatigue tests are conducted in ambient air, at room temperature, using standard 8-mm diameter specimens. The former tests are carried out under position control with constant displacement rate. The latter are performed under fully-reversed strain-controlled conditions, using the single-step test method, with strain amplitudes lying between ±0.4% and ±2.0%. After the tests, the fracture surfaces are examined by scanning electron microscopy in order to characterize the surface morphologies and identify the main failure mechanisms. Regardless of the strain amplitude, a softening behavior was observed throughout the entire life. Total strain energy density, defined as the sum of both tensile elastic and plastic strain energies, was revealed to be an adequate fatigue damage parameter for short and long lives.
Characterisation of steel components under monotonic loading by means of image-based methods
Xavier, J.; Pereira, J. C. R.; de Jesus, A. M. P.
2014-02-01
Ductile damage behaviour of S185 structural steel is determined by coupling numerical and experimental analyses. Monotonic experimental tests are carried out in five different specimen configurations. These mechanical tests are coupled with image-based methods for assessing displacement and strain fields over the gauge section. Three different ductile damage models proposed in the literature for monotonic loading are analysed. Their governing parameters are determined by comparing experimental and numerical mechanical responses. Measurements provided by digital image correlation and feature-tracking methods are used for calibrating and validating non-linear finite element modelling. Numerical analyses built in ANSYS are carried out to compute the necessary parameters (stress-strain and triaxiality histories) to calibrate Johnson-Cook (JC) and Kanvinde-Deierlein (KD) fracture criteria. Also, a calibration of the Gurson-Tvergaard-Needleman (GTN) model is performed based on an explicit finite element analysis in ABAQUS.