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.

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.

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.

We want to explain how any mathematical theory is committed to a pulsation between algebra and topology. 1) Our main aim is to show on one hand how every theory is an algebraic one, according to various notions of an algebraic theory, through sketches and up to figurative algebras, that is to say a question of equations between laws of composition of figures; and on the other hand how every theory is topological or toposical (toposique), that is to say an expression of facts of continuity and a geometrical organisation of these facts (but this approach comes an ambiguity). So we get insights into a possible construction of an Algebraic Theory similar to the Algebraic Geometry of Grothendieck. It could be underlined also that on the way we prove two new facts which are essential to our analysis, one of a general nature, and the other which is a rather peculiar observation: 2.1) We lay stress on figurative algebras, and as a by-product we get that : every category of models is the ful...

This paper is an exploratory survey of TCP congestion control principles and techniques.In addition to the standard algorithms used in common software implementations of TCP,this paper also describes some of the more common proposals developed by researchersover the years. By studying congestion control techniques used in TCP implementationsoftware and network hardware we can better comprehend the performance issues of packet switched networks and in particular, the public Internet.

Mobile IPv4 is a standard mobility protocol that enables an IPv4 device to move among networks while maintaining its IP address. The mobile device has the Mobile IPv4 client function to signal its location to the routing anchor, known as the Home Agent. However, there are many IPv4 devices without such capability due to various reasons. This document describes Proxy Mobile IPv4 (PMIPv4), a scheme based on having the Mobile IPv4 client function in a network entity to provide mobility support for an unaltered and mobilityunaware IPv4 device. This document also describes a particular application of PMIPv4 as specified in the WiMAX Forum and another application that is to be adopted in 3GPP2. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This is a contribution to the RFC Series, independently of any other RFC stream. The RFC Editor has chosen to publish this document at its discretion and makes no statemen...

This paper presents a batch classifier that splits a dataset into tree branches depending on the category type. It has been improved from the earlier version and fixed a mistake in the earlier paper. Two important changes have been made. The first is to represent each category with a separate classifier. Each classifier then classifies its own subset of data rows, using batch input values to create the centroid and also represent the category itself. If the classifier contains data from more than one category however, it needs to create new classifiers for the incorrect data. The second change therefore is to allow the classifier to branch to new layers when there is a split in the data, and create new classifiers there for the data rows that are incorrectly classified. Each layer can therefore branch like a tree - not for distinguishing features, but for distinguishing categories. The paper then suggests a further innovation, which is to represent some data columns with fixed value ranges, or bands. When considering features, it is shown that some of the data can be classified directly through fixed value ranges, while the rest must be classified using a classifier technique and the idea allows the paper to discuss a biological analogy with neurons and neuron links. Tests show that the method can successfully classify a diverse set of benchmark datasets to better than the state-of-the-art.

Versions papier et électronique : les numéros sont expédié par poste au fur et à mesure de leur parution. Tous les numéros en ligne sont immédiatement accessibles. ... ATTENTION : cette offre d'abonnement est exclusivement réservée aux particuliers. Pour un abonnement ...

MetaJ is a programming environment that supports metaprogramming in the Java language. The environment is designed to allow extensions via plug-ins which permit the user to manipulate programs written in different languages. This facilities concern only syntactic aspects. Semantics aspects are language-dependent and are not addressed here, but could be tackled with other tools, which could even be layered on the top of MetaJ. Accessing patterns by example inside ordinary Java programs is a major feature of MetaJ programming. This paper presents a conceptual descrip- tion of the environment, implementation details and three applications on analysis, restructuring and generation of programs.

This document provides advice to the designers of digital communication equipment, link-layer protocols, and packet-switched local networks (collectively referred to as subnetworks), who wish to support the Internet protocols but may be unfamiliar with the Internet architecture ...

Provider Provisioned Layer 2 Virtual Private Networks (L2VPNs) may have different "provisioning models", i.e., models for what information needs to be configured in what entities. Once configured, the provisioning information is distributed by a "discovery process". When the discovery process is complete, a signaling protocol is automatically invoked to set up the mesh of pseudowires (PWs) that form the (virtual) backbone of the L2VPN. This document specifies a number of L2VPN provisioning models, and further specifies the semantic structure of the endpoint identifiers required by each model. It discusses the distribution of these identifiers by the discovery process, especially when discovery is based on the Border Gateway Protocol (BGP). It then specifies how the endpoint identifiers are carried in the two signaling protocols that are used to set up PWs, the Label Distribution Protocol (LDP),

Abstract: In this work, we propose a compilation strategy for non-strict functional languages targeting the Microsoft.NET Platform, a multilanguage platform which provides a large number of services to aid current software development. This strategy is based on the push/enter execution model, enables fast function calling mechanisms whenever possible and males use of new features present in.NET Framework, such as delegates and tail calls. Our case study was the compilation of the Haskell language, a standardized and well known non-strict functional language. Our main contribution is the construction of an environment for the testing of different compilation techniques for functional languages targeting.NET. Key Words:.NET, languages interoperability, virtual machines, functional programming, compilers, Haskell

This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards " (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Copyright Notice

Metaphor is widely viewed as the (selective) mapping of properties from one conceptual domain (the 'source') onto another (the 'target'). Two different models of metaphor comprehension are distinguished with respect to this characterization of metaphors: the 'domain-as-a-schema' model, and the 'domain-as-a-taxonomic category' model. These models differ radically from each other with respect to: 1. Their representational assumptions regarding the way knowledge is organized and represented in memory, and 2. Their interpretation principles, namely, the  connectivity vs. diagnosticity principles.
On the basis of several counter-examples, it is argued that neither model is sufficient to account for certain phenomena regarding metaphor interpretation. As an alternative, a 'hybrid model' of metaphor comprehension is outlined. While preserving the explanatory power of each of the other two models, the 'hybrid model' is capable of accounting for those counter-examples. A multiple-stage experiment is described, which provides some initial empirical support for the hybrid model.

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.