Search results for "Language and speech"

showing 10 items of 166 documents

Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations

2011

In this paper, collocation methods are used for detecting blow-up solutions of nonlinear homogeneous Volterra-Hammerstein integral equations. To do this, we introduce the concept of "blow-up collocation solution" and analyze numerically some blow-up time estimates using collocation methods in particular examples where previous results about existence and uniqueness can be applied. Finally, we discuss the relationships between necessary conditions for blow-up of collocation solutions and exact solutions.

CollocationApplied MathematicsMathematical analysisMathematics::Analysis of PDEsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Numerical Analysis (math.NA)Volterra integral equationIntegral equationMathematics::Numerical AnalysisComputational MathematicsNonlinear systemsymbols.namesakeMathematics - Analysis of PDEs45D05 45G10 65R20 34A12HomogeneousComputer Science::Computational Engineering Finance and ScienceCollocation methodFOS: MathematicssymbolsOrthogonal collocationUniquenessMathematics - Numerical AnalysisAnalysis of PDEs (math.AP)Mathematics
researchProduct

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

Combinatorics on wordsApproximate string matchingGeneral Computer ScienceRepetition (rhetorical device)String (computer science)Search engine indexingComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Approximate string matchingData structureTheoretical Computer ScienceCombinatoricsSet (abstract data type)Formal languagesCombinatorics on words Formal languages Approximate string matching IndexingIndexingWord (group theory)MathematicsInteger (computer science)Computer Science(all)Theoretical Computer Science
researchProduct

Balance Properties and Distribution of Squares in Circular Words

2008

We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalised to non periodic infinite words as well.

CombinatoricsBalance (metaphysics)Distribution (number theory)Settore INF/01 - InformaticaComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Combinatoria delle Parole Parole Sturmiane parole circolari Parole BilanciateComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (group theory)Mathematics
researchProduct

Periodic Orbits in the Isosceles Three-Body Problem

1991

The Saturn’s satellites Janus and Epimetheus are the first known bodies in the Solar System that has horseshoe orbits in a frame that rotates with uniform angular velocity. Both satellites have similar masses and orbital elements when they are far from one another. Moreover, their orbits are nearly symmetric. In fact, in the past, they have been identify as a unique satellite and afterwards, some mathematical theories about their orbits has been necessaries to understand why they do not collide. In particular, the interest in planar three-body problem with two small masses has increased6. We assume that the two small masses have similar symmetric initial conditions. The aim of this paper is…

CombinatoricsPhysicsComputer Science::Information RetrievalIsosceles trianglePeriodic orbitsMotion (geometry)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Three-body problem
researchProduct

Una Aportación A La Lingüística: Los Sonidos Del Habla Y Su Organización Funcional

2007

The aim of this paper is to make a contribution to the study of the functional organization of phonological units, by assuming the theoretical and methodological perspective of mathematical Chaos Theory. Indexes of structuration and redundancy of the systems that contain these kinds of units are defined and a sample of languages is analyzed following this criterion. The treatment of the data in statistical terms, i.e. the number of phonological units of a language, indexes of structuration and the relationship between the number of phonological units and indexes of structuration, reveals a meaningful distance to normal distribution. The treatment of the data by means of Lyapunov test permit…

Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)
researchProduct

The geometry of surfaces in 4-space from a contact viewpoint

1995

We study the geometry of the surfaces embedded in ℝ4 through their generic contacts with hyperplanes. The inflection points on them are shown to be the umbilic points of their families of height functions. As a consequence we prove that any generic convexly embedded 2-sphere in ℝ4 has inflection points.

Computer Science::GraphicsDifferential geometryHyperplaneInflection pointHyperbolic geometryComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)GeometryGeometry and TopologyAlgebraic geometrySpace (mathematics)Topology (chemistry)Projective geometryMathematicsGeometriae Dedicata
researchProduct

Towards Diagrammatic Patterns

2008

This article presents the idea that the graphical representation (concrete syntax) of a visual language can be specified based on some pre-defined diagrammatic patterns. A diagram from the Specification and Description Language (SDL) is used as illustration.

Computer scienceProgramming languagebusiness.industryObject languageComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Specification languagecomputer.software_genreSpecification and Description LanguageVisual languageDiagrammatic reasoningLanguage Of Temporal Ordering SpecificationUniversal Networking LanguageSoftware_SOFTWAREENGINEERINGProgramming language specificationComputer Science::Programming LanguagesArtificial intelligencebusinesscomputerNatural language processingcomputer.programming_language
researchProduct

A practical solution to the problem of automatic word sense induction

2004

Recent studies in word sense induction are based on clustering global co-occurrence vectors, i.e. vectors that reflect the overall behavior of a word in a corpus. If a word is semantically ambiguous, this means that these vectors are mixtures of all its senses. Inducing a word's senses therefore involves the difficult problem of recovering the sense vectors from the mixtures. In this paper we argue that the demixing problem can be avoided since the contextual behavior of the senses is directly observable in the form of the local contexts of a word. From human disambiguation performance we know that the context of a word is usually sufficient to determine its sense. Based on this observation…

Computer sciencebusiness.industryWord-sense inductionComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Context (language use)Artificial intelligenceCluster analysiscomputer.software_genrebusinesscomputerWord (computer architecture)Natural language processingSemEvalProceedings of the ACL 2004 on Interactive poster and demonstration sessions -
researchProduct

"Table 1" of "Search for promptly produced heavy quarkonium states in hadronic Z decays"

1996

The analysis of hadrons (from X) provides to distinguish of the various decay modes of Z-boson (see text).

Condensed Matter::Quantum GasesZ --> GLUON GLUON J/PSI(1S)High Energy Physics::PhenomenologyZ --> UPSI(10023) BQBAR BQZ --> UPSI(10355) XZ --> GLUON GLUON UPSI(10355)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Z --> UPSI(10023) XZ --> GLUON GLUON UPSI(10023)Z --> UPSI(9460) XZ --> UPSI(9460) BQBAR BQZ --> J/PSI(1S) XZ --> UPSI(10355) BQBAR BQInclusiveZ --> QUARK QUARKBAR GLUONZ --> GLUON GLUON UPSI(9460)E+ E- ScatteringZ --> J/PSI(1S) CQBAR CQE+ E- --> ZExclusivePromptHigh Energy Physics::ExperimentZ --> PSI(3685) XNuclear ExperimentZ --> GLUON GLUON PSI(3685)
researchProduct

Unambiguous recognizable two-dimensional languages

2006

We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.

DeterminismSettore INF/01 - InformaticaDeterministic context-free languageGeneral MathematicsTwo-dimensional languagesAutomata and formal languages; Determinism; Two-dimensional languages; UnambiguityComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Class (philosophy)Computer Science ApplicationsUndecidable problemAutomata and Formal Languages. ; Unambiguity ; Determinism. .; Two-dimensional languagesCombinatoricsClosure (mathematics)Computer Science::Programming LanguagesAutomata and formal languagesDeterminism.ArithmeticComputer Science::Formal Languages and Automata TheorySoftwareUnambiguityMathematics
researchProduct