Search results for "Speech processing"

showing 10 items of 210 documents

Double points in families of map germs from ℝ2 to ℝ3

2020

We show that a 1-parameter family of real analytic map germs [Formula: see text] with isolated instability is topologically trivial if it is excellent and the family of double point curves [Formula: see text] in [Formula: see text] is topologically trivial. In particular, we deduce that [Formula: see text] is topologically trivial when the Milnor number [Formula: see text] is constant.

Pure mathematicsDouble pointComputer Science::Information Retrieval010102 general mathematicsTopological classificationAstrophysics::Instrumentation and Methods for AstrophysicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)01 natural sciencesInstability010101 applied mathematicsComputer Science::General LiteratureGeometry and Topology0101 mathematicsAnalysisMathematicsJournal of Topology and Analysis
researchProduct

Lattice of closure endomorphisms of a Hilbert algebra

2019

A closure endomorphism of a Hilbert algebra [Formula: see text] is a mapping that is simultaneously an endomorphism of and a closure operator on [Formula: see text]. It is known that the set [Formula: see text] of all closure endomorphisms of [Formula: see text] is a distributive lattice where the meet of two elements is defined pointwise and their join is given by their composition. This lattice is shown in the paper to be isomorphic to the lattice of certain filters of [Formula: see text], anti-isomorphic to the lattice of certain closure retracts of [Formula: see text], and compactly generated. The set of compact elements of [Formula: see text] coincides with the adjoint semilattice of …

Pure mathematicsEndomorphismHilbert algebraGeneral Mathematics010102 general mathematicsAstrophysics::Instrumentation and Methods for AstrophysicsClosure (topology)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010103 numerical & computational mathematics01 natural sciencesSet (abstract data type)Lattice (module)Computer Science::General LiteratureClosure operator0101 mathematicsMathematicsAsian-European Journal of Mathematics
researchProduct

Stability conditions and related filtrations for $(G,h)$-constellations

2017

Given an infinite reductive algebraic group $G$, we consider $G$-equivariant coherent sheaves with prescribed multiplicities, called $(G,h)$-constellations, for which two stability notions arise. The first one is analogous to the $\theta$-stability defined for quiver representations by King and for $G$-constellations by Craw and Ishii, but depending on infinitely many parameters. The second one comes from Geometric Invariant Theory in the construction of a moduli space for $(G,h)$-constellations, and depends on some finite subset $D$ of the isomorphy classes of irreducible representations of $G$. We show that these two stability notions do not coincide, answering negatively a question raise…

Pure mathematicsGeneral Mathematics01 natural sciencesHarder–Narasimhan filtrationCoherent sheafModuliMathematics - Algebraic GeometryMathematics::Algebraic Geometry0103 physical sciencesFOS: MathematicsComputer Science::General Literature14D20 14L24Representation Theory (math.RT)0101 mathematicsAlgebraic Geometry (math.AG)MathematicsComputer Science::Information Retrieval010102 general mathematicsQuiverAstrophysics::Instrumentation and Methods for AstrophysicsGIT quotientComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceModuli spaceGIT quotientStability conditionAlgebraic groupIrreducible representationMSC: 14D20 14L24010307 mathematical physicsGeometric invariant theory[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Representation Theory
researchProduct

Words with the Maximum Number of Abelian Squares

2015

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.

Quadratic growthComputer Science (all)ConcatenationComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science (all); Theoretical Computer ScienceSquare (algebra)Theoretical Computer ScienceCombinatoricsAnagramsIrrational numberGolden ratioAbelian groupComputer Science::Formal Languages and Automata TheoryWord (group theory)Mathematics
researchProduct

On the class of languages recognizable by 1-way quantum finite automata

2000

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.

Quantum PhysicsComputer Science::Programming LanguagesFOS: Physical sciencesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Computational ComplexityQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theory
researchProduct

Bottom-quark mass from finite energy QCD sum rules

2011

Finite energy QCD sum rules involving both inverse and positive moment integration kernels are employed to determine the bottom quark mass. The result obtained in the $\bar{\text {MS}}$ scheme at a reference scale of $10\, {GeV}$ is $\bar{m}_b(10\,\text{GeV})= 3623(9)\,\text{MeV}$. This value translates into a scale invariant mass $\bar{m}_b(\bar{m}_b) = 4171 (9)\, {MeV}$. This result has the lowest total uncertainty of any method, and is less sensitive to a number of systematic uncertainties that affect other QCD sum rule determinations.

Quantum chromodynamicsPhysicsNuclear and High Energy PhysicsParticle physicsQCD sum rulesHigh Energy Physics - Lattice (hep-lat)High Energy Physics::PhenomenologyInverseFísicaFOS: Physical sciencesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Bottom quarkHigh Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)High Energy Physics - LatticeHigh Energy Physics::ExperimentSum rule in quantum mechanicsEnergy (signal processing)
researchProduct

