Search results for "Exponent"

showing 10 items of 896 documents

Dynamical scaling of surface growth in simple lattice models

2003

We present extensive simulations of the atomistic Edwards-Wilkinson (EW) and Restricted Edwards-Wilkinson (REW) models in 2+1 dimensions. Dynamic finite-size scaling analyses of the interfacial width and structure factor provide the estimates for the dynamic exponent z=1.65+/-0.05 for the EW model and z=2.0+/-0.1 for the REW model. The stochastic contribution to the interface velocity U due to the deposition and diffusion of particles is characterized for both the models using a blocking procedure. For the EW model the time-displaced temporal correlations in U show nonexponential decay, while the temporal correlations decay exponentially for the REW model. Dynamical scaling of the temporal …

Exponential growthDynamical scalingLattice (order)ExponentAstrophysics::Cosmology and Extragalactic AstrophysicsStatistical physicsTemporal correlationStructure factorScalingMathematicsPhysical Review E
researchProduct

Bayesian forecasting of demand time-series data with zero values

2013

This paper describes the development of a Bayesian procedure to analyse and forecast positive demand time-series data with a proportion of zero values and a high level of variability for the non-zero data. The resulting forecasts play decisive roles in organisational planning, budgeting, and performance monitoring. Exponential smoothing methods are widely used as forecasting techniques in industry and business. However, they can be unsuitable for the analysis of non-negative demand time-series data with the aforementioned features. In this paper, an unconstrained latent demand underlying the observed demand is introduced into the linear heteroscedastic model associated with the Holt-Winters…

Exponential smoothingBayesian probabilityEconometricsEconomicsPerformance monitoringHeteroscedastic modelDemand forecastingSupply chain planningTime seriesIndustrial and Manufacturing EngineeringZero (linguistics)European J. of Industrial Engineering
researchProduct

Robust synchronization and fault detection of uncertain master-slave systems with mixed time-varying delays and nonlinear perturbations

2010

In this paper, the problem of robust synchronization and fault detection for a class of master-slave systems subjected to some nonlinear perturbations and mixed neutral and discrete time-varying delays is investigated based on an H ∞ performance condition. By introducing a descriptor technique, using Lyapunov-Krasovskii functional and a suitable change of variables, new required sufficient conditions are established in terms of delay-dependent linear matrix inequalities to synthesize the residual generation scheme. The explicit expression of the synchronization law is derived for the fault such that both asymptotic stability and a prescribed level of disturbance attenuation are satisfied fo…

Exponential stabilityDynamical systems theoryControl theoryRobustness (computer science)Master/slaveRobust controlFault (power engineering)Fault detection and isolationSynchronizationMathematics2010 Conference on Control and Fault-Tolerant Systems (SysTol)
researchProduct

Positive l<inf>1</inf> observer design for positive switched systems with time-varying delays via delta operator approach

2014

Exponential stabilityObserver (quantum physics)Control theoryDelta operatorMathematicsThe 26th Chinese Control and Decision Conference (2014 CCDC)
researchProduct

Right-jumps and pattern avoiding permutations

2015

We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iterations from the identity is a class of pattern avoiding permutations. We characterize the elements of the basis of this class and we enumerate these "forbidden minimal patterns" by giving their bivariate exponential generating function: we achieve this via a catalytic variable, the number of left-to-right maxima. We show that this generating function is a D-finite function satisfying a nice differential equation of order~2. We give some congruence properties for the coefficients of this generating function, and we sho…

