Search results for "FIX"
showing 10 items of 1335 documents
Prefix Stripping Re-Re-Revisited: MEG Investigations of Morphological Decomposition and Recomposition
2019
We revisit a long-standing question in the psycholinguistic and neurolinguistic literature on comprehending morphologically complex words: are prefixes and suffixes processed using the same cognitive mechanisms? Recent work using Magnetoencephalography (MEG) to uncover the dynamic temporal and spatial responses evoked by visually presented complex suffixed single words provide us with a comprehensive picture of morphological processing in the brain, from early, form-based decomposition, through lexical access, grammatically constrained recomposition, and semantic interpretation. In the present study, we find that MEG responses to prefixed words reveal interesting early differences in the la…
Discrete and Conservative Factorizations in Fib(B)
2021
AbstractWe focus on the transfer of some known orthogonal factorization systems from$$\mathsf {Cat}$$Catto the 2-category$${\mathsf {Fib}}(B)$$Fib(B)of fibrations over a fixed base categoryB: the internal version of thecomprehensive factorization, and the factorization systems given by (sequence of coidentifiers, discrete morphism) and (sequence of coinverters, conservative morphism) respectively. For the class of fibrewise opfibrations in$${\mathsf {Fib}}(B)$$Fib(B), the construction of the latter two simplify to a single coidentifier (respectively coinverter) followed by an internal discrete opfibration (resp. fibrewise opfibration in groupoids). We show how these results follow from thei…
On the construction of classes of suffix trees for square matrices: Algorithms and applications
1995
Given an n × n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4n−1 classes of index data structures for TEXT. Those indices are informally the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on TEXT. We provide one simple algorithm that efficiently builds any chosen index in those classes in O(n2 log n) worst case time using O(n2) space. The algorithm can be modified to require optimal O(n2) expected time for bounded σ.
Irredundant tandem motifs
2014
Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings {m1, m2} occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that h…
A NOTE ON THE ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL GÖDEL SENTENCES WITH EQUALITY
1995
The minimal Gödel class is the class of first-order prenex sentences whose quantifier prefix consists of two universal quantifiers followed by just one existential quantifier. We prove that asymptotic probabilities of existential second-order sentences, whose first-order part is in the minimal Gödel class, form a dense subset of the unit interval.
On the structure of the set of equivalent norms on ℓ1 with the fixed point property
2012
Abstract Let A be the set of all equivalent norms on l 1 which satisfy the FPP. We prove that A contains rays. In fact, every renorming in l 1 which verifies condition (⁎) in Theorem 2.1 is the starting point of a (closed or open) ray composed by equivalent norms on l 1 with the FPP. The standard norm ‖ ⋅ ‖ 1 or P.K. Linʼs norm defined in Lin (2008) [12] are examples of such norms. Moreover, we study some topological properties of the set A with respect to some equivalent metrics defined on the set of all norms on l 1 equivalent to ‖ ⋅ ‖ 1 .
The Ptolemy and Zbăganu constants of normed spaces
2010
Abstract In every inner product space H the Ptolemy inequality holds: the product of the diagonals of a quadrilateral is less than or equal to the sum of the products of the opposite sides. In other words, ‖ x − y ‖ ‖ z − w ‖ ≤ ‖ x − z ‖ ‖ y − w ‖ + ‖ z − y ‖ ‖ x − w ‖ for any points w , x , y , z in H . It is known that for each normed space ( X , ‖ ⋅ ‖ ) , there exists a constant C such that for any w , x , y , z ∈ X , we have ‖ x − y ‖ ‖ z − w ‖ ≤ C ( ‖ x − z ‖ ‖ y − w ‖ + ‖ z − y ‖ ‖ x − w ‖ ) . The smallest such C is called the Ptolemy constant of X and is denoted by C P ( X ) . We study the relationships between this constant and the geometry of the space X , and hence with metric fix…
Polskie nazwy miejscowości z sufiksem -at-ka
2017
The article analyses Polish oikonyms ending in -atka, discussing whether this ending is a suffix, i.e. -at-ka, or simply appears to be one. Based on the method of morphological division, the findings suggest the existence of two distinctive groups of oikonyms: those with the suffix -at-ka, and those with three extended variants of this suffix: -ow-at-ka, -aw-at-ka and -ew-at-ka.
Coding with traces
1994
We prove that the existence of a coding between two trace monoids is decidable for some families of trace monoids. Decidability heavily depends on the structure of the dependence graphs. The concept of coding is based on the new notion of strong morphism between trace monoids.