Search results for "functions"

showing 10 items of 1066 documents

Co-occurrence of discourse markers in English : from juxtaposition to composition

2019

Abstract In this paper, we report on a qualitative analysis of co-occurring discourse markers, that is, sequences of adjacent discourse markers that belong to the same unit but may express different functions. We examine several formal and functional features of these co-occurring strings on the basis of corpus examples extracted from conversational data in English. In particular, we focus on scope, meaning-in-context (or functions), syntactic category and position. Our analysis reveals several degrees of integration: differences in scope allow us to differentiate juxtaposition and combination of markers. In the case of combination, difference in meaning integration allows us to distinguish…

Discourse markers050101 languages & linguisticsLinguistics and LanguageComputer scienceScope05 social sciencesCo-occurrenceDM co-occurrenceCorpus050105 experimental psychologyLanguage and LinguisticsLinguisticsLanguages and LiteraturesFocus (linguistics)AnnotationSyntactic categoryArtificial IntelligenceEnglishPragmatic functions0501 psychology and cognitive sciencesComposition (language)Scope (computer science)Discourse markerMeaning (linguistics)
researchProduct

Connected components in the space of composition operators onH∞ functions of many variables

2003

LetE be a complex Banach space with open unit ballBe. The structure of the space of composition operators on the Banach algebra H∞, of bounded analytic functions onBe with the uniform topology, is studied. We prove that the composition operators arising from mappings whose range lies strictly insideBe form a path connected component. WhenE is a Hilbert space or aCo(X)- space, the path connected components are shown to be the open balls of radius 2.

Discrete mathematicsAlgebra and Number TheoryApproximation propertyInfinite-dimensional vector functionHilbert spaceOperator theoryOperator spaceContinuous functions on a compact Hausdorff spacesymbols.namesakeOperator algebraBanach algebrasymbolsAnalysisMathematicsIntegral Equations and Operator Theory
researchProduct

On certain extension theorems in the mixed Borel setting

2004

Abstract Given two sequences M 1 and M 2 of positive numbers, we give necessary and sufficient conditions under which the inclusions Λ { M 1 } ⊂ f (j) (0) j∈ N 0 : f∈ D { M 2 } [−1,1] , Λ ( M 1 ) ⊂ f (j) (0) j∈ N 0 : f∈ D ( M 2 ) [−1,1] hold, by means of explicit constructions. This answers a question raised by Chaumat and Chollet (Math. Ann. 298 (1994) 7–40). We also consider the case when [−1,1] is replaced by [−1,1]m as well as the possibility to get ultraholomorphic extensions.

Discrete mathematicsBeurling typeApplied MathematicsUltradifferentiable functionsRoumieu typeHolomorphic functionMixed Borel theoremExtension (predicate logic)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Enumerable classes of total recursive functions: Complexity of inductive inference

1994

This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The complexity is measured as the worst-case mindchange (error) number for the first n functions of the given class. Three generalizations are considered.

Discrete mathematicsClass (set theory)Mathematics::CombinatoricsTheoretical computer scienceRecursively enumerable setRecursive functionsEnumerationInductive reasoningMathematics
researchProduct

If P≠NP then some strongly noninvertible functions are invertible

2006

AbstractRabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement (Rabi and Sherman attribute this protocol to Rivest and Sherman) and digital signatures (Rabi and Sherman)—that strongly noninvertible functions are very useful components in protocol design. Their definition of strong noninvertibility has a small twist (“respecting the argument given”) that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a consequence: unless P=NP, some strongly noninvertible functions are invertible.

Discrete mathematicsGeneral Computer ScienceComputational complexity theorybusiness.industryP versus NP problemOne-way functionsCryptographyOne-way functionCryptographic protocolTheoretical Computer Sciencelaw.inventionComputational complexityInvertible matrixDigital signaturelawAssociativityCryptographyStrong noninvertibilitybusinessAssociative propertyMathematicsTheoretical Computer Science
researchProduct

