Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Physical Sciences and Mathematics

Fast Implementation Of Depth Contours Using Topological Sweep, Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Toni Sellarès, Diane Souvaine, Ileana Streinu, Anja Struyf Dec 2001

Fast Implementation Of Depth Contours Using Topological Sweep, Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Toni Sellarès, Diane Souvaine, Ileana Streinu, Anja Struyf

Computer Science: Faculty Publications

The concept of location depth was introduced in statistics as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. These reguire the computation of depth regions, which form a collection of nested polygons. The center of the deepest region is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all depth contours in &Ogr;(n 2) time …


Nature Of Charge Carriers In Disordered Molecular Solids: Are Polarons Compatible With Observations?, Paul Ernest Parris, Vasudev M. Kenkre, David H. Dunlap Sep 2001

Nature Of Charge Carriers In Disordered Molecular Solids: Are Polarons Compatible With Observations?, Paul Ernest Parris, Vasudev M. Kenkre, David H. Dunlap

Physics Faculty Research & Creative Works

Polaronic theories for charge transport in disordered organic solids, particularly molecularly doped polymers, have been plagued by issues of internal consistency related to the magnitude of physical parameters. We present a natural resolution of the problem by showing that, in the presence of correlated disorder, polaronic carriers with binding energies Δ ~ 50 - 500 meV and transfer integrals J ~ 1 - 20 meV are completely consistent with the magnitudes of field and temperature dependent mobilities observed.


Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras Jun 2001

Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper analyzes how using a longer memory of the past queue occupancy in computing the average queue occupancy affects the stability and variability of a RED queue. Extensive simulation studies with both persistent and Web TCP sources are used to study the variance of the RED queue as a function of the memory of the averaging process. Our results show that there is very little performance improvement (and in fact, possibly significant performance degradation) if the length of memory is increased beyond a very small value. Contrary to current practice, our results show that a longer memory reduces the …


Mapping Quantitative Trait Loci In Humans: Some Statistical Contributions., Saurabh Ghosh Dr. Feb 2001

Mapping Quantitative Trait Loci In Humans: Some Statistical Contributions., Saurabh Ghosh Dr.

Doctoral Theses

Maty qualitative tralts - such an, milk yield la cows, blood pressure in lumans --are known to be determined primarly, though zot exclusively, by inherited genetic luctora. It ls the of coasklerable impartance to identify chromosontal locations of tho genes that control a quantitative character. Linkage analysis (Ou 1990), which deals with the deduction of linkagn and estimation of recombination fractions among the loci controlling a qualitative/quantitative character and major loci wkoo poertions are knows aprfori, is widely used for localisation of gens. Although statistical methodologies for magplag gemen determining dichotomos qualitative charactes in humans aro well-developed, the demicrant of …


Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr. Feb 2001

Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr.

Doctoral Theses

In this thesis we concentrate on properties of cryptographically significant Boolean functions.The techniques are mainly combinstorial and provide new resulta on enumeration and construction of such functions. Initially we concentrate on a partieular subset of Boolean functions called the symmetric Boolean functions. A closed form expression for the Walsh transform of an arbitrary symmetric Boolean function is presented. We completely characterize the symmetric functions with maximum nonlinearity and show that the maximum nonlinearity of n-variable symmetrie function can be 2n-1-2[n-1l2], Moreover, new classes of symmetric balanced and symmetric correlation immune functions are considered.We provide a randomised heuristic to construct balanced …


Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr. Jan 2001

Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr.

Doctoral Theses

The term Very Large Scale Integration (VLSI) reflects the capability of semi- conductor industry to fabricate a complex electronic circuit consisting of millions of components on a single silicon substrate. The growth of semiconductor technol- ogy in recent years has been described by "Moore's law", enunciated in the late 1960s, which projected quadrupling of components in a chip in every three to four years. Several factors contributed to this tremendous growth : (i) reduction of line width of the basic device and interconnection wires due to the development of high- resolution lithographic techniques and improved processing capabilities, (ii) increase in …


Using Types To Analyze And Optimize Object-Oriented Programs, Amer Diwan, Kathryn S. Mckinley, J. Eliot B. Moss Jan 2001

Using Types To Analyze And Optimize Object-Oriented Programs, Amer Diwan, Kathryn S. Mckinley, J. Eliot B. Moss

Computer Science Department Faculty Publication Series

Object-oriented programming languages provide many software engineering benefits, but these often come at a performance cost. Object-oriented programs make extensive use of method in- vocations and pointer dereferences, both of which are potentially costly on modern machines. We show how to use types to produce effective, yet simple, techniques that reduce the costs of these features in Modula-3, a statically typed, object-oriented language. Our compiler performs type-based alias analysis to disambiguate memory references. It uses the results of the type-based alias analysis to eliminate redundant memory references and to replace monomorphic method in- vocation sites with direct calls. Using limit, …