The article is devoted to the study of word forms containing two or more different case suffixes. types double marking have been identified, area their distribution has clarified. It established that majority typologically distinguished are represented in Permian languages and dialects: 1) elliptical (Simple headless adnominal) all languages, it widely used Udmurt language; 2) derivational take...

Accounts of clause-level phenomena such as inversion and obviation (Aissen 1997, 1999) make crucial reference to the relative ranking of two arguments, subject and direct object, on a person/animacy/discourse hierarchy. Are such pair-wise comparisons ever required within the NP? O’Connor (1999a,b) proposed an analysis of NP-internal case-marking of possessors in Northern Pomo that paralleled Ai...

Parsing strategies in temporarily ambiguous sentences were investigated in readers with different sentence memory capacities using event-related brain potentials (ERPs). Readers with a high memory span as well as readers with a low memory span were required to read subject and object relative sentences which were either ambiguous until the last word (late disambiguation) or were disambiguated b...

Recent work has shown the benefit of using proportional feedback in TCP/AQM networks. By proportional feedback we mean the marking probability is proportional to the instantaneous queue length. Our earlier work relied on linearization of nonlinear fluidflow models of TCP. In this work we address these nonlinearities directly and establish some stability results when the marking is proportional....

This paper considers the problem of enforcing linear constraints containing marking terms, firing vector terms, and Parikh vector terms. Such constraints increase the expressivity power of the linear marking constraints. We show how this new type of constraints can be enforced in Petri nets. In the case of fully controllable and observable Petri nets, we give the construction of a supervisor en...

This paper considers the problem of enforcing linear constraints containing marking terms, firing vector terms, and Parikh vector terms. Such constraints increase the expressivity power of the linear marking constraints. We show how this new type of constraints can be enforced in Petri nets. In the case of fully controllable and observable Petri nets, we give the construction of a supervisor en...