Pairing structural descriptions in MT, syntax-semantics interfaces and so on becomes more difficult the more structurally different are the languages involved; there is, implicitly or explicitly, a process of ‘tree parsing’, where a structural description is split into component smaller trees for transfer rules to be applied. Recent work has looked at the construction of transfer rules, using b...

This article presents an experiment designed to test the reliability of the benefit function transfer approach using contingent valuation methods. The experiment uses data collected from anglers surveyed across eight contiguous Texas Gulf Coast bay regions over three distinct time periods. Results indicate that the benefit function transfer approach tends to over-estimate benefits, implying tha...

Starting from the hypothesis that printed word identification initially involves the parallel mapping of visual features onto location-specific letter identities, we analyze the type of information that would be involved in optimally mapping this location-specific orthographic code onto a location-invariant lexical code. We assume that some intermediate level of coding exists between individual...

Scheduling algorithms in parallel computers fall into two basic categories: time and space sharing algorithms. Space-sharing based processor allocation algorithms can be contiguous or non-contiguous. Studies show that non-contiguous allocation is superior due to decrease in fragmentation. Other studies have reported that executing jobs on fewer processors (folding) can improve the performance o...

BACKGROUND Glycerol kinase deficiency (GKD) is an X-linked recessive disorder that presents in both isolated and complex forms. The contiguous deletion that leads to GKD also commonly affects NR0B1 (DAX1), the gene associated with adrenal hypoplasia congenita, and DMD, the Duchenne muscular dystrophy gene. Molecular testing to delineate this deletion is expensive and has only limited availabili...

This paper shows how revealed preference relations, observed under general budget sets, can be extended using closure operators which impose certain assumptions on preferences. Common extensions are based on the assumption that preferences are convex and/or monotonic, but we also consider satiated single-peaked preferences. For the obtained extended relations, the paper provides necessary and s...

In noncommutative field theories, it was known that one-loop effective action describes propagation of non-interacting open Wilson lines, obeying the flying dipole’s relation. We show that two-loop effective action describes cubic interaction among ‘closed string’ states created by open Wilson line operators. Taking d-dimensional λ[Φ]⋆-theory as the simplest setup, we compute nonplanar contribu...

We describe a framework that can be used to model and predict the behavior of MASs with learning agents. It uses a difference equation for calculating the progression of an agent’s error in its decision function, thereby telling us how the agent is expected to fare in the MAS. The equation relies on parameters which capture the agents’ learning abilities (such as its change rate, learning rate ...

The generalized Bernstein basis in the space Πn of polynomials of degree at most n, being an extension of the q-Bernstein basis introduced recently by G.M. Phillips, is given by the formula (see S. Lewanowicz & P. Woźny, BIT 44 (2004), 63–78) Bn i (x;ω| q) := 1 (ω; q)n [ n i ] q x (ωx−1; q)i (x; q)n−i (i = 0, 1, . . . , n). We give explicitly the dual basis functions Dn k (x; a, b, ω| q) for th...