Search results for "predicate"

showing 10 items of 216 documents

Bene: Adverb or noun?

2013

When Italian bene ‘good / well’ occurs with fare ‘do / make’, several constructs with remarkably different argument frames are involved. This paper deals with three of them: (a) Il latte fa bene ai bambini ‘Milk is good for children’; (b) Fa bene il suo lavoro ‘She does her job well’, and (c) Faresti bene a non dire niente ‘You would do well to say nothing about it’. We discuss dictionary discrepancies concerning the lexical category of bene in (a), which we take to be a noun predicate, and draw a distinction between the adverbial uses in (b) and (c).

Linguistics and LanguageNothingNounPhilosophyAdverbPart of speechPredicate (grammar)AdverbialLinguisticsLexicographyAdverbes et compléments adverbiaux / Adverbs and adverbial complements
researchProduct

The effects of narrative context on French verbal inflections: A developmental perspective

1993

This experiment examines how narrative context affects French subjects' selection of past imperfective (imparfait) vs. perfective inflections with different predicate types. Adults and 10-year-old children were asked to inflect verbs presented in their written infinitive form in two conditions: (a) in isolated sentences; (b) embedded in the beginning, middle, or end of narratives. Regardless of conditions, the adults rarely used theimparfait with punctual resultative predicates. In both conditions, the frequency ofimparfait was high with durative predicates, particularly with aresultative ones, but it varied with position in the narratives, being highest at the beginning and lowest at the e…

Linguistics and LanguagePerfective aspectExperimental and Cognitive PsychologyVerbLanguage and LinguisticsPsycholinguisticsPredicate (grammar)LinguisticsLanguage developmentResultativeNarrativeInfinitivePsychologyGeneral PsychologyJournal of Psycholinguistic Research
researchProduct

The zoom-on-possessee construction in Kam (Dong): the anatomy of a new construction type

2005

