Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1474 for “"computation time"”.
-
ENHANCED COMPUTATION TIME FOR FAST BLOCK MATCHING ALGORITHM
… studies on video compression have focused on multimedia transmission, videophones, teleconferencing, high definition television (HDTV), CD-ROM storage, etc. The idea of compression techniques is to remove the redundant information that exists in the video sequences. Motion compensated predictive …
-
A comparison of computation time for sequential normal scores with other nonparametric statistical process control methods
… Process Control} by Peihua Qiu, we measured the computation time in R for creating charting statistics for batches of data using the techniques in the aforementioned book and using sequential normal scores. For analyzing the same data, using sequential normal scores tended to take less time …
-
Multiple-valued programmable logic array minimization by concurrent multiple and mixed simulated annealing.
… search is not very realistic because of enormous computation time required to reach a solution. One of the heuristics to reduce this computation time and provide a nearminimal solution is simulated annealing. This thesis analyzes the use of loosely-coupled, course-grained parallel systems for …
-
Component mode synthesis for ship structures : investigation into an alternative approach
… principles, accuracy, practicality and required computation time when applied on typical marine structures. Full finite element modelling has been applied on a part of the structure of an LNG carrier on board which the author has taken vibration and noise measurements. Also fixed interface …
-
The minimization of multiple valued logic expressions using parallel processors
… requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood Decoupling (ND) Algorithm by Yang and Wang. This algorithm finds near-optimal solutions for the given MVL expressions. The ND algorithm is an extension of …
-
Issues of Computational Efficiency and Model Approximation for Spatial Individual-Level Infectious Disease Models
… iterations, however this negatively effects computation time. It is important that model fitting is done as efficiently as possible. An upper-truncated distance kernel is introduced to quicken the computation of the likelihood, but this causes a loss in goodness-of-fit. The normalization …
-
A computation-implementation parallelization approach to time-sensitive applications
In this thesis, we study time-sensitive applications where it is important to minimize the completion time, i.e., time passing between receiving the instance and finishing the implementation of the solution. Different from the traditional approach, we are directly focusing on the minimization of …
-
FAST ADEQUACY ASSESSMENT OF COMPOSITE POWER SYSTEMS
… however, significantly increases the computation time. One of the most widely used approaches to reduce the computation time is to rank the outage contingencies using fast techniques and then investigate these ranked contingencies using an AC load flow method. This procedure is then …
-
FAST ADEQUACY ASSESSMENT OF COMPOSITE POWER SYSTEMS
… however, significantly increases the computation time. One of the most widely used approaches to reduce the computation time is to rank the outage contingencies using fast techniques and then investigate these ranked contingencies using an AC load flow method. This procedure is then …
-
Parallel best-first search : optimizing the number of expansions per iteration on slaves
… per iteration, number of slaves, heuristics, computation time (c<sub>1</sub>) and communication time(c<sub>2</sub>). A simple mathematical model is developed to estimate the computation time per each expansion (c<sub>1</sub>) and communication time (c<sub>2</sub>). Intuitively, E is directly …
-
Bringing Probabilistic Real-Time Guarantees to the Real World
Stochastic analysis of real-time systems has received a remarkable attention in the past few years. In general, this analysis has been mainly focused on sets of applications competing for a shared CPU and assuming independence in the computation and inter-arrival times of the jobs composing the …
-
A System for Using Perceiver Input to Vary the Quality of Generative Multimedia Performances
Generative Multimedia (GM) applications are an increasingly popular way to implement interactive media performances. Our contributions include creating a metric for evaluating Generative Multimedia performances, designing a model for accepting perceiver preferences, and using those preferences to …
-
Performance Analysis between Two Sparsity Constrained MRI Methods: Highly Constrained Backprojection(HYPR) and Compressed Sensing(CS) for Dynamic Imaging
… fast enough to capture the dynamics in the image time series without losing high spatial resolution and signal to noise ratio. Many techniques have been introduced in the recent decades to achieve this goal. Newly developed algorithms like Highly Constrained Backprojection (HYPR) and Compressed …
-
A comparison of transcription techniques for the optimal control of the International Space Station
… comparisons will be made on accuracy, computation time, adjoint estimation, and storage requirements. It will be shown that the most distinct advantage for LGL PS collocation and MS methods will lie in computation time and storage requirements, respectively, using a nonlinear …
-
A rapid digital method of power distribution network analysis
… is usually expressed by the relationship Computation time oC (N° of busbars). It present, the computation times of most applied processes are based on a performance index, y « 3, while some experimental programmes, namely organised elimination (eliminations ordonees) of Canal (Ref.xii) and …
-
Distance Estimation for 3D Freehand Ultrasound-Scans with Visualization System
… primary concerns with freehand 3D ultrasound are time-consuming calibration operations, overall accuracy, and computation time during the 3D reconstruction process. A procedure was developed to reduce the calibration time to only 10 seconds by planning the path of the probe. A decrease in marginal …
-
Design of Minimal Programmable Logic Arrays
… For the automated design of PLA's, we need computationally efficient procedures that can minimize functions of a large number of variables. For this type of function, the commonly used procedures cannot be applied either because they take too much computation time or because they require too …
-
Parallelization of the Naval Space Surveillance Center (NAVSPASUR) satellite motion model
… NAVSPASUR desires a method to reduce the computation time of this satellite motion model. Parallel computing offers one method to achieve this objective. This thesis investigates the parallel computing potential of the MAVSPASUR model using the Intel iPSC/2 hypercube multi-computer. The …
-
Computational improvements of a multibody dynamic simulation algorithm applied to a landing event simulation of a flexible legged Europa lander
… For example, some methods are more computationally expensive than others, and many methods naturally eliminate inter-body loads from calculations. This thesis focuses on a constrained coordinate method for developing multibody dynamic simulations which uses nonlinear control theory …
Page 1 of 74