Category

This memo describes a methodology for measuring sustained TCP throughput performance in an end-to-end managed network environment. This memo is intended to provide a practical approach to help users validate the TCP layer performance of a managed network, which should provide a better indication of end-user application level experience. In the methodology, various TCP and network parameters are identified that should be tested as part of the network verification at the TCP layer.

We show that in a finitely accessible additive category every class of objects closed under direct limits and pure epimorphic images is covering. In particular, the classes of flat objects in a locally finitely presented additive category and of absolutely pure objects in a locally coherent category are covering.

We deal with two-way contingency tables having ordered column categories. We use a row effects model wherein each interaction term is assumed to have a multiplicative form involving a row effect parameter and a fixed column score. We propose a methodology to cluster row effects in order to simplify the interaction structure and to enhance the interpretation of the model.

Inspired by the need for performability models for HSDPA user equipment, a Markovian queue with varying number of servers is conceived. The arrival and the service processes, the number of allocated or active servers of the queue are inherently, and independently (or jointly) Markov modulated. Batch arrivals, batch services, autocorrelation of inter-arrival times, and autocorrelation of batch sizes can be

The present paper proves necessary and sufficient conditions for both lexicographic products and arbitrary graphs to be unretractive. The paper also proves that the automorphism group of a lexicographic product of graphs is isomorphic to a wreath product of a monoid with a small category.

This paper addresses three aspects of the nature of categorisers, like n and v, which have become essential in accounts arguing for the syntactic decomposition of lexical categories, such as nouns and verbs, and positing that these are formed syntactically from category-less roots. The first issue addressed is what the role of categorial features [N] and [V] in such accounts can be; the second is whether categorisers are indeed functional heads, as commonly assumed. The third question addressed is what makes the syntactically composed nPs and vPs (the ‘First Phase’) be interpreted in a non-compositional fashion.
In looking at the above matters, the paper assigns a central role to the reality of categorial features both as distinctive features on categorisers and as LF-interpretable ones. It also singles out the interpretive impoverishment of roots as the factor underlying Embick and Marantz’s (2008) Categorization Assumption and as the source of idiomaticity and interpretive idiosyncrasies within the First Phase.

In this paper I present the prepositional system of Persian. I show that Persian prepositions can be divided into three classes (Class 1, Class 2a and Class 2b) which exhibit distinct syntactic behavior. Then I examine the question of the categorial status of Class 2 prepo-sitions and demonstrate that they are not to be regarded as nouns. Finally I present the extended PP projection of Persian spatial prepo-sitions and argue for a feature-based analysis of the properties they manifest.