Página 2 dos resultados de 4609 itens digitais encontrados em 0.083 segundos

Feasibility of GNU/Linux as the OS for a PC-based medical product; Feasibility of GNU/ Linux as the operating system for a personal computer -based medical product

Lustbader, Steven B. (Steven Benjamin), 1980-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 21 leaves; 144286 bytes; 139806 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
779.5185%
by Steven B. Lustbader.; Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 2003.; Includes bibliographical references (leaves 20-21).; This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.

The definition and implementation of a computer programming language based on constraints

Steele, Guy Lewis
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 372 leaves; 28275547 bytes; 28275307 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
776.8797%
by Guy Lewis Steele, Jr.; Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1980.; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.; Bibliography: leaves 365-371.

Analysis and specification of office procedures

Kunin, Jay Stuart
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 232 leaves; 18798434 bytes; 18798193 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
776.8797%
by Jay Stuart Kunin.; Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982.; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.; Bibliography: leaves 228-232.

Locality principles and the acquisition of syntactic knowledge

Berwick, Robert Cregar
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 2 v. (451 leaves); 37065697 bytes; 37065457 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
786.9477%
by Robert Cregar Berwick.; Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982.; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.; Bibliography: leaves 439-451.

Acore--the design of a core actor language and its compiler

Manning, Carl Roger
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 267 leaves; 18355991 bytes; 18355748 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.2159%
by Carl Roger Manning.; Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.; M.I.T. copy lacks leaf 265. Title as it appeared in M.I.T. Graduate List June 1987: Acore--the design of an actor core language and its compiler.; Bibliography: leaves 266-267.

Dynamic markup language conversion for improved WAP network architecture and performance; Dynamic markup language conversion for improved wireless application protocol network architecture and performance

Akhtar, Kareem A. H., 1977-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 57 leaves; 4227102 bytes; 4226864 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.358%
by Kareem A.H. Akhtar.; Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2001.; Includes bibliographical references (leaf 57).

Stochastic processes on graphs with cycles : geometric and variational approaches

Wainwright, Martin J. (Martin James), 1973-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 271 leaves; 21824527 bytes; 21824286 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
777.5724%
Stochastic processes defined on graphs arise in a tremendous variety of fields, including statistical physics, signal processing, computer vision, artificial intelligence, and information theory. The formalism of graphical models provides a useful language with which to formulate fundamental problems common to all of these fields, including estimation, model fitting, and sampling. For graphs without cycles, known as trees, all of these problems are relatively well-understood, and can be solved efficiently with algorithms whose complexity scales in a tractable manner with problem size. In contrast, these same problems present considerable challenges in general graphs with cycles. The focus of this thesis is the development and analysis of methods, both exact and approximate, for problems on graphs with cycles. Our contributions are in developing and analyzing techniques for estimation, as well as methods for computing upper and lower bounds on quantities of interest (e.g., marginal probabilities; partition functions). In order to do so, we make use of exponential representations of distributions, as well as insight from the associated information geometry and Legendre duality. Our results demonstrate the power of exponential representations for graphical models...

TagMeds : a tool for populating eXtensible Markup Language documents with UMLS concept unique identifiers of current medications; Tool for populating eXtensible Markup Language documents with UMLS concept unique identifiers of current medications

Nakrin, Andrew S. (Andrew Steven), 1952-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 117 p.; 5795496 bytes; 5810211 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
782.72875%
by Andrew S. Nakrin.; Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.; Includes bibliographical references (p. 113-117).

Building a trajectory syntax through language evolution

Kim, Anthony Hahn, 1980-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 82 leaves; 3357365 bytes; 3366134 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
776.8797%
If we are to understand the innately human ability to solve complex problems, we must first understand the cognitive processes that allow us to combine different kinds of knowledge, to learn new things and to communicate with other people. I have built a computer simulation, based on the work of Simon Kirby, in which I show that a population of induction agents, capable of perceiving their environment and producing utterances, can develop a compositional grammar to describe the world they observe with no prior linguistic knowledge. This system expands the semantic domain proposed by Kirby which expressed meanings such as "John knows Pete" to a physical world of trajectories such as "The boy ran from the tree to the pole". In this new simulation, I demonstrate that a compositional syntax still develops if the level of semantic complexity increases over time. I then argue that using multiple representations decreases the time necessary for a compositional grammar to emerge.; by Anthony Hahn Kim.; Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.; Includes bibliographical references (leaves 81-82).

SLLS : an online conversational spoken language learning system; Spoken Language Learning System

Lau, Tien-Lok Jonathan, 1980-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 77 leaves; 4047105 bytes; 4046912 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
782.72875%
by Tien-Lok Jonathan Lau.; Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.; Includes bibliographical references (leaves 75-77).

Large vocabulary continuous speech recognition using linguistic features and constraints

Tang, Min, Ph. D. Massachusetts Institute of Technology
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 123 leaves; 777354 bytes; 732301 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
777.5724%
Automatic speech recognition (ASR) is a process of applying constraints, as encoded in the computer system (the recognizer), to the speech signal until ambiguity is satisfactorily resolved to the extent that only one sequence of words is hypothesized. Such constraints fall naturally into two categories. One deals with the ordering of words (syntax) and organization of their meanings (semantics, pragmatics, etc). The other governs how speech signals are related to words, a process often termed as lexical access". This thesis studies the Huttenlocher-Zue lexical access model, its implementation in a modern probabilistic speech recognition framework and its application to continuous speech from an open vocabulary. The Huttenlocher-Zue model advocates a two-pass lexical access paradigm. In the first pass, the lexicon is effectively pruned using broad linguistic constraints. In the original Huttenlocher-Zue model, the authors had proposed six linguistic features motivated by the manner of pronunciation. The first pass classifies speech signals into a sequence of linguistic features, and only words that match this sequence - the cohort - are activated. The second pass performs a detailed acoustic phonetic analysis within the cohort to decide the identity of the word. This model differs from the lexical access model nowadays commonly employed in speech recognizers where detailed acoustic phonetic analysis is performed directly and lexical items are retrieved in one pass. The thesis first studies the implementation issues of the Huttenlocher-Zue model. A number of extensions to the original proposal are made to take advantage of the existing facilities of a probabilistic...

An extensible object-oriented executor for the Timeliner user interface language

Stern, Steven M. (Steven Michael)
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 71 leaves; 3287929 bytes; 3290820 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.4655%
Timeliner is a time-oriented scripting language and execution environment used on the International Space Station. This project describes the creation of a new version of the executor, using Java technology. This executor is more modular, extensible, and easier to maintain than the existing Timeliner system, which is written in Ada. This executor, in conjunction with a previously developed Java compiler, completes the Next Generation Timeliner system. This system can now compile and execute many test scripts, including a self contained simulation.; by Steven M. Stern.; Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.; Includes bibliographical references (leaf 71).

An integrated methodology for the performance and reliability evaluation of fault-tolerant systems

Domínguez-García, Alejandro D. (Alejandro Dan)
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 224 leaves
Português
Relevância na Pesquisa
775.5111%
This thesis proposes a new methodology for the integrated performance and reliability evaluation of embedded fault-tolerant systems used in aircraft, space, tactical, and automotive applications. This methodology uses a behavioral model of the system dynamics, similar to the ones used by control engineers when designing the control system, but incorporates additional artifacts to model the failure behavior of the system components. These artifacts include component failure modes (and associated failure rates) and how those failure modes affect the dynamic behavior of the component. The methodology bases the system evaluation on the analysis of the dynamics of the different configurations the system can reach after component failures occur. For each of the possible system configurations, a performance evaluation of its dynamic behavior is carried out to check whether its properties, e.g., accuracy, overshoot, or settling time, which are called performance metrics, meet system requirements. Markov chains are used to model the stochastic process associated with the different configurations that a system can adopt when failures occur.; (cont.) Reliability and unreliability measures can be quantified, as well as probabilistic measures of performance...

An online system for entering and annotating non-native Mandarin Chinese speech for language teaching