Kolmogorov numberings and minimal identification

1995

Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Godel numberings, Freivalds later considered minimal identification in Kolmogorov Numberings. Kolmogorov numberings are in some sense optimal numberings and have some nice properties. We prove certain hierarchy results for minimal identification in every Kolmogorov numbering. In addition we also compare minimal identification in Godel numbering versus minimal identification in Kol…

Discrete mathematicsIdentification (information)Computable functionHierarchy (mathematics)Gödel numberingRecursive functionsInductive reasoningNumberingMathematics
researchProduct

Probabilistic limit identification up to “small” sets

1996

In this paper we study limit identification of total recursive functions in the case when “small” sets of errors are allowed. Here the notion of “small” sets we formalize in a very general way, i.e. we define a notion of measure for subsets of natural numbers, and we consider as being small those sets, which are subsets of sets with zero measure.

Discrete mathematicsIdentification (information)Zero (complex analysis)Recursive functionsNatural numberLimit (mathematics)Measure (mathematics)Mathematics
researchProduct

VECTOR-VALUED FUNCTIONS INTEGRABLE WITH RESPECT TO BILINEAR MAPS

2008

Let $(\Omega, \Sigma, \mu)$ be a $\sigma-$finite measure space, $1\le p \lt \infty$, $X$ be a Banach space $X$ and ${\cal B} :X\times Y \to Z$ be a bounded bilinear map. We say that an $X$-valued function $f$ is $p-$integrable with respect to ${\cal B}$ whenever $\sup\{\int_\Omega\|{\cal B}(f(w),y)\|^pd\mu: \|y\|=1\}$ is finite. We identify the spaces of functions integrable with respect to the bilinear maps arising from H\"older's and Young's inequalities. We apply the theory to give conditions on $X$-valued kernels for the boundedness of integral operators $T_{{\cal B}}(f) (w)=\int_{\Omega'}{{\cal B}}(k(w,w'),$ $f(w'))d\mu'(w')$ from ${\mathrm L}^p(Y)$ into ${\mathrm L}^p(Z)$, extending t…

Discrete mathematicsIntegrable systemGeneral MathematicsBanach spaceFunction (mathematics)Space (mathematics)Measure (mathematics)Omegavector-valued functionsbilinear mapBounded function42B3047B35Vector-valued functionMathematics
researchProduct

On the points realizing the distance to a definable set

2011

Abstract We prove a definable/subanalytic version of a useful lemma, presumably due to John Nash, concerning the points realizing the Euclidean distance to an analytic submanifold of R n . We present a parameter version of the main result and we discuss the properties of the multifunction obtained.

Discrete mathematicsLemma (mathematics)Applied MathematicsSubanalytic setsdefinable setsSubmanifoldsubanalytic setsEuclidean distanceAlgebraMultifunctionsDefinable setDefinable setstame geometryAnalysisTame geometryMathematicsmultifunctions
researchProduct

Homomorphisms and composition operators on algebras of analytic functions of bounded type

2005

Abstract Let U and V be convex and balanced open subsets of the Banach spaces X and Y, respectively. In this paper we study the following question: given two Frechet algebras of holomorphic functions of bounded type on U and V, respectively, that are algebra isomorphic, can we deduce that X and Y (or X * and Y * ) are isomorphic? We prove that if X * or Y * has the approximation property and H wu ( U ) and H wu ( V ) are topologically algebra isomorphic, then X * and Y * are isomorphic (the converse being true when U and V are the whole space). We get analogous results for H b ( U ) and H b ( V ) , giving conditions under which an algebra isomorphism between H b ( X ) and H b ( Y ) is equiv…

Discrete mathematicsMathematics(all)Approximation propertyGeneral MathematicsSpectrum (functional analysis)Holomorphic functionStructure (category theory)Banach spaceHomomorphismsBounded typePolynomialsCombinatoricsBanach spacesHolomorphic functionsHomomorphismIsomorphismMathematicsAdvances in Mathematics
researchProduct