• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 20
  • 16
  • 1
  • 1
  • 1
  • Tagged with
  • 43
  • 43
  • 13
  • 13
  • 12
  • 10
  • 6
  • 5
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 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.

Application of geometric programming to PID controller tuning with state constraints

Carver, Leonard James January 1976 (has links)
In the thesis, geometric programming is considered as a numerical optimization technique. The problem of minimizing the integral square error of a system characterized by a second order plant with proportional- integral-derivative (PID) controller is investigated. Constraints are imposed upon the state of the system In order to obtain feasible solutions and conditions that are amenable to the geometric programming technique. The application of geometric programming requires the use of approximation procedures to eliminate untenable conditions in the objective and constraint functions. The techniques utilized render solutions that are easily obtainable, usually amounting to solving a set of linear equations and requiring no differentiation of terms. In addition, there is rapid convergence to an optimum. The accuracy of the results is dependent upon the validity of the approximations. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Optimization of engineering systems using extended geometric programming /

Plecnik, Joseph Matthew January 1974 (has links)
No description available.

Geometric-programming solution of optimal control problems

Djanali, Supeno. January 1978 (has links)
Thesis (M.S.)--Wisconsin. / Includes bibliographical references (leaves 107-121).

Geometric programming and decomposition techniques in optimal control

Djanali, Supeno. January 1984 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 215-244).

Optimal inventory policies for an economic order quantity models under various cost functions

Jung, Hoon, January 2001 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2001. / Typescript. Vita. Includes bibliographical references (leaves 199-201). Also available on the Internet.

Optimal inventory policies for an economic order quantity models under various cost functions /

Jung, Hoon, January 2001 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 2001. / Typescript. Vita. Includes bibliographical references (leaves 199-201). Also available on the Internet.

Optimal hidden Markov models

McKee, Bill Frederick January 1999 (has links)
In contrast with training algorithms such as Baum-Welch, which produce solutions that are a local optimum of the objective function, this thesis describes the attempt to develop a training algorithm which delivers the global optimum Discrete ICdden Markov Model for a given training sequence. A total of four different methods of attack upon the problem are presented. First, after building the necessary analytical tools, the thesis presents a direct, calculus-based assault featuring Matrix Derivatives. Next, the dual analytic approach known as Geometric Programming is examined and then adapted to the task. After that, a hill-climbing formula is developed and applied. These first three methods reveal a number of interesting and useful insights into the problem. However, it is the fourth method which produces an algorithm that is then used for direct comparison vAth the Baum-Welch algorithm: examples of global optima are collected, examined for common features and patterns, and then a rule is induced. The resulting rule is implemented in *C' and tested against a battery of Baum-Welch based programs. In the limited range of tests carried out to date, the models produced by the new algorithm yield optima which have not been surpassed by (and are typically much better than) the Baum-Welch models. However, far more analysis and testing is required and in its current form the algorithm is not fast enough for realistic application.

Design and development of a target-costing model for machining

Kokatnur, Ameet. January 2004 (has links)
Thesis (M.S.)--West Virginia University, 2004. / Title from document title page. Document formatted into pages; contains viii, 138 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 69-72).

The design and control of visual routines for the computation of simple geometric properties and relations

Romanycia, Marc Hector Joseph January 1987 (has links)
The present work is based on the Visual Routine theory of Shimon Ullman. This theory holds that efficient visual perception is managed by first applying spatially parallel methods to an initial input image in order to construct the basic representation-maps of features within the image. Then, this phase is followed by the application of serial methods - visual routines - which are applied to the most salient items in these and other subsequently created maps. Recent work in the visual routine tradition is reviewed, as well as relevant psychological work on preattentive and attentive vision. An analysis is made of the problem of devising a visual routine language for computing geometric properties and relations. The most useful basic representations to compute directly from a world of 2-D geometric shapes are determined. An argument is made for the case that an experimental program is required to establish which basic operations and which methods for controlling them will lead to the efficient computation of geometric properties and relations. A description is given of an implemented computer system which can correctly compute, in images of simple 2-D geometric shapes, the properties vertical, horizontal, closed, and convex, and the relations inside, outside, touching, centred-in, connected, parallel, and being-part-of. The visual routines which compute these, the basic operations out of which the visual routines are composed, and the important logic which controls the goal-directed application of the routines to the image are all described in detail. The entire system is embedded in a Question-and-Answer system which is capable of answering questions of an image, such as "Find all the squares inside triangles" or "Find all the vertical bars outside of closed convex shapes." By asking many such questions about various test images, the effectiveness of the visual routines and their controlling logic is demonstrated. / Science, Faculty of / Computer Science, Department of / Graduate

Geometric programming for engineering design optimization /

Brar, Guri Singh January 1981 (has links)
No description available.

Page generated in 0.163 seconds