Clearly produced vowels exhibit longer duration and more extreme spectral properties than plain, conversational vowels. These features also characterize tense relative to lax vowels. This study explored the interaction of clear-speech and tensity effects by comparing clear and plain productions of three English tense-lax vowel pairs (/i-ɪ/, /ɑ-ʌ/, /u-ʊ/ in /kVd/ words). Both temporal and spectr...

We consider scalar conservation laws with convex flux and random initial data. The Hopf–Lax formula induces a deterministic evolution of the law of the initial data. In a recent article, we derived a kinetic theory and Lax equations to describe the evolution of the law under the assumption that the initial datum is a spectrally negative Markov process. Here we show that: (i) the Lax equations a...

in this paper, an application of homotopy perturbation method is appliedto nding the solutions of the seven-order sawada-kotera (ssk) and a lax'sseven-order kdv (lskdv) equations. then obtain the exact solitary-wave so-lutions and numerical solutions of the ssk and lskdv equations for the initialconditions. the numerical solutions are compared with the known analyticalsolutions. their rem...

We present a new, nonautonomous Lax pair for a lattice nonautomous modified Korteweg–deVries equation and show that it can be consistently extended multidimensionally, a property commonly referred to as being consistent around a cube. This nonautonomous equation is reduced to a series of q-discrete Painlevé equations, and Lax pairs for the reduced equations are found. A 2× 2 Lax pair is given f...

We prove various Beurling-Lax type theorems, when the classical backward-shift operator is replaced by a general resolvent associated with rational function. also study connections to Cuntz relations. An important tool new representation result for analytic functions, in terms of composition and multiplication operators given Applications theory de Branges-Rovnyak spaces, indefinite metric sett...

A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )-coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. Using lax semantics, that correspondence may be extended to a class of first-order logic programs without existential variables. The resulting extension...