We study a hydrodynamic limit approach to move-to-front rules, namely, a scaling limit as the number of items tends to infinity, of the joint distribution of jump rate and position of items. As an application of the limit formula, we present asymptotic formulas on search cost probability distributions, applicable for general jump rate distributions.

The present paper focused on the sociocultural explanations of rhetorical differences between English and Persian and was based on the contrastive genre analysis of Applied Linguistics research article abstracts in these two languages. The evolutionary nature of research article abstracts was also investigated from 1985 to 2005, in three stages, with a time interval of 10 years. Seventy eight r...

One of the main concerns of scholars working in the field of EAP over the last 2decades has been raising the awareness of EAP students and publishers of genreconventions in academic journals. In line with the above concern, many studies haveaimed at exploring the general characteristics of research articles (RAs) in the field.Among these features, it seems that the generic moves and textuality ...

In this paper we fix our attention on the second step algorithms of the Burrows–Wheeler compression algorithm, which in the original version is the Move To Front transform. We discuss many of its replacements presented so far, and compare compression results obtained using them. Then we propose a new algorithm that yields a better compression ratio than the previous ones.

For mate-searching species, the learnedmate recognition (LMR) hypothesis assumes that sexual harassment favours signal variation among females, which exploits the receiver ability of males. Themodel predicts that coevolving males have responded to the female sexual foil by learning to recognize female variants as potential mates. I translate the LMR hypothesis into the language of signal detect...

This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequences (so-called lambda-trees), focusing the search on threats and threat-aversions, but still guaranteeing to find the minimax value (provided that the game-rules allow passing or zugzwang is not a motive). Using neg...

Active learning (AL) is often used in corpus construction (CC) for selecting “informative” documents for annotation. This is ideal for focusing annotation efforts when all documents cannot be annotated, but has the limitation that it is carried out in a closed-loop, selecting points that will improve an existing model. For phenomena-driven and exploratory CC, the lack of existing-models and spe...

In open and dynamic environments, agents will usually differ in the domain ontologies they commit to and their perception of the world. The availability of Alignment Services, that are able to provide correspondences between two ontologies, is only a partial solution to achieving interoperability between agents, because any given candidate set of alignments is only suitable in certain contexts....

The work described in this paper presents an approach on scheduling in a virtual enterprise in the tourism sector. This scheduling scenario has to reconcile customers’ and service providers’ interests. That is, the customer’s temporal constraints on when to consume the service, and the service provider’s preferences on when to accept a booking. An algorithm is being developed for this situation...

The PS Move, Kinect, and Wii tout their technological capabilities as evidence that they can best support intuitive, creative movements. However, games for these systems tend to use their technology to hold the player to higher standards of conformity. This style of game design can result in the player being made to 'fit' the game, rather than the other way around. It is worthwhile to explore a...