This study examines the relationship between different types of conversational interaction and SLA. Long’s (1996) updated version of the interactionist hypothesis claims that implicit negative feedback, which can be obtained through negotiated interaction, facilitates SLA. Similar claims for the benefits of negotiation have been made by Pica (1994) and Gass (1997). Some support for the interact...

Bohannon and Stanowicz (1988) have claimed that contrary to popular belief, children do receive negative evidence about the ungrammaticality of their utterances in the form of recasts, expansions, and repetitions. Bohannon and Stanowicz argue that given such negative evidence, learnability theory shows that natural languages can be learned and that there is no need to postulate innate knowledge...

This paper presents procedural guidelines for the construction of discontinuous state feedback controllers for driftless, kinematic nonholonomic systems, with extensions to a class of dynamic nonholonomic systems with drift. Given an ndimensional kinematic nonholonomic system subject to κ Pfaffian constraints, system states are partitioned into “leafwise” and “transverse,” based on the structur...

Quadratic pencils arising from applications are often inherently structured. Factors contributing to the structure include the connectivity of elements within the underlying physical system and the mandatory nonnegativity of physical parameters. For physical feasibility, structural constraints must be respected. Consequently, they impose additional challenges on the inverse eigenvalue problems ...

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that determines whether or not a permutoid based on a finite set can be completed to a finite permutation group. In this note we prove Cameron’s conjecture by relati...

Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While finite-horizon DECPOMDPs have enjoyed significant success, progress remains slow for the infinite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infinite-horizon case, w...

Coordination failure, or agents’ uncertainty about the action of other agents, may be an important source of congestion in large decentralized systems. The El Far01 or Santa Fe bar problem provides a simple paradigm for congestion and coordination problems that may arise with over utilization of the Internet. This paper recasts the problem in a stochastic framework and derives a simple adaptive...

A recent paper (Beaver, 2004) recasts the Centering algorithm for pronoun resolution (Brennan et al., 1987) in terms of optimality theory (OT). Although the limitations of centering for pronoun resolution are well known, the algorithm's restatement in OT highlights the strengths of centering and produces an algorithm whose behavior is more transparent to the developer. The authors' motivation f...

We present a perfect sampling algorithm that can be applied to the master equation of gene regulatory networks. The method recasts Gillespie's stochastic simulation algorithm (SSA) in the light of Markov chain Monte Carlo methods and combines it with the dominated coupling from the past (DCFTP) algorithm to provide guaranteed sampling from the stationary distribution. We show how the DCFTP-SSA ...

This paper will focus on recent changes in the relationships between the public and the private sector within the health assistance network, by analyzing selected information on health services and on legal rules related to supporting the private assistance subsystem. This approach recasts analyses which articulate the simultaneous examination of both the material and political instances that p...