Hawksley, Andrea Johanna
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 62 leaves
Português
Relevância na Pesquisa
783.4655%
This thesis describes the design and implementation of an intuitive online system for the annotation of non-native Mandarin Chinese speech by native Chinese speakers. This system will allow speech recognition researchers to easily generate a corpus of labeled non-native speech. We have five native Chinese speakers test the annotation system on a sample bank of 250 Chinese utterances and observe fair to moderate inter-rater agreement scores. In addition to giving us a benchmark for inter-rater agreement, this also demonstrates the feasibility of having remote graders annotate sets of utterances. Finally, we extend our work to Chinese language instruction by creating a web-based interface for Chinese reading assignments. Our design is a simple, integrated solution for completing and correcting of spoken reading assignments, that also streamlines the compilation of a corpus of labeled non-native speech for use in future research.; by Andrea Johanna Hawksley.; Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.; Includes bibliographical references (leaves 59-62).

Towards multi-domain speech understanding with flexible and dynamic vocabulary

Chung, Grace Yuet-Chee
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 208 p.; 17634800 bytes; 17634557 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.8474%
In developing telephone-based conversational systems, we foresee future systems capable of supporting multiple domains and flexible vocabulary. Users can pursue several topics of interest within a single telephone call, and the system is able to switch transparently among domains within a single dialog. This system is able to detect the presence of any out-of-vocabulary (OOV) words, and automatically hypothesizes each of their pronunciation, spelling and meaning. These can be confirmed with the user and the new words are subsequently incorporated into the recognizer lexicon for future use. This thesis will describe our work towards realizing such a vision, using a multi-stage architecture. Our work is focused on organizing the application of linguistic constraints in order to accommodate multiple domain topics and dynamic vocabulary at the spoken input. The philosophy is to exclusively apply below word-level linguistic knowledge at the initial stage. Such knowledge is domain-independent and general to all of the English language. Hence, this is broad enough to support any unknown words that may appear at the input, as well as input from several topic domains. At the same time, the initial pass narrows the search space for the next stage...

StarLogo TNG : the convergence of graphical programming and text processing; Convergence of graphical programming and text processing

McCaffrey, Corey (Corey Stanley Gordon)
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 68 leaves
Português
Relevância na Pesquisa
783.5495%
StarLogo TNG is a robust graphical programming environment for secondary students. Despite the educational advantages of graphical programming, TNG has sustained criticism from some who object to the exclusion of a textual language. Recognizing the benefits of text processing and the power of controlling software with a keyboard, I sought to incorporate text-processing techniques into TNG's graphical language. The key component of this work is an innovation dubbed "Typeblocking," by which users construct block code through the use of a keyboard.; by Corey McCaffrey.; Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.; This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.; Includes bibliographical references (leaves 67-68).

Hybrid eager and lazy evaluation for efficient compilation of Haskell

Maessen, Jan-Willem
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 222 p.; 706155 bytes; 705889 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.7584%
The advantage of a non-strict, purely functional language such as Haskell lies in its clean equational semantics. However, lazy implementations of Haskell fall short: they cannot express tail recursion gracefully without annotation. We describe resource-bounded hybrid evaluation, a mixture of strict and lazy evaluation, and its realization in Eager Haskell. From the programmer's perspective, Eager Haskell is simply another implementation of Haskell with the same clean equational semantics. Iteration can be expressed using tail recursion, without the need to resort to program annotations. Under hybrid evaluation, computations are ordinarily executed in program order just as in a strict functional language. When particular stack, heap, or time bounds are exceeded, suspensions are generated for all outstanding computations. These suspensions are re-started in a demand-driven fashion from the root. The Eager Haskell compiler translates Ac, the compiler's intermediate representation, to efficient C code. We use an equational semantics for Ac to develop simple correctness proofs for program transformations, and connect actions in the run-time system to steps in the hybrid evaluation strategy.; (cont.) The focus of compilation is efficiency in the common case of straight-line execution; the handling of non-strictness and suspension are left to the run-time system. Several additional contributions have resulted from the implementation of hybrid evaluation. Eager Haskell is the first eager compiler to use a call stack. Our generational garbage collector uses this stack as an additional predictor of object lifetime. Objects above a stack watermark are assumed to be likely to die; we avoid promoting them. Those below are likely to remain untouched and therefore are good candidates for promotion. To avoid eagerly evaluating error checks...

