• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 38
  • 19
  • 12
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 84
  • 84
  • 28
  • 14
  • 14
  • 12
  • 12
  • 12
  • 12
  • 11
  • 10
  • 9
  • 9
  • 8
  • 8
  • 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

A Triangulation-Based Approach to Nonrigid Image Registration

Linden, Timothy R. 12 July 2011 (has links)
No description available.
22

Reduced-order, trajectory piecewise-linear models for nonlinear computational fluid dynamics

Gratton, David, Willcox, Karen E. 01 1900 (has links)
A trajectory piecewise-linear (TPWL) approach is developed for a computational fluid dynamics (CFD) model of the two-dimensional Euler equations. The approach uses a weighted combination of linearized models to represent the nonlinear CFD system. The proper orthogonal decomposition (POD) is then used to create a reduced-space basis, onto which the TPWL model is projected. This projection yields an efficient reduced-order model of the nonlinear system, which does not require the evaluation of any full-order system residuals. The method is applied to the case of flow through an actively controlled supersonic diffuser. With an appropriate choice of linearization points and POD basis vectors, the method is found to yield accurate results, including cases with significant shock motion. / Singapore-MIT Alliance (SMA)
23

A Trajectory Piecewise-Linear Approach to Model Order Reduction and Fast Simulation of Nonlinear Circuits and Micromachined Devices

Rewieński, Michał 01 1900 (has links)
In this paper we present an approach to the nonlinear model reduction based on representing the nonlinear system with a piecewise-linear system and then reducing each of the pieces with a Krylov projection. However, rather than approximating the individual components to make a system with exponentially many different linear regions, we instead generate a small set of linearizations about the state trajectory which is the response to a 'training input'. Computational results and performance data are presented for a nonlinear circuit and a micromachined fixed-fixed beam example. These examples demonstrate that the macromodels obtained with the proposed reduction algorithm are significantly more accurate than models obtained with linear or the recently developed quadratic reduction techniques. Finally, it is shown tat the proposed technique is computationally inexpensive, and that the models can be constructed 'on-the-fly', to accelerate simulation of the system response. / Singapore-MIT Alliance (SMA)
24

Algorithms For Piecewise Linear Knapsack Problems With Applications In Electronic Commerce

Kameshwaran, S 08 1900 (has links) (PDF)
No description available.
25

Dynamic Programming Approach to Price American Options

Yeh, Yun-Hsuan 06 July 2012 (has links)
We propose a dynamic programming (DP) approach for pricing American options over a finite time horizon. We model uncertainty in stock price that follows geometric Brownian motion (GBM) and let interest rate and volatility be fixed. A procedure based on dynamic programming combined with piecewise linear interpolation approximation is developed to price the value of options. And we introduce the free boundary problem into our model. Numerical experiments illustrate the relation between value of option and volatility.
26

Groups generated by bounded automata and their schreier graphs

Bondarenko, Ievgen 15 May 2009 (has links)
This dissertation is devoted to groups generated by bounded automata and geometric objects related to these groups (limit spaces, Schreier graphs, etc.). It is shown that groups generated by bounded automata are contracting. We introduce the notion of a post-critical set of a finite automaton and prove that the limit space of a contracting self-similar group generated by a finite automaton is post-critically finite (finitely-ramified) if and only if the automaton is bounded. We show that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA∈KAv, where K is a finite set of nonnegative matrices, with every bounded automaton. We give an effective criterium for the existence of a strictly positive eigenvector of fK. The existence of nonnegative generalized eigenvectors of fK is proved and used to give an algorithmic way for finding the exponents λmax and λmin of the maximal and minimal growth of the components of f(n) K (v). We prove that the growth exponent of diameters of the Schreier graphs is equal to λmax and the orbital contracting coefficient of the group is equal to 1/λmin . We prove that the simple random walks on orbital Schreier graphs are recurrent. A number of examples are presented to illustrate the developed methods with special attention to iterated monodromy groups of quadratic polynomials. We present the first example of a group whose coefficients λmin and λmax have different values.
27

Groups generated by bounded automata and their schreier graphs

Bondarenko, Ievgen 10 October 2008 (has links)
This dissertation is devoted to groups generated by bounded automata and geometric objects related to these groups (limit spaces, Schreier graphs, etc.). It is shown that groups generated by bounded automata are contracting. We introduce the notion of a post-critical set of a finite automaton and prove that the limit space of a contracting self-similar group generated by a finite automaton is post-critically finite (finitely-ramified) if and only if the automaton is bounded. We show that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA[set]KAv, where K is a finite set of nonnegative matrices, with every bounded automaton. We give an effective criterium for the existence of a strictly positive eigenvector of fK. The existence of nonnegative generalized eigenvectors of fK is proved and used to give an algorithmic way for finding the exponents λmax and λmin of the maximal and minimal growth of the components of fK(n)(v). We prove that the growth exponent of diameters of the Schreier graphs is equal to λmax and the orbital contracting coefficient of the group is equal to 1/λmin . We prove that the simple random walks on orbital Schreier graphs are recurrent. A number of examples are presented to illustrate the developed methods with special attention to iterated monodromy groups of quadratic polynomials. We present the first example of a group whose coefficients λmin and λmax have different values.
28

