WorldWideScience

Sample records for deterministic polynomial time

  1. Schemes for Deterministic Polynomial Factoring

    CERN Document Server

    Ivanyos, Gábor; Saxena, Nitin

    2008-01-01

    In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring algorithm for finite fields to get an underlying m-scheme. We demonstrate how the properties of m-schemes relate to improvements in the deterministic complexity of factoring polynomials over finite fields assuming the generalized Riemann Hypothesis (GRH). In particular, we give the first deterministic polynomial time algorithm (assuming GRH) to find a nontrivial factor of a polynomial of prime degree n where (n-1) is a smooth number.

  2. Deterministic Polynomial-Time Algorithms for Designing Short DNA Words

    CERN Document Server

    Kao, Ming-Yang; Sun, He; Zhang, Yong

    2012-01-01

    Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that applied heuristic local searches, genetic algorithms, and randomized algorithms. In particular, Kao, Sanghi, and Schweller (2009) developed polynomial-time randomized algorithms to construct n DNA words of length within a multiplicative constant of the smallest possible word length (e.g., 9 max{log n, k}) that satisfy various sets of constraints with high probability. In this paper, we give deterministic polynomial-time algorithms to construct DNA words based on derandomization techniques. Our algorithms can construct n DN...

  3. A deterministic polynomial time algorithm for non-commutative rational identity testing with applications

    OpenAIRE

    2015-01-01

    In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over $\\mathbb{Q}$ is invertible or not. The analogous question for commuting variables is the celebrated polynomial identity testing (PIT) for symbolic determinants. In contrast to the commutative case, which has an efficient probabilistic algorithm, the best previous algorithm for the non-commutative setting required exponential time (whether or not randomization is ...

  4. A Deterministic and Polynomial Modified Perceptron Algorithm

    Directory of Open Access Journals (Sweden)

    Olof Barr

    2006-01-01

    Full Text Available We construct a modified perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3lognlog(1/ρ, where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modified perceptron algorithm running in timeO(mn2lognlog(1/ρ.

  5. A $O(\\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule

    CERN Document Server

    Covey, Jason

    2008-01-01

    We provide deterministic, polynomial-time computable voting rules that approximate Dodgson's and (the ``minimization version'' of) Young's scoring rules to within a logarithmic factor. Our approximation of Dodgson's rule is tight up to a constant factor, as Dodgson's rule is $\\NP$-hard to approximate to within some logarithmic factor. The ``maximization version'' of Young's rule is known to be $\\NP$-hard to approximate by any constant factor. Both approximations are simple, and natural as rules in their own right: Given a candidate we wish to score, we can regard either its Dodgson or Young score as the edit distance between a given set of voter preferences and one in which the candidate to be scored is the Condorcet winner. (The difference between the two scoring rules is the type of edits allowed.) We regard the marginal cost of a sequence of edits to be the number of edits divided by the number of reductions (in the candidate's deficit against any of its opponents in the pairwise race against that opponent...

  6. Deterministic Polynomial Factoring and Association Schemes

    CERN Document Server

    Arora, Manuel; Karpinski, Marek; Saxena, Nitin

    2012-01-01

    The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the generalized Riemann hypothesis (GRH). In this work we improve the state of the art by focusing on prime degree polynomials; let n be the degree. If (n-1) has a `large' r-smooth divisor s, then we find a nontrivial factor of f(x) in deterministic poly(n^r,log q) time; assuming GRH and that s > sqrt{n/(2^r)}. Thus, for r = O(1) our algorithm is polynomial time. Further, for r > loglog n there are infinitely many prime degrees n for which our algorithm is applicable and better than the best known; assuming GRH. Our methods build on the algebraic-combinatorial framework of m-schemes initiated by Ivanyos, Karpinski and Saxena (ISSAC 2009). We show that the m-scheme on n points, implicitly appearing in our factoring algorithm, has an exceptional structure; leading us to the improved time ...

  7. Topology and Non-Deterministic Polynomial Time Computation : Avoidance of The Misbehaviour of Hub-Free Diagrams and Consequences

    Directory of Open Access Journals (Sweden)

    Anthony Gasperin

    2013-09-01

    Full Text Available To study groups with small Dehn's function, Olshanskii and Sapir developed a new invariant of bipartite chords diagrams and applied it to hub-free realization of S-machines. In this paper we consider this new invariant together with groups constructed from S-machines containing the hub relation. The idea is to study the links between the topology of the asymptotic cones and polynomial time computations. Indeed it is known that the topology of such metric space depends on diagrams without hubs that do not correspond to the computations of the considered S-machine. This work gives sufficient conditions that avoid this misbehaviour, but as we shall see the method has a significant drawback.

  8. Time-reversal symmetry and random polynomials

    CERN Document Server

    Braun, D; Zyczkowski, K

    1996-01-01

    We analyze the density of roots of random polynomials where each complex coefficient is constructed of a random modulus and a fixed, deterministic phase. The density of roots is shown to possess a singular component only in the case for which the phases increase linearly with the index of coefficients. This means that, contrary to earlier belief, eigenvectors of a typical quantum chaotic system with some antiunitary symmetry will not display a clustering curve in the stellar representation. Moreover, a class of time-reverse invariant quantum systems is shown, for which spectra display fluctuations characteristic of orthogonal ensemble, while eigenvectors confer to predictions of unitary ensemble.

  9. Time-reversal symmetry and random polynomials

    OpenAIRE

    Braun, D; Kus, M.; Zyczkowski, K.

    1996-01-01

    We analyze the density of roots of random polynomials where each complex coefficient is constructed of a random modulus and a fixed, deterministic phase. The density of roots is shown to possess a singular component only in the case for which the phases increase linearly with the index of coefficients. This means that, contrary to earlier belief, eigenvectors of a typical quantum chaotic system with some antiunitary symmetry will not display a clustering curve in the stellar representation. M...

  10. Deterministic Real-time Thread Scheduling

    CERN Document Server

    Yun, Heechul; Sha, Lui

    2011-01-01

    Race condition is a timing sensitive problem. A significant source of timing variation comes from nondeterministic hardware interactions such as cache misses. While data race detectors and model checkers can check races, the enormous state space of complex software makes it difficult to identify all of the races and those residual implementation errors still remain a big challenge. In this paper, we propose deterministic real-time scheduling methods to address scheduling nondeterminism in uniprocessor systems. The main idea is to use timing insensitive deterministic events, e.g, an instruction counter, in conjunction with a real-time clock to schedule threads. By introducing the concept of Worst Case Executable Instructions (WCEI), we guarantee both determinism and real-time performance.

  11. Return times of polynomials as meta-Fibonacci numbers

    OpenAIRE

    Emerson, Nathaniel D.

    2004-01-01

    We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers. We study the general form of these closest return times. The main result of this paper is that these closest return times are meta-Fibonacci numbers. This result applies to the return times of a principal nest of a polynomial. Furthermore, we show that an ...

  12. Polynomials

    Science.gov (United States)

    Apostol, Tom M. (Editor)

    1991-01-01

    In this 'Project Mathematics! series, sponsored by California Institute for Technology (CalTech), the mathematical concept of polynomials in rectangular coordinate (x, y) systems are explored. sing film footage of real life applications and computer animation sequences, the history of, the application of, and the different linear coordinate systems for quadratic, cubic, intersecting, and higher degree of polynomials are discussed.

  13. Polynomial Time Algorithms for Minimum Energy Scheduling

    CERN Document Server

    Baptiste, Philippe; Durr, Christoph

    2009-01-01

    The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release times and deadlines that need to be executed on a single processor. Preemptions are allowed. The processor requires energy L to be woken up and, when it is on, it uses one unit of energy per one unit of time. It has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time. We solve this problem in positive, by providing an O(n^5)-time algorithm. In addition we pr...

  14. Polynomial-time solutions to image segmentation

    Energy Technology Data Exchange (ETDEWEB)

    Asano, Tetsuo [Osaka Electro-Communication Univ., Neyagawa (Japan); Chen, D.Z. [Notre Dame, South Bend, IN (United States); Katoh, Naoki [Kobe Univ. of Commerce (Japan)

    1996-12-31

    Separating an object in an image from its background is a central problem (called segmentation) in pattern recognition and computer vision. In this paper, we study the complexity of the segmentation problem, assuming that the object forms a connected region in an intensity image. We show that the optimization problem of separating a connected region in an n-pixel grid is NP-hard under the interclass variance, a criterion that is used in discriminant analysis. More importantly, we consider the basic case in which the object is separated by two x-monotone curves (i.e., the object itself is x-monotone), and present polynomial-time algorithms for computing exact and approximate optimal segmentation. Our main algorithm for exact optimal segmentation by two x-monotone curves runs in O(n{sup 2}) time; this algorithm is based on several techniques such as a parametric optimization formulation, a hand-probing algorithm for the convex hull of an unknown point set, and dynamic programming using fast matrix searching. Our efficient approximation scheme obtains an {epsilon}-approximate solution in O({epsilon}{sup -1} n log L) time, where {epsilon} is any fixed constant with 1 > {epsilon} > 0, and L is the total sum of the absolute values of brightness levels of the image.

  15. Bernstein polynomials for evolutionary algebraic prediction of short time series

    Science.gov (United States)

    Lukoseviciute, Kristina; Howard, Daniel; Ragulskis, Minvydas

    2017-07-01

    Short time series prediction technique based on Bernstein polynomials is presented in this paper. Firstly, the straightforward Bernstein polynomial extrapolation scheme is improved by extending the interval of approximation. Secondly, the forecasting scheme is designed in the evolutionary computational setup which is based on the conciliation between the coarseness of the algebraic prediction and the smoothness of the time average prediction. Computational experiments with the test time series suggest that this time series prediction technique could be applicable for various forecasting applications.

  16. Method of resolution of 3SAT in polynomial time

    CERN Document Server

    Salemi, Luigi

    2009-01-01

    Presentation of a Method for determining whether a problem 3Sat has solution, and if yes to find one, in time max O(n11). Is thus proved (if I am not mistaken yet) that the problem 3Sat is fully resolved in polynomial time and therefore that it is in P, by the work of Cook and Levin, and can transform a SAT problem in a 3Sat in polynomial time (ref. Karp), it follows that P = NP. Open Source program is available at http://www.visainformatica.it/3sat

  17. Modeling Microwave Structures in Time Domain Using Laguerre Polynomials

    Directory of Open Access Journals (Sweden)

    Z. Raida

    2006-09-01

    Full Text Available The paper is focused on time domain modeling of microwave structures by the method of moments. Two alternative schemes with weighted Laguerre polynomials are presented. Thanks to their properties, these schemes are free of late time oscillations. Further, the paper is aimed to effective and accurate evaluation of Green's functions integrals within these schemes. For this evaluation, a first- and second-order polynomial approximation is developed. The last part of the paper deals with modeling microstrip structures in the time domain. Conditions of impedance matching are derived, and the proposed approach is verified by modeling a microstrip filter.

  18. A Deterministic-Monte Carlo Hybrid Method for Time-Dependent Neutron Transport Problems

    Energy Technology Data Exchange (ETDEWEB)

    Justin Pounders; Farzad Rahnema

    2001-10-01

    A new deterministic-Monte Carlo hybrid solution technique is derived for the time-dependent transport equation. This new approach is based on dividing the time domain into a number of coarse intervals and expanding the transport solution in a series of polynomials within each interval. The solutions within each interval can be represented in terms of arbitrary source terms by using precomputed response functions. In the current work, the time-dependent response function computations are performed using the Monte Carlo method, while the global time-step march is performed deterministically. This work extends previous work by coupling the time-dependent expansions to space- and angle-dependent expansions to fully characterize the 1D transport response/solution. More generally, this approach represents and incremental extension of the steady-state coarse-mesh transport method that is based on global-local decompositions of large neutron transport problems. An example of a homogeneous slab is discussed as an example of the new developments.

  19. Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

    CERN Document Server

    Etessami, Kousha; Yannakakis, Mihalis

    2012-01-01

    We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max(min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/epsilon), where epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We establish this result using a generalization of Newton's method which applies to maxPPSs and minPPSs, even though the underlying functions are only piecewise-differentiable. This generalizes our recent work which provided a P-time algorithm for purely probabilistic PPSs. These equations form the Bellman optimality equations for several important classes of infinite-state Markov Decision Processes (MDPs). Thus, as a corollary, we obtain the first polynomial time algorithms for computing to within arbitrary desired precision the optimal value vector for several classes of infinite-state...

  20. Optimum short-time polynomial regression for signal analysis

    Indian Academy of Sciences (India)

    A SREENIVASA MURTHY; CHANDRA SEKHAR SEELAMANTULA; T V SREENIVAS

    2016-11-01

    We propose a short-time polynomial regression (STPR) for time-varying signal analysis. The advantage of using polynomials is that the notion of a spectrum is not needed and the signals can be analyzed in the time domain over short durations. In the presence of noise, such modeling becomes important, because the polynomial approximation performs smoothing leading to noise suppression. The problem of optimal smoothingdepends on the duration over which a fixed-order polynomial regression is performed. Considering the STPR of a noisy signal, we derive the optimal smoothing window by minimizing the mean-square error (MSE). For a fixed polynomial order, the smoothing window duration depends on the rate of signal variation, which, in turn,depends on its derivatives. Since the derivatives are not available a priori, exact optimization is not feasible.However, approximate optimization can be achieved using only the variance expressions and the intersection-ofconfidence-intervals (ICI) technique. The ICI technique is based on a consistency measure across confidence intervals corresponding to different window lengths. An approximate asymptotic analysis to determine the optimal confidence interval width shows that the asymptotic expressions are the same irrespective of whether one starts with a uniform sampling grid or a nonuniform one. Simulation results on sinusoids, chirps, and electrocardiogram (ECG) signals, and comparisons with standard wavelet denoising techniques, show that theproposed method is robust particularly in the low signal-to-noise ratio regime.

  1. 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.

  2. Polynomial Transformations For Discrete-Time Linear Systems

    Science.gov (United States)

    Baram, Yoram

    1991-01-01

    Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.

  3. Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata

    Science.gov (United States)

    Fujiyoshi, Akio

    In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs.

  4. Pooling Problems with Polynomial-Time Algorithms

    NARCIS (Netherlands)

    Haugland, Dag; Hendrix, Eligius M.T.

    2016-01-01

    The computational challenge offered by many traditional network flow models is modest, and large-scale instances can be solved fast. When the composition of the flow is part of the model, the required computation time may increase substantially. This is in particular true for the pooling problem,

  5. Computing the Tutte polynomial in vertex-exponential time

    CERN Document Server

    Björklund, Andreas; Kaski, Petteri; Koivisto, Mikko

    2007-01-01

    The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating link in knot theory, and the partition functions of the models of Ising, Potts, and Furtuin--Kasteleyn in statistical physics. Prior to this work, deletion--contraction was also the fastest known general-purpose algorithm for these invariants, running in time roughly proportional to the number of spanning trees in the input graph. Here, we provide a substantially faster algorithm that computes the Tutte polynomial--and hence, all the aforementioned invariants and more--of an arbitrary graph in time within a polynomial factor of the number of connected induced subgraphs. The algorithm is based on a new recurrence formula that alternates between partitioning an induced subgraph into components and a subtraction step to solve the connected case. For bounded-degree graphs on $n$ v...

  6. Norm convergence of continuous-time polynomial multiple ergodic averages

    CERN Document Server

    Austin, Tim

    2011-01-01

    For a jointly measurable probability-preserving action \\tau:\\bbR^D\\curvearrowright (X,\\mu) and a tuple of polynomial maps p_i:\\bbR\\to \\bbR^D, i=1,2,...,k, the multiple ergodic averages \\frac{1}{T}\\int_0^T (f_1\\circ \\tau^{p_1(t)})(f_2\\circ\\tau^{p_2(t)})... (f_k\\circ\\tau^{p_k(t)})\\,\\d t converge in L^2(\\mu) as T \\to \\infty for any f_1,f_2,...,f_k \\in L^\\infty(\\mu). This confirms the continuous-time analog of the conjectured norm convergence of discrete polynomial multiple ergodic averages, which in is its original formulation remains open in most cases. A proof of convergence can be given based on the idea of passing up to a sated extension of (X,\\mu,\\tau) in order to find simple characteristic factors, similarly to the recent development of this idea for the study of related discrete-time averages, together with a new inductive scheme on tuples of polynomials. The new induction scheme becomes available upon changing the time variable in the above integral by some fractional power, and provides an alternative t...

  7. Time-delay polynomial networks and rates of approximation

    Directory of Open Access Journals (Sweden)

    Irwin W. Sandberg

    1998-01-01

    Full Text Available We consider a large family of finite memory causal time-invariant maps G from an input set S to a set of ℝ-valued functions, with the members of both sets of functions defined on the nonnegative integers, and we give an upper bound on the error in approximating a G using a two-stage structure consisting of a tapped delay line and a static polynomial network N . This upper bound depends on the degree of the multivariable polynomial that characterizes N. Also given is a lower bound on the worst-case error in approximating a G using polynomials of a fixed maximum degree. These upper and lower bounds differ only by a multiplicative constant. We also give a corresponding result for the approximation of not-necessarily-causal input–output maps with inputs and outputs that may depend on more than one variable. This result is of interest, for example, in connection with image processing.

  8. Polynomial-time approximation schemes for scheduling problems with time lags

    OpenAIRE

    Zhang, Xiandong; Velde, Steef

    2010-01-01

    textabstractWe identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the number of machines and the ratio between the largest time lag and the smallest positive ope...

  9. Giant acoustic atom: A single quantum system with a deterministic time delay

    Science.gov (United States)

    Guo, Lingzhen; Grimsmo, Arne; Kockum, Anton Frisk; Pletyukhov, Mikhail; Johansson, Göran

    2017-05-01

    We investigate the quantum dynamics of a single transmon qubit coupled to surface acoustic waves (SAWs) via two distant connection points. Since the acoustic speed is five orders of magnitude slower than the speed of light, the traveling time between the two connection points needs to be taken into account. Therefore, we treat the transmon qubit as a giant atom with a deterministic time delay. We find that the spontaneous emission of the system, formed by the giant atom and the SAWs between its connection points, initially decays polynomially in the form of pulses instead of a continuous exponential decay behavior, as would be the case for a small atom. We obtain exact analytical results for the scattering properties of the giant atom up to two-phonon processes by using a diagrammatic approach. We find that two peaks appear in the inelastic (incoherent) power spectrum of the giant atom, a phenomenon which does not exist for a small atom. The time delay also gives rise to features in the reflectance, transmittance, and second-order correlation functions of the system. Furthermore, we find the short-time dynamics of the giant atom for arbitrary drive strength by a numerically exact method for open quantum systems with a finite-time-delay feedback loop.

  10. Simulation of Broadband Time Histories Combining Deterministic and Stochastic Methodologies

    Science.gov (United States)

    Graves, R. W.; Pitarka, A.

    2003-12-01

    We present a methodology for generating broadband (0 - 10 Hz) ground motion time histories using a hybrid technique that combines a stochastic approach at high frequencies with a deterministic approach at low frequencies. Currently, the methodology is being developed for moderate and larger crustal earthquakes, although the technique can theoretically be applied to other classes of events as well. The broadband response is obtained by summing the separate responses in the time domain using matched butterworth filters centered at 1 Hz. We use a kinematic description of fault rupture, incorporating spatial heterogeneity in slip, rupture velocity and rise time by discretizing an extended finite-fault into a number of smaller subfaults. The stochastic approach sums the response for each subfault assuming a random phase, an omega-squared source spectrum and simplified Green's functions (Boore, 1983). Gross impedance effects are incorporated using quarter wavelength theory (Boore and Joyner, 1997) to bring the response to a generic baserock level (e.g., Vs = 1000 m/s). The deterministic approach sums the response for many point sources distributed across each subfault. Wave propagation is modeled using a 3D viscoelastic finite difference algorithm with the minimum shear wave velocity set at 620 m/s. Short- and mid-period amplification factors provided by Borcherdt (1994) are used to develop frequency dependent site amplification functions. The amplification functions are applied to the stochastic and determinsitic responses separately since these may have different (computational) reference site velocities. The site velocity is taken as the measured or estimated value of {Vs}30. The use of these amplification factors is attractive because they account for non-linear response by considering the input acceleration level. We note that although these design factors are strictly defined for response spectra, we have applied them to the Fourier amplitude spectra of our

  11. Method reduces computer time for smoothing functions and derivatives through ninth order polynomials

    Science.gov (United States)

    Glauz, R. D.; Wilgus, C. A.

    1969-01-01

    Analysis presented is an efficient technique to adjust previously calculated orthogonal polynomial coefficients for an odd number of equally spaced data points. The adjusting technique derivation is for a ninth order polynomial. It reduces computer time for smoothing functions.

  12. Painleve V and time-dependent Jacobi polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Basor, Estelle [American Institute of Mathematics, Palo Alto, CA 94306 (United States); Chen Yang [Department of Mathematics, Imperial College London, 180 Queen' s Gates, London SW7 2BZ (United Kingdom); Ehrhardt, Torsten [Department of Mathematics, University of California, Santa Cruz, CA 95064 (United States)], E-mail: ebasor@aimath.org, E-mail: ychen@imperial.ac.uk, E-mail: ehrhardt@math.ucsc.edu

    2010-01-08

    In this paper we study the simplest deformation on a sequence of orthogonal polynomials. This in turn induces a deformation on the moment matrix of the polynomials and associated Hankel determinant. We replace the original (or reference) weight w{sub 0}(x) (supported on R or subsets of R) by w{sub 0}(x) e{sup -tx}. It is a well-known fact that under such a deformation the recurrence coefficients denoted as {alpha}{sub n} and {beta}{sub n} evolve in t according to the Toda equations, giving rise to the time-dependent orthogonal polynomials and time-dependent determinants, using Sogo's terminology. If w{sub 0} is the normal density e{sup -x{sup 2}}, x element of R, or the gamma density x{sup {alpha}} e{sup -x}, x element of R{sub +}, {alpha} > -1, then the initial value problem of the Toda equations can be trivially solved. This is because under elementary scaling and translation the orthogonality relations reduce to the original ones. However, if w{sub 0} is the beta density (1 - x){sup {alpha}}(1 + x){sup {beta}}, x in [ - 1, 1], {alpha}, {beta} > -1, the resulting 'time-dependent' Jacobi polynomials will again satisfy a linear second-order ode, but no longer in the Sturm-Liouville form, which is to be expected. This deformation induces an irregular singular point at infinity in addition to three regular singular points of the hypergeometric equation satisfied by the Jacobi polynomials. We will show that the coefficients of this ode, as well as the Hankel determinant, are intimately related to a particular Painleve V. In particular we show that p{sub 1}(n,t), where p{sub 1}(n,t) is the coefficient of z{sup n-1} of the monic orthogonal polynomials associated with the 'time-dependent' Jacobi weight, satisfies, up to a translation in t, the Jimbo-Miwa {sigma}-form of the same P{sub V}; while a recurrence coefficient {alpha}{sub n}(t) is up to a translation in t and a linear fractional transformation P{sub V}({alpha}{sup 2}/2, - {beta}{sup 2

  13. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.

    Science.gov (United States)

    Traversa, Fabio L; Di Ventra, Massimiliano

    2017-02-01

    We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept of self-organizing logic gates and circuits (SOLCs). These are logic gates and circuits able to accept input signals from any terminal, without distinction between conventional input and output terminals. They can solve boolean problems by self-organizing into their solution. They can be fabricated either with circuit elements with memory (such as memristors) and/or standard MOS technology. Using tools of functional analysis, we prove mathematically the following constraints for the poly-resource resolvability: (i) SOLCs possess a global attractor; (ii) their only equilibrium points are the solutions of the problems to solve; (iii) the system converges exponentially fast to the solutions; (iv) the equilibrium convergence rate scales at most polynomially with input size. We finally provide arguments that periodic orbits and strange attractors cannot coexist with equilibria. As examples, we show how to solve the prime factorization and the search version of the NP-complete subset-sum problem. Since DMMs map integers into integers, they are robust against noise and hence scalable. We finally discuss the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability.

  14. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines

    Science.gov (United States)

    Traversa, Fabio L.; Di Ventra, Massimiliano

    2017-02-01

    We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept of self-organizing logic gates and circuits (SOLCs). These are logic gates and circuits able to accept input signals from any terminal, without distinction between conventional input and output terminals. They can solve boolean problems by self-organizing into their solution. They can be fabricated either with circuit elements with memory (such as memristors) and/or standard MOS technology. Using tools of functional analysis, we prove mathematically the following constraints for the poly-resource resolvability: (i) SOLCs possess a global attractor; (ii) their only equilibrium points are the solutions of the problems to solve; (iii) the system converges exponentially fast to the solutions; (iv) the equilibrium convergence rate scales at most polynomially with input size. We finally provide arguments that periodic orbits and strange attractors cannot coexist with equilibria. As examples, we show how to solve the prime factorization and the search version of the NP-complete subset-sum problem. Since DMMs map integers into integers, they are robust against noise and hence scalable. We finally discuss the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability.

  15. Predicting Physical Time Series Using Dynamic Ridge Polynomial Neural Networks

    Science.gov (United States)

    Al-Jumeily, Dhiya; Ghazali, Rozaida; Hussain, Abir

    2014-01-01

    Forecasting naturally occurring phenomena is a common problem in many domains of science, and this has been addressed and investigated by many scientists. The importance of time series prediction stems from the fact that it has wide range of applications, including control systems, engineering processes, environmental systems and economics. From the knowledge of some aspects of the previous behaviour of the system, the aim of the prediction process is to determine or predict its future behaviour. In this paper, we consider a novel application of a higher order polynomial neural network architecture called Dynamic Ridge Polynomial Neural Network that combines the properties of higher order and recurrent neural networks for the prediction of physical time series. In this study, four types of signals have been used, which are; The Lorenz attractor, mean value of the AE index, sunspot number, and heat wave temperature. The simulation results showed good improvements in terms of the signal to noise ratio in comparison to a number of higher order and feedforward neural networks in comparison to the benchmarked techniques. PMID:25157950

  16. Predicting physical time series using dynamic ridge polynomial neural networks.

    Directory of Open Access Journals (Sweden)

    Dhiya Al-Jumeily

    Full Text Available Forecasting naturally occurring phenomena is a common problem in many domains of science, and this has been addressed and investigated by many scientists. The importance of time series prediction stems from the fact that it has wide range of applications, including control systems, engineering processes, environmental systems and economics. From the knowledge of some aspects of the previous behaviour of the system, the aim of the prediction process is to determine or predict its future behaviour. In this paper, we consider a novel application of a higher order polynomial neural network architecture called Dynamic Ridge Polynomial Neural Network that combines the properties of higher order and recurrent neural networks for the prediction of physical time series. In this study, four types of signals have been used, which are; The Lorenz attractor, mean value of the AE index, sunspot number, and heat wave temperature. The simulation results showed good improvements in terms of the signal to noise ratio in comparison to a number of higher order and feedforward neural networks in comparison to the benchmarked techniques.

  17. Delta T: Polynomial Approximation of Time Period 1620–2013

    Directory of Open Access Journals (Sweden)

    M. Khalid

    2014-01-01

    Full Text Available The difference between the Uniform Dynamical Time and Universal Time is referred to as ΔT (delta T. Delta T is used in numerous astronomical calculations, that is, eclipses,and length of day. It is additionally required to reduce quantified positions of minor planets to a uniform timescale for the purpose of orbital determination. Since Universal Time is established on the basis of the variable rotation of planet Earth, the quantity ΔT mirrors the unevenness of that rotation, and so it changes slowly, but rather irregularly, as time passes. We have worked on empirical formulae for estimating ΔT and have discovered a set of polynomials of the 4th order with nine intervals which is accurate within the range of ±0.6 seconds for the duration of years 1620–2013.

  18. Local polynomial method for ensemble forecast of time series

    Directory of Open Access Journals (Sweden)

    S. Regonda

    2005-01-01

    Full Text Available We present a nonparametric approach based on local polynomial regression for ensemble forecast of time series. The state space is first reconstructed by embedding the univariate time series of the response variable in a space of dimension (D with a delay time (τ. To obtain a forecast from a given time point t, three steps are involved: (i the current state of the system is mapped on to the state space, known as the feature vector, (ii a small number (K=α*n, α=fraction (0,1] of the data, n=data length of neighbors (and their future evolution to the feature vector are identified in the state space, and (iii a polynomial of order p is fitted to the identified neighbors, which is then used for prediction. A suite of parameter combinations (D, τ, α, p is selected based on an objective criterion, called the Generalized Cross Validation (GCV. All of the selected parameter combinations are then used to issue a T-step iterated forecast starting from the current time t, thus generating an ensemble forecast which can be used to obtain the forecast probability density function (PDF. The ensemble approach improves upon the traditional method of providing a single mean forecast by providing the forecast uncertainty. Further, for short noisy data it can provide better forecasts. We demonstrate the utility of this approach on two synthetic (Henon and Lorenz attractors and two real data sets (Great Salt Lake bi-weekly volume and NINO3 index. This framework can also be used to forecast a vector of response variables based on a vector of predictors.

  19. Recognition of deterministic ETOL languages in logarithmic space

    DEFF Research Database (Denmark)

    Jones, Neil D.; Skyum, Sven

    1977-01-01

    It is shown that if G is a deterministic ETOL system, there is a nondeterministic log space algorithm to determine membership in L(G). Consequently, every deterministic ETOL language is recognizable in polynomial time. As a corollary, all context-free languages of finite index, and all Indian par...

  20. SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

    Institute of Scientific and Technical Information of China (English)

    Liu Lianggui; Feng Guangzeng

    2006-01-01

    Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.

  1. Computing the Tutte Polynomial in Vertex-Exponential Time

    DEFF Research Database (Denmark)

    Björklund, Andreas; Husfeldt, Thore; Kaski, Petteri

    2008-01-01

    The deletion–contraction algorithm is perhapsthe most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating link in knot theory, and the partition functions of the models...

  2. Polynomial-time approximation schemes for scheduling problems with time lags

    NARCIS (Netherlands)

    X. Zhang (Xiandong); S.L. van de Velde (Steef)

    2010-01-01

    textabstractWe identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The

  3. Discrete-time filtering for nonlinear polynomial systems over linear observations

    Science.gov (United States)

    Hernandez-Gonzalez, M.; Basin, M. V.

    2014-07-01

    This paper designs a discrete-time filter for nonlinear polynomial systems driven by additive white Gaussian noises over linear observations. The solution is obtained by computing the time-update and measurement-update equations for the state estimate and the error covariance matrix. A closed form of this filter is obtained by expressing the conditional expectations of polynomial terms as functions of the estimate and the error covariance. As a particular case, a third-degree polynomial is considered to obtain the finite-dimensional filtering equations. Numerical simulations are performed for a third-degree polynomial system and an induction motor model. Performance of the designed filter is compared with the extended Kalman one to verify its effectiveness.

  4. Taylor polynomial solution of difference equation with constant coefficients via time scales calculus

    Directory of Open Access Journals (Sweden)

    Veysel Hatipoglu

    2015-09-01

    Full Text Available In this study, we present a practical matrix method to find an approximate solution of higher order linear difference equation with constant coefficients under the initial-boundary conditions in terms of Taylor polynomials. To obtain this goal, we first present time scale extension of previous polynomial approach, then restrict the formula to the Integers with h step. This method converts the difference equation to a matrix equation, which may be considered as a system of linear algebraic equations.

  5. Controlling influenza disease: Comparison between discrete time Markov chain and deterministic model

    Science.gov (United States)

    Novkaniza, F.; Ivana, Aldila, D.

    2016-04-01

    Mathematical model of respiratory diseases spread with Discrete Time Markov Chain (DTMC) and deterministic approach for constant total population size are analyzed and compared in this article. Intervention of medical treatment and use of medical mask included in to the model as a constant parameter to controlling influenza spreads. Equilibrium points and basic reproductive ratio as the endemic criteria and it level set depend on some variable are given analytically and numerically as a results from deterministic model analysis. Assuming total of human population is constant from deterministic model, number of infected people also analyzed with Discrete Time Markov Chain (DTMC) model. Since Δt → 0, we could assume that total number of infected people might change only from i to i + 1, i - 1, or i. Approximation probability of an outbreak with gambler's ruin problem will be presented. We find that no matter value of basic reproductive ℛ0, either its larger than one or smaller than one, number of infection will always tends to 0 for t → ∞. Some numerical simulation to compare between deterministic and DTMC approach is given to give a better interpretation and a better understanding about the models results.

  6. Online segmentation of time series based on polynomial least-squares approximations.

    Science.gov (United States)

    Fuchs, Erich; Gruber, Thiemo; Nitschke, Jiri; Sick, Bernhard

    2010-12-01

    The paper presents SwiftSeg, a novel technique for online time series segmentation and piecewise polynomial representation. The segmentation approach is based on a least-squares approximation of time series in sliding and/or growing time windows utilizing a basis of orthogonal polynomials. This allows the definition of fast update steps for the approximating polynomial, where the computational effort depends only on the degree of the approximating polynomial and not on the length of the time window. The coefficients of the orthogonal expansion of the approximating polynomial-obtained by means of the update steps-can be interpreted as optimal (in the least-squares sense) estimators for average, slope, curvature, change of curvature, etc., of the signal in the time window considered. These coefficients, as well as the approximation error, may be used in a very intuitive way to define segmentation criteria. The properties of SwiftSeg are evaluated by means of some artificial and real benchmark time series. It is compared to three different offline and online techniques to assess its accuracy and runtime. It is shown that SwiftSeg-which is suitable for many data streaming applications-offers high accuracy at very low computational costs.

  7. An algebraic approach to local observability at an initial state for discrete-time polynomial systems

    NARCIS (Netherlands)

    Kawano, Yu; Ohtsuka, Toshiyuki

    2011-01-01

    In this paper, we consider local observability at an initial state for discrete-time autonomous polynomial systems. When testing for observability, for discrete-time nonlinear systems, a condition based on the inverse function theorem is commonly used. However, it is a sufficient condition. In this

  8. Chaotification of polynomial continuous-time systems and rational normal forms

    Energy Technology Data Exchange (ETDEWEB)

    Starkov, Konstantin E-mail: konst@citedi.mxkonstarkov@hotmail.com; Chen Guanrong E-mail: eegchen@cityu.edu.hk

    2004-11-01

    In this paper we study the chaotification problem of polynomial continuous-time systems in a semiglobal setting. Our results are based on the computation of rational normal forms and time-delay anticontroller design. As examples, the Roessler system, some Sprott systems and the Lorenz system are considered.

  9. A dynamical polynomial chaos approach for long-time evolution of SPDEs

    Science.gov (United States)

    Ozen, H. Cagan; Bal, Guillaume

    2017-08-01

    We propose a Dynamical generalized Polynomial Chaos (DgPC) method to solve time-dependent stochastic partial differential equations (SPDEs) with white noise forcing. The long-time simulation of SPDE solutions by Polynomial Chaos (PC) methods is notoriously difficult as the dimension of the stochastic variables increases linearly with time. Exploiting the Markovian property of white noise, DgPC [1] implements a restart procedure that allows us to expand solutions at future times in terms of orthogonal polynomials of the measure describing the solution at a given time and the future white noise. The dimension of the representation is kept minimal by application of a Karhunen-Loeve (KL) expansion. Using frequent restarts and low degree polynomials on sparse multi-index sets, the method allows us to perform long time simulations, including the calculation of invariant measures for systems which possess one. We apply the method to the numerical simulation of stochastic Burgers and Navier-Stokes equations with white noise forcing. Our method also allows us to incorporate time-independent random coefficients such as a random viscosity. We propose several numerical simulations and show that the algorithm compares favorably with standard Monte Carlo methods.

  10. Algorithms for Testing Monomials in Multivariate Polynomials

    CERN Document Server

    Chen, Zhixiang; Liu, Yang; Schweller, Robert

    2010-01-01

    This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its sum-product expansion. The complexity aspects of this problem and its variants have been investigated in our first paper by Chen and Fu (2010), laying a foundation for further study. In this paper, we present two pairs of algorithms. First, we prove that there is a randomized $O^*(p^k)$ time algorithm for testing $p$-monomials in an $n$-variate polynomial of degree $k$ represented by an arithmetic circuit, while a deterministic $O^*(6.4^k + p^k)$ time algorithm is devised when the circuit is a formula, here $p$ is a given prime number. Second, we present a deterministic $O^*(2^k)$ time algorithm for testing multilinear monomials in $\\Pi_m\\Sigma_2\\Pi_t\\times \\Pi_k\\Pi_3$ polynomials, while a randomized $O^*(1.5^k)$ algorithm is given for these polynomials. The first algorithm extends...

  11. Exponential Time Complexity of the Permanent and the Tutte Polynomial

    DEFF Research Database (Denmark)

    Dell, Holger; Husfeldt, Thore; Marx, Dániel

    2014-01-01

    We show conditional lower bounds for well-studied #P-hard problems: The number of satisfying assignments of a 2-CNF formula with n variables cannot be computed in time exp(o(n)), and the same is true for computing the number of all independent sets in an n-vertex graph. The permanent of an n× n...

  12. Deterministic Time-inconsistent Optimal Control Problems - an Essentially Cooperative Approach

    Institute of Scientific and Technical Information of China (English)

    Jiong-min YONG

    2012-01-01

    A general deterministic time-inconsistent optimal control problem is formulated for ordinary differential equations.To find a time-consistent equilibrium value function and the corresponding time-consistent equilibrium control,a non-cooperative N-person differential game (but essentially cooperative in some sense) is introduced.Under certain conditions,it is proved that the open-loop Nash equilibrium value function of the N-person differential game converges to a time-consistent equilibrium value function of the original problem,which is the value function of a time-consistent optimal control problem.Moreover,it is proved that any optimal control of the time-consistent limit problem is a time-consistent equilibrium control of the original problem.

  13. A polynomial criterion for adaptive stabilizability of discrete-time nonlinear systems

    OpenAIRE

    Li, Chanying; Xie, Liang-Liang; Guo, Lei

    2006-01-01

    In this paper, we will investigate the maximum capability of adaptive feedback in stabilizing a basic class of discrete-time nonlinear systems with both multiple unknown parameters and bounded noises. We will present a complete proof of the polynomial criterion for feedback capability as stated in "Robust stability of discrete-time adaptive nonlinear control" (C. Li, L.-L. Xie. and L. Guo, IFAC World Congress, Prague, July 3-8, 2005), by providing both the necessity and sufficiency analyze...

  14. Ridge Polynomial Neural Network with Error Feedback for Time Series Forecasting.

    Science.gov (United States)

    Waheeb, Waddah; Ghazali, Rozaida; Herawan, Tutut

    2016-01-01

    Time series forecasting has gained much attention due to its many practical applications. Higher-order neural network with recurrent feedback is a powerful technique that has been used successfully for time series forecasting. It maintains fast learning and the ability to learn the dynamics of the time series over time. Network output feedback is the most common recurrent feedback for many recurrent neural network models. However, not much attention has been paid to the use of network error feedback instead of network output feedback. In this study, we propose a novel model, called Ridge Polynomial Neural Network with Error Feedback (RPNN-EF) that incorporates higher order terms, recurrence and error feedback. To evaluate the performance of RPNN-EF, we used four univariate time series with different forecasting horizons, namely star brightness, monthly smoothed sunspot numbers, daily Euro/Dollar exchange rate, and Mackey-Glass time-delay differential equation. We compared the forecasting performance of RPNN-EF with the ordinary Ridge Polynomial Neural Network (RPNN) and the Dynamic Ridge Polynomial Neural Network (DRPNN). Simulation results showed an average 23.34% improvement in Root Mean Square Error (RMSE) with respect to RPNN and an average 10.74% improvement with respect to DRPNN. That means that using network errors during training helps enhance the overall forecasting performance for the network.

  15. The Fixed-Links Model in Combination with the Polynomial Function as a Tool for Investigating Choice Reaction Time Data

    Science.gov (United States)

    Schweizer, Karl

    2006-01-01

    A model with fixed relations between manifest and latent variables is presented for investigating choice reaction time data. The numbers for fixation originate from the polynomial function. Two options are considered: the component-based (1 latent variable for each component of the polynomial function) and composite-based options (1 latent…

  16. Learning Read-constant Polynomials of Constant Degree modulo Composites

    DEFF Research Database (Denmark)

    Chattopadhyay, Arkadev; Gavaldá, Richard; Hansen, Kristoffer Arnsfelt;

    2011-01-01

    Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class \\textACC0ACC0. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class...... is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable...

  17. The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

    CERN Document Server

    Bartal, Yair; Krauthgamer, Robert

    2011-01-01

    The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension. The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality of the space and not on its specific geometry. This result resolves a problem that has been open since the quasi-polynomial time algorithm of Talwar (T-04).

  18. Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity

    CERN Document Server

    Bellare, Mihir

    2012-01-01

    In the wiretap channel setting, one aims to get information-theoretic privacy of communicated data based only on the assumption that the channel from sender to receiver is noisier than the one from sender to adversary. The secrecy capacity is the optimal (highest possible) rate of a secure scheme, and the existence of schemes achieving it has been shown. For thirty years the ultimate and unreached goal has been to achieve this optimal rate with a scheme that is polynomial-time. (This means both encryption and decryption are proven polynomial time algorithms.) This paper finally delivers such a scheme. In fact it does more. Our scheme not only meets the classical notion of security from the wiretap literature, called MIS-R (mutual information security for random messages) but achieves the strictly stronger notion of semantic security, thus delivering more in terms of security without loss of rate.

  19. Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

    DEFF Research Database (Denmark)

    Frederiksen, Søren Kristoffer Stiil; Miltersen, Peter Bro

    2013-01-01

    We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state red...... reduction algorithm for Markov chains using arbitrary precision floating point arithmetic and giving a rigorous error analysis of the algorithm....

  20. Deciding stability under FIFO in the adversarial queuing model in polynomial time

    OpenAIRE

    Blesa Aguilera, Maria Josep

    2005-01-01

    In spite of the importance of the FIFO protocol and the research efforts invested in obtaining results for it, deciding whether a given network is stable under FIFO was still an open question. In this work, we address the general case of this problem and try to characterize the property of stability under FIFO in terms of network topologies. We show that this property is decidable in polynomial time.

  1. Polynomial-time homology for simplicial Eilenberg-MacLane spaces

    CERN Document Server

    Krcal, Marek; Sergeraert, Francis

    2012-01-01

    In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological spaces, under suitable restriction on the spaces. We aim at showing that, if the dimensions of the considered spaces are bounded by a constant, then the computations can be done in polynomial time. In this paper we make a significant technical step towards this goal: we show that the Eilenberg-MacLane space K(Z,1), represented as a simplicial group, can be equipped with polynomial-time homology (this is a polynomial-time version of effective homology considered in previous works of the third author and co-workers). To this end, we construct a suitable discrete vector field, in the sense of Forman's discrete Morse theory, on K(Z,1). The construction is purely combinatorial and it can be understood as a certain procedure for reducing finite sequences of integers, without any re...

  2. Kernel polynomial representation for imaginary-time Green’s functions in continuous-time quantum Monte Carlo impurity solver

    Science.gov (United States)

    Huang, Li

    2016-11-01

    Inspired by the recently proposed Legendre orthogonal polynomial representation for imaginary-time Green’s functions G(τ), we develop an alternate and superior representation for G(τ) and implement it in the hybridization expansion continuous-time quantum Monte Carlo impurity solver. This representation is based on the kernel polynomial method, which introduces some integral kernel functions to filter the numerical fluctuations caused by the explicit truncations of polynomial expansion series and can improve the computational precision significantly. As an illustration of the new representation, we re-examine the imaginary-time Green’s functions of the single-band Hubbard model in the framework of dynamical mean-field theory. The calculated results suggest that with carefully chosen integral kernel functions, whether the system is metallic or insulating, the Gibbs oscillations found in the previous Legendre orthogonal polynomial representation have been vastly suppressed and remarkable corrections to the measured Green’s functions have been obtained. Project supported by the National Natural Science Foundation of China (Grant No. 11504340).

  3. Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time

    CERN Document Server

    Habib, Michel

    2010-01-01

    A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by Nishimura, Ragde, and Thilikos [2002] motivated by the search for underlying phylogenetic trees. We study here an extension of the $k$-leaf power graph recognition problem. This extension is motivated by a new biological question for the evaluation of the latteral gene transfer on a population of viruses. We allow the host graph to slightly differs from a tree and allow some cycles. In fact we study phylogenetic galled networks in which cycles are pairwise vertex disjoint. We show some structural results and propose polynomial algorithms for the cases $k=3$ and $k=4$. As a supplemental result, squares of galled networks can also be recognized in polynomial time.

  4. A Polynomial Time Algorithm for a Special Case of Linear Integer Programming

    CERN Document Server

    Ghasemiesfeh, Golnaz; Tabesh, Yahya

    2011-01-01

    According to the wide use of integer programming in many fields, affords toward finding and solving sub classes of these problems which are solvable in polynomial time seems to be important and useful. Integer linear programming (ILP) problems have the general form: $Min \\{C^{T}x: Ax=b, x\\geq 0, x\\in Z^{n}\\}$ where $Z^{n}$ is the set of n-dimensional integer vectors. Algorithmic solution of ILP is at great interest, in this paper we have presented a polynomial algorithm for a special case of the ILP problems; we have used a graph theoretical formulation of the problem which leads to an $O[mn(m+n)]$ solution where $m$ and $n$ are dimensions of coefficient matrix $X$.

  5. Coefficient of retardation time found out by polynomial fitting to predict creep behaviour of polystyrene

    Institute of Scientific and Technical Information of China (English)

    XIE Gang

    2005-01-01

    The universal creep function is successful in relating the creep (ε) to the ageing time (ta ), coefficient of retardation time (β), and intrinsic time (t0). The relation was used to treat the creep experimental data for polystyrene (PS) specimens at a given aged time and different stress levels. Comparing with "middle-point"method reported in the literatures,β is found out by another method "polynomial fitting" in this work. Then unified master lines were constructed with the treated data and curves according to the universal equation. The master lines can be used to predict the long-term creep behaviour and lifetime by extrapolating to a required ultimate strain.

  6. Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    As far as we know, the testing problem of legal firing sequence is NP-complete for general Petri net, the related results of this problem on the polynomial-time solvability are limited only to some special net classes, such as persistent Petri nets, conflict-free Petri nets and state machine Petri nets. In this paper, the language properties of synchronous composition net are discussed. Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed. Therefore, net classification of polynomial-time solvability for testing legal firing sequence is extended.

  7. Deterministic Identity Testing of Read-Once Algebraic Branching Programs

    CERN Document Server

    Jansen, Maurice; Sarma, Jayalal

    2009-01-01

    In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\\Sigma_k$-RO-formulas). We show that $\\Sigma_k$-RO-ABPs are strictly more powerful than $\\Sigma_k$-RO-formulas, for any $k \\leq \\lfloor n/2\\rfloor$, where $n$ is the number of variables. We obtain the following results: 1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. 2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\\log n)} + n^{O(k)}$. 3) Finally, given only black-box access to the polyn...

  8. Deterministic Graphical Games Revisited

    DEFF Research Database (Denmark)

    Andersson, Daniel; Hansen, Kristoffer Arnsfelt; Miltersen, Peter Bro

    2008-01-01

    We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical...... games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of such a game. The existence of a linear time comparison-based algorithm remains an open problem....

  9. Nonlinear time series analysis of nodulation factor induced calcium oscillations: evidence for deterministic chaos?

    Directory of Open Access Journals (Sweden)

    Saul Hazledine

    Full Text Available Legume plants form beneficial symbiotic interactions with nitrogen fixing bacteria (called rhizobia, with the rhizobia being accommodated in unique structures on the roots of the host plant. The legume/rhizobial symbiosis is responsible for a significant proportion of the global biologically available nitrogen. The initiation of this symbiosis is governed by a characteristic calcium oscillation within the plant root hair cells and this signal is activated by the rhizobia. Recent analyses on calcium time series data have suggested that stochastic effects have a large role to play in defining the nature of the oscillations. The use of multiple nonlinear time series techniques, however, suggests an alternative interpretation, namely deterministic chaos. We provide an extensive, nonlinear time series analysis on the nature of this calcium oscillation response. We build up evidence through a series of techniques that test for determinism, quantify linear and nonlinear components, and measure the local divergence of the system. Chaos is common in nature and it seems plausible that properties of chaotic dynamics might be exploited by biological systems to control processes within the cell. Systems possessing chaotic control mechanisms are more robust in the sense that the enhanced flexibility allows more rapid response to environmental changes with less energetic costs. The desired behaviour could be most efficiently targeted in this manner, supporting some intriguing speculations about nonlinear mechanisms in biological signaling.

  10. Real-time curvature defect detection on outer surfaces using best-fit polynomial interpolation.

    Science.gov (United States)

    Golkar, Ehsan; Prabuwono, Anton Satria; Patel, Ahmed

    2012-11-02

    This paper presents a novel, real-time defect detection system, based on a best-fit polynomial interpolation, that inspects the conditions of outer surfaces. The defect detection system is an enhanced feature extraction method that employs this technique to inspect the flatness, waviness, blob, and curvature faults of these surfaces. The proposed method has been performed, tested, and validated on numerous pipes and ceramic tiles. The results illustrate that the physical defects such as abnormal, popped-up blobs are recognized completely, and that flames, waviness, and curvature faults are detected simultaneously.

  11. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

    CERN Document Server

    Das, Aparna

    2008-01-01

    In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, and wish to find a minimum length collection of tours, each starting from the depot and visiting at most k customers, whose union covers all the customers. We give a quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric.

  12. Roughly Polynomial Time: A Concept of Tractability Covering All Known Natural NP-complete Problems

    OpenAIRE

    Farago, Andras

    2016-01-01

    We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all known natural NP-complete problems. We call our concept Roughly Polynomial Time (RoughP). A language $L,$ over an at least 2-symbol alphabet, is in RoughP, if the following hold: (1) there exists a bijective encoding $\\alpha$ of strings, such that both $\\al...

  13. Deterministic decomposition and seasonal ARIMA time series models applied to airport noise forecasting

    Science.gov (United States)

    Guarnaccia, Claudio; Quartieri, Joseph; Tepedino, Carmine

    2017-06-01

    One of the most hazardous physical polluting agents, considering their effects on human health, is acoustical noise. Airports are a strong source of acoustical noise, due to the airplanes turbines, to the aero-dynamical noise of transits, to the acceleration or the breaking during the take-off and landing phases of aircrafts, to the road traffic around the airport, etc.. The monitoring and the prediction of the acoustical level emitted by airports can be very useful to assess the impact on human health and activities. In the airports noise scenario, thanks to flights scheduling, the predominant sources may have a periodic behaviour. Thus, a Time Series Analysis approach can be adopted, considering that a general trend and a seasonal behaviour can be highlighted and used to build a predictive model. In this paper, two different approaches are adopted, thus two predictive models are constructed and tested. The first model is based on deterministic decomposition and is built composing the trend, that is the long term behaviour, the seasonality, that is the periodic component, and the random variations. The second model is based on seasonal autoregressive moving average, and it belongs to the stochastic class of models. The two different models are fitted on an acoustical level dataset collected close to the Nice (France) international airport. Results will be encouraging and will show good prediction performances of both the adopted strategies. A residual analysis is performed, in order to quantify the forecasting error features.

  14. A growth curve model with fractional polynomials for analysing incomplete time-course data in microarray gene expression studies

    DEFF Research Database (Denmark)

    Tan, Qihua; Thomassen, Mads; Hjelmborg, Jacob V B

    2011-01-01

    among fractional polynomial models with power terms from a set of fixed values that offer a wide range of curve shapes and suggests a best fitting model. After a limited simulation study, the model has been applied to our human in vivo irritated epidermis data with missing observations to investigate......-course pattern in a gene by gene manner. We introduce a growth curve model with fractional polynomials to automatically capture the various time-dependent expression patterns and meanwhile efficiently handle missing values due to incomplete observations. For each gene, our procedure compares the performances...... time-dependent transcriptional responses to a chemical irritant. Our method was able to identify the various nonlinear time-course expression trajectories. The integration of growth curves with fractional polynomials provides a flexible way to model different time-course patterns together with model...

  15. An approximation polynomial-time algorithm for a sequence bi-clustering problem

    Science.gov (United States)

    Kel'manov, A. V.; Khamidullin, S. A.

    2015-06-01

    We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum of the squared distances from the elements of the clusters to the centers of the clusters. The center of one of the clusters is to be optimized and is determined as the mean value over all vectors in this cluster. The center of the other cluster is fixed at the origin. Moreover, the partition is such that the difference between the indices of two successive vectors in the first cluster is bounded above and below by prescribed constants. A 2-approximation polynomial-time algorithm is proposed for this problem.

  16. Real-time flight altitude estimation using phase correlation with Gram polynomial decimation

    Science.gov (United States)

    Choudhry, Aadil Jaleel; Badshah, Amir; Amin, Saadullah

    2017-03-01

    The paper presents a passive technique for real-time altitude above ground level estimation for aerial vehicles using a monocular camera, a GPS receiver and an inertial measurement unit. The paper discusses a robust method for featureless registration of successive images through phase correlation using Gram polynomial decimation. Altitude is estimated by formulating the shift in pixels between the images in terms of distance travelled, calculated using corresponding GPS latitudes and longitudes. Resultant value is compensated for changes in pitch before being passed through Savitzky-Golay filter. The system can generate results every 300ms on a lowcost commercial digital signal processor with mean error of 2m and standard deviation of 13m. The proposed system is suitable for speeds up to 300m/s and altitudes up to 3000m.

  17. Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks

    Directory of Open Access Journals (Sweden)

    Koichi Kobayashi

    2010-01-01

    Full Text Available In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.

  18. A polynomial-time algorithm for reducing the number of variables in MAX SAT problem

    Institute of Scientific and Technical Information of China (English)

    马绍汉; 梁东敏

    1997-01-01

    Maximum satisfiability (MAX SAT) problem is an optimization version of the satisfiability (SAT) problem. This problem arises in certain applications in expert systems and knowledge base revision. MAX SAT problem is NP-hard Some algorithms can solve this problem, but they are not adapted to the special cases where the number of variables is larger than the number of clauses. Usually, the number of variables has great impact on the efficiency of these algorithms. Thus, a polynomial-time algorithm is proposed to reduce the number of variables. Let T be any instance of the MAX SAT problem. The algorithm transforms T into another instance P of which the number of variables is smaller than the number of clauses of T. Using other algorithms, the optimal solution to P can be found, and it can be used to construct the optimal solution of T. Therefore, this algorithm is an efficient preprocessing step.

  19. Time-Dependent Reliability-Based Design Optimization Utilizing Nonintrusive Polynomial Chaos

    Directory of Open Access Journals (Sweden)

    Yao Wang

    2013-01-01

    Full Text Available Time-dependent reliability-based design optimization (RBDO has been acknowledged as an advance optimization methodology since it accounts for time-varying stochastic nature of systems. This paper proposes a time-dependent RBDO method considering both of the time-dependent kinematic reliability and the time-dependent structural reliability as constrains. Polynomial chaos combined with the moving least squares (PCMLS is presented as a nonintrusive time-dependent surrogate model to conduct uncertainty quantification. Wear is considered to be a critical failure that deteriorates the kinematic reliability and the structural reliability through the changing kinematics. According to Archard’s wear law, a multidiscipline reliability model including the kinematics model and the structural finite element (FE model is constructed to generate the stochastic processes of system responses. These disciplines are closely coupled and uncertainty impacts are cross-propagated to account for the correlationship between the wear process and loads. The new method is applied to an airborne retractable mechanism. The optimization goal is to minimize the mean and the variance of the total weight under both of the time-dependent and the time-independent reliability constraints.

  20. Improved polynomial remainder sequences for Ore polynomials.

    Science.gov (United States)

    Jaroschek, Maximilian

    2013-11-01

    Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders. Different ways have been studied to make these as small as possible. The subresultant sequence of two polynomials is a polynomial remainder sequence in which the size of the coefficients is optimal in the generic case, but when taking the input from applications, the coefficients are often larger than necessary. We generalize two improvements of the subresultant sequence to Ore polynomials and derive a new bound for the minimal coefficient size. Our approach also yields a new proof for the results in the commutative case, providing a new point of view on the origin of the extraneous factors of the coefficients.

  1. Polynomial-time quantum algorithm for the simulation of chemical dynamics.

    Science.gov (United States)

    Kassal, Ivan; Jordan, Stephen P; Love, Peter J; Mohseni, Masoud; Aspuru-Guzik, Alán

    2008-12-02

    The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can be applied only to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and interelectronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born-Oppenheimer approximation but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wave function is propagated on a grid with appropriately short time steps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with 100 qubits.

  2. A polynomial time primal network simplex algorithm for minimum cost flows

    Energy Technology Data Exchange (ETDEWEB)

    Orlin, J.B. [MIT, Cambridge, MA (United States)

    1996-12-31

    In this extended abstract, we develop a polynomial time primal network simplex algorithm that runs in O(min(n{sup 2}m log nC, n{sup 2}m{sup 2} log n)) time, where n is the number of nodes in the network, in is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and {infinity} otherwise. We first introduce a pseudopolynomial variant of the network simplex algorithm called the {open_quotes}premultiplier algorithm.{close_quotes} A vector {pi} of node potentials is called a vector of premultipliers with respect to a rooted tree if each arc directed towards the root has a non-positive reduced cost and each arc directed away from the root has a non-negative reduced cost. We then develop a cost-scaling version of the premultiplier algorithm that solves the minimum cost flow problem in O(min(nm log nC, nm{sup 2} log n)) pivots. With certain simple data structures, the average time per pivot can be shown to be O(n).

  3. Decomposition of Polynomials

    CERN Document Server

    Blankertz, Raoul

    2011-01-01

    This diploma thesis is concerned with functional decomposition $f = g \\circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen, Giesbrecht & Ziegler (2010) is given, which states a classification for a special class of decomposable polynomials.

  4. Trading GRH for algebra: algorithms for factoring polynomials and related structures

    CERN Document Server

    Ivanyos, Gábor; Rónyai, Lajos; Saxena, Nitin

    2008-01-01

    In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a polynomial f(x) of degree n over a finite field k, we can find in deterministic poly(n^{\\log n},\\log |k|) time "either" a nontrivial factor of f(x) "or" a nontrivial automorphism of k[x]/(f(x)) of order n. This main tool leads to various new GRH-free results, most striking of which are: (1) Given a noncommutative algebra over a finite field, we can find a zero divisor in deterministic subexponential time. (2) Given a positive integer r>4 such that either 4|r or r has two distinct prime factors. There is a deterministic polynomial time algorithm to find a nontrivial factor of the r-th cyclotomic polynomial over a finite field. In this paper, following the seminal work of Lenstra (1991) on constructing isomorphisms between finite fields, we further generalize classical Galois...

  5. Orthogonal polynomials

    CERN Document Server

    Freud, Géza

    1971-01-01

    Orthogonal Polynomials contains an up-to-date survey of the general theory of orthogonal polynomials. It deals with the problem of polynomials and reveals that the sequence of these polynomials forms an orthogonal system with respect to a non-negative m-distribution defined on the real numerical axis. Comprised of five chapters, the book begins with the fundamental properties of orthogonal polynomials. After discussing the momentum problem, it then explains the quadrature procedure, the convergence theory, and G. Szegő's theory. This book is useful for those who intend to use it as referenc

  6. Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy

    Science.gov (United States)

    Takeuchi, Yuki; Takahashi, Yasuhiro

    2016-12-01

    Instantaneous quantum polynomial time (IQP) is a model of (probably) nonuniversal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the l1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy. Although IQP circuits can be realized more easily than a universal quantum computer, demonstrating quantum supremacy is still difficult. It is therefore desired to find subclasses of IQP that are easy to implement. In this paper, by imposing some restrictions on IQP, we propose ancilla-driven IQP (ADIQP) as the subclass of commuting quantum computation suitable for many experimental settings. We show that even though ADIQP circuits are strictly weaker than IQP circuits in a sense, they are also hard to simulate classically up to a multiplicative error and an error in the l1 norm. Moreover, the properties of ADIQP make it easy to investigate the verifiability of ADIQP circuits and the difficulties in realizing ADIQP circuits.

  7. A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane

    Directory of Open Access Journals (Sweden)

    Yasser M. Abd El-Latif

    2012-12-01

    Full Text Available — In the approximate Euclidean min-weighted perfect matching problem, a set V of 2n points in the plane and a real number   0 are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most (1  times the optimal solution.In this paper, the authors give a randomized algorithm which follows a Monte-Carlo method. This algorithm is a randomized fully polynomial-time approximation scheme for the given problem. Fortunately, the suggested algorithm is a one tackled the matching problem in both Euclidean nonbipartite and bipartite cases.The presented algorithm outlines as follows: With repeating 1/  times, we choose a point from V to build the suitable pair satisfying the suggested condition on the distance. If this condition is achieved, then remove the points of the constructed pair from V and put this pair in M (the output set of the solution. Then, choose a point and the nearest point of it from the remaining points in V to construct a pair and put it inM . Remove the two points of the constructed pair from V and repeat this process until V becomes an empty set. Obviously, this method is very simple. Furthermore, our algorithm can be applied without any modification on complete weighted graphs K mand complete weighted bipartite graphs Kn,n, where n,m 1and m is an even.

  8. Control Synthesis of Discrete-Time T-S Fuzzy Systems via a Multi-Instant Homogenous Polynomial Approach.

    Science.gov (United States)

    Xie, Xiangpeng; Yue, Dong; Zhang, Huaguang; Xue, Yusheng

    2016-03-01

    This paper deals with the problem of control synthesis of discrete-time Takagi-Sugeno fuzzy systems by employing a novel multiinstant homogenous polynomial approach. A new multiinstant fuzzy control scheme and a new class of fuzzy Lyapunov functions, which are homogenous polynomially parameter-dependent on both the current-time normalized fuzzy weighting functions and the past-time normalized fuzzy weighting functions, are proposed for implementing the object of relaxed control synthesis. Then, relaxed stabilization conditions are derived with less conservatism than existing ones. Furthermore, the relaxation quality of obtained stabilization conditions is further ameliorated by developing an efficient slack variable approach, which presents a multipolynomial dependence on the normalized fuzzy weighting functions at the current and past instants of time. Two simulation examples are given to demonstrate the effectiveness and benefits of the results developed in this paper.

  9. On the deterministic and stochastic solutions of Space Charge models and their impact on high resolution timing

    Energy Technology Data Exchange (ETDEWEB)

    Mangiarotti, A. [Physikalisches Insitut, Universitaet Heidelberg, Philosophenweg 12, D-69120 Heidelberg (Germany)]. E-mail: a.mangiarotti@gsi.de; Bueno, C.C. [Instituto de Pesquisas Energeticas e Nucleares, 05508-900 Sao Paulo (Brazil); Departamento de Fisica, Pontificia Universidade Catolica de Sao Paulo, 01303-050 Sao Paulo (Brazil); Fonte, P. [Laboratorio de Instrumentacao e Fisica Experimental de Particulas, 3004-516 Coimbra (Portugal); Instituto Superior de Engenharia de Coimbra, Rua Pedro Nunes, 3030-199 Coimbra (Portugal); Gobbi, A. [Gesellschaft fuer Schwerionenforschung, Planckstr. 1, D-64291 Darmstadt (Germany); Gonzalez-Diaz, D. [LabCaf, Dep. de Fisica de Particulas, Universidade de Santiago de Compostela, 15782 Spain (Spain); Lopes, L. [Laboratorio de Instrumentacao e Fisica Experimental de Particulas, 3004-516 Coimbra (Portugal)

    2006-08-15

    RPCs offer unique opportunities to investigate basic processes in gaseous electronics. The growth of a single avalanche can be studied in a regime where it reacts to its own field. This induces a saturation in its development, often described in a deterministic scenario by a nonlinear model. Once reinterpreted in a fully stochastic framework, the same feature corresponds to a negative feedback mechanism, which regulates the avalanche development and preserves its timing properties. Fluctuations are hence mostly produced in the initial phase of the growth. A clear evidence of the action of this stabilizing scheme is observed in data collected for single avalanches of fixed length.

  10. A Growth Curve Model with Fractional Polynomials for Analysing Incomplete Time-Course Data in Microarray Gene Expression Studies

    Directory of Open Access Journals (Sweden)

    Qihua Tan

    2011-01-01

    Full Text Available Identifying the various gene expression response patterns is a challenging issue in expression microarray time-course experiments. Due to heterogeneity in the regulatory reaction among thousands of genes tested, it is impossible to manually characterize a parametric form for each of the time-course pattern in a gene by gene manner. We introduce a growth curve model with fractional polynomials to automatically capture the various time-dependent expression patterns and meanwhile efficiently handle missing values due to incomplete observations. For each gene, our procedure compares the performances among fractional polynomial models with power terms from a set of fixed values that offer a wide range of curve shapes and suggests a best fitting model. After a limited simulation study, the model has been applied to our human in vivo irritated epidermis data with missing observations to investigate time-dependent transcriptional responses to a chemical irritant. Our method was able to identify the various nonlinear time-course expression trajectories. The integration of growth curves with fractional polynomials provides a flexible way to model different time-course patterns together with model selection and significant gene identification strategies that can be applied in microarray-based time-course gene expression experiments with missing observations.

  11. Chebyshev polynomials

    CERN Document Server

    Mason, JC

    2002-01-01

    Chebyshev polynomials crop up in virtually every area of numerical analysis, and they hold particular importance in recent advances in subjects such as orthogonal polynomials, polynomial approximation, numerical integration, and spectral methods. Yet no book dedicated to Chebyshev polynomials has been published since 1990, and even that work focused primarily on the theoretical aspects. A broad, up-to-date treatment is long overdue.Providing highly readable exposition on the subject''s state of the art, Chebyshev Polynomials is just such a treatment. It includes rigorous yet down-to-earth coverage of the theory along with an in-depth look at the properties of all four kinds of Chebyshev polynomials-properties that lead to a range of results in areas such as approximation, series expansions, interpolation, quadrature, and integral equations. Problems in each chapter, ranging in difficulty from elementary to quite advanced, reinforce the concepts and methods presented.Far from being an esoteric subject, Chebysh...

  12. Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties

    Science.gov (United States)

    2013-04-03

    deterministic. The proof extends the one in Puterman [14], Theorem 6.2.10. We need to prove that Problem (4) always attains the maximum (minimum) over the...Estimation. Springer-Verlag, New York, 1998. 14. M. Puterman , Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons

  13. Expansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind

    Directory of Open Access Journals (Sweden)

    Mahmoud Paripour

    2014-08-01

    Full Text Available In this paper, the Bernstein polynomials are used to approximatethe solutions of linear integral equations with multiple time lags (IEMTL through expansion methods (collocation method, partition method, Galerkin method. The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is carried out

  14. Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

    Directory of Open Access Journals (Sweden)

    Kuo-Ching Ying

    2017-01-01

    Full Text Available This work addresses four single-machine scheduling problems (SMSPs with learning effects and variable maintenance activity. The processing times of the jobs are simultaneously determined by a decreasing function of their corresponding scheduled positions and the sum of the processing times of the already processed jobs. Maintenance activity must start before a deadline and its duration increases with the starting time of the maintenance activity. This work proposes a polynomial-time algorithm for optimally solving two SMSPs to minimize the total completion time and the total tardiness with a common due date.

  15. Polynomial Asymptotes

    Science.gov (United States)

    Dobbs, David E.

    2010-01-01

    This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of…

  16. Rational polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Blackett, S.A. [Univ. of Auckland (New Zealand). Dept of Engineering Science

    1996-02-01

    Numerical analysis is an important part of Engineering. Frequently relationships are not adequately understood, or too complicated to be represented by theoretical formulae. Instead, empirical approximations based on observed relationships can be used for simple fast and accurate evaluations. Historically, storage of data has been a large constraint on approximately methods. So the challenge is to find a sufficiently accurate representation of data which is valid over as large a range as possible while requiring the storage of only a few numerical values. Polynomials, popular as approximation functions because of their simplicity, can be used to represent simple data. Equation 1.1 shows a simple 3rd order polynomial approximation. However, just increasing the order and number of terms included in a polynomial approximation does not improve the overall result. Although the function may fit exactly to observed data, between these points it is likely that the approximation is increasingly less smooth and probably inadequate. An alternative to adding further terms to the approximation is to make the approximation rational. Equation 1.2 shows a rational polynomial, 3rd order in the numerator and denominator. A rational polynomial approximation allows poles and this can greatly enhance an approximation. In Sections 2 and 3 two different methods for fitting rational polynomials to a given data set are detailed. In Section 4, consideration is given to different rational polynomials used on adjacent regions. Section 5 shows the performance of the rational polynomial algorithms. Conclusions are presented in Section 6.

  17. A Comprehensive Software System for Interactive, Real-time, Visual 3D Deterministic and Stochastic Groundwater Modeling

    Science.gov (United States)

    Li, S.

    2002-05-01

    Taking advantage of the recent developments in groundwater modeling research and computer, image and graphics processing, and objected oriented programming technologies, Dr. Li and his research group have recently developed a comprehensive software system for unified deterministic and stochastic groundwater modeling. Characterized by a new real-time modeling paradigm and improved computational algorithms, the software simulates 3D unsteady flow and reactive transport in general groundwater formations subject to both systematic and "randomly" varying stresses and geological and chemical heterogeneity. The software system has following distinct features and capabilities: Interactive simulation and real time visualization and animation of flow in response to deterministic as well as stochastic stresses. Interactive, visual, and real time particle tracking, random walk, and reactive plume modeling in both systematically and randomly fluctuating flow. Interactive statistical inference, scattered data interpolation, regression, and ordinary and universal Kriging, conditional and unconditional simulation. Real-time, visual and parallel conditional flow and transport simulations. Interactive water and contaminant mass balance analysis and visual and real-time flux update. Interactive, visual, and real time monitoring of head and flux hydrographs and concentration breakthroughs. Real-time modeling and visualization of aquifer transition from confined to unconfined to partially de-saturated or completely dry and rewetting Simultaneous and embedded subscale models, automatic and real-time regional to local data extraction; Multiple subscale flow and transport models Real-time modeling of steady and transient vertical flow patterns on multiple arbitrarily-shaped cross-sections and simultaneous visualization of aquifer stratigraphy, properties, hydrological features (rivers, lakes, wetlands, wells, drains, surface seeps), and dynamically adjusted surface flooding area

  18. Deterministic Secure Quantum Communication and Authentication Protocol based on Extended GHZ-W State and Quantum One-time Pad

    Science.gov (United States)

    Li, Na; Li, Jian; Li, Lei-Lei; Wang, Zheng; Wang, Tao

    2016-08-01

    A deterministic secure quantum communication and authentication protocol based on extended GHZ-W state and quantum one-time pad is proposed. In the protocol, state | φ -> is used as the carrier. One photon of | φ -> state is sent to Alice, and Alice obtains a random key by measuring photons with bases determined by ID. The information of bases is secret to others except Alice and Bob. Extended GHZ-W states are used as decoy photons, the positions of which in information sequence are encoded with identity string ID of the legal user, and the eavesdropping detection rate reaches 81%. The eavesdropping detection based on extended GHZ-W state combines with authentication and the secret ID ensures the security of the protocol.

  19. Polynomial mappings

    CERN Document Server

    Narkiewicz, Wŀadysŀaw

    1995-01-01

    The book deals with certain algebraic and arithmetical questions concerning polynomial mappings in one or several variables. Algebraic properties of the ring Int(R) of polynomials mapping a given ring R into itself are presented in the first part, starting with classical results of Polya, Ostrowski and Skolem. The second part deals with fully invariant sets of polynomial mappings F in one or several variables, i.e. sets X satisfying F(X)=X . This includes in particular a study of cyclic points of such mappings in the case of rings of algebrai integers. The text contains several exercises and a list of open problems.

  20. Abelian avalanches and Tutte polynomials

    Science.gov (United States)

    Gabrielov, Andrei

    1993-04-01

    We introduce a class of deterministic lattice models of failure, Abelian avalanche (AA) models, with continuous phase variables, similar to discrete Abelian sandpile (ASP) models. We investigate analytically the structure of the phase space and statistical properties of avalanches in these models. We show that the distributions of avalanches in AA and ASP models with the same redistribution matrix and loading rate are identical. For an AA model on a graph, statistics of avalanches is linked to Tutte polynomials associated with this graph and its subgraphs. In the general case, statistics of avalanches is linked to an analog of a Tutte polynomial defined for any symmetric matrix.

  1. A finite time-horizon deterministic EOQ model with stock-dependent demand, effects of inflation and time value of money with shortages in all cycles

    Directory of Open Access Journals (Sweden)

    Roy T.

    2007-01-01

    Full Text Available A finite time-horizon deterministic inventory model is developed, taking the demand rate at any instant to be a function of the on-hand inventory (stock-level at that instant. Shortages in inventory are allowed. The effects of inflation and time value of money are considered. Two separate inflation rates: namely, the internal (company and the external (general economy are introduced. A numerical example of the model is discussed. A sensitivity analysis of the optimal solution with respect to the parameters of the model is examined.

  2. Spurious deterministic seasonality

    NARCIS (Netherlands)

    Ph.H.B.F. Franses (Philip Hans); S. Hylleberg; H.S. Lee (Hahn)

    1995-01-01

    textabstractIt is sometimes assumed that the R2 of a regression of a first-order differenced time series on seasonal dummy variables reflects the amount of seasonal fluctuations that can be explained by deterministic variation in the series. In this paper we show that neglecting the presence of seas

  3. An Adaptive Channel Estimation Algorithm Using Time-Frequency Polynomial Model for OFDM with Fading Multipath Channels

    Directory of Open Access Journals (Sweden)

    Liu KJ Ray

    2002-01-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM is an effective technique for the future 3G communications because of its great immunity to impulse noise and intersymbol interference. The channel estimation is a crucial aspect in the design of OFDM systems. In this work, we propose a channel estimation algorithm based on a time-frequency polynomial model of the fading multipath channels. The algorithm exploits the correlation of the channel responses in both time and frequency domains and hence reduce more noise than the methods using only time or frequency polynomial model. The estimator is also more robust compared to the existing methods based on Fourier transform. The simulation shows that it has more than improvement in terms of mean-squared estimation error under some practical channel conditions. The algorithm needs little prior knowledge about the delay and fading properties of the channel. The algorithm can be implemented recursively and can adjust itself to follow the variation of the channel statistics.

  4. Deterministic inventory model for items with Time varying demand, weibull distribution deterioration and shortages

    Directory of Open Access Journals (Sweden)

    Wu Kun-Shan

    2002-01-01

    Full Text Available In this paper, an EOQ inventory model is depleted not only by time varying demand but also by Weibull distribution deterioration, in which the inventory is permitted to start with shortages and end without shortages. A theory is developed to obtain the optimal solution of the problem; it is then illustrated with the aid of several numerical examples. Moreover, we also assume that the holding cost is a continuous, non-negative and non-decreasing function of time in order to extend the EOQ model. Finally, sensitivity of the optimal solution to changes in the values of different system parameters is also studied.

  5. Energy-Efficient Deterministic Fault-Tolerant Scheduling for Embedded Real-Time Systems

    Institute of Scientific and Technical Information of China (English)

    LI Guo-hui; HU Fang-xiao; DU Xiao-kun; TANG Xiang-hong

    2009-01-01

    By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The schedulability of the system was analyzed through checkpointing and the energy saving was considered via dynamic voltage and frequency scaling. Simulation results showed that the proposed algorithm had better performance compared with the existing voltage allocation techniques. The proposed technique saves 51.5% energy over FT-Only and 19.9% over FT+EC on average. Therefore, the proposed method was more appropriate for aperiodic tasks in embedded real-time systems.

  6. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

    NARCIS (Netherlands)

    Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper

    2015-01-01

    It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in time 2O(tw)|V|O(1) for graphs G=(V,E) with a given tree decomposition of width tw. However, for nonlocal problems, like the fundamental class of connectivity problems, for a

  7. A deterministic approach to define the useful integration time for in-situ precipitation observations

    Science.gov (United States)

    Djallel Dilmi, Mohamed; Mallet, Cécile; Barthes, Laurent; Chazottes, Aymeric

    2017-04-01

    The Precipitations are due to complex meteorological phenomenon and can be described as intermittent process. Theirs spatial and temporal variability is significant and covers large scales. These precipitation properties induce a very strong constraint on the measurement, which must be as continuous as possible, both in time and in space. . In particular, studies of climate change need high-resolution rainfall with resolutions much higher than 1 hour to obtain statistics of extrem rainfall and wet and dry spell duration. For all these reasons, several instruments were used for the observation of precipitations, of which the tipping bucket rain gauge is the oldest and the most commonly used for the precipitations in-situ measurements. Each specific device properties can induces systematical occurring errors that can lead to statistical biases. For example, for low precipitation, the tipping bucket rain gauge, records false dry periods. So, during the past few years, other instruments more accurate than the tipping bucket rain gauge (eg disdrometer and weighting rain gauge) were placed for in-situ observation but their costs hinder the installation of large networks The present study focuses on the impact of the rain gauge volume. The aim is to define a minimal integration time according to the bucket volume for a given climatic region Our study focuses on Ile-de-France, this French region is a relatively dry region if we consider the annual amount of precipitation: 600 mm, a rainy region if we consider the number of days of precipitation per year: 160 days. It records Strong storm events sometimes but its precipitations are dominated by low rainfall. Eight year time series observed with a disdrometer and different rain gauges located on the French Atmospheric Research Observatory (SIRTA) , are used. Simulated tipping bucket rain gauge series for different tipping bucket volumes and weighting rain gauge series for different weights as precision are performed. The

  8. Finite time extinction of super-Brownian motions with deterministic catalyst

    Institute of Scientific and Technical Information of China (English)

    REN; Yanxia(任艳霞); WANG; Yongjin(王永进)

    2003-01-01

    In this paper we consider a super-Brownian motion X with branching mechanism k(x)za, where k(x) > 0 is a bounded Holder continuous function on Rd and infx∈Rd k(x) = 0. We prove that if k(x) ≥‖x‖-1(0 ≤ l <∞) for sufficiently large x, then X has compact support property, and for dimension d = 1, if k(x) ≥ exp(-l‖x‖)(0 ≤ l <∞) for sufficiently large x, then X also has compact support property. The maximal order of k(x) for finite time extinction is different between d = 1, d = 2 and d ≥3: it is O(‖x‖-(a+1))in one dimension, O(‖x‖-2(log ‖x‖)-(a+1)) in two dimensions, and O(‖x‖2) in higher dimensions. These growth orders also turn out to be the maximum order for the nonexistence of a positive solution for 1/2△u =k(x)uα.

  9. Deterministic and stochastic dynamics of Rayleigh-Taylor mixing with a power-law time-dependent acceleration

    Science.gov (United States)

    Pandian, Arun; Swisher, Nora C.; Abarzhi, S. I.

    2017-01-01

    Rayleigh-Taylor (RT) mixing occurs in a variety of natural and man-made phenomena in fluids, plasmas and materials, from celestial event to atoms. In many circumstances, RT flows are driven by variable acceleration, whereas majority of existing studies have considered only sustained acceleration. In this work we perform detailed analytical and numerical study of RT mixing with a power-law time-dependent acceleration. A set of deterministic nonlinear non-homogeneous ordinary differential equations and nonlinear stochastic differential equations with multiplicative noise are derived on the basis of momentum model. For a broad range of parameters, self-similar asymptotic solutions are found analytically, and their statistical properties are studied numerically. We identify two sub-regimes of RT mixing dynamics depending on the acceleration exponent—the acceleration-driven mixing and dissipation-driven mixing. Transition between the sub-regimes is studied, and it is found that each sub-regime has its own characteristic dimensionless invariant quantity.

  10. POLYNOMIAL FUNCTIONS

    Institute of Scientific and Technical Information of China (English)

    王雷

    2008-01-01

    <正>Polynomial functions are among the sim- plest expressions in algebra.They are easy to evaluate:only addition and repeated multipli- cation are required.Because of this,they are often used to approximate other more compli-

  11. On the Complexity of the Interlace Polynomial

    CERN Document Server

    Bläser, Markus

    2007-01-01

    We consider the two-variable interlace polynomial introduced by Arratia, Bollob\\'as and Sorkin. For this graph polynomial we derive two graph transformations yielding point-to-point reductions similar to the thickening transformation in the context of the Tutte polynomial. This enables us to prove that the two-variable interlace polynomial is #P-hard to evaluate at every algebraic point of R^2, except at one line, where it is trivially polynomial time computable, and four lines and two points, where the complexity is still open. As a consequence, three specializations of the two-variable interlace polynomial, the vertex-nullity interlace polynomial, the vertex-rank interlace polynomial and the independent set polynomial, are #P-hard to evaluate almost everywhere, too. For the independent set polynomial, our graph transformations allow us to prove that it is even hard to approximate at every algebraic point except at -1 and 0.

  12. Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function

    Institute of Scientific and Technical Information of China (English)

    JIN Zheng-jing; BAI Yan-qin

    2009-01-01

    The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations,which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems.The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm.In this paper,it is proved that the finite barrier function is a local self-concordant barrier function.By deriving the local values of parameters of this barrier function,the desired complexity bound of an interior-point algorithm based on this local serf-concordant function for linear optimization problem is obtained.The bound matches the best known bound for smallupdate methods.

  13. Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games

    Directory of Open Access Journals (Sweden)

    Dmitrii D. Lozovanu

    2005-10-01

    Full Text Available We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E is divided into two disjoint subsets VA and VB which are regarded as positional sets of two players. The players are seeking for a directed path from the given starting position ν 0 to the final position ν f , where the first player intends to maximize the integral cost of the path while the second one has aim to minimize it. Polynomial-time algorithm for determining max-min path in networks is proposed and its application for solving zero value cyclic games is developed. Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.

  14. Evolutionary Trees can be Learned in Polynomial-Time in the Two-State General Markov Model

    DEFF Research Database (Denmark)

    Cryan, Mary; Goldberg, Leslie Ann; Goldberg, Paul Wilfred

    2001-01-01

    The j-state general Markov model of evolution (due to Steel) is a stochastic model concerned with the evolution of strings over an alphabet of size j. In particular, the two-state general Markov model of evolution generalizes the well-known Cavender-Farris-Neyman model of evolution by removing......--Farris--Neyman model provided that the target tree satisfies the additional restriction that all pairs of leaves have a sufficiently high probability of being the same. We show how to remove both restrictions and thereby obtain the first polynomial-time PAC-learning algorithm (in the sense of Kearns et al...... the symmetry restriction (which requires that the probability that a "0" turns into a "1" along an edge is the same as the probability that a "1" turns into a "0" along the edge). Farach and Kannan showed how to probably approximately correct (PAC)-learn Markov evolutionary trees in the Cavender...

  15. Evolutionary Trees can be Learned in Polynomial-Time in the Two-State General Markov Model

    DEFF Research Database (Denmark)

    Cryan, Mary; Goldberg, Leslie Ann; Goldberg, Paul Wilfred

    2001-01-01

    The j-state general Markov model of evolution (due to Steel) is a stochastic model concerned with the evolution of strings over an alphabet of size j. In particular, the two-state general Markov model of evolution generalizes the well-known Cavender-Farris-Neyman model of evolution by removing...... the symmetry restriction (which requires that the probability that a "0" turns into a "1" along an edge is the same as the probability that a "1" turns into a "0" along the edge). Farach and Kannan showed how to probably approximately correct (PAC)-learn Markov evolutionary trees in the Cavender......--Farris--Neyman model provided that the target tree satisfies the additional restriction that all pairs of leaves have a sufficiently high probability of being the same. We show how to remove both restrictions and thereby obtain the first polynomial-time PAC-learning algorithm (in the sense of Kearns et al...

  16. Polynomial Function and Fuzzy Inference for Evaluating the Project Performance under Uncertainty

    Directory of Open Access Journals (Sweden)

    A.S. Abdel Azeem

    2014-12-01

    Full Text Available The objectives of this paper are two folds. The first one is to improve the time forecasting produced from the well known Earned Value Management (EVM, using the polynomial function. The time prediction observed from the polynomial model, which is compared against that observed from the most common method for time forecasting (critical path method, is a more accurate (mean absolute percentage of error is less than 2% than that observed from the conventional deterministic forecasting methods (CDFMs. The second is to evaluate and forecast the overall project performance under uncertainty using the fuzzy inference. As the uncertainty is inherent in real life projects, the polynomial function and fuzzy inference model (PFFI can assist the project managers, to estimate the future status of the project in a more robust and reliable way. Two examples are used to illustrate how the new method can be implemented in reality.

  17. Experimental approximation of the Jones polynomial with one quantum bit.

    Science.gov (United States)

    Passante, G; Moussa, O; Ryan, C A; Laflamme, R

    2009-12-18

    We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.

  18. JAUS to EtherCAT Bridge: Toward Real-Time and Deterministic Joint Architecture for Unmanned Systems

    Directory of Open Access Journals (Sweden)

    Jie Sheng

    2014-01-01

    Full Text Available The Joint Architecture for Unmanned Systems (JAUS is a communication standard that allows for interoperability between Unmanned Vehicles (UVs. Current research indicates that JAUS-compliant systems do not meet real-time performance guidelines necessary for internal systems in UVs. However, there is a lack of quantitative data illustrating the performance shortcomings of JAUS or clear explanations on what causes these performance issues or comparisons with existing internal communication systems. In this research, we first develop a basic C++ implementation of JAUS and evaluate its performance with quantitative data and compare the results with published performance data of Controller Area Network (CAN to determine the feasibility of the JAUS standard. Our results indicate that the main reason of JAUS’s poor performance lies in the latency inherent in the hierarchical structure of JAUS and the overhead of User Datagram Protocol (UDP messages, which has been used with JAUS and is slower than the high-speed CAN. Additionally, UDP has no scheduling mechanism, which makes it virtually impossible to guarantee messages meeting their deadlines. Considering the slow and nondeterministic JAUS communication from subsystems to components, which is JAUS Level 3 compliance, we then propose a solution by bringing Ethernet for Control Automation Technology (EtherCAT to add speed, deterministic feature, and security. The JAUS-EtherCAT mapping, which we called a JEBridge, is implemented into nodes and components. Both quantitative and qualitative results are provided to show that JEBridge and JAUS Level 3 compliance can bring not only interoperability but also reasonable performance to UVs.

  19. Time-dependent neo-deterministic seismic hazard scenarios: Preliminary report on the M6.2 Central Italy earthquake, 24th August 2016

    CERN Document Server

    Peresan, Antonella; Romashkova, Leontina; Magrin, Andrea; Soloviev, Alexander; Panza, Giuliano F

    2016-01-01

    A scenario-based Neo-Deterministic approach to Seismic Hazard Assessment (NDSHA) is available nowadays, which permits considering a wide range of possible seismic sources as the starting point for deriving scenarios by means of full waveforms modeling. The method does not make use of attenuation relations and naturally supplies realistic time series of ground shaking, including reliable estimates of ground displacement, readily applicable to complete engineering analysis. Based on the neo-deterministic approach, an operational integrated procedure for seismic hazard assessment has been developed that allows for the definition of time dependent scenarios of ground shaking, through the routine updating of earthquake predictions, performed by means of the algorithms CN and M8S. The integrated NDSHA procedure for seismic input definition, which is currently applied to the Italian territory, combines different pattern recognition techniques, designed for the space-time identification of strong earthquakes, with al...

  20. Deterministic light focusing in space and time through multiple scattering media with a Time-Resolved Transmission Matrix approach

    CERN Document Server

    Mounaix, Mickael; Gigan, Sylvain

    2016-01-01

    We report a method to characterize the propagation of an ultrashort pulse of light through a multiple scattering medium by measuring its time-resolved transmission matrix. This method is based on the use of a spatial light modulator together with a coherent time-gated detection of the transmitted speckle field. Using this matrix, we demonstrate the focusing of the scattered pulse at any arbitrary position in space and time after the medium. Our approach opens new perspectives for both fundamental studies and applications in imaging and coherent control in disordered media.

  1. A joint stochastic-deterministic approach for long-term and short-term modelling of monthly flow rates

    Science.gov (United States)

    Stojković, Milan; Kostić, Srđan; Plavšić, Jasna; Prohaska, Stevan

    2017-01-01

    The authors present a detailed procedure for modelling of mean monthly flow time-series using records of the Great Morava River (Serbia). The proposed procedure overcomes a major challenge of other available methods by disaggregating the time series in order to capture the main properties of the hydrologic process in both long-run and short-run. The main assumption of the conducted research is that a time series of monthly flow rates represents a stochastic process comprised of deterministic, stochastic and random components, the former of which can be further decomposed into a composite trend and two periodic components (short-term or seasonal periodicity and long-term or multi-annual periodicity). In the present paper, the deterministic component of a monthly flow time-series is assessed by spectral analysis, whereas its stochastic component is modelled using cross-correlation transfer functions, artificial neural networks and polynomial regression. The results suggest that the deterministic component can be expressed solely as a function of time, whereas the stochastic component changes as a nonlinear function of climatic factors (rainfall and temperature). For the calibration period, the results of the analysis infers a lower value of Kling-Gupta Efficiency in the case of transfer functions (0.736), whereas artificial neural networks and polynomial regression suggest a significantly better match between the observed and simulated values, 0.841 and 0.891, respectively. It seems that transfer functions fail to capture high monthly flow rates, whereas the model based on polynomial regression reproduces high monthly flows much better because it is able to successfully capture a highly nonlinear relationship between the inputs and the output. The proposed methodology that uses a combination of artificial neural networks, spectral analysis and polynomial regression for deterministic and stochastic components can be applied to forecast monthly or seasonal flow rates.

  2. A Bioequivalence Test by the Direct Comparison of Concentration-versus-Time Curves Using Local Polynomial Smoothers

    Directory of Open Access Journals (Sweden)

    Suyan Tian

    2016-01-01

    Full Text Available In order to test if two chemically or pharmaceutically equivalent products have the same efficacy and/or toxicity, a bioequivalence (BE study is conducted. The 80%/125% rule is the most commonly used criteria for BE and states that BE cannot be claimed unless the 90% CIs for the ratio of selected pharmacokinetics (PK parameters of the tested to the reference drug are within 0.8 to 1.25. Considering that estimates of these PK parameters are derived from the concentration-versus-time curves, a direct comparison between these curves motivates an alternative and more flexible approach to test BE. Here, we propose to frame the BE test in terms of an equivalence of concentration-versus-time curves which are constructed using local polynomial smoother (LPS. A metric is presented to quantify the distance between the curves and its 90% CIs are calculated via bootstrapping. Then, we applied the proposed procedures to data from an animal study and found that BE between a generic drug and its brand name cannot be concluded, which was consistent with the results by applying the 80%/125% rule. However, the proposed procedure has the advantage of testing only on a single metric, instead of all PK parameters.

  3. A Bioequivalence Test by the Direct Comparison of Concentration-versus-Time Curves Using Local Polynomial Smoothers

    Science.gov (United States)

    Chang, Howard H.; Orange, Dana

    2016-01-01

    In order to test if two chemically or pharmaceutically equivalent products have the same efficacy and/or toxicity, a bioequivalence (BE) study is conducted. The 80%/125% rule is the most commonly used criteria for BE and states that BE cannot be claimed unless the 90% CIs for the ratio of selected pharmacokinetics (PK) parameters of the tested to the reference drug are within 0.8 to 1.25. Considering that estimates of these PK parameters are derived from the concentration-versus-time curves, a direct comparison between these curves motivates an alternative and more flexible approach to test BE. Here, we propose to frame the BE test in terms of an equivalence of concentration-versus-time curves which are constructed using local polynomial smoother (LPS). A metric is presented to quantify the distance between the curves and its 90% CIs are calculated via bootstrapping. Then, we applied the proposed procedures to data from an animal study and found that BE between a generic drug and its brand name cannot be concluded, which was consistent with the results by applying the 80%/125% rule. However, the proposed procedure has the advantage of testing only on a single metric, instead of all PK parameters. PMID:28050196

  4. The influence of deterministic and stochastic waiting time for triggering mortality and colonization events on the coexistence of cooperators and defectors in an evolutionary game model

    Directory of Open Access Journals (Sweden)

    YouHua Chen

    2014-06-01

    Full Text Available In the present report, the coexistence of Prisoners' Dilemma game players (cooperators and defectors were explored in an individual-based framework with the consideration of the impacts of deterministic and stochastic waiting time (WT for triggering mortality and/or colonization events. For the type of deterministic waiting time, the time step for triggering a mortality and/or colonization event is fixed. For the type of stochastic waiting time, whether a mortality and/or colonization event should be triggered for each time step of a simulation is randomly determined by a given acceptance probability (the event takes place when a variate drawn from a uniform distribution [0,1] is smaller than the acceptance probability. The two strategies of modeling waiting time are considered simultaneously and applied to both quantities (mortality: WTm, colonization: WTc. As such, when WT (WTm and/or WTc is an integral >=1, it indicated a deterministically triggering strategy. In contrast, when 1>WT>0, it indicated a stochastically triggering strategy and the WT value itself is used as the acceptance probability. The parameter space between the waiting time for mortality (WTm-[0.1,40] and colonization (WTc-[0.1,40] was traversed to explore the coexistence and non-coexistence regions. The role of defense award was evaluated. My results showed that, one non-coexistence region is identified consistently, located at the area where 1>=WTm>=0.3 and 40>=WTc>=0.1. As a consequence, it was found that the coexistence of cooperators and defectors in the community is largely dependent on the waiting time of mortality events, regardless of the defense or cooperation rewards. When the mortality events happen in terms of stochastic waiting time (1>=WTm>=0.3, extinction of either cooperators or defectors or both could be very likely, leading to the emergence of non-coexistence scenarios. However, when the mortality events occur in forms of relatively long deterministic

  5. A two warehouse deterministic inventory model for deteriorating items with a linear trend in time dependent demand over finite time horizon by Elitist Real-Coded Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    A.K. Bhunia

    2013-04-01

    Full Text Available This paper deals with a deterministic inventory model developed for deteriorating items having two separate storage facilities (owned and rented warehouses due to limited capacity of the existing storage (owned warehouse with linear time dependent demand (increasing over a fixed finite time horizon. The model is formulated with infinite replenishment and the successive replenishment cycle lengths are in arithmetic progression. Partially backlogged shortages are allowed. The stocks of rented warehouse (RW are transported to the owned warehouse (OW in continuous release pattern. For this purpose, the model is formulated as a constrained non-linear mixed integer programming problem. For solving the problem, an advanced genetic algorithm (GA has been developed. This advanced GA is based on ranking selection, elitism, whole arithmetic crossover and non-uniform mutation dependent on the age of the population. Our objective is to determine the optimal replenishment number, lot-size of two-warehouses (OW and RW by maximizing the profit function. The model is illustrated with four numerical examples and sensitivity analyses of the optimal solution are performed with respect to different parameters.

  6. NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem

    CERN Document Server

    Hickey, G; Maheshwari, A; Zeh, N

    2008-01-01

    The Noah's Ark Problem (NAP) is an NP-Hard optimization problem with relevance to ecological conservation management. It asks to maximize the phylogenetic diversity (PD) of a set of taxa given a fixed budget, where each taxon is associated with a cost of conservation and a probability of extinction. NAP has received renewed interest with the rise in availability of genetic sequence data, allowing PD to be used as a practical measure of biodiversity. However, only simplified instances of the problem, where one or more parameters are fixed as constants, have as of yet been addressed in the literature. We present NAPX, the first algorithm for the general version of NAP that returns a $1 - \\epsilon$ approximation of the optimal solution. It runs in $O(\\frac{n B^2 h^2 \\log^2n}{\\log^2(1 - \\epsilon)})$ time where $n$ is the number of species, and $B$ is the total budget and $h$ is the height of the input tree. We also provide improved bounds for its expected running time.

  7. Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability

    Directory of Open Access Journals (Sweden)

    Wu Gang

    2008-01-01

    Full Text Available Abstract Background In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accuracy of a phylogeny reconstruction method is measured by simulations on synthetic datasets with known "true" phylogenies, while little theoretical analysis has been done. In this paper, we present a new model-based approach to measuring the accuracy of a quartet-based phylogeny reconstruction method. Under this model, we propose three efficient algorithms to reconstruct the "true" phylogeny with a high success probability. Results The first algorithm can reconstruct the "true" phylogeny from the input quartet topology set without quartet errors in O(n2 time by querying at most (n - 4 log(n - 1 quartet topologies, where n is the number of the taxa. When the input quartet topology set contains errors, the second algorithm can reconstruct the "true" phylogeny with a probability approximately 1 - p in O(n4 log n time, where p is the probability for a quartet topology being an error. This probability is improved by the third algorithm to approximately 11+q2+12q4+116q5 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaqcfa4aaSaaaeaacqaIXaqmaeaacqaIXaqmcqGHRaWkcqWGXbqCdaahaaqabeaacqaIYaGmaaGaey4kaSYaaSaaaeaacqaIXaqmaeaacqaIYaGmaaGaemyCae3aaWbaaeqabaGaeGinaqdaaiabgUcaRmaalaaabaGaeGymaedabaGaeGymaeJaeGOnaydaaiabdghaXnaaCaaabeqaaiabiwda1aaaaaaaaa@3D5A@, where q=p1−p MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaGaemyCaeNaeyypa0tcfa4aaSaaaeaacqWGWbaCaeaacqaIXaqmcqGHsislcqWGWbaCaaaaaa@3391@, with

  8. Askey-Wilson polynomial

    NARCIS (Netherlands)

    Koornwinder, T.H.

    2012-01-01

    Askey-Wilson polynomial refers to a four-parameter family of q-hypergeometric orthogonal polynomials which contains all families of classical orthogonal polynomials (in the wide sense) as special or limit cases.

  9. Extended Diffie-Hellman Technique to Generate Multiple Shared Keys at a Time with Reduced KEOs and its Polynomial Time Complexity

    Directory of Open Access Journals (Sweden)

    Nistala V.E.S. Murthy

    2010-05-01

    Full Text Available Recently Biswas[1] extended Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of two public keys. In this paper, we further generalize the Diffie-Hellman technique to generate multiple two-person-shared keys by exchange of any number of public keys and study its Polynomial Time Complexity, Security etc. Also, an upper bound for the number of shared keys in terms of the number of exchanged keys and for a given number of shared keys, the minimum required number of keys to be exchanged, were arrived at. Lastly, a comparative study between the proposed technique and the Diffie-Hellman technique repeated m-times is made.

  10. Transit timing observations from Kepler. V. Transit timing variation candidates in the first sixteen months from polynomial models

    DEFF Research Database (Denmark)

    Ford, E.B.; Ragozzine, D.; Holman, M.J.;

    2012-01-01

    Transit timing variations provide a powerful tool for confirming and characterizing transiting planets, as well as detecting non-transiting planets. We report the results of an updated transit timing variation (TTV) analysis for 1481 planet candidates based on transit times measured during...

  11. Fault Estimation Observer Design for Discrete-Time Takagi-Sugeno Fuzzy Systems Based on Homogenous Polynomially Parameter-Dependent Lyapunov Functions.

    Science.gov (United States)

    Xie, Xiangpeng; Yue, Dong; Zhang, Huaguang; Xue, Yusheng

    2017-09-01

    This paper investigates the problem of robust fault estimation (FE) observer design for discrete-time Takagi-Sugeno fuzzy systems via homogenous polynomially parameter-dependent Lyapunov functions. First, a novel framework of the fuzzy FE observer is established with the help of a maximum-minimum-priority-based switching mechanism. Then, for every activated switching case, a targeted result is achieved by the aid of exploring an important property of improved homogenous polynomials. Since the helpful information of the underlying system can be duly updated and effectively utilized at every sampled point, the conservatism of previous results is availably reduced. Furthermore, the proposed result is further improved by eliminating those redundant terms of the introduced matrix-valued variables. Simulation results based on a discrete-time nonlinear truck-trailer model are provided to show the advantages of the theoretic result that is developed in this paper.

  12. Deterministic Graphical Games Revisited

    DEFF Research Database (Denmark)

    Andersson, Klas Olof Daniel; Hansen, Kristoffer Arnsfelt; Miltersen, Peter Bro

    2012-01-01

    Starting from Zermelo’s classical formal treatment of chess, we trace through history the analysis of two-player win/lose/draw games with perfect information and potentially infinite play. Such chess-like games have appeared in many different research communities, and methods for solving them......, such as retrograde analysis, have been rediscovered independently. We then revisit Washburn’s deterministic graphical games (DGGs), a natural generalization of chess-like games to arbitrary zero-sum payoffs. We study the complexity of solving DGGs and obtain an almost-linear time comparison-based algorithm...... for finding optimal strategies in such games. The existence of a linear time comparison-based algorithm remains an open problem....

  13. Deterministic Graphical Games Revisited

    DEFF Research Database (Denmark)

    Andersson, Klas Olof Daniel; Hansen, Kristoffer Arnsfelt; Miltersen, Peter Bro

    2012-01-01

    Starting from Zermelo’s classical formal treatment of chess, we trace through history the analysis of two-player win/lose/draw games with perfect information and potentially infinite play. Such chess-like games have appeared in many different research communities, and methods for solving them......, such as retrograde analysis, have been rediscovered independently. We then revisit Washburn’s deterministic graphical games (DGGs), a natural generalization of chess-like games to arbitrary zero-sum payoffs. We study the complexity of solving DGGs and obtain an almost-linear time comparison-based algorithm...... for finding optimal strategies in such games. The existence of a linear time comparison-based algorithm remains an open problem....

  14. Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems

    CERN Document Server

    Khabbazibasmenj, Arash; Vorobyov, Sergiy A; Haardt, Martin

    2012-01-01

    Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in polynomial time, and develop two algorithms. The objective function of the problem is represented as a product of quadratic ratios and parameterized so that its convex part (versus the concave part) contains only one (or two) optimization variables. One of the algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite programming (SDP) relaxation, linearization, and an iterative search over a single para...

  15. Deterministic joint remote state preparation

    Energy Technology Data Exchange (ETDEWEB)

    An, Nguyen Ba, E-mail: nban@iop.vast.ac.vn [Center for Theoretical Physics, Institute of Physics, 10 Dao Tan, Ba Dinh, Hanoi (Viet Nam); Bich, Cao Thi [Center for Theoretical Physics, Institute of Physics, 10 Dao Tan, Ba Dinh, Hanoi (Viet Nam); Physics Department, University of Education No. 1, 136 Xuan Thuy, Cau Giay, Hanoi (Viet Nam); Don, Nung Van [Center for Theoretical Physics, Institute of Physics, 10 Dao Tan, Ba Dinh, Hanoi (Viet Nam); Physics Department, Hanoi National University, 334 Nguyen Trai, Thanh Xuan, Hanoi (Viet Nam)

    2011-09-26

    We put forward a new nontrivial three-step strategy to execute joint remote state preparation via Einstein-Podolsky-Rosen pairs deterministically. At variance with all existing protocols, in ours the receiver contributes actively in both preparation and reconstruction steps, although he knows nothing about the quantum state to be prepared. -- Highlights: → Deterministic joint remote state preparation via EPR pairs is proposed. → Both general single- and two-qubit states are studied. → Differently from all existing protocols, in ours the receiver participates actively. → This is for the first time such a strategy is adopted.

  16. Deterministic indexing for packed strings

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye

    2017-01-01

    Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries. In the deterministic variant the goal is to solve the string indexing problem without any randomization (at preprocessing time...... or query time). In the packed variant the strings are stored with several character in a single word, giving us the opportunity to read multiple characters simultaneously. Our main result is a new string index in the deterministic and packed setting. Given a packed string S of length n over an alphabet σ......, we show how to preprocess S in O(n) (deterministic) time and space O(n) such that given a packed pattern string of length m we can support queries in (deterministic) time O (m/α + log m + log log σ), where α = w/log σ is the number of characters packed in a word of size w = θ(log n). Our query time...

  17. Pattern polynomial graphs

    CERN Document Server

    Reddy, A Satyanarayana

    2011-01-01

    A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the graphs which are polynomials in the pattern polynomial graph have been studied. We also identify known graph classes which are pattern polynomial graphs.

  18. New classes of test polynomials of polynomial algebras

    Institute of Scientific and Technical Information of China (English)

    冯克勤; 余解台

    1999-01-01

    A polynomial p in a polynomial algebra over a field is called a test polynomial if any endomorphism of the polynomial algebra that fixes p is an automorphism. some classes of new test polynomials recognizing nonlinear automorphisms of polynomial algebras are given. In the odd prime characteristic case, test polynomials recognizing non-semisimple automorphisms are also constructed.

  19. Transit Timing Observations from Kepler: VI. Transit Timing Variation Candidates in the First Seventeen Months from Polynomial Models

    CERN Document Server

    Ford, Eric B; Rowe, Jason F; Steffen, Jason H; Barclay, Thomas; Batalha, Natalie M; Borucki, William J; Bryson, Stephen T; Caldwell, Douglas A; Fabrycky, Daniel C; Gautier, Thomas N; Holman, Matthew J; Ibrahim, Khadeejah A; Kjeldsen, Hans; Kinemuchi, Karen; Koch, David G; Lissauer, Jack J; Still, Martin; Tenenbaum, Peter; Uddin, Kamal; Welsh, William

    2012-01-01

    Transit timing variations provide a powerful tool for confirming and characterizing transiting planets, as well as detecting non-transiting planets. We report the results an updated TTV analysis for 822 planet candidates (Borucki et al. 2011; Batalha et al. 2012) based on transit times measured during the first seventeen months of Kepler observations (Rowe et al 2012). We present 35 TTV candidates (4.1% of suitable data sets) based on long-term trends and 153 mostly weaker TTV candidates (18% of suitable data sets) based on excess scatter of TTV measurements about a linear ephemeris. We anticipate that several of these planet candidates could be confirmed and perhaps characterized with more detailed TTV analyses using publicly available Kepler observations. For many others, Kepler has observed a long-term TTV trend, but an extended Kepler mission will be required to characterize the system via TTVs. We find that the occurence rate of planet candidates that show TTVs is significantly increased (~60%-76%) for p...

  20. Polynomial Regressions and Nonsense Inference

    Directory of Open Access Journals (Sweden)

    Daniel Ventosa-Santaulària

    2013-11-01

    Full Text Available Polynomial specifications are widely used, not only in applied economics, but also in epidemiology, physics, political analysis and psychology, just to mention a few examples. In many cases, the data employed to estimate such specifications are time series that may exhibit stochastic nonstationary behavior. We extend Phillips’ results (Phillips, P. Understanding spurious regressions in econometrics. J. Econom. 1986, 33, 311–340. by proving that an inference drawn from polynomial specifications, under stochastic nonstationarity, is misleading unless the variables cointegrate. We use a generalized polynomial specification as a vehicle to study its asymptotic and finite-sample properties. Our results, therefore, lead to a call to be cautious whenever practitioners estimate polynomial regressions.

  1. Uniform deterministic dictionaries

    DEFF Research Database (Denmark)

    Ruzic, Milan

    2008-01-01

    We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting “good” hash functions. The main motivation is realization of deterministic dictionaries with fast lookups and reasonably fast updates. The model of computation...

  2. Deterministic Walks with Choice

    Energy Technology Data Exchange (ETDEWEB)

    Beeler, Katy E.; Berenhaut, Kenneth S.; Cooper, Joshua N.; Hunter, Meagan N.; Barr, Peter S.

    2014-01-10

    This paper studies deterministic movement over toroidal grids, integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.

  3. Hybrid stochastic-deterministic calculation of the second-order perturbative contribution of multireference perturbation theory

    Science.gov (United States)

    Garniron, Yann; Scemama, Anthony; Loos, Pierre-François; Caffarel, Michel

    2017-07-01

    A hybrid stochastic-deterministic approach for computing the second-order perturbative contribution E(2) within multireference perturbation theory (MRPT) is presented. The idea at the heart of our hybrid scheme—based on a reformulation of E(2) as a sum of elementary contributions associated with each determinant of the MR wave function—is to split E(2) into a stochastic and a deterministic part. During the simulation, the stochastic part is gradually reduced by dynamically increasing the deterministic part until one reaches the desired accuracy. In sharp contrast with a purely stochastic Monte Carlo scheme where the error decreases indefinitely as t-1/2 (where t is the computational time), the statistical error in our hybrid algorithm displays a polynomial decay ˜t-n with n = 3-4 in the examples considered here. If desired, the calculation can be carried on until the stochastic part entirely vanishes. In that case, the exact result is obtained with no error bar and no noticeable computational overhead compared to the fully deterministic calculation. The method is illustrated on the F2 and Cr2 molecules. Even for the largest case corresponding to the Cr2 molecule treated with the cc-pVQZ basis set, very accurate results are obtained for E(2) for an active space of (28e, 176o) and a MR wave function including up to 2 ×1 07 determinants.

  4. Explicit classes of permutation polynomials of F33m

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33m are presented. These polynomials have simple shapes, and they are related to planar functions.

  5. Explicit classes of permutation polynomials of F33m

    Institute of Scientific and Technical Information of China (English)

    DING CunSheng; XIANG Qing; YUAN Jin; YUAN PingZhi

    2009-01-01

    Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33 are pre-sented. These polynomials have simple shapes, and they are related to planar functions.

  6. Factoring Polynomials and Fibonacci.

    Science.gov (United States)

    Schwartzman, Steven

    1986-01-01

    Discusses the factoring of polynomials and Fibonacci numbers, offering several challenges teachers can give students. For example, they can give students a polynomial containing large numbers and challenge them to factor it. (JN)

  7. Polynomial Datapaths Optimization

    OpenAIRE

    Parta, Hojat

    2014-01-01

    The research presented focuses on optimization of polynomials using algebraic manipulations at the high level and digital arithmetic techniques at the implementation level. Previous methods lacked any algebraic understanding of the polynomials or only exposed limited potential. We have treated the polynomial optimization problem in abstract algebra allowing us algebraic freedom to transform polynomials. Unlike previous attempts where only a set of limited benchmarks have been used, we have fo...

  8. Palindromic random trigonometric polynomials

    OpenAIRE

    Conrey, J. Brian; Farmer, David W.; Imamoglu, Özlem

    2008-01-01

    We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric polynomials has, on average, many real roots. In the case that the coefficients of a real trigonometric polynomial are independently and identically distributed, but with no other assumptions on the distribution, the expected fraction of real zeros is at l...

  9. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    1999-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...

  10. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    2002-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...

  11. Multiplication of a Schubert polynomial by a Stanley symmetric polynomial

    OpenAIRE

    Assaf, Sami

    2017-01-01

    We prove, combinatorially, that the product of a Schubert polynomial by a Stanley symmetric polynomial is a truncated Schubert polynomial. Using Monk's rule, we derive a nonnegative combinatorial formula for the Schubert polynomial expansion of a truncated Schubert polynomial. Combining these results, we give a nonnegative combinatorial rule for the product of a Schubert and a Schur polynomial in the Schubert basis.

  12. Plain Polynomial Arithmetic on GPU

    Science.gov (United States)

    Anisul Haque, Sardar; Moreno Maza, Marc

    2012-10-01

    As for serial code on CPUs, parallel code on GPUs for dense polynomial arithmetic relies on a combination of asymptotically fast and plain algorithms. Those are employed for data of large and small size, respectively. Parallelizing both types of algorithms is required in order to achieve peak performances. In this paper, we show that the plain dense polynomial multiplication can be efficiently parallelized on GPUs. Remarkably, it outperforms (highly optimized) FFT-based multiplication up to degree 212 while on CPU the same threshold is usually at 26. We also report on a GPU implementation of the Euclidean Algorithm which is both work-efficient and runs in linear time for input polynomials up to degree 218 thus showing the performance of the GCD algorithm based on systolic arrays.

  13. Application of polynomial preconditioners to conservation laws

    NARCIS (Netherlands)

    Geurts, Bernardus J.; van Buuren, R.; Lu, H.

    2000-01-01

    Polynomial preconditioners which are suitable in implicit time-stepping methods for conservation laws are reviewed and analyzed. The preconditioners considered are either based on a truncation of a Neumann series or on Chebyshev polynomials for the inverse of the system-matrix. The latter class of

  14. Modelling and multi-objective optimization of a variable valve-timing spark-ignition engine using polynomial neural networks and evolutionary algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Atashkari, K. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of); Nariman-Zadeh, N. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of)]. E-mail: nnzadeh@guilan.ac.ir; Goelcue, M. [Department of Mechanical Education, Technical Education faculty, Pamukkale University, 20017 Kinikli, Denizli (Turkey); Khalkhali, A. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of); Jamali, A. [Department of Mechanical Engineering, Faculty of Engineering, The University of Guilan, P.O. Box 3756, Rasht (Iran, Islamic Republic of)

    2007-03-15

    The main reason for the efficiency decrease at part load conditions for four-stroke spark-ignition (SI) engines is the flow restriction at the cross-sectional area of the intake system. Traditionally, valve-timing has been designed to optimize operation at high engine-speed and wide open throttle conditions. Several investigations have demonstrated that improvements at part load conditions in engine performance can be accomplished if the valve-timing is variable. Controlling valve-timing can be used to improve the torque and power curve as well as to reduce fuel consumption and emissions. In this paper, a group method of data handling (GMDH) type neural network and evolutionary algorithms (EAs) are firstly used for modelling the effects of intake valve-timing (V {sub t}) and engine speed (N) of a spark-ignition engine on both developed engine torque (T) and fuel consumption (Fc) using some experimentally obtained training and test data. Using such obtained polynomial neural network models, a multi-objective EA (non-dominated sorting genetic algorithm, NSGA-II) with a new diversity preserving mechanism are secondly used for Pareto based optimization of the variable valve-timing engine considering two conflicting objectives such as torque (T) and fuel consumption (Fc). The comparison results demonstrate the superiority of the GMDH type models over feedforward neural network models in terms of the statistical measures in the training data, testing data and the number of hidden neurons. Further, it is shown that some interesting and important relationships, as useful optimal design principles, involved in the performance of the variable valve-timing four-stroke spark-ignition engine can be discovered by the Pareto based multi-objective optimization of the polynomial models. Such important optimal principles would not have been obtained without the use of both the GMDH type neural network modelling and the multi-objective Pareto optimization approach.

  15. Perturbations around the zeros of classical orthogonal polynomials

    CERN Document Server

    Sasaki, Ryu

    2014-01-01

    Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has remarkable Diophantine properties. Its eigenvalues are independent of the zeros. The corresponding eigenvectors provide the representations of the lower degree (0,1,...,N-1) polynomials in terms of the zeros of the degree N polynomial. The results are valid universally for all the classical orthogonal polynomials, including the Askey scheme of hypergeometric orthogonal polynomials and its q-analogues.

  16. Does the polynomial hierarchy collapse if onto functions are invertible?

    NARCIS (Netherlands)

    H. Buhrman; L. Fortnow; M. Koucký; J.D. Rogers; N. Vereshchagin

    2010-01-01

    The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence that such functions are hard, for example, if TFNP is computable in polynomial-time does this imply the polynomial-time hi

  17. Weierstrass polynomials for links

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    1997-01-01

    There is a natural way of identifying links in3-space with polynomial covering spaces over thecircle. Thereby any link in 3-space can be definedby a Weierstrass polynomial over the circle. Theequivalence relation for covering spaces over thecircle is, however, completely different from...... that for links in 3-space. This paper initiates a study of the connections between polynomial covering spaces over the circle and links in 3-space....

  18. Polynomial asymptotic stability of damped stochastic differential equations

    Directory of Open Access Journals (Sweden)

    John Appleby

    2004-08-01

    Full Text Available The paper studies the polynomial convergence of solutions of a scalar nonlinear It\\^{o} stochastic differential equation\\[dX(t = -f(X(t\\,dt + \\sigma(t\\,dB(t\\] where it is known, {\\it a priori}, that $\\lim_{t\\rightarrow\\infty} X(t=0$, a.s. The intensity of the stochastic perturbation $\\sigma$ is a deterministic, continuous and square integrable function, which tends to zero more quickly than a polynomially decaying function. The function $f$ obeys $\\lim_{x\\rightarrow 0}\\mbox{sgn}(xf(x/|x|^\\beta = a$, for some $\\beta>1$, and $a>0$.We study two asymptotic regimes: when $\\sigma$ tends to zero sufficiently quickly the polynomial decay rate of solutions is the same as for the deterministic equation (when $\\sigma\\equiv0$. When $\\sigma$ decays more slowly, a weaker almost sure polynomial upper bound on the decay rate of solutions is established. Results which establish the necessity for $\\sigma$ to decay polynomially in order to guarantee the almost sure polynomial decay of solutions are also proven.

  19. Polynomial Regressions and Nonsense Inference

    DEFF Research Database (Denmark)

    Ventosa-Santaulària, Daniel; Rodríguez-Caballero, Carlos Vladimir

    Polynomial specifications are widely used, not only in applied economics, but also in epidemiology, physics, political analysis, and psychology, just to mention a few examples. In many cases, the data employed to estimate such estimations are time series that may exhibit stochastic nonstationary ...

  20. Comparison of probabilistic and deterministic predictions of time to growth of Listeria monocytogenes as affected by pH and temperature in food.

    Science.gov (United States)

    Guevara, Leymaya; Martínez, Antonio; Fernández, Pablo S; Muñoz-Cuevas, Marina

    2011-01-01

    Stochastic models are useful for estimating the risk of foodborne illness and they can be integrated, besides other sources of variability, into microbial risk assessment. A stochastic approach to evaluate growth of two strains of Listeria monocytogenes influenced by different factors affecting microbial growth (pH and storage temperature) was performed. An individual-based approach of growth through optical density measurements was used. From results obtained, histograms of the lag phase were generated and distributions were fitted. Histograms presented increased variation when the factors applied were suboptimal for L. monocytogenes and they were combined. The extreme value distribution was ranked as the best one in most cases, whereas normal was the poorest fitting distribution. To evaluate the influence of pH and storage temperature on L. monocytogenes CECT 5672 in real food, commercial samples of courgette and carrot soup were inoculated with this pathogen. It was able to grow in both soups at storage temperatures from 4°C to 20°C. Using the distributions adjusted, predictions of time to growth (10² cfu/g) of L. monocytogenes were established by Monte Carlo simulation and they were compared with deterministic predictions and observations in foods.

  1. Deterministic Discrepancy Minimization

    NARCIS (Netherlands)

    Bansal, N.; Spencer, J.

    2013-01-01

    We derandomize a recent algorithmic approach due to Bansal (Foundations of Computer Science, FOCS, pp. 3–10, 2010) to efficiently compute low discrepancy colorings for several problems, for which only existential results were previously known. In particular, we give an efficient deterministic algori

  2. Polynomial Fibonacci-Hessenberg matrices

    Energy Technology Data Exchange (ETDEWEB)

    Esmaeili, Morteza [Dept. of Mathematical Sciences, Isfahan University of Technology, 84156-83111 Isfahan (Iran, Islamic Republic of)], E-mail: emorteza@cc.iut.ac.ir; Esmaeili, Mostafa [Dept. of Electrical and Computer Engineering, Isfahan University of Technology, 84156-83111 Isfahan (Iran, Islamic Republic of)

    2009-09-15

    A Fibonacci-Hessenberg matrix with Fibonacci polynomial determinant is referred to as a polynomial Fibonacci-Hessenberg matrix. Several classes of polynomial Fibonacci-Hessenberg matrices are introduced. The notion of two-dimensional Fibonacci polynomial array is introduced and three classes of polynomial Fibonacci-Hessenberg matrices satisfying this property are given.

  3. Deterministic Circular Self Test Path

    Institute of Scientific and Technical Information of China (English)

    WEN Ke; HU Yu; LI Xiaowei

    2007-01-01

    Circular self test path (CSTP) is an attractive technique for testing digital integrated circuits(IC) in the nanometer era, because it can easily provide at-speed test with small test data volume and short test application time. However, CSTP cannot reliably attain high fault coverage because of difficulty of testing random-pattern-resistant faults. This paper presents a deterministic CSTP (DCSTP) structure that consists of a DCSTP chain and jumping logic, to attain high fault coverage with low area overhead. Experimental results on ISCAS'89 benchmarks show that 100% fault coverage can be obtained with low area overhead and CPU time, especially for large circuits.

  4. Polynomial Graphs and Symmetry

    Science.gov (United States)

    Goehle, Geoff; Kobayashi, Mitsuo

    2013-01-01

    Most quadratic functions are not even, but every parabola has symmetry with respect to some vertical line. Similarly, every cubic has rotational symmetry with respect to some point, though most cubics are not odd. We show that every polynomial has at most one point of symmetry and give conditions under which the polynomial has rotational or…

  5. Polynomial Graphs and Symmetry

    Science.gov (United States)

    Goehle, Geoff; Kobayashi, Mitsuo

    2013-01-01

    Most quadratic functions are not even, but every parabola has symmetry with respect to some vertical line. Similarly, every cubic has rotational symmetry with respect to some point, though most cubics are not odd. We show that every polynomial has at most one point of symmetry and give conditions under which the polynomial has rotational or…

  6. Heat polynomial analogs for higher order evolution equations

    Directory of Open Access Journals (Sweden)

    G. N. Hile

    2001-05-01

    Full Text Available Polynomial solutions analogous to the heat polynomials are demonstrated for higher order linear homogeneous evolution equations with coefficients depending on the time variable. Further parallels with the heat polynomials are established when the equation is parabolic with constant coefficients and only highest order terms.

  7. Nonnegativity of uncertain polynomials

    Directory of Open Access Journals (Sweden)

    Šiljak Dragoslav D.

    1998-01-01

    Full Text Available The purpose of this paper is to derive tests for robust nonnegativity of scalar and matrix polynomials, which are algebraic, recursive, and can be completed in finite number of steps. Polytopic families of polynomials are considered with various characterizations of parameter uncertainty including affine, multilinear, and polynomic structures. The zero exclusion condition for polynomial positivity is also proposed for general parameter dependencies. By reformulating the robust stability problem of complex polynomials as positivity of real polynomials, we obtain new sufficient conditions for robust stability involving multilinear structures, which can be tested using only real arithmetic. The obtained results are applied to robust matrix factorization, strict positive realness, and absolute stability of multivariable systems involving parameter dependent transfer function matrices.

  8. The human ECG nonlinear deterministic versus stochastic aspects

    CERN Document Server

    Kantz, H; Kantz, Holger; Schreiber, Thomas

    1998-01-01

    We discuss aspects of randomness and of determinism in electrocardiographic signals. In particular, we take a critical look at attempts to apply methods of nonlinear time series analysis derived from the theory of deterministic dynamical systems. We will argue that deterministic chaos is not a likely explanation for the short time variablity of the inter-beat interval times, except for certain pathologies. Conversely, densely sampled full ECG recordings possess properties typical of deterministic signals. In the latter case, methods of deterministic nonlinear time series analysis can yield new insights.

  9. A NEW DETERMINISTIC FORMULATION FOR DYNAMIC STOCHASTIC PROGRAMMING PROBLEMS AND ITS NUMERICAL COMPARISON WITH OTHERS

    Institute of Scientific and Technical Information of China (English)

    陈志平

    2003-01-01

    A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.

  10. Polynomial Interpolation in the Elliptic Curve Cryptosystem

    Directory of Open Access Journals (Sweden)

    Liew K. Jie

    2011-01-01

    Full Text Available Problem statement: In this research, we incorporate the polynomial interpolation method in the discrete logarithm problem based cryptosystem which is the elliptic curve cryptosystem. Approach: In this study, the polynomial interpolation method to be focused is the Lagrange polynomial interpolation which is the simplest polynomial interpolation method. This method will be incorporated in the encryption algorithm of the elliptic curve ElGamal cryptosystem. Results: The scheme modifies the elliptic curve ElGamal cryptosystem by adding few steps in the encryption algorithm. Two polynomials are constructed based on the encrypted points using Lagrange polynomial interpolation and encrypted for the second time using the proposed encryption method. We believe it is safe from the theoretical side as it still relies on the discrete logarithm problem of the elliptic curve. Conclusion/Recommendations: The modified scheme is expected to be more secure than the existing scheme as it offers double encryption techniques. On top of the existing encryption algorithm, we managed to encrypt one more time using the polynomial interpolation method. We also have provided detail examples based on the described algorithm.

  11. A new surrogate modeling technique combining Kriging and polynomial chaos expansions - Application to uncertainty analysis in computational dosimetry

    Science.gov (United States)

    Kersaudy, Pierric; Sudret, Bruno; Varsier, Nadège; Picon, Odile; Wiart, Joe

    2015-04-01

    In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

  12. A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

    Energy Technology Data Exchange (ETDEWEB)

    Kersaudy, Pierric, E-mail: pierric.kersaudy@orange.com [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Sudret, Bruno [ETH Zürich, Chair of Risk, Safety and Uncertainty Quantification, Stefano-Franscini-Platz 5, 8093 Zürich (Switzerland); Varsier, Nadège [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Picon, Odile [ESYCOM, Université Paris-Est Marne-la-Vallée, 5 boulevard Descartes, 77700 Marne-la-Vallée (France); Wiart, Joe [Orange Labs, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France); Whist Lab, 38 avenue du Général Leclerc, 92130 Issy-les-Moulineaux (France)

    2015-04-01

    In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

  13. On Polynomial Remainder Codes

    CERN Document Server

    Yu, Jiun-Hung

    2012-01-01

    Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.

  14. BSDEs with polynomial growth generators

    Directory of Open Access Journals (Sweden)

    Philippe Briand

    2000-01-01

    Full Text Available In this paper, we give existence and uniqueness results for backward stochastic differential equations when the generator has a polynomial growth in the state variable. We deal with the case of a fixed terminal time, as well as the case of random terminal time. The need for this type of extension of the classical existence and uniqueness results comes from the desire to provide a probabilistic representation of the solutions of semilinear partial differential equations in the spirit of a nonlinear Feynman-Kac formula. Indeed, in many applications of interest, the nonlinearity is polynomial, e.g, the Allen-Cahn equation or the standard nonlinear heat and Schrödinger equations.

  15. Deterministic Global Optimization

    CERN Document Server

    Scholz, Daniel

    2012-01-01

    This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization

  16. Generalized Deterministic Traffic Rules

    CERN Document Server

    Fuks, H; Fuks, Henryk; Boccara, Nino

    1997-01-01

    We study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parametrized by the speed limit $m$ and another parameter $k$ that represents a ``degree of aggressiveness'' in driving, strictly related to the distance between two consecutive cars. We compare two driving strategies with identical maximum throughput: ``conservative'' driving with high speed limit and ``aggressive'' driving with low speed limit. Those two strategies are evaluated in terms of accident probability. We also discuss fundamental diagrams of generalized traffic rules and examine limitations of maximum achievable throughput. Possible modifications of the model are considered.

  17. The Deterministic Dendritic Cell Algorithm

    CERN Document Server

    Greensmith, Julie

    2010-01-01

    The Dendritic Cell Algorithm is an immune-inspired algorithm orig- inally based on the function of natural dendritic cells. The original instantiation of the algorithm is a highly stochastic algorithm. While the performance of the algorithm is good when applied to large real-time datasets, it is difficult to anal- yse due to the number of random-based elements. In this paper a deterministic version of the algorithm is proposed, implemented and tested using a port scan dataset to provide a controllable system. This version consists of a controllable amount of parameters, which are experimented with in this paper. In addition the effects are examined of the use of time windows and variation on the number of cells, both which are shown to influence the algorithm. Finally a novel metric for the assessment of the algorithms output is introduced and proves to be a more sensitive metric than the metric used with the original Dendritic Cell Algorithm.

  18. Exploiting Deterministic TPG for Path Delay Testing

    Institute of Scientific and Technical Information of China (English)

    李晓维

    2000-01-01

    Detection of path delay faults requires two-pattern tests. BIST technique provides a low-cost test solution. This paper proposes an approach to designing a cost-effective deterministic test pattern generator (TPG) for path delay testing. Given a set of pre-generated test-pairs with pre-determined fault coverage, a deterministic TPG is synthesized to apply the given test-pair set in a limited test time. To achieve this objective, configurable linear feedback shift register (LFSR) structures are used. Techniques are developed to synthesize such a TPG, which is used to generate an unordered deterministic test-pair set. The resulting TPG is very efficient in terms of hardware size and speed performance. Simulation of academic benchmark circuits has given good results when compared to alternative solutions.

  19. Neutron noise computation using panda deterministic code

    Energy Technology Data Exchange (ETDEWEB)

    Humbert, Ph. [CEA Bruyeres le Chatel (France)

    2003-07-01

    PANDA is a general purpose discrete ordinates neutron transport code with deterministic and non deterministic applications. In this paper we consider the adaptation of PANDA to stochastic neutron counting problems. More specifically we consider the first two moments of the count number probability distribution. In a first part we will recall the equations for the single neutron and source induced count number moments with the corresponding expression for the excess of relative variance or Feynman function. In a second part we discuss the numerical solution of these inhomogeneous adjoint time dependent transport coupled equations with discrete ordinate methods. Finally, numerical applications are presented in the third part. (author)

  20. Thermodynamic characterization of networks using graph polynomials

    CERN Document Server

    Ye, Cheng; Peron, Thomas K DM; Silva, Filipi N; Rodrigues, Francisco A; Costa, Luciano da F; Torsello, Andrea; Hancock, Edwin R

    2015-01-01

    In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the...

  1. Inferring deterministic causal relations

    CERN Document Server

    Daniusis, Povilas; Mooij, Joris; Zscheischler, Jakob; Steudel, Bastian; Zhang, Kun; Schoelkopf, Bernhard

    2012-01-01

    We consider two variables that are related to each other by an invertible function. While it has previously been shown that the dependence structure of the noise can provide hints to determine which of the two variables is the cause, we presently show that even in the deterministic (noise-free) case, there are asymmetries that can be exploited for causal inference. Our method is based on the idea that if the function and the probability density of the cause are chosen independently, then the distribution of the effect will, in a certain sense, depend on the function. We provide a theoretical analysis of this method, showing that it also works in the low noise regime, and link it to information geometry. We report strong empirical results on various real-world data sets from different domains.

  2. The mathematical basis for deterministic quantum mechanics

    NARCIS (Netherlands)

    Hooft, G. 't

    2006-01-01

    If there exists a classical, i.e. deterministic theory underlying quantum mechanics, an explanation must be found of the fact that the Hamiltonian, which is defined to be the operator that generates evolution in time, is bounded from below. The mechanism that can produce exactly such a constraint

  3. The mathematical basis for deterministic quantum mechanics

    NARCIS (Netherlands)

    Hooft, G. 't

    2007-01-01

    If there exists a classical, i.e. deterministic theory underlying quantum mechanics, an explanation must be found of the fact that the Hamiltonian, which is defined to be the operator that generates evolution in time, is bounded from below. The mechanism that can produce exactly such a constraint is

  4. Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

    Directory of Open Access Journals (Sweden)

    Jie Ran

    2015-01-01

    Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

  5. 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...

  6. Additive and polynomial representations

    CERN Document Server

    Krantz, David H; Suppes, Patrick

    1971-01-01

    Additive and Polynomial Representations deals with major representation theorems in which the qualitative structure is reflected as some polynomial function of one or more numerical functions defined on the basic entities. Examples are additive expressions of a single measure (such as the probability of disjoint events being the sum of their probabilities), and additive expressions of two measures (such as the logarithm of momentum being the sum of log mass and log velocity terms). The book describes the three basic procedures of fundamental measurement as the mathematical pivot, as the utiliz

  7. STABILITY OF SWITCHED POLYNOMIAL SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Zhiqiang LI; Yupeng QIAO; Hongsheng QI; Daizhan CHENG

    2008-01-01

    This paper investigates the stability of (switched) polynomial systems. Using semi-tensor product of matrices, the paper develops two tools for testing the stability of a (switched) polynomial system. One is to convert a product of multi-variable polynomials into a canonical form, and the other is an easily verifiable sufficient condition to justify whether a multi-variable polynomial is positive definite. Using these two tools, the authors construct a polynomial function as a candidate Lyapunov function and via testing its derivative the authors provide some sufficient conditions for the global stability of polynomial systems.

  8. Deterministic behavioural models for concurrency

    DEFF Research Database (Denmark)

    Sassone, Vladimiro; Nielsen, Mogens; Winskel, Glynn

    1993-01-01

    This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled...

  9. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.

    Science.gov (United States)

    Currin, Andrew; Korovin, Konstantin; Ababi, Maria; Roper, Katherine; Kell, Douglas B; Day, Philip J; King, Ross D

    2017-03-01

    The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman 'there's plenty of room at the bottom'. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world

  10. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA

    Science.gov (United States)

    Currin, Andrew; Korovin, Konstantin; Ababi, Maria; Roper, Katherine; Kell, Douglas B.; Day, Philip J.

    2017-01-01

    The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman ‘there's plenty of room at the bottom’. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world

  11. Tricubic polynomial interpolation.

    Science.gov (United States)

    Birkhoff, G

    1971-06-01

    A new triangular "finite element" is described; it involves the 12-parameter family of all quartic polynomial functions that are "tricubic" in that their variation is cubic along any parallel to any side of the triangle. An interpolation scheme is described that approximates quite accurately any smooth function on any triangulated domain by a continuously differentiable function, tricubic on each triangular element.

  12. Calculators and Polynomial Evaluation.

    Science.gov (United States)

    Weaver, J. F.

    The intent of this paper is to suggest and illustrate how electronic hand-held calculators, especially non-programmable ones with limited data-storage capacity, can be used to advantage by students in one particular aspect of work with polynomial functions. The basic mathematical background upon which calculator application is built is summarized.…

  13. On Generalized Bell Polynomials

    Directory of Open Access Journals (Sweden)

    Roberto B. Corcino

    2011-01-01

    Full Text Available It is shown that the sequence of the generalized Bell polynomials Sn(x is convex under some restrictions of the parameters involved. A kind of recurrence relation for Sn(x is established, and some numbers related to the generalized Bell numbers and their properties are investigated.

  14. Complexity of Ising Polynomials

    CERN Document Server

    Kotek, Tomer

    2011-01-01

    This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and external field. One may consider such an Ising system as a simple graph together with vertex and edge weight values. When these weights are considered indeterminates, the partition function for the constant case is a trivariate polynomial Z(G;x,y,z). This polynomial was studied with respect to its approximability by L. A. Goldberg, M. Jerrum and M. Patersonin 2003. Z(G;x,y,z) generalizes a bivariate polynomial Z(G;t,y), which was studied in by D. Andr\\'{e}n and K. Markstr\\"{o}m in 2009. We consider the complexity of Z(G;t,y) and Z(G;x,y,z) in comparison to that of the Tutte polynomial, which is well-known to be closely related to the Potts model in the absence of an external field. We show that Z(G;\\x,\\y,\\z) is #P-hard to evaluate at all points in $mathbb{Q}^3$, except those in ...

  15. The short toric polynomial

    CERN Document Server

    Hetyei, Gábor

    2010-01-01

    We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as the two toric polynomials introduced by Stanley, but allows different algebraic manipulations. The intertwined recurrence defining Stanley's toric polynomials may be replaced by a single recurrence, in which the degree of the discarded terms is independent of the rank. A short toric variant of the formula by Bayer and Ehrenborg, expressing the toric $h$-vector in terms of the $cd$-index, may be stated in a rank-independent form, and it may be shown using weighted lattice path enumeration and the reflection principle. We use our techniques to derive a formula expressing the toric $h$-vector of a dual simplicial Eulerian poset in terms of its $f$-vector. This formula implies Gessel's formula for the toric $h$-vector of a cube, and may be used to prove that the nonnegativity of the toric $h$-vector of a simple polytope is a consequence of the Generalized Lower Bound Theorem holding for ...

  16. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

    KAUST Repository

    Mueller, Axel

    2016-02-29

    Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively “antenna-efficient” regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

  17. ON PROPERTIES OF DIFFERENCE POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    Chen Zongxuan; Huang Zhibo; Zheng Xiumin

    2011-01-01

    We study the value distribution of difference polynomials of meromorphic functions, and extend classical theorems of Tumura-Clunie type to difference polynomials. We also consider the value distribution of f(z)f(z+c).

  18. Computing the Alexander Polynomial Numerically

    DEFF Research Database (Denmark)

    Hansen, Mikael Sonne

    2006-01-01

    Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically.......Explains how to construct the Alexander Matrix and how this can be used to compute the Alexander polynomial numerically....

  19. Explicit Formulas for Meixner Polynomials

    Directory of Open Access Journals (Sweden)

    Dmitry V. Kruchinin

    2015-01-01

    Full Text Available Using notions of composita and composition of generating functions, we show an easy way to obtain explicit formulas for some current polynomials. Particularly, we consider the Meixner polynomials of the first and second kinds.

  20. Improvement on polynomial Wigner-Ville distribution for detecting higher-order polynomial phase signal

    Institute of Scientific and Technical Information of China (English)

    Tan Xiaogang; Wei Ping; Li Liping

    2009-01-01

    To detect higher order polynomial phase signals (HOPPSs), the smoothed-pseudo polynomial Wigner-Ville distribution (SP-PWVD), an improved version of the polynomial Wigner-Ville distribution (PWVD), is pre-sented using a separable kernel. By adjusting the lengths of the functions in the kernel, the balance between resolution retaining and interference suppressing can be adjusted conveniently. The proposed method with merits of interference terms reduction and noise suppression can provide time frequency representation of better readability and more accurate instantaneous frequency (IF) estimation with higher order SP-PWVD. The performance of the SP-PWVD is verified by computer simulations.

  1. Submicroscopic Deterministic Quantum Mechanics

    CERN Document Server

    Krasnoholovets, V

    2002-01-01

    So-called hidden variables introduced in quantum mechanics by de Broglie and Bohm have changed their initial enigmatic meanings and acquired quite reasonable outlines of real and measurable characteristics. The start viewpoint was the following: All the phenomena, which we observe in the quantum world, should reflect structural properties of the real space. Thus the scale 10^{-28} cm at which three fundamental interactions (electromagnetic, weak, and strong) intersect has been treated as the size of a building block of the space. The appearance of a massive particle is associated with a local deformation of the cellular space, i.e. deformation of a cell. The mechanics of a moving particle that has been constructed is deterministic by its nature and shows that the particle interacts with cells of the space creating elementary excitations called "inertons". The further study has disclosed that inertons are a substructure of the matter waves which are described by the orthodox wave \\psi-function formalism. The c...

  2. Chromatic polynomials for simplicial complexes

    DEFF Research Database (Denmark)

    Møller, Jesper Michael; Nord, Gesche

    2016-01-01

    In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r r is the n...

  3. Interpolation and Polynomial Curve Fitting

    Science.gov (United States)

    Yang, Yajun; Gordon, Sheldon P.

    2014-01-01

    Two points determine a line. Three noncollinear points determine a quadratic function. Four points that do not lie on a lower-degree polynomial curve determine a cubic function. In general, n + 1 points uniquely determine a polynomial of degree n, presuming that they do not fall onto a polynomial of lower degree. The process of finding such a…

  4. On Q-derived polynomials

    NARCIS (Netherlands)

    R.J. Stroeker (Roel)

    2002-01-01

    textabstractA Q-derived polynomial is a univariate polynomial, defined over the rationals, with the property that its zeros, and those of all its derivatives are rational numbers. There is a conjecture that says that Q-derived polynomials of degree 4 with distinct roots for themselves and all their

  5. On Q-derived polynomials

    NARCIS (Netherlands)

    R.J. Stroeker (Roel)

    2006-01-01

    textabstractA Q-derived polynomial is a univariate polynomial, defined over the rationals, with the property that its zeros, and those of all its derivatives are rational numbers. There is a conjecture that says that Q-derived polynomials of degree 4 with distinct roots for themselves and all their

  6. Polynomial Algebra in Form 4

    Science.gov (United States)

    Kuipers, J.

    2012-06-01

    New features of the symbolic algebra package Form 4 are discussed. Most importantly, these features include polynomial factorization and polynomial gcd computation. Examples of their use are shown. One of them is an exact version of Mincer which gives answers in terms of rational polynomials and 5 master integrals.

  7. Determinants and Polynomial Root Structure

    Science.gov (United States)

    De Pillis, L. G.

    2005-01-01

    A little known property of determinants is developed in a manner accessible to beginning undergraduates in linear algebra. Using the language of matrix theory, a classical result by Sylvester that describes when two polynomials have a common root is recaptured. Among results concerning the structure of polynomial roots, polynomials with pairs of…

  8. Comparison of some classification algorithms based on deterministic and nondeterministic decision rules

    KAUST Repository

    Delimata, Paweł

    2010-01-01

    We discuss two, in a sense extreme, kinds of nondeterministic rules in decision tables. The first kind of rules, called as inhibitory rules, are blocking only one decision value (i.e., they have all but one decisions from all possible decisions on their right hand sides). Contrary to this, any rule of the second kind, called as a bounded nondeterministic rule, can have on the right hand side only a few decisions. We show that both kinds of rules can be used for improving the quality of classification. In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules. We also present an application of bounded nondeterministic rules in construction of rule based classifiers. We include the results of experiments showing that by combining rule based classifiers based on minimal decision rules with bounded nondeterministic rules having confidence close to 1 and sufficiently large support, it is possible to improve the classification quality. © 2010 Springer-Verlag.

  9. Orthogonal polynomials and random matrices

    CERN Document Server

    Deift, Percy

    2000-01-01

    This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.

  10. Error Minimization of Polynomial Approximation of Delta

    Indian Academy of Sciences (India)

    Islam Sana; Sadiq Muhammad; Qureshi Muhammad Shahid

    2008-09-01

    The difference between Universal time (UT) and Dynamical time (TD), known as Delta ( ) is tabulated for the first day of each year in the Astronomical Almanac. During the last four centuries it is found that there are large differences between its values for two consecutive years. Polynomial approximations have been developed to obtain the values of for any time of a year for the period AD 1620 to AD 2000 (Meeu 2000) as no dynamical theories describe the variations in . In this work, a new set of polynomials for is obtained for the period AD 1620 to AD 2007 that is found to produce better results compared to previous attempts.

  11. Polynomial chaos expansion in structural dynamics: Accelerating the convergence of the first two statistical moment sequences

    Science.gov (United States)

    Jacquelin, E.; Adhikari, S.; Sinou, J.-J.; Friswell, M. I.

    2015-11-01

    Polynomial chaos solution for the frequency response of linear non-proportionally damped dynamic systems has been considered. It has been observed that for lightly damped systems the convergence of the solution can be very poor in the vicinity of the deterministic resonance frequencies. To address this, Aitken's transformation and its generalizations are suggested. The proposed approach is successfully applied to the sequences defined by the first two moments of the responses, and this process significantly accelerates the polynomial chaos convergence. In particular, a 2-dof system with respectively 1 and 2 parameter uncertainties has been studied. The first two moments of the frequency response were calculated by Monte Carlo simulation, polynomial chaos expansion and Aitken's transformation of the polynomial chaos expansion. Whereas 200 polynomials are required to have a good agreement with Monte Carlo results around the deterministic eigenfrequencies, less than 50 polynomials transformed by the Aitken's method are enough. This latter result is improved if a generalization of Aitken's method (recursive Aitken's transformation, Shank's transformation) is applied. With the proposed convergence acceleration, polynomial chaos may be reconsidered as an efficient method to estimate the first two moments of a random dynamic response.

  12. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    or meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... of parameter spaces into structurally stable domains, and a description of the bifurcations. For this reason, the talk will focus on these questions for complex polynomial vector fields....

  13. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... of parameter spaces into structurally stable domains, and a description of the bifurcations. For this reason, the talk will focus on these questions for complex polynomial vector fields....

  14. A Characterization of Polynomials

    DEFF Research Database (Denmark)

    Andersen, Kurt Munk

    1996-01-01

    Given the problem:which functions f(x) are characterized by a relation of the form:f[x1,x2,...,xn]=h(x1+x2+...+xn), where n>1 and h(x) is a given function? Here f[x1,x2,...,xn] denotes the divided difference on n points x1,x2,...,xn of the function f(x).The answer is: f(x) is a polynomial of degree...

  15. Some discrete multiple orthogonal polynomials

    Science.gov (United States)

    Arvesú, J.; Coussement, J.; van Assche, W.

    2003-04-01

    In this paper, we extend the theory of discrete orthogonal polynomials (on a linear lattice) to polynomials satisfying orthogonality conditions with respect to r positive discrete measures. First we recall the known results of the classical orthogonal polynomials of Charlier, Meixner, Kravchuk and Hahn (T.S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978; R. Koekoek and R.F. Swarttouw, Reports of the Faculty of Technical Mathematics and Informatics No. 98-17, Delft, 1998; A.F. Nikiforov et al., Classical Orthogonal Polynomials of a Discrete Variable, Springer, Berlin, 1991). These polynomials have a lowering and raising operator, which give rise to a Rodrigues formula, a second order difference equation, and an explicit expression from which the coefficients of the three-term recurrence relation can be obtained. Then we consider r positive discrete measures and define two types of multiple orthogonal polynomials. The continuous case (Jacobi, Laguerre, Hermite, etc.) was studied by Van Assche and Coussement (J. Comput. Appl. Math. 127 (2001) 317-347) and Aptekarev et al. (Multiple orthogonal polynomials for classical weights, manuscript). The families of multiple orthogonal polynomials (of type II) that we will study have a raising operator and hence a Rodrigues formula. This will give us an explicit formula for the polynomials. Finally, there also exists a recurrence relation of order r+1 for these multiple orthogonal polynomials of type II. We compute the coefficients of the recurrence relation explicitly when r=2.

  16. Spreading lengths of Hermite polynomials

    CERN Document Server

    Sánchez-Moreno, P; Manzano, D; Yáñez, R; 10.1016/j.cam.2009.09.043

    2009-01-01

    The Renyi, Shannon and Fisher spreading lengths of the classical or hypergeometric orthogonal polynomials, which are quantifiers of their distribution all over the orthogonality interval, are defined and investigated. These information-theoretic measures of the associated Rakhmanov probability density, which are direct measures of the polynomial spreading in the sense of having the same units as the variable, share interesting properties: invariance under translations and reflections, linear scaling and vanishing in the limit that the variable tends towards a given definite value. The expressions of the Renyi and Fisher lengths for the Hermite polynomials are computed in terms of the polynomial degree. The combinatorial multivariable Bell polynomials, which are shown to characterize the finite power of an arbitrary polynomial, play a relevant role for the computation of these information-theoretic lengths. Indeed these polynomials allow us to design an error-free computing approach for the entropic moments (w...

  17. Oblivious Polynomial Evaluation

    Institute of Scientific and Technical Information of China (English)

    Hong-Da Li; Dong-Yao Ji; Deng-Guo Feng; Bao Li

    2004-01-01

    The problem of two-party oblivious polynomial evaluation(OPE)is studied,where one party(Alice)has a polynomial P(x)and the other party(Bob)with an input x wants to learn P(x)in such an oblivious way that Bob obtains P(x)without learning any additional information about P except what is implied by P(x)and Alice does not know Bob's input x.The former OPE protocols are based on an intractability assumption except for OT protocols.In fact,evaluating P(x)is equivalent to computing the product of the coefficient vectors(a0,...,an)and(1,...,xn).Using this idea,an efficient scale product protocol of two vectors is proposed first and then two OPE protocols are presented which do not need any other cryptographic assumption except for OT protocol.Compared with the existing OPE protocol,another characteristic of the proposed protocols is the degree of the polynomial is private.Another OPE protocol works in case of existence of untrusted third party.

  18. Dynamic optimization deterministic and stochastic models

    CERN Document Server

    Hinderer, Karl; Stieglitz, Michael

    2016-01-01

    This book explores discrete-time dynamic optimization and provides a detailed introduction to both deterministic and stochastic models. Covering problems with finite and infinite horizon, as well as Markov renewal programs, Bayesian control models and partially observable processes, the book focuses on the precise modelling of applications in a variety of areas, including operations research, computer science, mathematics, statistics, engineering, economics and finance. Dynamic Optimization is a carefully presented textbook which starts with discrete-time deterministic dynamic optimization problems, providing readers with the tools for sequential decision-making, before proceeding to the more complicated stochastic models. The authors present complete and simple proofs and illustrate the main results with numerous examples and exercises (without solutions). With relevant material covered in four appendices, this book is completely self-contained.

  19. Piecewise deterministic processes in biological models

    CERN Document Server

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

  20. Introducing Synchronisation in Deterministic Network Models

    DEFF Research Database (Denmark)

    Schiøler, Henrik; Jessen, Jan Jakob; Nielsen, Jens Frederik D.;

    2006-01-01

    The paper addresses performance analysis for distributed real time systems through deterministic network modelling. Its main contribution is the introduction and analysis of models for synchronisation between tasks and/or network elements. Typical patterns of synchronisation are presented leading....... The suggested models are intended for incorporation into an existing analysis tool a.k.a. CyNC based on the MATLAB/SimuLink framework for graphical system analysis and design....

  1. POLYNOMIAL RECURRENCE FOR L(E)VY PROCESSES

    Institute of Scientific and Technical Information of China (English)

    ZHAO MINZHI; YING JIANGANG

    2004-01-01

    In this paper, the authors study the ω-transience and ω-recurrence for Lévy processes with any weight function ω, give a relation between ω-recurrence and the last exit times. As a special case, the polynomial recurrence and polynomial transience are also studied.

  2. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...... or meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...

  3. Multivariable q-Racah polynomials

    CERN Document Server

    Van Diejen, J F

    1996-01-01

    The Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials is studied for parameters satisfying a truncation condition such that the orthogonality measure becomes discrete with support on a finite grid. For this parameter regime the polynomials may be seen as a multivariable counterpart of the (one-variable) q-Racah polynomials. We present the discrete orthogonality measure, expressions for the normalization constants converting the polynomials into an orthonormal system (in terms of the normalization constant for the unit polynomial), and we discuss the limit q\\rightarrow 1 leading to multivariable Racah type polynomials. Of special interest is the situation that q lies on the unit circle; in that case it is found that there exists a natural parameter domain for which the discrete orthogonality measure (which is complex in general) becomes real-valued and positive. We investigate the properties of a finite-dimensional discrete integral transform for functions over the grid, whose ...

  4. Symmetric functions and Hall polynomials

    CERN Document Server

    MacDonald, Ian Grant

    1998-01-01

    This reissued classic text is the acclaimed second edition of Professor Ian Macdonald's groundbreaking monograph on symmetric functions and Hall polynomials. The first edition was published in 1979, before being significantly expanded into the present edition in 1995. This text is widely regarded as the best source of information on Hall polynomials and what have come to be known as Macdonald polynomials, central to a number of key developments in mathematics and mathematical physics in the 21st century Macdonald polynomials gave rise to the subject of double affine Hecke algebras (or Cherednik algebras) important in representation theory. String theorists use Macdonald polynomials to attack the so-called AGT conjectures. Macdonald polynomials have been recently used to construct knot invariants. They are also a central tool for a theory of integrable stochastic models that have found a number of applications in probability, such as random matrices, directed polymers in random media, driven lattice gases, and...

  5. Witt Rings and Permutation Polynomials

    Institute of Scientific and Technical Information of China (English)

    Qifan Zhang

    2005-01-01

    Let p be a prime number. In this paper, the author sets up a canonical correspondence between polynomial functions over Z/p2Z and 3-tuples of polynomial functions over Z/pZ. Based on this correspondence, he proves and reproves some fundamental results on permutation polynomials mod pl. The main new result is the characterization of strong orthogonal systems over Z/p1Z.

  6. Polynomial Regression on Riemannian Manifolds

    CERN Document Server

    Hinkle, Jacob; Fletcher, P Thomas; Joshi, Sarang

    2012-01-01

    In this paper we develop the theory of parametric polynomial regression in Riemannian manifolds and Lie groups. We show application of Riemannian polynomial regression to shape analysis in Kendall shape space. Results are presented, showing the power of polynomial regression on the classic rat skull growth data of Bookstein as well as the analysis of the shape changes associated with aging of the corpus callosum from the OASIS Alzheimer's study.

  7. Chaotic time series. Part II. System Identification and Prediction

    Directory of Open Access Journals (Sweden)

    Bjørn Lillekjendlie

    1994-10-01

    Full Text Available This paper is the second in a series of two, and describes the current state of the art in modeling and prediction of chaotic time series. Sample data from deterministic non-linear systems may look stochastic when analysed with linear methods. However, the deterministic structure may be uncovered and non-linear models constructed that allow improved prediction. We give the background for such methods from a geometrical point of view, and briefly describe the following types of methods: global polynomials, local polynomials, multilayer perceptrons and semi-local methods including radial basis functions. Some illustrative examples from known chaotic systems are presented, emphasising the increase in prediction error with time. We compare some of the algorithms with respect to prediction accuracy and storage requirements, and list applications of these methods to real data from widely different areas.

  8. Chaotic time series; 2, system identification and prediction

    CERN Document Server

    Lillekjendlie, B

    1994-01-01

    This paper is the second in a series of two, and describes the current state of the art in modelling and prediction of chaotic time series. Sampled data from deterministic non-linear systems may look stochastic when analysed with linear methods. However, the deterministic structure may be uncovered and non-linear models constructed that allow improved prediction. We give the background for such methods from a geometrical point of view, and briefly describe the following types of methods: global polynomials, local polynomials, multi layer perceptrons and semi-local methods including radial basis functions. Some illustrative examples from known chaotic systems are presented, emphasising the increase in prediction error with time. We compare some of the algorithms with respect to prediction accuracy and storage requirements, and list applications of these methods to real data from widely different areas.

  9. Superoscillations with arbitrary polynomial shape

    Science.gov (United States)

    Chremmos, Ioannis; Fikioris, George

    2015-07-01

    We present a method for constructing superoscillatory functions the superoscillatory part of which approximates a given polynomial with arbitrarily small error in a fixed interval. These functions are obtained as the product of the polynomial with a sufficiently flat, bandlimited envelope function whose Fourier transform has at least N-1 continuous derivatives and an Nth derivative of bounded variation, N being the order of the polynomial. Polynomials of arbitrarily high order can be approximated if the Fourier transform of the envelope is smooth, i.e. a bump function.

  10. Modeling of deterministic chaotic systems

    Energy Technology Data Exchange (ETDEWEB)

    Lai, Y. [Department of Physics and Astronomy and Department of Mathematics, The University of Kansas, Lawrence, Kansas 66045 (United States); Grebogi, C. [Institute for Plasma Research, University of Maryland, College Park, Maryland 20742 (United States); Grebogi, C.; Kurths, J. [Department of Physics and Astrophysics, Universitaet Potsdam, Postfach 601553, D-14415 Potsdam (Germany)

    1999-03-01

    The success of deterministic modeling of a physical system relies on whether the solution of the model would approximate the dynamics of the actual system. When the system is chaotic, situations can arise where periodic orbits embedded in the chaotic set have distinct number of unstable directions and, as a consequence, no model of the system produces reasonably long trajectories that are realized by nature. We argue and present physical examples indicating that, in such a case, though the model is deterministic and low dimensional, statistical quantities can still be reliably computed. {copyright} {ital 1999} {ital The American Physical Society}

  11. Interference Decoding for Deterministic Channels

    CERN Document Server

    Bandemer, Bernd

    2010-01-01

    An inner bound to the capacity region of a class of three user pair deterministic interference channels is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver. It is shown that this interference decoding inner bound is strictly larger than the inner bound obtained by treating interference as noise, which includes interference alignment for deterministic channels. The gain comes from judicious analysis of the number of combined interference sequences in different regimes of input distributions and message rates.

  12. Derivations and identities for Kravchuk polynomials

    OpenAIRE

    Bedratyuk, Leonid

    2012-01-01

    We introduce the notion of Kravchuk derivations of the polynomial algebra. We prove that any element of the kernel of the derivation gives a polynomial identity satisfied by the Kravchuk polynomials. Also, we prove that any kernel element of the basic Weitzenb\\"ok derivations yields a polynomial identity satisfied by the Kravchuk polynomials. We describe the corresponding intertwining maps.

  13. Some New Formulae for Genocchi Numbers and Polynomials Involving Bernoulli and Euler Polynomials

    Directory of Open Access Journals (Sweden)

    Serkan Araci

    2014-01-01

    Full Text Available We give some new formulae for product of two Genocchi polynomials including Euler polynomials and Bernoulli polynomials. Moreover, we derive some applications for Genocchi polynomials to study a matrix formulation.

  14. A Method to Separate Stochastic and Deterministic Information from Electrocardiograms

    CERN Document Server

    Gutíerrez, R M

    2004-01-01

    In this work we present a new idea to develop a method to separate stochastic and deterministic information contained in an electrocardiogram, ECG, which may provide new sources of information with diagnostic purposes. We assume that the ECG has information corresponding to many different processes related with the cardiac activity as well as contamination from different sources related with the measurement procedure and the nature of the observed system itself. The method starts with the application of an improuved archetypal analysis to separate the mentioned stochastic and deterministic information. From the stochastic point of view we analyze Renyi entropies, and with respect to the deterministic perspective we calculate the autocorrelation function and the corresponding correlation time. We show that healthy and pathologic information may be stochastic and/or deterministic, can be identified by different measures and located in different parts of the ECG.

  15. Optimization over polynomials: Selected topics

    NARCIS (Netherlands)

    M. Laurent (Monique); S.Y. Jang; Y.R. Kim; D.-W. Lee; I. Yie

    2014-01-01

    htmlabstractMinimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometry and optimization. New algorithmic approaches have emerged recently for computing the global minimum, by combining tools from real algebra

  16. Parallel Construction of Irreducible Polynomials

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg

    Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic circuits over the finite prime field GF(p) of depth O(log^k (n + p)) and size polynomial in (n + p). We show that the problem of constructing an irreducible polynomial of specified degree over GF(p) ...

  17. Height-Deterministic Pushdown Automata

    DEFF Research Database (Denmark)

    Nowotka, Dirk; Srba, Jiri

    2007-01-01

    of regular languages and still closed under boolean language operations, are considered. Several of such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata...

  18. Polynomial methods in combinatorics

    CERN Document Server

    Guth, Larry

    2016-01-01

    This book explains some recent applications of the theory of polynomials and algebraic geometry to combinatorics and other areas of mathematics. One of the first results in this story is a short elegant solution of the Kakeya problem for finite fields, which was considered a deep and difficult problem in combinatorial geometry. The author also discusses in detail various problems in incidence geometry associated to Paul Erdős's famous distinct distances problem in the plane from the 1940s. The proof techniques are also connected to error-correcting codes, Fourier analysis, number theory, and differential geometry. Although the mathematics discussed in the book is deep and far-reaching, it should be accessible to first- and second-year graduate students and advanced undergraduates. The book contains approximately 100 exercises that further the reader's understanding of the main themes of the book. Some of the greatest advances in geometric combinatorics and harmonic analysis in recent years have been accompl...

  19. Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    The two branches of dynamical systems, continuous and discrete, correspond to the study of differential equations (vector fields) and iteration of mappings respectively. In holomorphic dynamics, the systems studied are restricted to those described by holomorphic (complex analytic) functions...... or meromorphic (allowing poles as singularities) functions. There already exists a well-developed theory for iterative holomorphic dynamical systems, and successful relations found between iteration theory and flows of vector fields have been one of the main motivations for the recent interest in holomorphic...... vector fields. Since the class of complex polynomial vector fields in the plane is natural to consider, it is remarkable that its study has only begun very recently. There are numerous fundamental questions that are still open, both in the general classification of these vector fields, the decomposition...

  20. Quantum Chemistry on Quantum Computers: A Polynomial-Time Quantum Algorithm for Constructing the Wave Functions of Open-Shell Molecules.

    Science.gov (United States)

    Sugisaki, Kenji; Yamamoto, Satoru; Nakazawa, Shigeaki; Toyota, Kazuo; Sato, Kazunobu; Shiomi, Daisuke; Takui, Takeji

    2016-08-18

    Quantum computers are capable to efficiently perform full configuration interaction (FCI) calculations of atoms and molecules by using the quantum phase estimation (QPE) algorithm. Because the success probability of the QPE depends on the overlap between approximate and exact wave functions, efficient methods to prepare accurate initial guess wave functions enough to have sufficiently large overlap with the exact ones are highly desired. Here, we propose a quantum algorithm to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum. The proposed quantum algorithm enables us to prepare the wave function consisting of an exponential number of Slater determinants only by a polynomial number of quantum operations.

  1. Deterministic Compressed Sensing

    Science.gov (United States)

    2011-11-01

    among the most productive and elated times I spent in Princeton. I specially enjoyed the teamwork among the members. By working on this project, I...his visit at Princeton, leading to several publications in the last year of my Ph.D. I also thank Maryam Fazel, Mo- hammadTaghi Hajiaghayi, Henry ...A survey of some recent advances. ESAIM: Probability and Statistics, 9:323–375, 2005. [39] J. Bourgain, S. J. Dilworth, K. Ford , S. Konyagin, and D

  2. The number of polynomial solutions of polynomial Riccati equations

    Science.gov (United States)

    Gasull, Armengol; Torregrosa, Joan; Zhang, Xiang

    2016-11-01

    Consider real or complex polynomial Riccati differential equations a (x) y ˙ =b0 (x) +b1 (x) y +b2 (x)y2 with all the involved functions being polynomials of degree at most η. We prove that the maximum number of polynomial solutions is η + 1 (resp. 2) when η ≥ 1 (resp. η = 0) and that these bounds are sharp. For real trigonometric polynomial Riccati differential equations with all the functions being trigonometric polynomials of degree at most η ≥ 1 we prove a similar result. In this case, the maximum number of trigonometric polynomial solutions is 2η (resp. 3) when η ≥ 2 (resp. η = 1) and, again, these bounds are sharp. Although the proof of both results has the same starting point, the classical result that asserts that the cross ratio of four different solutions of a Riccati differential equation is constant, the trigonometric case is much more involved. The main reason is that the ring of trigonometric polynomials is not a unique factorization domain.

  3. Prime power polynomial maps over finite fields

    CERN Document Server

    Berson, Joost

    2012-01-01

    We consider polynomial maps described by so-called prime power polynomials. These polynomials are defined using a fixed power of a prime number, say q. Considering invertible polynomial maps of this type over a characteristic zero field, we will only obtain (up to permutation of the variables) triangular maps, which are the most basic examples of polynomial automorphisms. However, over the finite field F_q automorphisms of this type have (in general) an entirely different structure. Namely, we will show that the prime power polynomial maps over F_q are in one-to-one correspondence with matrices having coefficients in a univariate polynomial ring over F_q. Furthermore, composition of polynomial maps translates to matrix multiplication, implying that invertible prime power polynomial maps correspond to invertible matrices. This alternate description of the prime power polynomial automorphism subgroup leads to the solution of many famous conjectures for this kind of polynomials and polynomial maps.

  4. Exploiting deterministic maintenance opportunity windows created by conservative engineering design rules that result in free time locked into large high-speed coupled production lines with finite buffers

    Directory of Open Access Journals (Sweden)

    Durandt, Casper

    2016-08-01

    Full Text Available Conservative engineering design rules for large serial coupled production processes result in machines having locked-in free time (also called ‘critical downtime’ or ‘maintenance opportunity windows’, which cause idle time if not used. Operators are not able to assess a large production process holistically, and so may not be aware that they form the current bottleneck – or that they have free time available due to interruptions elsewhere. A real-time method is developed to accurately calculate and display free time in location and magnitude, and efficiency improvements are demonstrated in large-scale production runs.

  5. Deterministic extraction from weak random sources

    CERN Document Server

    Gabizon, Ariel

    2011-01-01

    In this research monograph, the author constructs deterministic extractors for several types of sources, using a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length.

  6. Befriending Askey-Wilson polynomials

    CERN Document Server

    Szabłowski, Paweł J

    2011-01-01

    Although our main interest is with the Askey-Wilson (AW) polynomials we recall and review four other families of the so-called Askey-Wilson scheme of polynomials. We do this for completeness as well as for better exposition of AW properties. Our main results concentrate on the complex parameters case, revealing new fascinating symmetries between the variables and some of the parameters. In particular we express Askey-Wilson polynomials as linear combinations of Al-Salam--Chihara (ASC) polynomials which together with the obtained earlier expansion of the Askey-Wilson density forms complete generalization of the situation met in the case of Al-Salam--Chihara and q-Hermite polynomials and the Poisson-Mehler expansion formula. As a by-product we get useful identities involving ASC polynomials. Finally by certain re-scaling of variables and parameters we arrive to AW polynomials and AW densities that have clear probabilistic interpretation. We recall some known and present some believed to be unknown identities an...

  7. Hadamard Factorization of Stable Polynomials

    Science.gov (United States)

    Loredo-Villalobos, Carlos Arturo; Aguirre-Hernández, Baltazar

    2011-11-01

    The stable (Hurwitz) polynomials are important in the study of differential equations systems and control theory (see [7] and [19]). A property of these polynomials is related to Hadamard product. Consider two polynomials p,q ∈ R[x]:p(x) = anxn+an-1xn-1+...+a1x+a0q(x) = bmx m+bm-1xm-1+...+b1x+b0the Hadamard product (p × q) is defined as (p×q)(x) = akbkxk+ak-1bk-1xk-1+...+a1b1x+a0b0where k = min(m,n). Some results (see [16]) shows that if p,q ∈R[x] are stable polynomials then (p×q) is stable, also, i.e. the Hadamard product is closed; however, the reciprocal is not always true, that is, not all stable polynomial has a factorization into two stable polynomials the same degree n, if n> 4 (see [15]).In this work we will give some conditions to Hadamard factorization existence for stable polynomials.

  8. Analysis of FBC deterministic chaos

    Energy Technology Data Exchange (ETDEWEB)

    Daw, C.S.

    1996-06-01

    It has recently been discovered that the performance of a number of fossil energy conversion devices such as fluidized beds, pulsed combustors, steady combustors, and internal combustion engines are affected by deterministic chaos. It is now recognized that understanding and controlling the chaotic elements of these devices can lead to significantly improved energy efficiency and reduced emissions. Application of these techniques to key fossil energy processes are expected to provide important competitive advantages for U.S. industry.

  9. Inapproximability of the Tutte polynomial of a planar graph

    CERN Document Server

    Goldberg, Leslie Ann

    2009-01-01

    The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: given as input a planar graph G, determine T(G;x,y). Vertigan completely mapped the complexity of exactly computing the Tutte polynomial of a planar graph. He showed that the problem can be solved in polynomial time if (x,y) is on the hyperbola H_q given by (x-1)(y-1)=q for q=1 or q=2 or if (x,y) is one of the two special points (x,y)=(-1,-1) or (x,y)=(1,1). Otherwise, the problem is #P-hard. In this paper, we consider the problem of approximating T(G;x,y), in the usual sense of "fully polynomial randomised approximation scheme" or FPRAS. Roughly speaking, an FPRAS is required to produce, in polynomial time and with high probability, an answer that has small relative error. Assuming that NP is different from RP, we show that there is no FPRAS for the Tutte polynomial in a large portion of the (x,y) plane. In part...

  10. Locally tame plane polynomial automorphisms

    CERN Document Server

    Berson, Joost; Furter, Jean-Philippe; Maubach, Stefan

    2010-01-01

    For automorphisms of a polynomial ring in two variables over a domain R, we show that local tameness implies global tameness provided that every 2-generated invertible R-module is free. We give many examples illustrating this property.

  11. Polynomial complexity algorithm for Max-Cut problem

    CERN Document Server

    Katkov, Mikhail

    2010-01-01

    The standard NP-complete max-cut problem is reformulated as a binary quadratic program xQx s.t x^2=1. This problem is further reformulated as global minimum of quartic polynomial (xQ'x - z)^2 + \\sum_i (x_i^2-1)^2+ \\alpha z^2, for some \\alpha. The global minimum is found by polynomial complexity semi-definite program. Numerical examples and code is provided. The resulting algorithm solves arbitrary max-cut problem in polynomial time, therefore P=NP.

  12. Stochastic Estimation via Polynomial Chaos

    Science.gov (United States)

    2015-10-01

    TΨ is a vector with P+1 elements. With these dimensions, (29) is solvable by standard numerical linear algebra techniques. The specific matrix...initial conditions for partial differential equations. Here, the elementary theory of the polynomial chaos is presented followed by the details of a...the elementary theory of the polynomial chaos is presented followed by the details of a number of example calculations where the statistical mean and

  13. Multi-scale dynamical behavior of spatially distributed systems: a deterministic point of view

    Science.gov (United States)

    Mangiarotti, S.; Le Jean, F.; Drapeau, L.; Huc, M.

    2015-12-01

    Physical and biophysical systems are spatially distributed systems. Their behavior can be observed or modelled spatially at various resolutions. In this work, a deterministic point of view is adopted to analyze multi-scale behavior taking a set of ordinary differential equation (ODE) as elementary part of the system.To perform analyses, scenes of study are thus generated based on ensembles of identical elementary ODE systems. Without any loss of generality, their dynamics is chosen chaotic in order to ensure sensitivity to initial conditions, that is, one fundamental property of atmosphere under instable conditions [1]. The Rössler system [2] is used for this purpose for both its topological and algebraic simplicity [3,4].Two cases are thus considered: the chaotic oscillators composing the scene of study are taken either independent, or in phase synchronization. Scale behaviors are analyzed considering the scene of study as aggregations (basically obtained by spatially averaging the signal) or as associations (obtained by concatenating the time series). The global modeling technique is used to perform the numerical analyses [5].One important result of this work is that, under phase synchronization, a scene of aggregated dynamics can be approximated by the elementary system composing the scene, but modifying its parameterization [6]. This is shown based on numerical analyses. It is then demonstrated analytically and generalized to a larger class of ODE systems. Preliminary applications to cereal crops observed from satellite are also presented.[1] Lorenz, Deterministic nonperiodic flow. J. Atmos. Sci., 20, 130-141 (1963).[2] Rössler, An equation for continuous chaos, Phys. Lett. A, 57, 397-398 (1976).[3] Gouesbet & Letellier, Global vector-field reconstruction by using a multivariate polynomial L2 approximation on nets, Phys. Rev. E 49, 4955-4972 (1994).[4] Letellier, Roulin & Rössler, Inequivalent topologies of chaos in simple equations, Chaos, Solitons

  14. On the Hermite-Apostol-Genocchi Polynomials

    Science.gov (United States)

    Kurt, Veli; Kurt, Burak

    2011-09-01

    In this study, we introduce and investigate the Hermite-Apostol-Genocchi polynomials by means of a suitable generating function. We establish several interesting properties of these general polynomials. Also, we prove two theorems between 2-dimensional Hermite polynomials and Hermite-Apostol-Genocchi polynomials.

  15. On chromatic and flow polynomial unique graphs

    National Research Council Canada - National Science Library

    Duan, Yinghua; Wu, Haidong; Yu, Qinglin

    2008-01-01

    ... research on graphs uniquely determined by their chromatic polynomials and more recently on their Tutte polynomials, but rather spotty research on graphs uniquely determined by their flow polynomials or the combination of both chromatic and flow polynomials. This article is an initiation of investigation on graphs uniquely determin...

  16. Properties of Leach-Flessas-Gorringe polynomials

    Science.gov (United States)

    Pursey, D. L.

    1990-09-01

    A generating function is obtained for the polynomials recently introduced by Leach, Flessas, and Gorringe [J. Math. Phys. 30, 406 (1989)], and is then used to relate the Leach-Flessas-Gorringe (or LFG) polynomials to Hermite polynomials. The generating function is also used to express a number of integrals involving the LFG polynomials as finite sums of parabolic cylinder functions.

  17. Birth-death processes and associated polynomials

    NARCIS (Netherlands)

    Doorn, van Erik A.

    2003-01-01

    We consider birth-death processes on the nonnegative integers and the corresponding sequences of orthogonal polynomials called birth-death polynomials. The sequence of associated polynomials linked with a sequence of birth-death polynomials and its orthogonalizing measure can be used in the analysis

  18. Uniqueness and Zeros of -Shift Difference Polynomials

    Indian Academy of Sciences (India)

    Kai Liu; Xin-Ling Liu; Ting-Bin Cao

    2011-08-01

    In this paper, we consider the zero distributions of -shift difference polynomials of meromorphic functions with zero order, and obtain two theorems that extend the classical Hayman results on the zeros of differential polynomials to -shift difference polynomials. We also investigate the uniqueness problem of -shift difference polynomials that share a common value.

  19. Deterministic prediction of surface wind speed variations

    Science.gov (United States)

    Drisya, G. V.; Kiplangat, D. C.; Asokan, K.; Satheesh Kumar, K.

    2014-11-01

    Accurate prediction of wind speed is an important aspect of various tasks related to wind energy management such as wind turbine predictive control and wind power scheduling. The most typical characteristic of wind speed data is its persistent temporal variations. Most of the techniques reported in the literature for prediction of wind speed and power are based on statistical methods or probabilistic distribution of wind speed data. In this paper we demonstrate that deterministic forecasting methods can make accurate short-term predictions of wind speed using past data, at locations where the wind dynamics exhibit chaotic behaviour. The predictions are remarkably accurate up to 1 h with a normalised RMSE (root mean square error) of less than 0.02 and reasonably accurate up to 3 h with an error of less than 0.06. Repeated application of these methods at 234 different geographical locations for predicting wind speeds at 30-day intervals for 3 years reveals that the accuracy of prediction is more or less the same across all locations and time periods. Comparison of the results with f-ARIMA model predictions shows that the deterministic models with suitable parameters are capable of returning improved prediction accuracy and capturing the dynamical variations of the actual time series more faithfully. These methods are simple and computationally efficient and require only records of past data for making short-term wind speed forecasts within practically tolerable margin of errors.

  20. Multi-particle dynamical systems and polynomials

    Science.gov (United States)

    Demina, Maria V.; Kudryashov, Nikolai A.

    2016-05-01

    Polynomial dynamical systems describing interacting particles in the plane are studied. A method replacing integration of a polynomial multi-particle dynamical system by finding polynomial solutions of partial differential equations is introduced. The method enables one to integrate a wide class of polynomial multi-particle dynamical systems. The general solutions of certain dynamical systems related to linear second-order partial differential equations are found. As a by-product of our results, new families of orthogonal polynomials are derived.

  1. Tabulating knot polynomials for arborescent knots

    CERN Document Server

    Mironov, A; Morozov, An; Sleptsov, A; Ramadevi, P; Singh, Vivek Kumar

    2016-01-01

    Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the level of effective analytical formulas. The paper describes the origin and structure of the new tables of colored knot polynomials, which will be posted at the dedicated site. Even if formal expressions are known in terms of modular transformation matrices, the computation in finite time requires additional ideas. We use the "family" approach, and apply it to arborescent knots in Rolfsen table by developing a Feynman diagram technique, associated with an auxiliary matrix model field theory. Gauge invariance in this theory helps to provide meaning to Racah matrices in the case of non-trivial multiplicities and explains the need for peculiar sign prescriptions in the calculation of [21]-colored HOMFLY polynomials.

  2. A deterministic width function model

    Directory of Open Access Journals (Sweden)

    C. E. Puente

    2003-01-01

    Full Text Available Use of a deterministic fractal-multifractal (FM geometric method to model width functions of natural river networks, as derived distributions of simple multifractal measures via fractal interpolating functions, is reported. It is first demonstrated that the FM procedure may be used to simulate natural width functions, preserving their most relevant features like their overall shape and texture and their observed power-law scaling on their power spectra. It is then shown, via two natural river networks (Racoon and Brushy creeks in the United States, that the FM approach may also be used to closely approximate existing width functions.

  3. Higher-Order Singular Systems and Polynomial Matrices

    OpenAIRE

    2005-01-01

    There is a one-to-one correspondence between the set of quadruples of matrices defining singular linear time-invariant dynamical systems and a subset of the set of polynomial matrices. This correspondence preserves the equivalence relations introduced in both sets (feedback-similarity and strict equivalence): two quadruples of matrices are feedback-equivalent if, and only if, the polynomial matrices associated to them are also strictly equivalent. Los sistemas lineales singulares...

  4. Simplified Storm Surge Simulations Using Bernstein Polynomials

    Science.gov (United States)

    Beisiegel, Nicole; Behrens, Jörn

    2016-04-01

    Storm surge simulations are vital for forecasting, hazard assessment and eventually improving our understanding of Earth system processes. Discontinuous Galerkin (DG) methods have recently been explored in that context, because they are locally mass-conservative and in combination with suitable robust nodal filtering techniques (slope limiters) positivity-preserving and well-balanced for the still water state at rest. These filters manipulate interpolation point values in every time step in order to retain the desirable properties of the scheme. In particular, DG methods are able to represent prognostic variables such as the fluid height at high-order accuracy inside each element (triangle). For simulations that include wetting and drying, however, the high-order accuracy will destabilize the numerical model because point values on quadrature points may become negative during the computation if they do not coincide with interpolation points. This is why the model that we are presenting utilizes Bernstein polynomials as basis functions to model the wetting and drying. This has the advantage that negative pointvalues away from interpolation points are prevented, the model is stabilized and no additional time step restriction is introduced. Numerical tests show that the model is capable of simulating simplified storm surges. Furthermore, a comparison of model results with third-order Bernstein polynomials with results using traditional nodal Lagrange polynomials reveals an improvement in numerical convergence.

  5. Modular polynomials via isogeny volcanoes

    CERN Document Server

    Broker, Reinier; Sutherland, Andrew V

    2010-01-01

    We present a new algorithm to compute the classical modular polynomial Phi_n in the rings Z[X,Y] and (Z/mZ)[X,Y], for a prime n and any positive integer m. Our approach uses the graph of n-isogenies to efficiently compute Phi_n mod p for many primes p of a suitable form, and then applies the Chinese Remainder Theorem (CRT). Under the Generalized Riemann Hypothesis (GRH), we achieve an expected running time of O(n^3 (log n)^3 log log n), and compute Phi_n mod m using O(n^2 (log n)^2 + n^2 log m) space. We have used the new algorithm to compute Phi_n with n over 5000, and Phi_n mod m with n over 20000. We also consider several modular functions g for which Phi_n^g is smaller than Phi_n, allowing us to handle n over 60000.

  6. A mathematical theory for deterministic quantum mechanics

    Energy Technology Data Exchange (ETDEWEB)

    Hooft, Gerard ' t [Institute for Theoretical Physics, Utrecht University (Netherlands); Spinoza Institute, Postbox 80.195, 3508 TD Utrecht (Netherlands)

    2007-05-15

    Classical, i.e. deterministic theories underlying quantum mechanics are considered, and it is shown how an apparent quantum mechanical Hamiltonian can be defined in such theories, being the operator that generates evolution in time. It includes various types of interactions. An explanation must be found for the fact that, in the real world, this Hamiltonian is bounded from below. The mechanism that can produce exactly such a constraint is identified in this paper. It is the fact that not all classical data are registered in the quantum description. Large sets of values of these data are assumed to be indistinguishable, forming equivalence classes. It is argued that this should be attributed to information loss, such as what one might suspect to happen during the formation and annihilation of virtual black holes. The nature of the equivalence classes follows from the positivity of the Hamiltonian. Our world is assumed to consist of a very large number of subsystems that may be regarded as approximately independent, or weakly interacting with one another. As long as two (or more) sectors of our world are treated as being independent, they all must be demanded to be restricted to positive energy states only. What follows from these considerations is a unique definition of energy in the quantum system in terms of the periodicity of the limit cycles of the deterministic model.

  7. Chromatic polynomials of random graphs

    Science.gov (United States)

    Van Bussel, Frank; Ehrlich, Christoph; Fliegner, Denny; Stolzenberg, Sebastian; Timme, Marc

    2010-04-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  8. Fast computation of interlace polynomials on graphs of bounded treewidth

    CERN Document Server

    Bläser, Markus

    2009-01-01

    We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollobas and Sorkin (2004) and by Aigner and van der Holst (2004). We present an algorithm to compute the multivariate interlace polynomial of a graph with n vertices given a tree decomposition of the graph of width k. Our algorithm uses 2^{4.5k^2+O(k)}*n arithmetic operations and can be efficiently implemented in parallel. It is tailor-made for the interlace polynomial and uses linear algebra arguments concerning adjacency matrices of graphs. The best previously known result (Courcelle 2008) employs a general logical framework and leads to an algorithm with running time f(k)*n^4, where f(k) is doubly exponential in k.

  9. 多个关联确定性时间序列微分方程建模方法研究%The Research of Differential Equations Modeling Methods of Correlative Deterministic Multivariate Time Series

    Institute of Scientific and Technical Information of China (English)

    孙文凯; 胡晓华; 蒋文江

    2015-01-01

    From the perspective of pure mathematics, Deterministic multivariate time series were multiply accumulated to produce some new sequences, studying relationship among them and establishing the multiple linear or nonlinear regression model. If a significance levelαwas given, the significance test for every regression equation was carried out. At confidence level 1-α, the differential equations models were established to reveal the relationship among all the time series, and fore⁃cast or control them. Finally, using the data for the value of GDP and the number of tourist reception in Hainan province from 1995 to 2014, differential equations model is established to forecast.%从纯数学的角度,对多个关联确定性时间序列分别进行多次累加产生新序列,研究序列之间的关系,建立多元线性(或非线性)回归方程。给定显著性水平α,对每个回归方程进行显著性检验。在置信度1-α下建立微分方程组模型,从而揭示这些时间序列之间的关系,实现对原序列的预测和控制。最后用1995-2014年海南省GDP和接待旅游人数建立微分方程组模型并进行预测。

  10. Deterministic dynamics of neural activity during absence seizures in rats

    Science.gov (United States)

    Ouyang, Gaoxiang; Li, Xiaoli; Dang, Chuangyin; Richards, Douglas A.

    2009-04-01

    The study of brain electrical activities in terms of deterministic nonlinear dynamics has recently received much attention. Forbidden ordinal patterns (FOP) is a recently proposed method to investigate the determinism of a dynamical system through the analysis of intrinsic ordinal properties of a nonstationary time series. The advantages of this method in comparison to others include simplicity and low complexity in computation without further model assumptions. In this paper, the FOP of the EEG series of genetic absence epilepsy rats from Strasbourg was examined to demonstrate evidence of deterministic dynamics during epileptic states. Experiments showed that the number of FOP of the EEG series grew significantly from an interictal to an ictal state via a preictal state. These findings indicated that the deterministic dynamics of neural networks increased significantly in the transition from the interictal to the ictal states and also suggested that the FOP measures of the EEG series could be considered as a predictor of absence seizures.

  11. The Deterministic Part of IPC-4: An Overview

    CERN Document Server

    Edelkamp, S; 10.1613/jair.1677

    2011-01-01

    We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects. After giving an introduction to the IPC, we briefly explain the main differences between the deterministic part of IPC-4 and its predecessors. We then introduce formally the language used, called PDDL2.2 that extends PDDL2.1 by derived predicates and timed initial literals. We list the competing systems and overview the results of the competition. The entire set of data is far too large to be presented in full. We provide a detailed summary; the complete data is available in an online appendix. We explain how we awarded the competition prizes.

  12. Deterministic treatment of model error in geophysical data assimilation

    CERN Document Server

    Carrassi, Alberto

    2015-01-01

    This chapter describes a novel approach for the treatment of model error in geophysical data assimilation. In this method, model error is treated as a deterministic process fully correlated in time. This allows for the derivation of the evolution equations for the relevant moments of the model error statistics required in data assimilation procedures, along with an approximation suitable for application to large numerical models typical of environmental science. In this contribution we first derive the equations for the model error dynamics in the general case, and then for the particular situation of parametric error. We show how this deterministic description of the model error can be incorporated in sequential and variational data assimilation procedures. A numerical comparison with standard methods is given using low-order dynamical systems, prototypes of atmospheric circulation, and a realistic soil model. The deterministic approach proves to be very competitive with only minor additional computational c...

  13. Deterministic Quantum Key Distribution Using Gaussian-Modulated Squeezed States

    Institute of Scientific and Technical Information of China (English)

    何广强; 朱俊; 曾贵华

    2011-01-01

    A continuous variable ping-pong scheme, which is utilized to generate deterministic private key, is proposed. The proposed scheme is implemented physically by using Ganssian-modulated squeezed states. The deterministic char- acteristic, i.e., no basis reconciliation between two parties, leads a nearly two-time efficiency comparing to the standard quantum key distribution schemes. Especially, the separate control mode does not need in the proposed scheme so that it is simpler and more available than previous ping-pong schemes. The attacker may be detected easily through the fidelity of the transmitted signal, and may not be successful in the beam splitter attack strategy.

  14. Structural and Spectral Properties of Deterministic Aperiodic Optical Structures

    Directory of Open Access Journals (Sweden)

    Luca Dal Negro

    2016-12-01

    Full Text Available In this comprehensive paper we have addressed structure-property relationships in a number of representative systems with periodic, random, quasi-periodic and deterministic aperiodic geometry using the interdisciplinary methods of spatial point pattern analysis and spectral graph theory as well as the rigorous Green’s matrix method, which provides access to the electromagnetic scattering behavior and spectral fluctuations (distributions of complex eigenvalues as well as of their level spacing of deterministic aperiodic optical media for the first time.

  15. Derivations and identities for Fibonacci and Lucas polynomials

    OpenAIRE

    Bedratyuk, Leonid

    2012-01-01

    We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any polynomial identity for Appel polynomial yields a polynomial identity for the Fibonacci and Lucas polynomials and describe the corresponding intertwining maps.

  16. Tree modules and counting polynomials

    CERN Document Server

    Kinser, Ryan

    2011-01-01

    We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number of d-dimensional tree modules for S_g is polynomial in g with the same degree and leading coefficient as the counting polynomial A_{S_g}(d, q) for absolutely indecomposables over F_q, evaluated at q=1.

  17. Orthogonal polynomials and operator orderings

    CERN Document Server

    Hamdi, Adel; 10.1063/1.3372526

    2010-01-01

    An alternative and combinatorial proof is given for a connection between a system of Hahn polynomials and identities for symmetric elements in the Heisenberg algebra, which was first observed by Bender, Mead, and Pinsky [Phys. Rev. Lett. 56 (1986), J. Math. Phys. 28, 509 (1987)] and proved by Koornwinder [J. Phys. Phys. 30(4), 1989]. In the same vein two results announced by Bender and Dunne [J. Math. Phys. 29 (8), 1988] connecting a special one-parameter class of Hermitian operator orderings and the continuous Hahn polynomials are also proved.

  18. Orthogonal Polynomials and their Applications

    CERN Document Server

    Dehesa, Jesús; Marcellan, Francisco; Francia, José; Vinuesa, Jaime

    1988-01-01

    The Segovia meeting set out to stimulate an intensive exchange of ideas between experts in the area of orthogonal polynomials and its applications, to present recent research results and to reinforce the scientific and human relations among the increasingly international community working in orthogonal polynomials. This volume contains original research papers as well as survey papers about fundamental questions in the field (Nevai, Rakhmanov & López) and its relationship with other fields such as group theory (Koornwinder), Padé approximation (Brezinski), differential equations (Krall, Littlejohn) and numerical methods (Rivlin).

  19. Symbolic computation of Appell polynomials using Maple

    Directory of Open Access Journals (Sweden)

    H. Alkahby

    2001-07-01

    Full Text Available This work focuses on the symbolic computation of Appell polynomials using the computer algebra system Maple. After describing the traditional approach of constructing Appell polynomials, the paper examines the operator method of constructing the same Appell polynomials. The operator approach enables us to express the Appell polynomial as Bessel function whose coefficients are Euler and Bernuolli numbers. We have also constructed algorithms using Maple to compute Appell polynomials based on the methods we have described. The achievement is the construction of Appell polynomials for any function of bounded variation.

  20. Survivability of Deterministic Dynamical Systems

    Science.gov (United States)

    Hellmann, Frank; Schultz, Paul; Grabow, Carsten; Heitzig, Jobst; Kurths, Jürgen

    2016-07-01

    The notion of a part of phase space containing desired (or allowed) states of a dynamical system is important in a wide range of complex systems research. It has been called the safe operating space, the viability kernel or the sunny region. In this paper we define the notion of survivability: Given a random initial condition, what is the likelihood that the transient behaviour of a deterministic system does not leave a region of desirable states. We demonstrate the utility of this novel stability measure by considering models from climate science, neuronal networks and power grids. We also show that a semi-analytic lower bound for the survivability of linear systems allows a numerically very efficient survivability analysis in realistic models of power grids. Our numerical and semi-analytic work underlines that the type of stability measured by survivability is not captured by common asymptotic stability measures.

  1. Factorization of colored knot polynomials at roots of unity

    Science.gov (United States)

    Kononov, Ya.; Morozov, A.

    2015-07-01

    HOMFLY polynomials are the Wilson-loop averages in Chern-Simons theory and depend on four variables: the closed line (knot) in 3d space-time, representation R of the gauge group SU (N) and exponentiated coupling constant q. From analysis of a big variety of different knots we conclude that at q, which is a 2m-th root of unity, q2m = 1, HOMFLY polynomials in symmetric representations [ r ] satisfy recursion identity: Hr+m =Hr ṡHm for any A =qN, which is a generalization of the property Hr = H1r for special polynomials at m = 1. We conjecture a further generalization to arbitrary representation R, which, however, is checked only for torus knots. Next, Kashaev polynomial, which arises from HR at q2 = e 2 πi / | R |, turns equal to the special polynomial with A substituted by A| R |, provided R is a single-hook representations (including arbitrary symmetric) - what provides a q - A dual to the similar property of Alexander polynomial. All this implies non-trivial relations for the coefficients of the differential expansions, which are believed to provide reasonable coordinates in the space of knots - existence of such universal relations means that these variables are still not unconstrained.

  2. Factorization of colored knot polynomials at roots of unity

    Directory of Open Access Journals (Sweden)

    Ya. Kononov

    2015-07-01

    Full Text Available HOMFLY polynomials are the Wilson-loop averages in Chern–Simons theory and depend on four variables: the closed line (knot in 3d space–time, representation R of the gauge group SU(N and exponentiated coupling constant q. From analysis of a big variety of different knots we conclude that at q, which is a 2m-th root of unity, q2m=1, HOMFLY polynomials in symmetric representations [r] satisfy recursion identity: Hr+m=Hr⋅Hm for any A=qN, which is a generalization of the property Hr=H1r for special polynomials at m=1. We conjecture a further generalization to arbitrary representation R, which, however, is checked only for torus knots. Next, Kashaev polynomial, which arises from HR at q2=e2πi/|R|, turns equal to the special polynomial with A substituted by A|R|, provided R is a single-hook representations (including arbitrary symmetric – what provides a q−A dual to the similar property of Alexander polynomial. All this implies non-trivial relations for the coefficients of the differential expansions, which are believed to provide reasonable coordinates in the space of knots – existence of such universal relations means that these variables are still not unconstrained.

  3. Robustness analysis of an air heating plant and control law by using polynomial chaos

    Energy Technology Data Exchange (ETDEWEB)

    Colón, Diego [University of São Paulo, Polytechnic School, LAC -PTC, São Paulo (Brazil); Ferreira, Murillo A. S.; Bueno, Átila M. [São Paulo State University - Sorocaba Campus, Sorocaba (Brazil); Balthazar, José M. [São Paulo State University - Rio Claro Campus, Rio Claro (Brazil); Rosa, Suélia S. R. F. de [University of Brasilia, Brasilia (Brazil)

    2014-12-10

    This paper presents a robustness analysis of an air heating plant with a multivariable closed-loop control law by using the polynomial chaos methodology (MPC). The plant consists of a PVC tube with a fan in the air input (that forces the air through the tube) and a mass flux sensor in the output. A heating resistance warms the air as it flows inside the tube, and a thermo-couple sensor measures the air temperature. The plant has thus two inputs (the fan's rotation intensity and heat generated by the resistance, both measured in percent of the maximum value) and two outputs (air temperature and air mass flux, also in percent of the maximal value). The mathematical model is obtained by System Identification techniques. The mass flux sensor, which is nonlinear, is linearized and the delays in the transfer functions are properly approximated by non-minimum phase transfer functions. The resulting model is transformed to a state-space model, which is used for control design purposes. The multivariable robust control design techniques used is the LQG/LTR, and the controllers are validated in simulation software and in the real plant. Finally, the MPC is applied by considering some of the system's parameters as random variables (one at a time, and the system's stochastic differential equations are solved by expanding the solution (a stochastic process) in an orthogonal basis of polynomial functions of the basic random variables. This method transforms the stochastic equations in a set of deterministic differential equations, which can be solved by traditional numerical methods (That is the MPC). Statistical data for the system (like expected values and variances) are then calculated. The effects of randomness in the parameters are evaluated in the open-loop and closed-loop pole's positions.

  4. Primality deterministic and primality probabilistic tests

    Directory of Open Access Journals (Sweden)

    Alfredo Rizzi

    2007-10-01

    Full Text Available In this paper the A. comments the importance of prime numbers in mathematics and in cryptography. He remembers the very important researches of Eulero, Fermat, Legen-re, Rieman and others scholarships. There are many expressions that give prime numbers. Between them Mersenne’s primes have interesting properties. There are also many conjectures that still have to be demonstrated or rejected. The primality deterministic tests are the algorithms that permit to establish if a number is prime or not. There are not applicable in many practical situations, for instance in public key cryptography, because the computer time would be very long. The primality probabilistic tests consent to verify the null hypothesis: the number is prime. In the paper there are comments about the most important statistical tests.

  5. Deterministic polarization chaos from a laser diode

    CERN Document Server

    Virte, Martin; Thienpont, Hugo; Sciamanna, Marc

    2014-01-01

    Fifty years after the invention of the laser diode and fourty years after the report of the butterfly effect - i.e. the unpredictability of deterministic chaos, it is said that a laser diode behaves like a damped nonlinear oscillator. Hence no chaos can be generated unless with additional forcing or parameter modulation. Here we report the first counter-example of a free-running laser diode generating chaos. The underlying physics is a nonlinear coupling between two elliptically polarized modes in a vertical-cavity surface-emitting laser. We identify chaos in experimental time-series and show theoretically the bifurcations leading to single- and double-scroll attractors with characteristics similar to Lorenz chaos. The reported polarization chaos resembles at first sight a noise-driven mode hopping but shows opposite statistical properties. Our findings open up new research areas that combine the high speed performances of microcavity lasers with controllable and integrated sources of optical chaos.

  6. Deterministic aspects of nonlinear modulation instability

    CERN Document Server

    van Groesen, E; Karjanto, N

    2011-01-01

    Different from statistical considerations on stochastic wave fields, this paper aims to contribute to the understanding of (some of) the underlying physical phenomena that may give rise to the occurrence of extreme, rogue, waves. To that end a specific deterministic wavefield is investigated that develops extreme waves from a uniform background. For this explicitly described nonlinear extension of the Benjamin-Feir instability, the soliton on finite background of the NLS equation, the global down-stream evolving distortions, the time signal of the extreme waves, and the local evolution near the extreme position are investigated. As part of the search for conditions to obtain extreme waves, we show that the extreme wave has a specific optimization property for the physical energy, and comment on the possible validity for more realistic situations.

  7. Global Polynomial Kernel Hazard Estimation

    DEFF Research Database (Denmark)

    Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch;

    2015-01-01

    This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically...

  8. STABILITY SYSTEMS VIA HURWITZ POLYNOMIALS

    Directory of Open Access Journals (Sweden)

    BALTAZAR AGUIRRE HERNÁNDEZ

    2017-01-01

    Full Text Available To analyze the stability of a linear system of differential equations  ẋ = Ax we can study the location of the roots of the characteristic polynomial pA(t associated with the matrix A. We present various criteria - algebraic and geometric - that help us to determine where the roots are located without calculating them directly.

  9. Global Polynomial Kernel Hazard Estimation

    DEFF Research Database (Denmark)

    Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch

    2015-01-01

    This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically redu...

  10. On Modular Counting with Polynomials

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt

    2006-01-01

    For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl...

  11. Two polynomial division inequalities in

    Directory of Open Access Journals (Sweden)

    Goetgheluck P

    1998-01-01

    Full Text Available This paper is a first attempt to give numerical values for constants and , in classical estimates and where is an algebraic polynomial of degree at most and denotes the -metric on . The basic tools are Markov and Bernstein inequalities.

  12. Polynomial J-spectral factorization

    NARCIS (Netherlands)

    Kwakernaak, Huibert; Sebek, Michael

    1994-01-01

    Several algorithms are presented for the J-spectral factorization of a para-Hermitian polynomial matrix. The four algorithms that are discussed are based on diagonalization, successive factor extraction, interpolation, and the solution of an algebraic Riccati equation, respectively. The paper includ

  13. Uniform approximation by (quantum) polynomials

    NARCIS (Netherlands)

    Drucker, A.; de Wolf, R.

    2011-01-01

    We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectivel

  14. Deterministic Tripartite Controlled Remote State Preparation

    Science.gov (United States)

    Sang, Ming-huang; Nie, Yi-you

    2017-07-01

    We demonstrate that a seven-qubit entangled state can be used to realize the deterministic tripartite controlled remote state preparation by performing only Pauli operations and single-qubit measurements. In our scheme, three distant senders can simultaneously and deterministically exchange their quantum state with the other senders under the control of the supervisor.

  15. Piecewise deterministic Markov processes : an analytic approach

    NARCIS (Netherlands)

    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

  16. Herman's condition and Siegel disks of polynomials

    CERN Document Server

    Chéritat, Arnaud

    2011-01-01

    Herman proved the presence of critical points on the boundary of Siegel disks of unicritical polynomials under some diophantine condition now called the Herman condition. We extend this result to polynomials with two critical points.

  17. Deterministic influences exceed dispersal effects on hydrologically-connected microbiomes: Deterministic assembly of hyporheic microbiomes

    Energy Technology Data Exchange (ETDEWEB)

    Graham, Emily B. [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA; Crump, Alex R. [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA; Resch, Charles T. [Geochemistry Department, Pacific Northwest National Laboratory, Richland WA USA; Fansler, Sarah [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA; Arntzen, Evan [Environmental Compliance and Emergency Preparation, Pacific Northwest National Laboratory, Richland WA USA; Kennedy, David W. [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA; Fredrickson, Jim K. [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA; Stegen, James C. [Biological Sciences Division, Pacific Northwest National Laboratory, Richland WA USA

    2017-03-28

    Subsurface zones of groundwater and surface water mixing (hyporheic zones) are regions of enhanced rates of biogeochemical cycling, yet ecological processes governing hyporheic microbiome composition and function through space and time remain unknown. We sampled attached and planktonic microbiomes in the Columbia River hyporheic zone across seasonal hydrologic change, and employed statistical null models to infer mechanisms generating temporal changes in microbiomes within three hydrologically-connected, physicochemically-distinct geographic zones (inland, nearshore, river). We reveal that microbiomes remain dissimilar through time across all zones and habitat types (attached vs. planktonic) and that deterministic assembly processes regulate microbiome composition in all data subsets. The consistent presence of heterotrophic taxa and members of the Planctomycetes-Verrucomicrobia-Chlamydiae (PVC) superphylum nonetheless suggests common selective pressures for physiologies represented in these groups. Further, co-occurrence networks were used to provide insight into taxa most affected by deterministic assembly processes. We identified network clusters to represent groups of organisms that correlated with seasonal and physicochemical change. Extended network analyses identified keystone taxa within each cluster that we propose are central in microbiome composition and function. Finally, the abundance of one network cluster of nearshore organisms exhibited a seasonal shift from heterotrophic to autotrophic metabolisms and correlated with microbial metabolism, possibly indicating an ecological role for these organisms as foundational species in driving biogeochemical reactions within the hyporheic zone. Taken together, our research demonstrates a predominant role for deterministic assembly across highly-connected environments and provides insight into niche dynamics associated with seasonal changes in hyporheic microbiome composition and metabolism.

  18. Deterministic, Nanoscale Fabrication of Mesoscale Objects

    Energy Technology Data Exchange (ETDEWEB)

    Jr., R M; Gilmer, J; Rubenchik, A; Shirk, M

    2004-12-08

    Neither LLNL nor any other organization has the capability to perform deterministic fabrication of mm-sized objects with arbitrary, {micro}m-sized, 3-D features and with 100-nm-scale accuracy and smoothness. This is particularly true for materials such as high explosives and low-density aerogels, as well as materials such as diamond and vanadium. The motivation for this project was to investigate the physics and chemistry that control the interactions of solid surfaces with laser beams and ion beams, with a view towards their applicability to the desired deterministic fabrication processes. As part of this LDRD project, one of our goals was to advance the state of the art for experimental work, but, in order to create ultimately a deterministic capability for such precision micromachining, another goal was to form a new modeling/simulation capability that could also extend the state of the art in this field. We have achieved both goals. In this project, we have, for the first time, combined a 1-D hydrocode (''HYADES'') with a 3-D molecular dynamics simulator (''MDCASK'') in our modeling studies. In FY02 and FY03, we investigated the ablation/surface-modification processes that occur on copper, gold, and nickel substrates with the use of sub-ps laser pulses. In FY04, we investigated laser ablation of carbon, including laser-enhanced chemical reaction on the carbon surface for both vitreous carbon and carbon aerogels. Both experimental and modeling results will be presented in the report that follows. The immediate impact of our investigation was a much better understanding of the chemical and physical processes that ensure when solid materials are exposed to femtosecond laser pulses. More broadly, we have better positioned LLNL to design a cluster tool for fabricating mesoscale objects utilizing laser pulses and ion-beams as well as more traditional machining/manufacturing techniques for applications such as components in NIF

  19. An analysis on the inversion of polynomials

    OpenAIRE

    M. F. González-Cardel; R. Díaz-Uribe

    2006-01-01

    In this work the application and the intervals of validity of an inverse polynomial, according to the method proposed by Arfken [1] for the inversion of series, is analyzed. It is shown that, for the inverse polynomial there exists a restricted domain whose longitude depends on the magnitude of the acceptable error when the inverse polynomial is used to approximate the inverse function of the original polynomial. A method for calculating the error of the approximation and its use in determini...

  20. Application of Chebyshev Polynomial to simulated modeling

    Institute of Scientific and Technical Information of China (English)

    CHI Hai-hong; LI Dian-pu

    2006-01-01

    Chebyshev polynomial is widely used in many fields, and used usually as function approximation in numerical calculation. In this paper, Chebyshev polynomial expression of the propeller properties across four quadrants is given at first, then the expression of Chebyshev polynomial is transformed to ordinary polynomial for the need of simulation of propeller dynamics. On the basis of it,the dynamical models of propeller across four quadrants are given. The simulation results show the efficiency of mathematical model.

  1. A New Generalisation of Macdonald Polynomials

    Science.gov (United States)

    Garbali, Alexandr; de Gier, Jan; Wheeler, Michael

    2017-01-01

    We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters (q, t) and polynomial in a further two parameters (u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.

  2. A Summation Formula for Macdonald Polynomials

    Science.gov (United States)

    de Gier, Jan; Wheeler, Michael

    2016-03-01

    We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.

  3. A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

    CERN Document Server

    Hildebrand, Robert

    2010-01-01

    We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasi-convex polynomial subject to s quasi-convex polynomial constraints and integrality constraints for all variables. The new algorithm is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). A lower time complexity is reached through applying a stronger ellipsoid rounding method and applying a recent advancement in the shortest vector problem to give a smaller exponential-time complexity of a Lenstra-type algorithm. For the bounded case, our algorithm attains a time-complexity of s (r l M d)^{O(1)} 2^{2n\\log_2(n) + O(n)} when M is a bound on the number of monomials in each polynomial and r is the binary encoding length of a bound on the feasible region. In the general case, s l^{O(1)} d^{O(n)} 2^{2n\\log_2(n)}. In each we assume d>=2 is a bound on the total degree of the polynomials and l bounds the maximum binary encoding size of the input...

  4. General Eulerian Numbers and Eulerian Polynomials

    Directory of Open Access Journals (Sweden)

    Tingyao Xiong

    2013-01-01

    Full Text Available We will generalize the definitions of Eulerian numbers and Eulerian polynomials to general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian numbers and polynomials to the general Eulerian polynomials and numbers.

  5. Positive trigonometric polynomials and signal processing applications

    CERN Document Server

    Dumitrescu, Bogdan

    2007-01-01

    Presents the results on positive trigonometric polynomials within a unitary framework; the theoretical results obtained partly from the general theory of real polynomials, partly from self-sustained developments. This book provides information on the theory of sum-of-squares trigonometric polynomials in two parts: theory and applications.

  6. Lattice Platonic Solids and their Ehrhart polynomial

    CERN Document Server

    Ionascu, Eugen J

    2011-01-01

    First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and those for regular lattice octahedrons. These relations allow one to reduce the calculation of these polynomials to only one coefficient.

  7. Frobenious-Euler Type Polynomials Related to Hermite-Bernoulli Polynomials

    Science.gov (United States)

    Kurt, Burak; Simsek, Yilmaz

    2011-09-01

    The aim of this paper is to define and investigate a new generating functions of the Frobenious-Euler polynomials and numbers. We establish some fundamental properties of these numbers and polynomials. We also derive relationship between these polynomials and Hermite-Apostol-Bernoulli polynomials and numbers. We also give some remarks and applications.

  8. Elliptic solutions of the restricted Toda chain, Lame polynomials and generalization of the elliptic Stieltjes polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Vinet, Luc [Universite de Montreal, PO Box 6128, Station Centre-ville, Montreal QC H3C 3J7 (Canada); Zhedanov, Alexei [Donetsk Institute for Physics and Technology, Donetsk 83114 (Ukraine)

    2009-10-30

    We construct new families of elliptic solutions of the restricted Toda chain. The main tool is a special (so-called Stieltjes) ansatz for the moments of corresponding orthogonal polynomials. We show that the moments thus obtained are related to three types of Lame polynomials. The corresponding orthogonal polynomials can be considered as a generalization of the Stieltjes-Carlitz elliptic polynomials.

  9. Deterministic seismic hazard macrozonation of India

    Science.gov (United States)

    Kolathayar, Sreevalsa; Sitharam, T. G.; Vipin, K. S.

    2012-10-01

    Earthquakes are known to have occurred in Indian subcontinent from ancient times. This paper presents the results of seismic hazard analysis of India (6°-38°N and 68°-98°E) based on the deterministic approach using latest seismicity data (up to 2010). The hazard analysis was done using two different source models (linear sources and point sources) and 12 well recognized attenuation relations considering varied tectonic provinces in the region. The earthquake data obtained from different sources were homogenized and declustered and a total of 27,146 earthquakes of moment magnitude 4 and above were listed in the study area. The sesismotectonic map of the study area was prepared by considering the faults, lineaments and the shear zones which are associated with earthquakes of magnitude 4 and above. A new program was developed in MATLAB for smoothing of the point sources. For assessing the seismic hazard, the study area was divided into small grids of size 0.1° × 0.1° (approximately 10 × 10 km), and the hazard parameters were calculated at the center of each of these grid cells by considering all the seismic sources within a radius of 300 to 400 km. Rock level peak horizontal acceleration (PHA) and spectral accelerations for periods 0.1 and 1 s have been calculated for all the grid points with a deterministic approach using a code written in MATLAB. Epistemic uncertainty in hazard definition has been tackled within a logic-tree framework considering two types of sources and three attenuation models for each grid point. The hazard evaluation without logic tree approach also has been done for comparison of the results. The contour maps showing the spatial variation of hazard values are presented in the paper.

  10. Deterministic seismic hazard macrozonation of India

    Indian Academy of Sciences (India)

    Sreevalsa Kolathayar; T G Sitharam; K S Vipin

    2012-10-01

    Earthquakes are known to have occurred in Indian subcontinent from ancient times. This paper presents the results of seismic hazard analysis of India (6°–38°N and 68°–98°E) based on the deterministic approach using latest seismicity data (up to 2010). The hazard analysis was done using two different source models (linear sources and point sources) and 12 well recognized attenuation relations considering varied tectonic provinces in the region. The earthquake data obtained from different sources were homogenized and declustered and a total of 27,146 earthquakes of moment magnitude 4 and above were listed in the study area. The sesismotectonic map of the study area was prepared by considering the faults, lineaments and the shear zones which are associated with earthquakes of magnitude 4 and above. A new program was developed in MATLAB for smoothing of the point sources. For assessing the seismic hazard, the study area was divided into small grids of size 0.1° × 0.1° (approximately 10 × 10 km), and the hazard parameters were calculated at the center of each of these grid cells by considering all the seismic sources within a radius of 300 to 400 km. Rock level peak horizontal acceleration (PHA) and spectral accelerations for periods 0.1 and 1 s have been calculated for all the grid points with a deterministic approach using a code written in MATLAB. Epistemic uncertainty in hazard definition has been tackled within a logic-tree framework considering two types of sources and three attenuation models for each grid point. The hazard evaluation without logic tree approach also has been done for comparison of the results. The contour maps showing the spatial variation of hazard values are presented in the paper.

  11. Multivariate Local Polynomial Regression with Application to Shenzhen Component Index

    Directory of Open Access Journals (Sweden)

    Liyun Su

    2011-01-01

    Full Text Available This study attempts to characterize and predict stock index series in Shenzhen stock market using the concepts of multivariate local polynomial regression. Based on nonlinearity and chaos of the stock index time series, multivariate local polynomial prediction methods and univariate local polynomial prediction method, all of which use the concept of phase space reconstruction according to Takens' Theorem, are considered. To fit the stock index series, the single series changes into bivariate series. To evaluate the results, the multivariate predictor for bivariate time series based on multivariate local polynomial model is compared with univariate predictor with the same Shenzhen stock index data. The numerical results obtained by Shenzhen component index show that the prediction mean squared error of the multivariate predictor is much smaller than the univariate one and is much better than the existed three methods. Even if the last half of the training data are used in the multivariate predictor, the prediction mean squared error is smaller than the univariate predictor. Multivariate local polynomial prediction model for nonsingle time series is a useful tool for stock market price prediction.

  12. Bipartition Polynomials, the Ising Model, and Domination in Graphs

    Directory of Open Access Journals (Sweden)

    Dod Markus

    2015-05-01

    Full Text Available This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph invariants. We apply this approach to show that, analogously to the Tutte polynomial, the Ising polynomial introduced by Andrén and Markström in [3], can be represented as a sum over spanning forests.

  13. Deterministic patterns in cell motility

    Science.gov (United States)

    Lavi, Ido; Piel, Matthieu; Lennon-Duménil, Ana-Maria; Voituriez, Raphaël; Gov, Nir S.

    2016-12-01

    Cell migration paths are generally described as random walks, associated with both intrinsic and extrinsic noise. However, complex cell locomotion is not merely related to such fluctuations, but is often determined by the underlying machinery. Cell motility is driven mechanically by actin and myosin, two molecular components that generate contractile forces. Other cell functions make use of the same components and, therefore, will compete with the migratory apparatus. Here, we propose a physical model of such a competitive system, namely dendritic cells whose antigen capture function and migratory ability are coupled by myosin II. The model predicts that this coupling gives rise to a dynamic instability, whereby cells switch from persistent migration to unidirectional self-oscillation, through a Hopf bifurcation. Cells can then switch to periodic polarity reversals through a homoclinic bifurcation. These predicted dynamic regimes are characterized by robust features that we identify through in vitro trajectories of dendritic cells over long timescales and distances. We expect that competition for limited resources in other migrating cell types can lead to similar deterministic migration modes.

  14. Accomplishing Deterministic XML Query Optimization

    Institute of Scientific and Technical Information of China (English)

    Dun-Ren Che

    2005-01-01

    As the popularity of XML (eXtensible Markup Language) keeps growing rapidly, the management of XML compliant structured-document databases has become a very interesting and compelling research area. Query optimization for XML structured-documents stands out as one of the most challenging research issues in this area because of the much enlarged optimization (search) space, which is a consequence of the intrinsic complexity of the underlying data model of XML data. We therefore propose to apply deterministic transformations on query expressions to most aggressively prune the search space and fast achieve a sufficiently improved alternative (if not the optimal) for each incoming query expression. This idea is not just exciting but practically attainable. This paper first provides an overview of our optimization strategy, and then focuses on the key implementation issues of our rule-based transformation system for XML query optimization in a database environment. The performance results we obtained from experimentation show that our approach is a valid and effective one.

  15. Stochastic Simulation of Integrated Circuits with Nonlinear Black-Box Components via Augmented Deterministic Equivalents

    Directory of Open Access Journals (Sweden)

    MANFREDI, P.

    2014-11-01

    Full Text Available This paper extends recent literature results concerning the statistical simulation of circuits affected by random electrical parameters by means of the polynomial chaos framework. With respect to previous implementations, based on the generation and simulation of augmented and deterministic circuit equivalents, the modeling is extended to generic and ?black-box? multi-terminal nonlinear subcircuits describing complex devices, like those found in integrated circuits. Moreover, based on recently-published works in this field, a more effective approach to generate the deterministic circuit equivalents is implemented, thus yielding more compact and efficient models for nonlinear components. The approach is fully compatible with commercial (e.g., SPICE-type circuit simulators and is thoroughly validated through the statistical analysis of a realistic interconnect structure with a 16-bit memory chip. The accuracy and the comparison against previous approaches are also carefully established.

  16. Computational Aspects of Modular Forms and Galois Representations How One Can Compute in Polynomial Time the Value of Ramanujan's Tau at a Prime (AM-176)

    CERN Document Server

    Edixhoven, Bas; de Jong, Robin; Bosman, Johan

    2011-01-01

    Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level on

  17. Normal BGG solutions and polynomials

    CERN Document Server

    Cap, A; Hammerl, M

    2012-01-01

    First BGG operators are a large class of overdetermined linear differential operators intrinsically associated to a parabolic geometry on a manifold. The corresponding equations include those controlling infinitesimal automorphisms, higher symmetries, and many other widely studied PDE of geometric origin. The machinery of BGG sequences also singles out a subclass of solutions called normal solutions. These correspond to parallel tractor fields and hence to (certain) holonomy reductions of the canonical normal Cartan connection. Using the normal Cartan connection, we define a special class of local frames for any natural vector bundle associated to a parabolic geometry. We then prove that the coefficient functions of any normal solution of a first BGG operator with respect to such a frame are polynomials in the normal coordinates of the parabolic geometry. A bound on the degree of these polynomials in terms of representation theory data is derived. For geometries locally isomorphic to the homogeneous model of ...

  18. On pseudo-Boolean polynomials

    Science.gov (United States)

    Leont'ev, V. K.

    2015-11-01

    A pseudo-Boolean function is an arbitrary mapping of the set of binary n-tuples to the real line. Such functions are a natural generalization of classical Boolean functions and find numerous applications in various applied studies. Specifically, the Fourier transform of a Boolean function is a pseudo-Boolean function. A number of facts associated with pseudo-Boolean polynomials are presented, and their applications to well-known discrete optimization problems are described.

  19. Polynomial-Chaos-based Kriging

    OpenAIRE

    Schöbi, R; Sudret, B.; Wiart, J.

    2015-01-01

    International audience; Computer simulation has become the standard tool in many engineering fields for designing and optimizing systems, as well as for assessing their reliability. Optimization and uncertainty quantification problems typically require a large number of runs of the computational model at hand, which may not be feasible with high-fidelity models directly. Thus surrogate models (a.k.a metamodels) have been increasingly investigated in the last decade. Polynomial Chaos Expansion...

  20. Weak lensing tomography with orthogonal polynomials

    CERN Document Server

    Schaefer, Bjoern Malte

    2011-01-01

    The topic of this article is weak cosmic shear tomography where the line of sight-weighting is carried out with a set of specifically constructed orthogonal polynomials, dubbed TaRDiS (Tomography with orthogonAl Radial Distance polynomIal Systems). We investigate the properties of these polynomials and employ weak convergence spectra, which have been obtained by weighting with these polynomials, for the estimation of cosmological parameters. We quantify their power in constraining parameters in a Fisher-matrix technique and demonstrate how each polynomial projects out statistically independent information, and how the combination of multiple polynomials lifts degeneracies. The assumption of a reference cosmology is needed for the construction of the polynomials, and as a last point we investigate how errors in the construction with a wrong cosmological model propagate to misestimates in cosmological parameters. TaRDiS performs on a similar level as traditional tomographic methods and some key features of tomo...

  1. Weak lensing tomography with orthogonal polynomials

    Science.gov (United States)

    Schäfer, Björn Malte; Heisenberg, Lavinia

    2012-07-01

    The topic of this paper is weak cosmic shear tomography where the line-of-sight weighting is carried out with a set of specifically constructed orthogonal polynomials, dubbed Tomography with Orthogonal Radial Distance Polynomial Systems (TaRDiS). We investigate the properties of these polynomials and employ weak convergence spectra, which have been obtained by weighting with these polynomials, for the estimation of cosmological parameters. We quantify their power in constraining parameters in a Fisher matrix technique and demonstrate how each polynomial projects out statistically independent information, and how the combination of multiple polynomials lifts degeneracies. The assumption of a reference cosmology is needed for the construction of the polynomials, and as a last point we investigate how errors in the construction with a wrong cosmological model propagate to misestimates in cosmological parameters. TaRDiS performs on a similar level as traditional tomographic methods and some key features of tomography are made easier to understand.

  2. On Ternary Inclusion-Exclusion Polynomials

    CERN Document Server

    Bachman, Gennady

    2010-01-01

    Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the coefficients of these polynomials. After establishing some basic properties of inclusion-exclusion polynomials we turn to a detailed study of the structure of ternary inclusion-exclusion polynomials. The latter subclass is exemplified by cyclotomic polynomials $\\Phi_{pqr}$, where $p

  3. Tutte polynomial of the Apollonian network

    Science.gov (United States)

    Liao, Yunhua; Hou, Yaoping; Shen, Xiaoling

    2014-10-01

    The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this invariant for a graph is, in general, NP-hard. The aim of this paper is to compute the Tutte polynomial of the Apollonian network. Based on the well-known duality property of the Tutte polynomial, we extend the subgraph-decomposition method. In particular, we do not calculate the Tutte polynomial of the Apollonian network directly, instead we calculate the Tutte polynomial of the Apollonian dual graph. By using the close relation between the Apollonian dual graph and the Hanoi graph, we express the Tutte polynomial of the Apollonian dual graph in terms of that of the Hanoi graph. As an application, we also give the number of spanning trees of the Apollonian network.

  4. 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.

  5. Exact Output Response Computation of RC Interconnects Under General Polynomial Input Waveforms

    Directory of Open Access Journals (Sweden)

    L. M. Patnaik

    2000-01-01

    Full Text Available Accurate output response computation of RC interconnects under various input excitations is a key issue in deep submicron delay analysis. In this paper, we present an exact analysis of output response computation of a distributed RC interconnect under input signals that are polynomial in time (tn. A simple, recursive equation that helps us to calculate the interconnect response under higher order polynomial inputs in terms of the lower order polynomial responses is derived. To the best of our knowledge, this is the first exact output response analysis of RC interconnects under generalized polynomial inputs.

  6. Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method

    Institute of Scientific and Technical Information of China (English)

    HUANG Deshuang; CHI Zheru

    2004-01-01

    This paper proposes a novel recursive partitioning method based on constrained learning neural networks to find an arbitrary number (less than the order of the polynomial) of (real or complex) roots of arbitrary polynomials. Moreover, this paper also gives a BP network constrained learning algorithm (CLA) used in root-finders based on the constrained relations between the roots and the coefficients of polynomials. At the same time, an adaptive selection method for the parameter δPwith the CLA is also given.The experimental results demonstrate that this method can more rapidly and effectively obtain the roots of arbitrary high order polynomials with higher precision than traditional root-finding approaches.

  7. Fractional order differentiation by integration with Jacobi polynomials

    KAUST Repository

    Liu, Dayan

    2012-12-01

    The differentiation by integration method with Jacobi polynomials was originally introduced by Mboup, Join and Fliess [22], [23]. This paper generalizes this method from the integer order to the fractional order for estimating the fractional order derivatives of noisy signals. The proposed fractional order differentiator is deduced from the Jacobi orthogonal polynomial filter and the Riemann-Liouville fractional order derivative definition. Exact and simple formula for this differentiator is given where an integral formula involving Jacobi polynomials and the noisy signal is used without complex mathematical deduction. Hence, it can be used both for continuous-time and discrete-time models. The comparison between our differentiator and the recently introduced digital fractional order Savitzky-Golay differentiator is given in numerical simulations so as to show its accuracy and robustness with respect to corrupting noises. © 2012 IEEE.

  8. Deterministic quantitative risk assessment development

    Energy Technology Data Exchange (ETDEWEB)

    Dawson, Jane; Colquhoun, Iain [PII Pipeline Solutions Business of GE Oil and Gas, Cramlington Northumberland (United Kingdom)

    2009-07-01

    Current risk assessment practice in pipeline integrity management is to use a semi-quantitative index-based or model based methodology. This approach has been found to be very flexible and provide useful results for identifying high risk areas and for prioritizing physical integrity assessments. However, as pipeline operators progressively adopt an operating strategy of continual risk reduction with a view to minimizing total expenditures within safety, environmental, and reliability constraints, the need for quantitative assessments of risk levels is becoming evident. Whereas reliability based quantitative risk assessments can be and are routinely carried out on a site-specific basis, they require significant amounts of quantitative data for the results to be meaningful. This need for detailed and reliable data tends to make these methods unwieldy for system-wide risk k assessment applications. This paper describes methods for estimating risk quantitatively through the calibration of semi-quantitative estimates to failure rates for peer pipeline systems. The methods involve the analysis of the failure rate distribution, and techniques for mapping the rate to the distribution of likelihoods available from currently available semi-quantitative programs. By applying point value probabilities to the failure rates, deterministic quantitative risk assessment (QRA) provides greater rigor and objectivity than can usually be achieved through the implementation of semi-quantitative risk assessment results. The method permits a fully quantitative approach or a mixture of QRA and semi-QRA to suit the operator's data availability and quality, and analysis needs. For example, consequence analysis can be quantitative or can address qualitative ranges for consequence categories. Likewise, failure likelihoods can be output as classical probabilities or as expected failure frequencies as required. (author)

  9. On Factorization of Generalized Macdonald Polynomials

    CERN Document Server

    Kononov, Ya

    2016-01-01

    A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the hook formula for quantum dimensions of representations of $U_q(SL_N)$ and plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMP), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time-variables, we discover a weak factorization -- on a one- (rather than four-) parametric slice of the topological locus, what is already a very non-trivial property, calling for proof and better understanding.

  10. On factorization of generalized Macdonald polynomials

    Science.gov (United States)

    Kononov, Ya.; Morozov, A.

    2016-08-01

    A remarkable feature of Schur functions—the common eigenfunctions of cut-and-join operators from W_∞ —is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U_q(SL_N) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization—on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding.

  11. On factorization of generalized Macdonald polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Kononov, Ya. [Landau Institute for Theoretical Physics, Chernogolovka (Russian Federation); HSE, Math Department, Moscow (Russian Federation); Morozov, A. [ITEP, Moscow (Russian Federation); Institute for Information Transmission Problems, Moscow (Russian Federation); National Research Nuclear University MEPhI, Moscow (Russian Federation)

    2016-08-15

    A remarkable feature of Schur functions - the common eigenfunctions of cut-and-join operators from W{sub ∞} - is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U{sub q}(SL{sub N}) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization - on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding. (orig.)

  12. Human gait recognition via deterministic learning.

    Science.gov (United States)

    Zeng, Wei; Wang, Cong

    2012-11-01

    Recognition of temporal/dynamical patterns is among the most difficult pattern recognition tasks. Human gait recognition is a typical difficulty in the area of dynamical pattern recognition. It classifies and identifies individuals by their time-varying gait signature data. Recently, a new dynamical pattern recognition method based on deterministic learning theory was presented, in which a time-varying dynamical pattern can be effectively represented in a time-invariant manner and can be rapidly recognized. In this paper, we present a new model-based approach for human gait recognition via the aforementioned method, specifically for recognizing people by gait. The approach consists of two phases: a training (learning) phase and a test (recognition) phase. In the training phase, side silhouette lower limb joint angles and angular velocities are selected as gait features. A five-link biped model for human gait locomotion is employed to demonstrate that functions containing joint angle and angular velocity state vectors characterize the gait system dynamics. Due to the quasi-periodic and symmetrical characteristics of human gait, the gait system dynamics can be simplified to be described by functions of joint angles and angular velocities of one side of the human body, thus the feature dimension is effectively reduced. Locally-accurate identification of the gait system dynamics is achieved by using radial basis function (RBF) neural networks (NNs) through deterministic learning. The obtained knowledge of the approximated gait system dynamics is stored in constant RBF networks. A gait signature is then derived from the extracted gait system dynamics along the phase portrait of joint angles versus angular velocities. A bank of estimators is constructed using constant RBF networks to represent the training gait patterns. In the test phase, by comparing the set of estimators with the test gait pattern, a set of recognition errors are generated, and the average L(1) norms

  13. Network meta-analysis of longitudinal data using fractional polynomials.

    Science.gov (United States)

    Jansen, J P; Vieira, M C; Cope, S

    2015-07-10

    Network meta-analysis of randomized controlled trials (RCTs) are often based on one treatment effect measure per study. However, many studies report data at multiple time points. Furthermore, not all studies measure the outcomes at the same time points. As an alternative to a network meta-analysis based on a synthesis of the results at one time point, a network meta-analysis method is presented that allows for the simultaneous analysis of outcomes at multiple time points. The development of outcomes over time of interventions compared in an RCT is modeled with fractional polynomials, and the differences between the parameters of these polynomials within a trial are synthesized across studies with a Bayesian network meta-analysis. The proposed models are illustrated with an analysis of RCTs evaluating interventions for osteoarthritis of the knee. Fixed and random effects second order fractional polynomials were applied to the case study. Network meta-analysis with models that represent the treatment effects in terms of several parameters using fractional polynomials can be considered a useful addition to models for network meta-analysis of repeated measures previously proposed. When RCTs report treatment effects at multiple follow-up times, these models can be used to synthesize the results even if reporting times differ across the studies.

  14. Optimal Deterministic Auctions with Correlated Priors

    OpenAIRE

    Papadimitriou, Christos; Pierrakos, George

    2010-01-01

    We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently distributed. We focus on general joint distributions, seeking the optimal deterministic incentive compatible auction. We give a geometric characterization of the optimal auction, resulting in a duality theorem and an efficient algorithm for finding the optimal deterministic auction in the two-bidder case and an NP-compl...

  15. A reduced polynomial chaos expansion method for the stochastic finite element analysis

    Indian Academy of Sciences (India)

    B Pascual; S Adhikari

    2012-06-01

    The stochastic finite element analysis of elliptic type partial differential equations is considered. A reduced method of the spectral stochastic finite element method using polynomial chaos is proposed. The method is based on the spectral decomposition of the deterministic system matrix. The reduction is achieved by retaining only the dominant eigenvalues and eigenvectors. The response of the reduced system is expanded as a series of Hermite polynomials, and a Galerkin error minimization approach is applied to obtain the deterministic coefficients of the expansion. The moments and probability density function of the solution are obtained by a process similar to the classical spectral stochastic finite element method. The method is illustrated using three carefully selected numerical examples, namely, bending of a stochastic beam, flow through porous media with stochastic permeability and transverse bending of a plate with stochastic properties. The results obtained from the proposed method are compared with classical polynomial chaos and direct Monte Carlo simulation results.

  16. Chaos theory as a bridge between deterministic and stochastic views for hydrologic modeling

    Science.gov (United States)

    Sivakumar, B.

    2009-04-01

    Two modeling approaches are prevalent in hydrology: deterministic and stochastic. The deterministic approach may be supported on the basis of the ‘permanent' nature of the ocean-earth-atmosphere structure and the ‘cyclical' nature of mechanisms that take place within it. The stochastic approach may be favored because of the ‘highly irregular and complex nature' of hydrologic phenomena and our ‘limited ability to observe' the detailed variations. With these two contrasting concepts, asking the question whether hydrologic phenomena are better modeled using a deterministic approach or a stochastic approach is meaningless. In fact, for most (if not all) hydrologic phenomena, both the deterministic approach and the stochastic approach are complementary to each other. This may be supported by our observation of both ‘deterministic' and ‘random' nature of hydrologic phenomena at ‘one or more scales' in time and/or space; for instance, there exists a significant deterministic nature in river flow in the form of seasonality and annual cycle, whereas the interactions of the various mechanisms involved in the river flow phenomenon and their various degrees of nonlinearity bring randomness. It is reasonable, therefore, to argue that use of an integrated modeling approach that incorporates both the deterministic and the stochastic components will produce greater success compared to either a deterministic approach or a stochastic approach independently. This study discusses the role of chaos theory as a potential avenue to the formulation of an integrated deterministic-stochastic approach. Through presentation of its fundamental principles (nonlinear interdependence, hidden determinism and order, sensitivity to initial conditions) and their relevance in hydrologic systems, the study contends that chaos theory can serve as a bridge between the deterministic and stochastic ‘extreme' views and offer a ‘middle-ground' approach. Specific examples of chaos theory

  17. Applying polynomial filtering to mass preconditioned Hybrid Monte Carlo

    CERN Document Server

    Haar, Taylor; Zanotti, James; Nakamura, Yoshifumi

    2016-01-01

    The use of mass preconditioning or Hasenbusch filtering in modern Hybrid Monte Carlo simulations is common. At light quark masses, multiple filters (three or more) are typically used to reduce the cost of generating dynamical gauge fields; however, the task of tuning a large number of Hasenbusch mass terms is non-trivial. The use of short polynomial approximations to the inverse has been shown to provide an effective UV filter for HMC simulations. In this work we investigate the application of polynomial filtering to the mass preconditioned Hybrid Monte Carlo algorithm as a means of introducing many time scales into the molecular dynamics integration with a simplified parameter tuning process. A generalized multi-scale integration scheme that permits arbitrary step- sizes and can be applied to Omelyan-style integrators is also introduced. We find that polynomial-filtered mass-preconditioning (PF-MP) performs as well as or better than standard mass preconditioning, with significantly less fine tuning required.

  18. Vector-valued Jack polynomials and wavefunctions on the torus

    Science.gov (United States)

    Dunkl, Charles F.

    2017-06-01

    The Hamiltonian of the quantum Calogero-Sutherland model of N identical particles on the circle with 1/r 2 interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials taking values in modules of the symmetric group and the matrix solution of a system of linear differential equations one constructs novel eigenfunctions of the Hamiltonian. Like the usual wavefunctions each eigenfunction determines a symmetric probability density on the N-torus. The construction applies to any irreducible representation of the symmetric group. The methods depend on the theory of generalized Jack polynomials due to Griffeth, and the Yang-Baxter graph approach of Luque and the author.

  19. Polynomial quasisolutions of linear differential-difference equations

    Directory of Open Access Journals (Sweden)

    Valery B. Cherepennikov

    2006-01-01

    Full Text Available The paper discusses a linear differential-difference equation of neutral type with linear coefficients, when at the initial time moment \\(t=0\\ the value of the desired function \\(x(t\\ is known. The authors are not familiar with any results which would state the solvability conditions for the given problem in the class of analytical functions. A polynomial of some degree \\(N\\ is introduced into the investigation. Then the term "polynomial quasisolution" (PQ-solution is understood in the sense of appearance of the residual \\(\\Delta (t=O(t^N\\, when this polynomial is substituted into the initial problem. The paper is devoted to finding PQ-solutions for the initial-value problem under analysis.

  20. Tabulating knot polynomials for arborescent knots

    Science.gov (United States)

    Mironov, A.; Morozov, A.; Morozov, A.; Ramadevi, P.; Singh, Vivek Kumar; Sleptsov, A.

    2017-02-01

    Arborescent knots are those which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is sufficient for lifting topological description to the level of effective analytical formulas. The paper describes the origin and structure of the new tables of colored knot polynomials, which will be posted at the dedicated site (http://knotebook.org). Even if formal expressions are known in terms of modular transformation matrices, the computation in finite time requires additional ideas. We use the ‘family’ approach, suggested in Mironov and Morozov (2015 Nucl. Phys. B 899 395–413), and apply it to arborescent knots in the Rolfsen table by developing a Feynman diagram technique, associated with an auxiliary matrix model field theory. Gauge invariance in this theory helps to provide meaning to Racah matrices in the case of non-trivial multiplicities and explains the need for peculiar sign prescriptions in the calculation of [21]-colored HOMFLY-PT polynomials.

  1. Polynomial Approximation Algorithms for the TSP and the QAP with a Factorial Domination Number

    DEFF Research Database (Denmark)

    Gutin, Gregory; Yeo, Anders

    2002-01-01

    Glover and Punnen (J. Oper. Res. Soc. 48 (1997) 502) asked whether there exists a polynomial time algorithm that always produces a tour which is not worse than at least n!/p(n) tours for some polynomial p(n) for every TSP instance on n cities. They conjectured that, unless P = NP, the answer...

  2. Deterministic chaos at the ocean surface: applications and interpretations

    Directory of Open Access Journals (Sweden)

    A. J. Palmer

    1998-01-01

    Full Text Available Ocean surface, grazing-angle radar backscatter data from two separate experiments, one of which provided coincident time series of measured surface winds, were found to exhibit signatures of deterministic chaos. Evidence is presented that the lowest dimensional underlying dynamical system responsible for the radar backscatter chaos is that which governs the surface wind turbulence. Block-averaging time was found to be an important parameter for determining the degree of determinism in the data as measured by the correlation dimension, and by the performance of an artificial neural network in retrieving wind and stress from the radar returns, and in radar detection of an ocean internal wave. The correlation dimensions are lowered and the performance of the deterministic retrieval and detection algorithms are improved by averaging out the higher dimensional surface wave variability in the radar returns.

  3. A Note on Trace Polynomial

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In this paper, we mainly study the relation of two cyclically reduced words w and w' on the condition they have the same trace polynomial (i.e., tr w= tr w' ). By defining an equivalence relation through such operators on words as inverse, cyclically left shift, and mirror, it is straightforward to get that w ~ w' implies tr w = tr w'. We show by a counter example that tr w = tr w' does not imply w ~ w'. And in two special cases, we prove that tr w = tr w' if and only if w ~ w'.

  4. Chromatic Polynomials of Mixed Hypercycles

    Directory of Open Access Journals (Sweden)

    Allagan Julian A.

    2014-08-01

    Full Text Available We color the vertices of each of the edges of a C-hypergraph (or cohypergraph in such a way that at least two vertices receive the same color and in every proper coloring of a B-hypergraph (or bihypergraph, we forbid the cases when the vertices of any of its edges are colored with the same color (monochromatic or when they are all colored with distinct colors (rainbow. In this paper, we determined explicit formulae for the chromatic polynomials of C-hypercycles and B-hypercycles

  5. Optimizing polynomials for floating-point implementation

    CERN Document Server

    De Dinechin, Florent

    2008-01-01

    The floating-point implementation of a function on an interval often reduces to polynomial approximation, the polynomial being typically provided by Remez algorithm. However, the floating-point evaluation of a Remez polynomial sometimes leads to catastrophic cancellations. This happens when some of the polynomial coefficients are very small in magnitude with respects to others. In this case, it is better to force these coefficients to zero, which also reduces the operation count. This technique, classically used for odd or even functions, may be generalized to a much larger class of functions. An algorithm is presented that forces to zero the smaller coefficients of the initial polynomial thanks to a modified Remez algorithm targeting an incomplete monomial basis. One advantage of this technique is that it is purely numerical, the function being used as a numerical black box. This algorithm is implemented within a larger polynomial implementation tool that is demonstrated on a range of examples, resulting in ...

  6. Transversals of Complex Polynomial Vector Fields

    DEFF Research Database (Denmark)

    Dias, Kealey

    , an important step was proving that the transversals possessed a certain characteristic. Understanding transversals might be the key to proving other polynomial vector fields are generic, and they are important in understanding bifurcations of polynomial vector fields in general. We consider two important......Vector fields in the complex plane are defined by assigning the vector determined by the value P(z) to each point z in the complex plane, where P is a polynomial of one complex variable. We consider special families of so-called rotated vector fields that are determined by a polynomial multiplied...... a concrete polynomial, it seems to take quite a bit of work to prove that it is generic, i.e. structurally stable. This has been done for a special class of degree d polynomial vector fields having simple equilibrium points at the d roots of unity, d odd. In proving that such vector fields are generic...

  7. The stable computation of formal orthogonal polynomials

    Science.gov (United States)

    Beckermann, Bernhard

    1996-12-01

    For many applications - such as the look-ahead variants of the Lanczos algorithm - a sequence of formal (block-)orthogonal polynomials is required. Usually, one generates such a sequence by taking suitable polynomial combinations of a pair of basis polynomials. These basis polynomials are determined by a look-ahead generalization of the classical three term recurrence, where the polynomial coefficients are obtained by solving a small system of linear equations. In finite precision arithmetic, the numerical orthogonality of the polynomials depends on a good choice of the size of the small systems; this size is usually controlled by a heuristic argument such as the condition number of the small matrix of coefficients. However, quite often it happens that orthogonality gets lost.

  8. Evaluation of Deterministic and Stochastic Components of Traffic Counts

    Directory of Open Access Journals (Sweden)

    Ivan Bošnjak

    2012-10-01

    Full Text Available Traffic counts or statistical evidence of the traffic processare often a characteristic of time-series data. In this paper fundamentalproblem of estimating deterministic and stochasticcomponents of a traffic process are considered, in the context of"generalised traffic modelling". Different methods for identificationand/or elimination of the trend and seasonal componentsare applied for concrete traffic counts. Further investigationsand applications of ARIMA models, Hilbert space formulationsand state-space representations are suggested.

  9. Exceptional polynomials and SUSY quantum mechanics

    Indian Academy of Sciences (India)

    K V S Shiv Chaitanya; S Sree Ranjani; Prasanta K Panigrahi; R Radhakrishnan; V Srinivasan

    2015-07-01

    We show that for the quantum mechanical problem which admit classical Laguerre/Jacobi polynomials as solutions for the Schrödinger equations (SE), will also admit exceptional Laguerre/Jacobi polynomials as solutions having the same eigenvalues but with the ground state missing after a modification of the potential. Then, we claim that the existence of these exceptional polynomials leads to the presence of non-trivial supersymmetry.

  10. Haglund's conjecture on 3-column Macdonald polynomials

    OpenAIRE

    Blasiak, Jonah

    2014-01-01

    We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum of monomials in Lam's algebra of ribbon Schur operators. Combining this result with the expression of Haglund, Haiman, and Loehr for transformed Macdonald polynomials in terms of LLT polynomials then yields a positive combinatorial rule for transformed Mac...

  11. A new Arnoldi approach for polynomial eigenproblems

    Energy Technology Data Exchange (ETDEWEB)

    Raeven, F.A.

    1996-12-31

    In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.

  12. Cubic Polynomials with Real or Complex Coefficients: The Full Picture

    Science.gov (United States)

    Bardell, Nicholas S.

    2016-01-01

    The cubic polynomial with real coefficients has a rich and interesting history primarily associated with the endeavours of great mathematicians like del Ferro, Tartaglia, Cardano or Vieta who sought a solution for the roots (Katz, 1998; see Chapter 12.3: The Solution of the Cubic Equation). Suffice it to say that since the times of renaissance…

  13. Deterministic Secure Positioning in Wireless Sensor Networks

    CERN Document Server

    Delaët, Sylvie; Rokicki, Mariusz; Tixeuil, Sébastien

    2007-01-01

    Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Our scheme does \\emph{not} rely on a subset of \\emph{trusted} nodes that are not allowed to misbehave and are known to every node in the network. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $\\lfloor \\frac{n}{2} \\rfloor-2$ faking sensors. Also, when the time of flight (ToF) technique is used, our protocol manages at most $\\lfloor \\frac{n}{2} \\rfloor...

  14. Deterministic Random Walks on Regular Trees

    CERN Document Server

    Cooper, Joshua; Friedrich, Tobias; Spencer, Joel; 10.1002/rsa.20314

    2010-01-01

    Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a remarkable similarity of both models. If an (almost) arbitrary population of chips is placed on the vertices of a grid $\\Z^d$ and does a simultaneous walk in the Propp model, then at all times and on each vertex, the number of chips on this vertex deviates from the expected number the random walk would have gotten there by at most a constant. This constant is independent of the starting configuration and the order in which each vertex serves its neighbors. This result raises the question if all graphs do have this property. With quite some effort, we are now able to answer this question negatively. For the graph being an infinite $k$-ary tree ($k \\ge 3$), we show that for any deviation $D$ there is an initial configuration of chips such that after running the Propp model for a ...

  15. On the verification of polynomial system solvers

    Institute of Scientific and Technical Information of China (English)

    Changbo CHEN; Marc MORENO MAZA; Wei PAN; Yuzhen XI

    2008-01-01

    We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are highly resource consuming and apply only to polynomial systems which are easy to solve. We exhibit a new approach which manipulates constructible sets represented by regular systems. We provide comparative benchmarks of different verification procedures applied to four solvers on a large set of well-known polynomial systems. Our experimental results illustrate the high effi-ciency of our new approach. In particular, we are able to verify triangular decompositions of polynomial systems which are not easy to solve.

  16. Asymptotics for a generalization of Hermite polynomials

    CERN Document Server

    Alfaro, M; Peña, A; Rezola, M L

    2009-01-01

    We consider a generalization of the classical Hermite polynomials by the addition of terms involving derivatives in the inner product. This type of generalization has been studied in the literature from the point of view of the algebraic properties. Thus, our aim is to study the asymptotics of this sequence of nonstandard orthogonal polynomials. In fact, we obtain Mehler--Heine type formulas for these polynomials and, as a consequence, we prove that there exists an acceleration of the convergence of the smallest positive zeros of these generalized Hermite polynomials towards the origin.

  17. Relative risk regression models with inverse polynomials.

    Science.gov (United States)

    Ning, Yang; Woodward, Mark

    2013-08-30

    The proportional hazards model assumes that the log hazard ratio is a linear function of parameters. In the current paper, we model the log relative risk as an inverse polynomial, which is particularly suitable for modeling bounded and asymmetric functions. The parameters estimated by maximizing the partial likelihood are consistent and asymptotically normal. The advantages of the inverse polynomial model over the ordinary polynomial model and the fractional polynomial model for fitting various asymmetric log relative risk functions are shown by simulation. The utility of the method is further supported by analyzing two real data sets, addressing the specific question of the location of the minimum risk threshold.

  18. Polynomial chaotic inflation in supergravity revisited

    Directory of Open Access Journals (Sweden)

    Kazunori Nakayama

    2014-10-01

    Full Text Available We revisit a polynomial chaotic inflation model in supergravity which we proposed soon after the Planck first data release. Recently some issues have been raised in Ref. [12], concerning the validity of our polynomial chaotic inflation model. We study the inflaton dynamics in detail, and confirm that the inflaton potential is very well approximated by a polynomial potential for the parameters of our interest in any practical sense, and in particular, the spectral index and the tensor-to-scalar ratio can be estimated by single-field approximation. This justifies our analysis of the polynomial chaotic inflation in supergravity.

  19. Chromatic polynomials, Potts models and all that

    Science.gov (United States)

    Sokal, Alan D.

    2000-04-01

    The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex zeros of the Potts partition function are of interest both to statistical mechanicians and to combinatorists. I give a pedagogical introduction to all these problems, and then sketch two recent results: (a) Construction of a countable family of planar graphs whose chromatic zeros are dense in the whole complex q-plane except possibly for the disc | q-1|chromatic polynomial (or antiferromagnetic Potts-model partition function) in terms of the graph's maximum degree.

  20. Control to Facet for Polynomial Systems

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2014-01-01

    for the controller design are solved by searching for polynomials in Bernstein form. This allows the controller design problem to be formulated as a linear programming problem. Examples are provided that demonstrate the efficiency of the method for designing controls for polynomial systems.......This paper presents a solution to the control to facet problem for arbitrary polynomial vector fields defined on simplices. The novelty of the work is to use Bernstein coefficients of polynomials for determining certificates of positivity. Specifically, the constraints that are set up...

  1. The q-Laguerre matrix polynomials.

    Science.gov (United States)

    Salem, Ahmed

    2016-01-01

    The Laguerre polynomials have been extended to Laguerre matrix polynomials by means of studying certain second-order matrix differential equation. In this paper, certain second-order matrix q-difference equation is investigated and solved. Its solution gives a generalized of the q-Laguerre polynomials in matrix variable. Four generating functions of this matrix polynomials are investigated. Two slightly different explicit forms are introduced. Three-term recurrence relation, Rodrigues-type formula and the q-orthogonality property are given.

  2. Multi-indexed (q)-Racah Polynomials

    CERN Document Server

    Odake, Satoru

    2012-01-01

    As the second stage of the project $multi-indexed orthogonal polynomials$, we present, in the framework of `discrete quantum mechanics' with real shifts in one dimension, the multi-indexed (q)-Racah polynomials. They are obtained from the (q)-Racah polynomials by multiple application of the discrete analogue of the Darboux transformations or the Crum-Krein-Adler deletion of `virtual state' vectors of type I and II, in a similar way to the multi-indexed Laguerre and Jacobi polynomials reported earlier. The virtual state vectors are the `solutions' of the matrix Schr\\"odinger equation with negative `eigenvalues', except for one of the two boundary points.

  3. On the Fermionic -adic Integral Representation of Bernstein Polynomials Associated with Euler Numbers and Polynomials

    Directory of Open Access Journals (Sweden)

    Ryoo CS

    2010-01-01

    Full Text Available The purpose of this paper is to give some properties of several Bernstein type polynomials to represent the fermionic -adic integral on . From these properties, we derive some interesting identities on the Euler numbers and polynomials.

  4. Aspects of the Tutte polynomial

    DEFF Research Database (Denmark)

    Ok, Seongmin

    This thesis studies various aspects of the Tutte polynomial, especially focusing on the Merino-Welsh conjecture. We write T(G;x,y) for the Tutte polynomial of a graph G with variables x and y. In 1999, Merino and Welsh conjectured that if G is a loopless 2-connected graph, then T(G;1,1) ≤ max{T(G;2......-Welsh conjecture. Assume the graph G is loopless, bridgeless and has n vertices and m edges. If m ≤ 1.066 n then T(G;1,1) ≤ T(G;2,0). If m ≥ 4(n-1) then T(G;1,1) ≤ T(G;0,2). I improve in this thesis Thomassen's result as follows: If m ≤ 1.29(n-1) then T(G;1,1) ≤ T(G;2,0). If m ≥ 3.58(n-1) and G is 3-edge...

  5. Classification based polynomial image interpolation

    Science.gov (United States)

    Lenke, Sebastian; Schröder, Hartmut

    2008-02-01

    Due to the fast migration of high resolution displays for home and office environments there is a strong demand for high quality picture scaling. This is caused on the one hand by large picture sizes and on the other hand due to an enhanced visibility of picture artifacts on these displays [1]. There are many proposals for an enhanced spatial interpolation adaptively matched to picture contents like e.g. edges. The drawback of these approaches is the normally integer and often limited interpolation factor. In order to achieve rational factors there exist combinations of adaptive and non adaptive linear filters, but due to the non adaptive step the overall quality is notably limited. We present in this paper a content adaptive polyphase interpolation method which uses "offline" trained filter coefficients and an "online" linear filtering depending on a simple classification of the input situation. Furthermore we present a new approach to a content adaptive interpolation polynomial, which allows arbitrary polyphase interpolation factors at runtime and further improves the overall interpolation quality. The main goal of our new approach is to optimize interpolation quality by adapting higher order polynomials directly to the image content. In addition we derive filter constraints for enhanced picture quality. Furthermore we extend the classification based filtering to the temporal dimension in order to use it for an intermediate image interpolation.

  6. Algorithms in Solving Polynomial Inequalities

    Directory of Open Access Journals (Sweden)

    Christopher M. Cordero

    2015-11-01

    Full Text Available A new method to solve the solution set of polynomial inequalities was conducted. When −1 −2 >0 ℎ 1,2∈ ℝ 10 if n is even. Then, the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+∞ ∪ ,+1 : }. Thus, when −1−2…−≥0, the solution is ∈ ℝ ∈−∞, 1∪ ,+∞∪, +1: }. If is odd, then the solution set is ∈ ℝ ∈ ,+∞ ∪ ,+1 : }. Thus, when −1 −2…−≥0, the solution set is ∈ ℝ ∈ ,+∞∪, +1: }. Let −1−2…−<0 if n is even. Then, the solution set is ∈ ℝ ∈ ,+1 ∶ }. Thus, when −1 −2…−≤0, then the solution set is ∈ ℝ ∈, +1: }. If is an odd, then the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+1 : }. Thus, when −1 −2 … − ≤0, the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+1 : }. This research provides a novel method in solving the solution set of polynomial inequalities, in addition to other existing methods.

  7. The complexity of class polynomial computation via floating point approximations

    Science.gov (United States)

    Enge, Andreas

    2009-06-01

    We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of modular functions in several arguments. The fastest one of the presented approaches uses a technique devised by Dupont to evaluate modular functions by Newton iterations on an expression involving the arithmetic-geometric mean. Under the heuristic assumption, justified by experiments, that the correctness of the result is not perturbed by rounding errors, the algorithm runs in time O left( sqrt {\\vert D\\vert} log^3 \\vert D\\vert M left( sq... ...arepsilon} \\vert D\\vert right) subseteq O left( h^{2 + \\varepsilon} right) for any \\varepsilon > 0 , where D is the CM discriminant, h is the degree of the class polynomial and M (n) is the time needed to multiply two n -bit numbers. Up to logarithmic factors, this running time matches the size of the constructed polynomials. The estimate also relies on a new result concerning the complexity of enumerating the class group of an imaginary quadratic order and on a rigorously proven upper bound for the height of class polynomials.

  8. Deterministic and Probabilistic Approach in Primality Checking for RSA Algorithm

    Directory of Open Access Journals (Sweden)

    Sanjoy Das

    2013-04-01

    Full Text Available The RSA cryptosystem, invented by Ron Rivest, Adi Shamir and Len Adleman was first publicized in the August 1977 issue of Scientific American [1]. The security level of this algorithm very much depends on two large prime numbers [2]. In this paper two distinct approaches have been dealt with for primality checking. These are deterministic approach and probabilistic approach. For the deterministic approach, it has chosen modified trial division and for probabilistic approach, Miller-Rabin algorithm is considered. The different kinds of attacks on RSA and their remedy are also being discussed. This includes the chosen cipher text attacks, short private key exponent attack and frequency attack. Apart from these attacks, discussion has been made on how to choose the primes for the RSA algorithm. The time complexity has been demonstrated for the various algorithms implemented and compared with others. Finally the future modifications and expectations arising out of the current limitations have also been stated at the end.

  9. Deterministic error correction for nonlocal spatial-polarization hyperentanglement.

    Science.gov (United States)

    Li, Tao; Wang, Guan-Yu; Deng, Fu-Guo; Long, Gui-Lu

    2016-02-10

    Hyperentanglement is an effective quantum source for quantum communication network due to its high capacity, low loss rate, and its unusual character in teleportation of quantum particle fully. Here we present a deterministic error-correction scheme for nonlocal spatial-polarization hyperentangled photon pairs over collective-noise channels. In our scheme, the spatial-polarization hyperentanglement is first encoded into a spatial-defined time-bin entanglement with identical polarization before it is transmitted over collective-noise channels, which leads to the error rejection of the spatial entanglement during the transmission. The polarization noise affecting the polarization entanglement can be corrected with a proper one-step decoding procedure. The two parties in quantum communication can, in principle, obtain a nonlocal maximally entangled spatial-polarization hyperentanglement in a deterministic way, which makes our protocol more convenient than others in long-distance quantum communication.

  10. Analysis of stochastic bifurcation and chaos in stochastic Duffing-van der Pol system via Chebyshev polynomial approximation

    Institute of Scientific and Technical Information of China (English)

    Ma Shao-Juan; Xu Wei; Li Wei; Fang Tong

    2006-01-01

    The Chebyshev polynomial approximation is applied to investigate the stochastic period-doubling bifurcation and chaos problems of a stochastic Duffing-van der Pol system with bounded random parameter of exponential probability density function subjected to a harmonic excitation. Firstly the stochastic system is reduced into its equivalent deterministic one, and then the responses of stochastic system can be obtained by numerical methods. Nonlinear dynamical behaviour related to stochastic period-doubling bifurcation and chaos in the stochastic system is explored. Numerical simulations show that similar to its counterpart in deterministic nonlinear system of stochastic period-doubling bifurcation and chaos may occur in the stochastic Duffing-van der Pol system even for weak intensity of random parameter.Simply increasing the intensity of the random parameter may result in the period-doubling bifurcation which is absent from the deterministic system.

  11. Deterministic versus stochastic aspects of superexponential population growth models

    Science.gov (United States)

    Grosjean, Nicolas; Huillet, Thierry

    2016-08-01

    Deterministic population growth models with power-law rates can exhibit a large variety of growth behaviors, ranging from algebraic, exponential to hyperexponential (finite time explosion). In this setup, selfsimilarity considerations play a key role, together with two time substitutions. Two stochastic versions of such models are investigated, showing a much richer variety of behaviors. One is the Lamperti construction of selfsimilar positive stochastic processes based on the exponentiation of spectrally positive processes, followed by an appropriate time change. The other one is based on stable continuous-state branching processes, given by another Lamperti time substitution applied to stable spectrally positive processes.

  12. Non-equilibrium Thermodynamics of Piecewise Deterministic Markov Processes

    Science.gov (United States)

    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.

  13. Quantification of Geometric Uncertainties in Single Cell Cavities for BESSY VSR Using Polynomial Chaos

    CERN Document Server

    Heller, J; Schmidt, C; van Rienen, U

    2014-01-01

    The electromagnetic properties of SRF cavities are mostly determined by their shape. Due to fabrication tolerances, tuning and limited resolution of measurement systems, the exact shape remains uncertain. In order to make assessments for the real life behaviour it is important to quantify how these geometrical uncertainties propagate through the mathematical system and influence certain electromagnetic properties, like the resonant frequencies of the structure’s eigenmodes. This can be done by using non-intrusive straightforward methods like Monte Carlo (MC) simulations. However, such simulations require a large number of deterministic problem solutions to obtain a sufficient accuracy. In order to avoid this scaling behaviour, the so-called generalized polynomial chaos (gPC) expansion is used. This technique allows for the relatively fast computation of uncertainty propagation for few uncertain parameters in the case of computationally expensive deterministic models. In this paper we use the gPC expansion t...

  14. Uncertainty propagation through an aeroelastic wind turbine model using polynomial surrogates

    DEFF Research Database (Denmark)

    Murcia Leon, Juan Pablo; Réthoré, Pierre-Elouan Mikael; Dimitrov, Nikolay Krasimirov

    2017-01-01

    Polynomial surrogates are used to characterize the energy production and lifetime equivalent fatigue loads for different components of the DTU 10 MW reference wind turbine under realistic atmospheric conditions. The variability caused by different turbulent inflow fields are captured by creating......-alignment. The methodology presented extends the deterministic power and thrust coefficient curves to uncertainty models and adds new variables like damage equivalent fatigue loads in different components of the turbine. These surrogate models can then be implemented inside other work-flows such as: estimation...... of the uncertainty in annual energy production due to wind resource variability and/or robust wind power plant layout optimization. It can be concluded that it is possible to capture the global behavior of a modern wind turbine and its uncertainty under realistic inflow conditions using polynomial response surfaces...

  15. Deterministic mediated superdense coding with linear optics

    Energy Technology Data Exchange (ETDEWEB)

    Pavičić, Mladen, E-mail: mpavicic@physik.hu-berlin.de [Department of Physics—Nanooptics, Faculty of Mathematics and Natural Sciences, Humboldt University of Berlin (Germany); Center of Excellence for Advanced Materials and Sensing Devices (CEMS), Photonics and Quantum Optics Unit, Ruđer Bošković Institute, Zagreb (Croatia)

    2016-02-22

    We present a scheme of deterministic mediated superdense coding of entangled photon states employing only linear-optics elements. Ideally, we are able to deterministically transfer four messages by manipulating just one of the photons. Two degrees of freedom, polarization and spatial, are used. A new kind of source of heralded down-converted photon pairs conditioned on detection of another pair with an efficiency of 92% is proposed. Realistic probabilistic experimental verification of the scheme with such a source of preselected pairs is feasible with today's technology. We obtain the channel capacity of 1.78 bits for a full-fledged implementation. - Highlights: • Deterministic linear optics mediated superdense coding is proposed. • Two degrees of freedom, polarization and spatial, are used. • Heralded source of conditioned entangled photon pairs, 92% efficient, is proposed.

  16. Study on the Grey Polynomial Geometric Programming

    Institute of Scientific and Technical Information of China (English)

    LUODang

    2005-01-01

    In the model of geometric programming, values of parameters cannot be gotten owing to data fluctuation and incompletion. But reasonable bounds of these parameters can be attained. This is to say, parameters of this model can be regarded as interval grey numbers. When the model contains grey numbers, it is hard for common programming method to solve them. By combining the common programming model with the grey system theory,and using some analysis strategies, a model of grey polynomial geometric programming, a model of 8 positioned geometric programming and their quasi-optimum solution or optimum solution are put forward. At the same time, we also developed an algorithm for the problem.This approach brings a new way for the application research of geometric programming. An example at the end of this paper shows the rationality and feasibility of the algorithm.

  17. Digital terrain modeling with the Chebyshev polynomials

    CERN Document Server

    Florinsky, I V

    2015-01-01

    Mathematical problems of digital terrain analysis include interpolation of digital elevation models (DEMs), DEM generalization and denoising, and computation of morphometric variables by calculation of partial derivatives of elevation. Traditionally, these procedures are based on numerical treatments of two-variable discrete functions of elevation. We developed a spectral analytical method and algorithm based on high-order orthogonal expansions using the Chebyshev polynomials of the first kind with the subsequent Fejer summation. The method and algorithm are intended for DEM analytical treatment, such as, DEM global approximation, denoising, and generalization as well as computation of morphometric variables by analytical calculation of partial derivatives. To test the method and algorithm, we used a DEM of the Northern Andes including 230,880 points (the elevation matrix 480 $\\times$ 481). DEMs were reconstructed with 480, 240, 120, 60, and 30 expansion coefficients. The first and second partial derivatives ...

  18. Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation

    Directory of Open Access Journals (Sweden)

    Sheng-Cheng Huang

    2017-01-01

    Full Text Available Inspiratory flow limitation (IFL is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases and severe level (58 cases of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.

  19. Weighted Polynomial Approximation for Automated Detection of Inspiratory Flow Limitation.

    Science.gov (United States)

    Huang, Sheng-Cheng; Jan, Hao-Yu; Fu, Tieh-Cheng; Lin, Wen-Chen; Lin, Geng-Hong; Lin, Wen-Chi; Tsai, Cheng-Lun; Lin, Kang-Ping

    2017-01-01

    Inspiratory flow limitation (IFL) is a critical symptom of sleep breathing disorders. A characteristic flattened flow-time curve indicates the presence of highest resistance flow limitation. This study involved investigating a real-time algorithm for detecting IFL during sleep. Three categories of inspiratory flow shape were collected from previous studies for use as a development set. Of these, 16 cases were labeled as non-IFL and 78 as IFL which were further categorized into minor level (20 cases) and severe level (58 cases) of obstruction. In this study, algorithms using polynomial functions were proposed for extracting the features of IFL. Methods using first- to third-order polynomial approximations were applied to calculate the fitting curve to obtain the mean absolute error. The proposed algorithm is described by the weighted third-order (w.3rd-order) polynomial function. For validation, a total of 1,093 inspiratory breaths were acquired as a test set. The accuracy levels of the classifications produced by the presented feature detection methods were analyzed, and the performance levels were compared using a misclassification cobweb. According to the results, the algorithm using the w.3rd-order polynomial approximation achieved an accuracy of 94.14% for IFL classification. We concluded that this algorithm achieved effective automatic IFL detection during sleep.

  20. Optimal Deterministic Investment Strategies for Insurers

    Directory of Open Access Journals (Sweden)

    Ulrich Rieder

    2013-11-01

    Full Text Available We consider an insurance company whose risk reserve is given by a Brownian motion with drift and which is able to invest the money into a Black–Scholes financial market. As optimization criteria, we treat mean-variance problems, problems with other risk measures, exponential utility and the probability of ruin. Following recent research, we assume that investment strategies have to be deterministic. This leads to deterministic control problems, which are quite easy to solve. Moreover, it turns out that there are some interesting links between the optimal investment strategies of these problems. Finally, we also show that this approach works in the Lévy process framework.

  1. Stochastic versus deterministic systems of differential equations

    CERN Document Server

    Ladde, G S

    2003-01-01

    This peerless reference/text unfurls a unified and systematic study of the two types of mathematical models of dynamic processes-stochastic and deterministic-as placed in the context of systems of stochastic differential equations. Using the tools of variational comparison, generalized variation of constants, and probability distribution as its methodological backbone, Stochastic Versus Deterministic Systems of Differential Equations addresses questions relating to the need for a stochastic mathematical model and the between-model contrast that arises in the absence of random disturbances/flu

  2. BOUNDS FOR THE ZEROS OF POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    W. M. Shah; A.Liman

    2004-01-01

    Let P(z) =n∑j=0 ajzj be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrom-Kakeya theorem.

  3. New pole placement algorithm - Polynomial matrix approach

    Science.gov (United States)

    Shafai, B.; Keel, L. H.

    1990-01-01

    A simple and direct pole-placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well-established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.

  4. Distortion control of conjugacies between quadratic polynomials

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    We use a new type of distortion control of univalent functions to give an alternative proof of Douady-Hubbard’s ray-landing theorem for quadratic Misiurewicz polynomials. The univalent maps arise from Thurston’s iterated algorithm on perturbation of such polynomials.

  5. Uniqueness of meromorphic functions concerning differential polynomials

    Institute of Scientific and Technical Information of China (English)

    QIAO Lei

    2007-01-01

    Based on a unicity theorem for entire funcitions concerning differential polynomials proposed by M. L. Fang and W. Hong, we studied the uniqueness problem of two meromorphic functions whose differential polynomials share the same 1-point by proving two theorems and their related lemmas. The results extend and improve given by Fang and Hong's theorem.

  6. Fostering Connections between Classes of Polynomial Functions.

    Science.gov (United States)

    Buck, Judy Curran

    The typical path of instruction in high school algebra courses for the study of polynomial functions has been from linear functions, to quadratic functions, to polynomial functions of degree greater than two. This paper reports results of clinical interviews with an Algebra II student. The interviews were used to probe into the student's…

  7. Fractal Trigonometric Polynomials for Restricted Range Approximation

    Science.gov (United States)

    Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.

    2016-05-01

    One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.

  8. Elementary combinatorics of the HOMFLYPT polynomial

    CERN Document Server

    Chmutov, Sergei

    2009-01-01

    We explore Jaeger's state model for the HOMFLYPT polynomial. We reformulate this model in the language of Gauss diagrams and use it to obtain Gauss diagram formulas for a two-parameter family of Vassiliev invariants coming from the HOMFLYPT polynomial. These formulas are new already for invariants of degree 3.

  9. ON FIRST INTEGRALS OF POLYNOMIAL AUTONOMOUS SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    WANG Yuzhen; CHENG Daizhan; LI Chunwen

    2002-01-01

    Using Carleman linearization procedure, this paper investigates the problemof first integrals of polynomial autonomous systems and proposes a procedure to find thefirst integrals of polynomial family for the systems. A generalized eigenequation is obtainedand then the problem is reduced to the solvability of the eigenequation. The result is ageneralization of some known results.

  10. Large degree asymptotics of generalized Bessel polynomials

    NARCIS (Netherlands)

    J.L. López; N.M. Temme (Nico)

    2011-01-01

    textabstractAsymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given that is valid outside a compact neighborhood of the

  11. On Polynomial Functions over Finite Commutative Rings

    Institute of Scientific and Technical Information of China (English)

    Jian Jun JIANG; Guo Hua PENG; Qi SUN; Qi Fan ZHANG

    2006-01-01

    Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.

  12. A polynomial approach to nonlinear system controllability

    NARCIS (Netherlands)

    Zheng, YF; Willems, JC; Zhang, CH

    2001-01-01

    This note uses a polynomial approach to present a necessary and sufficient condition for local controllability of single-input-single-output (SISO) nonlinear systems. The condition is presented in terms of common factors of a noncommutative polynomial expression. This result exposes controllability

  13. Connections between the matching and chromatic polynomials

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1992-01-01

    Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.

  14. Sums of Powers of Fibonacci Polynomials

    Indian Academy of Sciences (India)

    Helmut Prodinger

    2009-11-01

    Using the explicit (Binet) formula for the Fibonacci polynomials, a summation formula for powers of Fibonacci polynomials is derived straightforwardly, which generalizes a recent result for squares that appeared in Proc. Ind. Acad. Sci. (Math. Sci.) 118 (2008) 27--41.

  15. A Note on Solvable Polynomial Algebras

    Directory of Open Access Journals (Sweden)

    Huishi Li

    2014-03-01

    Full Text Available In terms of their defining relations, solvable polynomial algebras introduced by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990] are characterized by employing Gr\\"obner bases of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational way.

  16. The topology of Julia sets for polynomials

    Institute of Scientific and Technical Information of China (English)

    尹永成

    2002-01-01

    We prove that wandering components of the Julia set of a polynomial are singletons provided each critical point in a wandering Julia component is non-recurrent. This means a conjecture of Branner-Hubbard is true for this kind of polynomials.

  17. Percolation critical polynomial as a graph invariant

    Science.gov (United States)

    Scullard, Christian R.

    2012-10-01

    Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized through a definition that can be applied on any periodic lattice. The polynomial depends on the lattice and on its decomposition into identical finite subgraphs, but once these are specified, the polynomial is essentially unique. On lattices for which the exact percolation threshold is unknown, the polynomials provide approximations for the critical probability with the estimates appearing to converge to the exact answer with increasing subgraph size. In this paper, I show how this generalized critical polynomial can be viewed as a graph invariant, similar to the Tutte polynomial. In particular, the critical polynomial is computed on a finite graph and may be found using the recursive deletion-contraction algorithm. This allows calculation on a computer, and I present such results for the kagome lattice using subgraphs of up to 36 bonds. For one of these, I find the prediction pc=0.52440572⋯, which differs from the numerical value, pc=0.52440503(5), by only 6.9×10-7.

  18. Tutte Polynomial of Multi-Bridge Graphs

    Directory of Open Access Journals (Sweden)

    Julian A. Allagan

    2013-10-01

    Full Text Available In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some $2-$tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.

  19. Several explicit formulae for Bernoulli polynomials

    OpenAIRE

    Komatsu, Takao; Pita Ruiz V., Claudio de J.

    2016-01-01

    We prove several explicit formulae for the $n$-th Bernoulli polynomial $B_{n}(x)$, in which $B_{n}(x)$ is equal to an affine combination of the polynomials $(x-1)^{n}$, $(x-2)^{n}$, $ldots$, $(x-k-1)^{n}$, where $k$ is any fixed positive integer greater or equal than $n$.

  20. Reliability polynomials crossing more than twice

    NARCIS (Netherlands)

    Brown, J.I.; Koç, Y.; Kooij, R.E.

    2011-01-01

    In this paper we study all-terminal reliability polynomials of networks having the same number of nodes and the same number of links. First we show that the smallest possible size for a pair of networks that allows for two crossings of their reliability polynomials have seven nodes and fifteen edges

  1. Notes on Schubert, Grothendieck and Key Polynomials

    Science.gov (United States)

    Kirillov, Anatol N.

    2016-03-01

    We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.

  2. Differential Krull dimension in differential polynomial extensions

    OpenAIRE

    Smirnov, Ilya

    2011-01-01

    We investigate the differential Krull dimension of differential polynomials over a differential ring. We prove a differential analogue of Jaffard's Special Chain Theorem and show that differential polynomial extensions of certain classes of differential rings have no anomaly of differential Krull dimension.

  3. Colored HOMFLY polynomials can distinguish mutant knots

    CERN Document Server

    Nawata, Satoshi; Singh, Vivek Kumar

    2015-01-01

    We illustrate from the viewpoint of braiding operations on WZNW conformal blocks how colored HOMFLY polynomials with multiplicity structure can detect mutations. As an example, we explicitly evaluate the (2,1)-colored HOMFLY polynomials that distinguish a famous mutant pair, Kinoshita-Terasaka and Conway knot.

  4. On the Zeros of a Polynomial

    Indian Academy of Sciences (India)

    V K Jain

    2009-02-01

    For a polynomial of degree , we have obtained an upper bound involving coefficients of the polynomial, for moduli of its zeros of smallest moduli, and then a refinement of the well-known Eneström–Kakeya theorem (under certain conditions).

  5. Fuzzy Morphological Polynomial Image Representation

    Directory of Open Access Journals (Sweden)

    Chin-Pan Huang

    2010-01-01

    Full Text Available A novel signal representation using fuzzy mathematical morphology is developed. We take advantage of the optimum fuzzy fitting and the efficient implementation of morphological operators to extract geometric information from signals. The new representation provides results analogous to those given by the polynomial transform. Geometrical decomposition of a signal is achieved by windowing and applying sequentially fuzzy morphological opening with structuring functions. The resulting representation is made to resemble an orthogonal expansion by constraining the results of opening to equate adapted structuring functions. Properties of the geometric decomposition are considered and used to calculate the adaptation parameters. Our procedure provides an efficient and flexible representation which can be efficiently implemented in parallel. The application of the representation is illustrated in data compression and fractal dimension estimation temporal signals and images.

  6. Polynomial weights and code constructions

    DEFF Research Database (Denmark)

    Massey, J; Costello, D; Justesen, Jørn

    1973-01-01

    polynomial included. This fundamental property is then used as the key to a variety of code constructions including 1) a simplified derivation of the binary Reed-Muller codes and, for any primepgreater than 2, a new extensive class ofp-ary "Reed-Muller codes," 2) a new class of "repeated-root" cyclic codes...... that are subcodes of the binary Reed-Muller codes and can be very simply instrumented, 3) a new class of constacyclic codes that are subcodes of thep-ary "Reed-Muller codes," 4) two new classes of binary convolutional codes with large "free distance" derived from known binary cyclic codes, 5) two new classes...... of long constraint length binary convolutional codes derived from2^r-ary Reed-Solomon codes, and 6) a new class ofq-ary "repeated-root" constacyclic codes with an algebraic decoding algorithm....

  7. A posteriori compensation of the systematic error due to polynomial interpolation in digital image correlation

    Science.gov (United States)

    Baldi, Antonio; Bertolino, Filippo

    2013-10-01

    It is well known that displacement components estimated using digital image correlation are affected by a systematic error due to the polynomial interpolation required by the numerical algorithm. The magnitude of bias depends on the characteristics of the speckle pattern (i.e., the frequency content of the image), on the fractional part of displacements and on the type of polynomial used for intensity interpolation. In literature, B-Spline polynomials are pointed out as being able to introduce the smaller errors, whereas bilinear and cubic interpolants generally give the worst results. However, the small bias of B-Spline polynomials is partially counterbalanced by a somewhat larger execution time. We will try to improve the accuracy of lower order polynomials by a posteriori correcting their results so as to obtain a faster and more accurate analysis.

  8. Pointwise approximation of periodic functions by trigonometric polynomials with Hermitian interpolation

    Energy Technology Data Exchange (ETDEWEB)

    Trigub, R M [Donetsk National University, Donetsk (Ukraine)

    2009-08-31

    We prove a general direct theorem on the simultaneous pointwise approximation of smooth periodic functions and their derivatives by trigonometric polynomials and their derivatives with Hermitian interpolation. We study the order of approximation by polynomials whose graphs lie above or below the graph of the function on certain intervals. We prove several inequalities for Hermitian interpolation with absolute constants (for any system of nodes). For the first time we get a theorem on the best-order approximation of functions by polynomials with interpolation at a given system of nodes. We also provide a construction of Hermitian interpolating trigonometric polynomials for periodic functions (in the case of one node, these are trigonometric Taylor polynomials)

  9. Polynomials with Palindromic and Unimodal Coeffi cients

    Institute of Scientific and Technical Information of China (English)

    Hua SUN; Yi WANG; Hai Xia ZHANG

    2015-01-01

    Let f(q) = arqr +· · ·+asqs, with ar = 0 and as = 0, be a real polynomial. It is a palindromic polynomial of darga n if r+s = n and ar+i = as−i for all i. Polynomials of darga n form a linear subspace Pn(q) of R(q)n+1 of dimension ? n2 ?+1. We give transition matrices between two bases ?qj(1+q+· · ·+qn−2j)? , ?qj(1+q)n−2j? and the standard basis ?qj(1+qn−2j)? of Pn(q). We present some characterizations and sufficcient conditions for palindromic polynomials that can be expressed in terms of these two bases with nonnegative coefficients. We also point out the link between such polynomials and rank-generating functions of posets.

  10. Sobolev orthogonal polynomials on a simplex

    CERN Document Server

    Aktas, Rabia

    2011-01-01

    The Jacobi polynomials on the simplex are orthogonal polynomials with respect to the weight function $W_\\bg(x) = x_1^{\\g_1} ... x_d^{\\g_d} (1- |x|)^{\\g_{d+1}}$ when all $\\g_i > -1$ and they are eigenfunctions of a second order partial differential operator $L_\\bg$. The singular cases that some, or all, $\\g_1,...,\\g_{d+1}$ are -1 are studied in this paper. Firstly a complete basis of polynomials that are eigenfunctions of $L_\\bg$ in each singular case is found. Secondly, these polynomials are shown to be orthogonal with respect to an inner product which is explicitly determined. This inner product involves derivatives of the functions, hence the name Sobolev orthogonal polynomials.

  11. Orthogonal Polynomials from Hermitian Matrices II

    CERN Document Server

    Odake, Satoru

    2016-01-01

    This is the second part of the project `unified theory of classical orthogonal polynomials of a discrete variable derived from the eigenvalue problems of hermitian matrices.' In a previous paper, orthogonal polynomials having Jackson integral measures were not included, since such measures cannot be obtained from single infinite dimensional hermitian matrices. Here we show that Jackson integral measures for the polynomials of the big $q$-Jacobi family are the consequence of the recovery of self-adjointness of the unbounded Jacobi matrices governing the difference equations of these polynomials. The recovery of self-adjointness is achieved in an extended $\\ell^2$ Hilbert space on which a direct sum of two unbounded Jacobi matrices acts as a Hamiltonian or a difference Schr\\"odinger operator for an infinite dimensional eigenvalue problem. The polynomial appearing in the upper/lower end of Jackson integral constitutes the eigenvector of each of the two unbounded Jacobi matrix of the direct sum. We also point out...

  12. Baxter operator formalism for Macdonald polynomials

    CERN Document Server

    Gerasimov, Anton; Oblezin, Sergey

    2012-01-01

    We develop basic constructions of the Baxter operator formalism for the Macdonald polynomials. Precisely we construct a dual pair of mutually commuting Baxter operators such that the Macdonald polynomials are their common eigenfunctions. The dual pair of Baxter operators is closely related to the dual pair of recursive operators for Macdonald polynomials leading to various families of their integral representations. We also construct the Baxter operator formalism for the q-deformed Whittaker functions and the Jack polynomials obtained by degenerations of the Macdonald polynomials. This note provides a generalization of our previous results on the Baxter operator formalism for the Whittaker functions. It was demonstrated previously that Baxter operator formalism for the Whittaker functions has deep connections with representation theory. In particular the Baxter operators should be considered as elements of appropriate spherical Hecke algebras and their eigenvalues are identified with local Archimedean L-facto...

  13. Tutte polynomial in functional magnetic resonance imaging

    Science.gov (United States)

    García-Castillón, Marlly V.

    2015-09-01

    Methods of graph theory are applied to the processing of functional magnetic resonance images. Specifically the Tutte polynomial is used to analyze such kind of images. Functional Magnetic Resonance Imaging provide us connectivity networks in the brain which are represented by graphs and the Tutte polynomial will be applied. The problem of computing the Tutte polynomial for a given graph is #P-hard even for planar graphs. For a practical application the maple packages "GraphTheory" and "SpecialGraphs" will be used. We will consider certain diagram which is depicting functional connectivity, specifically between frontal and posterior areas, in autism during an inferential text comprehension task. The Tutte polynomial for the resulting neural networks will be computed and some numerical invariants for such network will be obtained. Our results show that the Tutte polynomial is a powerful tool to analyze and characterize the networks obtained from functional magnetic resonance imaging.

  14. On Chebyshev polynomials and torus knots

    CERN Document Server

    Gavrilik, A M

    2009-01-01

    In this work we demonstrate that the q-numbers and their two-parameter generalization, the q,p-numbers, can be used to obtain some polynomial invariants for torus knots and links. First, we show that the q-numbers, which are closely connected with the Chebyshev polynomials, can also be related with the Alexander polynomials for the class T(s,2) of torus knots, s being an odd integer, and used for finding the corresponding skein relation. Then, we develop this procedure in order to obtain, with the help of q,p-numbers, the generalized two-variable Alexander polynomials, and prove their direct connection with the HOMFLY polynomials and the skein relation of the latter.

  15. Comparison of Deterministic and Probabilistic Radial Distribution Systems Load Flow

    Science.gov (United States)

    Gupta, Atma Ram; Kumar, Ashwani

    2017-08-01

    Distribution system network today is facing the challenge of meeting increased load demands from the industrial, commercial and residential sectors. The pattern of load is highly dependent on consumer behavior and temporal factors such as season of the year, day of the week or time of the day. For deterministic radial distribution load flow studies load is taken as constant. But, load varies continually with a high degree of uncertainty. So, there is a need to model probable realistic load. Monte-Carlo Simulation is used to model the probable realistic load by generating random values of active and reactive power load from the mean and standard deviation of the load and for solving a Deterministic Radial Load Flow with these values. The probabilistic solution is reconstructed from deterministic data obtained for each simulation. The main contribution of the work is: - Finding impact of probable realistic ZIP load modeling on balanced radial distribution load flow. - Finding impact of probable realistic ZIP load modeling on unbalanced radial distribution load flow. - Compare the voltage profile and losses with probable realistic ZIP load modeling for balanced and unbalanced radial distribution load flow.

  16. Deterministic gathering of anonymous agents in arbitrary networks

    CERN Document Server

    Dieudonné, Yoann

    2011-01-01

    A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. Which configurations are gatherable and how to gather all of them deterministically by the same algorithm? We give a complete solution of this gathering problem in arbitrary networks. We characterize all gatherable configurations and give two universal deterministic gathering algorithms, i.e., algorithms that gather all gatherable configurations. The first algorithm works under the assumption that an upper bound n on the size of the network is known. In this case our algorithm guarantees gathering with detection, i.e., the existence of a round for any gatherable configuration, such that all agents are at the same node and all declare that gathering is accomplished. If no upper bound on the size of the network i...

  17. Design and development of thin quartz glass WFXT polynomial mirror shells by direct polishing

    Science.gov (United States)

    Proserpio, L.; Campana, S.; Citterio, O.; Civitani, M.; Combrinck, H.; Conconi, P.; Cotroneo, V.; Freeman, R.; Langstrof, P.; Mattaini, E.; Morton, R.; Oberle, B.; Pareschi, G.; Parodi, G.; Pels, C.; Schenk, C.; Stock, R.; Tagliaferri, G.

    2010-07-01

    The Wide Field X-ray Telescope (WFXT) is a medium class mission for X-ray surveys of the sky with an unprecedented area and sensitivity. In order to meet the effective area requirement, the design of the optical system is based on very thin mirror shells, with thicknesses in the 1-2 mm range. In order to get the desired angular resolution (10 arcsec requirement, 5 arcsec goal) across the entire 1x1 degree FOV (Field Of View), the design of the optical system is based on nested modified grazing incidence Wolter-I mirrors realized with polynomial profiles, focal plane curvature and plate scale corrections. This design guarantees an increased angular resolution at large off-axis angle with respect to the normally used Wolter I configuration, making WFXT ideal for survey purposes. The WFXT X-ray Telescope Assembly is composed by three identical mirror modules of 78 nested shells each, with diameter up to 1.1 m. The epoxy replication process with SiC shells has already been proved to be a valuable technology to meet the angular resolution requirement of 10 arcsec. To further mature the telescope manufacturing technology and to achieve the goal of 5 arcsec, a deterministic direct polishing method is under investigation. The direct polishing method has already been used for past missions (as Einstein, Rosat, Chandra): the technological challenge now is to apply it for almost ten times thinner shells. Under investigation is quartz glass (fused silica), a well-known material with good thermo-mechanical and polishability characteristics that could meet our goal in terms of mass and stiffness, with significant cost and time saving with respect to SiC. Our approach is based on two main steps: first quartz glass tubes available on the market are grinded to conical profiles, and second the obtained shells are polished to the required polynomial profiles by CNC (Computer Numerical Control) polishing machine. In this paper, the first results of the direct grinding and polishing of

  18. HIGHER ORDER MULTIVARIABLE NORLUND EULER-BERNOULLI POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    刘国栋

    2002-01-01

    The definitions of higher order multivariable Norlund Euler polynomials and Norlund Bernoulli polynomials are presented and some of their important properties are expounded. Some identities involving recurrence sequences and higher order multivariable Norlund Euler-Bernoulli polynomials are established.

  19. Generalized Gegenbauer Koornwinder's type polynomials change of bases

    Science.gov (United States)

    AlQudah, Mohammad; AlMheidat, Maalee

    2017-07-01

    In this paper we characterize the generalized Gegenbauer polynomials using Bernstein basis, and derive the matrix of transformation of the generalized Gegenbauer polynomial basis form into the Bernstein polynomial basis and vice versa.

  20. Jacob's ladders and new orthogonal systems generated by Jacobi polynomials

    CERN Document Server

    Moser, Jan

    2010-01-01

    Is is shown in this paper that there is a connection between the Riemann zeta-function $\\zf$ and the classical Jacobi's polynomials, i.e. the Legendre polynomials, Chebyshev polynomials of the first and the second kind,...

  1. Deterministic sensitivity analysis for first-order Monte Carlo simulations: a technical note.

    Science.gov (United States)

    Geisler, Benjamin P; Siebert, Uwe; Gazelle, G Scott; Cohen, David J; Göhler, Alexander

    2009-01-01

    Monte Carlo microsimulations have gained increasing popularity in decision-analytic modeling because they can incorporate discrete events. Although deterministic sensitivity analyses are essential for interpretation of results, it remains difficult to combine these alongside Monte Carlo simulations in standard modeling packages without enormous time investment. Our purpose was to facilitate one-way deterministic sensitivity analysis of TreeAge Markov state-transition models requiring first-order Monte Carlo simulations. Using TreeAge Pro Suite 2007 and Microsoft Visual Basic for EXCEL, we constructed a generic script that enables one to perform automated deterministic one-way sensitivity analyses in EXCEL employing microsimulation models. In addition, we constructed a generic EXCEL-worksheet that allows for use of the script with little programming knowledge. Linking TreeAge Pro Suite 2007 and Visual Basic enables the performance of deterministic sensitivity analyses of first-order Monte Carlo simulations. There are other potentially interesting applications for automated analysis.

  2. Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas

    CERN Document Server

    Godlin, Benny; Makowsky, Johann A

    2008-01-01

    Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove that in this framework every recursive definition of a graph polynomial can be converted into a subset expansion formula.

  3. DETERMINISTIC HOMOGENIZATION OF QUASILINEAR DAMPED HYPERBOLIC EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Gabriel Nguetseng; Hubert Nnang; Nils Svanstedt

    2011-01-01

    Deterministic homogenization is studied for quasilinear monotone hyperbolic problems with a linear damping term.It is shown by the sigma-convergence method that the sequence of solutions to a class of multi-scale highly oscillatory hyperbolic problems converges to the solution to a homogenized quasilinear hyperbolic problem.

  4. Deterministic Kalman filtering in a behavioral framework

    NARCIS (Netherlands)

    Fagnani, F; Willems, JC

    1997-01-01

    The purpose of this paper is to obtain a deterministic version of the Kalman filtering equations. We will use a behavioral description of the plant, specifically, an image representation. The resulting algorithm requires a matrix spectral factorization. We also show that the filter can be implemente

  5. A Gap Property of Deterministic Tree Languages

    DEFF Research Database (Denmark)

    Niwinski, Damian; Walukiewicz, Igor

    2003-01-01

    We show that a tree language recognized by a deterministic parity automaton is either hard for the co-Büchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low evel in the hierarchy of weak alternating automata. A topological counterpart of this property...

  6. Deterministic Execution of Ptides Programs

    Science.gov (United States)

    2013-05-15

    illustrated in Figure 3. Suppose a token, (SB, 30, 1), appears on port b of the AddSubtract adder . When can the adder execute given the DE requirement that...at a time no later than 30+1+5 = 36. Assume the maximum clock synchronization error is . Therefore, the AddSubtract adder must delay processing the

  7. Deterministic ants in labirynth -- information gained by map sharing

    CERN Document Server

    Malinowski, Janusz

    2014-01-01

    A few of ant robots are dropped to a labirynth, formed by a square lattice with a small number of nodes removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors which she has visited. Once two ants met, they share the information acquired. We evaluate how the time of getting a complete information by an ant depends on the number of ants, and how the length known by an ant depends on time. Numerical results are presented in the form of scaling relations.

  8. Deterministic Ethernet for Space Applications

    Science.gov (United States)

    Fidi, C.; Wolff, B.

    2015-09-01

    Typical spacecraft systems are distributed to be able to achieve the required reliability and availability targets of the mission. However the requirements on these systems are different for launchers, satellites, human space flight and exploration missions. Launchers require typically high reliability with very short mission times whereas satellites or space exploration missions require very high availability at very long mission times. Comparing a distributed system of launchers with satellites it shows very fast reaction times in launchers versus much slower once in satellite applications. Human space flight missions are maybe most challenging concerning reliability and availability since human lives are involved and the mission times can be very long e.g. ISS. Also the reaction times of these vehicles can get challenging during mission scenarios like landing or re-entry leading to very fast control loops. In these different applications more and more autonomous functions are required to fulfil the needs of current and future missions. This autonomously leads to new requirements with respect to increase performance, determinism, reliability and availability. On the other hand side the pressure on reducing costs of electronic components in space applications is increasing, leading to the use of more and more COTS components especially for launchers and LEO satellites. This requires a technology which is able to provide a cost competitive solution for both the high reliable and available deep-space as well as the low cost “new space” markets. Future spacecraft communication standards therefore have to be much more flexible, scalable and modular to be able to deal with these upcoming challenges. The only way to fulfill these requirements is, if they are based on open standards which are used cross industry leading to a reduction of the lifecycle costs and an increase in performance. The use of a communication network that fulfills these requirements will be

  9. From LTL and Limit-Deterministic B\\"uchi Automata to Deterministic Parity Automata

    OpenAIRE

    Esparza, Javier; Křetínský, Jan; Raskin, Jean-François; Sickert, Salomon

    2017-01-01

    Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic B\\"uchi a...

  10. Effects of polynomial trends on detrending moving average analysis

    CERN Document Server

    Shao, Ying-Hui; Jiang, Zhi-Qiang; Zhou, Wei-Xing

    2015-01-01

    The detrending moving average (DMA) algorithm is one of the best performing methods to quantify the long-term correlations in nonstationary time series. Many long-term correlated time series in real systems contain various trends. We investigate the effects of polynomial trends on the scaling behaviors and the performances of three widely used DMA methods including backward algorithm (BDMA), centered algorithm (CDMA) and forward algorithm (FDMA). We derive a general framework for polynomial trends and obtain analytical results for constant shifts and linear trends. We find that the behavior of the CDMA method is not influenced by constant shifts. In contrast, linear trends cause a crossover in the CDMA fluctuation functions. We also find that constant shifts and linear trends cause crossovers in the fluctuation functions obtained from the BDMA and FDMA methods. When a crossover exists, the scaling behavior at small scales comes from the intrinsic time series while that at large scales is dominated by the cons...

  11. Polynomial threshold functions and Boolean threshold circuits

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.

    2013-01-01

    We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is 12n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being...... of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...

  12. The Translated Dowling Polynomials and Numbers.

    Science.gov (United States)

    Mangontarum, Mahid M; Macodi-Ringia, Amila P; Abdulcarim, Normalah S

    2014-01-01

    More properties for the translated Whitney numbers of the second kind such as horizontal generating function, explicit formula, and exponential generating function are proposed. Using the translated Whitney numbers of the second kind, we will define the translated Dowling polynomials and numbers. Basic properties such as exponential generating functions and explicit formula for the translated Dowling polynomials and numbers are obtained. Convexity, integral representation, and other interesting identities are also investigated and presented. We show that the properties obtained are generalizations of some of the known results involving the classical Bell polynomials and numbers. Lastly, we established the Hankel transform of the translated Dowling numbers.

  13. Exponential Polynomial Approximation with Unrestricted Upper Density

    Institute of Scientific and Technical Information of China (English)

    Xiang Dong YANG

    2011-01-01

    We take a new approach to obtaining necessary and sufficient conditions for the incompleteness of exponential polynomials in Lp/α, where Lp/α is the weighted Banach space of complex continuous functions f defined on the real axis (R)satisfying (∫+∞/-∞|f(t)|pe-α(t)dt)1/p, 1 < p < ∞, and α(t) is a nonnegative continuous function defined on the real axis (R). In this paper, the upper density of the sequence which forms the exponential polynomials is not required to be finite. In the study of weighted polynomial approximation, consideration of the case is new.

  14. Laurent polynomial moment problem: a case study

    CERN Document Server

    Pakovich, F; Zvonkin, A

    2009-01-01

    In recent years, the so-called polynomial moment problem, motivated by the classical Poincare center-focus problem, was thoroughly studied, and the answers to the main questions have been found. The study of a similar problem for rational functions is still at its very beginning. In this paper, we make certain progress in this direction; namely, we construct an example of a Laurent polynomial for which the solutions of the corresponding moment problem behave in a significantly more complicated way than it would be possible for a polynomial.

  15. On Calculation of Adomian Polynomials by MATLAB

    Directory of Open Access Journals (Sweden)

    Hossein ABOLGHASEMI

    2011-01-01

    Full Text Available Adomian Decomposition Method (ADM is an elegant technique to handle an extensive class of linear or nonlinear differential and integral equations. However, in case of nonlinear equations, ADM demands a special representation of each nonlinear term, namely, Adomian polynomials. The present paper introduces a novel MATLAB code which computes Adomian polynomials associated with several types of nonlinearities. The code exploits symbolic programming incorporated with a recently proposed alternative scheme to be straightforward and fast. For the sake of exemplification, Adomian polynomials of famous nonlinear operators, computed by the code, are given.

  16. ECG data compression using Jacobi polynomials.

    Science.gov (United States)

    Tchiotsop, Daniel; Wolf, Didier; Louis-Dorr, Valérie; Husson, René

    2007-01-01

    Data compression is a frequent signal processing operation applied to ECG. We present here a method of ECG data compression utilizing Jacobi polynomials. ECG signals are first divided into blocks that match with cardiac cycles before being decomposed in Jacobi polynomials bases. Gauss quadratures mechanism for numerical integration is used to compute Jacobi transforms coefficients. Coefficients of small values are discarded in the reconstruction stage. For experimental purposes, we chose height families of Jacobi polynomials. Various segmentation approaches were considered. We elaborated an efficient strategy to cancel boundary effects. We obtained interesting results compared with ECG compression by wavelet decomposition methods. Some propositions are suggested to improve the results.

  17. Limits of zeros of polynomial sequences

    OpenAIRE

    Zhu, Xinyun; Grossman, George

    2007-01-01

    In the present paper we consider $F_k(x)=x^{k}-\\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree polynomials related to the derivatives and integrals of $F_k(x),$ that form infinite sequences of polynomials, of increasing degree. In particular, as $k \\to \\infty,$ the limiting values of the zeros are determined, for both odd and even cases. It is also ...

  18. Cycles are determined by their domination polynomials

    CERN Document Server

    Akbari, Saieed

    2009-01-01

    Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial $D(G,x)=\\sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. In this paper we show that cycles are determined by their domination polynomials.

  19. Empowering Polynomial Theory Conjectures with Spreadsheets

    Directory of Open Access Journals (Sweden)

    Chris Petersdinh

    2017-06-01

    Full Text Available Polynomial functions and their properties are fundamental to algebra, calculus, and mathematical modeling. Students who do not have a strong understanding of the relationship between factoring and solving equations can have difficulty with optimization problems in calculus and solving application problems in any field. Understanding function transformations is important in trigonometry, the idea of the general antiderivative, and describing the geometry of a problem mathematically. This paper presents spreadsheet activities designed to bolster students' conceptualization of the factorization theorem for polynomials, complex zeros of polynomials, and function transformations. These activities were designed to use a constructivist approach involving student experimentation and conjectures.

  20. A Polynomial Preconditioner for the CMRH Algorithm

    Directory of Open Access Journals (Sweden)

    Jiangzhou Lai

    2011-01-01

    Full Text Available Many large and sparse linear systems can be solved efficiently by restarted GMRES and CMRH methods Sadok 1999. The CMRH(m method is less expensive and requires slightly less storage than GMRES(m. But like GMRES, the restarted CMRH method may not converge. In order to remedy this defect, this paper presents a polynomial preconditioner for CMRH-based algorithm. Numerical experiments are given to show that the polynomial preconditioner is quite simple and easily constructed and the preconditioned CMRH(m with the polynomial preconditioner has better performance than CMRH(m.

  1. On Chebyshev polynomials and torus knots

    OpenAIRE

    Gavrilik, A. M.; Pavlyuk, A. M.

    2009-01-01

    In this work we demonstrate that the q-numbers and their two-parameter generalization, the q,p-numbers, can be used to obtain some polynomial invariants for torus knots and links. First, we show that the q-numbers, which are closely connected with the Chebyshev polynomials, can also be related with the Alexander polynomials for the class T(s,2) of torus knots, s being an odd integer, and used for finding the corresponding skein relation. Then, we develop this procedure in order to obtain, wit...

  2. A bivariate chromatic polynomial for signed graphs

    CERN Document Server

    Beck, Matthias

    2012-01-01

    We study Dohmen--P\\"onitz--Tittmann's bivariate chromatic polynomial $c_\\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\\Gamma$ such that adjacent vertices get different colors if they are $\\le k$. Our first contribution is an extension of $c_\\Gamma(k,l)$ to signed graphs, for which we obtain an inclusion--exclusion formula and several special evaluations giving rise, e.g., to polynomials that encode balanced subgraphs. Our second goal is to derive combinatorial reciprocity theorems for $c_\\Gamma(k,l)$ and its signed-graph analogues, reminiscent of Stanley's reciprocity theorem linking chromatic polynomials to acyclic orientations.

  3. More on rotations as spin matrix polynomials

    Energy Technology Data Exchange (ETDEWEB)

    Curtright, Thomas L. [Department of Physics, University of Miami, Coral Gables, Florida 33124-8046 (United States)

    2015-09-15

    Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful framework to meet this challenge. Central factorial numbers play a key role in the theoretical development. Explicit polynomial coefficients for rotations expressed either as exponentials or as rational Cayley transforms are considered here. Structural features of the results are discussed and compared, and large j limits of the coefficients are examined.

  4. Ultimate Realities: Deterministic and Evolutionary

    Science.gov (United States)

    Moxley, Roy A

    2007-01-01

    References to ultimate reality commonly turn up in the behavioral literature as references to determinism. However, this determinism is often difficult to interpret. There are different kinds of determinisms as well as different kinds of ultimate realities for a behaviorist to consider. To clarify some of the issues involved, the views of ultimate realities are treated as falling along a continuum, with extreme views of complete indeterminism and complete determinism at either end and various mixes in between. Doing so brings into play evolutionary realities and the movement from indeterminism to determinism, as in Peirce's evolutionary cosmology. In addition, this framework helps to show how the views of determinism by B. F. Skinner and other behaviorists have shifted over time. PMID:22478489

  5. Influence of Deterministic Attachments for Large Unifying Hybrid Network Model

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Large unifying hybrid network model (LUHPM) introduced the deterministic mixing ratio fd on the basis of the harmonious unification hybrid preferential model, to describe the influence of deterministic attachment to the network topology characteristics,

  6. Cellular non-deterministic automata and partial differential equations

    Science.gov (United States)

    Kohler, D.; Müller, J.; Wever, U.

    2015-09-01

    We define cellular non-deterministic automata (CNDA) in the spirit of non-deterministic automata theory. They are different from the well-known stochastic automata. We propose the concept of deterministic superautomata to analyze the dynamical behavior of a CNDA and show especially that a CNDA can be embedded in a deterministic cellular automaton. As an application we discuss a connection between certain partial differential equations and CNDA.

  7. Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields

    CERN Document Server

    Bi, Jingguo; Rojas, J Maurice

    2012-01-01

    We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree deterministic sub-linear algorithm for detecting common degree one factors of k-tuples of t-nomials in F_q[x] when k and t are fixed. When t is not fixed we show that each of the following problems is NP-hard with respect to BPP-reductions, even when p is prime: (1) detecting roots in F_p for f, (2) deciding whether the square of a degree one polynomial in F_p[x] divides f, (3) deciding whether the discriminant of f vanishes, (4) deciding whether the gcd of two t-nomials in F_p[x] has positive degree. Finally, we prove that if the complexity of root detection is sub-l...

  8. Twisted Polynomials and Forgery Attacks on GCM

    DEFF Research Database (Denmark)

    Abdelraheem, Mohamed Ahmed A. M. A.; Beelen, Peter; Bogdanov, Andrey;

    2015-01-01

    nonce misuse resistance, such as POET. The algebraic structure of polynomial hashing has given rise to security concerns: At CRYPTO 2008, Handschuh and Preneel describe key recovery attacks, and at FSE 2013, Procter and Cid provide a comprehensive framework for forgery attacks. Both approaches rely...... heavily on the ability to construct forgery polynomials having disjoint sets of roots, with many roots (“weak keys”) each. Constructing such polynomials beyond naïve approaches is crucial for these attacks, but still an open problem. In this paper, we comprehensively address this issue. We propose to use...... in an improved key recovery algorithm. As cryptanalytic applications of our twisted polynomials, we develop the first universal forgery attacks on GCM in the weak-key model that do not require nonce reuse. Moreover, we present universal weak-key forgeries for the nonce-misuse resistant AE scheme POET, which...

  9. Characteristic Polynomials of Complex Random Matrix Models

    CERN Document Server

    Akemann, G

    2003-01-01

    We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written in terms of a determinant containing these polynomials and their kernel. It generalizes the known expression for hermitian matrices and it also provides a generalization of the Christoffel formula to the complex plane. The derivation we present holds for complex matrix models with a general weight function at finite-N, where N is the size of the matrix. We give some explicit examples at finite-N for specific weight functions. The characteristic polynomials in the large-N limit at weak and strong non-hermiticity follow easily and they are universal in the weak limit. We also comment on the issue of the BMN large-N limit.

  10. Handbook on semidefinite, conic and polynomial optimization

    CERN Document Server

    Anjos, Miguel F

    2012-01-01

    This book offers the reader a snapshot of the state-of-the-art in the growing and mutually enriching areas of semidefinite optimization, conic optimization and polynomial optimization. It covers theory, algorithms, software and applications.

  11. Superconformal minimal models and admissible Jack polynomials

    CERN Document Server

    Blondeau-Fournier, Olivier; Ridout, David; Wood, Simon

    2016-01-01

    We give new proofs of the rationality of the N=1 superconformal minimal model vertex operator superalgebras and of the classification of their modules in both the Neveu-Schwarz and Ramond sectors. For this, we combine the standard free field realisation with the theory of Jack symmetric functions. A key role is played by Jack symmetric polynomials with a certain negative parameter that are labelled by admissible partitions. These polynomials are shown to describe free fermion correlators, suitably dressed by a symmetrising factor. The classification proofs concentrate on explicitly identifying Zhu's algebra and its twisted analogue. Interestingly, these identifications do not use an explicit expression for the non-trivial vacuum singular vector. While the latter is known to be expressible in terms of an Uglov symmetric polynomial or a linear combination of Jack superpolynomials, it turns out that standard Jack polynomials (and functions) suffice to prove the classification.

  12. Tutte Polynomial of Scale-Free Networks

    Science.gov (United States)

    Chen, Hanlin; Deng, Hanyuan

    2016-05-01

    The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both statistical physics and combinatorics. The computation of this invariant for a graph is NP-hard in general. In this paper, we focus on two iteratively growing scale-free networks, which are ubiquitous in real-life systems. Based on their self-similar structures, we mainly obtain recursive formulas for the Tutte polynomials of two scale-free networks (lattices), one is fractal and "large world", while the other is non-fractal but possess the small-world property. Furthermore, we give some exact analytical expressions of the Tutte polynomial for several special points at ( x, y)-plane, such as, the number of spanning trees, the number of acyclic orientations, etc.

  13. Local Polynomial Estimation of Distribution Functions

    Institute of Scientific and Technical Information of China (English)

    LI Yong-hong; ZENG Xia

    2007-01-01

    Under the condition that the total distribution function is continuous and bounded on (-∞,∞), we constructed estimations for distribution and hazard functions with local polynomial method, and obtained the rate of strong convergence of the estimations.

  14. Hermite polynomials and quasi-classical asymptotics

    Energy Technology Data Exchange (ETDEWEB)

    Ali, S. Twareque, E-mail: twareque.ali@concordia.ca [Department of Mathematics and Statistics, Concordia University, Montréal, Québec H3G 1M8 (Canada); Engliš, Miroslav, E-mail: englis@math.cas.cz [Mathematics Institute, Silesian University in Opava, Na Rybníčku 1, 74601 Opava, Czech Republic and Mathematics Institute, Žitná 25, 11567 Prague 1 (Czech Republic)

    2014-04-15

    We study an unorthodox variant of the Berezin-Toeplitz type of quantization scheme, on a reproducing kernel Hilbert space generated by the real Hermite polynomials and work out the associated quasi-classical asymptotics.

  15. Generation of multivariate Hermite interpolating polynomials

    CERN Document Server

    Tavares, Santiago Alves

    2005-01-01

    Generation of Multivariate Hermite Interpolating Polynomials advances the study of approximate solutions to partial differential equations by presenting a novel approach that employs Hermite interpolating polynomials and bysupplying algorithms useful in applying this approach.Organized into three sections, the book begins with a thorough examination of constrained numbers, which form the basis for constructing interpolating polynomials. The author develops their geometric representation in coordinate systems in several dimensions and presents generating algorithms for each level number. He then discusses their applications in computing the derivative of the product of functions of several variables and in the construction of expression for n-dimensional natural numbers. Section II focuses on the construction of Hermite interpolating polynomials, from their characterizing properties and generating algorithms to a graphical analysis of their behavior. The final section of the book is dedicated to the applicatio...

  16. Concentration for noncommutative polynomials in random matrices

    OpenAIRE

    2011-01-01

    We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries and unitary or orthogonal matrices.

  17. Limits of zeros of polynomial sequences

    CERN Document Server

    Zhu, Xinyun

    2007-01-01

    In the present paper we consider $F_k(x)=x^{k}-\\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree polynomials related to the derivatives and integrals of $F_k(x),$ that form infinite sequences of polynomials, of increasing degree. In particular, as $k \\to \\infty,$ the limiting values of the zeros are determined, for both odd and even cases. It is also shown, in both cases, that the convergence is monotone for sufficiently large degree. We give an upper bound for the modulus of the complex zeros of the polynomials for each sequence. This gives a general solution related to problems considered by Dubeau 1989, 1993, Miles 1960, Flores 1967, Miller 1971 and later by the second author in the present paper, and Narayan 1997.

  18. High-order polynomial expansions for reactor kinetics

    Energy Technology Data Exchange (ETDEWEB)

    Molina, J.L. [Instituto Balseiro, San Carlos de Bariloche (Argentina); Jatuff, F.E. [Investigacion Aplicada SE (INVAP), San Carlos de Bariloche (Argentina)

    1996-08-01

    Laguerre, Hermite and Legendre polynomial bases were studied for high order time expansions of reactor kinetics solutions. A theorem showing an exponential majoring function for the solution of bounded reactivity transients introduce Laguerre, Hermite and Legendre polynomials for semi-infinite, infinite and finite time domains, respectively. The numerical solutions were obtained by means of the construction of an error estimator and its minimization using a conventional variational method. Some point reactor kinetics problems with exact solution were tested. The results showed a numerical monotone convergent behavior and accuracy, but problem-dependent efficiency caused by the extremely large expansion orders (more than 200 terms) needed in the studied bases for the cases with large reactivity insertions. (author) 13 refs., 5 figs., 4 tabs.

  19. [Deterministic and stochastic identification of neurophysiologic systems].

    Science.gov (United States)

    Piatigorskiĭ, B Ia; Kostiukov, A I; Chinarov, V A; Cherkasskiĭ, V L

    1984-01-01

    The paper deals with deterministic and stochastic identification methods applied to the concrete neurophysiological systems. The deterministic identification was carried out for the system: efferent fibres-muscle. The obtained transition characteristics demonstrated dynamic nonlinearity of the system. Identification of the neuronal model and the "afferent fibres-synapses-neuron" system in mollusc Planorbis corneus was carried out using the stochastic methods. For these purpose the Wiener method of stochastic identification was expanded for the case of pulse trains as input and output signals. The weight of the nonlinear component in the Wiener model and accuracy of the model prediction were quantitatively estimated. The results obtained proves the possibility of using these identification methods for various neurophysiological systems.

  20. Advances in stochastic and deterministic global optimization

    CERN Document Server

    Zhigljavsky, Anatoly; Žilinskas, Julius

    2016-01-01

    Current research results in stochastic and deterministic global optimization including single and multiple objectives are explored and presented in this book by leading specialists from various fields. Contributions include applications to multidimensional data visualization, regression, survey calibration, inventory management, timetabling, chemical engineering, energy systems, and competitive facility location. Graduate students, researchers, and scientists in computer science, numerical analysis, optimization, and applied mathematics will be fascinated by the theoretical, computational, and application-oriented aspects of stochastic and deterministic global optimization explored in this book. This volume is dedicated to the 70th birthday of Antanas Žilinskas who is a leading world expert in global optimization. Professor Žilinskas's research has concentrated on studying models for the objective function, the development and implementation of efficient algorithms for global optimization with single and mu...

  1. Bayesian Uncertainty Analyses Via Deterministic Model

    Science.gov (United States)

    Krzysztofowicz, R.

    2001-05-01

    Rational decision-making requires that the total uncertainty about a variate of interest (a predictand) be quantified in terms of a probability distribution, conditional on all available information and knowledge. Suppose the state-of-knowledge is embodied in a deterministic model, which is imperfect and outputs only an estimate of the predictand. Fundamentals are presented of three Bayesian approaches to producing a probability distribution of the predictand via any deterministic model. The Bayesian Processor of Output (BPO) quantifies the total uncertainty in terms of a posterior distribution, conditional on model output. The Bayesian Processor of Ensemble (BPE) quantifies the total uncertainty in terms of a posterior distribution, conditional on an ensemble of model output. The Bayesian Forecasting System (BFS) decomposes the total uncertainty into input uncertainty and model uncertainty, which are characterized independently and then integrated into a predictive distribution.

  2. Microscopy with a Deterministic Single Ion Source

    CERN Document Server

    Jacob, Georg; Wolf, Sebastian; Ulm, Stefan; Couturier, Luc; Dawkins, Samuel T; Poschinger, Ulrich G; Schmidt-Kaler, Ferdinand; Singer, Kilian

    2015-01-01

    We realize a single particle microscope by using deterministically extracted laser cooled $^{40}$Ca$^+$ ions from a Paul trap as probe particles for transmission imaging. We demonstrate focusing of the ions with a resolution of 5.8$\\;\\pm\\;$1.0$\\,$nm and a minimum two-sample deviation of the beam position of 1.5$\\,$nm in the focal plane. The deterministic source, even when used in combination with an imperfect detector, gives rise to much higher signal to noise ratios as compared with conventional Poissonian sources. Gating of the detector signal by the extraction event suppresses dark counts by 6 orders of magnitude. We implement a Bayes experimental design approach to microscopy in order to maximize the gain in spatial information. We demonstrate this method by determining the position of a 1$\\,\\mu$m circular hole structure to an accuracy of 2.7$\\,$nm using only 579 probe particles.

  3. Deterministic nonlinear systems a short course

    CERN Document Server

    Anishchenko, Vadim S; Strelkova, Galina I

    2014-01-01

    This text is a short yet complete course on nonlinear dynamics of deterministic systems. Conceived as a modular set of 15 concise lectures it reflects the many years of teaching experience by the authors. The lectures treat in turn the fundamental aspects of the theory of dynamical systems, aspects of stability and bifurcations, the theory of deterministic chaos and attractor dimensions, as well as the elements of the theory of Poincare recurrences.Particular attention is paid to the analysis of the generation of periodic, quasiperiodic and chaotic self-sustained oscillations and to the issue of synchronization in such systems.  This book is aimed at graduate students and non-specialist researchers with a background in physics, applied mathematics and engineering wishing to enter this exciting field of research.

  4. Deterministic Leader Election Among Disoriented Anonymous Sensors

    CERN Document Server

    dieudonné, Yoann; Petit, Franck; Villain, Vincent

    2012-01-01

    We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. Leader Election is a fundamental symmetry breaking problem in distributed computing. Its goal is to assign value 1 (leader) to one of the entities and value 0 (non-leader) to all others. In this paper, assuming n > 1 disoriented anonymous sensors, we provide a complete charac- terization on the sensors positions to deterministically elect a leader, provided that all the sensors' positions are known by every sensor. More precisely, our contribution is twofold: First, assuming n anonymous sensors agreeing on a common handedness (chirality) of their own coordinate system, we provide a complete characterization on the sensors positions to deterministically elect a leader. Second, we also provide such a complete chararacterization for sensors devoided of a common handedness. Both characterizations rely on a particular object from combinatorics on words, namely the Lyndon Words.

  5. Polynomial Subtraction Method for Disconnected Quark Loops

    CERN Document Server

    Liu, Quan; Morgan, Ron

    2014-01-01

    The polynomial subtraction method, a new numerical approach for reducing the noise variance of Lattice QCD disconnected matrix elements calculation, is introduced in this paper. We use the MinRes polynomial expansion of the QCD matrix as the approximation to the matrix inverse and get a significant reduction in the variance calculation. We compare our results with that of the perturbative subtraction and find that the new strategy yields a faster decrease in variance which increases with quark mass.

  6. Recursive Polynomial Remainder Sequence and its Subresultants

    OpenAIRE

    Terui, Akira

    2008-01-01

    We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial polynomials, a sequence of PRSs calculated "recursively" for the GCD and its derivative until a constant is derived, and recursive subresultants are defined by determinants representing the coefficients in recursive PRS as functions of coefficients of init...

  7. Subresultants in Recursive Polynomial Remainder Sequence

    OpenAIRE

    Terui, Akira

    2008-01-01

    We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we calculate "recursively" with new PRS for the GCD and its derivative, until a constant is derived. We call such a PRS a recursive PRS. We define recursive subresultants to be determinants representing the coefficients in recursive PRS by coefficients of initial po...

  8. Ferrers Matrices Characterized by the Rook Polynomials

    Institute of Scientific and Technical Information of China (English)

    MAHai-cheng; HUSheng-biao

    2003-01-01

    In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.

  9. Blind Signature Scheme Based on Chebyshev Polynomials

    Directory of Open Access Journals (Sweden)

    Maheswara Rao Valluri

    2011-12-01

    Full Text Available A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.

  10. Blind Signature Scheme Based on Chebyshev Polynomials

    OpenAIRE

    Maheswara Rao Valluri

    2011-01-01

    A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair. This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms ofChebyshev polynomials.

  11. Rational Convolution Roots of Isobaric Polynomials

    OpenAIRE

    Conci, Aura; Li, Huilan; MacHenry, Trueman

    2014-01-01

    In this paper, we exhibit two matrix representations of the rational roots of generalized Fibonacci polynomials (GFPs) under convolution product, in terms of determinants and permanents, respectively. The underlying root formulas for GFPs and for weighted isobaric polynomials (WIPs), which appeared in an earlier paper by MacHenry and Tudose, make use of two types of operators. These operators are derived from the generating functions for Stirling numbers of the first kind and second kind. Hen...

  12. On Certain Divisibility Property of Polynomials

    CERN Document Server

    Caceres, Luis F

    2010-01-01

    We review the definition of D-rings introduced by H. Gunji & D. L. MacQuillan. We provide an alternative characterization for such rings that allows us to give an elementary proof of that a ring of algebraic integers is a D-ring. Moreover, we give a characterization for D-rings that are also unique factorization domains to determine divisibility of polynomials using polynomial evaluations.

  13. Positive maps, positive polynomials and entanglement witnesses

    CERN Document Server

    Skowronek, Lukasz

    2009-01-01

    We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic forms that are not sums of squares. Although the general problem of describing the set of positive maps remains open, in some particular cases we solve the corresponding polynomial inequalities and obtain explicit conditions for positivity.

  14. Positive maps, positive polynomials and entanglement witnesses

    Energy Technology Data Exchange (ETDEWEB)

    Skowronek, Lukasz; Zyczkowski, Karol [Institute of Physics, Jagiellonian University, Krakow (Poland)], E-mail: lukasz.skowronek@uj.edu.pl, E-mail: karol@tatry.if.uj.edu.pl

    2009-08-14

    We link the study of positive quantum maps, block positive operators and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic forms that are not sums of squares. Although the general problem of describing the set of positive maps remains open, in some particular cases we solve the corresponding polynomial inequalities and obtain explicit conditions for positivity.

  15. ON ABEL-GONTSCHAROFF-GOULD'S POLYNOMIALS

    Institute of Scientific and Technical Information of China (English)

    He Tianxiao; Leetsch C. Hsu; Peter J. S. Shiue

    2003-01-01

    In this paper a connective study of Gould's annihilation coefficients and Abel-Gontscharoff polynomials is presented. It is shown that Gould's annihilation coefficients and Abel-Gontscharoff polynomials are actually equivalent to each other under certain linear substitutions for the variables. Moreover, a pair of related expansion formulas involving Gontscharoff's remainder and a new form of it are demonstrated, and also illustrated with several examples.

  16. Local fibred right adjoints are polynomial

    DEFF Research Database (Denmark)

    Kock, Anders; Kock, Joachim

    2013-01-01

    For any locally cartesian closed category E, we prove that a local fibred right adjoint between slices of E is given by a polynomial. The slices in question are taken in a well known fibred sense......For any locally cartesian closed category E, we prove that a local fibred right adjoint between slices of E is given by a polynomial. The slices in question are taken in a well known fibred sense...

  17. Laguerre polynomials method in the valon model

    CERN Document Server

    Boroun, G R

    2014-01-01

    We used the Laguerre polynomials method for determination of the proton structure function in the valon model. We have examined the applicability of the valon model with respect to a very elegant method, where the structure of the proton is determined by expanding valon distributions and valon structure functions on Laguerre polynomials. We compared our results with the experimental data, GJR parameterization and DL model. Having checked, this method gives a good description for the proton structure function in valon model.

  18. Two-particle correlations via quasi-deterministic analyzer model

    CERN Document Server

    Dalton, B J

    2001-01-01

    We introduce a quasi-deterministic eigenstate transition model of analyzers in which the final eigenstate is selected by initial conditions. We combine this analyzer model with causal spin coupling to calculate both proton-proton and photon-photon correlations, one particle pair at a time. The calculated correlations exceed the Bell limits and show excellent agreement with the measured correlations of [M. Lamehi-Rachti and W. Mittig, Phys. Rev. D 14 (10), 2543 (1976)] and [ A. Aspect, P. Grangier and G. Rogers, Phys. Rev. Lett. 49 91 (1982)] respectively. We discuss why this model exceeds the Bell type limits.

  19. Deterministic nanoassembly: Neutral or plasma route?

    Science.gov (United States)

    Levchenko, I.; Ostrikov, K.; Keidar, M.; Xu, S.

    2006-07-01

    It is shown that, owing to selective delivery of ionic and neutral building blocks directly from the ionized gas phase and via surface migration, plasma environments offer a better deal of deterministic synthesis of ordered nanoassemblies compared to thermal chemical vapor deposition. The results of hybrid Monte Carlo (gas phase) and adatom self-organization (surface) simulation suggest that higher aspect ratios and better size and pattern uniformity of carbon nanotip microemitters can be achieved via the plasma route.

  20. Deterministic Pattern Classifier Based on Genetic Programming

    Institute of Scientific and Technical Information of China (English)

    LI Jian-wu; LI Min-qiang; KOU Ji-song

    2001-01-01

    This paper proposes a supervised training-test method with Genetic Programming (GP) for pattern classification. Compared and contrasted with traditional methods with regard to deterministic pattern classifiers, this method is true for both linear separable problems and linear non-separable problems. For specific training samples, it can formulate the expression of discriminate function well without any prior knowledge. At last, an experiment is conducted, and the result reveals that this system is effective and practical.

  1. Deterministic definition of the capital risk

    OpenAIRE

    Anna Szczypinska; Piotrowski, Edward W.

    2008-01-01

    In this paper we propose a look at the capital risk problem inspired by deterministic, known from classical mechanics, problem of juggling. We propose capital equivalents to the Newton's laws of motion and on this basis we determine the most secure form of credit repayment with regard to maximisation of profit. Then we extend the Newton's laws to models in linear spaces of arbitrary dimension with the help of matrix rates of return. The matrix rates describe the evolution of multidimensional ...

  2. Schroedinger difference equation with deterministic ergodic potentials

    CERN Document Server

    Suto, Andras

    2012-01-01

    We review the recent developments in the theory of the one-dimensional tight-binding Schr\\"odinger equation for a class of deterministic ergodic potentials. In the typical examples the potentials are generated by substitutional sequences, like the Fibonacci or the Thue-Morse sequence. We concentrate on rigorous results which will be explained rather than proved. The necessary mathematical background is provided in the text.

  3. Vector-Valued Jack Polynomials from Scratch

    Directory of Open Access Journals (Sweden)

    Jean-Gabriel Luque

    2011-03-01

    Full Text Available Vector-valued Jack polynomials associated to the symmetric group S_N are polynomials with multiplicities in an irreducible module of S_N and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators with some additional properties concerning the leading monomial. These polynomials were introduced by Griffeth in the general setting of the complex reflections groups G(r,p,N and studied by one of the authors (C. Dunkl in the specialization r=p=1 (i.e. for the symmetric group. By adapting a construction due to Lascoux, we describe an algorithm allowing us to compute explicitly the Jack polynomials following a Yang-Baxter graph. We recover some properties already studied by C. Dunkl and restate them in terms of graphs together with additional new results. In particular, we investigate normalization, symmetrization and antisymmetrization, polynomials with minimal degree, restriction etc. We give also a shifted version of the construction and we discuss vanishing properties of the associated polynomials.

  4. Deterministic approach to microscopic three-phase traffic theory

    CERN Document Server

    Kerner, B S; Kerner, Boris S.; Klenov, Sergey L.

    2005-01-01

    A deterministic approach to three-phase traffic theory is presented. Two different deterministic microscopic traffic flow models are introduced. In an acceleration time delay model (ATD-model), different time delays in driver acceleration associated with driver behavior in various local driving situations are explicitly incorporated into the model. Vehicle acceleration depends on local traffic situation, i.e., whether a driver is within the free flow, or synchronized flow, or else wide moving jam traffic phase. In a speed adaptation model (SA-model), driver time delays are simulated as a model effect: Rather than driver acceleration, vehicle speed adaptation occurs with different time delays depending on one of the three traffic phases in which the vehicle is in. It is found that the ATD- and SA-models show spatiotemporal congested traffic patterns that are adequate with empirical results. It is shown that in accordance with empirical results in the ATD- and SA-models the onset of congestion in free flow at a...

  5. Polynomial cointegration tests of anthropogenic impact on global warming

    OpenAIRE

    M. Beenstock; Reingewertz, Y.; N. Paldor

    2012-01-01

    We use statistical methods for nonstationary time series to test the anthropogenic interpretation of global warming (AGW), according to which an increase in atmospheric greenhouse gas concentrations raised global temperature in the 20th century. Specifically, the methodology of polynomial cointegration is used to test AGW since during the observation period (1880–2007) global temperature and solar irradiance are stationary in 1st differences, whereas greenhouse gas and aerosol forcings are st...

  6. Wireless Network Information Flow: A Deterministic Approach

    CERN Document Server

    Avestimehr, Salman; Tse, David

    2009-01-01

    In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and for this model, the capacity of even a network with a single relay node is open for 30 years. In this paper, we present a deterministic approach to this problem by focusing on the signal interaction rather than the noise. To this end, we propose a deterministic channel model which is analytically simpler than the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and one or more destinations (all interested in the same information) and an arbitrary number of relay nodes....

  7. Deterministic Mean-Field Ensemble Kalman Filtering

    KAUST Repository

    Law, Kody J. H.

    2016-05-03

    The proof of convergence of the standard ensemble Kalman filter (EnKF) from Le Gland, Monbet, and Tran [Large sample asymptotics for the ensemble Kalman filter, in The Oxford Handbook of Nonlinear Filtering, Oxford University Press, Oxford, UK, 2011, pp. 598--631] is extended to non-Gaussian state-space models. A density-based deterministic approximation of the mean-field limit EnKF (DMFEnKF) is proposed, consisting of a PDE solver and a quadrature rule. Given a certain minimal order of convergence k between the two, this extends to the deterministic filter approximation, which is therefore asymptotically superior to standard EnKF for dimension d<2k. The fidelity of approximation of the true distribution is also established using an extension of the total variation metric to random measures. This is limited by a Gaussian bias term arising from nonlinearity/non-Gaussianity of the model, which arises in both deterministic and standard EnKF. Numerical results support and extend the theory.

  8. Connection between stochastic and deterministic modelling of microbial growth.

    Science.gov (United States)

    Kutalik, Zoltán; Razaz, Moe; Baranyi, József

    2005-01-21

    We present in this paper various links between individual and population cell growth. Deterministic models of the lag and subsequent growth of a bacterial population and their connection with stochastic models for the lag and subsequent generation times of individual cells are analysed. We derived the individual lag time distribution inherent in population growth models, which shows that the Baranyi model allows a wide range of shapes for individual lag time distribution. We demonstrate that individual cell lag time distributions cannot be retrieved from population growth data. We also present the results of our investigation on the effect of the mean and variance of the individual lag time and the initial cell number on the mean and variance of the population lag time. These relationships are analysed theoretically, and their consequence for predictive microbiology research is discussed.

  9. Solute Transport in a Heterogeneous Aquifer: A Nonlinear Deterministic Dynamical Analysis

    Science.gov (United States)

    Sivakumar, B.; Harter, T.; Zhang, H.

    2003-04-01

    Stochastic approaches are widely used for modeling and prediction of uncertainty in groundwater flow and transport processes. An important reason for this is our belief that the dynamics of the seemingly complex and highly irregular subsurface processes are essentially random in nature. However, the discovery of nonlinear deterministic dynamical theory has revealed that random-looking behavior could also be the result of simple deterministic mechanisms influenced by only a few nonlinear interdependent variables. The purpose of the present study is to introduce this theory to subsurface solute transport process, in an attempt to investigate the possibility of understanding the transport dynamics in a much simpler, deterministic, manner. To this effect, salt transport process in a heterogeneous aquifer medium is studied. Specifically, time series of arrival time of salt particles are analyzed. These time series are obtained by integrating a geostatistical (transition probability/Markov chain) model with a groundwater flow model (MODFLOW) and a salt transport (Random Walk Particle) model. The (dynamical) behavior of the transport process (nonlinear deterministic or stochastic) is identified using standard statistical techniques (e.g. autocorrelation function, power spectrum) as well as specific nonlinear deterministic dynamical techniques (e.g. phase-space diagram, correlation dimension method). The sensitivity of the salt transport dynamical behavior to the hydrostratigraphic parameters (i.e. number, volume proportions, mean lengths, and juxtapositional tendencies of facies) used in the transition probability/Markov chain model is also studied. The results indicate that the salt transport process may exhibit very simple (i.e. deterministic) to very complex (i.e. stochastic) dynamical behavior, depending upon the above parameters (i.e. characteristics of the aquifer medium). Efforts towards verification and strengthening of the present results and prediction of salt

  10. A generalization of the dichromatic polynomial of a graph

    OpenAIRE

    1981-01-01

    The Subgraph polynomial fo a graph pair (G,H), where H⫅G, is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial of G. This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.

  11. Interpolation on Real Algebraic Curves to Polynomial Data

    Directory of Open Access Journals (Sweden)

    Len Bos

    2013-04-01

    Full Text Available We discuss a polynomial interpolation problem where the data are of the form of a set of algebraic curves in R^2 on each of which is prescribed a polynomial. The object is then to construct a global bivariate polynomial that agrees with the given polynomials when restricted to the corresponding curves.

  12. On λ-Bell polynomials associated with umbral calculus

    Science.gov (United States)

    Kim, T.; Kim, D. S.

    2017-01-01

    In this paper, we introduce some new λ-Bell polynomials and Bell polynomials of the second kind and investigate properties of these polynomials. Using our investigation, we derive some new identities for the two kinds of λ-Bell polynomials arising from umbral calculus.

  13. Matrix-valued polynomials in Lanczos type methods

    Energy Technology Data Exchange (ETDEWEB)

    Simoncini, V. [Universita di Padova (Italy); Gallopoulos, E. [Univ. of Illinois, Urbana, IL (United States)

    1994-12-31

    It is well known that convergence properties of iterative methods can be derived by studying the behavior of the residual polynomial over a suitable domain of the complex plane. Block Krylov subspace methods for the solution of linear systems A[x{sub 1},{hor_ellipsis}, x{sub s}] = [b{sub 1},{hor_ellipsis}, b{sub s}] lead to the generation of residual polynomials {phi}{sub m} {element_of} {bar P}{sub m,s} where {bar P}{sub m,s} is the subset of matrix-valued polynomials of maximum degree m and size s such that {phi}{sub m}(0) = I{sub s}, R{sub m} := B - AX{sub m} = {phi}{sub m}(A) {circ} R{sub 0}, where {phi}{sub m}(A) {circ} R{sub 0} := R{sub 0} - A{summation}{sub j=0}{sup m-1} A{sup j}R{sub 0}{xi}{sub j}, {xi}{sub j} {element_of} R{sup sxs}. An effective method has to balance adequate approximation with economical computation of iterates defined by the polynomial. Matrix valued polynomials can be used to improve the performance of block methods. Another approach is to solve for a single right-hand side at a time and use the generated information in order to update the approximations of the remaining systems. In light of this, a more general scheme is as follows: A subset of residuals (seeds) is selected and a block short term recurrence method is used to compute approximate solutions for the corresponding systems. At the same time the generated matrix valued polynomial is implicitly applied to the remaining residuals. Subsequently a new set of seeds is selected and the process is continued as above, till convergence of all right-hand sides. The use of a quasi-minimization technique ensures a smooth convergence behavior for all systems. In this talk the authors discuss the implementation of this class of algorithms and formulate strategies for the selection of parameters involved in the computation. Experiments and comparisons with other methods will be presented.

  14. Interpolation Functions of -Extensions of Apostol's Type Euler Polynomials

    Directory of Open Access Journals (Sweden)

    Kim Young-Hee

    2009-01-01

    Full Text Available The main purpose of this paper is to present new -extensions of Apostol's type Euler polynomials using the fermionic -adic integral on . We define the - -Euler polynomials and obtain the interpolation functions and the Hurwitz type zeta functions of these polynomials. We define -extensions of Apostol type's Euler polynomials of higher order using the multivariate fermionic -adic integral on . We have the interpolation functions of these - -Euler polynomials. We also give -extensions of Apostol's type Euler polynomials of higher order and have the multiple Hurwitz type zeta functions of these - -Euler polynomials.

  15. Zeros of Jones polynomials for families of knots and links

    Science.gov (United States)

    Chang, S.-C.; Shrock, R.

    2001-12-01

    We calculate Jones polynomials VL( t) for several families of alternating knots and links by computing the Tutte polynomials T( G, x, y) for the associated graphs G and then obtaining VL( t) as a special case of the Tutte polynomial. For each of these families we determine the zeros of the Jones polynomial, including the accumulation set in the limit of infinitely many crossings. A discussion is also given of the calculation of Jones polynomials for non-alternating links.

  16. BTM: A Single-Key, Inverse-Cipher-Free Mode for Deterministic Authenticated Encryption

    Science.gov (United States)

    Iwata, Tetsu; Yasuda, Kan

    We present a new blockcipher mode of operation named BTM, which stands for Bivariate Tag Mixing. BTM falls into the category of Deterministic Authenticated Encryption, which we call DAE for short. BTM makes all-around improvements over the previous two DAE constructions, SIV (Eurocrypt 2006) and HBS (FSE 2009). Specifically, our BTM requires just one blockcipher key, whereas SIV requires two. Our BTM does not require the decryption algorithm of the underlying blockcipher, whereas HBS does. The BTM mode utilizes bivariate polynomial hashing for authentication, which enables us to handle vectorial inputs of dynamic dimensions. BTM then generates an initial value for its counter mode of encryption by mixing the resulting tag with one of the two variables (hash keys), which avoids the need for an implementation of the inverse cipher.

  17. Collective Lorentz invariant dynamics on a single "polynomial" worldline

    CERN Document Server

    Kassandrov, Vladimir V; Markova, Nina V

    2015-01-01

    Consider a worldline of a pointlike particle parametrized by polynomial functions, together with the light cone ("retardation") equation of an inertially moving observer. Then a set of apparent copies ("duplicons") of the single pointlike particle defined by the roots of the retardation equation and localized on one and the same worldline will be detected by the observer. We prove that for any "polynomial" worldline the induced collective dynamics of duplicons obeys a whole set of canonical conservation laws (for total momentum, angular momentum and the analogue of mechanical energy). Explicit formulas for the values of total angular momentum and the analogue of total rest energy (rest mass) are obtained; the latter is "self-quantized", i.e. for any worldline takes only integer values. The dynamics is Lorentz invariant though different from the canonical relativistic mechanics. Asymptotically, at large values of the observer's proper time, the duplicons split themselves into pairs ("first phase transition") a...

  18. Convergence properties of polynomial chaos approximations for L2 random variables.

    Energy Technology Data Exchange (ETDEWEB)

    Field, Richard V., Jr. (.,; .); Grigoriu, Mircea (Cornell University, Ithaca, NY)

    2007-03-01

    Polynomial chaos (PC) representations for non-Gaussian random variables are infinite series of Hermite polynomials of standard Gaussian random variables with deterministic coefficients. For calculations, the PC representations are truncated, creating what are herein referred to as PC approximations. We study some convergence properties of PC approximations for L{sub 2} random variables. The well-known property of mean-square convergence is reviewed. Mathematical proof is then provided to show that higher-order moments (i.e., greater than two) of PC approximations may or may not converge as the number of terms retained in the series, denoted by n, grows large. In particular, it is shown that the third absolute moment of the PC approximation for a lognormal random variable does converge, while moments of order four and higher of PC approximations for uniform random variables do not converge. It has been previously demonstrated through numerical study that this lack of convergence in the higher-order moments can have a profound effect on the rate of convergence of the tails of the distribution of the PC approximation. As a result, reliability estimates based on PC approximations can exhibit large errors, even when n is large. The purpose of this report is not to criticize the use of polynomial chaos for probabilistic analysis but, rather, to motivate the need for further study of the efficacy of the method.

  19. Lower bounds for polynomials using geometric programming

    CERN Document Server

    Ghasemi, Mehdi

    2011-01-01

    We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\\in\\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This result generalizes a result of Lasserre and a result of Fidalgo and Kovacec, and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound $f_{gp}$ for $f$, and we explain how $f_{gp}$ can be computed using geometric programming. The lower bound $f_{gp}$ is generally not as good as the lower bound $f_{sos}$ introduced by Lasserre and Parrilo and Sturmfels, which is computed using semidefinite programming, but a run time comparison shows that, in practice, the computation of $f_{gp}$ is much faster. The computation is simplest when the highest degree term of $f$ has the form $\\sum_{i=1}^n a_iX_i^{2d}$, $a_i>0$, $i=1,...,n$. The lower bounds for $f$ established in [6] are obtained by evaluating the objective function ...

  20. Polynomial Linear Programming with Gaussian Belief Propagation

    CERN Document Server

    Bickson, Danny; Shental, Ori; Dolev, Danny

    2008-01-01

    Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typically solves LP problems in time O(n^{3.5}), where $n$ is the number of unknown variables. Karmarkar's celebrated algorithm is known to be an instance of the log-barrier method using the Newton iteration. The main computational overhead of this method is in inverting the Hessian matrix of the Newton iteration. In this contribution, we propose the application of the Gaussian belief propagation (GaBP) algorithm as part of an efficient and distributed LP solver that exploits the sparse and symmetric structure of the Hessian matrix and avoids the need for direct matrix inversion. This approach shifts the computation from realm of linear algebra to that of probabilistic inference on graphical models, thus applying GaBP as an efficient inference engine. Our construction is general and can be used for any interior-point algorithm which uses the Newt...