TIOA and UPPAAL; Timed Input/Output Automata and UPPAAL

Robson, Christine Margaret, 1981-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 87 p.; 3317565 bytes; 3327468 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
785.81266%
This thesis presents a tool that assists in the development of timed systems, giving users simulation and verification capacities to guarantee timing properties in computer programs. The IOA Toolkit, a toolset for developing distributed systems, is extended to permit time-dependant properties to be described using a subset of the Timed IOA (TIOA) language. This thesis also includes a translator from TIOA into UPPAAL, another toolset. This translator allows the simulation of IOA and TIOA programs in UPPAAL's easy-to-use interface, and the checking of their properties with UPPAAL's model checker. This thesis lays the framework for an extension of the toolkit to utilize the full TIOA language, and to allow composed automata to be simulated. A scheme for translating composed automata into UPPAAL is also presented.; by Christine Margaret Robson.; Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.; Includes bibliographical references (p. 83-87).

Automatic generation of XSLT by simultaneous editing; Automatic generation of Extensible Style Language Transformation by simultaneous editing

Stube, Brian A. (Brian Andrew), 1980-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 67 p.; 3081661 bytes; 3088249 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
783.5495%
The proliferation of XML during recent years has been aided by an array of powerful companion tools. One such tool, XSL Transformations (XSLTs), has played an important role in XML's adoption, facilitating interoperability by defining general transformations on XML documents. However, despite XSLT's power and flexibility, the transformations can be hard to define, often requiring recursion to perform simple operations. Further, writing XSLTs requires learning its transformation language, distracting from the primary focuses of the input and output. This thesis focuses on streamlining the generation of XSLTs through the use of a programming-by-demonstration (PBD) interface. Instead of directly defining an XSLT, a user begins with the input XML document, converting it to the desired output through text editing. Based on the input XML document, the resulting output document, and the sequence of user edits, an XSLT definition will then be automatically generated. To overcome the hindrance of repetitive editing this thesis relies heavily on simultaneous editing as implemented in LAPIS, defined as the editing of text with multiple simultaneous cursors inferred from positive and negative examples. In addition to reducing redundant actions...

Bayesian modeling of manner and path psychological data

Havasi, Catherine Andrea, 1981-
Fonte: Massachusetts Institute of Technology Publicador: Massachusetts Institute of Technology
Tipo: Tese de Doutorado Formato: 110 leaves; 494423 bytes; 572416 bytes; application/pdf; application/pdf
Português
Relevância na Pesquisa
779.9704%
How people and computers can learn the meaning of words has long been a key question for both AI and cognitive science. It is hypothesized that a person acquires a bias to favor the characteristics of their native language, in order to aid word learning. Other hypothesized aids are syntactic bootstrapping, in which the learner assumes that the meaning of a novel word is similar to that of other words used in a similar syntax, and its complement, semantic bootstrapping, in which the learner assumes that the syntax of a novel word is similar to that of other words used in similar situations. How these components work together is key to understanding word learning. Using cognitive psychology and computer science as a platform, this thesis attempts to tackle these questions using the classic example of manner and path verb bias. A series of cognitive psychology experiments was designed to gather information on this bias. Considerable flexibility of the subject's bias was demonstrated during these experiments. Another separate series of experiments was conducted using different syntactic frames for the novel verbs to address the question of bootstrapping. The resulting information was used to design a Bayesian model which successfully predicts the human behavior in the psychological experiments that were conducted. Dynamic parameters were required to account for subjects revising their expected manner and path verb distributions during the course of an experiment. Bayesian model parameters that were optimized for rich syntactic frame data performed equally well in predicting poor syntactic frame data.; by Catherine Andrea Havasi.; Thesis (M. Eng.)--Massachusetts Institute of Technology...