Solow, Daniel
2014-01-01
This text covers the basic theory and computation for a first course in linear programming, including substantial material on mathematical proof techniques and sophisticated computation methods. Includes Appendix on using Excel. 1984 edition.
Karloff, Howard
1991-01-01
To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intend...
Linear programming foundations and extensions
Vanderbei, Robert J
2001-01-01
Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail. Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied: -The two-phase simplex method; -The primal-dual simplex method; -The path-following interior-point method; -The homogeneous self-dual methods. In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex m...
Tuey, R. C.
1972-01-01
Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
Linear Projective Program Syntax
Bergstra, J.A.; Bethke, I.
2004-01-01
Based on an extremely simple program notation more advanced program features can be developed in linear projective program syntax such as conditional statements, while loops, recursion, use of an evaluation stack, object classes, method calls etc. Taking care of a cumulative and bottom up
Energy Technology Data Exchange (ETDEWEB)
Zhang Yunong [School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510275 (China)], E-mail: zhynong@mail.sysu.edu.cn; Li Zhan [School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510275 (China)], E-mail: lizhan@mail2.sysu.edu.cn
2009-04-20
In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.
Zhang, Yunong; Li, Zhan
2009-04-01
In this Letter, by following Zhang et al.'s method, a recurrent neural network (termed as Zhang neural network, ZNN) is developed and analyzed for solving online the time-varying convex quadratic-programming problem subject to time-varying linear-equality constraints. Different from conventional gradient-based neural networks (GNN), such a ZNN model makes full use of the time-derivative information of time-varying coefficient. The resultant ZNN model is theoretically proved to have global exponential convergence to the time-varying theoretical optimal solution of the investigated time-varying convex quadratic program. Computer-simulation results further substantiate the effectiveness, efficiency and novelty of such ZNN model and method.
Montiel, Mariana; Bhatti, Uzma
2010-01-01
This article presents an overview of some issues that were confronted when delivering an online second Linear Algebra course (assuming a previous Introductory Linear Algebra course) to graduate students enrolled in a Secondary Mathematics Education program. The focus is on performance in one particular aspect of the course: "change of basis" and…
Klumpp, A. R.; Lawson, C. L.
1988-01-01
Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.
Klumpp, A. R.; Lawson, C. L.
1988-01-01
Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.
Linear Programming and Network Flows
Bazaraa, Mokhtar S; Sherali, Hanif D
2011-01-01
The authoritative guide to modeling and solving complex problems with linear programming-extensively revised, expanded, and updated The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research
Elementary linear programming with applications
Kolman, Bernard
1995-01-01
Linear programming finds the least expensive way to meet given needs with available resources. Its results are used in every area of engineering and commerce: agriculture, oil refining, banking, and air transport. Authors Kolman and Beck present the basic notions of linear programming and illustrate how they are used to solve important common problems. The software on the included disk leads students step-by-step through the calculations. The Second Edition is completely revised and provides additional review material on linear algebra as well as complete coverage of elementary linear program
Linear Programming across the Curriculum
Yoder, S. Elizabeth; Kurz, M. Elizabeth
2015-01-01
Linear programming (LP) is taught in different departments across college campuses with engineering and management curricula. Modeling an LP problem is taught in every linear programming class. As faculty teaching in Engineering and Management departments, the depth to which teachers should expect students to master this particular type of…
LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
Directory of Open Access Journals (Sweden)
Walter Gómez Bofill
2014-12-01
Full Text Available This paper provides a short introduction to optimization problems with semidefinite constraints. Basic duality and optimality conditions are presented. For linear semidefinite programming some advances by dealing with degeneracy and the semidefinite facial reduction are discussed. Two relatively recent areas of application are presented. Finally a short overview of relevant literature on algorithmic approaches for efficiently solving linear and nonlinear semidefinite programming is provided.
On the linear programming bound for linear Lee codes.
Astola, Helena; Tabus, Ioan
2016-01-01
Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.
Index coding via linear programming
Blasiak, Anna; Lubetzky, Eyal
2010-01-01
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. The basic setting of Index Coding encodes the side-information relation, the problem input, as an undirected graph and the fundamental parameter is the broadcast rate $\\beta$, the average communication cost per bit for sufficiently long messages (i.e. the non-linear vector capacity). Recent nontrivial bounds on $\\beta$ were derived from the study of other Index Coding capacities (e.g. the scalar capacity $\\beta_1$) by Bar-Yossef et al (FOCS'06), Lubetzky and Stav (FOCS'07) and Alon et al (FOCS'08). However, these indirect bounds shed little light on the behavior of $\\beta$ and its exact value remained unknown for \\emph{any graph} where Index Coding is nontrivial. Our main contribution is a hierarchy of linear programs whose solutions trap $\\beta$ between them. This enables a direct information-...
Online identification of linear loudspeakers parameters
DEFF Research Database (Denmark)
Pedersen, Bo Rohde; Rubak, Per
2007-01-01
Feed forward nonlinear error correction of loudspeakers can improve sound quality. For creating a realistic feed forward strategy identification of the loudspeaker parameters is needed. The strategy of the compensator is that the nonlinear behaviour of the loudspeakers has relatively small drift...... algorithms. Two different identification techniques (ARMA and FIR) are compared. The stability of the nonlinearities and linear loudspeaker parameters are tested in a measurement series....
Computer Program For Linear Algebra
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
Computer Program For Linear Algebra
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
Investigating Integer Restrictions in Linear Programming
Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.
2015-01-01
Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…
Investigating Integer Restrictions in Linear Programming
Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.
2015-01-01
Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…
Linear programming algorithms and applications
Vajda, S
1981-01-01
This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of manage ment, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in...
Approximation Limits of Linear Programs (Beyond Hierarchies)
Braun, Gábor; Pokutta, Sebastian; Steurer, David
2012-01-01
We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for approximations of semidefinite programs by linear programs. Our main ingredient is a quantitative improvement of Razborov's rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjointness matrix.
Technology for Online Portfolio Assessment Programs
Ferrara, Victoria M.
2010-01-01
Portfolio assessment is a valid and reliable method to assess experiential learning. Developing a fully online portfolio assessment program is neither easy nor inexpensive. The institution seeking to take its portfolio assessment program online must make a commitment to its students by offering the technologies most suited to meet students' needs.…
Linear-programming Decoding of Non-binary Linear Codes
Flanagan, Mark F; Byrne, Eimear; Greferath, Marcus
2007-01-01
We develop a framework for linear-programming (LP) decoding of non-binary linear codes over rings. We prove that the resulting LP decoder has the `maximum likelihood certificate' property, and we show that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. LP decoding performance is illustrated for the (11,6,5) ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the LP decoder performance is comparable to codeword-error-rate-optimum hard-decision based decoding.
LISA: a linear structured system analysis program
Martinez-Martinez, Sinuhé; Mader, Theodor; Boukhobza, Taha; Hamelin, Frédéric
2007-01-01
International audience; In this paper the program LISA is presented. LISA is a flexible and portable program which has been developed to analyse structural properties of large scale linear and bilinear structured systems. More precisely, the program LISA contains programmed algorithms which allow us to apply recent results in the analysis of structured systems to some particular cases.
Solution Methods for Stochastic Dynamic Linear Programs.
1980-12-01
Linear Programming, IIASA , Laxenburg, Austria, June 2-6, 1980. [2] Aghili, P., R.H., Cramer and H.W. Thompson, "On the applicability of two- stage...Laxenburg, Austria, May, 1978. [52] Propoi, A. and V. Krivonozhko, ’The simplex method for dynamic linear programs", RR-78-14, IIASA , Vienna, Austria
Timetabling an Academic Department with Linear Programming.
Bezeau, Lawrence M.
This paper describes an approach to faculty timetabling and course scheduling that uses computerized linear programming. After reviewing the literature on linear programming, the paper discusses the process whereby a timetable was created for a department at the University of New Brunswick. Faculty were surveyed with respect to course offerings…
Zangiabadi, M.; H. R. MALEKI
2007-01-01
In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...
Infrastructure and Administrative Support for Online Programs
Meyer, John D.; Barefield, Amanda C.
2010-01-01
The purpose of this study was to evaluate the availability and effectiveness of administrative support elements for online teaching faculty, and introduce a faculty validated Matrix for use as a guide in development of administrative support for online programs. When administrators make decisions about the infrastructure support needs of a current…
Measuring Student Engagement in an Online Program
Bigatel, Paula; Williams, Vicki
2015-01-01
In an effort to measure the effectiveness of faculty development courses promoting student engagement, the faculty development unit of Penn State's Online Campus conducted a pilot study within a large online Bachelor of Science in Business (BSB) program. In all, 2,296 students were surveyed in the spring and summer semesters of 2014 in order to…
Neighborhood-following algorithms for linear programming
Institute of Scientific and Technical Information of China (English)
无
2004-01-01
［1］Kojima, M., Mizuno, S., Yoshise, A., A polynomial-time algorithm for a class of linear complementarity probems, Mathematical Programming, 1989, 44: 1-26.［2］Megiddo, N., Pathways to the optimal set in linear programming. in Progression Mathematical Programming:Interior Point and Related Methods, New York: Springer-Verlag, 1989, 131-158.［3］Monteiro, R. D. C., Adler, I., Interior path following primal-dual algorithms, Part Ⅰ: linear programming, Mathematical Programming, 1989, 44: 27-41.［4］Monteiro, R. D. C., Adler, I., Interior path following primal-dual algorithms, Part Ⅱ: convex quadratic programming, Mathematical Programming, 1989, 44: 43-46.［5］Wright, S. J., Primal-Dual Interior-Point Methods, Philadephia: SIAM Publications, 1997.［6］Mizuno, S., Todd, M. J., Ye, Y., On adaptive step primal-dual interior-point algorithms for linear programming,Mathematics of Operations Research, 1993, 18:964-981.［7］Gonzaga, C. C., The largest step path following algorithm for monotone linear complementarity problems, Mathematical Programming, 1997, 76: 309-332.［8］Sturm, J. F., Zhang, S., On a wide region of centers primal-dual interior point algorithms for linear programming,Tinbergen Institute Rotterdam, Erasmus University, Rotterdam, The Netherlands, 1995.［9］Hung, P., Ye, Y., An asymptotical O(√nL)-iteration path-following linear programming algorithm that uses wide neighborhoods, SIAM J.Optimization, 1996, 6: 570-586.［10］Ye, Y., Interior Point Algorithms: Theory and Analysis, New York: Wiley-Interscience Publication, 1997.［11］Güler, O., Ye, Y., Convergence behavior of interior-point algorithms. Mathematical Programming, 1993, 60:215-228.［12］Mehrotral, S., On the implementation of a primal-dual interior point mehtod, SIAM J. Optimization, 1992, 2(4):575-601.
Enhancement of Linear Circuit Program
DEFF Research Database (Denmark)
Gaunholt, Hans; Dabu, Mihaela; Beldiman, Octavian
1996-01-01
In this report a preliminary user friendly interface has been added to the LCP2 program making it possible to describe an electronic circuit by actually drawing the circuit on the screen. Component values and other options and parameters can easily be set by the aid of the interface. The interface...
Enhancement of Linear Circuit Program
DEFF Research Database (Denmark)
Gaunholt, Hans; Dabu, Mihaela; Beldiman, Octavian
1996-01-01
In this report a preliminary user friendly interface has been added to the LCP2 program making it possible to describe an electronic circuit by actually drawing the circuit on the screen. Component values and other options and parameters can easily be set by the aid of the interface. The interfac...
Linear Programming建模研讨%Modeling of Linear Programming
Institute of Scientific and Technical Information of China (English)
宋占奎; 於全收; 范光; 燕嬿; 胡杰军
2007-01-01
研究用图解法、simplexmethod和匈牙利法建立Linear Programming的数学模型并求得了最优解.结果表明:对仅有两个变量的Linear Programming,既可通过图解法求得最优解;也可用单纯形表简便地求得最优解;而对任务和人数不等的assignment problem,则用匈牙利法求最优解.
A Direct Heuristic Algorithm for Linear Programming
Indian Academy of Sciences (India)
S K Sen; A Ramful
2000-02-01
An (3) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.
Linear and integer programming made easy
Hu, T C
2016-01-01
Linear and integer programming are fundamental toolkits for data and information science and technology, particularly in the context of today’s megatrends toward statistical optimization, machine learning, and big data analytics. Drawn from over 30 years of classroom teaching and applied research experience, this textbook provides a crisp and practical introduction to the basics of linear and integer programming. The authors’ approach is accessible to students from all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification, and computer vision. Readers will learn to cast hard combinatorial problems as mathematical programming optimizations, understand how to achieve formulations where the objective and constraints are linear, choose appropriate solution methods, and interpret results appropriately. •Provides a concise introduction to linear and integer programming, appropriate for undergraduates, graduates, a short cours...
The Use of Linear Programming for Prediction.
Schnittjer, Carl J.
The purpose of the study was to develop a linear programming model to be used for prediction, test the accuracy of the predictions, and compare the accuracy with that produced by curvilinear multiple regression analysis. (Author)
Sausage Blending Using Multiple Objective Linear Programming
Steuer, Ralph E.
1984-01-01
Single objective cost minimization linear programming models are used as computerized decision-aids in sausage manufacturing (hot dogs, bologna, salami, etc.). However, sausage blending is clearly a problem with multiple conflicting criteria (cost, color, fat, protein, moisture, etc.) Presented in this paper is a vector-maximum/filtering MOLP (multiple objective linear programming) methodology for use as an improved decision-making approach with single formula sausage blending problems.
On-line control models for the Stanford Linear Collider
Energy Technology Data Exchange (ETDEWEB)
Sheppard, J.C.; Helm, R.H.; Lee, M.J.; Woodley, M.D.
1983-03-01
Models for computer control of the SLAC three-kilometer linear accelerator and damping rings have been developed as part of the control system for the Stanford Linear Collider. Some of these models have been tested experimentally and implemented in the control program for routine linac operations. This paper will describe the development and implementation of these models, as well as some of the operational results.
Maximum entropy signal restoration with linear programming
Energy Technology Data Exchange (ETDEWEB)
Mastin, G.A.; Hanson, R.J.
1988-05-01
Dantzig's bounded-variable method is used to express the maximum entropy restoration problem as a linear programming problem. This is done by approximating the nonlinear objective function with piecewise linear segments, then bounding the variables as a function of the number of segments used. The use of a linear programming approach allows equality constraints found in the traditional Lagrange multiplier method to be relaxed. A robust revised simplex algorithm is used to implement the restoration. Experimental results from 128- and 512-point signal restorations are presented.
Managing Large-Scale Online Graduate Programs
Singleton, Jacques; Bowser, Audrey; Hux, Annette; Neal, Gwendolyn
2013-01-01
As with most states, Arkansas is experiencing substantial growth in the delivery of academic programs and courses by distance learning provided by institutions of higher education. At Arkansas State University faculty have adhered to the need of students and developed a completely online certification and master's program in Educational…
Linear programming mathematics, theory and algorithms
1996-01-01
Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.
Linear Programming With Applications to Educational Planning.
Carman, Robert A.
This document discusses the value of linear programing in finding minimum and maximum solutions to problems of resource allocation. Three models using this technique are given for the areas of educational finance, school district personnel compensation, and instructional program evaluation. (RA)
Programming for physicians: A free online course
Kubben, Pieter L.
2016-01-01
This article is an introduction for clinical readers into programming and computational thinking using the programming language Python. Exercises can be done completely online without any need for installation of software. Participants will be taught the fundamentals of programming, which are necessarily independent of the sort of application (stand-alone, web, mobile, engineering, and statistical/machine learning) that is to be developed afterward. PMID:27127694
Programming for physicians: A free online course
Directory of Open Access Journals (Sweden)
Pieter L Kubben
2016-01-01
Full Text Available This article is an introduction for clinical readers into programming and computational thinking using the programming language Python. Exercises can be done completely online without any need for installation of software. Participants will be taught the fundamentals of programming, which are necessarily independent of the sort of application (stand-alone, web, mobile, engineering, and statistical/machine learning that is to be developed afterward.
Programming for physicians: A free online course.
Kubben, Pieter L
2016-01-01
This article is an introduction for clinical readers into programming and computational thinking using the programming language Python. Exercises can be done completely online without any need for installation of software. Participants will be taught the fundamentals of programming, which are necessarily independent of the sort of application (stand-alone, web, mobile, engineering, and statistical/machine learning) that is to be developed afterward.
Fuzzy Multi-objective Linear Programming Approach
Directory of Open Access Journals (Sweden)
Amna Rehmat
2007-07-01
Full Text Available Traveling salesman problem (TSP is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis. The problem has been well studied till now under different headings and has been solved with different approaches including genetic algorithms and linear programming. Conventional linear programming is designed to deal with crisp parameters, but information about real life systems is often available in the form of vague descriptions. Fuzzy methods are designed to handle vague terms, and are most suited to finding optimal solutions to problems with vague parameters. Fuzzy multi-objective linear programming, an amalgamation of fuzzy logic and multi-objective linear programming, deals with flexible aspiration levels or goals and fuzzy constraints with acceptable deviations. In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming. An example of TSP with multiple objectives and vague parameters is discussed.
Fuzzy linear programming for bulb production
Siregar, I.; Suantio, H.; Hanifiah, Y.; Muchtar, M. A.; Nasution, T. H.
2017-01-01
The research was conducted at a bulb company. This company has a high market demand. The increasing of the market demand has caused the company’s production could not fulfill the demand due to production planning is not optimal. Bulb production planning is researched with the aim to enable the company to fulfill the market demand in accordance with the limited resources available. From the data, it is known that the company cannot reach the market demand in the production of the Type A and Type B bulb. In other hands, the Type C bulb is produced exceeds market demand. By using fuzzy linear programming, then obtained the optimal production plans and to reach market demand. Completion of the simple method is done by using software LINGO 13. Application of fuzzy linear programming is being able to increase profits amounted to 7.39% of the ordinary concept of linear programming.
Portfolio optimization using fuzzy linear programming
Pandit, Purnima K.
2013-09-01
Portfolio Optimization (PO) is a problem in Finance, in which investor tries to maximize return and minimize risk by carefully choosing different assets. Expected return and risk are the most important parameters with regard to optimal portfolios. In the simple form PO can be modeled as quadratic programming problem which can be put into equivalent linear form. PO problems with the fuzzy parameters can be solved as multi-objective fuzzy linear programming problem. In this paper we give the solution to such problems with an illustrative example.
Towards automatic synthesis of linear algebra programs
Energy Technology Data Exchange (ETDEWEB)
Boyle, J. M.
1979-01-01
Automating the writing of efficient computer programs from an abstract specification of the computation that they are to perform is discussed. Advantages offered by automatic synthesis of programs include economy, reliability, and improved service. The synthesis of simple linear algebra programs is considered in general and then illustrated for the usual matrix product, a column-oriented matrix product, a rank-one update matrix product, and a program to multiply three matrices. The accumulation of inner products and transformational implementation of program synthesis addressed. The discussion attempts to illustrate both the general strategy of the syntheses and how various tactics can be adapted to make the syntheses proceed deterministically to programs that are optimal with respect to certain criteria. (RWR)
A SCALED CENTRAL PATH FOR LINEAR PROGRAMMING
Institute of Scientific and Technical Information of China (English)
Ya-xiang Yuan
2001-01-01
Interior point methods are very efficient methods for solving large scale linear programming problems. The central path plays a very important role in interior point methods. In this paper we propose a new central path, which scales the variables. Thus it has the advantage of forcing the path to have roughly the same distance from each active constraint boundary near the solution.
Spline smoothing of histograms by linear programming
Bennett, J. O.
1972-01-01
An algorithm for an approximating function to the frequency distribution is obtained from a sample of size n. To obtain the approximating function a histogram is made from the data. Next, Euclidean space approximations to the graph of the histogram using central B-splines as basis elements are obtained by linear programming. The approximating function has area one and is nonnegative.
A HYBRID METHOD FOR LINEAR PROGRAMMING
Institute of Scientific and Technical Information of China (English)
XIU Naihua; WU Fang
1999-01-01
In this paper, a hybrid method for linear programming is established.Its search direction is defined as a combination of two directions insimplex method and affine-scaling interior point method.The method is proven to have some promising convergence properties.The relation among the new method, the simplex method and the affine-scalinginteriorpoint method is discussed.
Generalised Assignment Matrix Methodology in Linear Programming
Jerome, Lawrence
2012-01-01
Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…
Towards minimax policies for online linear optimization with bandit feedback
Bubeck, Sébastien; Kakade, Sham M
2012-01-01
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of order $\\sqrt{d n \\log N}$ for any finite action set with $N$ actions, under the assumption that the instantaneous loss is bounded by 1. This shaves off an extraneous $\\sqrt{d}$ factor compared to previous works, and gives a regret bound of order $d \\sqrt{n \\log n}$ for any compact set of actions. Without further assumptions on the action set, this last bound is minimax optimal up to a logarithmic factor. Interestingly, our result also shows that the minimax regret for bandit linear optimization with expert advice in $d$ dimension is the same as for the basic $d$-armed bandit with expert advice. Our second contribution is to show how to use the Mirror Descent algorithm to obtain computationally efficient strategies with minimax optimal regret bounds in specific examples. More precisely we study two canonical action sets: the hypercub...
Controller design approach based on linear programming.
Tanaka, Ryo; Shibasaki, Hiroki; Ogawa, Hiromitsu; Murakami, Takahiro; Ishida, Yoshihisa
2013-11-01
This study explains and demonstrates the design method for a control system with a load disturbance observer. Observer gains are determined by linear programming (LP) in terms of the Routh-Hurwitz stability criterion and the final-value theorem. In addition, the control model has a feedback structure, and feedback gains are determined to be the linear quadratic regulator. The simulation results confirmed that compared with the conventional method, the output estimated by our proposed method converges to a reference input faster when a load disturbance is added to a control system. In addition, we also confirmed the effectiveness of the proposed method by performing an experiment with a DC motor.
The simplex method of linear programming
Ficken, FA
2015-01-01
This concise but detailed and thorough treatment discusses the rudiments of the well-known simplex method for solving optimization problems in linear programming. Geared toward undergraduate students, the approach offers sufficient material for readers without a strong background in linear algebra. Many different kinds of problems further enrich the presentation. The text begins with examinations of the allocation problem, matrix notation for dual problems, feasibility, and theorems on duality and existence. Subsequent chapters address convex sets and boundedness, the prepared problem and boun
A Distributed System for Learning Programming On-Line
Verdu, Elena; Regueras, Luisa M.; Verdu, Maria J.; Leal, Jose P.; de Castro, Juan P.; Queiros, Ricardo
2012-01-01
Several Web-based on-line judges or on-line programming trainers have been developed in order to allow students to train their programming skills. However, their pedagogical functionalities in the learning of programming have not been clearly defined. EduJudge is a project which aims to integrate the "UVA On-line Judge", an existing…
Joint shape segmentation with linear programming
Huang, Qixing
2011-01-01
We present an approach to segmenting shapes in a heterogenous shape database. Our approach segments the shapes jointly, utilizing features from multiple shapes to improve the segmentation of each. The approach is entirely unsupervised and is based on an integer quadratic programming formulation of the joint segmentation problem. The program optimizes over possible segmentations of individual shapes as well as over possible correspondences between segments from multiple shapes. The integer quadratic program is solved via a linear programming relaxation, using a block coordinate descent procedure that makes the optimization feasible for large databases. We evaluate the presented approach on the Princeton segmentation benchmark and show that joint shape segmentation significantly outperforms single-shape segmentation techniques. © 2011 ACM.
Evolving evolutionary algorithms using linear genetic programming.
Oltean, Mihai
2005-01-01
A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.
Dynamic Pricing Criteria in Linear Programming
1988-07-01
Dantzig, M.A.H. Dempster and M. Kallio, eds.), pp. 631- 662, IIASA , Laxenburg, Austria. [23] Karmarkar, N. (1984). A new polynomial-time algorithm for...simplex method, in Large Scale Linear Programming (G.B. Dantzig, M.A.H. Dempster and M. Kallio, eds.), pp. 55-66, IIASA , Laxenburg, Austria. [39] Perold...M.J. Kallio, eds.), pp. 67-96, IIASA , Laxenburg, Austria. [40] Pyle, L.D. (1987). Generalizations of the simplex algorithm, Department of Compvter
PRIMAL PERTURBATION SIMPLEX ALGORITHMS FOR LINEAR PROGRAMMING
Institute of Scientific and Technical Information of China (English)
Ping-qi Pan
2000-01-01
In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more etficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported.
A LINEAR PROGRAMMING MODEL OF THE GASEOUSDIFFUSION ISOTOPE-SEPARATION PROCESS,
ISOTOPE SEPARATION, LINEAR PROGRAMMING ), (*GASEOUS DIFFUSION SEPARATION, LINEAR PROGRAMMING ), (* LINEAR PROGRAMMING , GASEOUS DIFFUSION SEPARATION), NUCLEAR REACTORS, REACTOR FUELS, URANIUM, PURIFICATION
Regularized multiple criteria linear programs for classification
Institute of Scientific and Technical Information of China (English)
SHI Yong; TIAN YingJie; CHEN XiaoJun; ZHANG Peng
2009-01-01
Although multiple criteria mathematical program (MCMP), as an alternative method of classification, has been used in various real-life data mining problems, its mathematical structure of solvability is still challengeable. This paper proposes a regularized multiple criteria linear program (RMCLP) for two classes of classification problems. It first adds some regularization terms in the objective function of the known multiple criteria linear program (MCLP) model for possible existence of solution. Then the paper describes the mathematical framework of the solvability. Finally, a series of experimental tests are conducted to illustrate the performance of the proposed RMCLP with the existing methods: MCLP, multiple criteria quadratic program (MCQP), and support vector machine (SVM). The results of four publicly available datasets and a real-life credit dataset all show that RMCLP is a competitive method in classification. Furthermore, this paper explores an ordinal RMCLP (ORMCLP) model for ordinal multi-group problems. Comparing ORMCLP with traditional methods such as One-Against-One, One-Against-The rest on large-scale credit card dataset, experimental results show that both ORMCLP and RMCLP perform well.
Watson, John; Gemin, Butch
2009-01-01
Online learning is growing rapidly as states and districts are creating new online schools, and existing programs are adding new courses and students. The growth reflects the spreading understanding that online courses and programs can serve a wide variety of students and needs. These include: (1) Creating opportunities for small and rural school…
Neighborhood-following algorithms for linear programming
Institute of Scientific and Technical Information of China (English)
AI Wenbao
2004-01-01
In this paper, we present neighborhood-following algorithms for linear programming. When the neighborhood is a wide neighborhood, our algorithms are wide neighborhood primal-dual interior point algorithms. If the neighborhood degenerates into the central path, our algorithms also degenerate into path-following algorithms. We prove that our algorithms maintain the O(√nL)-iteration complexity still, while the classical wide neighborhood primal-dual interior point algorithms have only the O(nL)-iteration complexity. We also proved that the algorithms are quadratic convergence if the optimal vertex is nondegenerate. Finally, we show some computational results of our algorithms.
Verifying Time Petri Nets by Linear Programming
Institute of Scientific and Technical Information of China (English)
李宣东
2001-01-01
The paper proposes an approach to solving some verification problems of time Petri nets using linear programming. The approach is based on the observation that for loop-closed time Petri nets, it is only necessary to investigate a finite prefix of an untimed run of the underlying Petri net. Using the technique the paper gives solutions to reachability and bounded delay timing analysis problems. For both problems algorithms are given, that are decision procedures for loop-closed time Petri nets, and semi-decision procedures for general time Petri nets.
Online Financial Education Programs: Theory, Research, and Recommendations
Directory of Open Access Journals (Sweden)
Jinhee Kim
2017-03-01
Full Text Available Technological advances have created unprecedented opportunities for online financial education that can be used to improve financial literacy and money management practices. While online financial education programs have become popular, relevant research and theoretical frameworks have rarely been considered in the development of such programs. This article synthesizes lessons from literature and theories for the development of an effective online financial education program. Drawing from literature on financial literacy education and online education, implications and recommendations for integrating technology into online financial education programs for adults are discussed.
Grammar Based Genetic Programming Using Linear Representations
Institute of Scientific and Technical Information of China (English)
ZHANGHong; LUYinan; WANGFei
2003-01-01
In recent years,there has been a great interest in genetic programming(GP),which is used to solve many applications such as data mining,electronic engineering and pattern recognition etc.. Genetic programming paradigm as a from of adaptive learning is a functional approach to many problems that require a nonfixed representation and GP typically operates on a population of parse which usually represent computer programs whose nodes have single data type.In this paper GP using context-free grammars(CFGs) is described.This technique separates search space from solution space through a genotype to phenotype mapping.The genotypes and phenotypes of the individuals both act on different linear representations.A phenotype is postfix expression,a new method of representing which is described by making use of the definition and related features of a context-free grammar,i.e.a genotype is a variable length,linear valid genome determined by a simplifled derivation tree(SDT) generated from a context-free grammar.A CFG is used to specify how the possible solutions are created according to experiential knowledge and to direct legal crossover(ormutation)operations without any explicit reference to the process of program generation and parsing,and automatically ensuring typing and syntax correctness.Some related definitions involving genetic operators are described.Fitness evaluation is given.This technique is applied to a symbol regression problem-the identification of nonlinear dynamic characteristics of cushioning packaging.Experimental results show this method can flnd good relations between variables and is better than basic GP without a grammar.Future research on it is outlined.
An Online Recovery Plan Program: Can Peer Coaching Increase Participation?
National Research Council Canada - National Science Library
Simon, Gregory E; Ludman, Evette J; Goodale, Lisa C; Dykstra, Donna M; Stone, Elisa; Cutsogeorge, Dona; Operskalski, Belinda; Savarino, James; Pabiniak, Chester
2011-01-01
Objective:A pilot study evaluated whether the addition of online coaching from a peer specialist increased participation in an online program featuring educational and interactive modules to promote self...
On a Natural Dynamics for Linear Programming
Straszak, Damian
2015-01-01
In this paper we study dynamics inspired by Physarum polycephalum (a slime mold) for solving linear programs [NTY00, IJNT11, JZ12]. These dynamics are arrived at by a local and mechanistic interpretation of the inner workings of the slime mold and a global optimization perspective has been lacking even in the simplest of instances. Our first result is an interpretation of the dynamics as an optimization process. We show that Physarum dynamics can be seen as a steepest-descent type algorithm on a certain Riemannian manifold. Moreover, we prove that the trajectories of Physarum are in fact paths of optimizers to a parametrized family of convex programs, in which the objective is a linear cost function regularized by an entropy barrier. Subsequently, we rigorously establish several important properties of solution curves of Physarum. We prove global existence of such solutions and show that they have limits, being optimal solutions of the underlying LP. Finally, we show that the discretization of the Physarum dy...
Consensus contact prediction by linear programming.
Gao, Xin; Bu, Dongbo; Li, Shuai Cheng; Li, Ming; Xu, Jinbo
2007-01-01
Protein inter-residue contacts are of great use for protein structure determination or prediction. Recent CASP events have shown that a few accurately predicted contacts can help improve both computational efficiency and prediction accuracy of the ab inito folding methods. This paper develops an integer linear programming (ILP) method for consensus-based contact prediction. In contrast to the simple "majority voting" method assuming that all the individual servers are equal and independent, our method evaluates their correlations using the maximum likelihood method and constructs some latent independent servers using the principal component analysis technique. Then, we use an integer linear programming model to assign weights to these latent servers in order to maximize the deviation between the correct contacts and incorrect ones; our consensus prediction server is the weighted combination of these latent servers. In addition to the consensus information, our method also uses server-independent correlated mutation (CM) as one of the prediction features. Experimental results demonstrate that our contact prediction server performs better than the "majority voting" method. The accuracy of our method for the top L/5 contacts on CASP7 targets is 73.41%, which is much higher than previously reported studies. On the 16 free modeling (FM) targets, our method achieves an accuracy of 37.21%.
An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.
1980-01-01
ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a
OJPOT: online judge & practice oriented teaching idea in programming courses
Wang, Gui Ping; Chen, Shu Yu; Yang, Xin; Feng, Rui
2016-05-01
Practical abilities are important for students from majors including Computer Science and Engineering, and Electrical Engineering. Along with the popularity of ACM International Collegiate Programming Contest (ACM/ICPC) and other programming contests, online judge (OJ) websites achieve rapid development, thus providing a new kind of programming practice, i.e. online practice. Due to fair and timely feedback results from OJ websites, online practice outperforms traditional programming practice. In order to promote students' practical abilities in programming and algorithm designing, this article presents a novel teaching idea, online judge & practice oriented teaching (OJPOT). OJPOT is applied to Programming Foundation course. OJPOT cultivates students' practical abilities through various kinds of programming practice, such as programming contests, online practice and course project. To verify the effectiveness of this novel teaching idea, this study conducts empirical research. The experimental results show that OJPOT works effectively in enhancing students' practical abilities compared with the traditional teaching idea.
Ensemble segmentation using efficient integer linear programming.
Alush, Amir; Goldberger, Jacob
2012-10-01
We present a method for combining several segmentations of an image into a single one that in some sense is the average segmentation in order to achieve a more reliable and accurate segmentation result. The goal is to find a point in the "space of segmentations" which is close to all the individual segmentations. We present an algorithm for segmentation averaging. The image is first oversegmented into superpixels. Next, each segmentation is projected onto the superpixel map. An instance of the EM algorithm combined with integer linear programming is applied on the set of binary merging decisions of neighboring superpixels to obtain the average segmentation. Apart from segmentation averaging, the algorithm also reports the reliability of each segmentation. The performance of the proposed algorithm is demonstrated on manually annotated images from the Berkeley segmentation data set and on the results of automatic segmentation algorithms.
Robust Control Design via Linear Programming
Keel, L. H.; Bhattacharyya, S. P.
1998-01-01
This paper deals with the problem of synthesizing or designing a feedback controller of fixed dynamic order. The closed loop specifications considered here are given in terms of a target performance vector representing a desired set of closed loop transfer functions connecting various signals. In general these point targets are unattainable with a fixed order controller. By enlarging the target from a fixed point set to an interval set the solvability conditions with a fixed order controller are relaxed and a solution is more easily enabled. Results from the parametric robust control literature can be used to design the interval target family so that the performance deterioration is acceptable, even when plant uncertainty is present. It is shown that it is possible to devise a computationally simple linear programming approach that attempts to meet the desired closed loop specifications.
Developing Online Family Life Prevention and Education Programs
Hughes, Robert, Jr.; Bowers, Jill R.; Mitchell, Elissa Thomann; Curtiss, Sarah; Ebata, Aaron T.
2012-01-01
Although numerous online family life education programs have been developed over the past few years, there has been little discussion about best practices in the development of these programs. This article presents a framework to assist family life educators in the development and improvement of online programs from the initial problem analysis…
Developing an Online Certification Program for Nutrition Education Assistants
Christofferson, Debra; Christensen, Nedra; LeBlanc, Heidi; Bunch, Megan
2012-01-01
Objective: To develop an online certification program for nutrition education paraprofessionals to increase knowledge and confidence and to overcome training barriers of programming time and travel expenses. Design: An online interactive certification course based on Supplemental Nutrition Assistance Program-Education and Expanded Food and…
Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming
Haifang Cheng; Weilai Huang; Jianhu Cai
2013-01-01
In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as t...
Linear Index Coding via Semidefinite Programming
Chlamtac, Eden
2011-01-01
In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006). We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G of length $\\widetilde{O}(n^{f(k)})$, where f(k) depends only on k. For example, for k=3 we obtain f(3) ~ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan (J. ACM, 1998) for graph coloring and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our ana...
LPNORM: A linear programming normative analysis code
de Caritat, Patrice; Bloch, John; Hutcheon, Ian
1994-04-01
The computer code LPNORM implements the mathematical method of linear programming to calculate the mineralogical makeup of mineral mixtures, such as rock, sediment, or soil samples, from their bulk geochemical composition and from the mineralogical (or geochemical) composition of the contained minerals. This method simultaneously solves the set of linear equations governing the distribution of oxides into these minerals, subject to an objective function and a set of basic constraints. LPNORM allows the user to specify what minerals will be considered for normative analysis, what their composition is (in terms of mineral formula or geochemical composition), and whether to maximize mineral abundances, minimize slack variables (oxides that can not be accounted for), or do both at once in the objective function. Independent knowledge about the abundance of one or several of the minerals in the sample can be entered as additional equality or inequality constraints. Trial-and-error approach enables the user to "optimize" the composition of one or a few of the contained minerals. Results of comparative tests, highlighting the efficiency, as well as the shortcomings, of LPNORM are presented.
Linear programming for learning in neural networks
Raghavan, Raghu
1991-08-01
The authors have previously proposed a network of probabilistic cellular automata (PCAs) as part of an image recognition system designed to integrate model-based and data-driven approaches in a connectionist framework. The PCA arises from some natural requirements on the system which include incorporation of prior knowledge such as in inference rules, locality of inferences, and full parallelism. This network has been applied to recognize objects in both synthetic and in real data. This approach achieves recognition through the short-, rather than the long-time behavior of the dynamics of the PCA. In this paper, some methods are developed for learning the connection strengths by solving linear inequalities: the figures of merit are tendencies or directions of movement of the dynamical system. These 'dynamical' figures of merit result in inequality constraints on the connection strengths which are solved by linear (LP) or quadratic programs (QP). An algorithm is described for processing a large number of samples to determine weights for the PCA. The work may be regarded as either pointing out another application for constrained optimization, or as pointing out the need to extend the perceptron and similar methods for learning. The extension is needed because the neural network operates on a different principle from that for which the perceptron method was devised.
Polynomial Linear Programming with Gaussian Belief Propagation
Bickson, Danny; Shental, Ori; Dolev, Danny
2008-01-01
Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typically solves LP problems in time O(n^{3.5}), where $n$ is the number of unknown variables. Karmarkar's celebrated algorithm is known to be an instance of the log-barrier method using the Newton iteration. The main computational overhead of this method is in inverting the Hessian matrix of the Newton iteration. In this contribution, we propose the application of the Gaussian belief propagation (GaBP) algorithm as part of an efficient and distributed LP solver that exploits the sparse and symmetric structure of the Hessian matrix and avoids the need for direct matrix inversion. This approach shifts the computation from realm of linear algebra to that of probabilistic inference on graphical models, thus applying GaBP as an efficient inference engine. Our construction is general and can be used for any interior-point algorithm which uses the Newt...
Genetic Programming Transforms in Linear Regression Situations
Castillo, Flor; Kordon, Arthur; Villa, Carlos
The chapter summarizes the use of Genetic Programming (GP) inMultiple Linear Regression (MLR) to address multicollinearity and Lack of Fit (LOF). The basis of the proposed method is applying appropriate input transforms (model respecification) that deal with these issues while preserving the information content of the original variables. The transforms are selected from symbolic regression models with optimal trade-off between accuracy of prediction and expressional complexity, generated by multiobjective Pareto-front GP. The chapter includes a comparative study of the GP-generated transforms with Ridge Regression, a variant of ordinary Multiple Linear Regression, which has been a useful and commonly employed approach for reducing multicollinearity. The advantages of GP-generated model respecification are clearly defined and demonstrated. Some recommendations for transforms selection are given as well. The application benefits of the proposed approach are illustrated with a real industrial application in one of the broadest empirical modeling areas in manufacturing - robust inferential sensors. The chapter contributes to increasing the awareness of the potential of GP in statistical model building by MLR.
Stochastic linear programming models, theory, and computation
Kall, Peter
2011-01-01
This new edition of Stochastic Linear Programming: Models, Theory and Computation has been brought completely up to date, either dealing with or at least referring to new material on models and methods, including DEA with stochastic outputs modeled via constraints on special risk functions (generalizing chance constraints, ICC’s and CVaR constraints), material on Sharpe-ratio, and Asset Liability Management models involving CVaR in a multi-stage setup. To facilitate use as a text, exercises are included throughout the book, and web access is provided to a student version of the authors’ SLP-IOR software. Additionally, the authors have updated the Guide to Available Software, and they have included newer algorithms and modeling systems for SLP. The book is thus suitable as a text for advanced courses in stochastic optimization, and as a reference to the field. From Reviews of the First Edition: "The book presents a comprehensive study of stochastic linear optimization problems and their applications. … T...
Linear and integer programming theory and practice
Sierksma, Gerard
2001-01-01
Linear optimisation; basic concepts; Dantzig's simplex method; duality and optimality; sensitivity analysis; karmarkar's interior path method; integer linear optimisation; linear network models; computational complexity issues; model building, case studies, and advanced techniques; solutions to selected exercises. Appendices: linear algebra; convexity; graph theory; optimisation theory; computer package INTPM.
Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes
Skachek, Vitaly; Byrne, Eimear; Greferath, Marcus
2007-01-01
In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many classes of codes these polytopes yield a complexity advantage for decoding. These representations lead to polynomial-time decoders for a wide variety of classical non-binary linear codes.
E-Basics: Online Basic Training in Program Evaluation
Silliman, Ben
2016-01-01
E-Basics is an online training in program evaluation concepts and skills designed for youth development professionals, especially those working in nonformal science education. Ten hours of online training in seven modules is designed to prepare participants for mentoring and applied practice, mastery, and/or team leadership in program evaluation.…
National Standards for Quality Online Programs
Pape, Liz; Wicks, Matthew
2009-01-01
The mission of the International Association for K-12 Online Learning, iNACOL, is to ensure all students have access to a world-class education and quality online learning opportunities that prepare them for a lifetime of success. This document, the International Association for K-12 Online Learning's (iNACOL) "National Standards for Quality…
A semidefinite programming approach for solving Multiobjective Linear Programming
Blanco, Víctor; Ben-Ali, Safae El-Haj
2011-01-01
Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial interior point methodology to find the set of Pareto-optimal solutions of MOLP.
A Fuzzy Linear Programming Approach for Aggregate Production Planning
DEFF Research Database (Denmark)
Iris, Cagatay; Cevikcan, Emre
2014-01-01
a mathematical programming framework for aggregate production planning problem under imprecise data environment. After providing background information about APP problem, together with fuzzy linear programming, the fuzzy linear programming model of APP is solved on an illustrative example for different a...
Tang, Wendy; Westgate, Charles; Liu, Pao-Lo; Gouzman, Michael
2014-01-01
The Online Bachelor of Science in Electrical Engineering is a collaborative effort among three University Centers at SUNY (State University of New York), namely Stony Brook, Binghamton, and Buffalo. The program delivers the complete electrical engineering curriculum at the bachelor level to students online and asynchronously. Students, however,…
[Online gaming. Potential risk and prevention programs].
Malischnig, Doris
2014-12-01
Online gaming is more and more common and increasingly accessible. Due to a lack of social control the participation could be a potential risk for certain customers. The given article focuses on prevention measures that are provided by the Austrian online gaming operator, the Austrian Lotteries, provider of the online gaming platform win2day, in the light of the specifics of Internet gaming in order to avoid problems with gaming.
Optimal impulse control problems and linear programming.
Bauso, D.
2009-01-01
Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, ...
Online Learning Programs: Evaluation's Challenging Future
Nord, Derek
2011-01-01
With the vast array of contextual factors, pedagogical approaches, models of implementation, and purposes of education and training related to online learning, educators, learners, and the general public alike are seeking answers regarding utility and effectiveness of online learning. This article identifies and responds to many of the challenges…
Program Online Learning Sebagai Faktor Penunjang Keunggulan Kompetitif Binus University
Directory of Open Access Journals (Sweden)
Johan Muliadi Kerta
2011-06-01
Full Text Available Online learning has become a way to improve efficiency in the learning process without reducing the quality of learning itself. Colleges that run it hope that the program becomes an attraction for prospective students, especially those with limitation to follow the regular program. The goal of this research was to find out whether Binus Online Learning Program has any influence to the competitive advantage of Binus University. Data were compiled by distributing questionnaires to 100 respondents consist of the students and lecturers on Binus Online Learning Program. This thesis is based on a quantitative methodology to gather and analyze the data to find out if they were any correlation between Online Learning Program and the competitive advantage of Binus University. It can be concluded that there are some positive and significant influences of Online Learning Program to the competitive advantage of Binus University. Therefore, promoting and developing Online Learning Program will increase the competitive advantage of Binus University, and cover the target market which regular programs do not.
Interaction Patterns in Synchronous Online Calculus and Linear Algebra Recitations
Mayer, Greg; Hendricks, Cher
2014-01-01
This study describes interaction patterns observed during a pilot project that explored the use of web-conferencing (WC) software in two undergraduate distance education courses offered to advanced high-school students. The pilot program replaced video-conferencing technology with WC software during recitations, so as to increase participation in…
Analytic central path, sensitivity analysis and parametric linear programming
A.G. Holder; J.F. Sturm; S. Zhang (Shuzhong)
1998-01-01
textabstractIn this paper we consider properties of the central path and the analytic center of the optimal face in the context of parametric linear programming. We first show that if the right-hand side vector of a standard linear program is perturbed, then the analytic center of the optimal face
Comparison of open-source linear programming solvers.
Energy Technology Data Exchange (ETDEWEB)
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
The Uniqueness of Optimal Solution for Linear Programming Problem
Institute of Scientific and Technical Information of China (English)
QuanlingWei; HongYan; JunWang
2004-01-01
This paper investigates an old problem in operations research, the uniqueness of the optimal solution to a linear programming problem. We discuss the problem on a general polyhedron, give some equivalent conditions for uniqueness testing. In addition, we discuss the implementation issues for linear programming based decision making procedures,which motivated this research.
Program-Integrated Information Literacy Instruction for Online Graduate Students
Kumar, Swapna; Ochoa, Marilyn
2012-01-01
Academic librarians often provide information literacy support for specific courses or topics in the form of research guides, one-shot training sessions, library orientations, or by embedding library content into online courses. Less frequently, they provide continuous program-level support on-campus or online. This paper highlights the value of…
Fuzzy variable linear programming with fuzzy technical coefficients
Directory of Open Access Journals (Sweden)
Sanwar Uddin Ahmad
2012-11-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE Fuzzy linear programming is an application of fuzzy set theory in linear decision making problems and most of these problems are related to linear programming with fuzzy variables. In this paper an approximate but convenient method for solving these problems with fuzzy non-negative technical coefficient and without using the ranking functions, is proposed. With the help of numerical examples, the method is illustrated.
The impact of an online disease management program on medical costs among health plan members.
Schwartz, Steven M; Day, Brian; Wildenhaus, Kevin; Silberman, Anna; Wang, Chun; Silberman, Jordan
2010-01-01
This study evaluated the economic impact of an online disease management program within a broader population health management strategy. A retrospective, quasi-experimental, cohort design evaluated program participants and a matched cohort of nonparticipants on 2003-2007 claims data in a mixed model. The study was conducted through Highmark Inc, Blue Cross Blue Shield, covering 4.8 million members in five regions of Pennsylvania. Overall, 413 online self-management program participants were compared with a matched cohort of 360 nonparticipants. The costs and claims data were measured per person per calendar year. Total payments were aggregated from inpatient, outpatient, professional services, and pharmacy payments. The costs of the online program were estimated on a per-participant basis. All dollars were adjusted to 2008 values. The online intervention, implemented in 2006, was a commercially available, tailored program for chronic condition self management, nested within the Blues on Call(SM) condition management strategy. General linear modeling (with covariate adjustment) was used. Data trends were also explored using second-order polynomial regressions. Health care costs per person per year were $757 less than predicted for participants relative to matched nonparticipants, yielding a return on investment of $9.89 for every dollar spent on the program. This online intervention showed a favorable and cost-effective impact on health care cost.
The Impact of an Online Tutoring Program on Mathematics Achievement
Clark, Amy K.; Whetstone, Patti
2014-01-01
The authors explored the impact of an online tutoring program, Math Whizz (Whizz Education, 2014), on student mathematics achievement at 15 elementary schools. Students participated in the use of the Math Whizz program for the duration of the school year as a supplement to mathematics instruction. The Math Whizz program recorded such information…
A Generalised Concept of Dominance in Linear Programming Models
Drynan, Ross G.
1987-01-01
The notion of dominance most familiar to agricultural economists is perhaps the decision theoretic concept entailed in comparing one risky prospect to others. But dominance concepts are also relevant in the linear programming context, for example in identifying redundant constraints. In this note, the standard concept of dominance in linear programming is generalized by defining dominance with respect to differing levels of information about the programming problem.
DEFF Research Database (Denmark)
Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian
2014-01-01
differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...... of selected units by 23%, while for a non-linear approach the increase can be higher than 39%. The results indicate a higher coherence between the two latter approaches, and that the MLP (mixed integer programming) optimisation is most appropriate from a viewpoint of accuracy and runtime. © 2014 Elsevier Ltd...
Donkers, M C F; Heemels, W P M H
2011-01-01
In this paper, we present two control laws that are tailored for control applications in which computational and/or communication resources are scarce. Namely, we consider minimum attention control, where the `attention' that a control task requires is minimised given certain performance requirements, and anytime attention control, where the performance under the `attention' given by a scheduler is maximised. Here, we interpret `attention' as the inverse of the time elapsed between two consecutive executions of a control task. By focussing on linear plants, by allowing for only a finite number of possible intervals between two subsequent executions of the control task, by making a novel extension to the notion of control Lyapunov functions and taking these novel extended control Lyapunov function to be infinity-norm-based, we can formulate the aforementioned control problems as online linear programs, which can be solved efficiently. Furthermore, we provide techniques to construct suitable infinity-norm-based...
Using linear programming to analyze and optimize stochastic flow lines
DEFF Research Database (Denmark)
Helber, Stefan; Schimmelpfeng, Katja; Stolletz, Raik
2011-01-01
This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete tim...... programming and hence allows us to solve buffer allocation problems. We show under which conditions our method works well by comparing its results to exact values for two-machine models and approximate simulation results for longer lines.......This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete time...
Fast online Monte Carlo-based IMRT planning for the MRI linear accelerator
Bol, G.H.; Hissoiny, S.; Lagendijk, J. J. W.; Raaymakers, B. W.
2012-01-01
The MRI accelerator, a combination of a 6 MV linear accelerator with a 1.5 T MRI, facilitates continuous patient anatomy updates regarding translations, rotations and deformations of targets and organs at risk. Accounting for these demands high speed, online intensity-modulated radiotherapy (IMRT) r
The Fast Linear Accelerator Modeling Engine for FRIB Online Model Service
He, Z; Davidsaver, M; Fukushima, K; Shen, G; Ikegami, M
2016-01-01
Commissioning of a large accelerator facility like FRIB needs support from an online beam dynamics model. Considering the new physics challenges of FRIB such as modeling of non-axisymmetric superconducting RF cavities and multi-charge state acceleration, there is no readily available online beam tuning code. The design code of FRIB super-conducting linac, IMPACT-Z, is not suitable for online tuning because of its code design and running speed. Therefore, the Fast Linear Accelerator Modeling Engine (FLAME), specifically designed to fulfill FRIB's online modeling challenges, is proposed. The physics model of FLAME, especially its novel way of modeling non-axisymmetric superconducting RF cavities using a multipole expansion based thin-lens kick model, is discussed in detail, and the benchmark results against FRIB design code is presented, after which the software design strategy of FLAME and its execution speed is presented.
Pop, P.C.; Still, Georg J.
1999-01-01
In linear programming it is known that an appropriate non-homogeneous Farkas Lemma leads to a short proof of the strong duality results for a pair of primal and dual programs. By using a corresponding generalized Farkas lemma we give a similar proof of the strong duality results for semidefinite
Linear System of Equations, Matrix Inversion, and Linear Programming Using MS Excel
El-Gebeily, M.; Yushau, B.
2008-01-01
In this note, we demonstrate with illustrations two different ways that MS Excel can be used to solve Linear Systems of Equation, Linear Programming Problems, and Matrix Inversion Problems. The advantage of using MS Excel is its availability and transparency (the user is responsible for most of the details of how a problem is solved). Further, we…
Directory of Open Access Journals (Sweden)
Yi-hua Zhong
2013-01-01
Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.
A New Finite Continuation Algorithm for Linear Programming
DEFF Research Database (Denmark)
Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa
1996-01-01
We describe a new finite continuation algorithm for linear programming. The dual of the linear programming problem with unit lower and upper bounds is formulated as an $\\ell_1$ minimization problem augmented with the addition of a linear term. This nondifferentiable problem is approximated...... by a smooth problem. It is shown that the minimizers of the smooth problem define a family of piecewise-linear paths as a function of a smoothing parameter. Based on this property, a finite algorithm that traces these paths to arrive at an optimal solution of the linear program is developed. The smooth...... problems are solved by a Newton-type algorithm. Preliminary numerical results indicate that the new algorithm is promising....
An approach for solving linear fractional programming problems ...
African Journals Online (AJOL)
An approach for solving linear fractional programming problems. ... Journal of the Nigerian Association of Mathematical Physics. Journal Home · ABOUT · Advanced Search ... Open Access DOWNLOAD FULL TEXT Subscription or Fee Access ...
Directory of Open Access Journals (Sweden)
Kesavan.E
2013-04-01
Full Text Available This paper suggests an idea to design an adaptive PID controller for Non-linear liquid tank System and is implemented in PLC. Online estimation of linear parameters (Time constant and Gain brings an exact model of the process to take perfect control action. Based on these estimated values, the controller parameters will be well tuned by internal model control. Internal model control is an unremarkably used technique and provides well tuned controller in order to have a good controlling process. PLC with its ability to have both continues control for PID Control and digital control for fault diagnosis which ascertains faults in the system and provides alerts about the status of the entire process.
Evolutionary Programming for IP/MIP Problems with Linear Constraints
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed and accuracy in IP/MIP problems.
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
Institute of Scientific and Technical Information of China (English)
LiliHan; RongshengLi
2004-01-01
This paper proposes a sufficient condition, if the properties of the bilevel programming satisfied the condition, we can solve the bilevel programming by solving single level programming. It becomes easy and simple to solve the bilevel programming.
Linear programming with positive semi-definite matrices
Directory of Open Access Journals (Sweden)
Lasserre J. B.
1996-01-01
Full Text Available We consider the general linear programming problem over the cone of positive semi-definite matrices. We first provide a simple sufficient condition for existence of optimal solutions and absence of a duality gap without requiring existence of a strictly feasible solution. We then simply characterize the analogues of the standard concepts of linear programming, i.e., extreme points, basis, reduced cost, degeneracy, pivoting step as well as a Simplex-like algorithm.
Composition of portfolio by multiple criteria linear programming
2012-01-01
This work is dealing with portfolio optimization of corporate bonds available on Stuttgart stock exchange by methods of linear programming. Firstly there is a theoretical description of financial market, bonds and stock exchange. In next part there is a description of basics of linear programming and some details of multiple criteria decision. Big part of work is devote of practical problem of optimization of bond portfolio by methods which are described in theoretical part. Data of practical...
Linear Programming and Its Application to Pattern Recognition Problems
Omalley, M. J.
1973-01-01
Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.
Expectations of Adult Graduate Students in an Online Degree Program
Deggs, David; Grover, Kenda; Kacirek, Kit
2010-01-01
This study was conducted to examine the expectations of adult graduate students enrolled in an online degree program at a research university in the mid-South United States. Students who were pursuing their master of education degree were invited to participate in an e-Focus group regarding their expectations of the degree program. Focus groups…
The Evolution of an Online Substance Abuse Counseling Certificate Program
Crozier, Mary K.
2012-01-01
In the field of rehabilitation services, substance abuse counseling requires unique skills. Post-baccalaureate academic certificate programs offer professionals an opportunity to retool or expand their skills and meet licensure needs in this evolving field. East Carolina University's online Substance Abuse Counseling Certificate Program was…
OJPOT: Online Judge & Practice Oriented Teaching Idea in Programming Courses
Wang, Gui Ping; Chen, Shu Yu; Yang, Xin; Feng, Rui
2016-01-01
Practical abilities are important for students from majors including Computer Science and Engineering, and Electrical Engineering. Along with the popularity of ACM International Collegiate Programming Contest (ACM/ICPC) and other programming contests, online judge (OJ) websites achieve rapid development, thus providing a new kind of programming…
Linear Programming for Vocational Education Planning. Interim Report.
Young, Robert C.; And Others
The purpose of the paper is to define for potential users of vocational education management information systems a quantitative analysis technique and its utilization to facilitate more effective planning of vocational education programs. Defining linear programming (LP) as a management technique used to solve complex resource allocation problems…
Planning Student Flow with Linear Programming: A Tunisian Case Study.
Bezeau, Lawrence
A student flow model in linear programming format, designed to plan the movement of students into secondary and university programs in Tunisia, is described. The purpose of the plan is to determine a sufficient number of graduating students that would flow back into the system as teachers or move into the labor market to meet fixed manpower…
Staking Terraces Online: A Terrace Layout Program
Terrace construction in Missouri exceeded 3 million feet at a cost of over $8 million in 2008. Up to 50 % of the total construction and design time is spent on the terrace layout itself. A web-based computer program, MOTERR, has been developed to design terrace layouts. The program utilizes digital ...
Online learning of single- and multivalued functions with an infinite mixture of linear experts.
Damas, Bruno; Santos-Victor, José
2013-11-01
We present a supervised learning algorithm for estimation of generic input-output relations in a real-time, online fashion. The proposed method is based on a generalized expectation-maximization approach to fit an infinite mixture of linear experts (IMLE) to an online stream of data samples. This probabilistic model, while not fully Bayesian, can efficiently choose the number of experts that are allocated to the mixture, this way effectively controlling the complexity of the resulting model. The result is an incremental, online, and localized learning algorithm that performs nonlinear, multivariate regression on multivariate outputs by approximating the target function by a linear relation within each expert input domain and that can allocate new experts as needed. A distinctive feature of the proposed method is the ability to learn multivalued functions: one-to-many mappings that naturally arise in some robotic and computer vision learning domains, using an approach based on a Bayesian generative model for the predictions provided by each of the mixture experts. As a consequence, it is able to directly provide forward and inverse relations from the same learned mixture model. We conduct an extensive set of experiments to evaluate the proposed algorithm performance, and the results show that it can outperform state-of-the-art online function approximation algorithms in single-valued regression, while demonstrating good estimation capabilities in a multivalued function approximation context.
Linear combination of forecasts with numerical adjustment via MINIMAX non-linear programming
Directory of Open Access Journals (Sweden)
Jairo Marlon Corrêa
2016-03-01
Full Text Available This paper proposes a linear combination of forecasts obtained from three forecasting methods (namely, ARIMA, Exponential Smoothing and Artificial Neural Networks whose adaptive weights are determined via a multi-objective non-linear programming problem, which seeks to minimize, simultaneously, the statistics: MAE, MAPE and MSE. The results achieved by the proposed combination are compared with the traditional approach of linear combinations of forecasts, where the optimum adaptive weights are determined only by minimizing the MSE; with the combination method by arithmetic mean; and with individual methods
Nan, Wang; Qingfeng, Meng; Bin, Zheng; Tong, Li; Qinghai, Ma
2011-07-01
This paper presents a Wireless Sensor Networks (WSNs) technique for the purpose of on-line monitoring of rolling bearing in freight train. A new technical scheme including the arrangements of sensors, the design of sensor nodes and base station, routing protocols, signal acquirement, processing and transmission is described, and an on-line monitoring system is established. Considering the approximately linear arrangements of cars and the running state of freight train, a linear topology structure of WSNs is adopted and five linear routing protocols are discussed in detail as to obtain the desired minimum energy consumption of WSNs. By analysing the simulation results, an optimal multi-hop routing protocol named sub-section routing protocol according to equal distance is adopted, in which all sensor nodes are divided into different groups according to the equal transmission distance, the optimal transmission distance and number of hops of routing protocol are also studied. We know that the communication consumes significant power in WSNs, so, in order to save the limit power supply of WSNs, the data compression and coding scheme based on lifting integer wavelet and embedded zerotree wavelet (EZW) algorithms is studied to reduce the amounts of data transmitted. The experimental results of rolling bearing have been given at last to verify the effectiveness of data compression algorithm. The on-line monitoring system of rolling bearing in freight train will be applied to actual application in the near future.
Energy Technology Data Exchange (ETDEWEB)
Wang Nan; Meng Qingfeng; Zheng Bin [Theory of Lubrication and Bearing Institute, Xi' an Jiaotong University Xi' an, 710049 (China); Li Tong; Ma Qinghai, E-mail: heroyoyu.2009@stu.xjtu.edu.cn [Xi' an Rail Bureau, Xi' an, 710054 (China)
2011-07-19
This paper presents a Wireless Sensor Networks (WSNs) technique for the purpose of on-line monitoring of rolling bearing in freight train. A new technical scheme including the arrangements of sensors, the design of sensor nodes and base station, routing protocols, signal acquirement, processing and transmission is described, and an on-line monitoring system is established. Considering the approximately linear arrangements of cars and the running state of freight train, a linear topology structure of WSNs is adopted and five linear routing protocols are discussed in detail as to obtain the desired minimum energy consumption of WSNs. By analysing the simulation results, an optimal multi-hop routing protocol named sub-section routing protocol according to equal distance is adopted, in which all sensor nodes are divided into different groups according to the equal transmission distance, the optimal transmission distance and number of hops of routing protocol are also studied. We know that the communication consumes significant power in WSNs, so, in order to save the limit power supply of WSNs, the data compression and coding scheme based on lifting integer wavelet and embedded zerotree wavelet (EZW) algorithms is studied to reduce the amounts of data transmitted. The experimental results of rolling bearing have been given at last to verify the effectiveness of data compression algorithm. The on-line monitoring system of rolling bearing in freight train will be applied to actual application in the near future.
Resource-oriented Programming Based on Linear Logic
Directory of Open Access Journals (Sweden)
Valerie Novitzká
2007-08-01
Full Text Available In our research we consider programming as logical reasoning over types.Linear logic with its resource-oriented features yields a proper means for our approachbecause it enables to consider about resources as in real life: after their use they areexhausted. Computation then can be regarded as proof search. In our paper we presenthow space and time can be introduced into this logic and we discuss several programminglanguages based on linear logic.
An adaptive genetic algorithm for solving bilevel linear programming problem
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems.Various methods are proposed for solving this problem. Of all the algorithms, the genetic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes may be infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.
Linear program differentiation for single-channel speech separation
DEFF Research Database (Denmark)
Pearlmutter, Barak A.; Olsson, Rasmus Kongsgaard
2006-01-01
Many apparently difficult problems can be solved by reduction to linear programming. Such problems are often subproblems within larger systems. When gradient optimisation of the entire larger system is desired, it is necessary to propagate gradients through the internally-invoked LP solver....... For instance, when an intermediate quantity z is the solution to a linear program involving constraint matrix A, a vector of sensitivities dE/dz will induce sensitivities dE/dA. Here we show how these can be efficiently calculated, when they exist. This allows algorithmic differentiation to be applied...... to algorithms that invoke linear programming solvers as subroutines, as is common when using sparse representations in signal processing. Here we apply it to gradient optimisation of over complete dictionaries for maximally sparse representations of a speech corpus. The dictionaries are employed in a single...
From Parity and Payoff Games to Linear Programming
Schewe, Sven
This paper establishes a surprising reduction from parity and mean payoff games to linear programming problems. While such a connection is trivial for solitary games, it is surprising for two player games, because the players have opposing objectives, whose natural translations into an optimisation problem are minimisation and maximisation, respectively. Our reduction to linear programming circumvents the need for concurrent minimisation and maximisation by replacing one of them, the maximisation, by approximation. The resulting optimisation problem can be translated to a linear programme by a simple space transformation, which is inexpensive in the unit cost model, but results in an exponential growth of the coefficients. The discovered connection opens up unexpected applications - like μ-calculus model checking - of linear programming in the unit cost model, and thus turns the intriguing academic problem of finding a polynomial time algorithm for linear programming in this model of computation (and subsequently a strongly polynomial algorithm) into a problem of paramount practical importance: All advancements in this area can immediately be applied to accelerate solving parity and payoff games, or to improve their complexity analysis.
Online gait programming of humanoid walking via NMPC
Institute of Scientific and Technical Information of China (English)
ZHU Zhi-bin; WANG Yan; CHEN Xing-lin
2010-01-01
In order to satisfy the requirement of realtime gait programming of humanoid walking with foot rotation,a kind of modified Nonlinear Model Predictive Control(NMPC)scheme was proposed.Based on setting suitable kinetic and kinematic virtual constraints of Single Support Phase(SSP)and three subphases of Double Support Phase(DSP),complex realtime gait programming problem was simplified to four online NMPC dynamic optimization problems.A numerical approach was proposed to transform the dynamical optimization problem to the finite dimensional static optimization problem which can be solved by Sequential Quadratic Programming(SQP).It can be concluded from simulation that using this method on BIP model can realize online gait programming of dynamic walking with foot rotation and the biped stability can be satisfied such that there is no sliding during walking.
Boolean approach to zero-one linear programming
Energy Technology Data Exchange (ETDEWEB)
Hulme, B.L.; Baca, L.S.
1984-07-01
Problems of minimizing or maximizing a linear objective function in zero-one variables subject to linear constraints can be solved by Boolean algebraic methods. This report gives both a general procedure for stating such problems in Boolean form and a solution procedure that has been implemented by a SETS user program. The program uses the Boolean algebraic formula manipulation techniques of the SETS language. Sample problems illustrate how to make optimum choices in the contexts of physical protection, packing knapsacks, designing manufacturing processes and making assignments.
Support vector classification algorithm based on variable parameter linear programming
Institute of Scientific and Technical Information of China (English)
Xiao Jianhua; Lin Jian
2007-01-01
To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed.In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model.The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given.An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.
Analytic central path, sensitivity analysis and parametric linear programming
A.G. Holder; Sturm, J.F.; Zhang, Shuzhong
1998-01-01
textabstractIn this paper we consider properties of the central path and the analytic center of the optimal face in the context of parametric linear programming. We first show that if the right-hand side vector of a standard linear program is perturbed, then the analytic center of the optimal face is one-side differentiable with respect to the perturbation parameter. In that case we also show that the whole analytic central path shifts in a uniform fashion. When the objective vector is pertur...
A new heuristic algorithm for general integer linear programming problems
Institute of Scientific and Technical Information of China (English)
GAO Pei-wang; CAI Ying
2006-01-01
A new heuristic algorithm is proposed for solving general integer linear programming problems.In the algorithm,the objective function hyperplane is used as a cutting plane,and then by introducing a special set of assistant sets,an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane.A simple numerical example shows that the algorithm is efficient for some problems,and therefore,of practical interest.
Moving toward cultural competency: DREAMWork online summer program.
Harris, Martina S; Purnell, Kathy; Fletcher, Audwin; Lindgren, Katherine
2013-01-01
This article describes the origination and implementation of an online, interactive summer component of the Diversity Recruitment and Education to Advance Minorities in the Nursing Workforce Program (DREAMWork) at University of Tennessee at Chattanooga (UTC). The summer course was designed as a strategy to help prepare baccalaureate nursing students to provide both culturally sensitive and competent care through online learning. Sixteen baccalaureate nursing students participated in the four week online summer program. Course objectives were framed using Campinha-Bacote's (2002) model of cultural competence (Figure 1). Analysis revealed at the end of the four week summer program, students were more comfortable discussing their own prejudices and biases and were left with a deeper appreciation of what it meant to provide culturally sensitive care. The results of this summer program suggest the need to expand the online course to allow DREAMWork pre-nursing students to address the issue of becoming culturally competent prior to admission into upper division nursing clinical courses. This project was supported by funds from the Division of Nursing (DN), Bureau of Health Professions (BHPr), Health Resources and Services Administration (HRSA), Department of Health and Human Services (DHHS) under grant # D19HP08214.
Applied Research of Enterprise Cost Control Based on Linear Programming
Directory of Open Access Journals (Sweden)
Yu Shuo
2015-01-01
This paper researches the enterprise cost control through the linear programming model, and analyzes the restriction factors of the labor of enterprise production, raw materials, processing equipment, sales price, and other factors affecting the enterprise income, so as to obtain an enterprise cost control model based on the linear programming. This model can calculate rational production mode in the case of limited resources, and acquire optimal enterprise income. The production guiding program and scheduling arrangement of the enterprise can be obtained through calculation results, so as to provide scientific and effective guidance for the enterprise production. This paper adds the sensitivity analysis in the linear programming model, so as to learn about the stability of the enterprise cost control model based on linear programming through the sensitivity analysis, and verify the rationality of the model, and indicate the direction for the enterprise cost control. The calculation results of the model can provide a certain reference for the enterprise planning in the market economy environment, which have strong reference and practical significance in terms of the enterprise cost control.
Pape, Stephen J.; Prosser, Sherri K.; Griffin, Cynthia C.; Dana, Nancy Fichtman; Algina, James; Bae, Jungah
2015-01-01
This study sought to identify components of an asynchronous online teacher professional development program, "Prime Online," that potentially affected participants' mathematical knowledge for teaching (MKT). Twenty-three third- through fifth-grade general education and special education teachers completed a yearlong online teacher…
THE SEPARATION OF URANIUM ISOTOPES BY GASEOUS DIFFUSION: A LINEAR PROGRAMMING MODEL,
URANIUM, ISOTOPE SEPARATION), (*GASEOUS DIFFUSION SEPARATION, LINEAR PROGRAMMING ), (* LINEAR PROGRAMMING , GASEOUS DIFFUSION SEPARATION), MATHEMATICAL MODELS, GAS FLOW, NUCLEAR REACTORS, OPERATIONS RESEARCH
Online Collaboration for Programming: Assessing Students’ Cognitive Abilities
Directory of Open Access Journals (Sweden)
Mahfudzah OTHMAN
2015-10-01
Full Text Available This study is primarily focused on assessing the students’ logical thinking and cognitive levels in an online collaborative environment. The aim is to investigate whether the online collaboration has significant impact to the students’ cognitive abilities. The assessment of the logical thinking involved the use of the online Group Assessment Logical Thinking (GALT test that has been conducted in two phases; before and after the online collaborative activities. The sample of respondents for this study is sixty first year Diploma in Computer Science students from Universiti Teknologi MARA (UiTM Perlis, Malaysia where they were divided into fifteen collaborative groups. These collaborative groups were then engaged in a 3-hour session of collaborative activities via the Online Collaborative Learning System (OCLS. The results for this study has revealed that the online collaborative learning has significant impact to the students’ logical thinking levels with the increment of 21.7% high logical thinkers with p-value<0.05 (sig. 2-tailed. Meanwhile, the investigation of the students’ cognitive levels is being done by monitoring the students’ abilities to solve the given questions via OCLS. The questions have been previously constructed according to the Bloom’s taxonomy cognitive domain. The results have also revealed that the students at the early stage of learning programming are able to solve complex programming problems at the cognitive level Application and Analysis. There was also a strong correlation between students’ logical thinking skills with their abilities to solve problems in an online platform with r= 0.631, significant at 0.012.
Predicting Dropout Student: An Application of Data Mining Methods in an Online Education Program
Yukselturk, Erman; Ozekes, Serhat; Turel, Yalin Kilic
2014-01-01
This study examined the prediction of dropouts through data mining approaches in an online program. The subject of the study was selected from a total of 189 students who registered to the online Information Technologies Certificate Program in 2007-2009. The data was collected through online questionnaires (Demographic Survey, Online Technologies…
Marketing Online Degree Programs: How Do Traditional-Residential Programs Compete?
Adams, Jonathan; Eveland, Vicki
2007-01-01
A total of 150 university Web sites were segregated into one of three groups: accredited residential, regionally accredited online, and nonaccredited online institutions. The promotional imagery, marketing messages and marketing themes found on the landing pages of each university program Web sites were analyzed for similarities and differences. A…
Short Rational Generating Functions For Multiobjective Linear Integer Programming
Blanco, Victor
2007-01-01
This paper presents an algorithm for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated solutions for the problem. Theoretical complexity results on the algorithm are provided in the paper and an implementation of the algorithm shows that it is useful for solving multiobjective integer linear programs.
On filter-successive linearization methods for nonlinear semidefinite programming
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by Fletcher and Leyffer in 2002. We describe the new algorithm and prove its global convergence under weaker assumptions. Some numerical results are reported and show that the new method is potentially effcient.
On filter-successive linearization methods for nonlinear semidefinite programming
Institute of Scientific and Technical Information of China (English)
LI ChengJin; SUN WenYui
2009-01-01
In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by Fletcher and Leyffer in 2002. We describe the new algorithm and prove its global convergence under weaker assumptions. Some numerical results are reported and show that the new method is potentially efficient.
ON ALTERNATIVE OPTIMAL SOLUTIONS TO QUASIMONOTONIC PROGRAMMING WITH LINEAR CONSTRAINTS
Institute of Scientific and Technical Information of China (English)
Xue Shengjia
2007-01-01
In this paper, the nonlinear programming problem with quasimonotonic ( both quasiconvex and quasiconcave )objective function and linear constraints is considered. With the decomposition theorem of polyhedral sets, the structure of optimal solution set for the programming problem is depicted. Based on a simplified version of the convex simplex method,the uniqueness condition of optimal solution and the computational procedures to determine all optimal solutions are given, if the uniqueness condition is not satisfied. An illustrative example is also presented.
Objective Evaluation in an Online Geographic Information System Certificate Program
Directory of Open Access Journals (Sweden)
Scott L. WALKER
2005-01-01
Full Text Available Objective Evaluation in an Online Geographic Information System Certificate Program Asst. Professor. Dr. Scott L. WALKER Texas State University-San Marcos San Marcos, Texas, USA ABSTRACT Departmental decisions regarding distance education programs can be subject to subjective decision-making processes influenced by external factors such as strong faculty opinions or pressure to increase student enrolment. This paper outlines an evaluation of a departmental distance-education program. The evaluation utilized several methods that strived to inject objectivity in evaluation and subsequent decision-making. A rapid multi-modal approach included evaluation methods of (1 considering the online psychosocial learning environment, (2 content analyses comparing the online version of classes to face-to-face versions, (3 cost comparisons in online vs. face-to-face classes, (4 student outcomes, (5 student retention, and (6 benchmarking. These approaches offer opportunities for departmental administrators and decision-making committees to make judgments informed by facts rather than being influenced by the emotions, beliefs, or opinions of organizational dynamics.
Developing a quality assurance program for online services.
Humphries, A W; Naisawald, G V
1991-07-01
A quality assurance (QA) program provides not only a mechanism for establishing training and competency standards, but also a method for continuously monitoring current service practices to correct shortcomings. The typical QA cycle includes these basic steps: select subject for review, establish measurable standards, evaluate existing services using the standards, identify problems, implement solutions, and reevaluate services. The Claude Moore Health Sciences Library (CMHSL) developed a quality assurance program for online services designed to evaluate services against specific criteria identified by research studies as being important to customer satisfaction. These criteria include reliability, responsiveness, approachability, communication, and physical factors. The application of these criteria to the library's existing online services in the quality review process is discussed with specific examples of the problems identified in each service area, as well as the solutions implemented to correct deficiencies. The application of the QA cycle to an online services program serves as a model of possible interventions. The use of QA principles to enhance online service quality can be extended to other library service areas.
Linear programming bounds for unitary space time codes
Creignou, Jean
2008-01-01
The linear programming method is applied to the space $\\U_n(\\C)$ of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theoretical and numerical results improving previously known bounds are derived.
Smoothing Newton Algorithm for Linear Programming over Symmetric Cones
Institute of Scientific and Technical Information of China (English)
LIU Xiaohong; NI Tie
2009-01-01
By using the theory of Euclidean Jordan algebras,based on a new class of smoothing functions,the QiSun-Zhou's smoothing Newton algorithm is extended to solve linear programming over symmetric cones (SCLP).The algorithm is globally convergent under suitable assumptions.
Linear decomposition approach for a class of nonconvex programming problems.
Shen, Peiping; Wang, Chunfeng
2017-01-01
This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.
Train repathing in emergencies based on fuzzy linear programming.
Meng, Xuelei; Cui, Bingmou
2014-01-01
Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This paper focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost, running cost, and social adverse effect cost. With the overall consideration of the segment and station capability constraints, we build the fuzzy linear programming model to solve the train pathing problem. We design the fuzzy membership function to describe the fuzzy coefficients. Furthermore, the contraction-expansion factors are introduced to contract or expand the value ranges of the fuzzy coefficients, coping with the uncertainty of the value range of the fuzzy coefficients. We propose a method based on triangular fuzzy coefficient and transfer the train pathing (fuzzy linear programming model) to a determinate linear model to solve the fuzzy linear programming problem. An emergency is supposed based on the real data of the Beijing-Shanghai Railway. The model in this paper was solved and the computation results prove the availability of the model and efficiency of the algorithm.
A Qualitative Examination of Challenges Influencing Doctoral Students in an Online Doctoral Program
Deshpande, Anant
2016-01-01
The main purpose of the study was to investigate the challenges faced by students in completion of an online doctoral program at the University of Liverpool, Online Doctoral Business Administration program. We analyse the responses of 91 doctoral students in an online DBA program. Based on the exploratory qualitative study themes were developed…
A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems
Tunjo Perić; Zoran Babić; Sead Rešić
2014-01-01
This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP) problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.
Boolean Variables in Economic Models Solved by Linear Programming
Directory of Open Access Journals (Sweden)
Lixandroiu D.
2014-12-01
Full Text Available The article analyses the use of logical variables in economic models solved by linear programming. Focus is given to the presentation of the way logical constraints are obtained and of the definition rules based on predicate logic. Emphasis is also put on the possibility to use logical variables in constructing a linear objective function on intervals. Such functions are encountered when costs or unitary receipts are different on disjunct intervals of production volumes achieved or sold. Other uses of Boolean variables are connected to constraint systems with conditions and the case of a variable which takes values from a finite set of integers.
An Online Method for Interpolating Linear Parametric Reduced-Order Models
Amsallem, David
2011-01-01
A two-step online method is proposed for interpolating projection-based linear parametric reduced-order models (ROMs) in order to construct a new ROM for a new set of parameter values. The first step of this method transforms each precomputed ROM into a consistent set of generalized coordinates. The second step interpolates the associated linear operators on their appropriate matrix manifold. Real-time performance is achieved by precomputing inner products between the reduced-order bases underlying the precomputed ROMs. The proposed method is illustrated by applications in mechanical and aeronautical engineering. In particular, its robustness is demonstrated by its ability to handle the case where the sampled parameter set values exhibit a mode veering phenomenon. © 2011 Society for Industrial and Applied Mathematics.
Online Assessment of Athletic Training Education Outcomes and Program Satisfaction
Directory of Open Access Journals (Sweden)
W. David Carr
2006-12-01
Full Text Available This paper describes the development of the Online Assessment of Athletic Training Education system (OAATE, a tool for assessing student achievement in the knowledge domains necessary for certification as an athletic trainer. The system also assesses students' satisfaction with important dimensions of their individual degree programs. By making use of current database and communication technologies, we have developed a system that addresses important, unmet needs in the field of Athletic Training education. The design of the system makes it a dynamic, easily extensible tool that could be applied in a wide variety of education domains beyond its current setting. In addition, because of its Internet-based delivery system, the tool may be widely-used throughout the world, with benefits accruing to students, program instructors and administrators, and researchers in the field of education. Keywords: Education Assessment, Database, Information/Communication Technologies, Online Assessment.
Using online program development to foster curricular change and innovation.
Gwozdek, Anne E; Springfield, Emily C; Peet, Melissa R; Kerschbaum, Wendy E
2011-03-01
Distance education offers an opportunity to catalyze sweeping curricular change. Faculty members of the University of Michigan Dental Hygiene Program spent eighteen months researching best practices, planning outcomes and courses, and implementing an e-learning (online) dental hygiene degree completion program. The result is a collaborative and portfolio-integrated program that focuses on the development of reflective practitioners and leaders in the profession. A team-based, systems-oriented model for production, implementation, and evaluation has been critical to the program's success. The models and best practices on which this program was founded are described. Also provided is a framework of strategies for development, including the utilization of backward course design, which can be used in many areas of professional education.
Does gamification increase engagement with online programs? A systematic review
Looyestyn, Jemma; Kernot, Jocelyn; Boshoff, Kobie; Ryan, Jillian; Edney, Sarah; Maher, Carol
2017-01-01
Background Engagement in online programs is difficult to maintain. Gamification is the recent trend that offers to increase engagement through the inclusion of game-like features like points and badges, in non-game contexts. This review will answer the following question, ‘Are gamification strategies effective in increasing engagement in online programs?’ Method Eight databases (Web of Science, PsycINFO, Medline, INSPEC, ERIC, Cochrane Library, Business Source Complete and ACM Digital Library) were searched from 2010 to the 28th of October 2015 using a comprehensive search strategy. Eligibility criteria was based on the PICOS format, where “population” included adults, “intervention” involved an online program or smart phone application that included at least one gamification feature. “Comparator” was a control group, “outcomes” included engagement and “downstream” outcomes which occurred as a result of engagement; and “study design” included experimental studies from peer-reviewed sources. Effect sizes (Cohens d and 95% confidence intervals) were also calculated. Results 1017 studies were identified from database searches following the removal of duplicates, of which 15 met the inclusion criteria. The studies involved a total of 10,499 participants, and were commonly undertaken in tertiary education contexts. Engagement metrics included time spent (n = 5), volume of contributions (n = 11) and occasions visited to the software (n = 4); as well as downstream behaviours such as performance (n = 4) and healthy behaviours (n = 1). Effect sizes typically ranged from medium to large in direct engagement and downstream behaviours, with 12 out of 15 studies finding positive significant effects in favour of gamification. Conclusion Gamification is effective in increasing engagement in online programs. Key recommendations for future research into gamification are provided. In particular, rigorous study designs are required to fully examine
Does gamification increase engagement with online programs? A systematic review.
Looyestyn, Jemma; Kernot, Jocelyn; Boshoff, Kobie; Ryan, Jillian; Edney, Sarah; Maher, Carol
2017-01-01
Engagement in online programs is difficult to maintain. Gamification is the recent trend that offers to increase engagement through the inclusion of game-like features like points and badges, in non-game contexts. This review will answer the following question, 'Are gamification strategies effective in increasing engagement in online programs?' Eight databases (Web of Science, PsycINFO, Medline, INSPEC, ERIC, Cochrane Library, Business Source Complete and ACM Digital Library) were searched from 2010 to the 28th of October 2015 using a comprehensive search strategy. Eligibility criteria was based on the PICOS format, where "population" included adults, "intervention" involved an online program or smart phone application that included at least one gamification feature. "Comparator" was a control group, "outcomes" included engagement and "downstream" outcomes which occurred as a result of engagement; and "study design" included experimental studies from peer-reviewed sources. Effect sizes (Cohens d and 95% confidence intervals) were also calculated. 1017 studies were identified from database searches following the removal of duplicates, of which 15 met the inclusion criteria. The studies involved a total of 10,499 participants, and were commonly undertaken in tertiary education contexts. Engagement metrics included time spent (n = 5), volume of contributions (n = 11) and occasions visited to the software (n = 4); as well as downstream behaviours such as performance (n = 4) and healthy behaviours (n = 1). Effect sizes typically ranged from medium to large in direct engagement and downstream behaviours, with 12 out of 15 studies finding positive significant effects in favour of gamification. Gamification is effective in increasing engagement in online programs. Key recommendations for future research into gamification are provided. In particular, rigorous study designs are required to fully examine gamification's effects and determine how to best achieve sustained
Matzke, Orville R.
The purpose of this study was to formulate a linear programming model to simulate a foundation type support program and to apply this model to a state support program for the public elementary and secondary school districts in the State of Iowa. The model was successful in producing optimal solutions to five objective functions proposed for…
Secure Linear Programming Using Privacy-Preserving Simplex
Saxena, Amitabh; Hoogh, Sebastiaan J
2009-01-01
The SecureSCM project (www.securescm.org) aims to develop cryptographic solutions to the problem of data sharing in Supply Chain Optimization (SCO). The SCO problem has a precise mathematical structure. It is an instance of the general Linear Programming (LP) problem. However, standard techniques for LP problems are not suitable for this purpose because they require participants to reveal private data needed as input to the algorithm. The risk of revealing this information far exceeds the benefits gained. Therefore, the aim of the project is to develop efficient techniques for securely solving LP problems. In this paper we give a summary of work done in the cryptographic aspects of the project. We describe the state-of-the art building blocks for secure linear programming along with an analysis of their complexity.
Planning under uncertainty solving large-scale stochastic linear programs
Energy Technology Data Exchange (ETDEWEB)
Infanger, G. (Stanford Univ., CA (United States). Dept. of Operations Research Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft)
1992-12-01
For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.
Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution
Energy Technology Data Exchange (ETDEWEB)
Hamadameen, Abdulqader Othman [Optimization, Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia); Zainuddin, Zaitul Marlizawati [Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia)
2014-06-19
This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.
A Spreadsheet-Based, Matrix Formulation Linear Programming Lesson
DEFF Research Database (Denmark)
Harrod, Steven
2009-01-01
The article focuses on the spreadsheet-based, matrix formulation linear programming lesson. According to the article, it makes a higher level of theoretical mathematics approachable by a wide spectrum of students wherein many may not be decision sciences or quantitative methods majors. Moreover......, it is consistent with the Arganbright Principles because the arrays and functions are clear in their operation and easily manipulated by the user....
An MC2 Linear Programming Approaches to Portfolios
Institute of Scientific and Technical Information of China (English)
ZHOU Zong-fang; TANG Xiao-wo; SHI Yong
2002-01-01
Portfolios is a well-known investment technique of handling multiple stocks, bonds and securities. However, the previous portfolios investment lack of incorporating the various possible opinions from several experts on an given portfolios investment problem. This paper proposes an MC2 linear programming approach to determining weighted coefficients of portfolios that involves multiple experts. The numerical example of the paper shows that the proposed approach likely outperforms the current techniques of portfolios in dealing with the case of multiple experts.
Efficient numerical methods for entropy-linear programming problems
Gasnikov, A. V.; Gasnikova, E. B.; Nesterov, Yu. E.; Chernov, A. V.
2016-04-01
Entropy-linear programming (ELP) problems arise in various applications. They are usually written as the maximization of entropy (minimization of minus entropy) under affine constraints. In this work, new numerical methods for solving ELP problems are proposed. Sharp estimates for the convergence rates of the proposed methods are established. The approach described applies to a broader class of minimization problems for strongly convex functionals with affine constraints.
Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming
Claudel, Christian G.
2014-01-01
This brief presents new convex formulations for solving estimation problems in systems modeled by scalar Hamilton-Jacobi (HJ) equations. Using a semi-analytic formula, we show that the constraints resulting from a HJ equation are convex, and can be written as a set of linear inequalities. We use this fact to pose various (and seemingly unrelated) estimation problems related to traffic flow-engineering as a set of linear programs. In particular, we solve data assimilation and data reconciliation problems for estimating the state of a system when the model and measurement constraints are incompatible. We also solve traffic estimation problems, such as travel time estimation or density estimation. For all these problems, a numerical implementation is performed using experimental data from the Mobile Century experiment. In the context of reproducible research, the code and data used to compute the results presented in this brief have been posted online and are accessible to regenerate the results. © 2013 IEEE.
Solving linear integer programming problems by a novel neural model.
Cavalieri, S
1999-02-01
The paper deals with integer linear programming problems. As is well known, these are extremely complex problems, even when the number of integer variables is quite low. Literature provides examples of various methods to solve such problems, some of which are of a heuristic nature. This paper proposes an alternative strategy based on the Hopfield neural network. The advantage of the strategy essentially lies in the fact that hardware implementation of the neural model allows for the time required to obtain a solution so as not depend on the size of the problem to be solved. The paper presents a particular class of integer linear programming problems, including well-known problems such as the Travelling Salesman Problem and the Set Covering Problem. After a brief description of this class of problems, it is demonstrated that the original Hopfield model is incapable of supplying valid solutions. This is attributed to the presence of constant bias currents in the dynamic of the neural model. A demonstration of this is given and then a novel neural model is presented which continues to be based on the same architecture as the Hopfield model, but introduces modifications thanks to which the integer linear programming problems presented can be solved. Some numerical examples and concluding remarks highlight the solving capacity of the novel neural model.
Linear-programming approach to electricity demand-curtailment planning
Energy Technology Data Exchange (ETDEWEB)
Allentuck, J; Carroll, O; Schnader, M
1980-05-01
Curtailment planning at a generally rudimentary level has been undertaken by the governments of some twenty states. Many utilities have demand-curtailment plans, however, these are often incorporated in plans for meeting capacity shortages. In at least five states, there are apparently no curtailment plans either at the state-government level or at the utility level. Moreover, none of the existing electricity demand curtailment plans examined included an explicit statement of the planners' objective in arriving at a specified sharing of the burdens of curtailment among consumer classes. Yet clearly the actual allocations of such burdens will affect the cost of the shortage. Since a study of state planning failed to yield a clear-cut indication of which of many possible curtailment allocation schemes would best serve as a point of departure for the design of an optimal curtailment strategy to deal with prolonged supply deficiencies, it was then decided to use a linear-programming approach. The advantages of such an approach are examined first, after which some important conceptual and practical problems in the design of a specific linear-programming model are addressed. A mathematical statement of the model is then followed by a brief review the principal methodological shortcomings of the linear-programming approach. Finally, the authors discuss how the analysis might be expanded to account for inter-regional and other secondary effects of curtailment.
The Hardness of Finding Linear Ranking Functions for Lasso Programs
Directory of Open Access Journals (Sweden)
Amir M. Ben-Amram
2014-08-01
Full Text Available Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem is known to be in coNP when variables range over the integers and in PTIME for the rational numbers, or real numbers. Here we show that deciding whether a linear-constraint loop with a precondition, specifically with partially-specified input, has a linear ranking function is EXPSPACE-hard over the integers, and PSPACE-hard over the rationals. The precise complexity of these decision problems is yet unknown. The EXPSPACE lower bound is derived from the reachability problem for Petri nets (equivalently, Vector Addition Systems, and possibly indicates an even stronger lower bound (subject to open problems in VAS theory. The lower bound for the rationals follows from a novel simulation of Boolean programs. Lower bounds are also given for the problem of deciding if a linear ranking-function supported by a particular form of inductive invariant exists. For loops over integers, the problem is PSPACE-hard for convex polyhedral invariants and EXPSPACE-hard for downward-closed sets of natural numbers as invariants.
Robust Adaptive Dynamic Programming of Two-Player Zero-Sum Games for Continuous-Time Linear Systems.
Fu, Yue; Fu, Jun; Chai, Tianyou
2015-12-01
In this brief, an online robust adaptive dynamic programming algorithm is proposed for two-player zero-sum games of continuous-time unknown linear systems with matched uncertainties, which are functions of system outputs and states of a completely unknown exosystem. The online algorithm is developed using the policy iteration (PI) scheme with only one iteration loop. A new analytical method is proposed for convergence proof of the PI scheme. The sufficient conditions are given to guarantee globally asymptotic stability and suboptimal property of the closed-loop system. Simulation studies are conducted to illustrate the effectiveness of the proposed method.
Linear Programming Graphic Method Modelling%Linear Programming图解法建模研讨
Institute of Scientific and Technical Information of China (English)
宋占奎
2010-01-01
对仅有两个变量的Linear Programming,通过图解法求最优解.建立了数学模型并求得了最优解.从图解法可以直观地看出,仅有两个变量的Linear Programming的解有唯一最优解、无穷多个最优解、无界解和无可行解四种情况.若其有最优解,则必定会在其顶点上得到;若在多个顶点上得到最优解,则其有无穷多个最优解.
A Primal-Dual Interior Point-Linear Programming Algorithm for MPC
DEFF Research Database (Denmark)
Edlund, Kristian; Sokoler, Leo Emil; Jørgensen, John Bagterp
2009-01-01
Constrained optimal control problems for linear systems with linear constraints and an objective function consisting of linear and l1-norm terms can be expressed as linear programs. We develop an efficient primal-dual interior point algorithm for solution of such linear programs. The algorithm...
Meyer, Katrina A.; Bruwelheide, Janis; Poulin, Russell
2007-01-01
Following the theory of situated cognition as proposed by Brown, Collins, and Duguid (1998), this research project tapped into the contextual knowledge of experienced administrators of online programs. Draft principles of financial sustainability for online programs were developed by an initial team of experienced online educators and then…
Student Perceptions of Satisfaction and Anxiety in an Online Doctoral Program
Bolliger, Doris U.; Halupa, Colleen
2012-01-01
Eighty-four students in an online health education doctoral program taking the first course in the program over one year (four quarters) were surveyed in regards to their computer, Internet, and online course anxiety, and overall course satisfaction. An 18-item anxiety tool with domains in computer, Internet, and online learning was administered…
The Way of the Wiki: Using a Wiki as a Management Tool for Online Programs
Huett, Jason B.; Huett, Kimberly C.; Bennett, Elizabeth
2010-01-01
Many universities are struggling to meet student demand for quality online course offerings. As an online program grows, it can become more difficult to manage information, resources, and people. Adopting useful knowledge management tools, such as wikis, could help better position an online program in a competitive marketplace. Wikis promote…
Isman, Aytekin; Altinay, Fahriye
2005-01-01
This research study defines communication barriers in online programs and courses by determining the perceptions of students and teachers at Eastern Mediterranean University. It aims to get the answers to the questions of what sorts of problems students and teachers face while being involved in online courses and online programs. Distance…
A LINEAR-PROGRAMMING ALGORITHM FOR INVARIANT POLYHEDRAL-SETS OF DISCRETE-TIME LINEAR-SYSTEMS
TENDAM, AA; NIEUWENHUIS, JW
1995-01-01
In this paper we formulate necessary and sufficient conditions for an arbitrary polyhedral set to be a positively invariant set of a linear discrete-time system. Polyhedral cones and linear subspaces are included in the analysis. A linear programming algorithm is presented that enables practical
Psychology Students and Online Graduate Programs: A Need to Reexamine Undergraduate Advisement
Bendersky, Karen; Isaac, Walter L.; Stover, Jason H.; Zook, Joan M.
2008-01-01
Few online psychology graduate programs are accredited and thus may not provide students with the same career opportunities as programs from traditional universities. We investigated whether psychology majors are more likely than other majors to consider applying to online graduate programs and whether students considering these programs have…
Optimal traffic control in highway transportation networks using linear programming
Li, Yanning
2014-06-01
This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.
An Interactive Online Education System for the Supplemental Nutrition Program
Directory of Open Access Journals (Sweden)
Alma Ohene-Opare
2009-12-01
Full Text Available Public health education is a key component in the variety of services provided by local health departments, particularly for the low-income demographic. In addition to helping the participants to live a healthier lifestyle, nutrition education sessions are a required component of a specific program for low-income mothers and children, entitled the Special Supplemental Nutrition Program for Women, Infants, and Children (WIC. However, some women in the Utah County WIC program were not receiving the sessions because the inconvenient class times and scheduling difficulty. With the increasing availability of the internet access by WIC participants, we can increase the availability and effectiveness of the nutrition education by providing courses online via the Utah County's WIC website. We are designing a system consisting of a web interface and a database backend, where health workers can author and publish interactive content, track users' progress, and evaluate the outcome of the courses taken.
Study on an On-line Measurement System of Corrosion Rate by Linear Polarization Resistance
Energy Technology Data Exchange (ETDEWEB)
Moon, Jeon Soo; Lee, Jae Kun; Lee, Jae Bong; Park, Pyl Yang [Korea Electric Power Research Institute, Daejeon (Korea, Republic of)
2012-04-15
The linear polarization resistance method is one of the widely used techniques for the corrosion rate monitoring in the water circulating systems of plants. The measurement is simple and rapid, so that a continuous on-line monitoring is possible without any shutdown of plants. A 2-electrode polarization corrosion rate measurement system was installed in a laboratory using a data acquisition board and PC. The signal processing parameters were optimized for the accurate corrosion rate measurement, and the polarization resistance was compensated with the solution resistance measured by the high frequency sine wave signal of an output channel. The precision of corrosion rate data was greatly improved by removing the initial noise signals on measuring the polarization resistance.
Using student satisfaction data to evaluate a new online accelerated nursing education program.
Gazza, Elizabeth A; Matthias, April
2016-10-01
As increasing numbers of students enroll in online education, institutions of higher education are responsible for delivering quality online courses and programs. Agencies that accredit institutions and programs require evidence of program quality, including student satisfaction. A large state university in the Southeastern United States transitioned an online nursing education degree completion, or Registered Nurse-to-Bachelor of Science in Nursing, program to an online accelerated format in order to meet the needs of working nurses and ultimately, increase the number of nurses prepared at the baccalaureate level. This article describes a descriptive, cross-sectional study that evaluated the effectiveness of the new online accelerated program using the quality indicator of student satisfaction. Ninety-one (32%) of the 284 students who were enrolled or had been enrolled in a course within the online accelerated degree completion program between fall 2013 session 1 and summer 2014 session participated in the study. The electronic Noel-Levitz Priorities Survey for Online Learners™ was used to measure student satisfaction with the program and associated services. Results provided insight into the students' satisfaction with the new program format and served as the basis for an interdepartmental program enhancement plan aimed at maintaining and enhancing student satisfaction and overall program quality. Findings indicated that measuring and evaluating student satisfaction can provide valuable information about the effectiveness of an online program. Recommendations for using the measurement tool in online program planning and studying student satisfaction in relation to retention and program completion were identified.
M Sakawa; Kato, K.
2009-01-01
This paper considers stochastic two-level linear programming problems. Using the concept of chance constraints and probability maximization, original problems are transformed into deterministic ones. An interactive fuzzy programming method is presented for deriving a satisfactory solution efficiently with considerations of overall satisfactory balance.
On a Linear Program for Minimum-Weight Triangulation
Yousefi, Arman
2011-01-01
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so does the LP.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
A new algorithm for solving linear programming problems
Directory of Open Access Journals (Sweden)
Andrés Leonardo Ramírez Leal
2012-08-01
Full Text Available Linear programming (LP is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems, including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.
A linear programming approach for optimal contrast-tone mapping.
Wu, Xiaolin
2011-05-01
This paper proposes a novel algorithmic approach of image enhancement via optimal contrast-tone mapping. In a fundamental departure from the current practice of histogram equalization for contrast enhancement, the proposed approach maximizes expected contrast gain subject to an upper limit on tone distortion and optionally to other constraints that suppress artifacts. The underlying contrast-tone optimization problem can be solved efficiently by linear programming. This new constrained optimization approach for image enhancement is general, and the user can add and fine tune the constraints to achieve desired visual effects. Experimental results demonstrate clearly superior performance of the new approach over histogram equalization and its variants.
Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems
Directory of Open Access Journals (Sweden)
Xinbo Zhang
2014-01-01
Full Text Available A polymorphic uncertain linear programming (PULP model is constructed to formulate a class of generalized production planning problems. In accordance with the practical environment, some factors such as the consumption of raw material, the limitation of resource and the demand of product are incorporated into the model as parameters of interval and fuzzy subsets, respectively. Based on the theory of fuzzy interval program and the modified possibility degree for the order of interval numbers, a deterministic equivalent formulation for this model is derived such that a robust solution for the uncertain optimization problem is obtained. Case study indicates that the constructed model and the proposed solution are useful to search for an optimal production plan for the polymorphic uncertain generalized production planning problems.
Brachytherapy seed localization using geometric and linear programming techniques.
Singh, Vikas; Mukherjee, Lopamudra; Xu, Jinhui; Hoffmann, Kenneth R; Dinu, Petru M; Podgorsak, Matthew
2007-09-01
We propose an optimization algorithm to solve the brachytherapy seed localization problem in prostate brachytherapy. Our algorithm is based on novel geometric approaches to exploit the special structure of the problem and relies on a number of key observations which help us formulate the optimization problem as a minimization integer program (IP). Our IP model precisely defines the feasibility polyhedron for this problem using a polynomial number of half-spaces; the solution to its corresponding linear program is rounded to yield an integral solution to our task of determining correspondences between seeds in multiple projection images. The algorithm is efficient in theory as well as in practice and performs well on simulation data (approximately 98% accuracy) and real X-ray images (approximately 95% accuracy). We present in detail the underlying ideas and an extensive set of performance evaluations based on our implementation.
OPTIMIZED AGRICULTURAL PLANNING OF SUGARCANE USING LINEAR PROGRAMMING
Directory of Open Access Journals (Sweden)
Maximiliano Salles Scarpari* and Edgar Gomes Ferreira de Beauclair**
2010-03-01
Full Text Available Optimized agricultural planning is a fundamental activity in business profitability because it can increase the returns from an operation with low additional costs. Nonetheless, the use of operations research adapted to sugarcane plantation management is still limited, resulting in decision-making at management level being primarily empirical. The goal of this work was to develop an optimized planning model for sugarcane farming using a linear programming tool. The program language used was General Algebraic Modelling System (GAMS as this system was seen to be an excellent tool to allow profit maximization and harvesting time schedule optimization in the sugar mill studied. The results presented support this optimized planning model as being a very useful tool for sugarcane management.
Analisis Optimalisasi Produksi dengan Linear Programming Melalui Metode Simpleks
Directory of Open Access Journals (Sweden)
Teguh Sriwidadi
2013-11-01
Full Text Available PD Utama Jaya Plasindo is a trading company which processes plastic resin. In the daily process, the company has many problems or constraints in production planning. Uncertainty demand of goods fluctuation has effect on shortage or surplus production. Other problems are raw materials, machine work hour, labour work hour, and the demand of the products. Simplex Method of Linear Programming purposes to maximize profit in linear function, Profit = 37 A + 46 B + 38 C + 46 D and linear functions of the seven constraints, Raw materials = 7 A + 5,8 B + 8,6 C + 7,6 D ≤ 180.000 grams, Machine Work Hour = 2,5 A + 3 B + 2 C + 2,5 D ≤86.400 seconds, Labor Work Hour = 5 A + 5 B + 5 C + 5 D ≤ 115.200 seconds, Demands of GRX 25 = A ≤2400 pcs, demand of GTW 25 = B ≤ 7200 pcs, demand of GTX 25 = C ≤ 3000 pcs, and demand of GTX 25 M = D ≤ 6600 pcs. The total profit earned by PD Utama Jaya Plasindo from plastic buckle products is Rp 837,000.00 per day and for 20 efective days is Rp 16,752,000.00 with the assumption of profit is in accordance with fixed objective and constraint functions.
How to Use Linear Programming for Information System Performances Optimization
Directory of Open Access Journals (Sweden)
Hell Marko
2014-09-01
Full Text Available Background: Organisations nowadays operate in a very dynamic environment, and therefore, their ability of continuously adjusting the strategic plan to the new conditions is a must for achieving their strategic objectives. BSC is a well-known methodology for measuring performances enabling organizations to learn how well they are doing. In this paper, “BSC for IS” will be proposed in order to measure the IS impact on the achievement of organizations’ business goals. Objectives: The objective of this paper is to present the original procedure which is used to enhance the BSC methodology in planning the optimal targets of IS performances value in order to maximize the organization's effectiveness. Methods/Approach: The method used in this paper is the quantitative methodology - linear programming. In the case study, linear programming is used for optimizing organization’s strategic performance. Results: Results are shown on the example of a case study national park. An optimal performance value for the strategic objective has been calculated, as well as an optimal performance value for each DO (derived objective. Results are calculated in Excel, using Solver Add-in. Conclusions: The presentation of methodology through the case study of a national park shows that this methodology, though it requires a high level of formalisation, provides a very transparent performance calculation.
AN APPLICATION FOR EFFICIENT TELECOMMUNICATION NETWORKS PROVISIONING USING LINEAR PROGRAMMING
Directory of Open Access Journals (Sweden)
Maria Augusta Soares Machado
2015-03-01
Full Text Available This paper presents a practical proposition for the application of the Linear Programming quantitative method in order to assist planning and control of customer circuit delivery activities in telecommunications companies working with the corporative market. Based upon data provided for by a telecom company operating in Brazil, the Linear Programming method was employed for one of the classical problems of determining the optimum mix of production quantities for a set of five products of that company: Private Telephone Network, Internet Network, Intranet Network, Low Speed Data Network, and High Speed Data Network, in face of several limitations of the productive resources, seeking to maximize the company’s monthly revenue. By fitting the production data available into a primary model, observation was made as to what number of monthly activations for each product would be mostly optimized in order to achieve maximum revenues in the company. The final delivery of a complete network was not observed but the delivery of the circuits that make it up, and this was a limiting factor for the study herein, which, however, brings an innovative proposition for the planning of private telecommunications network provisioning.
Assembling networks of microbial genomes using linear programming
Directory of Open Access Journals (Sweden)
Holloway Catherine
2010-11-01
Full Text Available Abstract Background Microbial genomes exhibit complex sets of genetic affinities due to lateral genetic transfer. Assessing the relative contributions of parent-to-offspring inheritance and gene sharing is a vital step in understanding the evolutionary origins and modern-day function of an organism, but recovering and showing these relationships is a challenging problem. Results We have developed a new approach that uses linear programming to find between-genome relationships, by treating tables of genetic affinities (here, represented by transformed BLAST e-values as an optimization problem. Validation trials on simulated data demonstrate the effectiveness of the approach in recovering and representing vertical and lateral relationships among genomes. Application of the technique to a set comprising Aquifex aeolicus and 75 other thermophiles showed an important role for large genomes as 'hubs' in the gene sharing network, and suggested that genes are preferentially shared between organisms with similar optimal growth temperatures. We were also able to discover distinct and common genetic contributors to each sequenced representative of genus Pseudomonas. Conclusions The linear programming approach we have developed can serve as an effective inference tool in its own right, and can be an efficient first step in a more-intensive phylogenomic analysis.
Direct linear programming solver in C for structural applications
Damkilde, L.; Hoyer, O.; Krenk, S.
1994-08-01
An optimization problem can be characterized by an object-function, which is maximized, and restrictions, which limit the variation of the variables. A subclass of optimization is Linear Programming (LP), where both the object-function and the restrictions are linear functions of the variables. The traditional solution methods for LP problems are based on the simplex method, and it is customary to allow only non-negative variables. Compared to other optimization routines the LP solvers are more robust and the optimum is reached in a finite number of steps and is not sensitive to the starting point. For structural applications many optimization problems can be linearized and solved by LP routines. However, the structural variables are not always non-negative, and this requires a reformation, where a variable x is substituted by the difference of two non-negative variables, x(sup + ) and x(sup - ). The transformation causes a doubling of the number of variables, and in a computer implementation the memory allocation doubles and for a typical problem the execution time at least doubles. This paper describes a LP solver written in C, which can handle a combination of non-negative variables and unlimited variables. The LP solver also allows restart, and this may reduce the computational costs if the solution to a similar LP problem is known a priori. The algorithm is based on the simplex method, and differs only in the logical choices. Application of the new LP solver will at the same time give both a more direct problem formulation and a more efficient program.
How Does Early Feedback in an Online Programming Course Change Problem Solving?
Ebrahimi, Alireza
2012-01-01
How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…
APPLICATION OF LINEAR PROGRAMMING TO FACILITY MAINTENANCE PROBLEMS IN THE NAVY SHORE ESTABLISHMENT.
LINEAR PROGRAMMING ), (*NAVAL SHORE FACILITIES, MAINTENANCE), (*MAINTENANCE, COSTS, MATHEMATICAL MODELS, MANAGEMENT PLANNING AND CONTROL, MANPOWER, FEASIBILITY STUDIES, OPTIMIZATION, MANAGEMENT ENGINEERING.
Institute of Scientific and Technical Information of China (English)
陈理; 王克峰; 徐霄羽; 姚平经
2004-01-01
In this contribution we present an online scheduling algorithm for a real world multiproduct batch plant. The overall mixed integer nonlinear programming (MINLP) problem is hierarchically structured into a mixed integer linear programming (MILP) problem first and then a reduced dimensional MINLP problem, which are optimized by mathematical programming (MP) and genetic algorithm (GA) respectively. The basis idea relies on combining MP with GA to exploit their complementary capacity. The key features of the hierarchical model are explained and illustrated with some real world cases from the multiproduct batch plants.
Computer Literacy and Online Learning Attitude toward GSOE Students in Distance Education Programs
Li, Lung-Yu; Lee, Long-Yuan
2016-01-01
The purpose of this study was to explore graduate students' competencies in computer use and their attitudes toward online learning in asynchronous online courses of distance learning programs in a Graduate School of Education (GSOE) in Taiwan. The research examined the relationship between computer literacy and the online learning attitudes of…
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
Williams, Ryan
2010-01-01
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs of these lower bounds follow a certain proof-by-contradiction strategy that we call alternation-trading. An important open problem is to determine how powerful such proofs can possibly be. We propose a methodology for studying these proofs that makes them amenable to both formal analysis and automated theorem proving. We prove that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances. Implementing a small-scale theorem prover based on this result, we extract new human-readable time lower bounds for several problems. This framework can also be used to prove concrete limitations on the current techniques.
Manipulating Multi-qudit Entanglement Witnesses by Using Linear Programming
Jafarizadeh, M A; Najarbashi, G
2006-01-01
A new class of entanglement witnesses (EWs) called reduction type entanglement witnesses is introduced, which can detect some multi-qudit entangeled states including PPT ones with Hilbert space of dimension $d_{_{1}}\\otimes d_{_{2}}\\otimes...\\otimes d_{_{n}}$. The novelty of this work comes from the fact that the feasible regions turn out to be convex polygons, hence the manipulation of these EWs reduces to linear programming which can be solved \\emph{exactly} by using simplex method. The decomposability and non-decomposability of these EWs are studied and it is shown that it has a close connection with eigenvalues and optimality of EWs. Also using the Jamio\\l kowski isomorphism, the corresponding possible positive maps, including the generalized reduction maps of Ref. \\cite{Hall1}, are obtained.
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Energy Technology Data Exchange (ETDEWEB)
Cardoso, Goncalo; Stadler, Michael; Siddiqui, Afzal; Marnay, Chris; DeForest, Nicholas; Barbosa-Povoa, Ana; Ferrao, Paulo
2013-05-23
This paper describes the introduction of stochastic linear programming into Operations DER-CAM, a tool used to obtain optimal operating schedules for a given microgrid under local economic and environmental conditions. This application follows previous work on optimal scheduling of a lithium-iron-phosphate battery given the output uncertainty of a 1 MW molten carbonate fuel cell. Both are in the Santa Rita Jail microgrid, located in Dublin, California. This fuel cell has proven unreliable, partially justifying the consideration of storage options. Several stochastic DER-CAM runs are executed to compare different scenarios to values obtained by a deterministic approach. Results indicate that using a stochastic approach provides a conservative yet more lucrative battery schedule. Lower expected energy bills result, given fuel cell outages, in potential savings exceeding 6percent.
An integer linear programming for a comprehensive reverse supply chain
Directory of Open Access Journals (Sweden)
Hoda Mahmoudi
2014-12-01
Full Text Available Reverse supply chain is a cycle of recovery for the products and materials used by the customers but can be returned to the chain performing some operations. Due to significance of reverse supply chain in the content of environmental and economical aspects, we formulate a mathematical model of reverse multi-layer multi-product supply chain for minimizing the total costs including returning, disassembly, processing, recycling, remanufacturing, and distribution centers. The presented model is an integer linear programming model being solved using Lingo 9 software. Numerical experiments are conducted to gain insight into the proposed model. The solutions provide a decision aid stream strengthening the concept of reverse supply network design and analysis for profit-making organization.
Linear programming phase unwrapping for dual-wavelength digital holography.
Wang, Zhaomin; Jiao, Jiannan; Qu, Weijuan; Yang, Fang; Li, Hongru; Tian, Ailing; Asundi, Anand
2017-01-20
A linear programming phase unwrapping method in dual-wavelength digital holography is proposed and verified experimentally. The proposed method uses the square of height difference as a convergence standard and theoretically gives the boundary condition in a searching process. A simulation was performed by unwrapping step structures at different levels of Gaussian noise. As a result, our method is capable of recovering the discontinuities accurately. It is robust and straightforward. In the experiment, a microelectromechanical systems sample and a cylindrical lens were measured separately. The testing results were in good agreement with true values. Moreover, the proposed method is applicable not only in digital holography but also in other dual-wavelength interferometric techniques.
Towards lexicographic multi-objective linear programming using grossone methodology
Cococcioni, Marco; Pappalardo, Massimo; Sergeyev, Yaroslav D.
2016-10-01
Lexicographic Multi-Objective Linear Programming (LMOLP) problems can be solved in two ways: preemptive and nonpreemptive. The preemptive approach requires the solution of a series of LP problems, with changing constraints (each time the next objective is added, a new constraint appears). The nonpreemptive approach is based on a scalarization of the multiple objectives into a single-objective linear function by a weighted combination of the given objectives. It requires the specification of a set of weights, which is not straightforward and can be time consuming. In this work we present both mathematical and software ingredients necessary to solve LMOLP problems using a recently introduced computational methodology (allowing one to work numerically with infinities and infinitesimals) based on the concept of grossone. The ultimate goal of such an attempt is an implementation of a simplex-like algorithm, able to solve the original LMOLP problem by solving only one single-objective problem and without the need to specify finite weights. The expected advantages are therefore obvious.
Directory of Open Access Journals (Sweden)
Muge ADNAN
2017-01-01
Full Text Available Teaching online requires different skills, roles and competencies for online instructors compared to teaching in traditional learning environments. Universities should offer ongoing support in various forms to help academic staff through their online journey. This paper provides insights into a multinational faculty development program for teaching online, elaborating on results of expectancy and satisfaction surveys. From a local program to a subproject within the Swiss National Science Foundation Project Scopes, e-Tutor aimed at expanding competencies in online lecturing and providing OER material for training colleagues. Designed in the form of a descriptive case study, this research was conducted with 34 attendees of e-Tutor. Data was collected using an e-learning readiness and expectancy questionnaire, and open-ended questions after the program to measure satisfaction. Descriptive statistics were used to analyze the survey data and content analysis for open-ended data. Participants considered e-Tutor a well-planned and targeted program with good theoretical and practical balance. Duration of such courses, opportunities for adaptation to real-life situations, and localization of the content are areas to be explored further. For future studies, it would also be interesting to see whether participants can apply their newly acquired knowledge and skills to create efficient online learning environments.
Adaptive PSS using a simple on-line identifier and linear pole-shift controller
Energy Technology Data Exchange (ETDEWEB)
Ramakrishna, G. [Department of Electrical Engineering, University of Saskatchewan, Saskatoon SK S7N 5A9 (Canada); Malik, O.P. [Department of Electrical and Computer Engineering, The University of Calgary, Calgary AB T2N 1N4 (Canada)
2010-04-15
Implementation of an adaptive power system stabilizer (APSS) and experimental studies are presented in this paper. The APSS consists of an adaptive linear element (ADALINE) based identifier that identifies the power system as a third-order discrete auto-regressive moving average (ARMA) model and a pole-shift controller. The ADALINE is modeled so that its weights have a one-to-one relationship with the ARMA model parameters. The weights are updated at each sampling interval to track the dynamic characteristics of the actual system. The on-line updated ARMA parameters are used in the PS control algorithm to calculate the new closed-loop poles of the system that are always inside the unit circle in the z-plane. The calculated control is such that it achieves regulation of the system to a constant setpoint in the shortest interval of time. Experimental studies on a physical model of power system verify that the proposed adaptive PSS effectively damps the oscillations and improves power system stability. (author)
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Ngo, Hung Q; Le, Anh N; Nguyen, Thanh-Nhan
2012-01-01
The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching components so that the design is non-blocking in some sense (e.g., strict- or wide-sense). We show that, in many cases, this task can be accomplished with a simple two-step strategy: (1) formulate a linear program whose optimum value is a bound for the minimum number we are seeking, and (2) specify a solution to the dual program, whose objective value by weak duality immediately yields a sufficient condition for the design to be non-blocking. We illustrate this technique through a variety of examples, ranging from circuit to multirate to photonic switching, from unicast to $f$-cast and multicast, and from strict- to wide-sense non-blocking. The switching architectures in the examples are of Clos-type and Banyan-type, which are the two most popular architectural choices for designing non-blocking switching networks. To prove the result in the multir...
Split diversity in constrained conservation prioritization using integer linear programming.
Chernomor, Olga; Minh, Bui Quang; Forest, Félix; Klaere, Steffen; Ingram, Travis; Henzinger, Monika; von Haeseler, Arndt
2015-01-01
Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.
An overview of solution methods for multi-objective mixed integer linear programming programs
DEFF Research Database (Denmark)
Andersen, Kim Allan; Stidsen, Thomas Riis
Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...
An overview of solution methods for multi-objective mixed integer linear programming programs
DEFF Research Database (Denmark)
Andersen, Kim Allan; Stidsen, Thomas Riis
Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...
Comparison of On-line and F2F Education Methods in Teaching Computer Programming
2013-01-01
lthough online education provides opportunities to people who traditionally do not have access to universities, there is a need for more empirical studies to gain better understanding on how to deliver quality online education, especially when the subject of the course is related with IT. Learning to program is a complicated process. This study aims to find out the difference between students’ performance in online and face-to-face (F2F) settings during a computer programming in the fall seme...
Institute of Scientific and Technical Information of China (English)
Yuanyuan ZOU; Shaoyuan LI
2007-01-01
In this paper,a linear programming method is proposed to solve model predictive control for a class of hybrid systems.Firstly,using the(max,+)algebra,a typical subclass of hybrid systems called max-plus-linear(MPL)systems is obtained.And then,model predictive control(MPC)framework is extended to MPL systems.In general,the nonlinear optimization approach or extended linear complementarity problem(ELCP)were applied to solve the MPL-MPC optimization problem.A new optimization method based on canonical forms for max-min-plus-scaling(MMPS)functions (using the operations maximization,minimization,addition and scalar multiplication)with linear constraints on the inputs is presented.The proposed approach consists in solving several linear programming problems and is more efficient than nonlinear optimization.The validity of the algorithm is illustrated by an example.
Exploring Teaching Programming Online through Web Conferencing System: The Lens of Activity Theory
Çakiroglu, Ünal; Kokoç, Mehmet; Kol, Elvan; Turan, Ebru
2016-01-01
The purpose of this qualitative study was to understand activities and behaviors of learners and instructor in an online programming course. Adobe Connect web conferencing system was used as a delivery platform. A total of fifty-six sophomore students attending a computer education and instructional technology program (online) participated in this…
Canadian Innovation: A Brief History of Canada's First Online School Psychology Graduate Program
Drefs, Michelle A.; Schroeder, Meadow; Hiebert, Bryan; Panayotidis, E. Lisa; Winters, Katherine; Kerr, Jamie
2015-01-01
This article presents a brief historical review and survey of the current landscape of online graduate psychology programs within the Canadian context. Specific focus is given to outlining the establishment and evolution of the first Canadian online professional specialization program in school psychology. The article argues that given the virtual…
Canadian Innovation: A Brief History of Canada's First Online School Psychology Graduate Program
Drefs, Michelle A.; Schroeder, Meadow; Hiebert, Bryan; Panayotidis, E. Lisa; Winters, Katherine; Kerr, Jamie
2015-01-01
This article presents a brief historical review and survey of the current landscape of online graduate psychology programs within the Canadian context. Specific focus is given to outlining the establishment and evolution of the first Canadian online professional specialization program in school psychology. The article argues that given the virtual…
Saltan, Fatih
2017-01-01
Online Algorithm Visualization (OAV) is one of the recent developments in the instructional technology field that aims to help students handle difficulties faced when they begin to learn programming. This study aims to investigate the effect of online algorithm visualization on students' achievement in the introduction to programming course. To…
Exploring Teaching Programming Online through Web Conferencing System: The Lens of Activity Theory
Çakiroglu, Ünal; Kokoç, Mehmet; Kol, Elvan; Turan, Ebru
2016-01-01
The purpose of this qualitative study was to understand activities and behaviors of learners and instructor in an online programming course. Adobe Connect web conferencing system was used as a delivery platform. A total of fifty-six sophomore students attending a computer education and instructional technology program (online) participated in this…
Evaluation of an Online Youth Ambassador Program to Promote Mental Health
Beamish, Nicola; Cannan, Philippa; Fujiyama, Hakuei; Matthews, Allison; Spiranovic, Caroline; Briggs, Kate; Kirkby, Kenneth; Mobsby, Caroline; Daniels, Brett
2011-01-01
This article presents results of an evaluation of an online Youth Ambassador (YA) program designed to promote internet resources for mental health in an adolescent population. Results suggest that an online YA program delivered in school is useful in improving mental health awareness for workshop participants. (Contains 1 table.)
Zhao, Yingfeng; Liu, Sanyang
2016-01-01
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of so...
Petersen, Cheryl L; Callahan, Margaret Faut; McCarthy, Donna O; Hughes, Ronda G; White-Traut, Rosemary; Bansal, Naveen K
This study evaluated the potential impact of an online spiritual care educational program on pediatric nurses' attitudes toward and knowledge of spiritual care and their competence to provide spiritual care to children with cancer at the end of life. It was hypothesized that the intervention would increase nurses' positive attitudes toward and knowledge of spiritual care and increase nurses' level of perceived spiritual care competence. A positive correlation was expected between change in nurses' perceived attitudes toward and knowledge of spiritual care and change in nurses' perceived spiritual care competence. A prospective, longitudinal design was employed, and analyses included one-way repeated-measures analysis of variance, linear regression, and partial correlation. Statistically significant differences were found in nurses' attitudes toward and knowledge of spiritual care and nurses' perceived spiritual care competence. There was a positive relationship between change scores in nurses' attitudes toward and knowledge of spiritual care and nurses' spiritual care competence. Online spiritual care educational programs may exert a lasting impact on nurses' attitudes toward and knowledge of spiritual care and their competence to provide spiritual care to children with cancer at the end of life. Additional studies are required to evaluate the direct effects of educational interventions patient outcomes.
Directory of Open Access Journals (Sweden)
Arroll MA
2014-09-01
Full Text Available Megan A Arroll, Elizabeth A Attree, Claire L Marshall, Christine P DanceyChronic Illness Research Team, School of Psychology, University of East London, London, UKBackground: Myalgic encephalomyelitis/chronic fatigue syndrome (ME/CFS is a long-term, debilitating condition that impacts numerous areas of individuals' lives. The two predominant treatment options for ME/CFS are cognitive behavioral therapy and graded exercise therapy; however, many people have found these techniques unacceptable or even damaging. This pilot study aimed to evaluate the utility of a specialized online symptom management program for ME/CFS in comparison to an online meditation program in an effort to ascertain whether this tool could be a further option for those with ME/CFS.Methods: This experimental design consisted of two interventions: a specialized online symptoms management program (N=19 and a control intervention based on an online meditation website (N=9. A battery of questionnaires, including measures of multidimensional fatigue, illness-specific symptoms, perceived control, and mindful awareness, were completed before the participants commenced use of the programs and following 8 weeks' use.Results: Significant differences were found in the areas of chance and powerful others' locus of control, and sleeping difficulties, but not in ME/CFS symptomatology overall.Conclusion: The specialized online program described in this study warrants further investigation, as it appears to influence perceived control and key ME/CFS symptoms over time.Keywords: ME/CFS, perceived control, sleep, outcomes, online intervention
Near-Regular Structure Discovery Using Linear Programming
Huang, Qixing
2014-06-02
Near-regular structures are common in manmade and natural objects. Algorithmic detection of such regularity greatly facilitates our understanding of shape structures, leads to compact encoding of input geometries, and enables efficient generation and manipulation of complex patterns on both acquired and synthesized objects. Such regularity manifests itself both in the repetition of certain geometric elements, as well as in the structured arrangement of the elements. We cast the regularity detection problem as an optimization and efficiently solve it using linear programming techniques. Our optimization has a discrete aspect, that is, the connectivity relationships among the elements, as well as a continuous aspect, namely the locations of the elements of interest. Both these aspects are captured by our near-regular structure extraction framework, which alternates between discrete and continuous optimizations. We demonstrate the effectiveness of our framework on a variety of problems including near-regular structure extraction, structure-preserving pattern manipulation, and markerless correspondence detection. Robustness results with respect to geometric and topological noise are presented on synthesized, real-world, and also benchmark datasets. © 2014 ACM.
Setting Inventory Levels of CONWIP Flow Lines via Linear Programming
Directory of Open Access Journals (Sweden)
Stefan Helber
2011-04-01
Full Text Available This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011 for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.
Fitting boxes to Manhattan scenes using linear integer programming
Li, Minglei
2016-02-19
We propose an approach for automatic generation of building models by assembling a set of boxes using a Manhattan-world assumption. The method first aligns the point cloud with a per-building local coordinate system, and then fits axis-aligned planes to the point cloud through an iterative regularization process. The refined planes partition the space of the data into a series of compact cubic cells (candidate boxes) spanning the entire 3D space of the input data. We then choose to approximate the target building by the assembly of a subset of these candidate boxes using a binary linear programming formulation. The objective function is designed to maximize the point cloud coverage and the compactness of the final model. Finally, all selected boxes are merged into a lightweight polygonal mesh model, which is suitable for interactive visualization of large scale urban scenes. Experimental results and a comparison with state-of-the-art methods demonstrate the effectiveness of the proposed framework.
Mixed integer linear programming for maximum-parsimony phylogeny inference.
Sridhar, Srinath; Lam, Fumei; Blelloch, Guy E; Ravi, R; Schwartz, Russell
2008-01-01
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue to make effective use of the rapidly growing stores of variation data now being gathered. In this paper, we present two integer linear programming (ILP) formulations to find the most parsimonious phylogenetic tree from a set of binary variation data. One method uses a flow-based formulation that can produce exponential numbers of variables and constraints in the worst case. The method has, however, proven extremely efficient in practice on datasets that are well beyond the reach of the available provably efficient methods, solving several large mtDNA and Y-chromosome instances within a few seconds and giving provably optimal results in times competitive with fast heuristics than cannot guarantee optimality. An alternative formulation establishes that the problem can be solved with a polynomial-sized ILP. We further present a web server developed based on the exponential-sized ILP that performs fast maximum parsimony inferences and serves as a front end to a database of precomputed phylogenies spanning the human genome.
Learning oncogenetic networks by reducing to mixed integer linear programming.
Shahrabi Farahani, Hossein; Lagergren, Jens
2013-01-01
Cancer can be a result of accumulation of different types of genetic mutations such as copy number aberrations. The data from tumors are cross-sectional and do not contain the temporal order of the genetic events. Finding the order in which the genetic events have occurred and progression pathways are of vital importance in understanding the disease. In order to model cancer progression, we propose Progression Networks, a special case of Bayesian networks, that are tailored to model disease progression. Progression networks have similarities with Conjunctive Bayesian Networks (CBNs) [1],a variation of Bayesian networks also proposed for modeling disease progression. We also describe a learning algorithm for learning Bayesian networks in general and progression networks in particular. We reduce the hard problem of learning the Bayesian and progression networks to Mixed Integer Linear Programming (MILP). MILP is a Non-deterministic Polynomial-time complete (NP-complete) problem for which very good heuristics exists. We tested our algorithm on synthetic and real cytogenetic data from renal cell carcinoma. We also compared our learned progression networks with the networks proposed in earlier publications. The software is available on the website https://bitbucket.org/farahani/diprog.
Dense image registration through MRFs and efficient linear programming.
Glocker, Ben; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir; Paragios, Nikos
2008-12-01
In this paper, we introduce a novel and efficient approach to dense image registration, which does not require a derivative of the employed cost function. In such a context, the registration problem is formulated using a discrete Markov random field objective function. First, towards dimensionality reduction on the variables we assume that the dense deformation field can be expressed using a small number of control points (registration grid) and an interpolation strategy. Then, the registration cost is expressed using a discrete sum over image costs (using an arbitrary similarity measure) projected on the control points, and a smoothness term that penalizes local deviations on the deformation field according to a neighborhood system on the grid. Towards a discrete approach, the search space is quantized resulting in a fully discrete model. In order to account for large deformations and produce results on a high resolution level, a multi-scale incremental approach is considered where the optimal solution is iteratively updated. This is done through successive morphings of the source towards the target image. Efficient linear programming using the primal dual principles is considered to recover the lowest potential of the cost function. Very promising results using synthetic data with known deformations and real data demonstrate the potentials of our approach.
Accurate construction of consensus genetic maps via integer linear programming.
Wu, Yonghui; Close, Timothy J; Lonardi, Stefano
2011-01-01
We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which is a directed graph that includes and is consistent with all (or, the vast majority of) the markers in the input maps. However, when markers in the individual maps have ordering conflicts, the resulting consensus map will contain cycles. Here, we formulate the problem of resolving cycles in the context of a parsimonious paradigm that takes into account two types of errors that may be present in the input maps, namely, local reshuffles and global displacements. The resulting combinatorial optimization problem is, in turn, expressed as an integer linear program. A fast approximation algorithm is proposed, and an additional speedup heuristic is developed. Our algorithms were implemented in a software tool named MERGEMAP which is freely available for academic use. An extensive set of experiments shows that MERGEMAP consistently outperforms JOINMAP, which is the most popular tool currently available for this task, both in terms of accuracy and running time. MERGEMAP is available for download at http://www.cs.ucr.edu/~yonghui/mgmap.html.
Maximum likelihood pedigree reconstruction using integer linear programming.
Cussens, James; Bartlett, Mark; Jones, Elinor M; Sheehan, Nuala A
2013-01-01
Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible.
Preparing Future Geoscience Professionals: Needs, Strategies, Programs, and Online Resources
Macdonald, H.; Manduca, C. A.; Ormand, C. J.; Dunbar, R. W.; Beane, R. J.; Bruckner, M.; Bralower, T. J.; Feiss, P. G.; Tewksbury, B. J.; Wiese, K.
2011-12-01
Geoscience faculty, departments, and programs play an important role in preparing future geoscience professionals. One challenge is supporting the diversity of student goals for future employment and the needs of a wide range of potential employers. Students in geoscience degree programs pursue careers in traditional geoscience industries; in geoscience education and research (including K-12 teaching); and opportunities at the intersection of geoscience and other fields (e.g., policy, law, business). The Building Strong Geoscience Departments project has documented a range of approaches that departments use to support the development of geoscience majors as professionals (serc.carleton.edu/departments). On the Cutting Edge, a professional development program, supports graduate students and post-doctoral fellows interested in pursuing an academic career through workshops, webinars, and online resources (serc.carleton.edu/NAGTWorkshops/careerprep). Geoscience departments work at the intersection of student interests and employer needs. Commonly cited program goals that align with employer needs include mastery of geoscience content; field experience; skill in problem solving, quantitative reasoning, communication, and collaboration; and the ability to learn independently and take a project from start to finish. Departments and faculty can address workforce issues by 1) implementing of degree programs that develop the knowledge, skills, and attitudes that students need, while recognizing that students have a diversity of career goals; 2) introducing career options to majors and potential majors and encouraging exploration of options; 3) advising students on how to prepare for specific career paths; 4) helping students develop into professionals, and 5) supporting students in the job search. It is valuable to build connections with geoscience employers, work with alumni and foster connections between students and alumni with similar career interests, collaborate with
A Novel Tabular Form of the Simplex Method for Solving Linear Programming Problems
Directory of Open Access Journals (Sweden)
Akaninyene Obot
2016-01-01
Full Text Available A new tabular form of the simplex method for solving linear programming problems is presented in this paper. There are many variants of the simplex method. The existing different tabular forms of the simplex method are difficult to comprehend, boring, not straight forward, confusing and tedious. The results obtained based on the proposed method are simpler and computationally more efficient for calculations of linear programs, than other competing simplex methods by other writers. The proposed method could be applied to solve Operations Research based problems in fuzzy linear programming, goal programming, transportation and assignment problems, game problems, and for carrying out sensitivity analysis in linear programming.
A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media
DEFF Research Database (Denmark)
Manik, Prerna; Gupta, Anshu; Jha, P. C.
2016-01-01
for several websites that provide free services to internet users. The website management team needs to do a lot of planning and optimally schedule various advertisements (ads) to maximize revenue, taking care of advertisers' needs under system constraints. In this paper, we have considered the case of news...... banners. Many ads compete with each other for their placement on a webpage on a specific banner, based on partition requirement, at specific time interval(s). Here, we have formulated a mixed integer 0-1 linear programming advertisement scheduling problem to maximize the revenue over planning horizon......Digital revolution has resulted in a paradigm shift in the field of marketing with online advertising becoming increasingly popular as it offers the reach, range, scale and interactivity to organizations to influence their target customers. Moreover, web advertisement is the primary revenue stream...
Optimizing Biorefinery Design and Operations via Linear Programming Models
Energy Technology Data Exchange (ETDEWEB)
Talmadge, Michael; Batan, Liaw; Lamers, Patrick; Hartley, Damon; Biddy, Mary; Tao, Ling; Tan, Eric
2017-03-28
The ability to assess and optimize economics of biomass resource utilization for the production of fuels, chemicals and power is essential for the ultimate success of a bioenergy industry. The team of authors, consisting of members from the National Renewable Energy Laboratory (NREL) and the Idaho National Laboratory (INL), has developed simple biorefinery linear programming (LP) models to enable the optimization of theoretical or existing biorefineries. The goal of this analysis is to demonstrate how such models can benefit the developing biorefining industry. It focuses on a theoretical multi-pathway, thermochemical biorefinery configuration and demonstrates how the biorefinery can use LP models for operations planning and optimization in comparable ways to the petroleum refining industry. Using LP modeling tools developed under U.S. Department of Energy's Bioenergy Technologies Office (DOE-BETO) funded efforts, the authors investigate optimization challenges for the theoretical biorefineries such as (1) optimal feedstock slate based on available biomass and prices, (2) breakeven price analysis for available feedstocks, (3) impact analysis for changes in feedstock costs and product prices, (4) optimal biorefinery operations during unit shutdowns / turnarounds, and (5) incentives for increased processing capacity. These biorefinery examples are comparable to crude oil purchasing and operational optimization studies that petroleum refiners perform routinely using LPs and other optimization models. It is important to note that the analyses presented in this article are strictly theoretical and they are not based on current energy market prices. The pricing structure assigned for this demonstrative analysis is consistent with $4 per gallon gasoline, which clearly assumes an economic environment that would favor the construction and operation of biorefineries. The analysis approach and examples provide valuable insights into the usefulness of analysis tools for
A Review of Walden University's Online MSED Science (K-8) Program
Iadevaia, David G.
2010-01-01
This review is based on the experience of an adjunct professor teaching in the Walden University online MSED Science (K-8) program. The program described by Walden University and the actual implementation of the science component of the program as experienced by the Professor will be presented. The program, while a noble attempt at a completely…
Gibson, Jane Whitney; Herrera, Jorge M.
1999-01-01
Describes the experiences at Nova Southeastern University (Florida) in designing and implementing a Web-based online undergraduate program using full-time faculty and an existing course of studies. Explains the initial pilot program and provides guidelines for designing complete online programs. (LRW)
A New Method for Solving Fuzzy Linear Programs with Trapezoidal Fuzzy Numbers
Directory of Open Access Journals (Sweden)
Jagdeep Kaur
2011-12-01
Full Text Available Ganesan and Veeramani [Fuzzy linear programs with trapezoidal fuzzy numbers, Annals of Operations Research 143 (2006 305-315.] proposed a new method for solving a special type of fuzzy linear programming problems. In this paper a new method, named as Mehar's method, is proposed for solving the same type of fuzzy linear programming problems and it is shown that it is easy to apply the Mehar's method as compared to the existing method for solving the same type of fuzzy linear programming problems.
Frost, Susan A.; Bodson, Marc; Acosta, Diana M.
2009-01-01
The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.
Developing a Successful Online RN to BSN Program.
Stotts, Cheryl; Smith, Richard; Edwards-Schafer, Patricia; Schmidt, Cheryl; Smith, Jo Ann
In 1999, the University of Arkansas for Medical Sciences College of Nursing received a 5-year grant from the U.S. Health Resources and Service Administration to provide online baccalaureate completion courses for RNs (Registered Nurses). At the completion of the first year, all six theory courses were offered online. Clinical courses are offered…
Quality Matters: A Faculty-Centred Program to Assure Quality in Online Course Design
Shattuck, Kay
2010-01-01
One of the dilemmas faced by today's faculty is assuring quality in online courses. As one solution to that dilemma, Quality Matters (QM), a program of MarylandOnline, built a rubric of design standards informed by existing research literature and best practices. The rubric was implemented within a faculty-centred, peer review process in which…
A Review of Paradigms for Evaluating the Quality of Online Education Programs
Shelton, Kaye
2011-01-01
As the demands for public accountability increase for higher education, institutions must demonstrate quality within programs and processes, including those provided through online education. While quality may be elusive to specifically quantify, there have been several recommendations for identifying and defining quality online education that…
A Quality Scorecard for the Administration of Online Education Programs: A Delphi Study
Shelton, Kaye
2010-01-01
As the demands for public accountability increase for the higher education, institutions are seeking methods for continuous improvement in order to demonstrate quality within programs and processes, including those provided through online education. A six round Delphi study was undertaken with 43 seasoned administrators of online education…
A two-phase linear programming approach for redundancy allocation problems
Directory of Open Access Journals (Sweden)
Hsieh Yi-Chih
2002-01-01
Full Text Available Provision of redundant components in parallel is an efficient way to increase the system reliability, however, the weight, volume and cost of the system will increase simultaneously. This paper proposes a new two-phase linear programming approach for solving the nonlinear redundancy allocation problems subject to multiple linear constraints. The first phase is used to approximately allocate the resource by using a general linear programming, while the second phase is used to re-allocate the slacks of resource by using a 0-1 integer linear programming. Numerical results demonstrate the effectiveness and efficiency of the proposed approach.
Gorissen, B.L.; Blanc, J.P.C.; den Hertog, D.; Ben-Tal, A.
We propose a new way to derive tractable robust counterparts of a linear program based on the duality between the robust (“pessimistic”) primal problem and its “optimistic” dual. First we obtain a new convex reformulation of the dual problem of a robust linear program, and then show how to construct
DEFF Research Database (Denmark)
Parlesak, Alexandr; Tetens, Inge; Jensen, Jørgen Dejgård;
2016-01-01
using linear programming. The FBs were defined depending on the type of constraints applied: cultural acceptability (C), or dietary guidelines (D), or nutrient recommendations (N), or cultural acceptability and nutrient recommendations (CN), or dietary guidelines and nutrient recommendations (DN......: Use of linear programming facilitates the generation of low-cost food baskets that are nutritionally adequate, health promoting, and culturally acceptable....
MARKETING ONLINE EDUCATION PROGRAMS FRAMEWORKS FOR PROMOTION AND COMMUNICATION
Directory of Open Access Journals (Sweden)
Reviewed by R.Ayhan YILMAZ
2011-07-01
Full Text Available Topics of the book is cover on building corporate identity for educational institutions, cultural and regional issues in educational product development, Defining the role of online education in today‘s world, individualization of open educational services, integrated marketing communications, measuring the impact of educational promotions, new customers and new demands, open and Distance education, reputation issues in online education and sustainable communication before, during and after enrollment
Integrating Data Mining in Program Evaluation of K-12 Online Education
Hung, Jui-Long; Hsu, Yu-Chang; Rice, Kerry
2012-01-01
This study investigated an innovative approach of program evaluation through analyses of student learning logs, demographic data, and end-of-course evaluation surveys in an online K-12 supplemental program. The results support the development of a program evaluation model for decision making on teaching and learning at the K-12 level. A case study…
A linear circuit analysis program with stiff systems capability
Cook, C. H.; Bavuso, S. J.
1973-01-01
Several existing network analysis programs have been modified and combined to employ a variable topological approach to circuit translation. Efficient numerical integration techniques are used for transient analysis.
MARKETING COMMUNICATION IN ONLINE SOCIAL PROGRAMS: OHANIAN MODEL OF SOURCE CREDIBILITY
Directory of Open Access Journals (Sweden)
Serban Corina
2010-07-01
Full Text Available The development of the Internet as a medium for interaction with customers has resulted in many changes regarding the promotion of organizations. Online marketing is nowadays used not only to sell a product on the market, but also requires ideas and behavioral change. Non-profit organizations active in online communication are based on the quality of their provided information. Crediblity, attractiveness and usefullness are the key elements that provide effective online social programs. This paper aims to extend the scope of research in the field of social marketing by studying the Ohanian model in the online environment. The goal is to highlight the important theories and social models intrinsic to the online non-profit organizations’ communication. The results show that the efficiency of social programs depends on the level of incorporated elements of social theories in the design, content and structure of the website.
Converting to Online Course and Program Delivery: The University of South Australia Case Study
Directory of Open Access Journals (Sweden)
Bruce King
2001-01-01
Full Text Available The University of South Australia's (UniSA approach to converting its distance education programs to online delivery is to manage it as a part of establishing an online teaching and learning environment for all of its programs. UniSA's move to online teaching and learning derives from a clear vision of its future, is informed and directed by a comprehensive framework for teaching and learning, and enabled by appropriate structures, processes and resources. The institution has chosen to develop a relatively low-cost, easy to use online teaching and learning environment that has facilitated large-scale conversion to the online mode for all teaching and learning, including traditional distance education.
Boundary Control of Linear Uncertain 1-D Parabolic PDE Using Approximate Dynamic Programming.
Talaei, Behzad; Jagannathan, Sarangapani; Singler, John
2017-03-02
This paper develops a near optimal boundary control method for distributed parameter systems governed by uncertain linear 1-D parabolic partial differential equations (PDE) by using approximate dynamic programming. A quadratic surface integral is proposed to express the optimal cost functional for the infinite-dimensional state space. Accordingly, the Hamilton-Jacobi-Bellman (HJB) equation is formulated in the infinite-dimensional domain without using any model reduction. Subsequently, a neural network identifier is developed to estimate the unknown spatially varying coefficient in PDE dynamics. Novel tuning law is proposed to guarantee the boundedness of identifier approximation error in the PDE domain. A radial basis network (RBN) is subsequently proposed to generate an approximate solution for the optimal surface kernel function online. The tuning law for near optimal RBN weights is created, such that the HJB equation error is minimized while the dynamics are identified and closed-loop system remains stable. Ultimate boundedness (UB) of the closed-loop system is verified by using the Lyapunov theory. The performance of the proposed controller is successfully confirmed by simulation on an unstable diffusion-reaction process.
An Adaptive Linear Approximation Algorithm for Copositive Programs
Bundfuss, Stefan; Dur, Mirjam
2009-01-01
We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer
A customizable evaluation instrument to facilitate comparisons of existing online training programs
Directory of Open Access Journals (Sweden)
Cheryl A. Murphy
2013-09-01
Full Text Available A proliferation of retail online training materials exists, but often the person in charge of choosing the most appropriate online training materials is not versed in best practices associated with online training. Additionally, the person must consider the context of the training situation when choosing a training solution. To assist this decision-making process an evaluation instrument was developed. The instrument was designed to help decision-makers 1 assess multiple online training programs against known best practices, and 2 consider context specific training needs via a weighting process. Instrument testing across multiple online training programs was performed, and weighted and unweighted results were examined to determine the impact of contextualized weighting. Additionally, evaluation data from the new instrument were compared to data from an existing online training evaluation instrument. Results indicated the new instrument allowed for consistent rankings by raters across multiple programs, and when the new weighting process was applied small differences were magnified making them more noticeable in overall rating scores. Thus the new weighted instrument was effective in 1 assessing multiple online training programs, and 2 providing reviewers clearer context-specific rating data on which they could make purchasing decisions.
Boulay, Rachel
2013-01-01
A well-accepted form of educational training offered in molecular biology is internships in research laboratories. However, the number of available research laboratories severely limits access by most students. Addressing this need, the University of Hawaii launched a project to expand this model to include newly developed online training materials in addition to a hands-on laboratory experience. This paper explores the design and development process of the online learning materials. This case study looks at the roles of the instructional designer, multimedia specialist, and research faculty who were the subject matter experts. The experiences of the design teams are shared in an effort to gain insight on how the collaborative efforts of the project group led to a successful deployment of the online learning materials.
Application of linear programming techniques for controlling linear dynamic plants in real time
Gabasov, R.; Kirillova, F. M.; Ha, Vo Thi Thanh
2016-03-01
The problem of controlling a linear dynamic plant in real time given its nondeterministic model and imperfect measurements of the inputs and outputs is considered. The concepts of current distributions of the initial state and disturbance parameters are introduced. The method for the implementation of disclosable loop using the separation principle is described. The optimal control problem under uncertainty conditions is reduced to the problems of optimal observation, optimal identification, and optimal control of the deterministic system. To extend the domain where a solution to the optimal control problem under uncertainty exists, a two-stage optimal control method is proposed. Results are illustrated using a dynamic plant of the fourth order.
Global optimization over linear constraint non-convex programming problem
Institute of Scientific and Technical Information of China (English)
ZHANG Gui-Jun; WU Ti-Huan; YE Rong; YANG Hai-qing
2005-01-01
A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programmin g problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.
Cole-Cole, linear and multivariate modeling of capacitance data for on-line monitoring of biomass.
Dabros, Michal; Dennewald, Danielle; Currie, David J; Lee, Mark H; Todd, Robert W; Marison, Ian W; von Stockar, Urs
2009-02-01
This work evaluates three techniques of calibrating capacitance (dielectric) spectrometers used for on-line monitoring of biomass: modeling of cell properties using the theoretical Cole-Cole equation, linear regression of dual-frequency capacitance measurements on biomass concentration, and multivariate (PLS) modeling of scanning dielectric spectra. The performance and robustness of each technique is assessed during a sequence of validation batches in two experimental settings of differing signal noise. In more noisy conditions, the Cole-Cole model had significantly higher biomass concentration prediction errors than the linear and multivariate models. The PLS model was the most robust in handling signal noise. In less noisy conditions, the three models performed similarly. Estimates of the mean cell size were done additionally using the Cole-Cole and PLS models, the latter technique giving more satisfactory results.
An Online Bystander Intervention Program for the Prevention of Sexual Violence.
Kleinsasser, Anne; Jouriles, Ernest N; McDonald, Renee; Rosenfield, David
2015-07-01
Because of its high prevalence and serious consequences for victims, sexual violence is a significant problem on college campuses. Sexual assault prevention programs based on the bystander intervention model have been shown to be effective; however, current programs are limited in terms of ease of distribution. To address this issue, we developed and evaluated "Take Care," an online bystander intervention program. To our knowledge, this is the first empirical evaluation of an online bystander intervention program designed to prevent sexual violence. Ninety-three participants (80.6% female, 19.4% male) recruited from social psychology classes at a mid-size university were randomly assigned to view one of two online programs: Take Care or a control program on study skills. Before viewing the programs, participants completed measures of bystander behaviors and feelings of efficacy for performing such behaviors. Measures were administered again post-intervention and at a two-month follow-up assessment. Participants who viewed Take Care reported greater efficacy for engaging in bystander behaviors at post-treatment and two months following treatment, compared to those who viewed the control program. In addition, participants who viewed Take Care reported performing relatively more bystander behaviors for friends at the two-month follow-up assessment, compared to participants who viewed the control program. These results suggest that sexual violence prevention programs may be effectively adapted to an online format.
A linear programming approach for placement of applicants to academic programs.
Kassa, Biniyam Asmare
2013-01-01
This paper reports a linear programming approach for placement of applicants to study programs developed and implemented at the college of Business & Economics, Bahir Dar University, Bahir Dar, Ethiopia. The approach is estimated to significantly streamline the placement decision process at the college by reducing required man hour as well as the time it takes to announce placement decisions. Compared to the previous manual system where only one or two placement criteria were considered, the new approach allows the college's management to easily incorporate additional placement criteria, if needed. Comparison of our approach against manually constructed placement decisions based on actual data for the 2012/13 academic year suggested that about 93 percent of the placements from our model concur with the actual placement decisions. For the remaining 7 percent of placements, however, the actual placements made by the manual system display inconsistencies of decisions judged against the very criteria intended to guide placement decisions by the college's program management office. Overall, the new approach proves to be a significant improvement over the manual system in terms of efficiency of the placement process and the quality of placement decisions.
Potential function methods for approximately solving linear programming problems theory and practice
Bienstock, Daniel
2002-01-01
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.
Developing a Successful Asynchronous Online Extension Program for Forest Landowners
Zobrist, Kevin W.
2014-01-01
Asynchronous online Extension classes can reach a wide audience, is convenient for the learner, and minimizes ongoing demands on instructor time. However, producing such classes takes significant effort up front. Advance planning and good communication with contributors are essential to success. Considerations include delivery platforms, content…
Indarsih, Indrati, Ch. Rini
2016-02-01
In this paper, we define variance of the fuzzy random variables through alpha level. We have a theorem that can be used to know that the variance of fuzzy random variables is a fuzzy number. We have a multi-objective linear programming (MOLP) with fuzzy random of objective function coefficients. We will solve the problem by variance approach. The approach transform the MOLP with fuzzy random of objective function coefficients into MOLP with fuzzy of objective function coefficients. By weighted methods, we have linear programming with fuzzy coefficients and we solve by simplex method for fuzzy linear programming.
Image Enhancement Using Linear Programming Method for High Dynamic Range Image
Directory of Open Access Journals (Sweden)
S. Yamini
2014-01-01
Full Text Available Now a days in Telecommunication areas the contrast gain is considered as a major constraints. For the enhancement purpose, the technique called Histogram Equalization is involved, but due to over enhancement and not such gain is been obtained. So that for the OCTM is been proposed, where the constraints of HE is been rectified. OCTM gives better efficiency and it is been solved by Linear programming. In this paper the enhancement of HDR Image using linear Programming is done. According to it HDR Image is constructed using the multiple exposures and its contrast is enhanced using the OCTM method using Linear Programming.
Diet models with linear goal programming: impact of achievement functions
Gerdessen, J.C.; Vries, de J.H.M.
2015-01-01
Background/Objectives: Diet models based on goal programming (GP) are valuable tools in designing diets that comply with nutritional, palatability and cost constraints. Results derived from GP models are usually very sensitive to the type of achievement function that is chosen. This paper aims to pr
FACILITATORS' PERCEPTION OF INTERACTIONS IN AN ONLINE LEARNING PROGRAM
Directory of Open Access Journals (Sweden)
Hasan CALISKAN
2009-07-01
Full Text Available Schools and colleges all around the world have started making use of advanced technology to provide learners effective, efficient and adequate instruction. The use of Internet and Web for learning and teaching has caused many online courses to be offered when teaching-learning activities are required for both students and faculty. The Internet has shown a rapid and important growth in the extent of online education. This has created a new paradigm for teaching and learning that is different from the traditional classroom experience and also different from earlier technology-based attempts (Kearsley, 1998. One of the most important online course components has proven to be interaction, especially learner to learner interaction. Alexander C. lists the top ten ranking components of an optimal online environment, giving peer interaction the first place. Kearsley (1998 also states that discussions among learners are among the most important components. This is not surprising because one of the most important factors in learning appears to be interaction among learners and interaction between instructor and learners. No matter how learning takes place, interaction has always been of great importance so that an effective learning can occur. Especially when instruction is given to learners learning at a distance, this interaction component is of vital importance. Having the lack of social interaction, learners may feel alone and helpless at times they need to get help from someone, especially from their peers taking same course as in any traditional classrooms. Studies suggest that facilitators’ active interactions with students have significant effects on the quality of online distance learning (Thomas, Caswell, Price & Petre, 1998.
Comparison of On-line and F2F Education Methods in Teaching Computer Programming
Directory of Open Access Journals (Sweden)
Sevinç Gülseçen
2013-08-01
Full Text Available lthough online education provides opportunities to people who traditionally do not have access to universities, there is a need for more empirical studies to gain better understanding on how to deliver quality online education, especially when the subject of the course is related with IT. Learning to program is a complicated process. This study aims to find out the difference between students’ performance in online and face-to-face (F2F settings during a computer programming in the fall semester of the year 2010. The study was conducted at the Department of Mathematics, Faculty of Science, Istanbul University. This online course is one of the required courses for students majoring in Mathematics. It is delivered in a learning management system developed in house through a project funded by Istanbul University. The goal is to introduce students with structured programming using the programming language C. Two topics -“Functions in C Programming” and “Loops in C Programming” - were presented to students online and F2F. The total of 62 students formed two groups: the online and F2F groups. The content analysis statistical technique is used, as well as a questionnaire consisting of open-ended questions, which performed as a data collection tool to find out the views of the students in context to the process. While some results concluded that the performance of online students was satisfactory, but that their aggregate final grade was significantly lower than that of students who took an equivalent F2F class, others arrived at a conclusion reporting that there were no significant differences in overall outcomes. In case of making transition from F2F to online mode of teaching, prepossession about a new way of teaching is always an important barrier in students’ perceptions. One of the further researches is investigation of strategies for incorporating blended learning opportunities in programming courses.
Undergrad and Overweight: An Online Behavioral Weight Management Program for College Students
Harvey-Berino, Jean; Pope, Lizzy; Gold, Beth Casey; Leonard, Heather; Belliveau, Cynthia
2012-01-01
Objective: Explore the feasibility of an online behavioral weight management program for college students. Methods: The program focused on behavioral strategies to modify eating and exercise behaviors of students interested in losing weight and/or developing a healthy lifestyle. Specific tools included weekly chat meetings with a facilitator,…
The Impact Factor: Measuring Student Professional Growth in an Online Doctoral Program
Kumar, Swapna; Dawson, Kara
2014-01-01
This article describes the impact of an online Ed.D. in educational technology based on data collected from students at regular intervals during the program. It documents how students who were working professionals applied learning from the program within their practice, enculturated into the educational technology community, and grew…
Pilot Test of Standup, an Online School-Based Bullying Prevention Program
Timmons-Mitchell, Jane; Levesque, Deborah A.; Harris, Leon A., III.; Flannery, Daniel J.; Falcone, Tatiana
2016-01-01
Bullying is a significant public health problem for students in schools. Prevention programs have addressed targets with some success; however, meta-analyses find small effects among older youths. A pilot study was conducted with high school students to evaluate the potential efficacy of StandUp, a three-session online program that delivers…
Do Adherence Variables Predict Outcome in an Online Program for the Prevention of Eating Disorders?
Manwaring, Jamie L.; Bryson, Susan W.; Goldschmidt, Andrea B.; Winzelberg, Andrew J.; Luce, Kristine H.; Cunning, Darby; Wilfley, Denise E.; Taylor, C. Barr
2008-01-01
Unlike traditional interventions, Internet interventions allow for objective tracking and examination of the usage of program components. Student Bodies (SB), an online eating disorder (ED) prevention program, significantly reduced ED attitudes/behaviors in college-aged women with high body image concerns, and reduced the development of EDs in…
Assess the Impact of an Online Tobacco Prevention Training Program on Teachers and Their Students
Chen, W. William; Sheu, Jiunn-Jye; Weng, Chung-Bang
2013-01-01
School-based tobacco prevention programs have been proven effective in reducing tobacco use. This evaluation aimed to assess the impact of an online tobacco prevention teacher training program on teachers and their students in Florida schools. A total of 344 teachers, including 72 K-3 grade teachers, 44 4th-5th grade teachers, and 228 6th-12th…
Impact of Online Summer Mathematics Bridge Program on Placement Scores and Pass Rates
Frost, Jodi L.; Dreher, J. P.
2017-01-01
An online four-week summer mathematics bridge program was implemented at a Midwest university with historically low pass rates in College Algebra and Remedial Mathematics. Students who completed the four week program significantly increased their mathematics placement exam scores. These students also had a higher pass rate in their initial college…
Undergrad and Overweight: An Online Behavioral Weight Management Program for College Students
Harvey-Berino, Jean; Pope, Lizzy; Gold, Beth Casey; Leonard, Heather; Belliveau, Cynthia
2012-01-01
Objective: Explore the feasibility of an online behavioral weight management program for college students. Methods: The program focused on behavioral strategies to modify eating and exercise behaviors of students interested in losing weight and/or developing a healthy lifestyle. Specific tools included weekly chat meetings with a facilitator,…
Pilot Test of Standup, an Online School-Based Bullying Prevention Program
Timmons-Mitchell, Jane; Levesque, Deborah A.; Harris, Leon A., III.; Flannery, Daniel J.; Falcone, Tatiana
2016-01-01
Bullying is a significant public health problem for students in schools. Prevention programs have addressed targets with some success; however, meta-analyses find small effects among older youths. A pilot study was conducted with high school students to evaluate the potential efficacy of StandUp, a three-session online program that delivers…
Zuidema, R.M.; Gaal, B.G.I.; Dulmen, S. van; Repping-Wuts, H.; Schoonhoven, L.
2015-01-01
Background: Every day rheumatoid arthritis (RA) patients make many decisions about managing their disease. An online, computer-tailored, self-management program can support this decision making, but development of such a program requires the active participation of patients. Objective: To develop an
Chambers, Sharon M.; Wickersham, Leah E.
2008-01-01
Results from the survey of faculty who teach in an alternative teacher certification program provided a framework to develop a holistic programmatic assessment of student learning outcomes for a newly developed online program. Research highlights the process of determining student learning outcomes identification and appropriate courses and best…
Do Adherence Variables Predict Outcome in an Online Program for the Prevention of Eating Disorders?
Manwaring, Jamie L.; Bryson, Susan W.; Goldschmidt, Andrea B.; Winzelberg, Andrew J.; Luce, Kristine H.; Cunning, Darby; Wilfley, Denise E.; Taylor, C. Barr
2008-01-01
Unlike traditional interventions, Internet interventions allow for objective tracking and examination of the usage of program components. Student Bodies (SB), an online eating disorder (ED) prevention program, significantly reduced ED attitudes/behaviors in college-aged women with high body image concerns, and reduced the development of EDs in…
Goodfellow, Linda M
2014-10-01
A descriptive online survey design was used to describe professional socialization of students enrolled in an online Doctor of Philosophy (PhD) program in nursing. Twenty-six (48%) of 54 students participated by completing the Doctoral Student Socialization Questionnaire. Activities associated with four of the six dimensions of professional socialization, including student-peer interactions, supportive faculty environment, collegiality, and student scholarly encouragement, were prevalent in the analysis. Activities associated with student-faculty interactions and preparation in scholarly activities were evident but were not prevalent. Students in an online PhD program in nursing can be socialized to the graduate school environment, as well as to their future role in an academic setting. Although challenging in the online environment, faculty need to promote activities related to student-faculty interactions and preparation in scholarly activities.
Using a strengths model to build an on-line nursing education program.
Wieck, K Lynn; Alfred, Danita; Haas, Barbara K; Yarbrough, Susan
2014-01-01
The on-line environment is the new frontier for academia struggling to define its place in the evolving economy. A concern is how to engage students who maximize their on-line experience and graduate in a timely manner. A strengths model was used as the basis for development of an on-line doctoral nursing program. Upon entering the program, students were given a strengths assessment that focused both students and faculty on the positive attributes students were bringing to their doctoral studies. A positive feedback methodology using on-line discussions in each course was used to support the identified strengths. The optimal picture of a successful entering doctoral student appears to be a person whose top five strengths are learner, achiever, input, connectedness and responsibility. A strengths model promotes a positive learning environment and supports a teacher-learner dynamic where faculty members are encouraged to focus on the students' strengths rather than their challenges.
The Effectiveness of an Online MBA Program in Meeting Mid-Career Student Expectations
Directory of Open Access Journals (Sweden)
Maurice Grzeda
2009-07-01
Full Text Available Advances in teaching technologies have made online MBA programs more accessible to mid-career learners; precisely those who many suggest should be targeted. Previous research on the value of the MBA has focused on various student motivations, but not specifically on the experiences of North American mid-career learners. This study reports the results of a survey which asked online MBA students about expected career outcomes, why they had chosen the online format, and what skills they expected to acquire. A better understanding of the expectations of mid-career learners enrolled in online MBA studies may assist program designers in developing meaningful curriculum, and lead to improved pedagogies.
A Predictive Study of Student Satisfaction in Online Education Programs
Directory of Open Access Journals (Sweden)
Yu-Chun Kuo
2013-03-01
Full Text Available This paper is intended to investigate the degree to which interaction and other predictors contribute to student satisfaction in online learning settings. This was a preliminary study towards a dissertation work which involved the establishment of interaction and satisfaction scales through a content validity survey. Regression analysis was performed to determine the contribution of predictor variables to student satisfaction. The effects of student background variables on predictors were explored. The results showed that learner-instructor interaction, learner-content interaction, and Internet self-efficacy were good predictors of student satisfaction while interactions among students and self-regulated learning did not contribute to student satisfaction. Learner-content interaction explained the largest unique variance in student satisfaction. Additionally, gender, class level, and time spent online per week seemed to have influence on learner-learner interaction, Internet self-efficacy, and self-regulation.
A Way to Find All the Optimal Solutions in Linear Programming
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
With the expression theorem of convex polyhedron, this paper gives the general expres sion for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.
The Expansion of Dynamic Solving Process About a Class of Non-linear Programming Problems
Institute of Scientific and Technical Information of China (English)
ZANG Zhen-chun
2001-01-01
In this paper, we research non-linear programming problems which have a given specialstructure, some simple forms of this kind structure have been solved in some papers, here we focus on othercomplex ones.
An introduction to fuzzy linear programming problems theory, methods and applications
Kaur, Jagdeep
2016-01-01
The book presents a snapshot of the state of the art in the field of fully fuzzy linear programming. The main focus is on showing current methods for finding the fuzzy optimal solution of fully fuzzy linear programming problems in which all the parameters and decision variables are represented by non-negative fuzzy numbers. It presents new methods developed by the authors, as well as existing methods developed by others, and their application to real-world problems, including fuzzy transportation problems. Moreover, it compares the outcomes of the different methods and discusses their advantages/disadvantages. As the first work to collect at one place the most important methods for solving fuzzy linear programming problems, the book represents a useful reference guide for students and researchers, providing them with the necessary theoretical and practical knowledge to deal with linear programming problems under uncertainty.
On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming
Energy Technology Data Exchange (ETDEWEB)
DRIESSEN,BRIAN
1999-09-01
A method for finding a global optimum to the on-off minimum-time control problem with limited fuel usage is presented. Each control can take on only three possible values: maximum, zero, or minimum. The simplex method for linear systems naturally yields such a solution for the re-formulation presented herein because it always produces an extreme point solution to the linear program. Numerical examples for the benchmark linear flexible system are presented.
1979-01-01
The computer program Linear SCIDNT which evaluates rotorcraft stability and control coefficients from flight or wind tunnel test data is described. It implements the maximum likelihood method to maximize the likelihood function of the parameters based on measured input/output time histories. Linear SCIDNT may be applied to systems modeled by linear constant-coefficient differential equations. This restriction in scope allows the application of several analytical results which simplify the computation and improve its efficiency over the general nonlinear case.
Oki, Eiji
2012-01-01
Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks. Addressing optimization problems for communication networks, including the shortest path problem, max f
Arc-Search Infeasible Interior-Point Algorithm for Linear Programming
Yang, Yaguang
2014-01-01
Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra's algorithm. This paper proposes an alternative algorithm, arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by arc-search infeasible interior-point algorithm and Mehrotra's algorithm, that the propo...
A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems
Directory of Open Access Journals (Sweden)
Paulraj S.
2010-01-01
Full Text Available The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s. Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper.
Brodersen, R. Marc; Melluzzo, Daniel
2017-01-01
This report summarizes the methodology, measures, and findings of research on the influence on student achievement outcomes of K-12 online and blended face-to-face and online learning programs that offer differentiated learning options. The report also describes the characteristics of the learning programs. Most of the examined programs used…
Directory of Open Access Journals (Sweden)
Seyed Abolghasem Mortazavi
2014-03-01
Full Text Available Water resources sustainability is one of the major issues in the agricultural sustainability. In this study sustainability of water resources has been investigated by use of linear and non-linear models in six models based on optimal utilization of water resources in the north parts farms of Iran because of incorrect use of agricultural water resources, from 2011 to 2012. Also “gross margin per a unit of water consumption” and “employment per a unit of water consumption” are used as indicators for assessing the sustainability of cropping patterns. The results show that cropping pattern of fractional goal programming (FGP model has been near to current situation and has shown realistic conditions according to expertise and advantage of this area in cultivation of certain crops. So the FGP model has desirability in each of indicators than other five models.
Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami
2017-08-01
Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online.
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm
Institute of Scientific and Technical Information of China (English)
Hong Li; Li Zhang; Yongchang Jiao
2014-01-01
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit program-ming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the ortho-gonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as off-spring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algo-rithm.
FSILP: fuzzy-stochastic-interval linear programming for supporting municipal solid waste management.
Li, Pu; Chen, Bing
2011-04-01
Although many studies on municipal solid waste management (MSW management) were conducted under uncertain conditions of fuzzy, stochastic, and interval coexistence, the solution to the conventional linear programming problems of integrating fuzzy method with the other two was inefficient. In this study, a fuzzy-stochastic-interval linear programming (FSILP) method is developed by integrating Nguyen's method with conventional linear programming for supporting municipal solid waste management. The Nguyen's method was used to convert the fuzzy and fuzzy-stochastic linear programming problems into the conventional linear programs, by measuring the attainment values of fuzzy numbers and/or fuzzy random variables, as well as superiority and inferiority between triangular fuzzy numbers/triangular fuzzy-stochastic variables. The developed method can effectively tackle uncertainties described in terms of probability density functions, fuzzy membership functions, and discrete intervals. Moreover, the method can also improve upon the conventional interval fuzzy programming and two-stage stochastic programming approaches, with advantageous capabilities that are easily achieved with fewer constraints and significantly reduces consumption time. The developed model was applied to a case study of municipal solid waste management system in a city. The results indicated that reasonable solutions had been generated. The solution can help quantify the relationship between the change of system cost and the uncertainties, which could support further analysis of tradeoffs between the waste management cost and the system failure risk.
Hicks, Marianne; Tham, Melissa; Brookes, Rowan
2017-01-01
e-learning practitioners have long recognised the benefits of using online training to achieve knowledge transfer, less is understood about facilitating the sharing of values, attitudes, critical thinking, and localisation using online platforms. In this article an online learning platform in the context of an international scientific program was…
Hicks, Marianne; Tham, Melissa; Brookes, Rowan
2017-01-01
e-learning practitioners have long recognised the benefits of using online training to achieve knowledge transfer, less is understood about facilitating the sharing of values, attitudes, critical thinking, and localisation using online platforms. In this article an online learning platform in the context of an international scientific program was…
Caruthers, Loyce; Friend, Jennifer
2014-01-01
Faculty members in teacher and administrator preparation programs have unprecedented opportunities to incorporate advanced technologies, including the expansion of online classes and the use of online discussion forums. Within online environments, the concepts of critical pedagogy are more connected to the landscape of digital information,…
Multi-Objective Fuzzy Linear Programming In Agricultural Production Planning
Directory of Open Access Journals (Sweden)
H.M.I.U. Herath
2015-08-01
Full Text Available Abstract Modern agriculture is characterized by a series of conflicting optimization criteria that obstruct the decision-making process in the planning of agricultural production. Such criteria are usually net profit total cost total production etc. At the same time the decision making process in the agricultural production planning is often conducted with data that accidentally occur in nature or that are fuzzy not deterministic. Such data are the yields of various crops the prices of products and raw materials demand for the product the available quantities of production factors such as water labor etc. In this paper a fuzzy multi-criteria mathematical programming model is presented. This model is applied in a region of 10 districts in Sri Lanka where paddy is cultivated under irrigated and rain fed water in the two main seasons called Yala and Maha and the optimal production plan is achieved. This study was undertaken to find out the optimal allocation of land for paddy to get a better yield while satisfying the two conflicting objectives profit maximizing and cost minimizing subjected to the utilizing of water constraint and the demand constraint. Only the availability of land constraint is considered as a crisp in nature while objectives and other constraints are treated as fuzzy. It is observed that the MOFLP is an effective method to handle more than a single objective occurs in an uncertain vague environment.
Maximum error-bounded Piecewise Linear Representation for online stream approximation
Xie, Qing
2014-04-04
Given a time series data stream, the generation of error-bounded Piecewise Linear Representation (error-bounded PLR) is to construct a number of consecutive line segments to approximate the stream, such that the approximation error does not exceed a prescribed error bound. In this work, we consider the error bound in L∞ norm as approximation criterion, which constrains the approximation error on each corresponding data point, and aim on designing algorithms to generate the minimal number of segments. In the literature, the optimal approximation algorithms are effectively designed based on transformed space other than time-value space, while desirable optimal solutions based on original time domain (i.e., time-value space) are still lacked. In this article, we proposed two linear-time algorithms to construct error-bounded PLR for data stream based on time domain, which are named OptimalPLR and GreedyPLR, respectively. The OptimalPLR is an optimal algorithm that generates minimal number of line segments for the stream approximation, and the GreedyPLR is an alternative solution for the requirements of high efficiency and resource-constrained environment. In order to evaluate the superiority of OptimalPLR, we theoretically analyzed and compared OptimalPLR with the state-of-art optimal solution in transformed space, which also achieves linear complexity. We successfully proved the theoretical equivalence between time-value space and such transformed space, and also discovered the superiority of OptimalPLR on processing efficiency in practice. The extensive results of empirical evaluation support and demonstrate the effectiveness and efficiency of our proposed algorithms.
An adaptive linear combiner for on-line tracking of power system harmonics
Energy Technology Data Exchange (ETDEWEB)
Dash, P.K.; Swain, D.P. [Regional Engineering Coll., Rourkela (India). Dept. of Electrical Engineering; Liew, A.C. [National Univ. of Singapore (Singapore). Dept. of Electrical Engineering; Rahman, S. [Virginia Polytechnic Inst. and State Univ., VA (United States). Dept. of Electrical Engineering
1996-11-01
The paper presents a new approach for the estimation of harmonic components of a power system using a linear adaptive neuron called Adaline. The learning parameters in the proposed neural estimation algorithm are adjusted to force the error between the actual and desired outputs to satisfy a stable difference error equation. The estimator tracks the Fourier coefficients of the signal data corrupted with noise and decaying dc components very accurately. Adaptive tracking of harmonic components of a power system can easily be done using this algorithm. Several numerical tests have been conducted for the adaptive estimation of harmonic components of power system signals mixed with noise and decaying dc components.
Linearized Programming of Memristors for Artificial Neuro-Sensor Signal Processing
Yang, Changju; Kim, Hyongsuk
2016-01-01
A linearized programming method of memristor-based neural weights is proposed. Memristor is known as an ideal element to implement a neural synapse due to its embedded functions of analog memory and analog multiplication. Its resistance variation with a voltage input is generally a nonlinear function of time. Linearization of memristance variation about time is very important for the easiness of memristor programming. In this paper, a method utilizing an anti-serial architecture for linear programming is proposed. The anti-serial architecture is composed of two memristors with opposite polarities. It linearizes the variation of memristance due to complimentary actions of two memristors. For programming a memristor, additional memristor with opposite polarity is employed. The linearization effect of weight programming of an anti-serial architecture is investigated and memristor bridge synapse which is built with two sets of anti-serial memristor architecture is taken as an application example of the proposed method. Simulations are performed with memristors of both linear drift model and nonlinear model. PMID:27548186
Linearized Programming of Memristors for Artificial Neuro-Sensor Signal Processing.
Yang, Changju; Kim, Hyongsuk
2016-08-19
A linearized programming method of memristor-based neural weights is proposed. Memristor is known as an ideal element to implement a neural synapse due to its embedded functions of analog memory and analog multiplication. Its resistance variation with a voltage input is generally a nonlinear function of time. Linearization of memristance variation about time is very important for the easiness of memristor programming. In this paper, a method utilizing an anti-serial architecture for linear programming is proposed. The anti-serial architecture is composed of two memristors with opposite polarities. It linearizes the variation of memristance due to complimentary actions of two memristors. For programming a memristor, additional memristor with opposite polarity is employed. The linearization effect of weight programming of an anti-serial architecture is investigated and memristor bridge synapse which is built with two sets of anti-serial memristor architecture is taken as an application example of the proposed method. Simulations are performed with memristors of both linear drift model and nonlinear model.
Weinstein, Yana
2012-01-01
Adobe Flash is one of the most popular languages for animated web content, and recently social and behavioral scientists have started to take advantage of it to collect data online. Flash Programming for the Social and Behavioral Sciences: A Simple Guide to Sophisticated Online Surveys and Experiments is a unique, step-by-step guide to using Adobe Flash to develop experiments and other research tools. Each chapter presents a set of techniques required for one aspect of programming an experiment, with students following instructions in italics and working through the code inclu
Implementing a writing course in an online RN-BSN program.
Stevens, Carol J; D'Angelo, Barbara; Rennell, Nathalie; Muzyka, Diann; Pannabecker, Virginia; Maid, Barry
2014-01-01
Scholarly writing is an essential skill for nurses to communicate new research and evidence. Written communication directly relates to patient safety and quality of care. However, few online RN-BSN programs integrate writing instruction into their curricula. Nurses traditionally learn how to write from instructor feedback and often not until midway into their baccalaureate education. Innovative strategies are needed to help nurses apply critical thinking skills to writing. The authors discuss a collaborative project between nursing faculty and technical communication faculty to develop and implement a writing course that is 1 of the 1st courses the students take in the online RN-BSN program.
Solving fully fuzzy multiple objective linear programming problems: A new perspective
A. Hadi-Vencheh; Z Rezaei; S. Razipour
2014-01-01
In this paper a systematic process has been proposed to solve a fully fuzzy multi objective linear programming problem (FFMOLPP). Using the utility vector the MOLPP is transferred to a single objective programming and this single fuzzy object problem is simply solved by one of the fuzzy approaches.A numerical example is then given to show applicability of the proposed approach.
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...... protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...
Tourist Affiliate Program while Using Online Booking System with Possibility of Entering B2B Code
Directory of Open Access Journals (Sweden)
Slivar Iva
2008-01-01
Full Text Available Affiliate marketing programs are one of the most powerful tools for online marketing since the merchant presenting a product or a service decides on the commissioning model and the commission is granted only if the desired results have been reached. Affiliate marketing is based offline as much as tourism itself and it relies on the commission that tourist companies pay to their partners (affiliates who bring new guests. This paper will present the basics of how online affiliate programs work, benefits they bring and steps for their further implementation. It will explain in detail how to establish an affiliate program for dynamic web pages which use online booking system platforms that offer a possibility of entering a B2B code. Special attention will be paid to SEO (Search Engine Optimisation. It will also present results of a research on Croatian hotels web pages and the implementation of the online booking system and affiliate programs. Having in mind the insufficient deployment of online potentials, the aim of the paper is to stress the need for setting up an effective method of monitoring changes and updates in the online world as well as implementing new promotional possibilities, all aimed at increasing sales. The goal of the paper is to explore advantages and disadvantages of the affiliate program as a new sales channel and promote the possibility to implement it in one of the biggest Croatian hotel companies, Maistra d.d. Rovinj. Along with methods of data acquiring and different techniques of creative thinking, the following scientific research methods were also used: statistic, historic, descriptive, comparison, interview, analysis and synthesis, induction and deduction.
Working Together: The Context of Teams in an Online MBA Program
Directory of Open Access Journals (Sweden)
Martha A. Gabriel
2002-06-01
Full Text Available The purpose of this study was to explore learning in an online MBA program and the structures necessary to support and enhance that learning from the perspective of the learners. This qualitative study was multi-method in nature, and included in-depth interviews (the focus of this report with ten of the 32 learners who participated in the study, as well as a document review of course transcripts. Findings indicated that the collaborative nature of the teamwork required in this web-based MBA program provided major benefits as well as challenges for the learners in this program. Benefits included decreased feelings of isolation, the development of support systems, authentic "real world" learning, and an improved ability to communicate clearly online. Challenges included learning how to deal with the different learning styles, academic goals, and varying time commitments to the program of various team members. Learners recognized the pace of the online work, the requirements for technical competence, and the need for alternative communication links as other factors in their learning experience. Learners also identified a strong perception of academic efficacy, and an affirmation of their own individual growth and development through their work in the online MBA program.
Questions Linger over Rise and Fall of Online Program.
Carnevale, Dan
2002-01-01
Describes how a federal program let a California for-profit institution, the Masters Institute, expand its distance education offerings, but then led to its closure because of findings of financial aid fraud. (EV)
Directory of Open Access Journals (Sweden)
Corina ŞERBAN
2011-12-01
Full Text Available Nowadays, social marketing practices represent an important part of people’s lives. Consumers’ understanding of the need for change has become the top priority for social organizations worldwide. As a result, the number of social marketing programs has increased, making people reflect more on their behaviors and on the need to take action. Competition in social marketing can bring many benefits. The more programs initiated, the more people will start to involve in society’s problems, hereby contributing to beneficial causes. However, social organizations are in the search for competitive advantages to differentiate them on the market. This paper aims to present the role of online communication in driving competitive advantage for social organizations. Using the structural equation model, the paper describes the relations between four characteristics of the online communication: credibility, attractiveness, persuasion and promotion and then presents the correlations between these variables and website competitiveness. The resulting model shows that owning a competitive advantage in social marketing can bring many advantages to both the non-profit organization and the consumer. Therefore, the online environment can be considered a good solution for better serving consumers’ social needs. Its contribution is significant especially in programs for children and adolescents, since teenagers spend more time on the Internet than adults and are more open to using the online channels of communication. In conclusion, this article opens new opportunities for social marketers to address society’s problems and supports the integration of the online communication tools in the competition strategy.
Object matching using a locally affine invariant and linear programming techniques.
Li, Hongsheng; Huang, Xiaolei; He, Lei
2013-02-01
In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.
O'Connell, Emily; Stoneham, Melissa; Saunders, Julie
2016-04-01
Issue addressed Despite being viewed as a core competency for public health professionals, public health advocacy lacks a prominent place in the public health literature and receives minimal coverage in university curricula. The Public Health Advocacy Institute of Western Australia (PHAIWA) sought to fill this gap by establishing an online e-mentoring program for public health professionals to gain knowledge through skill-based activities and engaging in a mentoring relationship with an experienced public health advocate. This study is a qualitative evaluation of the online e-mentoring program. Methods Semi-structured interviews were conducted with program participants at the conclusion of the 12-month program to examine program benefits and determine the perceived contribution of individual program components to overall advocacy outcomes. Results Increased mentee knowledge, skills, level of confidence and experience, and expanded public health networks were reported. Outcomes were dependent on participants' level of commitment, time and location barriers, mentoring relationship quality, adaptability to the online format and the relevance of activities for application to participants' workplace context. Program facilitators had an important role through the provision of timely feedback and maintaining contact with participants. Conclusion An online program that combines public health advocacy content via skill-based activities with mentoring from an experienced public health advocate is a potential strategy to build advocacy capacity in the public health workforce. So what? Integrating advocacy as a core component of professional development programs will help counteract current issues surrounding hesitancy by public health professionals to proactively engage in advocacy, and ensure that high quality, innovative and effective advocacy leadership continues in the Australian public health workforce.
Scalable Linear Visual Feature Learning via Online Parallel Nonnegative Matrix Factorization.
Zhao, Xueyi; Li, Xi; Zhang, Zhongfei; Shen, Chunhua; Zhuang, Yueting; Gao, Lixin; Li, Xuelong
2016-12-01
Visual feature learning, which aims to construct an effective feature representation for visual data, has a wide range of applications in computer vision. It is often posed as a problem of nonnegative matrix factorization (NMF), which constructs a linear representation for the data. Although NMF is typically parallelized for efficiency, traditional parallelization methods suffer from either an expensive computation or a high runtime memory usage. To alleviate this problem, we propose a parallel NMF method called alternating least square block decomposition (ALSD), which efficiently solves a set of conditionally independent optimization subproblems based on a highly parallelized fine-grained grid-based blockwise matrix decomposition. By assigning each block optimization subproblem to an individual computing node, ALSD can be effectively implemented in a MapReduce-based Hadoop framework. In order to cope with dynamically varying visual data, we further present an incremental version of ALSD, which is able to incrementally update the NMF solution with a low computational cost. Experimental results demonstrate the efficiency and scalability of the proposed methods as well as their applications to image clustering and image retrieval.
Directory of Open Access Journals (Sweden)
Alan Davis
2001-01-01
Full Text Available In its 30 years of operation, Athabasca University has witnessed the full impact of the growth of online distance education. Its conversion from mixed media course production and telephone/ mail tutoring to a variety of electronic information and communication technologies has been heterogeneous across disciplines and programs. Undergraduate programs in business, computing, and some social science programs have largely led the conversion, and all graduate programs have, since their inception, employed various features of online delivery. The parallel conversion of student services has been equally important to the effectiveness of these processes. The implications of this approach for the quality of offerings, support systems, costing, and the primary mandate of the University (which is to remove barriers, not create them are discussed.
Attitudes of College Students Enrolled in 2-Year Health Care Programs towards Online Learning
Abdulla, Dalya
2012-01-01
Colleges offering 2-year diplomas to high-school graduates were among the forefront leaders in online learning however studies illustrating appropriate course construction for such student populations are scarce. Pharmacy Math (MATH16532) is a core course for students enrolled in the Practical Nursing (PN) and Pharmacy Technician (PT) programs at…
Amhag, Lisbeth
2015-01-01
The aim of this study is to describe and analyse students' learning activities in distance higher education program with online webinars (WEB-based semINAR) by computer, laptop or mobile app for phones and tablets directly face-to-face (F2F) with other students and teachers introduced by "flipped classroom." The data collection consists…
Hsu, Liwei
2014-01-01
This paper was designed to investigate the application of an online inquiry-based program to European tourism from an epistemological perspective. Fifty tourism students (n = 50) participated in this study and their epistemological beliefs were measured with the Epistemological Belief Scale. A set of pre-, post-, and delayed tests were utilised to…
Florida Public Health Training Center: Evidence-Based Online Mentor Program
Frahm, Kathryn A.; Alsac-Seitz, Biray; Mescia, Nadine; Brown, Lisa M.; Hyer, Kathy; Liburd, Desiree; Rogoff, David P.; Troutman, Adewale
2013-01-01
This article describes an Online Mentor Program (OMP) designed to support and facilitate mentorships among and between Florida Department of Health (FDOH) employees and USF College of Public Health students using a Web-based portal. The Florida Public Health Training Center (FPHTC) at the University of South Florida (USF) College of Public Health…
Hsu, Liwei
2014-01-01
This paper was designed to investigate the application of an online inquiry-based program to European tourism from an epistemological perspective. Fifty tourism students (n = 50) participated in this study and their epistemological beliefs were measured with the Epistemological Belief Scale. A set of pre-, post-, and delayed tests were utilised to…
Drouin, Michelle; Stewart, Jennifer; Van Gorder, Karen
2015-01-01
In this quasi-experimental mixed methods study, we examined the effectiveness of a faculty-to-faculty mentoring program to increase student success rates in online courses at an American university. Over one semester, 24 faculty mentees worked with 6 faculty mentors on improving course organization and implementing student engagement techniques.…
APA Reporting Standards in Quantitative Research Dissertations from an Online EdD Program
Salgado, Griselle
2013-01-01
This study was an investigation of the reporting practices in dissertations with quantitative research designs produced by students enrolled in an online Doctor of Education (EdD) program, one that follows the American Psychological Association (APA) standards for reporting research. Limited, empirical information exists about the competencies in…
Tolosa, Constanza; Ordóñez, Claudia Lucía; Guevara, Diana Carolina
2017-01-01
We present findings of a project that investigated the potential of an online tandem program to enhance the foreign language learning of two groups of school-aged beginner learners, one learning English in Colombia and the other learning Spanish in New Zealand. We assessed the impact of the project on students' learning with a free writing…
Is the Library's Online Orientation Program Effective with English Language Learners?
Albarillo, Frans
2017-01-01
In this paper, the author examines four years of assessment data (N = 4,786) from Brooklyn College's Library Online Orientation Program (LOOP; url: https://library.brooklyn.cuny.edu/resources/loop/loop.php), which is used to provide all English 1010 students with an orientation to the library, to see if English language learners (ELLs) are…
Manburg, Jamie; Moore, Rashid; Griffin, David; Seperson, Marvin
2017-01-01
This paper discusses preservice teachers' perceptions of an online, in-house diversity simulation in an undergraduate teacher education program conducted over a 3-year period. The diversity simulation was a nontraditional capstone experience for 193 preservice teachers in majors ranging from early childhood to secondary education. The diversity…
Working Together: The Context of Teams in an Online MBA Program.
Gabriel, Martha A.; MacDonald, Colla J.
2002-01-01
Describes a study that explored learning in a Web-based online MBA (Masters of Business Administration) program and the structures necessary to support and enhance learning from the perspective of the learners. Findings indicated that the collaborative nature of the teamwork required provided major benefits as well as challenges for the students.…
The Effectiveness of an Online MBA Program in Meeting Mid-Career Student Expectations
Grzeda, Maurice; Miller, Gloria E.
2009-01-01
Advances in teaching technologies have made online MBA programs more accessible to mid-career learners; precisely those who many suggest should be targeted. Previous research on the value of the MBA has focused on various student motivations, but not specifically on the experiences of North American mid-career learners. This study reports the…
Determinants of Self-Reflective Learning and Its Consequences in Online Master Degree Programs
Neumann, Yoram; Neumann, Edith; Lewis, Shelia
2017-01-01
Based on recent studies of self-reflective learning and its effects on various learning outcomes, this study examined the concept of self-reflective learning in the context of the Robust Learning Model (RLM), which is a learning model designed for improving the educational effectiveness of online degree programs. Two models were introduced to…
Neely, Patricia; Tucker, Jan P.; Au, Angela
2016-01-01
As concerns about the skyrocketing costs of a college degree have converged with the increasing availability of open educational resources (OER), higher education administrators are asking faculty and curriculum designers to use OERs to design courses and programs. This case study explores the decision making process and outcomes of an online,…
Drouin, Michelle; Stewart, Jennifer; Van Gorder, Karen
2015-01-01
In this quasi-experimental mixed methods study, we examined the effectiveness of a faculty-to-faculty mentoring program to increase student success rates in online courses at an American university. Over one semester, 24 faculty mentees worked with 6 faculty mentors on improving course organization and implementing student engagement techniques.…
Teaching Citizen Science Skills Online: Implications for Invasive Species Training Programs
Newman, Greg; Crall, Alycia; Laituri, Melinda; Graham, Jim; Stohlgren, Tom; Moore, John C.; Kodrich, Kris; Holfelder, Kirstin A.
2010-01-01
Citizen science programs are emerging as an efficient way to increase data collection and help monitor invasive species. Effective invasive species monitoring requires rigid data quality assurances if expensive control efforts are to be guided by volunteer data. To achieve data quality, effective online training is needed to improve field skills…
Bouwman, T.E.; Aartsen, M.J.; Tilburg, van T.G.; Stevens, N.L.
2016-01-01
Loneliness stems from a mismatch between the social relationships one has and those one desires. Loneliness often has severe consequences for individuals and society. Recently, an online adaptation of the friendship enrichment program (FEP) was developed and tested to gain insight in its contributio
Tucker, Beatrice; Jones, Sue; Straker, Leon
2008-01-01
This paper reports the use of an online student evaluation system, Course Experience on the Web (CEW), in a physiotherapy program to improve their Course Experience Questionnaire (CEQ) results. CEW comprises a course survey instrument modeled on the CEQ and a tailored unit survey instrument. Closure of the feedback loop is integral in the CEW…
An Evaluation System for the Online Training Programs in Meteorology and Hydrology
Wang, Yong; Zhi, Xiefei
2009-01-01
This paper studies the current evaluation system for the online training program in meteorology and hydrology. CIPP model that includes context evaluation, input evaluation, process evaluation and product evaluation differs from Kirkpatrick model including reactions evaluation, learning evaluation, transfer evaluation and results evaluation in…
APA Reporting Standards in Quantitative Research Dissertations from an Online EdD Program
Salgado, Griselle
2013-01-01
This study was an investigation of the reporting practices in dissertations with quantitative research designs produced by students enrolled in an online Doctor of Education (EdD) program, one that follows the American Psychological Association (APA) standards for reporting research. Limited, empirical information exists about the competencies in…
Navarre, Berengaria; Perez, Norma A.; Smith, Sarah Toombs
2017-01-01
Based on a successful five-week summer program, we constructed an online alternative to prepare Hispanic students to take the Medical College Admission Test (MCAT). We used input from student premed advisors, students, a faculty mentor, a Verbal Reasoning coach, and the program administrator. Online activities were provided to support the student…
Millings, A.; Morris, J.; Rowe, A.; Easton, S.; Martin, J. K.; Majoe, D.; Mohr, C.
2015-01-01
Background: Internet interventions for mental health concerns are known to be effective, but how can developing technology be utilised to improve engagement and augment the effectiveness of these programs? One option might be to incorporate feedback about the user's physiological state into the program, via wearable sensors. Objectives: This mixed-methods pilot study sought to examine whether the effectiveness of an online intervention for stress in students could be augmented by the use o...
Student Loyalty Assessment with Online Master's Programs
Dehghan, Ali
2012-01-01
Relationship marketing is attracting, maintaining, and, in multi-service organizations, enhancing customer relationships. Educational programs and services, like those of businesses, depend highly on the repeated purchases of their loyal customers. The purpose of this descriptive research is to investigate the relationships between factors that…
Student Loyalty Assessment with Online Master's Programs
Dehghan, Ali
2012-01-01
Relationship marketing is attracting, maintaining, and, in multi-service organizations, enhancing customer relationships. Educational programs and services, like those of businesses, depend highly on the repeated purchases of their loyal customers. The purpose of this descriptive research is to investigate the relationships between factors that…
Detecting Non-Dominated Extreme Points for Multiple Objective Linear Programming
Directory of Open Access Journals (Sweden)
S. F. Tantawy
2007-01-01
Full Text Available Efficient extreme points in decision space of multiple objective linear programming (MOLP may not map to non dominated extreme points in objective space under the linear mapping, condition that efficient extreme points have a non dominated extreme is given, the important of this study is that the decision-Maker may depends on extreme points of the set of the objective space than that of the decision space since they have fewer extreme points.
Developing a quality assurance program for online services.
Humphries, A W; Naisawald, G V
1991-01-01
A quality assurance (QA) program provides not only a mechanism for establishing training and competency standards, but also a method for continuously monitoring current service practices to correct shortcomings. The typical QA cycle includes these basic steps: select subject for review, establish measurable standards, evaluate existing services using the standards, identify problems, implement solutions, and reevaluate services. The Claude Moore Health Sciences Library (CMHSL) developed a qua...
Preferred Methods of Learning for Nursing Students in an On-Line Degree Program.
Hampton, Debra; Pearce, Patricia F; Moser, Debra K
Investigators have demonstrated that on-line courses result in effective learning outcomes, but limited information has been published related to preferred teaching strategies. Delivery of on-line courses requires various teaching methods to facilitate interaction between students, content, and technology. The purposes of this study were to understand student teaching/learning preferences in on-line courses to include (a) differences in preferred teaching/learning methods for on-line nursing students across generations and (b) which teaching strategies students found to be most engaging and effective. Participants were recruited from 2 accredited, private school nursing programs (N=944) that admit students from across the United States and deliver courses on-line. Participants provided implied consent, and 217 (23%) students completed the on-line survey. Thirty-two percent of the students were from the Baby Boomer generation (1946-1964), 48% from Generation X (1965-1980), and 20% from the Millennial Generation (born after 1980). The preferred teaching/learning methods for students were videos or narrated PowerPoint presentations, followed by synchronous Adobe Connect educations sessions, assigned journal article reading, and e-mail dialog with the instructor. The top 2 methods identified by participants as the most energizing/engaging and most effective for learning were videos or narrated PowerPoint presentations and case studies. The teaching/learning method least preferred by participants and that was the least energizing/engaging was group collaborative projects with other students; the method that was the least effective for learning was wikis. Baby Boomers and Generation X participants had a significantly greater preference for discussion board (Plearning (Pteaching/learning methods for on-line students. Faculty need to incorporate various teaching methodologies within on-line courses to include both synchronous and asynchronous activities and interactive and
Method for solving fully fuzzy linear programming problems using deviation degree measure
Institute of Scientific and Technical Information of China (English)
Haifang Cheng; Weilai Huang; Jianhu Cai
2013-01-01
A new ful y fuzzy linear programming (FFLP) prob-lem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crispδ-parametric linear programming (LP) problem. Giving the value of deviation degree in each constraint, the δ-fuzzy optimal so-lution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict: to improve the va-lues of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to il ustrate the proposed method.
DEFF Research Database (Denmark)
Ren, Jingzheng; Dong, Liang; Sun, Lu
2015-01-01
The aim of this work was to develop a model for optimizing the life cycle cost of biofuel supply chain under uncertainties. Multiple agriculture zones, multiple transportation modes for the transport of grain and biofuel, multiple biofuel plants, and multiple market centers were considered...... in this model, and the price of the resources, the yield of grain and the market demands were regarded as interval numbers instead of constants. An interval linear programming was developed, and a method for solving interval linear programming was presented. An illustrative case was studied by the proposed...
The Knowledge of Expert Opinion in Intuitionistic Fuzzy Linear Programming Problem
Directory of Open Access Journals (Sweden)
A. Nagoorgani
2015-01-01
Full Text Available In real life, information available for certain situations is vague and such uncertainty is unavoidable. One possible solution is to consider the knowledge of experts on the parameters involved as intuitionistic fuzzy data. We examine a linear programming problem in which all the coefficients are intuitionistic in nature. An approach is presented to solve an intuitionistic fuzzy linear programming problem. In this proposed approach, a procedure for allocating limited resources effectively among competing demands is developed. An example is given to highlight the illustrated study.
A novel recurrent neural network with finite-time convergence for linear programming.
Liu, Qingshan; Cao, Jinde; Chen, Guanrong
2010-11-01
In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.
Ren, Jingzheng; Dong, Liang; Sun, Lu; Goodsite, Michael Evan; Tan, Shiyu; Dong, Lichun
2015-01-01
The aim of this work was to develop a model for optimizing the life cycle cost of biofuel supply chain under uncertainties. Multiple agriculture zones, multiple transportation modes for the transport of grain and biofuel, multiple biofuel plants, and multiple market centers were considered in this model, and the price of the resources, the yield of grain and the market demands were regarded as interval numbers instead of constants. An interval linear programming was developed, and a method for solving interval linear programming was presented. An illustrative case was studied by the proposed model, and the results showed that the proposed model is feasible for designing biofuel supply chain under uncertainties.
Experiential learning: using virtual simulation in an online RN-to-BSN program.
Breen, Henny; Jones, Melissa
2015-01-01
This article highlights the innovative experiential learning used by an online RN-to-BSN program through the use of simulation that takes place in an online classroom. Three experiential learning activities using a virtual community are described. These learning activities engage the students in thinking about social justice and health policy, as well as teaching concepts that include community, leadership, influence, advocacy, networking, collaboration, and vulnerable populations. These concepts are critical to the learning needs of diploma and associate degree-prepared nurses who wish to continue their education to be better prepared to meet the complex needs of today's health care environment. Copyright 2015, SLACK Incorporated.
Online education for high intellectual ability students: An assessment of a mathematical program
Directory of Open Access Journals (Sweden)
Javier Tourón
2010-04-01
Full Text Available In this paper a Mathematics multimedia interactive online program is evaluated. It was used by 215 ten-year old students with a verbal or quantitative capacity which situated them in the top 10% of their age group. The program lasted twelve weeks from March to May 2009. The students’ evaluation of the experience was very positive: 82% would repeat the experience and 94% would recommend it to class mates. Also the average evaluation of the program on a five point Likert scale was 4,17, that of the virtual classroom 3,94, and that of the tutor 4,58. The student learning evaluation indicates significant improvements between the pretest and the posttest, with values between 5 and 20 points. A few considerations are made on the possibilities of on-line learning to be adjusted to the educational needs of all students.
TOWARD A FRAMEWORK UNDERSTANDING OF ONLINE PROGRAMS FOR COUNTERING VIOLENT EXTREMISM
Directory of Open Access Journals (Sweden)
Garth Davies
2016-03-01
Full Text Available There is an emerging consensus that ideologically-based narratives play a central role in encouraging and sustaining radicalization to violence, and that preventing, arresting, or reversing radicalization requires some means by which to address the effects of these narratives. Countering violent extremism (CVE is a broad umbrella phrase that covers a wide array of approaches that have been advanced to reduce the radicalizing effects of extremist narratives. There is considerably less agreement, however, regarding the most appropriate means by which the mitigation of extremist narratives might best be accomplished. An important emerging area of interest is the role of the Internet, both as a forum through which narratives are transmitted and as an avenue for delivering CVE programs. At present, very little is known about which principles and practices should inform online CVE initiatives. This study attempts to establish a foundation and framework for these programs: first, by identifying the concepts and constructs which may be most relevant to countering violent extremism online, and second, by examining the available material from six online CVE programs in relation to these concepts. This examination suggests that these programs are lacking strong theoretical foundations and do not address important elements of radicalization, such as contextual factors or identity issues. It is important that future iterations of CVE programs consider not just the specific content of the narratives, but also take into account why these narratives have resonance for particular individuals.
Solving fully fuzzy multiple objective linear programming problems: A new perspective
Directory of Open Access Journals (Sweden)
A. Hadi-Vencheh
2014-08-01
Full Text Available In this paper a systematic process has been proposed to solve a fully fuzzy multi objective linear programming problem (FFMOLPP. Using the utility vector the MOLPP is transferred to a single objective programming and this single fuzzy object problem is simply solved by one of the fuzzy approaches.A numerical example is then given to show applicability of the proposed approach.
The development of a TED-Ed online resident research training program.
Moreau, Katherine A; Pound, Catherine M; Peddle, Beth; Tokarewicz, Jaclyn; Eady, Kaylee
2014-01-01
Pediatric health research is important for improving the health and well-being of children and their families. To foster the development of physicians' research competencies, it is vital to integrate practical and context-specific research training into residency programs. To describe the development of a resident research training program at one tertiary care pediatric academic health sciences center in Ontario, Canada. We surveyed residents and pediatricians/research staff to establish the need and content for a resident research training program. Residents and resident research supervisors agreed or strongly agreed that research training is important for residents. However, few residents and supervisors believed that their academic health sciences center provided adequate training and resources to support resident research. As such, an online resident research training program was established. Residents and supervisors agreed that the program should focus on the following topics: 1) critically evaluating research literature, 2) writing a research proposal, 3) submitting an application for research funding, and 4) writing a manuscript. This highly accessible, context-specific, and inexpensive online program model may be of interest and benefit to other residency programs as a means to enhance residents' scholarly roles. A formal evaluation of the research training program is now underway.
The development of a TED-Ed online resident research training program
Directory of Open Access Journals (Sweden)
Katherine A. Moreau
2014-12-01
Full Text Available Background: Pediatric health research is important for improving the health and well-being of children and their families. To foster the development of physicians’ research competencies, it is vital to integrate practical and context-specific research training into residency programs. Purpose: To describe the development of a resident research training program at one tertiary care pediatric academic health sciences center in Ontario, Canada. Methods: We surveyed residents and pediatricians/research staff to establish the need and content for a resident research training program. Results: Residents and resident research supervisors agreed or strongly agreed that research training is important for residents. However, few residents and supervisors believed that their academic health sciences center provided adequate training and resources to support resident research. As such, an online resident research training program was established. Residents and supervisors agreed that the program should focus on the following topics: 1 critically evaluating research literature, 2 writing a research proposal, 3 submitting an application for research funding, and 4 writing a manuscript. Discussion: This highly accessible, context-specific, and inexpensive online program model may be of interest and benefit to other residency programs as a means to enhance residents’ scholarly roles. A formal evaluation of the research training program is now underway.
Engagement in health and wellness: An online incentive-based program
Directory of Open Access Journals (Sweden)
Teresa B. Gibson
2017-09-01
Full Text Available Increasingly, corporate health promotion programs are implementing wellness programs integrating principles of behavioral economics. Employees of a large firm were provided a customized online incentive program to design their own commitments to meet health goals. This study examines patterns of program participation and engagement in health promotion activities. Subjects were US-based employees of a large, nondurable goods manufacturing firm who were enrolled in corporate health benefits in 2010 and 2011. We assessed measures of engagement with the workplace health promotion program (e.g., incentive points earned, weight loss. To further examine behaviors indicating engagement in health promotion activities, we constructed an aggregate, employee-level engagement index. Regression models were employed to assess the association between employee characteristics and the engagement index, and the engagement index and spending. 4220 employees utilized the online program and made 25,716 commitments. Male employees age 18–34 had the highest level of engagement, and male employees age 55–64 had the lowest level of engagement overall. Prior year health status and prior year spending did not show a significant association with the level of engagement with the program (p > 0.05. Flexible, incentive-based behavioral health and lifestyle programs may reach the broader workforce including those with chronic conditions and higher levels of health spending.
Engagement in health and wellness: An online incentive-based program.
Gibson, Teresa B; Maclean, J Ross; Carls, Ginger S; Moore, Brian J; Ehrlich, Emily D; Fener, Victoria; Goldberg, Jordan; Mechanic, Elaine; Baigel, Colin
2017-09-01
Increasingly, corporate health promotion programs are implementing wellness programs integrating principles of behavioral economics. Employees of a large firm were provided a customized online incentive program to design their own commitments to meet health goals. This study examines patterns of program participation and engagement in health promotion activities. Subjects were US-based employees of a large, nondurable goods manufacturing firm who were enrolled in corporate health benefits in 2010 and 2011. We assessed measures of engagement with the workplace health promotion program (e.g., incentive points earned, weight loss). To further examine behaviors indicating engagement in health promotion activities, we constructed an aggregate, employee-level engagement index. Regression models were employed to assess the association between employee characteristics and the engagement index, and the engagement index and spending. 4220 employees utilized the online program and made 25,716 commitments. Male employees age 18-34 had the highest level of engagement, and male employees age 55-64 had the lowest level of engagement overall. Prior year health status and prior year spending did not show a significant association with the level of engagement with the program (p > 0.05). Flexible, incentive-based behavioral health and lifestyle programs may reach the broader workforce including those with chronic conditions and higher levels of health spending.
Cooke, C. H.
1975-01-01
STICAP (Stiff Circuit Analysis Program) is a FORTRAN 4 computer program written for the CDC-6400-6600 computer series and SCOPE 3.0 operating system. It provides the circuit analyst a tool for automatically computing the transient responses and frequency responses of large linear time invariant networks, both stiff and nonstiff (algorithms and numerical integration techniques are described). The circuit description and user's program input language is engineer-oriented, making simple the task of using the program. Engineering theories underlying STICAP are examined. A user's manual is included which explains user interaction with the program and gives results of typical circuit design applications. Also, the program structure from a systems programmer's viewpoint is depicted and flow charts and other software documentation are given.
Dyehouse, Melissa; Bennett, Deborah; Harbor, Jon; Childress, Amy; Dark, Melissa
2009-01-01
Logic models are based on linear relationships between program resources, activities, and outcomes, and have been used widely to support both program development and evaluation. While useful in describing some programs, the linear nature of the logic model makes it difficult to capture the complex relationships within larger, multifaceted…
2007-11-02
scarce resources ( Bazaraa vii). The modeling capabilities linear programming provides has made it a success in many fields of study. Since the...Planning and Programming of Facility Construction Projects. 12 May 1994. Bazaraa , Mokhtar S., John J Jarvis and Hanif D. Sherali. Linear Programming
Linear circuit analysis program for IBM 1620 Monitor 2, 1311/1443 data processing system /CIRCS/
Hatfield, J.
1967-01-01
CIRCS is modification of IBSNAP Circuit Analysis Program, for use on smaller systems. This data processing system retains the basic dc, transient analysis, and FORTRAN 2 formats. It can be used on the IBM 1620/1311 Monitor I Mod 5 system, and solves a linear network containing 15 nodes and 45 branches.
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...
EXPECTED NUMBER OF ITERATIONS OF INTERIOR-POINT ALGORITHMS FOR LINEAR PROGRAMMING
Institute of Scientific and Technical Information of China (English)
Si-ming Huang
2005-01-01
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the expected and anticipated number of iterations of these algorithms is bounded above by O(n1,5). The random LP problem is Todd's probabilistic model with the Cauchy distribution.
Average number of iterations of some polynomial interior-point——Algorithms for linear programming
Institute of Scientific and Technical Information of China (English)
黄思明
2000-01-01
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite termination technique, is bounded above by O( n1.5). The random LP problem is Todd’s probabilistic model with the standard Gauss distribution.
DEFF Research Database (Denmark)
Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Graells, Moises
2017-01-01
-side strategy, defined as a general mixed-integer linear programming by taking into account two stages for proper charging of the storage units. This model is considered as a deterministic problem that aims to minimize operating costs and promote self-consumption based on 24-hour ahead forecast data...
Research and evaluation of the effectiveness of e-learning in the case of linear programming
Directory of Open Access Journals (Sweden)
Ljiljana Miletić
2016-04-01
Full Text Available The paper evaluates the effectiveness of the e-learning approach to linear programming. The goal was to investigate how proper use of information and communication technologies (ICT and interactive learning helps to improve high school students’ understanding, learning and retention of advanced non-curriculum material. The hypothesis was that ICT and e-learning is helpful in teaching linear programming methods. In the first phase of the research, a module of lessons for linear programming (LP was created using the software package Loomen Moodle and other interactive software packages such as Geogebra. In the second phase, the LP module was taught as a short course to two groups of high school students. These two groups of students were second-grade students in a Croatian high school. In Class 1, the module was taught using ICT and e-learning, while the module was taught using classical methods in Class 2. The action research methodology was an integral part in delivering the course to both student groups. The sample student groups were carefully selected to ensure that differences in background knowledge and learning potential were statistically negligible. Relevant data was collected while delivering the course. Statistical analysis of the collected data showed that the student group using the e-learning method produced better results than the group using a classical learning method. These findings support previous results on the effectiveness of e-learning, and also establish a specific approach to e-learning in linear programming.
A linear programming model of diet choice of free-living beavers
Nolet, BA; VanderVeer, PJ; Evers, EGJ; Ottenheim, MM
1995-01-01
Linear programming has been remarkably successful in predicting the diet choice of generalist herbivores. We used this technique to test the diet choice of free-living beavers (Castor fiber) in the Biesbosch (The Netherlands) under different Foraging goals, i.e. maximization of intake of energy,
Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming
2016-01-01
TECHNICAL REPORT NSWC PCD TR 2015-003 OPTIMIZED WATERSPACE MANAGEMENT AND SCHEDULING USING MIXED-INTEGER LINEAR PROGRAMMING...constraints required for the mathematical formulation of the MCM scheduling problem pertaining to the survey constraints and logistics management . The...Floudas, Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications, Oxford University Press, 1995. [10] M. J. Bays, A. Shende, D. J
Huitzing, HA
2004-01-01
This article shows how set covering with item sampling (SCIS) methods can be used in the analysis and preanalysis of linear programming models for test assembly (LPTA). LPTA models can construct tests, fulfilling a set of constraints set by the test assembler. Sometimes, no solution to the LPTA mode
Velazquez-Marti, B.; Annevelink, E.
2009-01-01
Much bio-energy can be obtained from wood pruning operations in forests and fruit orchards. Several spatial studies have been carried out for biomass surveys, and many linear programming models have been developed to model the logistics of bio-energy chains. These models can assist in determining th
Time-Staged Methods in Linear Programming, Comments and Early History.
1980-06-01
ENG77-06761. This paper was presented at "Workshop on Large-Scale Linear Programming*, June 2-6, 1980, International Institute for Applied Systems Analysis , Austria...This paper is a more polished version of the talk which I delivered opening the International Institute for Applied Systems Analysis Workshop on Large
Directory of Open Access Journals (Sweden)
S. F. Tantawy
2007-01-01
Full Text Available We presented a feasible direction method to find all optimal extreme points for the linear programming problem. Our method depends on the conjugate gradient projection method starting with an initial point we generate a sequence of feasible directions towards all alternative extremes.
A Multi-Objective Fuzzy Linear Programming Model for Cash Flow Management
Directory of Open Access Journals (Sweden)
A. M. El-Kholy
2014-08-01
Full Text Available Although significant research work has been conducted on cash flow forecast, planning, and management, the objective is constantly the maximization of profit/final cash balance, or minimization of total project cost. This paper presents a multi-objective fuzzy linear programming model (FLP for resolving the optimization problem of three conflicting objectives: final cash balance, cost of money, and initial cash balance. The proposed model depends on Jiang et al. (2011 Model. In the new formulation, both the advanced payment and delay of owner's progress payment one period were considered. Literature concerned with cash flow studies and models for construction projects was reviewed. Fuzzy linear programming applications in literature was presented and it's concept was then described. Jiang et al. (2011 Model is presented. The proposed model development was then presented. The proposed model was validated using an example project. An optimization of each individual objective was performed with a linear programming (LP software (Lindo that gave the upper and lower bounds for the multi-objective analysis. Fuzzy linear programming was then applied to optimize the solution. Four cases are considered: considering advanced payment and delay of owner's progress payment one period simultaneously, then separately, and neglecting advanced payment and delay of owner's progress payment. Penalty of delayed payment have been also considered. Analysis of the results revealed that the model is an effective decision making tool to be used by industry practitioners with reasonable accuracy.
A linear programming model of diet choice of free-living beavers
Nolet, BA; VanderVeer, PJ; Evers, EGJ; Ottenheim, MM
1995-01-01
Linear programming has been remarkably successful in predicting the diet choice of generalist herbivores. We used this technique to test the diet choice of free-living beavers (Castor fiber) in the Biesbosch (The Netherlands) under different Foraging goals, i.e. maximization of intake of energy, nit
Secret Message Decryption: Group Consulting Projects Using Matrices and Linear Programming
Gurski, Katharine F.
2009-01-01
We describe two short group projects for finite mathematics students that incorporate matrices and linear programming into fictional consulting requests presented as a letter to the students. The students are required to use mathematics to decrypt secret messages in one project involving matrix multiplication and inversion. The second project…
Average number of iterations of some polynomial interior-point--Algorithms for linear programming
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite termination technique, is bounded above by O(n1.5). The random LP problem is Todd's probabilistic model with the standard Gauss distribution.
The fastclime Package for Linear Programming and Large-Scale Precision Matrix Estimation in R.
Pang, Haotian; Liu, Han; Vanderbei, Robert
2014-02-01
We develop an R package fastclime for solving a family of regularized linear programming (LP) problems. Our package efficiently implements the parametric simplex algorithm, which provides a scalable and sophisticated tool for solving large-scale linear programs. As an illustrative example, one use of our LP solver is to implement an important sparse precision matrix estimation method called CLIME (Constrained L1 Minimization Estimator). Compared with existing packages for this problem such as clime and flare, our package has three advantages: (1) it efficiently calculates the full piecewise-linear regularization path; (2) it provides an accurate dual certificate as stopping criterion; (3) it is completely coded in C and is highly portable. This package is designed to be useful to statisticians and machine learning researchers for solving a wide range of problems.
Directory of Open Access Journals (Sweden)
Chandra Nagasuma R
2009-02-01
Full Text Available Abstract Background A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN from transcript profiling data. Results The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting problem and solved finally by formulating a Linear Program (LP. A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known
Snow, L. S.; Kuhn, A. E.
1975-01-01
Previous error analyses conducted by the Guidance and Dynamics Branch of NASA have used the Guidance Analysis Program (GAP) as the trajectory simulation tool. Plans are made to conduct all future error analyses using the Space Vehicle Dynamics Simulation (SVDS) program. A study was conducted to compare the inertial measurement unit (IMU) error simulations of the two programs. Results of the GAP/SVDS comparison are presented and problem areas encountered while attempting to simulate IMU errors, vehicle performance uncertainties and environmental uncertainties using SVDS are defined. An evaluation of the SVDS linear error analysis capability is also included.
Zhang, Yunong; Wang, Jun
2002-06-01
A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially convergent to optimal solutions of quadratic programming problems. In addition, compared to neural networks containing high-order nonlinear terms, the dynamic equation of the proposed dual neural network is piecewise linear, and the network architecture is thus much simpler. The global convergence behavior of the dual neural network is demonstrated by an illustrative numerical example.
Directory of Open Access Journals (Sweden)
Roslee Rajikan
2017-02-01
Full Text Available Differences in socioeconomic profile may influences healthy food choices, particularly among individuals with low socioeconomic status. Thus, high-energy dense foods become the preferences compared to high nutritional content foods due to their cheaper price. The present study aims to develop healthy and palatable diet at the minimum cost based on Malaysian Dietary Guidelines 2010 and Recommended Nutrient Intake 2005 via linear programming. A total of 96 female adults from low socioeconomic families in Johor, South East Malaysia have been recruited for the present study. Anthropometric measurement; weight and height, socio-demographic information and 3-days food record have been collected from the subjects. In addition, data on food prices have also been collected. Then, a linear programming model has been developed to select the cheapest food combinations that could fulfil all the nutritional recommendations and palatable constraints in order to capture common dietary habit of the locals. Subsequently, healthy seven-days menus have been created using the optimal food servings estimated from the linear programming model. Dietary data have shown that the average energy intake among low-income adult women (1871 ± 317 kcal/day is less than the nutrient recommendation. Thus, from the linear programming analysis, the minimum food cost has been estimated at RM6.55 (2.15 USD for the total energy intake of 2000 kcal per day for a female adult which meets the recommendation of MDG 2010 and RNI 2005. In conclusion, linear programming may be a useful tool to develop healthy and palatable diets at a minimal cost in managing dietary problems among low socioeconomic groups where food expenditure becomes an important restraining factor. Eventually, low socioeconomics female adults would improve their nutritional intake by making wiser food choices to meet all the nutritional requirements, which lead to healthier life.
Does an Online CBT Program for Anxiety Impact Upon Sleep Problems in Anxious Youth?
Donovan, Caroline L; Spence, Susan H; March, Sonja
2017-01-01
This study aimed to assess whether the transdiagnostic therapy elements of an online cognitive behaviour therapy anxiety program also impact on sleep-related problems (SRPs) in anxious youth. Participants were drawn from two previously published studies evaluating online cognitive behaviour therapy for child anxiety (BRAVE-ONLINE). The study included 63 children 7-12 years of age (M = 9.49, SD = 1.37) and 71 adolescents 12-18 years of age (M = 13.90, SD = 1.68). SRPs, severity of anxiety diagnosis, anxiety symptoms, number of diagnoses, depressive symptoms, and global functioning were assessed at pre-, post-, and 6-month follow-up assessment points. SRPs were positively related to anxiety symptoms and severity for children and were positively related to depression for adolescents. SRPs did not differ between male and female participants, between children and adolescents, or between those who had generalised anxiety disorder in their profile and those who did not. Finally, children but not adolescents participating in the online program demonstrated a significantly greater reduction in SRPs from pre- to posttreatment compared to the waitlist group, and these gains were maintained at 6-month follow-up. Treatment focusing on child anxiety alone may reduce SRPs in children but not adolescents. Although further research is clearly needed, clinicians should ensure that they assess for SRPs in their teenage clients and directly target SRPs in treatment where required.
Teaching citizen science skills online: Implications for invasive species training programs
Newman, G.; Crall, A.; Laituri, M.; Graham, J.; Stohlgren, T.; Moore, J.C.; Kodrich, K.; Holfelder, K.A.
2010-01-01
Citizen science programs are emerging as an efficient way to increase data collection and help monitor invasive species. Effective invasive species monitoring requires rigid data quality assurances if expensive control efforts are to be guided by volunteer data. To achieve data quality, effective online training is needed to improve field skills and reach large numbers of remote sentinel volunteers critical to early detection and rapid response. The authors evaluated the effectiveness of online static and multimedia tutorials to teach citizen science volunteers (n = 54) how to identify invasive plants; establish monitoring plots; measure percent cover; and use Global Positioning System (GPS) units. Participants trained using static and multimedia tutorials provided less (p <.001) correct species identifications (63% and 67%) than did professionals (83%) across all species, but they did not differ (p =.125) between each other. However, their ability to identify conspicuous species was comparable to that of professionals. The variability in percent plant cover estimates between static (??10%) and multimedia (??13%) participants did not differ (p =.86 and.08, respectively) from those of professionals (??9%). Trained volunteers struggled with plot setup and GPS skills. Overall, the online approach used did not influence conferred field skills and abilities. Traditional or multimedia online training augmented with more rigorous, repeated, and hands-on, in-person training in specialized skills required for more difficult tasks will likely improve volunteer abilities, data quality, and overall program effectiveness. ?? Taylor & Francis Group, LLC.
Linear programming models and methods of matrix games with payoffs of triangular fuzzy numbers
Li, Deng-Feng
2016-01-01
This book addresses two-person zero-sum finite games in which the payoffs in any situation are expressed with fuzzy numbers. The purpose of this book is to develop a suite of effective and efficient linear programming models and methods for solving matrix games with payoffs in fuzzy numbers. Divided into six chapters, it discusses the concepts of solutions of matrix games with payoffs of intervals, along with their linear programming models and methods. Furthermore, it is directly relevant to the research field of matrix games under uncertain economic management. The book offers a valuable resource for readers involved in theoretical research and practical applications from a range of different fields including game theory, operational research, management science, fuzzy mathematical programming, fuzzy mathematics, industrial engineering, business and social economics. .
A Two-Phase Support Method for Solving Linear Programs: Numerical Experiments
Directory of Open Access Journals (Sweden)
Mohand Bentobache
2012-01-01
Full Text Available We develop a single artificial variable technique to initialize the primal support method for solving linear programs with bounded variables. We first recall the full artificial basis technique, then we will present the proposed algorithm. In order to study the performances of the suggested algorithm, an implementation under the MATLAB programming language has been developed. Finally, we carry out an experimental study about CPU time and iterations number on a large set of the NETLIB test problems. These test problems are practical linear programs modelling various real-life problems arising from several fields such as oil refinery, audit staff scheduling, airline scheduling, industrial production and allocation, image restoration, multisector economic planning, and data fitting. It has been shown that our approach is competitive with our implementation of the primal simplex method and the primal simplex algorithm implemented in the known open-source LP solver LP_SOLVE.
Katz, Josh M; Winter, Carl K; Buttrey, Samuel E; Fadel, James G
2012-03-01
Western and guideline based diets were compared to determine if dietary improvements resulting from following dietary guidelines reduce acrylamide intake. Acrylamide forms in heat treated foods and is a human neurotoxin and animal carcinogen. Acrylamide intake from the Western diet was estimated with probabilistic techniques using teenage (13-19 years) National Health and Nutrition Examination Survey (NHANES) food consumption estimates combined with FDA data on the levels of acrylamide in a large number of foods. Guideline based diets were derived from NHANES data using linear programming techniques to comport to recommendations from the Dietary Guidelines for Americans, 2005. Whereas the guideline based diets were more properly balanced and rich in consumption of fruits, vegetables, and other dietary components than the Western diets, acrylamide intake (mean±SE) was significantly greater (Plinear programming and results demonstrate that linear programming techniques can be used to model specific diets for the assessment of toxicological and nutritional dietary components.
Levesque, Deborah A; Johnson, Janet L; Prochaska, Janice M
2017-01-01
This paper describes the theoretical foundation, development, and feasibility testing of an online, evidence-based intervention for teen dating violence prevention designed for dissemination. Teen Choices: A Program for Healthy, Non-Violent Relationships relies on the Transtheoretical Model of Behavior Change and expert system technology to deliver assessments and feedback matched to stage of change for using healthy relationship skills. The program also tailors feedback to dating status, risk level, and other key characteristics. Ninety-nine students from high schools in Tennessee and Rhode Island completed a Teen Choices session and 97 completed an 11-item acceptability evaluation. 100% of participants completed the intervention session as intended. Evaluations of the program were favorable. For example, 88.7% agreed the program feedback was easy to understand, and 86.7% agreed that the program could help people develop healthier relationships. Findings provide encouraging evidence of the acceptability and feasibility of this approach to dating violence prevention.
Lynds, S. E.; Buhr, S. M.
2011-12-01
The Climate Literacy and Energy Awareness Network (CLEAN) Pathway, is a National Science Digital Library (NSDL) Pathways project that was begun in 2010. The main goal of CLEAN is to generate a reviewed collection of educational resources that are aligned with the Essential Principles of Climate Science (EPCS). Another goal of the project is to support a community that will assist students, teachers, and citizens in climate literacy. A complementary program begun in 2010 is the ICEE (Inspiring Climate Education Excellence) program, which is developing online modules and courses designed around the climate literacy principles for use by teachers and other interested citizens. In these projects, we learn about teacher needs through a variety of evaluation mechanisms. The programs use evaluation to assist in the process of providing easy access to high quality climate and energy learning resources that meet classroom requirements. The internal evaluation of the CLEAN program is multidimensional. At the CLEAN resource review camps, teachers and scientists work together in small groups to assess the value of online resources for use in the classroom. The review camps are evaluated using observation and feedback surveys; the resulting evaluation reports provide information to managers to fine-tune future camps. In this way, a model for effective climate resource development meetings has been refined. Evaluation methods used in ICEE and CLEAN include teacher needs assessment surveys, teacher feedback at professional development opportunities, scientist feedback at resource review workshops, and regular analysis of online usage of resources, forums, and education modules. This paper will review the most successful strategies for evaluating the effectiveness of online climate and energy education resources and their use by educators and the general public.
Patterns of success: online self-monitoring in a web-based behavioral weight control program.
Krukowski, Rebecca A; Harvey-Berino, Jean; Bursac, Zoran; Ashikaga, Taka; West, Delia Smith
2013-02-01
Online weight control technologies could reduce barriers to treatment, including increased ease and convenience of self-monitoring. Self-monitoring consistently predicts outcomes in behavioral weight loss programs; however, little is known about patterns of self-monitoring associated with success. The current study examines 161 participants (92% women; 31% African American; mean body mass index = 35.7 ± 5.7) randomized to a 6-month online behavioral weight control program that offered weekly group "chat" sessions and online self-monitoring. Self-monitoring log-ins were continuously monitored electronically during treatment and examined in association with weight change and demographics. Weekend and weekday log-ins were examined separately and length of periods of continuous self-monitoring were examined. We found that 91% of participants logged in to the self-monitoring webpage at least once. Over 6 months, these participants monitored on an average of 28% of weekdays and 17% of weekend days, with most log-ins earlier in the program. Women were less likely to log-in, and there were trends for greater self-monitoring by older participants. Race, education, and marital status were not significant predictors of self-monitoring. Both weekday and weekend log-ins were significant independent predictors of weight loss. Patterns of consistent self-monitoring emerged early for participants who went on to achieve greater than a 5% weight loss. Patterns of online self-monitoring were strongly associated with weight loss outcomes. These results suggest a specific focus on consistent self-monitoring early in a behavioral weight control program might be beneficial for achieving clinically significant weight losses.
A User’s Manual for Interactive Linear Control Programs on IBM/3033.
1982-12-01
assistance in solving aDplications of linear control theory. The Linear Control Program ( LINCON ) and its user’s guide satisfy this need. A series of...Do 1473 DITION OF I’OV Of I OISOLRTE SIN 0102-014-4401 SECURITY CLASIPICATION OF To PAGE (WnT =e0 #~ LINCON consists of twu groups: matrix manipulation... LINCON ) was f.irst developed by Melsa [ 1] and adapted for batch use a- NPS by Desjardins C 2]. Alth:’agh the original intent of this thesis was simply
A comparison of online versus workbook delivery of a self-help positive parenting program.
Sanders, Matthew R; Dittman, Cassandra K; Farruggia, Susan P; Keown, Louise J
2014-06-01
A noninferiority randomized trial design compared the efficacy of two self-help variants of the Triple P-Positive Parenting Program: an online version and a self-help workbook. We randomly assigned families of 193 children displaying early onset disruptive behavior difficulties to the online (N = 97) or workbook (N = 96) interventions. Parents completed questionnaire measures of child behavior, parenting, child maltreatment risk, personal adjustment and relationship quality at pre- and post-intervention and again at 6-month follow up. The short-term intervention effects of the Triple P Online program were not inferior to the workbook on the primary outcomes of disruptive child behavior and dysfunctional parenting as reported by both mothers and fathers. Both interventions were associated with significant and clinically meaningful declines from pre- to post-intervention in levels of disruptive child behavior, dysfunctional parenting styles, risk of child maltreatment, and inter-parental conflict on both mother and father report measures. Intervention effects were largely maintained at 6-month follow up, thus supporting the use of self-help parenting programs within a comprehensive population-based system of parenting support to reduce child maltreatment and behavioral problems in children.
Moore, Janet C.; Shelton, Kaye
2013-01-01
As combinations of place-based, blended and fully online education proliferate, so do options for support and services. Aligning with regional accreditation criteria, the Sloan-C Quality Scorecard for the Administration of Online Programs is a useful way for institutions to measure and compare the quality of social and student engagement and…
Gleim, Daniela; Kuhl, Detlef
2017-07-01
This paper describes the 100% online teaching concepts of the degree program Online M.Sc. Wind Energy Systems. These are the synchronous teaching concept, the asynchronous learning concept and a combination of synchronous and asynchronous learning concept. The challenges that students and teachers have to face in the implementation of these teaching concepts are described here.
Stability of multi-objective bi-level linear programming problems under fuzziness
Directory of Open Access Journals (Sweden)
Abo-Sinna Mahmoud A.
2013-01-01
Full Text Available This paper deals with multi-objective bi-level linear programming problems under fuzzy environment. In the proposed method, tentative solutions are obtained and evaluated by using the partial information on preference of the decision-makers at each level. The existing results concerning the qualitative analysis of some basic notions in parametric linear programming problems are reformulated to study the stability of multi-objective bi-level linear programming problems. An algorithm for obtaining any subset of the parametric space, which has the same corresponding Pareto optimal solution, is presented. Also, this paper established the model for the supply-demand interaction in the age of electronic commerce (EC. First of all, the study uses the individual objectives of both parties as the foundation of the supply-demand interaction. Subsequently, it divides the interaction, in the age of electronic commerce, into the following two classifications: (i Market transactions, with the primary focus on the supply demand relationship in the marketplace; and (ii Information service, with the primary focus on the provider and the user of information service. By applying the bi-level programming technique of interaction process, the study will develop an analytical process to explain how supply-demand interaction achieves a compromise or why the process fails. Finally, a numerical example of information service is provided for the sake of illustration.
Zimmermann, Karl-Heinz; Achtziger, Wolfgang
2001-09-01
The size of a systolic array synthesized from a uniform recurrence equation, whose computations are mapped by a linear function to the processors, matches the problem size. In practice, however, there exist several limiting factors on the array size. There are two dual schemes available to derive arrays of smaller size from large-size systolic arrays based on the partitioning of the large-size arrays into subarrays. In LSGP, the subarrays are clustered one-to-one into the processors of a small-size array, while in LPGS, the subarrays are serially assigned to a reduced-size array. In this paper, we propose a common methodology for both LSGP and LPGS based on polyhedral partitionings of large-size k-dimensional systolic arrays which are synthesized from n-dimensional uniform recurrences by linear mappings for allocation and timing. In particular, we address the optimization problem of finding optimal piecewise linear timing functions for small-size arrays. These are mappings composed of linear timing functions for the computations of the subarrays. We study a continuous approximation of this problem by passing from piecewise linear to piecewise quasi-linear timing functions. The resultant problem formulation is then a quadratic programming problem which can be solved by standard algorithms for nonlinear optimization problems.
DEFF Research Database (Denmark)
Sokoler, Leo Emil; Frison, Gianluca; Skajaa, Anders
2015-01-01
We develop an efficient homogeneous and self-dual interior-point method (IPM) for the linear programs arising in economic model predictive control of constrained linear systems with linear objective functions. The algorithm is based on a Riccati iteration procedure, which is adapted to the linear...... is significantly faster than several state-of-the-art IPMs based on sparse linear algebra, and 2) warm-start reduces the average number of iterations by 35-40%.......We develop an efficient homogeneous and self-dual interior-point method (IPM) for the linear programs arising in economic model predictive control of constrained linear systems with linear objective functions. The algorithm is based on a Riccati iteration procedure, which is adapted to the linear...
Fixed-dimensional parallel linear programming via relative {Epsilon}-approximations
Energy Technology Data Exchange (ETDEWEB)
Goodrich, M.T.
1996-12-31
We show that linear programming in IR{sup d} can be solved deterministically in O((log log n){sup d}) time using linear work in the PRAM model of computation, for any fixed constant d. Our method is developed for the CRCW variant of the PRAM parallel computation model, and can be easily implemented to run in O(log n(log log n){sup d-1}) time using linear work on an EREW PRAM. A key component in these algorithms is a new, efficient parallel method for constructing E-nets and E-approximations (which have wide applicability in computational geometry). In addition, we introduce a new deterministic set approximation for range spaces with finite VC-exponent, which we call the {delta}-relative {epsilon}-approximation, and we show how such approximations can be efficiently constructed in parallel.
NTPBSI: National Toxicology Program Bioassay On-line Database Structure-Index Locator File. Database contains the results collected on approxiately 300 toxicity studies from shorter duration test and from genetic toxicity studies, both in vitro and in vivo tests.
LDRD final report on massively-parallel linear programming : the parPCx system.
Energy Technology Data Exchange (ETDEWEB)
Parekh, Ojas (Emory University, Atlanta, GA); Phillips, Cynthia Ann; Boman, Erik Gunnar
2005-02-01
This report summarizes the research and development performed from October 2002 to September 2004 at Sandia National Laboratories under the Laboratory-Directed Research and Development (LDRD) project ''Massively-Parallel Linear Programming''. We developed a linear programming (LP) solver designed to use a large number of processors. LP is the optimization of a linear objective function subject to linear constraints. Companies and universities have expended huge efforts over decades to produce fast, stable serial LP solvers. Previous parallel codes run on shared-memory systems and have little or no distribution of the constraint matrix. We have seen no reports of general LP solver runs on large numbers of processors. Our parallel LP code is based on an efficient serial implementation of Mehrotra's interior-point predictor-corrector algorithm (PCx). The computational core of this algorithm is the assembly and solution of a sparse linear system. We have substantially rewritten the PCx code and based it on Trilinos, the parallel linear algebra library developed at Sandia. Our interior-point method can use either direct or iterative solvers for the linear system. To achieve a good parallel data distribution of the constraint matrix, we use a (pre-release) version of a hypergraph partitioner from the Zoltan partitioning library. We describe the design and implementation of our new LP solver called parPCx and give preliminary computational results. We summarize a number of issues related to efficient parallel solution of LPs with interior-point methods including data distribution, numerical stability, and solving the core linear system using both direct and iterative methods. We describe a number of applications of LP specific to US Department of Energy mission areas and we summarize our efforts to integrate parPCx (and parallel LP solvers in general) into Sandia's massively-parallel integer programming solver PICO (Parallel Interger and
Directory of Open Access Journals (Sweden)
Weihua Jin
2013-01-01
Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.
Directory of Open Access Journals (Sweden)
Feng Liu
2013-06-01
Full Text Available In this study, we research the problem of network revenue management with customer choice based on the Origin-Destination (O-D demands. By dividing customers into different segments according to O-D pairs, we consider a network capacity control problem where each customer chooses the open product within the segment he belongs to. Starting with a Markov Decision Process (MDP formulation, we approximate the value function with an affine function of the state vector. The affine function approximation results in a new Linear Program (LP which yields tighter bounds than the Choice-based Deterministic Linear Program (CDLP. We give a column generation procedure for solving the LP within a desired optimality tolerance and present numerical results which show the policy perform from our solution approach can outperform that from the CDLP.
Linear programming to build food-based dietary guidelines: Romanian food baskets
DEFF Research Database (Denmark)
Parlesak, Alexandr; Robertson, Aileen; Hondru, Gabriela
basket that incorporates only WHO food-based dietary guidelines does not meet all the recommended nutrient intake values for, for example, vitamins A, D, K, iodine and calcium. • The version of a Romanian fully nutritious, health-promoting food basket for a family (two adults, two children) costs 19.......65 lei (~€ 4.46) for a day. • Key nutrients, primarily vitamin D, calcium, potassium and iron, were found to control the overall price. • The least expensive basket (one day’s rations) is monotonous and the linear programming approach is used to select a wide range of foods that can be recommended......, potatoes and fish and considerably less meat, fats, oils and sugar. In conclusion, the linear programming methodology can facilitate the development of national dietary recommendations that meet both recommended nutrient intake values and WHO food-based dietary guidelines in a cost-efficient manner. How...
Interior point algorithm for linear programming used in transmission network synthesis
Energy Technology Data Exchange (ETDEWEB)
Sanchez, I.G.; Romero, R.; Mantovani, J.R.S. [Electrical Engineering Department, UNESP, CEP 15385000, Ilha Solteira, SP (Brazil); Garcia, A. [Power Systems Department, University of Campinas, UNICAMP, CEP 13083970, Campinas, SP (Brazil)
2005-09-15
This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), or a branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithms used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (author) [Transmission network synthesis; Interior point method; Relaxed optimization models; Network expansion planning; Transportation model; Constructive heuristic algorithms].
Directory of Open Access Journals (Sweden)
Bahram Izadi
2013-09-01
Full Text Available Among various statistical and data mining discriminant analysis proposed so far for group classification, linear programming discriminant analysis have recently attracted the researchers’ interest. This study evaluates multi-group discriminant linear programming (MDLP for classification problems against well-known methods such as neural networks, support vector machine, and so on. MDLP is less complex compared to other methods and does not suffer from local optima. However, sometimes classification becomes infeasible due to insufficient data in databases such as in the case of an Internet Service Provider (ISP small and medium-sized market considered in this research. This study proposes a fuzzy Delphi method to select and gather required data. The results show that the performance of MDLP is better than other methods with respect to correct classification, at least for small and medium-sized datasets.
Refining and end use study of coal liquids II - linear programming analysis
Energy Technology Data Exchange (ETDEWEB)
Lowe, C.; Tam, S.
1995-12-31
A DOE-funded study is underway to determine the optimum refinery processing schemes for producing transportation fuels that will meet CAAA regulations from direct and indirect coal liquids. The study consists of three major parts: pilot plant testing of critical upgrading processes, linear programming analysis of different processing schemes, and engine emission testing of final products. Currently, fractions of a direct coal liquid produced form bituminous coal are being tested in sequence of pilot plant upgrading processes. This work is discussed in a separate paper. The linear programming model, which is the subject of this paper, has been completed for the petroleum refinery and is being modified to handle coal liquids based on the pilot plant test results. Preliminary coal liquid evaluation studies indicate that, if a refinery expansion scenario is adopted, then the marginal value of the coal liquid (over the base petroleum crude) is $3-4/bbl.
Multistep Linear Programming Approaches for Decoding Low-Density Parity-Check Codes
Institute of Scientific and Technical Information of China (English)
LIU Haiyang; MA Lianrong; CHEN Jie
2009-01-01
The problem of improving the performance of linear programming (LP) decoding of low-density padty-check (LDPC) codes is considered in this paper. A multistep linear programming (MLP) algorithm was developed for decoding LDPC codes that includes a slight increase in computational complexity. The MLP decoder adaptively adds new constraints which are compatible with a selected check node to refine the re-sults when an error is reported by the odginal LP decoder. The MLP decoder result is shown to have the maximum-likelihood (ML) certificate property. Simulations with moderate block length LDPC codes suggest that the MLP decoder gives better performance than both the odginal LP decoder and the conventional sum-product (SP) decoder.
Carter, Wendy; Fergus, Karen; Ahmad, Saunia; McLeod, Deborah; Stephen, Joanne
2015-04-14
Development of psychological interventions delivered via the Internet is a rapidly growing field with the potential to make vital services more accessible. However, there is a corresponding need for careful examination of factors that contribute to effectiveness of Internet-delivered interventions, especially given the observed high dropout rates relative to traditional in-person (IP) interventions. Research has found that the involvement of an online therapist in a Web-based intervention reduces treatment dropout. However, the role of such online therapists is seldom well articulated and varies considerably across programs making it difficult to discern processes that are important for online therapist involvement.In this paper, we introduce the concept of "therapeutic facilitation" to describe the role of the online therapist that was developed and further refined in the context of a Web-based, asynchronous psychosocial intervention for couples affected by breast cancer called Couplelinks. Couplelinks is structured into 6 dyadic learning modules designed to be completed on a weekly basis in consultation with a facilitator through regular, asynchronous, online text-based communication.Principles of therapeutic facilitation derived from a combination of theory underlying the intervention and pilot-testing of the first iteration of the program are described. Case examples to illustrate these principles as well as commonly encountered challenges to online facilitation are presented. Guidelines and principles for therapeutic facilitation hold relevance for professionally delivered online programs more broadly, beyond interventions for couples and cancer. ©Wendy Carter, Karen Fergus, Saunia Ahmad, Deborah McLeod, Joanne Stephen. Originally published in JMIR Cancer (http://cancer.jmir.org), 14.04.2015.
Cowan, John E.; Menchaca, Michael P.
2014-01-01
This study reports an analysis of 10?years in the life of the Internet-based Master in Educational Technology program (iMET) at Sacramento State University. iMET is a hybrid educational technology master's program delivered 20% face to face and 80% online. The program has achieved a high degree of success, with a course completion rate of 93% and…
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique.
DEFF Research Database (Denmark)
Parlesak, A.; Tetens, Inge; Dejgård Jensen, Jørgen
2016-01-01
programming. The FBs were defined using five different constraints: cultural acceptability (CA), or dietary guidelines (DG), or nutrient recommendations (N), or cultural acceptability and nutrient recommendations (CAN), or dietary guidelines and nutrient recommendations (DGN). The variety and number of foods...... variety of foods contained from 70 (CAN) to 134 (DGN) foods and cost between DKK 60 (€ 8.1, N) and DKK 125 (€ 16.8, DGN). Ensuring that the food baskets cover both dietary guidelines and nutrient recommendations doubled the cost while cultural acceptability (CAN) tripled it. Use of linear programming...
Online learning tools in an M.Ed. in Earth Sciences program
Richardson, E.
2011-12-01
Penn State's Master of Education in Earth Sciences program is a fully online 30-credit degree program serving mid-career secondary science teachers. Teachers in the program have a diverse background in science and math, are usually many years removed from their most recent degree, and are often deficient in the same geoscience skills as are beginning undergraduates. For example, they habitually assign incorrect causal relationships to concepts that are taught at the same time (such as sea-floor spreading and magnetic field reversals), and they have trouble with both object and spatial visualization. Program faculty also observe anecdotally that many teachers enter the program lacking the ability to describe their mental model of a given Earth science process, making it difficult to identify teachers' knowledge gaps. We have implemented many technical strategies to enhance program content delivery while trying to minimize the inherent barriers to completing quantitative assignments online and at a distance. These barriers include competence with and access to sophisticated data analysis and plotting programs commonly used by scientists. Here, I demonstrate two technical tools I use frequently to strengthen online content delivery and assessment. The first, Jing, is commercially-available, free, and platform-independent. Jing allows the user to make screencasts with narration and embed them into a web page as a flash movie or as an external link. The second is a set of simple sketching tools I have created using the programming language Processing, which is a free, open source, platform-independent language built on Java. The integration of easy-to-use drawing tools into problem sets and other assessments has enabled faculty to appraise a learner's grasp of the material without the steep technical learning curve and expense inherent in most computer graphics packages. A serendipitous benefit of teaching with these tools is that they are easy to learn and freely
Lehtinen, B.; Geyser, L. C.
1984-01-01
AESOP is a computer program for use in designing feedback controls and state estimators for linear multivariable systems. AESOP is meant to be used in an interactive manner. Each design task that the program performs is assigned a "function" number. The user accesses these functions either (1) by inputting a list of desired function numbers or (2) by inputting a single function number. In the latter case the choice of the function will in general depend on the results obtained by the previously executed function. The most important of the AESOP functions are those that design,linear quadratic regulators and Kalman filters. The user interacts with the program when using these design functions by inputting design weighting parameters and by viewing graphic displays of designed system responses. Supporting functions are provided that obtain system transient and frequency responses, transfer functions, and covariance matrices. The program can also compute open-loop system information such as stability (eigenvalues), eigenvectors, controllability, and observability. The program is written in ANSI-66 FORTRAN for use on an IBM 3033 using TSS 370. Descriptions of all subroutines and results of two test cases are included in the appendixes.
APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP
Directory of Open Access Journals (Sweden)
Monalisha Pattnaik
2014-12-01
Full Text Available Background: This paper explores the solutions to the fuzzy optimization linear program problems (FOLPP where some parameters are fuzzy numbers. In practice, there are many problems in which all decision parameters are fuzzy numbers, and such problems are usually solved by either probabilistic programming or multi-objective programming methods. Methods: In this paper, using the concept of comparison of fuzzy numbers, a very effective method is introduced for solving these problems. This paper extends linear programming based problem in fuzzy environment. With the problem assumptions, the optimal solution can still be theoretically solved using the two phase simplex based method in fuzzy environment. To handle the fuzzy decision variables can be initially generated and then solved and improved sequentially using the fuzzy decision approach by introducing robust ranking technique. Results and conclusions: The model is illustrated with an application and a post optimal analysis approach is obtained. The proposed procedure was programmed with MATLAB (R2009a version software for plotting the four dimensional slice diagram to the application. Finally, numerical example is presented to illustrate the effectiveness of the theoretical results, and to gain additional managerial insights.
The solution of the optimization problem of small energy complexes using linear programming methods
Ivanin, O. A.; Director, L. B.
2016-11-01
Linear programming methods were used for solving the optimization problem of schemes and operation modes of distributed generation energy complexes. Applicability conditions of simplex method, applied to energy complexes, including installations of renewable energy (solar, wind), diesel-generators and energy storage, considered. The analysis of decomposition algorithms for various schemes of energy complexes was made. The results of optimization calculations for energy complexes, operated autonomously and as a part of distribution grid, are presented.
Stress-constrained truss topology optimization problems that can be solved by linear programming
DEFF Research Database (Denmark)
Stolpe, Mathias; Svanberg, Krister
2004-01-01
We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....
Institute of Scientific and Technical Information of China (English)
HUANG Hui; FEI Pu-sheng; YUAN Yuan
2005-01-01
A primal-dual infeasible-interior-point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm,moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.
Bin-objective shape optimization based on linear programming model of arch dam
Institute of Scientific and Technical Information of China (English)
JIN Hai; LIN Gao; YANG Ming-sheng
2007-01-01
Bin-objective shape optimization of arch dam based on linear programming model is discussed to minimize both dam volume and maximal tensile stress. The importance of weight coefficient of the above two objectives is chosen according to the value of importance ratio. The influence of weight coefficient to the optimization result is discussed in detail and the numerical example shows that both the model and method proposed is doable.
A linear programming formulation of Mader's edge-disjoint paths problem
Keijsper, J.C.M.; Pendavingh, R.A.; Stougie, L.
2006-01-01
We give a dual pair of linear programs for a minâ€“max result of Mader describing the maximum number of edge-disjoint T-paths in a graph G=(V,E) with TV. We conclude that there exists a polynomial-time algorithm (based on the ellipsoid method) for finding the maximum number of T-paths in a
A linear programming approach to characterizing norm bounded uncertainty from experimental data
Scheid, R. E.; Bayard, D. S.; Yam, Y.
1991-01-01
The linear programming spectral overbounding and factorization (LPSOF) algorithm, an algorithm for finding a minimum phase transfer function of specified order whose magnitude tightly overbounds a specified nonparametric function of frequency, is introduced. This method has direct application to transforming nonparametric uncertainty bounds (available from system identification experiments) into parametric representations required for modern robust control design software (i.e., a minimum-phase transfer function multiplied by a norm-bounded perturbation).
Xie, Yuanyuan; Chen, Ping; Hua, Lei; Hou, Keyong; Wang, Yongchao; Wang, Haiyan; Li, Haiyang
2016-01-01
The specific locations of the double bonds in linear olefins can facilitate olefin catalytic synthetic reactions to improve the quality of target olefin products. We developed a simple and efficient approach based on single photon ionization time-of-flight mass spectrometry (SPI-TOFMS) combined with online ozonolysis to identify and quantify the linear olefin double bond positional isomers. The online ozonolysis cleaved the olefins at the double bond positions that led to formation of corresponding characteristic aldehydes. The aldehydes were then detected by SPI-TOFMS to achieve unique spectrometric "fingerprints" for each linear olefin to successfully identify the isomeric ones. To accurately quantify the isomeric components in olefin mixtures, an algorithm was proposed to quantify three isomeric olefin mixtures based on characteristic ion intensities and their equivalent ionization coefficients. The relative concentration errors for the olefin components were lower than 2.5% while the total analysis time was less than 2 min. These results demonstrate that the online ozonolysis SPI-TOFMS has the potential for real-time monitoring of catalytic olefin synthetic reactions.
A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem
Diaby, Moustapha
2008-01-01
In this paper, we present a new linear programming (LP) formulation of the Traveling Salesman Problem (TSP). The proposed model has O(n^8) variables and O(n^7) constraints, where n is the number of cities. Our numerical experimentation shows that computational times for the proposed linear program are several orders of magnitude smaller than those for the existing model [3].
Institute of Scientific and Technical Information of China (English)
ZhuDetong
2004-01-01
This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems. Using the duality theory of the linear programming and convex theory, the generalized directional derivative of the general multicommodity minimal cost flow problems is derived. The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.
Schipper, R.A.; Stoorvogel, J.J.; Jansen, D.M.
1995-01-01
The paper deals with linear programming as a tool for land use analysis at the sub-regional level. A linear programming model of a case study area, the Neguev settlement in the Atlantic zone of Costa Rica, is presented. The matrix of the model includes five submatrices each encompassing a different
Haney, Nora M; Kinsella, Stuart D; Morey, José M
2014-02-01
Recent media publications have indicated a tough job market in medical specialty positions for medical school graduates, specifically in the field of radiology. Internet search tools, such as Google Trends, have proved useful in the prediction of certain diseases on the basis of the search volume index for a specific term. The authors hypothesized that online search tools might be useful in the prediction of US medical school graduates' interest in residency positions in radiology. Google Trends indicated an increase over time in searches for "radiology salary" and a decrease over time in searches for "radiology residency." National Resident Matching Program results for diagnostic radiology showed an increase from 2004 to 2009 in the percentage of US graduates entering radiology but a dramatic drop from 2010 to 2013. This occurred even while the total number of US graduates active in the National Resident Matching Program increased. This finding might have been foretold on the basis of online query result trends. Online search data may be a useful insight into the interests of US medical school graduates and may be predictive of unfilled radiology residency positions and eventual increased shortages of community radiologists coming from US medical schools.
Nahm, Eun-Shim; Orwig, Denise; Resnick, Barbara; Magaziner, Jay; Bellantoni, Michele; Sterling, Robert
2012-01-12
Hip fracture is a significant health problem for older adults and generally requires surgery followed by intensive rehabilitation. Informal caregivers (CGs) can provide vital assistance to older adults recovering from hip fracture. Caregiving is a dyadic process that affects both CGs and care recipients (CRs). In a feasibility study, we assessed the effects of using a theory-based online hip fracture resource program for CGs on both CGs and CRs. In this article, we discuss our recruitment process and the lessons learned. Participants were recruited from six acute hospitals, and CGs used the online resource program for 8 weeks. A total of 256 hip fracture patients were screened, and 164 CRs were ineligible. CG screening was initiated when CRs were determined to be eligible. Among 41 eligible dyads, 36 dyads were recruited. Several challenges to the recruitment of these dyads for online studies were identified, including a low number of eligible dyads in certain hospitals and difficulty recruiting both the CR and the CG during the short hospital stay. Field nurses often had to make multiple trips to the hospital to meet with both the CR and the CG. Thus, when a subject unit is a dyad recruited from acute settings, the resources required for the recruitment may be more than doubled. These challenges could be successfully alleviated with careful planning, competent field staff members, collaboration with hospital staff members, and efficient field operations.
Silverman, Henry; Strosberg, Martin; Luna, Florencia; Philpott, Sean; Hemmerle, Cheryl A
2013-12-01
Several training programs sponsored by the NIH/Fogarty International Center's International Research Ethics Education and Curriculum Development Program offer online graduate-level courses in research ethics to participants in lowand middle-income countries. This paper describes the evaluation of four of these online courses and recommendations for improvements to achieve the highest-quality design and delivery. We used an evaluation matrix consisting of 95 criteria based on recommended best practices in eLearning. Our results showed that these courses are developing or meeting nearly 73% of the criteria, while they are not meeting approximately 21% of the criteria. Together, one or more of the courses are developing or meeting 89 of the 95 criteria. These results suggest that the necessary skills and expertise exist in these programs to bring all of the eLearning courses close to 100% proficiency by sharing a common set of best practices. This paper is part of a collection of articles analyzing the Fogarty International Center's International Research Ethics Education and Curriculum Development Program.
IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS
Fogle, F. R.
1994-01-01
IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.
Online focus groups as an HIV prevention program for gay, bisexual, and queer adolescent males.
Ybarra, Michele L; DuBois, L Zachary; Parsons, Jeffrey T; Prescott, Tonya L; Mustanski, Brian
2014-12-01
Seventy-five 14-18-year-old gay, bisexual, and queer (GBQ) males provided feedback about how their participation in national, online focus groups (FG) about GBQ sexual health related topics resulted in behavioral and attitudinal changes. Most sexually experienced youth agreed that their participation positively changed their views and behavioral intentions. Some said that being in the FG made them more comfortable talking about sex, their sexuality, and making safer choices such as negotiating condoms. Others indicated intentions to become more involved in the LGBT community. Sexually inexperienced FG participants similarly said that the FG discussion positively affected them-most commonly by reducing their sense of isolation as young GBQ men who were waiting to have sex. Many also thought that they would become more vocal advocates of abstinence and/or safe sex. Online FGs and facilitated discussion boards should be further explored as a low-cost HIV prevention program for GBQ youth.
Ryan, Jason C; Banerjee, Ashis Gopal; Cummings, Mary L; Roy, Nicholas
2014-06-01
Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience-based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human-automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative.
IAEA programs in empowering the nuclear medicine profession through online educational resources.
Pascual, Thomas Nb; Dondi, Maurizio; Paez, Diana; Kashyap, Ravi; Nunez-Miller, Rodolfo
2013-05-01
The International Atomic Energy Agency's (IAEA) programme in human health aims to enhance the capabilities in Member States to address needs related to the prevention, diagnosis, and treatment of diseases through the application of nuclear techniques. It has the specific mission of fostering the application of nuclear medicine techniques as part of the clinical management of certain types of diseases. Attuned to the continuous evolution of this specialty as well as to the advancement and diversity of methods in delivering capacity building efforts in this digital age, the section of nuclear medicine of the IAEA has enhanced its program by incorporating online educational resources for nuclear medicine professionals into its repertoire of projects to further its commitment in addressing the needs of its Member States in the field of nuclear medicine. Through online educational resources such as the Human Health Campus website, e-learning modules, and scheduled interactive webinars, a validation of the commitment by the IAEA in addressing the needs of its Member States in the field of nuclear medicine is strengthened while utilizing the advanced internet and communications technology which is progressively becoming available worldwide. The Human Health Campus (www.humanhealth.iaea.org) is the online educational resources initiative of the Division of Human Health of the IAEA geared toward enhancing professional knowledge of health professionals in radiation medicine (nuclear medicine and diagnostic imaging, radiation oncology, and medical radiation physics), and nutrition. E-learning modules provide an interactive learning environment to its users while providing immediate feedback for each task accomplished. Webinars, unlike webcasts, offer the opportunity of enhanced interaction with the learners facilitated through slide shows where the presenter guides and engages the audience using video and live streaming. This paper explores the IAEA's available online
A new gradient-based neural network for solving linear and quadratic programming problems.
Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S
2001-01-01
A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.
Myers, Lynnea H; Jeffery, Alvin D; Nimmagadda, Heather; Werthman, Jennifer Ann; Jordan, Kasey
2015-11-01
Online and distance education is becoming increasingly common in higher education. As students explore graduate programs, they are often overwhelmed with the variety of program delivery options available. For graduate students pursuing a Doctor of Philosophy (PhD), a particular concern relates to building a community of scholars and how to do so through an online and distance learning program. Through a review of literature and personal stories, this article will highlight innovative strategies utilized by a cohort of PhD students related to online and distance learning and developing a community of scholars. PhD students developed a community of scholars using innovative strategies to communicate and collaborate. Building a community of scholars is possible through online and distance education using simple forms of technology to connect and collaborate. Copyright 2015, SLACK Incorporated.
Zörnig, Peter
2015-08-01
We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.
Wavelet-linear genetic programming: A new approach for modeling monthly streamflow
Ravansalar, Masoud; Rajaee, Taher; Kisi, Ozgur
2017-06-01
The streamflows are important and effective factors in stream ecosystems and its accurate prediction is an essential and important issue in water resources and environmental engineering systems. A hybrid wavelet-linear genetic programming (WLGP) model, which includes a discrete wavelet transform (DWT) and a linear genetic programming (LGP) to predict the monthly streamflow (Q) in two gauging stations, Pataveh and Shahmokhtar, on the Beshar River at the Yasuj, Iran were used in this study. In the proposed WLGP model, the wavelet analysis was linked to the LGP model where the original time series of streamflow were decomposed into the sub-time series comprising wavelet coefficients. The results were compared with the single LGP, artificial neural network (ANN), a hybrid wavelet-ANN (WANN) and Multi Linear Regression (MLR) models. The comparisons were done by some of the commonly utilized relevant physical statistics. The Nash coefficients (E) were found as 0.877 and 0.817 for the WLGP model, for the Pataveh and Shahmokhtar stations, respectively. The comparison of the results showed that the WLGP model could significantly increase the streamflow prediction accuracy in both stations. Since, the results demonstrate a closer approximation of the peak streamflow values by the WLGP model, this model could be utilized for the simulation of cumulative streamflow data prediction in one month ahead.
Automatic tracking of linear features on SPOT images using dynamic programming
Bonnefon, Regis; Dherete, Pierre; Desachy, Jacky
1999-12-01
Detection of geographic elements on images is important in the perspective of adding new elements in geographic databases which are sometimes old and so, some elements are not represented. Our goal is to look for linear features like roads, rivers or railways on SPOT images with a resolution of 10 meters. Several methods allow this detection to be realized and may be classified in three categories: (1) Detection operators: the best known is the DUDA Road Operator which determine the belonging degree of a pixel to a linear feature from several 5 X 5 filters. Results are often unsatisfactory. It exists too the Infinite Size Exponential Filter (ISEF), which is a derivative filter and allows edge, valley or roof profile to be found on the image. It can be utilized as an additional information for others methods. (2) Structural tracking: from a starting point, an analysis in several directions is performed to determine the best next point (features may be: homogeneity of radiometry, contrast with environment, ...). From this new point and with an updated direction, the process goes on. Difficulty of these methods is the consideration of occlusions (bridges, tunnels, dense vegetation, ...). (3) Dynamic programming: F* algorithm and snakes are the best known. They allow a path with a minimal cost to be found in a search window. Occlusions are not a problem but two points or more near the searched linear feature must be known to define the window. The method described below is a mixture of structural tracking and dynamic programming (F* algorithm).
Programming methodology and performance issues for advanced computer architectures. [Linear algebra
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Sorensen, D.C.; Connolly, K.; Patterson, J.
1987-01-01
This paper will describe some recent attempts to construct transportable numerical software for high performance computers. Restructuring algorithms in terms of simple linear algebra modules is reviewed. This technique has proved very successful in obtaining a high level of transportability without severe loss of performance on a wide variety of both vector and parallel computers. The use of modules to encapsulate parallelism and reduce the ratio of data movement to floating point operations has been demonstrably effective for regular problems such as those found in dense linear algebra. In other situations it may be necessary to express explicitly parallel algorithms. We also present a programming methodology that is useful for constructing new parallel algorithms which require sophisticated synchronization at a large grain level. We describe the SCHEDULE package which provides an environment for developing and analyzing explicitly parallel programs in Fortran which aare portable. This package now includes a preprocessor to achieve complete portability of user level code and also a graphics post processor for performance analysis and debugging. We discuss details of porting both the SCHEDULE package and user code. Examples from linear algebra, and partial differential equations are used to illustrate the utility of this approach.
The Candle Scheme for Creating an on-line Computer Science Program - Experiences and Vision
Directory of Open Access Journals (Sweden)
Erkki SUTINEN
2003-04-01
Full Text Available Distance learning programs have rapidly increased during the past few decades. In fall 2000 the University of Joensuu started to offer distance Computer Science (CS studies to the high school students in surrounding rural areas of Joensuu. In this program high school students study the first year's university level CS studies over the web simultaneously with their regular high school studies. We describe the creation process of our virtual curriculum which is based the so-called Candle scheme. The Candle scheme search the most essential principles needed in on-line course design, supporting a student locally in her authentic learning needs via electronic tools in a light way. With the Candle scheme we have successfully focused in our design process on the most essential parts of the virtual study process. Our experiences of the Candle scheme in the creation process of the on-line CS program during years 2000-2002 indicate that the scheme is the functional one and expandable to other contexts as well.
Love, Susan M; Sanders, Matthew R; Turner, Karen M T; Maurange, Marianne; Knott, Theresa; Prinz, Ronald; Metzler, Carol; Ainsworth, Andrew T
2016-03-01
The aim of this study was to examine the feasibility (accessibility, engagement and impact) of adding social media and gaming features (e.g., social sharing with anonymity, badges to incentivize skills practice, an accredited facilitator for support) and access via smartphones to an evidenced-based parenting program, Triple P Online. The highly vulnerable population included 155 disadvantaged, high-risk parents (e.g., 76% had a family annual income of less than $15,000; 41% had been incarcerated; 38% were in drug/alcohol treatment; and 24% had had a child removed due to maltreatment). The ethnic groups most commonly identified were African American (24%) and Hispanic (66%). Respondents were primarily mothers (86%) from five community programs in Los Angeles. The study used a single group repeated measures design (pre, post, 6-month follow-up). Data collected included standardized self-report measures, post-intervention focus groups and interviews, website usage reports, and Google Analytics. Significant multivariate ANOVA time effects were found, demonstrating reductions in child behavioral problems, reduced lax/permissive and over-reactive parenting, and decreased parental stress. No effects were found for parental confidence, attributions, or depression and anxiety (which were in the normal range at baseline). Positive effects were maintained or improved at 6-month follow-up. The participants engaged in the online community and valued its flexibility, anonymity, and shared learning. This foundational implementation trial provides support for future rigorous evaluation of social media and gaming features as a medium for increasing parental engagement in evidence-based parenting programs online--a public health approach to protect and improve the development of vulnerable children.
Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun
2017-03-01
H∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.
On the graph traversal method for evaluating linear binary-chain programs
Institute of Scientific and Technical Information of China (English)
陈阳军
1999-01-01
Grahne et al. have presented a graph algorithm for evaluating a subset of recursive queries. This method consists of two phases. In the first phase, the method transforms a linear binary-chain program into a set of equations over expressions containing predicate symbols. In the second phase, a graph is constructed from the equations and the answers are produced by traversing the relevant paths. A new algorithm is described which requires less time than Grahne’ s. The key idea of the improvement is to reduce the search space that will be traversed when a query is invoked. Further, the evaluation of cyclic data is speeded up by generating most answers directly in terms of the answers already found and the associated "path information" instead of traversing the corresponding paths as usual. In this way, this algorithm achieves a linear time complexity for both acyclic and most of cyclic data.
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes
Gidon, Ohad
2012-01-01
In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise channels. The bounding technique is based on the second-order of Bonferroni-type inequality in probability theory, and it is minimized by Prim's minimum spanning tree algorithm. The bound calculation needs the fundamental cone generators of a given parity-check matrix rather than only their weight spectrum, but involves relatively low computational complexity. It is targeted to high-density parity-check codes, where the number of their generators is extremely large and these generators are spread densely in the Euclidean space. We explore the generator density and make a comparison between different parity-check matrix representations. That density effects on the improvement of the proposed bound over the conventional LP union bound. The paper also presents a complete pseudo-weight distribution of the fundamental cone generators for ...
Optimisation of substrate blends in anaerobic co-digestion using adaptive linear programming.
García-Gen, Santiago; Rodríguez, Jorge; Lema, Juan M
2014-12-01
Anaerobic co-digestion of multiple substrates has the potential to enhance biogas productivity by making use of the complementary characteristics of different substrates. A blending strategy based on a linear programming optimisation method is proposed aiming at maximising COD conversion into methane, but simultaneously maintaining a digestate and biogas quality. The method incorporates experimental and heuristic information to define the objective function and the linear restrictions. The active constraints are continuously adapted (by relaxing the restriction boundaries) such that further optimisations in terms of methane productivity can be achieved. The feasibility of the blends calculated with this methodology was previously tested and accurately predicted with an ADM1-based co-digestion model. This was validated in a continuously operated pilot plant, treating for several months different mixtures of glycerine, gelatine and pig manure at organic loading rates from 1.50 to 4.93 gCOD/Ld and hydraulic retention times between 32 and 40 days at mesophilic conditions.
On Implicit Active Constraints in Linear Semi-Infinite Programs with Unbounded Coefficients
Energy Technology Data Exchange (ETDEWEB)
Goberna, M. A., E-mail: mgoberna@ua.es [Alicante University, Dep. of Statistics and Operations Research (Spain); Lancho, G. A., E-mail: lanchoga@mixteco.utm.mx [Universidad Tecnologica de Mixteca, Instituto de Fisica y Matematicas (Mexico); Todorov, M. I., E-mail: maxim.todorov@udlap.mx [UDLA, Dep. of Physics and Mathematics (Mexico); Vera de Serio, V. N., E-mail: vvera@uncu.edu.ar [Universidad Nacional de Cuyo, Facultad de Ciencias Economicas, Instituto de Ciencias Basicas (Argentina)
2011-04-15
The concept of implicit active constraints at a given point provides useful local information about the solution set of linear semi-infinite systems and about the optimal set in linear semi-infinite programming provided the set of gradient vectors of the constraints is bounded, commonly under the additional assumption that there exists some strong Slater point. This paper shows that the mentioned global boundedness condition can be replaced by a weaker local condition (LUB) based on locally active constraints (active in a ball of small radius whose center is some nominal point), providing geometric information about the solution set and Karush-Kuhn-Tucker type conditions for the optimal solution to be strongly unique. The maintaining of the latter property under sufficiently small perturbations of all the data is also analyzed, giving a characterization of its stability with respect to these perturbations in terms of the strong Slater condition, the so-called Extended-Nuernberger condition, and the LUB condition.
Wang, Hang; Xu, Tongzhou; Yuan, Jiaojian
2017-02-17
It is difficult to identify unknown impurities in nucleotide analogues by mass spectrometry because mass-spectrometry-incompatible mobile phases need to be used to separate the major ingredient from impurities. In this study, vidarabine monophosphate was selected, and unknown impurities were identified by online heart-cutting two-dimensional high-performance liquid chromatography and linear ion trap mass spectrometry. The one-dimensional reversed-phase column was filled with a mobile phase containing nonvolatile salt. In two-dimensional high-performance liquid chromatography, we used an Acclaim Q1 column with volatile salt, and the detection wavelength was 260 nm. The mass spectrum was scanned in positive- and negative-ion mode. The online heart-cutting and online demineralization technique ensured that the mobile phase was compatible with mass spectrometry; seven impurities were identified by MS(2) and MS(3) fragments. The mass fragmentation patterns of these impurities were investigated. The two isomers were semiprepared and complemented by nuclear magnetic resonance. The results were further compared with those of normal-phase high-performance liquid chromatography with mass spectrometry. The online heart-cutting two-dimensional high-performance liquid chromatography with mass spectrometry was superior in identifying more impurities. The method solves the problem of incompatibility between the mobile phase and mass spectrometry, so it is suitable for identifying unknown impurities. This method may also be used for investigating impurities in other nucleotide analogues.
Optimizing diffusion of an online computer tailored lifestyle program: a study protocol
Directory of Open Access Journals (Sweden)
Schulz Daniela N
2011-06-01
Full Text Available Abstract Background Although the Internet is a promising medium to offer lifestyle interventions to large amounts of people at relatively low costs and effort, actual exposure rates of these interventions fail to meet the high expectations. Since public health impact of interventions is determined by intervention efficacy and level of exposure to the intervention, it is imperative to put effort in optimal dissemination. The present project attempts to optimize the dissemination process of a new online computer tailored generic lifestyle program by carefully studying the adoption process and developing a strategy to achieve sustained use of the program. Methods/Design A prospective study will be conducted to yield relevant information concerning the adoption process by studying the level of adoption of the program, determinants involved in adoption and characteristics of adopters and non-adopters as well as satisfied and unsatisfied users. Furthermore, a randomized control trial will be conducted to the test the effectiveness of a proactive strategy using periodic e-mail prompts in optimizing sustained use of the new program. Discussion Closely mapping the adoption process will gain insight in characteristics of adopters and non-adopters and satisfied and unsatisfied users. This insight can be used to further optimize the program by making it more suitable for a wider range of users, or to develop adjusted interventions to attract subgroups of users that are not reached or satisfied with the initial intervention. Furthermore, by studying the effect of a proactive strategy using period prompts compared to a reactive strategy to stimulate sustained use of the intervention and, possibly, behaviour change, specific recommendations on the use and the application of prompts in online lifestyle interventions can be developed. Trial registration Dutch Trial Register NTR1786 and Medical Ethics Committee of Maastricht University and the University Hospital
The Feasibility and Acceptability of “Arise”: An Online Substance Abuse Relapse Prevention Program
Bartel, Chelsea M.
2015-01-01
Abstract Objective: The purpose of this study was to test the feasibility and acceptability of a novel online adolescent substance abuse relapse prevention tool, “Arise” (3C Institute, Cary, NC). The program uses an innovative platform including interactive instructional segments and skill-building games to help adolescents learn and practice coping skills training strategies. Materials and Methods: We conducted a pilot test with nine adolescents in substance abuse treatment (44 percent female) and a feasibility test with treatment providers (n=8; 50 percent female). Adolescents interacted with the program via a secure Web site for approximately 30 minutes for each of two instructional units. Treatment providers reviewed the same material at their own pace. All participants completed a questionnaire with items assessing usability, acceptability, understanding, and subjective experience of the program. Results: Regarding feasibility, recruitment of this population within the study constraints proved challenging, but participant retention in the trial was high (no attrition). Adolescents and treatment providers completed the program with no reported problems, and overall we were able to collect data as planned. Regarding acceptability, the program received strong ratings from both adolescents and providers, who found the prototype informative, engaging, and appealing. Both groups strongly recommended continuing development. Conclusions: We were able to deliver the intervention as intended, and acceptability ratings were high, demonstrating the feasibility and acceptability of online delivery of engaging interactive interventions. This study contributes to our understanding of how interactive technologies, including games, can be used to modify behavior in substance abuse treatment and other health areas. PMID:26181807
Directory of Open Access Journals (Sweden)
Sukhpreet Kaur Sidhu
2014-01-01
Full Text Available The drawbacks of the existing methods to obtain the fuzzy optimal solution of such linear programming problems, in which coefficients of the constraints are represented by real numbers and all the other parameters as well as variables are represented by symmetric trapezoidal fuzzy numbers, are pointed out, and to resolve these drawbacks, a new method (named as Mehar method is proposed for the same linear programming problems. Also, with the help of proposed Mehar method, a new method, much easy as compared to the existing methods, is proposed to deal with the sensitivity analysis of the same type of linear programming problems.
Jung, Ho-Won; El Emam, Khaled
2014-01-01
Background A linear programming (LP) model was proposed to create de-identified data sets that maximally include spatial detail (e.g., geocodes such as ZIP or postal codes, census blocks, and locations on maps) while complying with the HIPAA Privacy Rule’s Expert Determination method, i.e., ensuring that the risk of re-identification is very small. The LP model determines the transition probability from an original location of a patient to a new randomized location. However, it has a limitati...
APPLICATION OF LINEAR PROGRAMMING FOR DORMITORY DEVELOPMENT PLAN AT PETRA CHRISTIAN UNIVERSITY
Directory of Open Access Journals (Sweden)
Connie Susilawati
2001-01-01
Full Text Available Dormitory is a very important facility which have to be provided by a university. A survey to Petra Christian University’s students has been conducted to understand the required facilities and their financial ability. Linear programming has been used to calculate number of rooms and area of each facility which could satisfy the constraints and to obtain optimum profit. Number of bedrooms, number of bathrooms, and area of each facility, such as: living room, dining room, common room, cafeteria, book shop, mini market, phone booths, sport facilities, and parking space are recommended. Since the investment is financially feasible, the dormitory could be built in the future.
An Integer Linear Programming Model for the Radiotherapy Treatment Scheduling Problem
Burke, Edmund K; Petrovic, Sanja
2011-01-01
Radiotherapy represents an important phase of treatment for a large number of cancer patients. It is essential that resources used to deliver this treatment are employed effectively. This paper presents a new integer linear programming model for real-world radiotherapy treatment scheduling and analyses the effectiveness of using this model on a daily basis in a hospital. Experiments are conducted varying the days on which schedules can be created. Results obtained using real-world data from the Nottingham University Hospitals NHS Trust, UK, are presented and show how the proposed model can be used with different policies in order to achieve good quality schedules.
INFORMATION SECURITY RISKS OPTIMIZATION IN CLOUDY SERVICES ON THE BASIS OF LINEAR PROGRAMMING
Directory of Open Access Journals (Sweden)
I. A. Zikratov
2013-01-01
Full Text Available The paper discusses theoretical aspects of secure cloud services creation for information processing of various confidentiality degrees. A new approach to the reasoning of information security composition in distributed computing structures is suggested, presenting the problem of risk assessment as an extreme problem of decisionmaking. Linear programming method application is proved to minimize the risk of information security for given performance security in compliance with the economic balance for the maintenance of security facilities and cost of services. An example is given to illustrate the obtained theoretical results.
Optimal local dimming for LED-backlit LCD displays via linear programming
DEFF Research Database (Denmark)
Shu, Xiao; Wu, Xiaolin; Forchhammer, Søren
2012-01-01
LED-backlit LCD displays hold the promise of improving the image quality while reducing the energy consumption with signal-dependent local dimming. To fully realize such potentials we propose a novel local dimming technique that jointly optimizes the intensities of LED backlights...... and the attenuations of LCD pixels. The objective is to minimize the distortion in luminance reproduction due to the leakage of LCD and the coarse granularity of the LED lights. The optimization problem is formulated as one of linear programming, and both exact and approximate algorithms are proposed. Simulation...
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes
Lifshitz, Asi
2011-01-01
In this paper we explore the decision regions of Linear Programming (LP) decoding. We compare the decision regions of an LP decoder, a Belief Propagation (BP) decoder and the optimal Maximum Likelihood (ML) decoder. We study the effect of minimal-weight pseudocodewords on LP decoding. We present global optimization as a method for finding the minimal pseudoweight of a given code as well as the number of minimal-weight generators. We present a complete pseudoweight distribution for the [24; 12; 8] extended Golay code, and provide justifications of why the pseudoweight distribution alone cannot be used for obtaining a tight upper bound on the error probability.
Fleming, P.
1983-01-01
A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.
Adaptive broadband beamformer for nonuniform linear array based on second order cone programming
Institute of Scientific and Technical Information of China (English)
Chen Peng; Hou Chaohuan; Ma Xiaochuan; Cao Zhiqian; Liang Yicong; Yan Sheng
2009-01-01
Adaptive broadband beamforming is a key issue in array applications. The adaptive broadband beamformer with tapped delay line (TDL) structure for nonuniform linear array (NLA) is designed according to the rule of minimizing the beamformer's output power while keeping the distortionless response (DR) in the direction of desired signal and keeping the constant beamwidth (CB) with the prescribed sidelobe level over the whole operating band. This kind of beamforming problem can be solved with the interior-point method after being converted to the form of standard second order cone programming (SOCP). The computer simulations are presented which illustrate the effectiveness of our bearaformer.
A KIND OF FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEMS BASED ON INTERVAL VALUED FUZZY SETS
Institute of Scientific and Technical Information of China (English)
XU Jiuping
2001-01-01
This paper presents a general solution procedure and an interactive fuzzy satisfying method for a kind of fuzzy multi-objective linear programming problems based on interval valued fuzzy sets. Firstly, a fuzzy set of the fuzzy solutions, which can be focused on providing complete information for the final decision, can be obtained by the proposed tolerance analysis of a non-dominated set. Secondly, the satisfying solution for the decisionmaker can be derived from Pareto optimal solutions by updating the current reference membership levels on the basis of the current levels of the membership functions together with the trade-off rates between the membership functions.
An improved multiple linear regression and data analysis computer program package
Sidik, S. M.
1972-01-01
NEWRAP, an improved version of a previous multiple linear regression program called RAPIER, CREDUC, and CRSPLT, allows for a complete regression analysis including cross plots of the independent and dependent variables, correlation coefficients, regression coefficients, analysis of variance tables, t-statistics and their probability levels, rejection of independent variables, plots of residuals against the independent and dependent variables, and a canonical reduction of quadratic response functions useful in optimum seeking experimentation. A major improvement over RAPIER is that all regression calculations are done in double precision arithmetic.
A FORTRAN program for the analysis of linear continuous and sample-data systems
Edwards, J. W.
1976-01-01
A FORTRAN digital computer program which performs the general analysis of linearized control systems is described. State variable techniques are used to analyze continuous, discrete, and sampled data systems. Analysis options include the calculation of system eigenvalues, transfer functions, root loci, root contours, frequency responses, power spectra, and transient responses for open- and closed-loop systems. A flexible data input format allows the user to define systems in a variety of representations. Data may be entered by inputing explicit data matrices or matrices constructed in user written subroutines, by specifying transfer function block diagrams, or by using a combination of these methods.
Zheng, Yuanjie; Hunter, Allan A; Wu, Jue; Wang, Hongzhi; Gao, Jianbin; Maguire, Maureen G; Gee, James C
2011-01-01
In this paper, we address the problem of landmark matching based retinal image registration. Two major contributions render our registration algorithm distinguished from many previous methods. One is a novel landmark-matching formulation which enables not only a joint estimation of the correspondences and transformation model but also the optimization with linear programming. The other contribution lies in the introduction of a reinforced self-similarities descriptor in characterizing the local appearance of landmarks. Theoretical analysis and a series of preliminary experimental results show both the effectiveness of our optimization scheme and the high differentiating ability of our features.
Bilevel linear programming model of charging for effluent based on price control
Institute of Scientific and Technical Information of China (English)
LI Yu-hua; LI Lei; HU Yun-quan; SHAO Hai-hong
2007-01-01
For the optimum price problem of charging for effluent, this paper analyzes the optimal Pigovian Tax and the serious information asymmetry problem existing in the application process of optimal Pigovian Tax,which is predominant in theory. Then the bilevel system optimizing decision-making theory is applied to give bilevel linear programming decision-making model of charging for effluent, in which the government (environmental protection agency) acts as the upper level decision-making unit and the polluting enterprises act as the lower level decision-making unit. To some extent, the model avoids the serious information asymmetry between the government and the polluting enterprises on charging for effluent.
Observations on the linear programming formulation of the single reflector design problem.
Canavesi, Cristina; Cassarly, William J; Rolland, Jannick P
2012-02-13
We implemented the linear programming approach proposed by Oliker and by Wang to solve the single reflector problem for a point source and a far-field target. The algorithm was shown to produce solutions that aim the input rays at the intersections between neighboring reflectors. This feature makes it possible to obtain the same reflector with a low number of rays - of the order of the number of targets - as with a high number of rays, greatly reducing the computation complexity of the problem.
Costa, Cathy
2009-01-01
This paper examines the use of online information resources by Economics, Finance, and Marketing 3rd year students in a cooperative education program and explores some possible factors and issues that influence how students use these resources. The nature of Work Integrated Learning (WIL) programs, the business information environment, and the…
Schaefer, Valentin; Doner, Sue; Pivnick, Janet
2013-01-01
The Native Species and Natural Processes certificate at the University of Victoria is an advanced-level online program of four courses to introduce students to state-of-the-art topics in the field of ecological restoration. The program posed some unique challenges for course developers. The development team needed to find ways to create online…
Bourelle, Tiffany; Bourelle, Andrew
2015-01-01
With distance education on the rise, a new program at the University of New Mexico provides an innovative way to teach first-year composition in a fully online format. The program, called eComp (short for Electronic Composition), insists that instructors receive formal and educational training before working in the model. In addition, the…
A Polynomial Time Algorithm for a Special Case of Linear Integer Programming
Ghasemiesfeh, Golnaz; Tabesh, Yahya
2011-01-01
According to the wide use of integer programming in many fields, affords toward finding and solving sub classes of these problems which are solvable in polynomial time seems to be important and useful. Integer linear programming (ILP) problems have the general form: $Min \\{C^{T}x: Ax=b, x\\geq 0, x\\in Z^{n}\\}$ where $Z^{n}$ is the set of n-dimensional integer vectors. Algorithmic solution of ILP is at great interest, in this paper we have presented a polynomial algorithm for a special case of the ILP problems; we have used a graph theoretical formulation of the problem which leads to an $O[mn(m+n)]$ solution where $m$ and $n$ are dimensions of coefficient matrix $X$.
Directory of Open Access Journals (Sweden)
Muwafaq M. Alkubaisi
2017-03-01
Full Text Available This paper has presented an overview of theoretical and methodological issues in simplex based sensitivity analysis (SA. The paper focuses somewhat on developing shortcut methods to perform Linear Programming (L.P. sensitivity analysis manually and in particular to dual prices and its meaning and changes in the parameter of the L.P model. Shortcut methods for conducting sensitivity analysis have been suggested. To perform sensitivity analysis in real life, one needs computer packages (software to achieve the sensitivity analysis report for higher accuracy and to save time. Some of these computer packages are very professional, but, unfortunately, some other packages suffer from logical errors in the programming of sensitivity analysis.
Directory of Open Access Journals (Sweden)
Martin Fiedler
2014-04-01
Full Text Available This study explores the central perceptions of consumers influencing the decision to use contactless payment instruments. Aim is to define a customer core group narrowed down by several variables and to find a basis for a purposeful communication of advantages of the new payment process, as investment into this technology bears the risk of total loss if the customer group is declining acceptance and the image of a company might be excessively damaged. External variables in context with the usage of social online media and participation in customer loyalty programs have been selected to clarify possible impact. These factors offer comprehensive explanation and help interpreting mechanisms within the decision making process for acceptance of the payment technology. Data were collected in a survey with n = 1,294 customers in a major city in Northern Germany. Results are displayed in a technology acceptance model, using structural equation modelling and regression analysis. The study is not limited on mobile payment instruments in the traditional context respectively involving a mobile phone. On the contrary this analysis is made on the belief that any device can be enabled for contactless payment processes, such as traditional items like credit or debit cards. Customers shopping online have a higher perceived usefulness an customers participating in loyalty programs tend to understand the argument of the ease of use of the technology more than their counterparts.
Directory of Open Access Journals (Sweden)
Jinhyang Yang
2013-01-01
Full Text Available The hepatitis B virus is second only to tobacco as a known human carcinogen. However, chronic hepatitis B usually does not produce symptoms and people feel healthy even in the early stages of live cancer. Therefore, chronically infected people should perceive it as a serious health problem and move on to appropriate health behaviour. The purpose of this paper is to develop and validate an online program for promoting self-management among Korean patients with chronic hepatitis B. The online program was developed using a prototyping approach and system developing life cycle method, evaluated by users for their satisfaction with the website and experts for the quality of the site. To evaluate the application of the online program, knowledge and self-management compliance of the subjects were measured and compared before and after the application of the online program. There were statistically significant increases in knowledge and self-management compliance in the user group. An online program with high accessibility and applicability including information, motivation, and behavior skill factors can promote self-management of the patient with chronic hepatitis B. Findings from this study allow Korean patients with chronic hepatitis B to engage in proactive and effective health management in the community or clinical practice.
Energy Technology Data Exchange (ETDEWEB)
Tunc Aldemir; Don W. Miller; Brian k. Hajek; Peng Wang
2002-04-01
The DSD (Dynamic System Doctor) is a system-independent, interactive software under development for on-line state/parameter estimation in dynamic systems (1), partially supported through a Nuclear Engineering Education (NEER) grant during 1998-2001. This paper summarizes the recent accomplishments in improving the user-friendliness and computational capability of DSD
Saligrama, V
2008-01-01
We consider the classical Compressed Sensing problem. We have a large under-determined set of noisy measurements Y=GX+N, where X is a sparse signal and G is drawn from a random ensemble. In this paper we focus on a quantized linear programming solution for support recovery. Our solution of the problem amounts to solving $\\min \\|Z\\|_1 ~ s.t. ~ Y=G Z$, and quantizing/thresholding the resulting solution $Z$. We show that this scheme is guaranteed to perfectly reconstruct a discrete signal or control the element-wise reconstruction error for a continuous signal for specific values of sparsity. We show that in the linear regime when the sparsity, $k$, increases linearly with signal dimension, $n$, the sign pattern of $X$ can be recovered with $SNR=O(\\log n)$ and $m= O(k)$ measurements. Our proof technique is based on perturbation of the noiseless $\\ell_1$ problem. Consequently, the achievable sparsity level in the noisy problem is comparable to that of the noiseless problem. Our result offers a sharp characterizat...
A novel approach based on preference-based index for interval bilevel linear programming problem.
Ren, Aihong; Wang, Yuping; Xue, Xingsi
2017-01-01
This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation [Formula: see text]. Furthermore, the concept of a preference δ-optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.
Li, Yanning
2013-10-01
This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.
Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control
Energy Technology Data Exchange (ETDEWEB)
Gaitsgory, Vladimir, E-mail: vladimir.gaitsgory@mq.edu.au [Macquarie University, Department of Mathematics (Australia); Rossomakhine, Sergey, E-mail: serguei.rossomakhine@flinders.edu.au [Flinders University, Flinders Mathematical Sciences Laboratory, School of Computer Science, Engineering and Mathematics (Australia)
2015-04-15
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.
A wavelet-linear genetic programming model for sodium (Na+) concentration forecasting in rivers
Ravansalar, Masoud; Rajaee, Taher; Zounemat-Kermani, Mohammad
2016-06-01
The prediction of water quality parameters in water resources such as rivers is of importance issue that needs to be considered in better management of irrigation systems and water supplies. In this respect, this study proposes a new hybrid wavelet-linear genetic programming (WLGP) model for prediction of monthly sodium (Na+) concentration. The 23-year monthly data used in this study, were measured from the Asi River at the Demirköprü gauging station located in Antakya, Turkey. At first, the measured discharge (Q) and Na+ datasets are initially decomposed into several sub-series using discrete wavelet transform (DWT). Then, these new sub-series are imposed to the ad hoc linear genetic programming (LGP) model as input patterns to predict monthly Na+ one month ahead. The results of the new proposed WLGP model are compared with LGP, WANN and ANN models. Comparison of the models represents the superiority of the WLGP model over the LGP, WANN and ANN models such that the Nash-Sutcliffe efficiencies (NSE) for WLGP, WANN, LGP and ANN models were 0.984, 0.904, 0.484 and 0.351, respectively. The achieved results even points to the superiority of the single LGP model than the ANN model. Continuously, the capability of the proposed WLGP model in terms of prediction of the Na+ peak values is also presented in this study.
Directory of Open Access Journals (Sweden)
Warid Warid
Full Text Available This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF formulation was converted into a crisp OPF in a successive linear programming (SLP framework and solved using an efficient interior point method (IPM. To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.
Indian Academy of Sciences (India)
ALI EBRAHIMNEJAD
2016-03-01
Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving interval-valued trapezoidal fuzzy numbers for the transportation costs and values of supplies and demands. We propose a fuzzy linear programming approach for solvinginterval-valued trapezoidal fuzzy numbers transportation problem based on comparison of interval-valued fuzzy numbers by the help of signed distance ranking. To illustrate the proposed approach an application example issolved. It is demonstrated that study of interval-valued trapezoidal fuzzy numbers transportation problem gives rise to the same expected results as those obtained for TP with trapezoidal fuzzy numbers.
Energy Technology Data Exchange (ETDEWEB)
Djukanovic, M.; Babic, B.; Milosevic, B. [Electrical Engineering Inst. Nikola Tesla, Belgrade (Yugoslavia); Sobajic, D.J. [EPRI, Palo Alto, CA (United States). Power System Control; Pao, Y.H. [Case Western Reserve Univ., Cleveland, OH (United States)]|[AI WARE, Inc., Cleveland, OH (United States)
1996-05-01
In this paper the blending/transloading facilities are modeled using an interactive fuzzy linear programming (FLP), in order to allow the decision-maker to solve the problem of uncertainty of input information within the fuel scheduling optimization. An interactive decision-making process is formulated in which decision-maker can learn to recognize good solutions by considering all possibilities of fuzziness. The application of the fuzzy formulation is accompanied by a careful examination of the definition of fuzziness, appropriateness of the membership function and interpretation of results. The proposed concept provides a decision support system with integration-oriented features, whereby the decision-maker can learn to recognize the relative importance of factors in the specific domain of optimal fuel scheduling (OFS) problem. The formulation of a fuzzy linear programming problem to obtain a reasonable nonfuzzy solution under consideration of the ambiguity of parameters, represented by fuzzy numbers, is introduced. An additional advantage of the FLP formulation is its ability to deal with multi-objective problems.
Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri
2016-01-01
This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.
Glocker, Ben; Paragios, Nikos; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir
2007-01-01
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path extraction in a weighted graph. The space of solutions is represented using a set of a labels which are assigned to predefined displacements. The graph topology corresponds to a superimposed regular grid onto the volume. Links between neighborhood control points introduce smoothness, while links between the graph nodes and the labels (end-nodes) measure the cost induced to the objective function through the selection of a particular deformation for a given control point once projected to the entire volume domain, Higher order polynomials are used to express the volume deformation from the ones of the control points. Efficient linear programming that can guarantee the optimal solution up to (a user-defined) bound is considered to recover the optimal registration parameters. Therefore, the method is gradient free, can encode various similarity metrics (simple changes on the graph construction), can guarantee a globally sub-optimal solution and is computational tractable. Experimental validation using simulated data with known deformation, as well as manually segmented data demonstrate the extreme potentials of our approach.
Nguyen, Dzung; Tran, Trac; Kwan, Chiman; Ayhan, Bulent
2010-04-01
Endmember extraction in Hyperspectral Images (HSI) is a critical step for target detection and abundance estimation. In this paper, we propose a new approach to endmember extraction, which takes advantage of the sparsity property of the linear representation of HSI's spectral vector. Sparsity is measured by the l0 norm of the abundance vector. It is also well known that l1 norm well resembles l0 in boosting sparsity while keeping the minimization problem convex and tractable. By adding the l1 norm term to the objective function, we result in a constrained quadratic programming which can be solved effectively using the Linear Complementary Programming (LCP). Unlike existing methods which require expensive computations in each iteration, LCP only requires pivoting steps, which are extremely simple and efficient for the un-mixing problem, since the number of signatures in the reconstructing basis is reasonably small. Preliminary experiments of the proposed methods for both supervised and unsupervised abundance decomposition showed competitive results as compared to LS-based method like Fully Constrained Least Square (FCLS). Furthermore, combination of our unsupervised decomposition with anomaly detection makes a decent target detection algorithm as compared to methods which require prior information of target and background signatures.
Linear programming analysis of the R-parity violation within EDM-constraints
Yamanaka, Nodoka; Sato, Toru; Kubota, Takahiro
2014-12-01
The constraint on the R-parity violating supersymmetric interactions is discussed in the light of current experimental data of the electric dipole moment of neutron, 129Xe , 205Tl, and 199Hg atoms, and YbF and ThO molecules. To investigate the constraints without relying upon the assumption of the dominance of a particular combination of couplings over all the rest, an extensive use is made of the linear programming method in the scan of the parameter space. We give maximally possible values for the EDMs of the proton, deuteron, 3He nucleus, 211Rn, 225Ra, 210Fr, and the R-correlation of the neutron beta decay within the constraints from the current experimental data of the EDMs of neutron, 129Xe, 205Tl, and 199Hg atoms, and YbF and ThO molecules using the linear programming method. It is found that the R-correlation of the neutron beta decay and hadronic EDMs are very useful observables to constrain definite regions of the parameter space of the R-parity violating supersymmetry.
Uncovering signal transduction networks from high-throughput data by integer linear programming.
Zhao, Xing-Ming; Wang, Rui-Sheng; Chen, Luonan; Aihara, Kazuyuki
2008-05-01
Signal transduction is an important process that transmits signals from the outside of a cell to the inside to mediate sophisticated biological responses. Effective computational models to unravel such a process by taking advantage of high-throughput genomic and proteomic data are needed to understand the essential mechanisms underlying the signaling pathways. In this article, we propose a novel method for uncovering signal transduction networks (STNs) by integrating protein interaction with gene expression data. Specifically, we formulate STN identification problem as an integer linear programming (ILP) model, which can be actually solved by a relaxed linear programming algorithm and is flexible for handling various prior information without any restriction on the network structures. The numerical results on yeast MAPK signaling pathways demonstrate that the proposed ILP model is able to uncover STNs or pathways in an efficient and accurate manner. In particular, the prediction results are found to be in high agreement with current biological knowledge and available information in literature. In addition, the proposed model is simple to be interpreted and easy to be implemented even for a large-scale system.
Radial-interval linear programming for environmental management under varied protection levels.
Tan, Qian; Huang, Guo H; Cai, Yanpeng
2010-09-01
In this study, a radial-interval linear programming (RILP) approach was developed for supporting waste management under uncertainty. RILP improved interval-parameter linear programming and its extensions in terms of input reasonableness and output robustness. From the perspective of modeling inputs, RILP could tackle highly uncertain information at the bounds of interval parameters through introducing the concept of fluctuation radius. Regarding modeling outputs, RILP allows controlling the degree of conservatism associated with interval solutions and is capable of quantifying corresponding system risks and benefits. This could facilitate the reflection of interactive relationship between the feasibility of system and the uncertainty of parameters. A computationally tractable algorithm was provided to solve RILP. Then, a long-term waste management case was studied to demonstrate the applicability of the developed methodology. A series of interval solutions obtained under varied protection levels were compared, helping gain insights into the interactions among protection level, violation risk, and system cost. Potential waste allocation alternatives could be generated from these interval solutions, which would be screened in real-world practices according to various projected system conditions as well as decision-makers' willingness to pay and risk tolerance levels. Sensitivity analysis further revealed the significant impact of fluctuation radii of interval parameters on the system. The results indicated that RILP is applicable to a wide spectrum of environmental management problems that are subject to compound uncertainties.
Chen, Ruoying; Zhang, Zhiwang; Wu, Di; Zhang, Peng; Zhang, Xinyang; Wang, Yong; Shi, Yong
2011-01-21
Protein-protein interactions are fundamentally important in many biological processes and it is in pressing need to understand the principles of protein-protein interactions. Mutagenesis studies have found that only a small fraction of surface residues, known as hot spots, are responsible for the physical binding in protein complexes. However, revealing hot spots by mutagenesis experiments are usually time consuming and expensive. In order to complement the experimental efforts, we propose a new computational approach in this paper to predict hot spots. Our method, Rough Set-based Multiple Criteria Linear Programming (RS-MCLP), integrates rough sets theory and multiple criteria linear programming to choose dominant features and computationally predict hot spots. Our approach is benchmarked by a dataset of 904 alanine-mutated residues and the results show that our RS-MCLP method performs better than other methods, e.g., MCLP, Decision Tree, Bayes Net, and the existing HotSprint database. In addition, we reveal several biological insights based on our analysis. We find that four features (the change of accessible surface area, percentage of the change of accessible surface area, size of a residue, and atomic contacts) are critical in predicting hot spots. Furthermore, we find that three residues (Tyr, Trp, and Phe) are abundant in hot spots through analyzing the distribution of amino acids.
Fan, Yurui; Huang, Guohe; Veawab, Amornvadee
2012-01-01
In this study, a generalized fuzzy linear programming (GFLP) method was developed to deal with uncertainties expressed as fuzzy sets that exist in the constraints and objective function. A stepwise interactive algorithm (SIA) was advanced to solve GFLP model and generate solutions expressed as fuzzy sets. To demonstrate its application, the developed GFLP method was applied to a regional sulfur dioxide (SO2) control planning model to identify effective SO2 mitigation polices with a minimized system performance cost under uncertainty. The results were obtained to represent the amount of SO2 allocated to different control measures from different sources. Compared with the conventional interval-parameter linear programming (ILP) approach, the solutions obtained through GFLP were expressed as fuzzy sets, which can provide intervals for the decision variables and objective function, as well as related possibilities. Therefore, the decision makers can make a tradeoff between model stability and the plausibility based on solutions obtained through GFLP and then identify desired policies for SO2-emission control under uncertainty.
Drag reduction of a car model by linear genetic programming control
Li, Ruiying; Cordier, Laurent; Borée, Jacques; Harambat, Fabien; Kaiser, Eurika; Duriez, Thomas
2016-01-01
We investigate open- and closed-loop active control for aerodynamic drag reduction of a car model. Turbulent flow around a blunt-edged Ahmed body is examined at $Re_{H}\\approx3\\times10^{5}$ based on body height. The actuation is performed with pulsed jets at all trailing edges combined with a Coanda deflection surface. The flow is monitored with pressure sensors distributed at the rear side. We apply a model-free control strategy building on Dracopoulos & Kent (Neural Comput. & Applic., vol. 6, 1997, pp. 214-228) and Gautier et al. (J. Fluid Mech., vol. 770, 2015, pp. 442-457). The optimized control laws comprise periodic forcing, multi-frequency forcing and sensor-based feedback including also time-history information feedback and combination thereof. Key enabler is linear genetic programming as simple and efficient framework for multiple inputs (actuators) and multiple outputs (sensors). The proposed linear genetic programming control can select the best open- or closed-loop control in an unsupervis...
Nidumolu, Uday Bhaskar; Keulen, Herman van; Lubbers, Marcel; Mapfumo, Andrew
2007-01-01
An Interactive Multiple Goal Linear Programming (IMGLP) model is developed that considers objectives of multiple stakeholders, i.e. different farmer groups, district agricultural officers and agricultural scientists for agricultural land use analysis. The analysis focuses on crop selection;
Nidumolu, Uday Bhaskar; Keulen, Herman van; Lubbers, Marcel; Mapfumo, Andrew
2007-01-01
An Interactive Multiple Goal Linear Programming (IMGLP) model is developed that considers objectives of multiple stakeholders, i.e. different farmer groups, district agricultural officers and agricultural scientists for agricultural land use analysis. The analysis focuses on crop selection; consider
Tonkin, Matthew J.; Tiedeman, Claire R.; Ely, D. Matthew; Hill, Mary C.
2007-01-01
The OPR-PPR program calculates the Observation-Prediction (OPR) and Parameter-Prediction (PPR) statistics that can be used to evaluate the relative importance of various kinds of data to simulated predictions. The data considered fall into three categories: (1) existing observations, (2) potential observations, and (3) potential information about parameters. The first two are addressed by the OPR statistic; the third is addressed by the PPR statistic. The statistics are based on linear theory and measure the leverage of the data, which depends on the location, the type, and possibly the time of the data being considered. For example, in a ground-water system the type of data might be a head measurement at a particular location and time. As a measure of leverage, the statistics do not take into account the value of the measurement. As linear measures, the OPR and PPR statistics require minimal computational effort once sensitivities have been calculated. Sensitivities need to be calculated for only one set of parameter values; commonly these are the values estimated through model calibration. OPR-PPR can calculate the OPR and PPR statistics for any mathematical model that produces the necessary OPR-PPR input files. In this report, OPR-PPR capabilities are presented in the context of using the ground-water model MODFLOW-2000 and the universal inverse program UCODE_2005. The method used to calculate the OPR and PPR statistics is based on the linear equation for prediction standard deviation. Using sensitivities and other information, OPR-PPR calculates (a) the percent increase in the prediction standard deviation that results when one or more existing observations are omitted from the calibration data set; (b) the percent decrease in the prediction standard deviation that results when one or more potential observations are added to the calibration data set; or (c) the percent decrease in the prediction standard deviation that results when potential information on one
DEFF Research Database (Denmark)
Escudero, Laureano F.; Monge, Juan Francisco; Morales, Dolores Romero
2015-01-01
In this paper we consider multiperiod mixed 0–1 linear programming models under uncertainty. We propose a risk averse strategy using stochastic dominance constraints (SDC) induced by mixed-integer linear recourse as the risk measure. The SDC strategy extends the existing literature to the multist...
Gizaw, S.; Komen, J.; Arendonk, van J.A.M.
2008-01-01
Ease of measurement of linear size traits is of particular significance in livestock breeding, particularly under village breeding programs where measuring live weight is difficult. In this study, we estimated genetic parameters and realized responses for live weight (LW) and linear size traits
Nakhanu, Shikuku Beatrice; Musasia, Amadalo Maurice
2015-01-01
The topic Linear Programming is included in the compulsory Kenyan secondary school mathematics curriculum at form four. The topic provides skills for determining best outcomes in a given mathematical model involving some linear relationship. This technique has found application in business, economics as well as various engineering fields. Yet many…