Συνήθεις μη γραμμικότητες : υλοποίηση και εφαρμογές

Γιαννακόπουλος, Κωνσταντίνος 25 May 2015 (has links)
Το θέμα της διπλωματικής μεταπτυχιακής εργασίας είναι οι συνήθεις μη γραμμικότητες και οι εφαρμογές τους. Σχεδιάζονται, εξομοιώνονται και υλοποιούνται στην πράξη απλοί και σύνθετοι μη γραμμικοί αντιστάτες τμηματικής γραμμικότητας (PieceWise-Linear – PWL). Ιδιαίτερη προσοχή δίνεται στην υλοποίηση της διόδου Chua καθώς και στο σχεδιασμό και υλοποίηση του ίδιου του χαοτικού κυκλώματος Chua. Ταυτόχρονα δίνονται συνοπτικά στοιχεία θεωρίας χάους. Επιπλέον, μελετάται και υλοποιείται υπερχαοτικός ταλαντωτής κατάλληλος για συγχρονισμό και εφαρμογή σε ασφαλείς επικοινωνίες. Αυτός ο υπερχαοτικός ταλαντωτής βασίζεται σε έναν LC ταλαντωτή και το γνωστό Deliyannis SAB συζευγμένα μέσω μιας διόδου. Σε όλα τα παραπάνω πρέπει να προστεθεί η συγκέντρωση όλης της σχετικής βιβλιογραφίας. / The subject of this diploma thesis is to study usual nonlinearities and their applications. Simple and composite nonlinear piecewise-linear resistors have been designed, simulated and implemented. A great care is shown towards implementing the Chua’s diode and designing and implementing the chaotic Chua’s circuit itself. At the same time some basics of chaos theory are given. Moreover, a hyperchaotic oscillator is studied which is suitable for synchronization and application in secure communications. This hyperchaotic oscillator is based on a LC oscillator and the well-known Deliyannis SAB coupled by means of a diode. To all above, one should add the very rich bibliography, which has now been accumulated for the benefit of all concerned in the Electronics Laboratory.
29

Robust techniques for regression models with minimal assumptions / M.M. van der Westhuizen

Van der Westhuizen, Magdelena Marianna January 2011 (has links)
Good quality management decisions often rely on the evaluation and interpretation of data. One of the most popular ways to investigate possible relationships in a given data set is to follow a process of fitting models to the data. Regression models are often employed to assist with decision making. In addition to decision making, regression models can also be used for the optimization and prediction of data. The success of a regression model, however, relies heavily on assumptions made by the model builder. In addition, the model may also be influenced by the presence of outliers; a more robust model, which is not as easily affected by outliers, is necessary in making more accurate interpretations about the data. In this research study robust techniques for regression models with minimal assumptions are explored. Mathematical programming techniques such as linear programming, mixed integer linear programming, and piecewise linear regression are used to formulate a nonlinear regression model. Outlier detection and smoothing techniques are included to address the robustness of the model and to improve predictive accuracy. The performance of the model is tested by applying it to a variety of data sets and comparing the results to those of other models. The results of the empirical experiments are also presented in this study. / Thesis (M.Sc. (Computer Science))--North-West University, Potchefstroom Campus, 2011.
30

Robust techniques for regression models with minimal assumptions / M.M. van der Westhuizen

Van der Westhuizen, Magdelena Marianna January 2011 (has links)
Good quality management decisions often rely on the evaluation and interpretation of data. One of the most popular ways to investigate possible relationships in a given data set is to follow a process of fitting models to the data. Regression models are often employed to assist with decision making. In addition to decision making, regression models can also be used for the optimization and prediction of data. The success of a regression model, however, relies heavily on assumptions made by the model builder. In addition, the model may also be influenced by the presence of outliers; a more robust model, which is not as easily affected by outliers, is necessary in making more accurate interpretations about the data. In this research study robust techniques for regression models with minimal assumptions are explored. Mathematical programming techniques such as linear programming, mixed integer linear programming, and piecewise linear regression are used to formulate a nonlinear regression model. Outlier detection and smoothing techniques are included to address the robustness of the model and to improve predictive accuracy. The performance of the model is tested by applying it to a variety of data sets and comparing the results to those of other models. The results of the empirical experiments are also presented in this study. / Thesis (M.Sc. (Computer Science))--North-West University, Potchefstroom Campus, 2011.

Page generated in 0.4062 seconds