• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 55
  • 12
  • 5
  • 5
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 94
  • 94
  • 16
  • 13
  • 13
  • 13
  • 10
  • 9
  • 9
  • 8
  • 7
  • 7
  • 7
  • 7
  • 7
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

Using the Prony's Method to Reduce the Computation Time in FDTD Simulations

Chung, Yu-Hsuan 27 July 2005 (has links)
The disadvantage of FDTD method is that it needs a long simulation time, and it is difficult to simulate a complex circuit. The methods to improve the efficiency in FDTD simulation are increase in width of time step, enlargement in space grid and extrapolation of late time records. In this paper, we predict the late time record in FDTD simulation by applying Prony¡¦s method, and save the computation time of FDTD simulation. The cost of computation time of Prony¡¦s method is low, and it has a good result that applying Prony¡¦s method at predicting a waveform which resonates with period. In this paper, we try to make a rule for finding training start point and width of training period in Prony¡¦s method. The result of prediction with a short period of time records under the rule is accurate and reliable
22

Implementation of one surface fitting algorithm for randomly scattered scanning data

Guo, Xi. January 2000 (has links)
Thesis (M.S.)--Ohio University, August, 2000. / Title from PDF t.p.
23

Geometric data fitting /

Martínez-Morales, José L. January 1998 (has links)
Thesis (Ph. D.)--University of Washington, 1998. / Vita. Includes bibliographical references (p. [59]-61).
24

Reconstructing and analyzing surfaces in 3-space

Sun, Jian, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 129-135).
25

Depth Map Compression Based on Platelet Coding and Quadratic Curve Fitting

Wang, Han January 2012 (has links)
Due to the fast development in 3D technology during recent decades, many approaches in 3D representation technologies have been proposed worldwide. In order to get an accurate information to render a 3D representation, more data need to be recorded compared to normal video sequence. In this case, how to find an efficient way to transmit the 3D representation data becomes an important part in the whole 3D representation technology. Recent years, many coding schemes based on the principle of encoding the depth have been proposed. Compared to the traditional multiview coding schemes, those new proposed schemes can achieve higher compression efficiency. Due to the development of depth capturing technology, the accuracy and quality of the reconstructed depth image also get improved. In this thesis we propose an efficient depth data compression scheme for 3D images. Our proposed depth data compression scheme is platelet based coding using Lagrangian optimization, quadtree decomposition and quadratic curve fitting. We study and improve the original platelet based coding scheme and achieve a compression improvement of 1-2 dB compared to the original platelet based scheme. The experimental results illustrate the improvement provided by our scheme. The quality of the reconstructed results of our proposed curve fitting based platelet coding scheme are better than that of the original scheme.
26

Approximation of Nonlinear Functions for Fixed-Point and ASIC Applications Using a Genetic Algorithm

Hauser, James William 11 October 2001 (has links)
No description available.
27

A system dynamics application to student enrollment forecasting

Ugwunwa, Gabriel M. January 1980 (has links)
No description available.
28

The recognition of straight line patterns by bus automatons using parallel processing /

Mellby, John Rolf January 1980 (has links)
No description available.
29

DATA FITTING AND LEAST-SQUARE ESTIMATION OF NONLINEAR PARAMETERS FOR MODELS OF DIELECTRIC RELAXATION DATA

Zou, Hai 06 1900 (has links)
<p> The work in this thesis is to develop a tool for calculating the parameters corresponding to certain theoretical model of dielectric relaxation phenomena and then doing the curve fitting using the result after fetching the data from the user. To our best knowledge, this the first such tool to calculate the parameters corresponding to certain theoretical model of dielectric relaxation phenomena while the user only need to provide the experimental data. The parameters are calculated by using a nonlinear least square algorithm implemented in Matlab and a nonlinear function minimizer available in Matlab. The way to do the curve fitting is not by the traditional way such as cubic spline but by calculating the simulated data using the chosen model and the calculated result for the parameters. </p> <p> The available mathematical models include all of popular theoretical models, the Cole-Davidson (DC), the Kohlrausch-Williams-Watts (KWW), the Havriliak-Negami (HN) and the model proposed by R. Hilfer (FD). </p> <p> There are two ways to calculate the parameters for each model as mentioned before. The result returned by this system may not be unique. Especially if the frequency range of data is not wide enough, the result would most likely be non-unique. Since the iterative method is used in the system, it is suggested that the user provides the initial values for the system with his best knowledge or background for the data and the tested sample related to dielectric relaxation process. </p> <p> It is normal if there is a part having worse fitting than the other parts. One of reasons could be the mathematical model's defect, which the model does not work for that part. For the further information, please contact me by email at zouhaijun at yahoo.com. </p> / Thesis / Master of Science (MSc)
30

POLYNOMIAL FIT OF INTERFEROGRAMS.

KIM, CHEOL-JUNG. January 1982 (has links)
The conventional Zernike polynomial fit of circular aperture interferograms is reviewed and a more quantitative and statistical analysis is added. Some conventional questions such as the required number of polynomials, sampling requirements, and how to determine the optimum references surface are answered. Then, the analysis is applied to the polynomial fit of noncircular aperture interferograms and axicon interferograms. The problems and limitations of using Zernike polynomials are presented. A method of obtaining the surface figure error information from several smaller subaperture interferograms is analyzed. The limitations of the analysis for testing a large flat, a large parabola, or an aspheric surface are presented. The analysis is compared with the local connection method using overlapped wavefront information. Finally, the subaperture interferogram analysis is used to average several interferograms and to analyze lateral shearing interferograms.

Page generated in 0.0457 seconds