301 |
Interpretation of the electronic structure in condensed phase calculatioonsBernasconi, Leonardo January 2001 (has links)
No description available.
|
302 |
Biochemical and developmental studies on protein components of the diacylglcerol transport system in Locusta migratoria migratorioidesMiles, C. M. January 1986 (has links)
No description available.
|
303 |
Development of a stable and persistent laboratory ecosystem for the integration of biogeochemical and population biology studiesRedfern, Peter Ronald January 1989 (has links)
No description available.
|
304 |
Constant and power-of-2 segmentation algorithms for a high speed numerical function generatorValenzuela, Zaldy M. 06 1900 (has links)
The realization of high-speed numeric computation is a sought-after commodity for real world applications, including high-speed scientific computation, digital signal processing, and embedded computers. An example of this is the generation of elementary functions, such as sin( ) x , x e and log( ) x . Sasao, Butler and Reidel [Ref. 1] developed a high speed numeric function generator using a look-up table (LUT) cascade. Their method used a piecewise linear segmentation algorithm to generate the functions [Ref. 1]. In this thesis, two alternative segmentation algorithms are proposed and compared to the results of Sasao, Butler and Reidel [Ref.1]. The first algorithm is the Constant Approximation. This algorithm uses lines of slope zero to approximate a curve. The second algorithm is the power-of-2-approximation. This method uses 2i x to approximate a curve. The constant approximation eliminates the need for a multiplier and adder, while the power-of-2-approximations eliminates the need for multiplier, thus improving the computation speed. Tradeoffs between the three methods are examined. Specifically, the implementation of the piecewise linear algorithm requires the most amount of hardware and is slower than the other two. The advantage that it has is that it yields the least amount of segments to generate a function. The constant approximation requires the most amount of hardware to realize a function, but is the fastest implementation. The power-of-2 approximation is an intermediate choice that balances speed and hardware requirements.
|
305 |
Differentiable FunctionsMcCool, Kenneth B. 06 1900 (has links)
The primary purpose of this thesis is to carefully develop and prove some of the fundamental, classical theorems of the differential calculus for functions of two real variables.
|
306 |
A Study of Functions on Metric SpacesBrice, Richard S. 01 1900 (has links)
This thesis describes various forms of metric spaces and establishes some of the properties of functions defined on metric spaces. No attempt is made in this paper to examine a particular type of function in detail. Instead, some of properties of several kinds of functions will be observed as the functions are defined on various forms of metric spaces such as connected spaces, compact spaces, complete spaces, etc.
|
307 |
Rings of Continuous FunctionsConnell, Carolyn 08 1900 (has links)
The purpose of this paper is to examine properties of the ring C(X) of all complex or real-valued continuous functions on an arbitrary topological space X.
|
308 |
Integration of Vector Valued FunctionsAnderson, Edmond Cardell, III 08 1900 (has links)
This paper develops an integral for Lebesgue measurable functions mapping from the interval [0, 1] into a Banach space.
|
309 |
Properties of Limit FunctionsCoppin, Anthony M. 12 1900 (has links)
The purpose of this paper is to investigate properties of functions which are limits of functions with prescribed properties. Chapter II asks the question "Does a function which is the limit of a sequence of functions each of which is endowed with a certain property necessarily have that property?"
|
310 |
Lebesgue-Stieltjes Measure and IntegrationSeale, Laura S. 05 1900 (has links)
The purpose of the thesis is to investigate an approach to Lebesgue-Stieltjes measure and integration.
|
Page generated in 0.0285 seconds