Browsing Rice University Electronic Theses and Dissertations by Subject "Computer Science"
Now showing items 160 of 417

A computational method for constructing Sylvesterstyle sparse resultants
(2005)We present a computational approach for constructing Sylvester style resultants for sparse systems of bivariate polynomial equations. Necessary and sufficient conditions are derived which guarantee that a multiplying set ... 
A computational study of vehicle routing applications
(1999)This thesis examines three specific routing applications. In the first model, the scheduling of home health care providers from their homes, to a set of patients, and then back to their respective homes, is performed both ... 
A connectionist approach to autonomous robotic navigation
(1991)Robotic navigation has been an area of intense research since the onset of mobile robot development. The usefulness of mobile robots ultimately reside in their ability to move and interact with the environment. Current ... 
A consistent and transparent solution for caching dynamic Web content
(2005)Caching is an effective means for reducing load on web servers, especially for those that dynamically generate documents in dynamic web applications. While adding caching to a web application can greatly reduce response ... 
A correspondence between Scheme and the lambda(,upsilon)CScalculus
(1989)We study the relationship between the programming language Scheme and the $\lambda\sb{v}$CScalculus. To this end, we define a correspondence between Scheme and $\Lambda\sb{CS}$termsthe language of the calculuswhere ... 
A dynamic distributed transmission power control MAC protocol for mobile ad hoc networks
(2003)Ad hoc networking involves multihop, peertopeer communication between a group of wireless mobile nodes in a network with a dynamically changing topology. Achieving energyefficient communication in such a network is more ... 
A dynamic model of comprehension with applications to Korean and English
(1988)Most researchers working to develop a comprehension process fail to distinguish the different levels often recognized by linguists. Some, for example, have attempted to incorporate a composite form such as 'has' into one ... 
A factored, interpolatory subdivision scheme for surfaces of revolution
(2003)We present a new nonstationary, interpolatory subdivision scheme capable of producing circles and surfaces of revolution and in the limit is C1. First, we factor the classical four point interpolatory scheme of Dyn et ... 
A FEATURE CONSTRUCTION METHODOLOGY FOR RECOGNITION OF COMPLEX PATTERNS IN SCENES
(1981)A framework and techniques for recognition and analysis of complex patterns in scenes are presented. By a "complex pattern" we mean a configuration of objects of interest, called "simple patterns", which appear in full ... 
A firstclass approach to genericity
(2003)This thesis describes how to add firstclass generic typesincluding mixinsto stronglytyped objectoriented languages with nominal subtyping such as Java and C#. A generic type system is "firstclass" if generic types ... 
A framework for building pedagogic Java programming environments
(2002)Java has become the dominant language for teaching introductory computer science at both the high school and college levels. Yet Java's development tools and syntax often distract beginning students from the programming ... 
A framework for managing models in nonlinear optimization of computationally expensive functions
(1999)One of the most significant problems in the application of standard optimization methods to realworld engineering design problems is that the computation of the objective function often takes so much computer time (sometimes ... 
A GLOBAL APPROACH TO DETECTION OF PARALLELISM (COMPILERS)
(1987)Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques to automatically detect and exploit parallelism have been shown effective for computers with vector capabilities. To ... 
A historical development of the (n+1)point secant method
(2007)Many finitedimensional minimization problems and nonlinear equations can be solved using Secant Methods. In this thesis, we present a historical development of the (n + 1)point Secant Method tracing its evolution back ... 
A largescale trustregion approach to the regularization of discrete illposed problems
(1999)We consider the problem of computing the solution of largescale discrete illposed problems when there is noise in the data. These problems arise in important areas such as seismic inversion, medical imaging and signal ... 
A minimumcostneighbor multicast routing protocol for mobile wireless ad hoc networks
(2010)MiCoN (MinimumCost Neighbor) is a new ondemand multicast routing protocol for mobile wireless ad hoc networks. Multicast routing in MiCoN is based on a new multiroute unicast routing protocol for maintaining routes ... 
A modified augmented Lagrangian merit function, and Qsuperlinear characterization results for primaldual QuasiNewton interiorpoint method for nonlinear programming
(1997)Two classes of primaldual interiorpoint methods for nonlinear programming are studied. The first class corresponds to a pathfollowing Newton method formulated in terms of the nonnegative variables rather than all primal ... 
A multifaceted model of the consequences of sample size choice in usability testing
(2008)A multifaceted model is developed to demonstrate the consequences of sample size choice in usability testing. This model takes into account the severity levels of user performance, the distribution of severity levels, the ... 
A new approach to slant stack processing: An Xwindow (OSF/motif) project
(1992)A new definition for slant stack and inversion has been formulated. The different p ranges with different frequencies in the forward slant stack provide accurate reconstruction of the original data. The computing time is ... 
A pedagogic programming environment for Java that scales to production programming
(2003)This thesis describes extensions to the DrJava development environment that make it suitable for production programming. DrJava is an effective tool for teaching introductory programming skills in Java, and its simplicity ... 
A practical application of a force feedback control system for a mechanical, 3fingered, dextrous hand
(1992)The trajectory planning and control system for a mechanical, 3fingered, dextrous hand are analyzed and implemented. The forward and inverse kinematics of the fingers are derived and used to analyze the capabilities of the ... 
A qualitative theory of gas dynamics
(1992)Within the realm of research toward the emulation of human intelligence, the problem of how to perform qualitative reasoning with computer programs has received considerable attention. The research field of qualitative ... 
A scattered data approximation tool to map carbon nanotube dispersion to the processing parameters in polymer nanocomposites
(2009)The relationship of nanocomposite dispersion was studied with the variation of dispersion techniques and other processing parameters. Examining all permutations of the various factors in the laboratory is a challenging ... 
A SINGLE INTERMEDIATE LANGUAGE FOR PROGRAMMING ENVIRONMENTS
(1985)Programming by the traditional methods of text editing and batch compilation is no longer necessary. The advent of the personal workstation and bitmap graphics allows us to construct integrated programming environments, ... 
A software simulation testbed for CDMA wireless communication systems
(1999)This thesis develops a software wireless communication testbed which simulates a Code Division Multiple Access (CDMA) link. CDMA is a popular technology in cellular systems due to its superior capacity and performance. The ... 
A storage architecture for dataintensive computing
(2010)The assimilation of computing into our daily lives is enabling the generation of data at unprecedented rates. In 2008, IDC estimated that the "digital universe" contained 486 exabytes of data [9]. The computing industry ... 
A study of viscous effects in seismic modeling, imaging, and inversion: Methodology, computational aspects, and sensitivity
(1996)Real Earth media are anelastic, which affects both the kinematics and dynamics of propagating waves: Waves are attenuated and dispersed. If anelastic effects are neglected, inversion and migration can yield erroneous ... 
A subgradient algorithm for nonlinear integer programming and its parallel implementation
(1991)This work concerns efficiently solving a class of nonlinear integer programming problems: min $\{f(x)$: $x \in \{0,1\}\sp{n}\}$ where $f(x)$ is a general nonlinear function. The notion of subgradient for the objective ... 
A symmetry preserving singular value decomposition
(2007)This thesis concentrates on the development, analysis, implementation, and application of a symmetry preserving singular value decomposition (SPSVD). This new factorization enhances the singular value decomposition (SVD)a ... 
A systolic VLSI architecture for complex SVD
(1991)This thesis presents a systolic algorithm for the SVD of arbitrary complex matrices, based on the cyclic Jacobi method with "parallel ordering". As a basic step in the algorithm, a twostep, twosided unitary transformation ... 
A theory of photometric stereo for a general class of reflectance maps
(1990)Photometric stereo is an image processing technique for 2$1\over 2$ dimensional surface reconstruction from local shading. The classical theory of photometric stereo has been developed only for surfaces that reflect in a ... 
A typebased prototype compiler for telescoping languages
(2009)Scientists want to encode their applications in domain languages with highlevel operators that reflect the way they conceptualize computations in their domains. Telescoping languages calls for automatically generating ... 
A visionbased fuzzy logic and neural network approach to the control of hyperredundant robot manipulators
(1994)Hyperredundant robot manipulators possess a very large degree of kinematic redundancy and are capable of motion similar to that of snakes and elephant trunks. Because of the computational burden required to calculate the ... 
Accelerating the Arnoldi iteration: Theory and practice
(1998)The Arnoldi iteration is widely used to compute a few eigenvalues of a large sparse or structured matrix. However, the method may suffer from slow convergence when the desired eigenvalues are not dominant or well separated. ... 
Adaptive compilation and inlining
(2006)Adaptive compilation uses a feedbackdriven process to leverage additional compilation time into improved executable performance. Previous work on adaptive compilation has demonstrated its benefit at an interoptimization ... 
Adaptive ordering of code transformations in an optimizing compiler
(2005)It has long been known that the quality of the code produced by an optimizing compiler is dependent upon the ordering of transformations applied to the code. In this dissertation, we show that the best orderings vary in ... 
Adding support for language levels to DrJava
(2005)This thesis describes the design and implementation of language levels, a pedagogic tool that helps students progressively learn objectoriented programming concepts in discrete stages. While Java is widely used in academia, ... 
Admission control in multiservice wireless networks
(1999)Supporting Quality of Service (QoS) in mobile networks requires that admission control algorithms incorporate user mobility, and limit the probability that sufficient resources are unavailable when a user must handoff. In ... 
Advanced dataparallel compilation
(2004)Over the past few decades, scientific research has grown to rely increasingly on simulation and other computational techniques. This strategy has been named in silico research. Computation is increasingly important for ... 
Advanced memory management and disk scheduling techniques for generalpurpose operating systems
(2006)Operating systems have evolved into sophisticated, highperformance virtualizing platforms, to support and be fair towards concurrently running applications. However, since applications usually run oblivious of each other ... 
Advanced methods for improving the leadtime and accuracy of a flood alert system in an urban watershed
(2005)The leadtime and accuracy of a flood alert system designed for a quickly responding urban watershed have been improved by incorporating a variety of new tools and methodologies. These include: the use of computermediated ... 
Advanced MIMOCDMA receiver for interference suppression: Algorithms, systemonchip architectures and design methodology
(2005)MIMO (Multiple Input Multiple Output) technology is proposed in CDMA systems for much higher rate packet services. The receiver architecture is essential for the mobile devices to support high speed multimedia service. The ... 
Algorithmic attacks and timing leaks in distributed systems
(2005)An important class of remotely applicable security attacks concerns time. You can attack somebody by making their algorithms run in their worstcase behavior rather than commoncase behavior. Likewise, the processing time ... 
An adaptive sensor network architecture for multiscale communication
(2006)Sensor networking has emerged as a promising tool for monitoring and actuating the devices of the physical world, employing selforganizing networks of batterypowered wireless sensors that can sense, process, and communicate. ... 
An efficient threading model to boost server performance
(2003)Multithreading is a popular choice for server architecture. Widely used servers, like the Apache web server and the MySQL database server, are written in a multithreaded fashion. We investigate the effects of thread ... 
An empirical evaluation of dependence analysis in parallel program comprehension
(1995)This research contributes two advances to the field of empirical study of parallel programming: first, the introduction of the Xbrowser system, a unique generalpurpose hypertext/hypermedia system combining highqualify ... 
An evaluation of memory consistency models for sharedmemory systems with ILP processors
(1997)The memory consistency model of a sharedmemory multiprocessor determines the extent to which memory operations may be overlapped or reordered for better performance. Studies on previousgeneration sharedmemory multiprocessors ... 
An experimental analysis of a set of compiler algorithms*
(2003)The thesis of this dissertation is that experimental analysis in computer science is an essential component of understanding algorithmic behavior. In three different experiments, we compare and contrast wellchosen algorithms ... 
An objectoriented framework for solving model problems using the sequential function approximation algorithm
(2001)This dissertation describes and tests an ObjectOriented framework, written in Fortran 90, for the Sequential Function Approximation (SFA) algorithm. The SFA algorithm is a meshless method which places its basis functions ... 
An optimizing Fortran D compiler for MIMD distributedmemory machines
(1993)Massively parallel MIMD distributedmemory machines can provide enormous computational power; however, the difficulty of developing parallel programs for these machines has limited their use. Our thesis is that an advanced ... 
Analysis and implementation of an implicitly restarted Arnoldi iteration
(1995)The Arnoldi algorithm, or iteration, is a computationally attractive technique for computing a few eigenvalues and associated invariant subspace of large, often sparse, matrices. The method is a generalization of the Lanczos ...