JUSTEIS: JISC Usage Surveys: Trends in Electronic Information Services Final report 2003/2004 Cycle Five

Urquhart, C., Spink, S., Thomas, R., Yeoman, A., Durbin, J., Turner, J., Fenton, R. & Armstrong, C. (2004). JUSTEIS: JISC Usage Surveys: Trends in Electronic Information Services Final report 2003/2004 Cycle Five. Aberystwyth: Department of Information Studies, University of Wales Aberystwyth. Sponsorship: JISC

The acquisition of phonology in a dynamical model of human information processing: a preliminary account

The problem of the acquisition of first language phonology is dealt with within the general information-processing perspective. In this sense, language acquisition is viewed as a process of biologically founded pattern formation due to information exchanges between an adult and a child. Moreover, the process is cognitive in that the child, as a goal-seeking and error correcting individual, undertakes an intricate task of compressing a huge variety of linguistic stimuli in order to build an effective information code. It is further assumed that the basic mechanism which leads to the establishment of fully articulate linguistic ability is that of simulation. The mechanism works through a compression of a set of initial variables (i.e. initial conditions) into a minimum length algorithm and a subsequent construction of an integrated system of language-specific attractors. It is only then that the language user is capable of participating in an information transaction in a fully developed manner.

The journal of the Bishop of Montreal : during a visit to the Church Missionary Society's north-west America mission; to which is prefixed, by the secretaries, an introduction, giving an account of the formation of the mission and its progress to August 1848.

http://www.archive.org/details/journalofthebish00mounuoft

The journal of the Bishop of Montreal the Church Missionary Society's North-west America Mission. To which is added, by the secretaries, an appendix, giving an account of the formation of the mission, and its progress to the present time.

http://www.archive.org/details/bishopofmontreal00mounuoft

An account of the life of Mr. David Brainerd : missionary from the Society for Propagating Christian Knowledge, & pastor of a church of Christian Indians in New-Jersey / published by Jonathan Edwards ; with Mr. Brainerd's public journal ; to this edition is added, Mr. Beatty's mission to the westward of the Allegheny Mountains.

http://www.archive.org/details/accountoflifeofm00brairich

Hinduism and Christianity in Orissa: containing a brief description of the country, religion, manners and customs, of the Hindus, and an account of the operations of the American Freewill Baptist Mission in northern Orissa ... By O.R. Bacheler ...

http://www.archive.org/details/hinduismandchris00bachuoft

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.

Safe Compositional Specification of Networking Systems: TRAFFIC The Language and Its Type Checking

This paper formally defines the operational semantic for TRAFFIC, a specification language for flow composition applications proposed in BUCS-TR-2005-014, and presents a type system based on desired safety assurance. We provide proofs on reduction (weak-confluence, strong-normalization and unique normal form), on soundness and completeness of type system with respect to reduction, and on equivalence classes of flow specifications. Finally, we provide a pseudo-code listing of a syntax-directed type checking algorithm implementing rules of the type system capable of inferring the type of a closed flow specification.

View Registration Using Interesting Segments of Planar Trajectories

We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the streams are globally synchronized, so that only solving the spatial alignment is needed, or that the temporal misalignment is small enough so that exhaustive search can be performed. In contrast, our approach can recover both the spatial and temporal alignment. We compute for each trajectory a number of interesting segments, and we use their description to form putative matches between trajectories. Each pair of corresponding interesting segments induces a temporal alignment, and defines an interval of common support across two views of an object that is used to recover the spatial alignment. Interesting segments and their descriptors are defined using algebraic projective invariants measured along the trajectories. Similarity between interesting segments is computed taking into account the statistics of such invariants. Candidate alignment parameters are verified checking the consistency, in terms of the symmetric transfer error, of all the putative pairs of corresponding interesting segments. Experiments are conducted with two different sets of data, one with two views of an outdoor scene featuring moving people and cars, and one with four views of a laboratory sequence featuring moving radio-controlled cars.