Habil.-Schr. Humboldt-Univ. Berlin, 2006.

Abstract A model for free recall of words is presented and applied to representative free-recall experiments. According to the model, a subject's lexicon contains a representation for each word and for the association between each pair of words. Studying a word in a list strengthens that word's representation in the lexicon, but reduces the strength of previously studied words. In addition, while studying the list, the subject associates pairs of items and, thereby, strengthens the corresponding associations in the lexicon. A subject's efficiency at forming associations drops off as the number of pairs increases. Retrieval is initiated with a report cue. Selection of an item for report is based on its strength in the lexicon plus the strength of its association with the retrieval cue. Selecting an item for report changes the strength of its association with the cue in the lexicon. To test the model, parameters were obtained by fitting it to serial-position curves taken from the archival literature. The model predicted three additional dependent measures: order of report, items correct per trial, and the number of intrusions per trial. In addition, I applied the model to phenomena associated with the free-recall task and showed that it captures the list-strength effect, interference in part-list cuing, clustering with categorized lists, and distraction effects. The model itself does not change to capture these experimental data. Word lists are presented to the model according to the experimental protocol used in the original experiments, and the model captures output measures derived from the experimental data. The model demonstrates that simple mechanisms can capture a wide range of apparently complex behaviour if we allow for a large enough knowledge base. In effect, the complexity of behaviour in free-recall paradigms lies in the interactions in the lexicon, not in the complexity of the recall mechanisms. / Thesis (Ph.D, Psychology) -- Queen's University, 2013-01-28 14:12:49.99

The Arizona Child Acoustic Database consists of longitudinal audio recordings from a group of children over a critical period of growth and development (ages 2-7 years). The goal of this database is to 1) document acoustic changes in speech production that may be related to physical growth 2) inform development of a model of speech production for child talkers. This work was funded by NSF BSC-1145011 awarded to Kate Bunton, Ph.D. and Brad Story, Ph.D, Principal Investigators. This database contains longitudinal audio recordings of 55 American English speaking children between the ages of 2-7 at 3-month intervals. Since children began the study at different ages, some children have fewer recording sessions than others. The database can also be used to provide cross-sectional data for children of a specific age. Please refer to the subject data table for information on specific sessions available here http://arizona.openrepository.com/arizona/handle/10150/316065. All children were recorded using the same protocol; therefore, task numbers are consistent across children and sessions. A calibration tone is included as Record 1 for all sessions. The speech protocol focused on production of English monopthong and diphthong vowels in isolation, sVd, hVd, and monosyllabic real words. In addition, the protocol includes several nonsense vowel-to-vowel transitions. Speakers were prompted either verbally by investigators or by graphical prompts. Details of the protocol with reference to task numbers can be found in the protocol spreadsheet available here http://arizona.openrepository.com/arizona/handle/10150/316065. Details on data recording: All samples were recorded digitally using an AKG SE 300B microphone with a mouth to mic distance of approximately 10 inches. Signals were recorded digitally using a Marantz PMD671, 16 bit PCM (uncompressed) at 44.1KHz. Recordings are made available in .wav format. Individual zip files contain all recordings from a single session.

Since the events of 9-11, aviation security has become a mounting concern for both the American and Canadian government. Because of the alleged “threats to security,” the Canadian government has followed in American footsteps and enacted the Passenger Protect Program, otherwise known as the “no fly list.” This thesis will examine the emergence of the Canadian version of the no fly list in the context of the U.S. “Secure Flight” program in order to analyze the claim that the Canadian list is unique and distinct from the American version. Drawing from the literature on surveillance and risk, this thesis suggests that both lists are operating on the precautionary principle and are thus not distinct in purpose, process or overall outcome, and that a “made in Canada” approach is a misleading notion. In fact, this thesis will show that the Canadian and U.S. governments continue to share no fly lists, use the same criteria and sources for placing an individual’s name on the list, and handle redress issues in the same manner. Most importantly, the consequences for ordinary citizens are the same regardless of whether one finds themselves on the Canadian or the American list. This thesis will (a) describe the origins of the no fly list in Canada and the USA, (b) examine the ways in which personal data are obtained from the Passenger Name Record (PNR), how these are used to construct the list(s) and how they are mined for further purposes and (c) what the consequences are for specific classes of persons, especially minorities, refugee and asylum claimants, civil libertarians, peace activists and others. / Thesis (Master, Sociology) -- Queen's University, 2009-01-14 18:08:51.773

Thesis (doctoral)--Kgl. Bayerische Universität Erlangen. / Vita.

Thesis (M.S.)--Oregon Graduate Center, 1985.

Thesis (Ed.M.)--Boston University

No description available.

A brief survey of list-processing languages and list-processors is made, pointing out the shortcomings of each. The need for a practical, applications-oriented list-processor, along with a list of features that would be required, is then presented. A list-processor that is designed to fulfil these requirements is proposed. The presentation includes a detailed description of the storage structure and management algorithms, the primitive routines that have been defined, plus the routines and features available for dynamic storage allocation and list-processing. Finally, a comparison between the proposed list-processor and two available list-processors, SLIP and DYSTAL, is carried out. / Science, Faculty of / Computer Science, Department of / Graduate

Darbo tikslas - sukurti balsavimu grįstų konkursų vertinimų (pvz. Eurovizijos dainų konkursas, angl. Eurovision Song Contest) internetinę programą, kurioje būtų taikomas dinaminis draudimų sąrašas (tabu list), suteiksiantis galimybę objektyviau vertinti konkurso dalyvius. Su pasirinktais įrankiais buvo sukurta funkcionuojanti internetinė taikomoji programa, skirta Eurovizijos dainų konkursui, kurioje taikomas dinaminis draudimų sąrašas. Darbas yra patalpintas internete šiuo adresu. http://ik.su.lt/~vitpau/. / The aim - to create a voting competition-based assessments (such as the Eurovision Song Contest), an online program, which is a dynamic list of prohibitions (taboo list) which provides an objective assessment of the tenderers. With selected tools were designed for operation of the web application for the Eurovision song contest with a dynamic list of prohibitions. Job are posted online at http://ik.su.lt/~vitpau/.