FOS: Computer and information sciencesD-finite function[ MATH.MATH-CV ] Mathematics [math]/Complex Variables [math.CV]Discrete Mathematics (cs.DM)General Computer Scienceinsertion sort[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]left-to-right maximumPermutation patternTheoretical Computer Science[ MATH.MATH-NT ] Mathematics [math]/Number Theory [math.NT]Combinatorics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: Mathematicsanalytic combinatoricsMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsGolden ratioMathematicsProbability (math.PR)Generating function[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][MATH.MATH-CV]Mathematics [math]/Complex Variables [math.CV]Function (mathematics)[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]Exponential function[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]generating functionPermutation patternExponentAnalytic combinatoricssupercongruenceCombinatorics (math.CO)Maxima[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityComputer Science - Discrete Mathematics
researchProduct

Anti-powers in infinite words

2018

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of ev…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ConcatenationComputer Science - Formal Languages and Automata Theory68R150102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsUnavoidable regularityPosition (vector)Infinite wordAvoidability[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsOrder (group theory)Point (geometry)0101 mathematicsDiscrete Mathematics and CombinatoricMathematicsDiscrete mathematics000 Computer science knowledge general worksAnti-power010101 applied mathematicsComputational Theory and Mathematics010201 computation theory & mathematicsAperiodic graphComputer ScienceExponentPairwise comparisonCombinatorics (math.CO)SoftwareWord (group theory)Computer Science - Discrete Mathematics
researchProduct

Fractional generalized cumulative entropy and its dynamic version

2021

Following the theory of information measures based on the cumulative distribution function, we propose the fractional generalized cumulative entropy, and its dynamic version. These entropies are particularly suitable to deal with distributions satisfying the proportional reversed hazard model. We study the connection with fractional integrals, and some bounds and comparisons based on stochastic orderings, that allow to show that the proposed measure is actually a variability measure. The investigation also involves various notions of reliability theory, since the considered dynamic measure is a suitable extension of the mean inactivity time. We also introduce the empirical generalized fract…

FOS: Computer and information sciencesExponential distributionComputer Science - Information TheoryMathematics - Statistics TheoryStatistics Theory (math.ST)01 natural sciencesMeasure (mathematics)010305 fluids & plasmas0103 physical sciencesFOS: MathematicsApplied mathematicsAlmost surelyCumulative entropy; Fractional calculus; Stochastic orderings; EstimationEntropy (energy dispersal)010306 general physicsStochastic orderingsMathematicsCentral limit theoremNumerical AnalysisInformation Theory (cs.IT)Applied MathematicsCumulative distribution functionProbability (math.PR)Fractional calculusEmpirical measureFractional calculusModeling and SimulationEstimationCumulative entropyMathematics - ProbabilityCommunications in Nonlinear Science and Numerical Simulation
researchProduct

Abelian Repetitions in Sturmian Words

2012

We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory. We prove that in any Sturmian word the superior limit of the ratio between the maximal exponent of an abelian repetition of period $m$ and $m$ is a number $\geq\sqrt{5}$, and the equality holds for the Fibonacci infinite word. We further prove that the longest prefix of the Fibonacci infinite word that is an abelian repetition of period $F_j$, $j>1$, has length $F_j(F_{j+1}+F_{j-1} +1)-2$ if $j$ is even or $F_j(F_{j+1}+F_{j-1}…

FOS: Computer and information sciencesFibonacci numberDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryG.2.168R15FOS: MathematicsCombinatorics on words Sturmian wordMathematics - CombinatoricsAbelian groupFibonacci wordMathematicsDiscrete mathematicsMathematics::CombinatoricsSturmian wordCombinatorics on wordsNumber theoryF.2.2; F.4.3; G.2.1F.4.3ExponentCombinatorics (math.CO)F.2.2Word (group theory)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Abelian Powers and Repetitions in Sturmian Words

2016

Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period $m$ starting at a given position in any Sturmian word of rotation angle $\alpha$. vAs an analogue of the critical exponent, we introduce the abelian critical exponent $A(s_\alpha)$ of a Sturmian word $s_\alpha$ of angle $\alpha$ as the quantity $A(s_\a…

FOS: Computer and information sciencesFibonacci numberGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Computer Science - Formal Languages and Automata Theory0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsFOS: MathematicsMathematics - Combinatorics[INFO]Computer Science [cs]Number Theory (math.NT)0101 mathematicsAbelian groupContinued fractionFibonacci wordComputingMilieux_MISCELLANEOUSQuotientMathematicsMathematics - Number Theoryta111010102 general mathematicsComputer Science (all)Sturmian wordSturmian wordAbelian period; Abelian power; Critical exponent; Lagrange constant; Sturmian word; Theoretical Computer Science; Computer Science (all)Abelian periodLagrange constantCritical exponentAbelian power010201 computation theory & mathematicsBounded functionExponentCombinatorics (math.CO)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Abelian-Square-Rich Words

2017

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length $n$ grows quadratically with $n$. More precisely, we say that an infinite word $w$ is {\it abelian-square-rich} if, for every $n$, every factor of $w$ of length $n$ contains, on average, a number of distinct abelian-square factors that is quadratic in $n$; and {\it uniformly abelian-sq…

FOS: Computer and information sciencesGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Abelian squareComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology68R1501 natural sciencesSquare (algebra)Theoretical Computer ScienceCombinatorics0202 electrical engineering electronic engineering information engineeringFOS: MathematicsMathematics - CombinatoricsAbelian groupQuotientMathematicsDiscrete mathematicsComputer Science (all)Sturmian wordSturmian wordFunction (mathematics)Thue–Morse word010201 computation theory & mathematicsBounded functionThue-Morse wordExponentAbelian square; Sturmian word; Thue-Morse word; Theoretical Computer Science; Computer Science (all)020201 artificial intelligence & image processingCombinatorics (math.CO)Word (group theory)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct