Browsing George R. Brown School of Engineering by Title
Now showing items 34983517 of 3897

The Bayesian Statistical Approach to the Phase Problem in Protein Xray Crystallography
(199904)We review a Bayesian statistical approach to the phase problem in protein Xray crystallography. We discuss the mathematical foundations and the computational issues. The introduction to the theory and the algorithms does ... 
The Behavior of NewtonType Methods on Two Equivalent Systems from Linear Programming
(199802)Newtontype methods are fundamental techniques for solving optimization problems. However, it is often not fully appreciated that these methods can produce significantly different behavior when applied to two equivalent ... 
The Block Structure of Three Dixon Resultants and Their Accompanying Transformation Matrices
(19990616)Dixon [1908] introduces three distinct determinant formulations for the resultant of three bivariate polynomials of bidegree (m,n) . The first technique applies Sylvester's dialytic method to construct the resultant as the ... 
The case for vehicular visible light communication (V2LC): Architecture, services and experiments
(2010)Visible Light Communications (VLC) is a fastgrowing technology to provide data communication using lowcost and omnipresent LEDs and photodiodes. In this thesis, we make the case for the use of vehicular VLC (V2LC) as ... 
The characteristics of nanoscale sunscreen particles
(2009)This thesis describes the characterization and photochemical behavior of metal oxide nanopigments derived from commercial sunscreens. We investigate their size, morphology, elemental composition, and crystal structure using ... 
The Combined Schubert/Secant/Finite Difference Algorithm for Solving Sparse Nonlinear Systems of Equations
(198605)This paper presents an algorithm, the combined Schubert/secant/finite difference algorithm, for solving sparse nonlinear systems of equations. This algorithm is based on dividing the columns of the Jacobian into two parts, ... 
The Computation of Elementary Unitary Matrices
(199402)The construction of elementary unitary matrices that transform a complex vector to a real multiple of e1, the first column of the identity matrix, is studied. We survey the two well known forms and present what appears to ... 
The Concurrent Collections Programming Model
(20100104)We introduce the Concurrent Collections (CnC) programming model. In this model, programs are written in terms of highlevel operations. These operations are partially ordered according to only their semantic constraints. ... 
The Concurrent Collections Programming Model
(20101216)Parallel computing has become firmly established since the 1980’s as the primary means of achieving high performance from supercomputers. 1 Concurrent Collections (CnC) was developed to address the need for making parallel ... 
The continuous wavelet transform: A discrete approximation
(1998)In this thesis, we develop an approximation to the continuous wavelet transform (CWT) which is unique in that it does not require an exact scaling relationship between the levels of the transform, but asymptotically ... 
The design of a high performance interconnect for distributed shared memory multiprocessing
(1997)This thesis describes and evaluates the design of a high performance interconnect for use in a distributed shared memory multiprocessor. The network is based on the Peripheral Component Interconnect (PCI) bus and is fully ... 
The design of a laser range imaging device
(1992)In this thesis, a methodology and techniques for the design of a laser range imaging device (LRID) for robotic applications are presented. Furthermore, a prototype incorporating the concepts presented has been successfully ... 
The design of a scalable, hierarchicalbus, sharedmemory multiprocessor
(1992)The hierarchicalbus architecture is an attractive solution to many of the problems associated with connecting processors together into a multiprocessing system but it also poses a number of design challenges. This thesis ... 
THE DESIGN OF DFT ALGORITHMS
(1982)A broad class of efficient discrete Fourier transform algorithms is developed by partitioning short DFT algorithms into factors. The factored short DFT's are combined into longer DFT's using multidimensional index maps. ... 
The DikinKarmarkar Principle for Steepest Descent
(199209)Steepest feasible descent methods for inequality constrained optimization problems have commonly been plagued by short steps. The consequence of taking short steps is slow convergence to nonstationary points (zigzagging). ... 
THE DISCRETE RADON TRANSFORM WITH APPLICATIONS TO TIME DOMAIN BEAMFORMING
(1986)Performing a discrete Radon transform (DRT) with an array of spacetime samples results in a function of slowness (inverse velocity) and time intercept. Time domain beamforming and semblance, two commonly used methods of ... 
The Effect of Caustics in Acoustic Inverse Scattering Experiments
(198905)Most inversion techniques described in the literature rely on the validity of ray tracing, which breaks down in the presence of caustics. The linearized acoustic inverse problem with constant reference velocity is analyzed ...