171 |
The design and performance of high-level language primitives for distributed programmingLeBlanc, Thomas John. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 112-115).
|
172 |
The design and implementation of a parallel prolog opcode-interpreter on a multiprocessor architecture /Hakansson, Carolyn Ann, January 1987 (has links)
Thesis (M.S.)--Oregon Graduate Center, 1987.
|
173 |
Instrumentation tool for context-aware optimizationBolat, Murat. January 2009 (has links)
Thesis (M.S.)--University of Delaware, 2009. / Principal faculty advisor: Xiaoming Li, Dept. of Electrical & Computer Engineering. Includes bibliographical references.
|
174 |
Obesity, intergenerational programming, and epigenetics: emerging concepts and challengesChen, Michael Yung-Ray 22 January 2016 (has links)
One of the most important medical and public health issues of today is obesity, defined as abnormal and excess fat accumulation. Obesity is linked to many health problems including metabolic syndrome (MS), hypertension, type II diabetes mellitus (T2DM), and cardiovascular disease (CVD). Recently, the incidence of these conditions has surged to epidemic proportions, especially in Western societies. Research has also linked obesity to cancer and osteoarthritis.
Preventing, diagnosing, and treating obesity is challenging. The diagnosis of obesity is often unclear when it is made with generalized criteria such as the Body Mass Index (BMI). Obesity interventions generally include the often difficult lifestyle change to healthy diets and adequate exercise, which depends heavily upon patient compliance and discipline.
Today's society is pushing for the discovery of a shortcut or of a "magic pill" to cure obesity. Consequently, many studies aim to identify therapeutic targets. The majority of current obesity research is focused on discovering and revealing the underlying mechanisms and genetic risk factors. Certain stages of development, such as childhood, are especially susceptible times to be exposed to stressors that lead to obesity.
A developing concept is the intergenerational transmission of risk of obesity through epigenetics. Epigenetics is the study of the heritable changes in gene regulation and expression not caused by mutations or changes in DNA sequence. A person's genes may increase or decrease his or her susceptibility to obesity. In addition to genetic inheritance, parents may pass non-genetic alterations to their children. Changes can be mediated through methylation of deoxyribonucleic acids (DNA) and modifications to histones. These epigenetic changes may alter gene expression patterns and "program" offspring towards developing chronic metabolic disease. Many models have begun to show the effects of environmental perturbations on individuals and on several generations of future descendants.
This review will analyze the current literature on obesity and evaluate this rapidly evolving field. Current obesity preventions and treatments will be surveyed. In addition, the relative impact of different contributors to obesity risk will be examined. The crossover between obesity and epigenetics may provide a deeper understanding of disease risk and developmental origins. Future directions of study will be proposed such as large-scale prospective studies to further characterize intergenerational transmission of risk.
|
175 |
First-order affine scaling continuous method for convex quadratic programmingYue, Hongwei 24 January 2014 (has links)
We develop several continuous method models for convex quadratic programming (CQP) problems with di.erent types of constraints. The essence of the continuous method is to construct one ordinary di.erential equation (ODE) system such that its limiting equilibrium point corresponds to an optimal solution of the underlying optimization problem. All our continuous method models share the main feature of the interior point methods, i.e., starting from any interior point, all the solution trajectories remain in the interior of the feasible regions. First, we present an a.ne scaling continuous method model for nonnegativity constrained CQP. Under the boundedness assumption of the optimal set, a thorough study on the properties of the ordinary di.erential equation is provided, strong convergence of the continuous trajectory of the ODE system is proved. Following the features of this ODE system, a new ODE system for solving box constrained CQP is also presented. Without projection, the whole trajectory will stay inside the box region, and it will converge to an optimal solution. Preliminary simulation results illustrate that our continuous method models are very encouraging in obtaining the optimal solutions of the underlying optimization problems. For CQP in the standard form, the convergence of the iterative .rst-order a.ne scaling algorithm is still open. Under boundedness assumption of the optimal set and nondegeneracy assumption of the constrained region, we discuss the properties of the ODE system induced by the .rst-order a.ne scaling direction. The strong convergence of the continuous trajectory of the ODE system is also proved. Finally, a simple iterative scheme induced from our ODE is presented for finding an optimal solution of nonnegativity constrained CQP. The numerical results illustrate the good performance of our continuous method model with this iterative scheme. Keywords: ODE; Continuous method; Quadratic programming; Interior point method; A.ne scaling.
|
176 |
Introduction to Programming on the Nova ComputerLam, Clement 09 1900 (has links)
One of two project reports: The other part is designated PART B: McMASTER (on-campus) PROJECT. / <p> A guide to programming the Nova computer is presented in this manual. Programming fundamentals, structured programming, testing and debugging and interrupt programming technique are also included. </p> / Thesis / Master of Engineering (MEngr)
|
177 |
Integer programming solutions for a special case of the multiple choice problem of Healy /Yantis, Richard Perry January 1966 (has links)
No description available.
|
178 |
Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design ProblemsWang, Hongjie 12 June 1998 (has links)
The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible region that is restricted by a set of constraints, each of which is defined in terms of nonconvex factorable functions. Such problems find widespread applications in production planning, location and allocation, chemical process design and control, VLSI chip design, and numerous engineering design problems. This thesis offers a first comprehensive methodological development and implementation for determining a global optimal solution to such factorable programming problems. To solve this class of problems, we propose a branch-and-bound approach based on linear programming (LP) relaxations generated through various approximation schemes that utilize, for example, the Mean-Value Theorem and Chebyshev interpolation polynomials, coordinated with a {em Reformulation-Linearization Technique} (RLT). The initial stage of the lower bounding step generates a tight, nonconvex polynomial programming relaxation for the given problem. Subsequently, an LP relaxation is constructed for the resulting polynomial program via a suitable RLT procedure. The underlying motivation for these two steps is to generate a tight outer approximation of the convex envelope of the objective function over the convex hull of the feasible region. The bounding step is thenintegrated into a general branch-and-bound framework. The construction of the bounding polynomials and the node partitioning schemes are specially designed so that the gaps resulting from these two levels of approximations approach zero in the limit, thereby ensuring convergence to a global optimum. Various implementation issues regarding the formulation of such tight bounding problems using both polynomial approximations and RLT constructs are discussed. Different practical strategies and guidelines relating to the design of the algorithm are presented within a general theoretical framework so that users can customize a suitable approach that takes advantage of any inherent special structures that their problems might possess. The algorithm is implemented in C++, an object-oriented programming language. The class modules developed for the software perform various functions that are useful not only for the proposed algorithm, but that can be readily extended and incorporated into other RLT based applications as well. Computational results are reported on a set of fifteen engineering process control and design test problems from various sources in the literature. It is shown that, for all the test problems, a very competitive computational performance is obtained. In most cases, the LP solution obtained for the initial node itself provides a very tight lower bound. Furthermore, for nine of these fifteen problems, the application of a local search heuristic based on initializing the nonlinear programming solver MINOS at the node zero LP solution produced the actual global optimum. Moreover, in finding a global optimum, our algorithm discovered better solutions than the ones previously reported in the literature for two of these test instances. / Master of Science
|
179 |
Algorithmic skeletons : a structured approach to the management of parallel computationCole, Murray Irwin January 1988 (has links)
No description available.
|
180 |
Integer programming approaches for semicontinuous and stochastic optimizationAngulo Olivares, Gustavo, I 22 May 2014 (has links)
This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from complexity and polyhedral theory to analyze these problems and propose improved solution methods. In the first part, we consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are required to take values above a prespecified minimum threshold whenever they are not zero. These problems find applications in management and supply chain models where orders in small quantities are undesirable. We introduce the semi-continuous inflow set with variable upper bounds as a relaxation of general semi-continuous network flow problems. Two particular cases of this set are considered, for which we present complete descriptions of the convex hull in terms of linear inequalities and extended formulations. We also consider a class of semi-continuous transportation problems where inflow systems arise as substructures, for which we investigate complexity questions. Finally, we study the computational efficacy of the developed polyhedral results in solving randomly generated instances of semi-continuous transportation problems. In the second part, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of optimizing a linear function on the subset of vertices of P that are not contained in X. This problem is closely related to finding the k-best basic solutions to a linear problem and finds applications in stochastic integer programming. We observe that the complexity of the problem depends on how P and X are specified. For instance, P can be explicitly given by its linear description, or implicitly by an oracle. Similarly, X can be explicitly given as a list of vectors, or implicitly as a face of P. While removing vertices turns to be hard in general, it is tractable for tractable 0-1 polytopes, and compact extended formulations can be obtained. Some extensions to integral polytopes are also presented. The third part is devoted to the integer L-shaped method for two-stage stochastic integer programs. A widely used model assumes that decisions are made in a two-step fashion, where first-stage decisions are followed by second-stage recourse actions after the uncertain parameters are observed, and we seek to minimize the expected overall cost. In the case of finitely many possible outcomes or scenarios, the integer L-shaped method proposes a decomposition scheme akin to Benders' decomposition for linear problems, but where a series of mixed-integer subproblems have to be solved at each iteration. To improve the performance of the method, we devise a simple modification that alternates between linear and mixed-integer subproblems, yielding significant time savings in instances from the literature. We also present a general framework to generate optimality cuts via a cut-generating problem. Using an extended formulation of the forbidden-vertices problem, we recast our cut-generating problem as a linear problem and embed it within the integer L-shaped method. Our numerical experiments suggest that this approach can prove beneficial when the first-stage set is relatively complicated.
|
Page generated in 0.0281 seconds