Determination of m¯b/m¯c and m¯b from nf=4 lattice QCD+QED

2021

We extend HPQCD's earlier ${n}_{f}=2+1+1$ lattice-QCD analysis of the ratio of $\overline{\mathrm{MS}}$ masses of the $b$ and $c$ quark to include results from finer lattices (down to 0.03 fm) and a new calculation of QED contributions to the mass ratio. We find that ${\overline{m}}_{b}(\ensuremath{\mu})/{\overline{m}}_{c}(\ensuremath{\mu})=4.586(12)$ at renormalization scale $\ensuremath{\mu}=3\text{ }\text{ }\mathrm{GeV}$. This result is nonperturbative. Combining it with HPQCD's recent lattice $\mathrm{QCD}+\mathrm{QED}$ determination of ${\overline{m}}_{c}(3\text{ }\text{ }\mathrm{GeV})$ gives a new value for the $b$-quark mass: ${\overline{m}}_{b}(3\text{ }\text{ }\mathrm{GeV})=4.513(2…

QuarkQuantum chromodynamicsPhysicsParticle physics010308 nuclear & particles physicsComputer Science::Information RetrievalHigh Energy Physics::LatticeHigh Energy Physics::PhenomenologyComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lattice QCDMass ratio01 natural sciencesRenormalizationLattice (order)0103 physical sciencesHigh Energy Physics::Experiment010306 general physicsPhysical Review D
researchProduct

Frequency-Sliding Generalized Cross-Correlation: A Sub-Band Time Delay Estimation Approach

2020

The generalized cross correlation (GCC) is regarded as the most popular approach for estimating the time difference of arrival (TDOA) between the signals received at two sensors. Time delay estimates are obtained by maximizing the GCC output, where the direct-path delay is usually observed as a prominent peak. Moreover, GCCs play also an important role in steered response power (SRP) localization algorithms, where the SRP functional can be written as an accumulation of the GCCs computed from multiple sensor pairs. Unfortunately, the accuracy of TDOA estimates is affected by multiple factors, including noise, reverberation and signal bandwidth. In this paper, a sub-band approach for time del…

Reverberationweighted SVDAcoustics and UltrasonicsCross-correlationComputer scienceNoise (signal processing)SRP-PHATMatrix representationTime delay estimationMultilaterationComputational Mathematicssub-band processingAudio and Speech Processing (eess.AS)Temporal resolutionSingular value decompositionComputer Science (miscellaneous)FOS: Electrical engineering electronic engineering information engineeringGCCElectrical and Electronic EngineeringRepresentation (mathematics)SVDAlgorithmElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct

A Fast Anchor Person Searching Scheme in News Sequences

2001

In this paper we address the problem of seeking anchor person shots in news sequences. This can be useful since usually this kind of scenes contain important and reusable information such as interviews. The proposed technique is based on our a priori knowledge of the editing techniques used in news sequences.

Scheme (programming language)Information retrievalComputer sciencebusiness.industrySpeech recognitionPattern recognition (psychology)Search engine indexingImage processingBroadcastingSpeech processingbusinesscomputercomputer.programming_language
researchProduct

Words and Patterns

2002

In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…

Set (abstract data type)Discrete mathematicsStructure (mathematical logic)Regular languageRelation (database)Binary numberComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Natural orderPartially ordered setComputer Science::Formal Languages and Automata TheoryWord (computer architecture)Mathematics
researchProduct