Kam, a Kadai language spoken in Guizhou province (People's Republic of China), has a family of intransitive possessive constructions with the word order ‘Possessor–Verb–Possessee’. (The basic word order in Kam is SV and AVO.) While two recent papers have featured this unique construction type for an array of other Southeast Asian languages, they fail to acknowledge its distinct semantic value in contrast to the related construction type ‘Possessee–Possessor–Verb’. The former construction type displays a so-called ‘zoom-effect’: the possessor is predicated IN, AT or THROUGH his/her/its possessee; the predication zooms from the possessor on his/her/its possessee. The latter construction, in c…

Linguistics and LanguagePhilosophySemantic role labelingComputer scienceDative caseVerbLocative caseSoutheast asianPossessiveLanguage and LinguisticsLinguisticsPredicate (grammar)Word orderJournal of Linguistics
researchProduct

SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET

2014

In this paper we are interested in the study of the combinatorial aspects related to the extension of the Burrows-Wheeler transform to a multiset of words. Such study involves the notion of suffixes and conjugates of words and is based on two different order relations, denoted by <lex and ≺ω, that, even if strictly connected, are quite different from the computational point of view. In particular, we introduce a method that only uses the <lex sorting among suffixes of a multiset of words in order to sort their conjugates according to ≺ω-order. In this study an important role is played by Lyndon words. This strategy could be used in applications specially in the field of Bioinformatic…

Lyndon words; Burrows-Wheeler transform; Extended Burrows-Wheeler transform; Circular words; Conjugates; Suffixes; SortingSuffixesMultisetTheoretical computer sciencePoint (typography)Burrows–Wheeler transformSettore INF/01 - InformaticaSortingcircular wordExtension (predicate logic)Lyndon wordsBurrows-Wheeler transformLyndon wordField (computer science)ConjugatesconjugateComputer Science (miscellaneous)sortOrder (group theory)suffixeArithmeticextended Burrows-Wheeler transformCircular wordssortingMathematics
researchProduct

The guarded fragment with transitive guards

2004

The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …

Mathematical logicDiscrete mathematicsCombinatoricsTransitive relationComputational complexity theoryLogicBounded functionDecision problemPredicate (grammar)First-order logicDecidabilityMathematicsAnnals of Pure and Applied Logic
researchProduct

On Equivalent Random Traffic method extension

2011

The key result of the paper is the Equivalent Random Traffic (ERT) method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. A numerical algorithm is given — how to estimate the throughput for schemes at traffic splitting and merging. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.

Mathematical optimizationApproximation errorTelecommunication channelsNumerical analysisComputer Science::Networking and Internet ArchitectureKey (cryptography)Integrated opticsExtension (predicate logic)Throughput (business)Erlang (unit)AlgorithmMathematics2011 Baltic Congress on Future Internet and Communications
researchProduct

Notice of Violation of IEEE Publication Principles: Robust Observer Design for Unknown Inputs Takagi–Sugeno Models

2013

This paper deals with the observer design for Takagi-Sugeno (T-S) fuzzy models subject to unknown inputs and disturbance affecting both states and outputs of the system. Sufficient conditions to design an unknown input T-S observer are given in linear matrix inequality (LMI) terms. Both continuous-time and discrete-time cases are studied. Relaxations are introduced by using intermediate variables. Extension to the case of unmeasured decision variables is also given. A numerical example is given to illustrate the effectiveness of the given results.

Mathematical optimizationObserver (quantum physics)Applied MathematicsDecision theoryLinear matrix inequalityFuzzy control systemExtension (predicate logic)Fuzzy logicDecision variablesComputational Theory and MathematicsTakagi sugenoComputer Science::Systems and ControlArtificial IntelligenceControl and Systems EngineeringControl theoryMathematicsIEEE Transactions on Fuzzy Systems
researchProduct

Best Proximity Points for Some Classes of Proximal Contractions

2013

Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-s…

Mathematical optimizationmetric spacesArticle SubjectIterative methodApplied Mathematicslcsh:MathematicsWork (physics)proximal contractionbest proximity pointExtension (predicate logic)Resolution (logic)lcsh:QA1-939Nonlinear programmingReal-valued functionPoint (geometry)Settore MAT/03 - GeometriaContraction principleAnalysisMathematicsAbstract and Applied Analysis
researchProduct

Quasisymmetric extension on the real line

2018

We give a geometric characterization of the sets $E\subset \mathbb{R}$ that satisfy the following property: every quasisymmetric embedding $f: E \to \mathbb{R}^n$ extends to a quasisymmetric embedding $f:\mathbb{R}\to\mathbb{R}^N$ for some $N\geq n$.

Mathematics::Combinatoricsrelatively connected setsApplied MathematicsGeneral Mathematics010102 general mathematicsta111Extension (predicate logic)Characterization (mathematics)01 natural sciencesCombinatoricsfunktioteoria0103 physical sciencesMathematics::Metric GeometryEmbedding010307 mathematical physics0101 mathematicsReal linequasisymmetric extensionMathematicsProceedings of the American Mathematical Society
researchProduct

Controlled diffeomorphic extension of homeomorphisms

2018

Let $\Omega$ be an internal chord-arc Jordan domain and $\varphi:\mathbb S\rightarrow\partial\Omega$ be a homeomorphism. We show that $\varphi$ has finite dyadic energy if and only if $\varphi$ has a diffeomorphic extension $h: \mathbb D\rightarrow \Omega$ which has finite energy.

Mathematics::Functional AnalysisPure mathematicsMathematics::Dynamical SystemsMathematics - Complex VariablesdiffeomorphismApplied Mathematicsta111010102 general mathematicsHigh Energy Physics::PhenomenologyPoisson extensionExtension (predicate logic)01 natural sciencesHomeomorphismfunktioteoria010101 applied mathematicsDomain (ring theory)chord-arc curveFOS: MathematicsDiffeomorphismtopologia0101 mathematicsComplex Variables (math.CV)AnalysisEnergy (signal processing)Mathematics
researchProduct