WorldWideScience

Sample records for linear problem exhibits

  1. Semidefinite linear complementarity problems

    Eckhardt, U.

    1978-04-01

    Semidefinite linear complementarity problems arise by discretization of variational inequalities describing e.g. elastic contact problems, free boundary value problems etc. In the present paper linear complementarity problems are introduced and the theory as well as the numerical treatment of them are described. In the special case of semidefinite linear complementarity problems a numerical method is presented which combines the advantages of elimination and iteration methods without suffering from their drawbacks. This new method has very attractive properties since it has a high degree of invariance with respect to the representation of the set of all feasible solutions of a linear complementarity problem by linear inequalities. By means of some practical applications the properties of the new method are demonstrated. (orig.) [de

  2. Perturbed asymptotically linear problems

    Bartolo, R.; Candela, A. M.; Salvatore, A.

    2012-01-01

    The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which is just continuous. Also in the case when the problem has not a variational structure, suitable procedures and estimates allow us to prove that the number of distinct crtitical levels of the functional associated to the unperturbed problem is "stable" unde...

  3. Unimode metamaterials exhibiting negative linear compressibility and negative thermal expansion

    Dudek, Krzysztof K; Attard, Daphne; Caruana-Gauci, Roberto; Grima, Joseph N; Wojciechowski, Krzysztof W

    2016-01-01

    Unimode metamaterials made from rotating rigid triangles are analysed mathematically for their mechanical and thermal expansion properties. It is shown that these unimode systems exhibit positive Poisson’s ratios irrespective of size, shape and angle of aperture, with the Poisson’s ratio exhibiting giant values for certain conformations. When the Poisson’s ratio in one loading direction is larger than +1, the systems were found to exhibit the anomalous property of negative linear compressibility along this direction, that is, the systems expand in this direction when hydrostatically compressed. Also discussed are the thermal expansion properties of these systems under the assumption that the units exhibit increased rotational agitation once subjected to an increase in temperature. The effect of the geometric parameters on the aforementioned thermo-mechanical properties of the system, are discussed, with the aim of identifying negative behaviour. (paper)

  4. Templates for Linear Algebra Problems

    Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der

    1995-01-01

    The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and

  5. Stochastic Linear Quadratic Optimal Control Problems

    Chen, S.; Yong, J.

    2001-01-01

    This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward-backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well

  6. Perturbation analysis of linear control problems

    Petkov, Petko; Konstantinov, Mihail

    2017-01-01

    The paper presents a brief overview of the technique of splitting operators, proposed by the authors and intended for perturbation analysis of control problems involving unitary and orthogonal matrices. Combined with the technique of Lyapunov majorants and the implementation of the Banach and Schauder fixed point principles, it allows to obtain rigorous non-local perturbation bounds for a set of sensitivity analysis problems. Among them are the reduction of linear systems into orthogonal canonical forms, the feedback synthesis problem and pole assignment problem in particular, as well as other important problems in control theory and linear algebra. Key words: perturbation analysis, canonical forms, feedback synthesis

  7. Convex variational problems linear, nearly linear and anisotropic growth conditions

    Bildhauer, Michael

    2003-01-01

    The author emphasizes a non-uniform ellipticity condition as the main approach to regularity theory for solutions of convex variational problems with different types of non-standard growth conditions. This volume first focuses on elliptic variational problems with linear growth conditions. Here the notion of a "solution" is not obvious and the point of view has to be changed several times in order to get some deeper insight. Then the smoothness properties of solutions to convex anisotropic variational problems with superlinear growth are studied. In spite of the fundamental differences, a non-uniform ellipticity condition serves as the main tool towards a unified view of the regularity theory for both kinds of problems.

  8. Students’ difficulties in solving linear equation problems

    Wati, S.; Fitriana, L.; Mardiyana

    2018-03-01

    A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.

  9. Inverse problems in linear transport theory

    Dressler, K.

    1988-01-01

    Inverse problems for a class of linear kinetic equations are investigated. The aim is to identify the scattering kernel of a transport equation (corresponding to the structure of a background medium) by observing the 'albedo' part of the solution operator for the corresponding direct initial boundary value problem. This means to get information on some integral operator in an integrodifferential equation through on overdetermined boundary value problem. We first derive a constructive method for solving direct halfspace problems and prove a new factorization theorem for the solutions. Using this result we investigate stationary inverse problems with respect to well posedness (e.g. reduce them to classical ill-posed problems, such as integral equations of first kind). In the time-dependent case we show that a quite general inverse problem is well posed and solve it constructively. (orig.)

  10. Invariant imbedding equations for linear scattering problems

    Apresyan, L.

    1988-01-01

    A general form of the invariant imbedding equations is investigated for the linear problem of scattering by a bounded scattering volume. The conditions for the derivability of such equations are described. It is noted that the possibility of the explicit representation of these equations for a sphere and for a layer involves the separation of variables in the unperturbed wave equation

  11. Quantization of the Linearized Kepler Problem

    Guerrero, Julio; Perez, Jose Miguel

    2003-01-01

    The linearized Kepler problem is considered, as obtained from the Kustaanheimo-Stiefel (K-S)transformation, both for negative and positive energies. The symmetry group for the Kepler problem turns out to be SU(2,2). For negative energies, the Hamiltonian of Kepler problem can be realized as the sum of the energies of four harmonic oscillator with the same frequency, with a certain constrain. For positive energies, it can be realized as the sum of the energies of four repulsive oscillator with...

  12. Identification problems in linear transformation system

    Delforge, Jacques.

    1975-01-01

    An attempt was made to solve the theoretical and numerical difficulties involved in the identification problem relative to the linear part of P. Delattre's theory of transformation systems. The theoretical difficulties are due to the very important problem of the uniqueness of the solution, which must be demonstrated in order to justify the value of the solution found. Simple criteria have been found when measurements are possible on all the equivalence classes, but the problem remains imperfectly solved when certain evolution curves are unknown. The numerical difficulties are of two kinds: a slow convergence of iterative methods and a strong repercussion of numerical and experimental errors on the solution. In the former case a fast convergence was obtained by transformation of the parametric space, while in the latter it was possible, from sensitivity functions, to estimate the errors, to define and measure the conditioning of the identification problem then to minimize this conditioning as a function of the experimental conditions [fr

  13. Stability problems for linear hyperbolic systems

    Eckhoff, K.S.

    1975-05-01

    The stability properties for the trivial solution of a general linear hyperbolic system of partial differential equations of the first order are studied. It is shown that results may be obtained by studying the stability properties of certain systems of ordinary differential equations which can be constructed from the hyperbolic system (the so-called transport equations). In some cases the associated stability problem for the transport equations can in fact be shown to be equivalent to the stability problem for the hyperbolic system, but in general the transport equations will only give the necessary conditions for stability. (Auth.)

  14. Exhibition

    Staff Association

    2017-01-01

    A Look of Hope Islam Mahmoud Sweity From 19 to 30 June 2017 CERN Meyrin, Main Building Islam Mahmoud Sweity Islam Mahmoud Sweity was born in 1997 at Beit Awwa, Palestine. She is currently following a course to get an Art diploma of Painting at the college of Fine Arts at An-Najah National University under the supervision of Esmat Al As'aad. Her portraits, landscapes and still life paintings are full of life and shining colours. Charged of emotional empathy they catch the attention of the viewer and are reminding us that life is beautiful and worth living in spite of all difficulties we have to go through. She participated in many exhibitions and has exposed her drawings in 2015 at CERN and in France in the framework of the exhibition "The Origin“, and in 2017 in the Former Yugoslav Republic of Macedonia, Palestina and Jordan. In this exhibition the oil paintings made in the past year will be presented. For more information : staff.association@cern.ch | T&eacu...

  15. An Entropic Estimator for Linear Inverse Problems

    Amos Golan

    2012-05-01

    Full Text Available In this paper we examine an Information-Theoretic method for solving noisy linear inverse estimation problems which encompasses under a single framework a whole class of estimation methods. Under this framework, the prior information about the unknown parameters (when such information exists, and constraints on the parameters can be incorporated in the statement of the problem. The method builds on the basics of the maximum entropy principle and consists of transforming the original problem into an estimation of a probability density on an appropriate space naturally associated with the statement of the problem. This estimation method is generic in the sense that it provides a framework for analyzing non-normal models, it is easy to implement and is suitable for all types of inverse problems such as small and or ill-conditioned, noisy data. First order approximation, large sample properties and convergence in distribution are developed as well. Analytical examples, statistics for model comparisons and evaluations, that are inherent to this method, are discussed and complemented with explicit examples.

  16. Exhibition

    Staff Association

    2016-01-01

    Encounters Hanne Blitz From February 1st to 12th 2016 CERN Meyrin, Main Building What is our reaction to a first encounter with a tourist attraction? Contemporary Dutch painter Hanne Blitz captures visitors' responses to art and architecture, sweeping vistas and symbolic memorials. Encounters, a series of oil paintings curated specially for this CERN exhibition, depicts tourists visiting cultural highlights around the world. A thought-provoking journey not to be missed, and a tip of the hat to CERN's large Hadron Collider.

  17. Solving fault diagnosis problems linear synthesis techniques

    Varga, Andreas

    2017-01-01

    This book addresses fault detection and isolation topics from a computational perspective. Unlike most existing literature, it bridges the gap between the existing well-developed theoretical results and the realm of reliable computational synthesis procedures. The model-based approach to fault detection and diagnosis has been the subject of ongoing research for the past few decades. While the theoretical aspects of fault diagnosis on the basis of linear models are well understood, most of the computational methods proposed for the synthesis of fault detection and isolation filters are not satisfactory from a numerical standpoint. Several features make this book unique in the fault detection literature: Solution of standard synthesis problems in the most general setting, for both continuous- and discrete-time systems, regardless of whether they are proper or not; consequently, the proposed synthesis procedures can solve a specific problem whenever a solution exists Emphasis on the best numerical algorithms to ...

  18. Numerical stability in problems of linear algebra.

    Babuska, I.

    1972-01-01

    Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

  19. Exhibition

    Staff Association

    2017-01-01

    Sintropie Flavio Pellegrini From 13 to 24 March 2017 CERN Meyrin, Main Building Energia imprigionata - Flavio Pellegrini. The exhibition is composed by eleven wood artworks with the expression of movement as theme. The artworks are the result of harmonics math applied to sculpture. The powerful black colour is dominated by the light source, generating reflexes and modulations. The result is a continuous variation of perspective visions. The works generate, at a first approach, an emotion of mystery and incomprehension, only a deeper contemplation lets one discover entangling and mutative details, evidencing the elegance of the lines and letting the meaning emerge. For more information : staff.association@cern.ch | Tél: 022 766 37 38

  20. Parametrices and exact paralinearization of semi-linear boundary problems

    Johnsen, Jon

    2008-01-01

    The subject is parametrices for semi-linear problems, based on parametrices for linear boundary problems and on non-linearities that decompose into solution-dependent linear operators acting on the solutions. Non-linearities of product type are shown to admit this via exact paralinearization...... of homogeneous distributions, tensor products and halfspace extensions have been revised. Examples include the von Karman equation....

  1. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    Yuelin Gao; Siqiao Jin

    2013-01-01

    We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...

  2. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE

    M. ZANGIABADI; 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...

  3. Menu-Driven Solver Of Linear-Programming Problems

    Viterna, L. A.; Ferencz, D.

    1992-01-01

    Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

  4. An Approach for Solving Linear Fractional Programming Problems

    Andrew Oyakhobo Odior

    2012-01-01

    Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...

  5. The linear ordering problem: an algorithm for the optimal solution ...

    In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering problem. Linear Ordering is the problem of finding a linear order of the nodes of a graph such that the sum of the weights which are consistent with this order is as large as possible. It is an NP - Hard combinatorial optimisation ...

  6. An approach for solving linear fractional programming problems ...

    The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...

  7. Polarization holograms in a bifunctional amorphous polymer exhibiting equal values of photoinduced linear and circular birefringences.

    Provenzano, Clementina; Pagliusi, Pasquale; Cipparrone, Gabriella; Royes, Jorge; Piñol, Milagros; Oriol, Luis

    2014-10-09

    Light-controlled molecular alignment is a flexible and useful strategy introducing novelty in the fields of mechanics, self-organized structuring, mass transport, optics, and photonics and addressing the development of smart optical devices. Azobenzene-containing polymers are well-known photocontrollable materials with large and reversible photoinduced optical anisotropies. The vectorial holography applied to these materials enables peculiar optical devices whose properties strongly depend on the relative values of the photoinduced birefringences. Here is reported a polarization holographic recording based on the interference of two waves with orthogonal linear polarization on a bifunctional amorphous polymer that, exceptionally, exhibits equal values of linear and circular birefringence. The peculiar photoresponse of the material coupled with the holographic technique demonstrates an optical device capable of decomposing the light into a set of orthogonally polarized linear components. The holographic structures are theoretically described by the Jones matrices method and experimentally investigated.

  8. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    Yuelin Gao

    2013-01-01

    Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

  9. Microlocal analysis of a seismic linearized inverse problem

    Stolk, C.C.

    1999-01-01

    The seismic inverse problem is to determine the wavespeed c x in the interior of a medium from measurements at the boundary In this paper we analyze the linearized inverse problem in general acoustic media The problem is to nd a left inverse of the linearized forward map F or equivalently to nd the

  10. Health physics problems encountered in the Saclay linear accelerator

    Delsaut, R.

    1979-01-01

    The safety and health physics problems specific to the Saclay linear accelerator are presented: activation (of gases, dust, water, structural materials, targets); individual dosimetry; the safety engineering [fr

  11. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem

    Mio Horai

    2016-01-01

    Full Text Available We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.

  12. Students' errors in solving linear equation word problems: Case ...

    The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...

  13. An Optimal Linear Coding for Index Coding Problem

    Pezeshkpour, Pouya

    2015-01-01

    An optimal linear coding solution for index coding problem is established. Instead of network coding approach by focus on graph theoric and algebraic methods a linear coding program for solving both unicast and groupcast index coding problem is presented. The coding is proved to be the optimal solution from the linear perspective and can be easily utilize for any number of messages. The importance of this work is lying mostly on the usage of the presented coding in the groupcast index coding ...

  14. The regular indefinite linear-quadratic problem with linear endpoint constraints

    Soethoudt, J.M.; Trentelman, H.L.

    1989-01-01

    This paper deals with the infinite horizon linear-quadratic problem with indefinite cost. Given a linear system, a quadratic cost functional and a subspace of the state space, we consider the problem of minimizing the cost functional over all inputs for which the state trajectory converges to that

  15. Turnpike theory of continuous-time linear optimal control problems

    Zaslavski, Alexander J

    2015-01-01

    Individual turnpike results are of great interest due to their numerous applications in engineering and in economic theory; in this book the study is focused on new results of turnpike phenomenon in linear optimal control problems.  The book is intended for engineers as well as for mathematicians interested in the calculus of variations, optimal control, and in applied functional analysis. Two large classes of problems are studied in more depth. The first class studied in Chapter 2 consists of linear control problems with periodic nonsmooth convex integrands. Chapters 3-5 consist of linear control problems with autonomous nonconvex and nonsmooth integrands.  Chapter 6 discusses a turnpike property for dynamic zero-sum games with linear constraints. Chapter 7 examines genericity results. In Chapter 8, the description of structure of variational problems with extended-valued integrands is obtained. Chapter 9 ends the exposition with a study of turnpike phenomenon for dynamic games with extended value integran...

  16. LinvPy : a Python package for linear inverse problems

    Beaud, Guillaume François Paul

    2016-01-01

    The goal of this project is to make a Python package including the tau-estimator algorithm to solve linear inverse problems. The package must be distributed, well documented, easy to use and easy to extend for future developers.

  17. Formulated linear programming problems from game theory and its ...

    Formulated linear programming problems from game theory and its computer implementation using Tora package. ... Game theory, a branch of operations research examines the various concepts of decision ... AJOL African Journals Online.

  18. On a non-linear pseudodifferential boundary value problem

    Nguyen Minh Chuong.

    1989-12-01

    A pseudodifferential boundary value problem for operators with symbols taking values in Sobolev spaces and with non-linear right-hand side was studied. Existence and uniqueness theorems were proved. (author). 11 refs

  19. Efficient decomposition and linearization methods for the stochastic transportation problem

    Holmberg, K.

    1993-01-01

    The stochastic transportation problem can be formulated as a convex transportation problem with nonlinear objective function and linear constraints. We compare several different methods based on decomposition techniques and linearization techniques for this problem, trying to find the most efficient method or combination of methods. We discuss and test a separable programming approach, the Frank-Wolfe method with and without modifications, the new technique of mean value cross decomposition and the more well known Lagrangian relaxation with subgradient optimization, as well as combinations of these approaches. Computational tests are presented, indicating that some new combination methods are quite efficient for large scale problems. (authors) (27 refs.)

  20. A property of assignment type mixed integer linear programming problems

    Benders, J.F.; van Nunen, J.A.E.E.

    1982-01-01

    In this paper we will proof that rather tight upper bounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer linear assignment problems. Since in these cases the number of splitted assignments is

  1. Experiences with linear solvers for oil reservoir simulation problems

    Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); Biswas, D.; Carey, G.

    1996-12-31

    This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.

  2. Multisplitting for linear, least squares and nonlinear problems

    Renaut, R.

    1996-12-31

    In earlier work, presented at the 1994 Iterative Methods meeting, a multisplitting (MS) method of block relaxation type was utilized for the solution of the least squares problem, and nonlinear unconstrained problems. This talk will focus on recent developments of the general approach and represents joint work both with Andreas Frommer, University of Wupertal for the linear problems and with Hans Mittelmann, Arizona State University for the nonlinear problems.

  3. 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.

  4. Solution of linear ill-posed problems using overcomplete dictionaries

    Pensky, Marianna

    2016-01-01

    In the present paper we consider application of overcomplete dictionaries to solution of general ill-posed linear inverse problems. Construction of an adaptive optimal solution for such problems usually relies either on a singular value decomposition or representation of the solution via an orthonormal basis. The shortcoming of both approaches lies in the fact that, in many situations, neither the eigenbasis of the linear operator nor a standard orthonormal basis constitutes an appropriate co...

  5. Essential linear algebra with applications a problem-solving approach

    Andreescu, Titu

    2014-01-01

    This textbook provides a rigorous introduction to linear algebra in addition to material suitable for a more advanced course while emphasizing the subject’s interactions with other topics in mathematics such as calculus and geometry. A problem-based approach is used to develop the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality. Key features include: • a thorough presentation of the main results in linear algebra along with numerous examples to illustrate the theory;  • over 500 problems (half with complete solutions) carefully selected for their elegance and theoretical significance; • an interleaved discussion of geometry and linear algebra, giving readers a solid understanding of both topics and the relationship between them.   Numerous exercises and well-chosen examples make this text suitable for advanced courses at the junior or senior levels. It can also serve as a source of supplementary problems for a sophomore-level course.    ...

  6. Inverse Modelling Problems in Linear Algebra Undergraduate Courses

    Martinez-Luaces, Victor E.

    2013-01-01

    This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different…

  7. Students' errors in solving linear equation word problems: Case ...

    kofi.mereku

    Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.

  8. Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function

    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.

  9. Particle swarm optimization - Genetic algorithm (PSOGA) on linear transportation problem

    Rahmalia, Dinita

    2017-08-01

    Linear Transportation Problem (LTP) is the case of constrained optimization where we want to minimize cost subject to the balance of the number of supply and the number of demand. The exact method such as northwest corner, vogel, russel, minimal cost have been applied at approaching optimal solution. In this paper, we use heurisitic like Particle Swarm Optimization (PSO) for solving linear transportation problem at any size of decision variable. In addition, we combine mutation operator of Genetic Algorithm (GA) at PSO to improve optimal solution. This method is called Particle Swarm Optimization - Genetic Algorithm (PSOGA). The simulations show that PSOGA can improve optimal solution resulted by PSO.

  10. 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.

  11. On a linear-quadratic problem with Caputo derivative

    Dariusz Idczak

    2016-01-01

    Full Text Available In this paper, we study a linear-quadratic optimal control problem with a fractional control system containing a Caputo derivative of unknown function. First, we derive the formulas for the differential and gradient of the cost functional under given constraints. Next, we prove an existence result and derive a maximum principle. Finally, we describe the gradient and projection of the gradient methods for the problem under consideration.

  12. Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

    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.

  13. Paradox in a non-linear capacitated transportation problem

    Dahiya Kalpana

    2006-01-01

    Full Text Available This paper discusses a paradox in fixed charge capacitated transportation problem where the objective function is the sum of two linear fractional functions consisting of variables costs and fixed charges respectively. A paradox arises when the transportation problem admits of an objective function value which is lower than the optimal objective function value, by transporting larger quantities of goods over the same route. A sufficient condition for the existence of a paradox is established. Paradoxical range of flow is obtained for any given flow in which the corresponding objective function value is less than the optimum value of the given transportation problem. Numerical illustration is included in support of theory.

  14. Beam dynamics problems for next generation linear colliders

    Yokoya, Kaoru

    1990-01-01

    The most critical issue for the feasibility of high-energy e + e - linear colliders is obviously the development of intense microwave power sources. Remaining problems, however, are not trivial and in fact some of them require several order-of-magnitude improvement from the existing SLC parameters. The present report summarizes the study status of the beam dynamics problems of high energy linear colliders with an exaggeration on the beam-beam phenomenon at the interaction region. There are four laboratories having linear collider plans, SLAC, CERN, Novosibirsk-Protovino, and KEK. The parameters of these projects scatter in some range but seem to converge slowly if one recalls the status five years ago. The beam energy will be below 500GeV. The basic requirements to the damping ring are the short damping time and small equilibrium emittance. All the proposed designs make use of tight focusing optics and strong wiggler magnets to meet these requirements and seem to have no major problems at least compared with other problems in the colliders. One of the major problems in the linac is the transverse beam blow-up due to the wake field created by the head of the bunch and, in the case of multiple bunches per pulse, by the preceeding bunches. (N.K.)

  15. Linear finite element method for one-dimensional diffusion problems

    Brandao, Michele A.; Dominguez, Dany S.; Iglesias, Susana M., E-mail: micheleabrandao@gmail.com, E-mail: dany@labbi.uesc.br, E-mail: smiglesias@uesc.br [Universidade Estadual de Santa Cruz (LCC/DCET/UESC), Ilheus, BA (Brazil). Departamento de Ciencias Exatas e Tecnologicas. Laboratorio de Computacao Cientifica

    2011-07-01

    We describe in this paper the fundamentals of Linear Finite Element Method (LFEM) applied to one-speed diffusion problems in slab geometry. We present the mathematical formulation to solve eigenvalue and fixed source problems. First, we discretized a calculus domain using a finite set of elements. At this point, we obtain the spatial balance equations for zero order and first order spatial moments inside each element. Then, we introduce the linear auxiliary equations to approximate neutron flux and current inside the element and architect a numerical scheme to obtain the solution. We offer numerical results for fixed source typical model problems to illustrate the method's accuracy for coarse-mesh calculations in homogeneous and heterogeneous domains. Also, we compare the accuracy and computational performance of LFEM formulation with conventional Finite Difference Method (FDM). (author)

  16. Oscillatory solutions of the Cauchy problem for linear differential equations

    Gro Hovhannisyan

    2015-06-01

    Full Text Available We consider the Cauchy problem for second and third order linear differential equations with constant complex coefficients. We describe necessary and sufficient conditions on the data for the existence of oscillatory solutions. It is known that in the case of real coefficients the oscillatory behavior of solutions does not depend on initial values, but we show that this is no longer true in the complex case: hence in practice it is possible to control oscillatory behavior by varying the initial conditions. Our Proofs are based on asymptotic analysis of the zeros of solutions, represented as linear combinations of exponential functions.

  17. Problems of linear electron (polaron) transport theory in semiconductors

    Klinger, M I

    1979-01-01

    Problems of Linear Electron (Polaron) Transport Theory in Semiconductors summarizes and discusses the development of areas in electron transport theory in semiconductors, with emphasis on the fundamental aspects of the theory and the essential physical nature of the transport processes. The book is organized into three parts. Part I focuses on some general topics in the theory of transport phenomena: the general dynamical theory of linear transport in dissipative systems (Kubo formulae) and the phenomenological theory. Part II deals with the theory of polaron transport in a crystalline semicon

  18. Towards an ideal preconditioner for linearized Navier-Stokes problems

    Murphy, M.F. [Univ. of Bristol (United Kingdom)

    1996-12-31

    Discretizing certain linearizations of the steady-state Navier-Stokes equations gives rise to nonsymmetric linear systems with indefinite symmetric part. We show that for such systems there exists a block diagonal preconditioner which gives convergence in three GMRES steps, independent of the mesh size and viscosity parameter (Reynolds number). While this {open_quotes}ideal{close_quotes} preconditioner is too expensive to be used in practice, it provides a useful insight into the problem. We then consider various approximations to the ideal preconditioner, and describe the eigenvalues of the preconditioned systems. Finally, we compare these preconditioners numerically, and present our conclusions.

  19. A bifunctional amorphous polymer exhibiting equal linear and circular photoinduced birefringences.

    Royes, Jorge; Provenzano, Clementina; Pagliusi, Pasquale; Tejedor, Rosa M; Piñol, Milagros; Oriol, Luis

    2014-11-01

    The large and reversible photoinduced linear and circular birefringences in azo-compounds are at the basis of the interest in these materials, which are potentially useful for several applications. Since the onset of the linear and circular anisotropies relies on orientational processes, which typically occur on the molecular and supramolecular length scale, respectively, a circular birefringence at least one order of magnitude lower than the linear one is usually observed. Here, the synthesis and characterization of an amorphous polymer with a dimeric repeating unit containing a cyanoazobenzene and a cyanobiphenyl moiety are reported, in which identical optical linear and circular birefringences are induced for proper light dose and ellipticity. A pump-probe technique and an analytical method based on the Stokes-Mueller formalism are used to investigate the photoinduced effects and to evaluate the anisotropies. The peculiar photoresponse of the polymer makes it a good candidate for applications in smart functional devices. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  20. Regularization Techniques for Linear Least-Squares Problems

    Suliman, Mohamed

    2016-04-01

    Linear estimation is a fundamental branch of signal processing that deals with estimating the values of parameters from a corrupted measured data. Throughout the years, several optimization criteria have been used to achieve this task. The most astonishing attempt among theses is the linear least-squares. Although this criterion enjoyed a wide popularity in many areas due to its attractive properties, it appeared to suffer from some shortcomings. Alternative optimization criteria, as a result, have been proposed. These new criteria allowed, in one way or another, the incorporation of further prior information to the desired problem. Among theses alternative criteria is the regularized least-squares (RLS). In this thesis, we propose two new algorithms to find the regularization parameter for linear least-squares problems. In the constrained perturbation regularization algorithm (COPRA) for random matrices and COPRA for linear discrete ill-posed problems, an artificial perturbation matrix with a bounded norm is forced into the model matrix. This perturbation is introduced to enhance the singular value structure of the matrix. As a result, the new modified model is expected to provide a better stabilize substantial solution when used to estimate the original signal through minimizing the worst-case residual error function. Unlike many other regularization algorithms that go in search of minimizing the estimated data error, the two new proposed algorithms are developed mainly to select the artifcial perturbation bound and the regularization parameter in a way that approximately minimizes the mean-squared error (MSE) between the original signal and its estimate under various conditions. The first proposed COPRA method is developed mainly to estimate the regularization parameter when the measurement matrix is complex Gaussian, with centered unit variance (standard), and independent and identically distributed (i.i.d.) entries. Furthermore, the second proposed COPRA

  1. Numerical algorithms for contact problems in linear elastostatics

    Barbosa, H.J.C.; Feijoo, R.A.

    1984-01-01

    In this work contact problems in linear elasticity are analysed by means of Finite Elements and Mathematical Programming Techniques. The principle of virtual work leads in this case to a variational inequality which in turn is equivalent, for Hookean materials and infinitesimal strains, to the minimization of the total potential energy over the set of all admissible virtual displacements. The use of Gauss-Seidel algorithm with relaxation and projection and also Lemke's algorithm and Uzawa's algorithm for solving the minimization problem is discussed. Finally numerical examples are presented. (Author) [pt

  2. Study of the morphology exhibited by linear segmented polyurethanes during shape memory cycles

    Pereira, I.M.; Orefice, R.L.

    2009-01-01

    By using small-angle X-ray, this study aims to identify the role of the morphological structures of linear segmented thermoplastic polyurethane during shape memory cycle. A deformed specimen was placed on a heating stage mounted at the beamline; the shape recovery was measured during 20min. Furthermore, to study the influence of the temperature during recover, the specimens were subjected to different thermo-cycle. In each condition, the phase morphology and composition were investigated. Recovery process was separated into three stages. Bulk incompatibility and entropic recovery were the two controlling features for determining the final polyurethane morphology. (author)

  3. Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems

    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.

  4. Steric hindrances create a discrete linear Dy4 complex exhibiting SMM behaviour.

    Lin, Shuang-Yan; Zhao, Lang; Ke, Hongshan; Guo, Yun-Nan; Tang, Jinkui; Guo, Yang; Dou, Jianmin

    2012-03-21

    Two linear tetranuclear lanthanide complexes of general formula [Ln(4)(L)(2)(C(6)H(5)COO)(12)(MeOH)(4)], where HL = 2,6-bis((furan-2-ylmethylimino)methyl)-4-methylphenol, () and Ln(III) = Dy(III) (1) and Gd(III) (2), have been synthesized and characterized. The crystal structural analysis demonstrates that two Schiff-base ligands inhibit the growth of benzoate bridged 1D chains, leading to the isolation of discrete tetranuclear complexes due to their steric hindrances. Every Ln(III) ion is coordinated by eight donor atoms in a distorted bicapped trigonal-prismatic arrangement. Alternating current (ac) susceptibility measurements of complex 1 reveal a frequency- and temperature-dependent out-of-phase signal under zero dc field, typical of single-molecule magnet (SMM) behaviour with an anisotropic barrier Δ(eff) = 17.2 K.

  5. "small problems, Big Trouble": An Art and Science Collaborative Exhibition Reflecting Seemingly small problems Leading to Big Threats

    Waller, J. L.; Brey, J. A.

    2014-12-01

    "small problems, Big Trouble" (spBT) is an exhibition of artist Judith Waller's paintings accompanied by text panels written by Earth scientist Dr. James A. Brey and several science researchers and educators. The text panels' message is as much the focus of the show as the art--true interdisciplinarity! Waller and Brey's history of art and earth science collaborations include the successful exhibition "Layers: Places in Peril". New in spBT is extended collaboration with other scientists in order to create awareness of geoscience and other subjects (i.e. soil, parasites, dust, pollutants, invasive species, carbon, ground water contaminants, solar wind) small in scale which pose significant threats. The paintings are the size of a mirror, a symbol suggesting the problems depicted are those we increasingly need to face, noting our collective reflections of shared current and future reality. Naturalistic rendering and abstract form in the art helps reach a broad audience including those familiar with art and those familiar with science. The goal is that gallery visitors gain greater appreciation and understanding of both—and of the sober content of the show as a whole. "small problems, Big Trouble" premiers in Wisconsin April, 2015. As in previous collaborations, Waller and Brey actively utilize art and science (specifically geoscience) as an educational vehicle for active student learning. Planned are interdisciplinary university and area high school activities linked through spBT. The exhibition in a public gallery offers a means to enhance community awareness of and action on scientific issues through art's power to engage people on an emotional level. This AGU presentation includes a description of past Waller and Brey activities: incorporating art and earth science in lab and studio classrooms, producing gallery and museum exhibitions and delivering workshops and other presentations. They also describe how walking the paths of several past earth science

  6. 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.

  7. Numerical solution of non-linear diffusion problems

    Carmen, A. del; Ferreri, J.C.

    1998-01-01

    This paper presents a method for the numerical solution of non-linear diffusion problems using finite-differences in moving grids. Due to the presence of steep fronts in the solution domain and to the presence of advective terms originating in the grid movement, an implicit TVD scheme, first order in time and second order in space has been developed. Some algebraic details of the derivation are given. Results are shown for the pure advection of a scalar as a test case and an example dealing with the slow spreading of viscous fluids over plane surfaces. The agreement between numerical and analytical solutions is excellent. (author). 8 refs., 3 figs

  8. Description of All Solutions of a Linear Complementarity Problem

    Rohn, Jiří

    2009-01-01

    Roč. 18, - (2009), s. 246-252 E-ISSN 1081-3810 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : linear complementarity problem * Moore-Penrose inverse * verified solution * absolute value equation Subject RIV: BA - General Mathematics Impact factor: 0.892, year: 2009 http://www.math.technion.ac.il/iic/ ela / ela -articles/articles/vol18_pp246-252.pdf

  9. New method for preparing a liquid crystal polymer that exhibits linearly polarized white fluorescence

    Zheng Shijun; Kun, Wang; Kobayashi, Takaomi

    2011-01-01

    With the aim of developing a single-chain white-light-emitting polymer, liquid crystal (LC) polymers with a shish-kebab-type moiety on their cross-conjugated (p-phenylene)s-poly(p-phenylenevinylene)s main chain were synthesized by Gilch polymerization. They were characterized by nuclear magnetic resonance (NMR), gel permeation chromatography (GPC), differential scanning calorimetry (DSC), X-ray diffraction (XRD), and polarizing optical microscopy (POM). 1 H-NMR indicated that the polymers had a shish-kebab structure, which strongly suppressed the formation of structural defects in the polymers. DSC revealed that the polymers had thermotropic LC properties, indicating that the LC polymers were enantiotropic. XRD showed that the polymers had a mesophase, which implies that they were in a smectic LC phase. A polymer with 'kebabs' of 2,5-bis(4'-alkoxyphenyl)benzene was combined with an aligned polyimide film with orientated microgrooves. The polymer main chain was aligned due to the orientation of the 'kebabs' of the uniform cross-conjugated structure. It lay between the kebabs and the 'shish' of the polymer main chains. The aligned polymer main chain emitted yellow light while and the oriented LC side chains emitted blue light emission. These two emissions resulted in linearly polarized white fluorescence.

  10. Convergence diagnostics for Eigenvalue problems with linear regression model

    Shi, Bo; Petrovic, Bojan

    2011-01-01

    Although the Monte Carlo method has been extensively used for criticality/Eigenvalue problems, a reliable, robust, and efficient convergence diagnostics method is still desired. Most methods are based on integral parameters (multiplication factor, entropy) and either condense the local distribution information into a single value (e.g., entropy) or even disregard it. We propose to employ the detailed cycle-by-cycle local flux evolution obtained by using mesh tally mechanism to assess the source and flux convergence. By applying a linear regression model to each individual mesh in a mesh tally for convergence diagnostics, a global convergence criterion can be obtained. We exemplify this method on two problems and obtain promising diagnostics results. (author)

  11. Bounds and estimates for the linearly perturbed eigenvalue problem

    Raddatz, W.D.

    1983-01-01

    This thesis considers the problem of bounding and estimating the discrete portion of the spectrum of a linearly perturbed self-adjoint operator, M(x). It is supposed that one knows an incomplete set of data consisting in the first few coefficients of the Taylor series expansions of one or more of the eigenvalues of M(x) about x = 0. The foundations of the variational study of eigen-values are first presented. These are then used to construct the best possible upper bounds and estimates using various sets of given information. Lower bounds are obtained by estimating the error in the upper bounds. The extension of these bounds and estimates to the eigenvalues of the doubly-perturbed operator M(x,y) is discussed. The results presented have numerous practical application in the physical sciences, including problems in atomic physics and the theory of vibrations of acoustical and mechanical systems

  12. Point source reconstruction principle of linear inverse problems

    Terazono, Yasushi; Matani, Ayumu; Fujimaki, Norio; Murata, Tsutomu

    2010-01-01

    Exact point source reconstruction for underdetermined linear inverse problems with a block-wise structure was studied. In a block-wise problem, elements of a source vector are partitioned into blocks. Accordingly, a leadfield matrix, which represents the forward observation process, is also partitioned into blocks. A point source is a source having only one nonzero block. An example of such a problem is current distribution estimation in electroencephalography and magnetoencephalography, where a source vector represents a vector field and a point source represents a single current dipole. In this study, the block-wise norm, a block-wise extension of the l p -norm, was defined as the family of cost functions of the inverse method. The main result is that a set of three conditions was found to be necessary and sufficient for block-wise norm minimization to ensure exact point source reconstruction for any leadfield matrix that admit such reconstruction. The block-wise norm that satisfies the conditions is the sum of the cost of all the observations of source blocks, or in other words, the block-wisely extended leadfield-weighted l 1 -norm. Additional results are that minimization of such a norm always provides block-wisely sparse solutions and that its solutions form cones in source space

  13. An improved partial bundle method for linearly constrained minimax problems

    Chunming Tang

    2016-02-01

    Full Text Available In this paper, we propose an improved partial bundle method for solving linearly constrained minimax problems. In order to reduce the number of component function evaluations, we utilize a partial cutting-planes model to substitute for the traditional one. At each iteration, only one quadratic programming subproblem needs to be solved to obtain a new trial point. An improved descent test criterion is introduced to simplify the algorithm. The method produces a sequence of feasible trial points, and ensures that the objective function is monotonically decreasing on the sequence of stability centers. Global convergence of the algorithm is established. Moreover, we utilize the subgradient aggregation strategy to control the size of the bundle and therefore overcome the difficulty of computation and storage. Finally, some preliminary numerical results show that the proposed method is effective.

  14. Linear differential equations to solve nonlinear mechanical problems: A novel approach

    Nair, C. Radhakrishnan

    2004-01-01

    Often a non-linear mechanical problem is formulated as a non-linear differential equation. A new method is introduced to find out new solutions of non-linear differential equations if one of the solutions of a given non-linear differential equation is known. Using the known solution of the non-linear differential equation, linear differential equations are set up. The solutions of these linear differential equations are found using standard techniques. Then the solutions of the linear differe...

  15. Analysis of the efficiency of the linearization techniques for solving multi-objective linear fractional programming problems by goal programming

    Tunjo Perić

    2017-01-01

    Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.

  16. A Linear Programming Reformulation of the Standard Quadratic Optimization Problem

    de Klerk, E.; Pasechnik, D.V.

    2005-01-01

    The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially

  17. A local-global problem for linear differential equations

    Put, Marius van der; Reversat, Marc

    2008-01-01

    An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is

  18. A local-global problem for linear differential equations

    Put, Marius van der; Reversat, Marc

    An inhomogeneous linear differential equation Ly = f over a global differential field can have a formal solution for each place without having a global solution. The vector space lgl(L) measures this phenomenon. This space is interpreted in terms of cohomology of linear algebraic groups and is

  19. The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.

    Narayanamoorthy, S; Kalyani, S

    2015-01-01

    An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  20. The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem

    S. Narayanamoorthy

    2015-01-01

    Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.

  1. Mathematical problems in non-linear Physics: some results

    1979-01-01

    The basic results presented in this report are the following: 1) Characterization of the range and Kernel of the variational derivative. 2) Determination of general conservation laws in linear evolution equations, as well as bounds for the number of polynomial conserved densities in non-linear evolution equations in two independent variables of even order. 3) Construction of the most general evolution equation which has a given family of conserved densities. 4) Regularity conditions for the validity of the Lie invariance method. 5) A simple class of perturbations in non-linear wave equations. 6) Soliton solutions in generalized KdV equations. (author)

  2. Burgers' turbulence problem with linear or quadratic external potential

    Barndorff-Nielsen, Ole Eiler; Leonenko, N.N.

    2005-01-01

    We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.......We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions....

  3. A program package for solving linear optimization problems

    Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki

    1980-09-01

    Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)

  4. Dirichlet problem for quasi-linear elliptic equations

    Azeddine Baalal

    2002-10-01

    Full Text Available We study the Dirichlet Problem associated to the quasilinear elliptic problem $$ -sum_{i=1}^{n}frac{partial }{partial x_i}mathcal{A}_i(x,u(x, abla u(x+mathcal{B}(x,u(x,abla u(x=0. $$ Then we define a potential theory related to this problem and we show that the sheaf of continuous solutions satisfies the Bauer axiomatic theory. Submitted April 9, 2002. Published October 2, 2002. Math Subject Classifications: 31C15, 35B65, 35J60. Key Words: Supersolution; Dirichlet problem; obstacle problem; nonlinear potential theory.

  5. On nonlocal semi linear elliptic problem with an indefinite term

    Yechoui, Akila

    2007-08-01

    The aim of this paper is to investigate the existence of solutions of a nonlocal semi linear elliptic equation with an indefinite term. The monotone method, the method of upper and lower solutions and the classical maximum principle are used to obtain our results. (author)

  6. Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems

    Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav

    2014-01-01

    Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014

  7. Hybrid Method for Solving Inventory Problems with a Linear ...

    Osagiede and Omosigho (2004) proposed a direct search method for identifying the number of replenishment when the demand pattern is linearly increasing. The main computational task in this direct search method was associated with finding the optimal number of replenishments. To accelerate the use of this method, the ...

  8. Answers to selected problems in multivariable calculus with linear algebra and series

    Trench, William F

    1972-01-01

    Answers to Selected Problems in Multivariable Calculus with Linear Algebra and Series contains the answers to selected problems in linear algebra, the calculus of several variables, and series. Topics covered range from vectors and vector spaces to linear matrices and analytic geometry, as well as differential calculus of real-valued functions. Theorems and definitions are included, most of which are followed by worked-out illustrative examples.The problems and corresponding solutions deal with linear equations and matrices, including determinants; vector spaces and linear transformations; eig

  9. The Tree Inclusion Problem: In Linear Space and Faster

    Bille, Philip; Gørtz, Inge Li

    2011-01-01

    Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been recognized as an important query primitive in XML databases. Kilpel äinen and Mannila [1995] presented the first....... This is particularly important in practical applications, such as XML databases, where the space is likely to be a bottleneck. © 2011 ACM....

  10. Some mathematical problems in non-linear Physics

    1983-01-01

    The main results contained in this report are the following: I) A general analysis of non-autonomous conserved densities for simple linear evolution systems. II) Partial differential systems within a wide class are converted into Lagrange an form. III) Rigorous criteria for existence of integrating factor matrices. IV) Isolation of all third-order evolution equations with high order symmetries and conservation laws. (Author) 3 refs

  11. Analytical Solutions to Non-linear Mechanical Oscillation Problems

    Kaliji, H. D.; Ghadimi, M.; Barari, Amin

    2011-01-01

    In this paper, the Max-Min Method is utilized for solving the nonlinear oscillation problems. The proposed approach is applied to three systems with complex nonlinear terms in their motion equations. By means of this method, the dynamic behavior of oscillation systems can be easily approximated u...

  12. Delayed Stochastic Linear-Quadratic Control Problem and Related Applications

    Li Chen

    2012-01-01

    stochastic differential equations (FBSDEs with Itô’s stochastic delay equations as forward equations and anticipated backward stochastic differential equations as backward equations. Especially, we present the optimal feedback regulator for the time delay system via a new type of Riccati equations and also apply to a population optimal control problem.

  13. (AJST) THE LINEAR ORDERING PROBLEM: AN ALGORITHM FOR ...

    ABSTRACT:- In this paper we describe and implement an algorithm for the exact ... of the solutions space which grows exponentially with ... terms of the formulation of the problem, these are the ... Definition: A digraph D = (V, A) is called a k-fence if it has the following ... (iv) If two dicycles Ci and Cj, 2

  14. From a Nonlinear, Nonconvex Variational Problem to a Linear, Convex Formulation

    Egozcue, J.; Meziat, R.; Pedregal, P.

    2002-01-01

    We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature

  15. The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem

    Hongchun Sun

    2012-01-01

    Full Text Available For the extended mixed linear complementarity problem (EML CP, we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.

  16. Linear problems and Baecklund transformations for the Hirota-Ohta system

    Adler, V.E.; Postnikov, V.V.

    2011-01-01

    The auxiliary linear problems are presented for all discretization levels of the Hirota-Ohta system. The structure of these linear problems coincides essentially with the structure of Nonlinear Schroedinger hierarchy. The squared eigenfunction constraints are found which relate Hirota-Ohta and Kulish-Sklyanin vectorial NLS hierarchies.

  17. Sensitivity analysis of linear programming problem through a recurrent neural network

    Das, Raja

    2017-11-01

    In this paper we study the recurrent neural network for solving linear programming problems. To achieve optimality in accuracy and also in computational effort, an algorithm is presented. We investigate the sensitivity analysis of linear programming problem through the neural network. A detailed example is also presented to demonstrate the performance of the recurrent neural network.

  18. Fundamental solution of the problem of linear programming and method of its determination

    Petrunin, S. V.

    1978-01-01

    The idea of a fundamental solution to a problem in linear programming is introduced. A method of determining the fundamental solution and of applying this method to the solution of a problem in linear programming is proposed. Numerical examples are cited.

  19. Some contributions to non-linear physic: Mathematical problems

    1981-01-01

    The main results contained in this report are the following: i ) Lagrangian universality holds in a precisely defined weak sense. II ) Isolation of 5th order polynomial evolution equations having high order conservation laws. III ) Hamiltonian formulation of a wide class of non-linear evolution equations. IV) Some properties of the symmetries of Gardner-like systems. v) Characterization of the range and Kernel of ζ/ζ u α , |α | - 1. vi) A generalized variational approach and application to the anharmonic oscillator. v II ) Relativistic correction and quasi-classical approximation to the anechoic oscillator. VII ) Properties of a special class of 6th-order anharmonic oscillators. ix) A new method for constructing conserved densities In PDE. (Author) 97 refs

  20. Piecewise-linear and bilinear approaches to nonlinear differential equations approximation problem of computational structural mechanics

    Leibov Roman

    2017-01-01

    This paper presents a bilinear approach to nonlinear differential equations system approximation problem. Sometimes the nonlinear differential equations right-hand sides linearization is extremely difficult or even impossible. Then piecewise-linear approximation of nonlinear differential equations can be used. The bilinear differential equations allow to improve piecewise-linear differential equations behavior and reduce errors on the border of different linear differential equations systems ...

  1. Inverse Boundary Value Problem for Non-linear Hyperbolic Partial Differential Equations

    Nakamura, Gen; Vashisth, Manmohan

    2017-01-01

    In this article we are concerned with an inverse boundary value problem for a non-linear wave equation of divergence form with space dimension $n\\geq 3$. This non-linear wave equation has a trivial solution, i.e. zero solution. By linearizing this equation at the trivial solution, we have the usual linear isotropic wave equation with the speed $\\sqrt{\\gamma(x)}$ at each point $x$ in a given spacial domain. For any small solution $u=u(t,x)$ of this non-linear equation, we have the linear isotr...

  2. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

    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 some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

  3. Numerical Methods for Solution of the Extended Linear Quadratic Control Problem

    Jørgensen, John Bagterp; Frison, Gianluca; Gade-Nielsen, Nicolai Fog

    2012-01-01

    In this paper we present the extended linear quadratic control problem, its efficient solution, and a discussion of how it arises in the numerical solution of nonlinear model predictive control problems. The extended linear quadratic control problem is the optimal control problem corresponding...... to the Karush-Kuhn-Tucker system that constitute the majority of computational work in constrained nonlinear and linear model predictive control problems solved by efficient MPC-tailored interior-point and active-set algorithms. We state various methods of solving the extended linear quadratic control problem...... and discuss instances in which it arises. The methods discussed in the paper have been implemented in efficient C code for both CPUs and GPUs for a number of test examples....

  4. Towards Resolving the Crab Sigma-Problem: A Linear Accelerator?

    Contopoulos, Ioannis; Kazanas, Demosthenes; White, Nicholas E. (Technical Monitor)

    2002-01-01

    Using the exact solution of the axisymmetric pulsar magnetosphere derived in a previous publication and the conservation laws of the associated MHD flow, we show that the Lorentz factor of the outflowing plasma increases linearly with distance from the light cylinder. Therefore, the ratio of the Poynting to particle energy flux, generically referred to as sigma, decreases inversely proportional to distance, from a large value (typically approx. greater than 10(exp 4)) near the light cylinder to sigma approx. = 1 at a transition distance R(sub trans). Beyond this distance the inertial effects of the outflowing plasma become important and the magnetic field geometry must deviate from the almost monopolar form it attains between R(sub lc), and R(sub trans). We anticipate that this is achieved by collimation of the poloidal field lines toward the rotation axis, ensuring that the magnetic field pressure in the equatorial region will fall-off faster than 1/R(sup 2) (R being the cylindrical radius). This leads both to a value sigma = a(sub s) much less than 1 at the nebular reverse shock at distance R(sub s) (R(sub s) much greater than R(sub trans)) and to a component of the flow perpendicular to the equatorial component, as required by observation. The presence of the strong shock at R = R(sub s) allows for the efficient conversion of kinetic energy into radiation. We speculate that the Crab pulsar is unique in requiring sigma(sub s) approx. = 3 x 10(exp -3) because of its small translational velocity, which allowed for the shock distance R(sub s) to grow to values much greater than R(sub trans).

  5. DESIGN OF EDUCATIONAL PROBLEMS ON LINEAR PROGRAMMING USING SYSTEMS OF COMPUTER MATHEMATICS

    Volodymyr M. Mykhalevych

    2013-11-01

    Full Text Available From a perspective of the theory of educational problems a problem of substitution in the conditions of ICT use of one discipline by an educational problem of another discipline is represented. Through the example of mathematical problems of linear programming it is showed that a student’s method of operation in the course of an educational problem solving is determinant in the identification of an educational problem in relation to a specific discipline: linear programming, informatics, mathematical modeling, methods of optimization, automatic control theory, calculus etc. It is substantiated the necessity of linear programming educational problems renovation with the purpose of making students free of bulky similar arithmetic calculations and notes which often becomes a barrier to a deeper understanding of key ideas taken as a basis of algorithms used by them.

  6. Method for solving fully fuzzy linear programming problems using deviation degree measure

    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.

  7. 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.

  8. Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

    Gene Golub; Kwok Ko

    2009-01-01

    The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

  9. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.

    Bruhn, Peter; Geyer-Schulz, Andreas

    2002-01-01

    In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.

  10. Fuzzy Multi Objective Linear Programming Problem with Imprecise Aspiration Level and Parameters

    Zahra Shahraki

    2015-07-01

    Full Text Available This paper considers the multi-objective linear programming problems with fuzzygoal for each of the objective functions and constraints. Most existing works deal withlinear membership functions for fuzzy goals. In this paper, exponential membershipfunction is used.

  11. Analytical vs. Simulation Solution Techniques for Pulse Problems in Non-linear Stochastic Dynamics

    Iwankiewicz, R.; Nielsen, Søren R. K.

    Advantages and disadvantages of available analytical and simulation techniques for pulse problems in non-linear stochastic dynamics are discussed. First, random pulse problems, both those which do and do not lead to Markov theory, are presented. Next, the analytical and analytically-numerical tec......Advantages and disadvantages of available analytical and simulation techniques for pulse problems in non-linear stochastic dynamics are discussed. First, random pulse problems, both those which do and do not lead to Markov theory, are presented. Next, the analytical and analytically...

  12. 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,…

  13. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

    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.

  14. Non-linear analytic and coanalytic problems (Lp-theory, Clifford analysis, examples)

    Dubinskii, Yu A; Osipenko, A S

    2000-01-01

    Two kinds of new mathematical model of variational type are put forward: non-linear analytic and coanalytic problems. The formulation of these non-linear boundary-value problems is based on a decomposition of the complete scale of Sobolev spaces into the 'orthogonal' sum of analytic and coanalytic subspaces. A similar decomposition is considered in the framework of Clifford analysis. Explicit examples are presented

  15. Non-linear analytic and coanalytic problems ( L_p-theory, Clifford analysis, examples)

    Dubinskii, Yu A.; Osipenko, A. S.

    2000-02-01

    Two kinds of new mathematical model of variational type are put forward: non-linear analytic and coanalytic problems. The formulation of these non-linear boundary-value problems is based on a decomposition of the complete scale of Sobolev spaces into the "orthogonal" sum of analytic and coanalytic subspaces. A similar decomposition is considered in the framework of Clifford analysis. Explicit examples are presented.

  16. A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems

    Tunjo Perić

    2014-12-01

    Full Text Available 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.

  17. Effective linear two-body method for many-body problems in atomic and nuclear physics

    Kim, Y.E.; Zubarev, A.L.

    2000-01-01

    We present an equivalent linear two-body method for the many body problem, which is based on an approximate reduction of the many-body Schroedinger equation by the use of a variational principle. The method is applied to several problems in atomic and nuclear physics. (author)

  18. Vector-valued measure and the necessary conditions for the optimal control problems of linear systems

    Xunjing, L.

    1981-12-01

    The vector-valued measure defined by the well-posed linear boundary value problems is discussed. The maximum principle of the optimal control problem with non-convex constraint is proved by using the vector-valued measure. Especially, the necessary conditions of the optimal control of elliptic systems is derived without the convexity of the control domain and the cost function. (author)

  19. The application of the fall-vector method in decomposition schemes for the solution of integer linear programming problems

    Sergienko, I.V.; Golodnikov, A.N.

    1984-01-01

    This article applies the methods of decompositions, which are used to solve continuous linear problems, to integer and partially integer problems. The fall-vector method is used to solve the obtained coordinate problems. An algorithm of the fall-vector is described. The Kornai-Liptak decomposition principle is used to reduce the integer linear programming problem to integer linear programming problems of a smaller dimension and to a discrete coordinate problem with simple constraints

  20. Single-machine common/slack due window assignment problems with linear decreasing processing times

    Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia

    2017-08-01

    This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O(n log n) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.

  1. Updating QR factorization procedure for solution of linear least squares problem with equality constraints.

    Zeb, Salman; Yousaf, Muhammad

    2017-01-01

    In this article, we present a QR updating procedure as a solution approach for linear least squares problem with equality constraints. We reduce the constrained problem to unconstrained linear least squares and partition it into a small subproblem. The QR factorization of the subproblem is calculated and then we apply updating techniques to its upper triangular factor R to obtain its solution. We carry out the error analysis of the proposed algorithm to show that it is backward stable. We also illustrate the implementation and accuracy of the proposed algorithm by providing some numerical experiments with particular emphasis on dense problems.

  2. A novel approach based on preference-based index for interval bilevel linear programming problem

    Aihong Ren; Yuping Wang; Xingsi Xue

    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-constrain...

  3. Quasi-stability of a vector trajectorial problem with non-linear partial criteria

    Vladimir A. Emelichev

    2003-10-01

    Full Text Available Multi-objective (vector combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability are obtained. The problem is a discrete analogue of the lower semicontinuity by Hausdorff of the optimal mapping. Mathematics Subject Classification 2000: 90C10, 90C05, 90C29, 90C31.

  4. 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. Copyright © 2017 Elsevier Ltd. All rights reserved.

  5. The Core Problem within a Linear Approximation Problem $AX/approx B$ with Multiple Right-Hand Sides

    Hnětynková, Iveta; Plešinger, Martin; Strakoš, Z.

    2013-01-01

    Roč. 34, č. 3 (2013), s. 917-931 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA ČR(CZ) GA201/09/0917; GA MŠk(CZ) EE2.3.09.0155; GA MŠk(CZ) EE2.3.30.0065 Program:GA Institutional support: RVO:67985807 Keywords : total least squares problem * multiple right-hand sides * core problem * linear approximation problem * error-in-variables modeling * orthogonal regression * singular value decomposition Subject RIV: BA - General Mathematics Impact factor: 1.806, year: 2013

  6. Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

    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.

  7. A Fast Condensing Method for Solution of Linear-Quadratic Control Problems

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    consider a condensing (or state elimination) method to solve an extended version of the LQ control problem, and we show how to exploit the structure of this problem to both factorize the dense Hessian matrix and solve the system. Furthermore, we present two efficient implementations. The first......In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper we...... implementation is formally identical to the Riccati recursion based solver and has a computational complexity that is linear in the control horizon length and cubic in the number of states. The second implementation has a computational complexity that is quadratic in the control horizon length as well...

  8. Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming

    Claudel, Christian G.; Chamoin, Timothee; Bayen, Alexandre M.

    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.

  9. An improved error bound for linear complementarity problems for B-matrices

    Lei Gao

    2017-06-01

    Full Text Available Abstract A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in (Li et al. in Electron. J. Linear Algebra 31(1:476-484, 2016. In addition some sufficient conditions such that the new bound is sharper than that in (García-Esnaola and Peña in Appl. Math. Lett. 22(7:1071-1075, 2009 are provided.

  10. An analogue of Morse theory for planar linear networks and the generalized Steiner problem

    Karpunin, G A

    2000-01-01

    A study is made of the generalized Steiner problem: the problem of finding all the locally minimal networks spanning a given boundary set (terminal set). It is proposed to solve this problem by using an analogue of Morse theory developed here for planar linear networks. The space K of all planar linear networks spanning a given boundary set is constructed. The concept of a critical point and its index is defined for the length function l of a planar linear network. It is shown that locally minimal networks are local minima of l on K and are critical points of index 1. The theorem is proved that the sum of the indices of all the critical points is equal to χ(K)=1. This theorem is used to find estimates for the number of locally minimal networks spanning a given boundary set

  11. Simplified neural networks for solving linear least squares and total least squares problems in real time.

    Cichocki, A; Unbehauen, R

    1994-01-01

    In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.

  12. Third-order-accurate numerical methods for efficient, large time-step solutions of mixed linear and nonlinear problems

    Cobb, J.W.

    1995-02-01

    There is an increasing need for more accurate numerical methods for large-scale nonlinear magneto-fluid turbulence calculations. These methods should not only increase the current state of the art in terms of accuracy, but should also continue to optimize other desired properties such as simplicity, minimized computation, minimized memory requirements, and robust stability. This includes the ability to stably solve stiff problems with long time-steps. This work discusses a general methodology for deriving higher-order numerical methods. It also discusses how the selection of various choices can affect the desired properties. The explicit discussion focuses on third-order Runge-Kutta methods, including general solutions and five examples. The study investigates the linear numerical analysis of these methods, including their accuracy, general stability, and stiff stability. Additional appendices discuss linear multistep methods, discuss directions for further work, and exhibit numerical analysis results for some other commonly used lower-order methods.

  13. Parallel Implementation of Riccati Recursion for Solving Linear-Quadratic Control Problems

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...

  14. Multigrid for the Galerkin least squares method in linear elasticity: The pure displacement problem

    Yoo, Jaechil [Univ. of Wisconsin, Madison, WI (United States)

    1996-12-31

    Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we prove the convergence of a multigrid (W-cycle) method. This multigrid is robust in that the convergence is uniform as the parameter, v, goes to 1/2 Computational experiments are included.

  15. A Compensatory Approach to Multiobjective Linear Transportation Problem with Fuzzy Cost Coefficients

    Hale Gonce Kocken

    2011-01-01

    Full Text Available This paper deals with the Multiobjective Linear Transportation Problem that has fuzzy cost coefficients. In the solution procedure, many objectives may conflict with each other; therefore decision-making process becomes complicated. And also due to the fuzziness in the costs, this problem has a nonlinear structure. In this paper, fuzziness in the objective functions is handled with a fuzzy programming technique in the sense of multiobjective approach. And then we present a compensatory approach to solve Multiobjective Linear Transportation Problem with fuzzy cost coefficients by using Werner's and operator. Our approach generates compromise solutions which are both compensatory and Pareto optimal. A numerical example has been provided to illustrate the problem.

  16. The Cauchy problem for non-linear Klein-Gordon equations

    Simon, J.C.H.; Taflin, E.

    1993-01-01

    We consider in R n+1 , n≥2, the non-linear Klein-Gordon equation. We prove for such an equation that there is neighbourhood of zero in a Hilbert space of initial conditions for which the Cauchy problem has global solutions and on which there is asymptotic completeness. The inverse of the wave operator linearizes the non-linear equation. If, moreover, the equation is manifestly Poincare covariant then the non-linear representation of the Poincare-Lie algebra, associated with the non-linear Klein-Gordon equation is integrated to a non-linear representation of the Poincare group on an invariant neighbourhood of zero in the Hilbert space. This representation is linearized by the inverse of the wave operator. The Hilbert space is, in both cases, the closure of the space of the differentiable vectors for the linear representation of the Poincare group, associated with the Klein-Gordon equation, with respect to a norm defined by the representation of the enveloping algebra. (orig.)

  17. Mixed problems for linear symmetric hyperbolic systems with characteristic boundary conditions

    Secchi, P.

    1994-01-01

    We consider the initial-boundary value problem for symmetric hyperbolic systems with characteristic boundary of constant multiplicity. In the linear case we give some results about the existence of regular solutions in suitable functions spaces which take in account the loss of regularity in the normal direction to the characteristic boundary. We also consider the equations of ideal magneto-hydrodynamics under perfectly conducting wall boundary conditions and give some results about the solvability of such mixed problem. (author). 16 refs

  18. Stress-constrained truss topology optimization problems that can be solved by linear programming

    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....

  19. Fuzzy solution of the linear programming problem with interval coefficients in the constraints

    Dorota Kuchta

    2005-01-01

    A fuzzy concept of solving the linear programming problem with interval coefficients is proposed. For each optimism level of the decision maker (where the optimism concerns the certainty that no errors have been committed in the estimation of the interval coefficients and the belief that optimistic realisations of the interval coefficients will occur) another interval solution of the problem will be generated and the decision maker will be able to choose the final solution having a complete v...

  20. An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

    Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

    2018-01-01

    The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

  1. Analysis of junior high school students' attempt to solve a linear inequality problem

    Taqiyuddin, Muhammad; Sumiaty, Encum; Jupri, Al

    2017-08-01

    Linear inequality is one of fundamental subjects within junior high school mathematics curricula. Several studies have been conducted to asses students' perform on linear inequality. However, it can hardly be found that linear inequality problems are in the form of "ax + b condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.

  2. Efficient Implementation of the Riccati Recursion for Solving Linear-Quadratic Control Problems

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....

  3. A non linear half space problem for radiative transfer equations. Application to the Rosseland approximation

    Sentis, R.

    1984-07-01

    The radiative transfer equations may be approximated by a non linear diffusion equation (called Rosseland equation) when the mean free paths of the photons are small with respect to the size of the medium. Some technical assomptions are made, namely about the initial conditions, to avoid any problem of initial layer terms

  4. Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems.

    Shama, Gilli; Dreyfus, Tommy

    1994-01-01

    Identified and classified solution strategies of (n=49) 10th-grade students who were presented with linear programming problems in a predominantly visual setting in the form of a computerized game. Visual strategies were developed more frequently than either algebraic or mixed strategies. Appendix includes questionnaires. (Contains 11 references.)…

  5. Remark on periodic boundary-value problem for second-order linear ordinary differential equations

    Dosoudilová, M.; Lomtatidze, Alexander

    2018-01-01

    Roč. 2018, č. 13 (2018), s. 1-7 ISSN 1072-6691 Institutional support: RVO:67985840 Keywords : second-order linear equation * periodic boundary value problem * unique solvability Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.954, year: 2016 https://ejde.math.txstate.edu/Volumes/2018/13/abstr.html

  6. Comparison of the Tangent Linear Properties of Tracer Transport Schemes Applied to Geophysical Problems.

    Kent, James; Holdaway, Daniel

    2015-01-01

    A number of geophysical applications require the use of the linearized version of the full model. One such example is in numerical weather prediction, where the tangent linear and adjoint versions of the atmospheric model are required for the 4DVAR inverse problem. The part of the model that represents the resolved scale processes of the atmosphere is known as the dynamical core. Advection, or transport, is performed by the dynamical core. It is a central process in many geophysical applications and is a process that often has a quasi-linear underlying behavior. However, over the decades since the advent of numerical modelling, significant effort has gone into developing many flavors of high-order, shape preserving, nonoscillatory, positive definite advection schemes. These schemes are excellent in terms of transporting the quantities of interest in the dynamical core, but they introduce nonlinearity through the use of nonlinear limiters. The linearity of the transport schemes used in Goddard Earth Observing System version 5 (GEOS-5), as well as a number of other schemes, is analyzed using a simple 1D setup. The linearized version of GEOS-5 is then tested using a linear third order scheme in the tangent linear version.

  7. Minimization of Linear Functionals Defined on| Solutions of Large-Scale Discrete Ill-Posed Problems

    Elden, Lars; Hansen, Per Christian; Rojas, Marielba

    2003-01-01

    The minimization of linear functionals de ned on the solutions of discrete ill-posed problems arises, e.g., in the computation of con dence intervals for these solutions. In 1990, Elden proposed an algorithm for this minimization problem based on a parametric-programming reformulation involving...... the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat...

  8. A new methodological development for solving linear bilevel integer programming problems in hybrid fuzzy environment

    Animesh Biswas

    2016-04-01

    Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.

  9. A primal-dual exterior point algorithm for linear programming problems

    Samaras Nikolaos

    2009-01-01

    Full Text Available The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase-implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study has been carried out, using randomly generated sparse optimal linear problems, to compare its computational efficiency with the Primal Simplex algorithm and also with MATLAB's Interior Point Method implementation. The algorithm appears to be very promising since it clearly shows its superiority to the Primal Simplex algorithm as well as its robustness over the IPM algorithm.

  10. A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty

    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.

  11. A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.

    Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa

    2018-02-01

    Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.

  12. Solving a class of generalized fractional programming problems using the feasibility of linear programs.

    Shen, Peiping; Zhang, Tongli; Wang, Chunfeng

    2017-01-01

    This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

  13. Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

    Hideki Katagiri

    2017-10-01

    Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments.

  14. On the problem of linear calibration for a reading system of measuring devices

    Shigaev, V.N.

    1978-01-01

    The problem of gauging the frame of reference of a measuring device has been giVen a general approach which consists in finding an approximated inverse transformation on the basis of a partial diagram of a direct transformation which is defined on a given set, D, within the limits of the device measuring range. The following linear models of frame of reference are discussed: a general oblique system; a rectangular system with axes having different scales; a rectangular system with similar scale axes. Linear distortion for two rectangular models has been assessed. It is pointed out that the best approximation to the reduction operation should be found over the D set

  15. APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP

    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. 

  16. A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem

    Nurdan Cetin

    2014-01-01

    Full Text Available We consider a multiobjective linear fractional transportation problem (MLFTP with several fractional criteria, such as, the maximization of the transport profitability like profit/cost or profit/time, and its two properties are source and destination. Our aim is to introduce MLFTP which has not been studied in literature before and to provide a fuzzy approach which obtain a compromise Pareto-optimal solution for this problem. To do this, first, we present a theorem which shows that MLFTP is always solvable. And then, reducing MLFTP to the Zimmermann’s “min” operator model which is the max-min problem, we construct Generalized Dinkelbach’s Algorithm for solving the obtained problem. Furthermore, we provide an illustrative numerical example to explain this fuzzy approach.

  17. Problems of systems dataware using optoelectronic measuring means of linear displacement

    Bazykin, S. N.; Bazykina, N. A.; Samohina, K. S.

    2017-10-01

    Problems of the dataware of the systems with the use of optoelectronic means of the linear displacement are considered in the article. The classification of the known physical effects, realized by the means of information-measuring systems, is given. The organized analysis of information flows in technical systems from the standpoint of determination of inaccuracies of measurement and management was conducted. In spite of achieved successes in automation of machine-building and instruments-building equipment in the field of dataware of the technical systems, there are unresolved problems, concerning the qualitative aspect of the production process. It was shown that the given problem can be solved using optoelectronic lazer information-measuring systems. Such information-measuring systems are capable of not only executing the measuring functions, but also solving the problems of management and control during processing, thereby guaranteeing the quality of final products.

  18. A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

    Jian Jinbao; Li Jianling; Mo Xingde

    2006-01-01

    This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported

  19. A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems

    Sivakumar K.C.

    2013-01-01

    Full Text Available For ARnxn and qRn, the linear complementarity problem LCP(A, q is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q. A is called an Ro-matrix if LCP(A,0 has zero as the only solution. In this article, the class of R0-matrices is extended to include typically singular matrices, by requiring in addition that the solution x above belongs to a subspace of Rn. This idea is then extended to semidefinite linear complementarity problems, where a characterization is presented for the multplicative transformation.

  20. Efficient Non-Linear Finite Element Implementation of Elasto-Plasticity for Geotechnical Problems

    Clausen, Johan

    -Coulomb yield criterion and the corresponding plastic potential possess corners and an apex, which causes numerical difficulties. A simple, elegant and efficient solution to these problems is presented in this thesis. The solution is based on a transformation into principal stress space and is valid for all...... linear isotropic plasticity models in which corners and apexes are encountered. The validity and merits of the proposed solution are examined in relation to the Mohr-Coulomb and the Modified Mohr-Coulomb material models. It is found that the proposed method compares well with existing methods......-Brown material. The efficiency and validity are demonstrated by comparing the finite-element results with well-known solutions for simple geometries. A common geotechnical problem is the assessment of slope stability. For slopes with simple geometries and consisting of a linear Mohr-Coulomb material, this can...

  1. A New Spectral Local Linearization Method for Nonlinear Boundary Layer Flow Problems

    S. S. Motsa

    2013-01-01

    Full Text Available We propose a simple and efficient method for solving highly nonlinear systems of boundary layer flow problems with exponentially decaying profiles. The algorithm of the proposed method is based on an innovative idea of linearizing and decoupling the governing systems of equations and reducing them into a sequence of subsystems of differential equations which are solved using spectral collocation methods. The applicability of the proposed method, hereinafter referred to as the spectral local linearization method (SLLM, is tested on some well-known boundary layer flow equations. The numerical results presented in this investigation indicate that the proposed method, despite being easy to develop and numerically implement, is very robust in that it converges rapidly to yield accurate results and is more efficient in solving very large systems of nonlinear boundary value problems of the similarity variable boundary layer type. The accuracy and numerical stability of the SLLM can further be improved by using successive overrelaxation techniques.

  2. Mixed integer linear programming model for dynamic supplier selection problem considering discounts

    Adi Wicaksono Purnawan

    2018-01-01

    Full Text Available Supplier selection is one of the most important elements in supply chain management. This function involves evaluation of many factors such as, material costs, transportation costs, quality, delays, supplier capacity, storage capacity and others. Each of these factors varies with time, therefore, supplier identified for one period is not necessarily be same for the next period to supply the same product. So, mixed integer linear programming (MILP was developed to overcome the dynamic supplier selection problem (DSSP. In this paper, a mixed integer linear programming model is built to solve the lot-sizing problem with multiple suppliers, multiple periods, multiple products and quantity discounts. The buyer has to make a decision for some products which will be supplied by some suppliers for some periods cosidering by discount. To validate the MILP model with randomly generated data. The model is solved by Lingo 16.

  3. A Class of Optimal Portfolio Liquidation Problems with a Linear Decreasing Impact

    Jiangming Ma

    2017-01-01

    Full Text Available A problem of an optimal liquidation is investigated by using the Almgren-Chriss market impact model on the background that the n agents liquidate assets completely. The impact of market is divided into three components: unaffected price process, permanent impact, and temporary impact. The key element is that the variable temporary market impact is analyzed. When the temporary market impact is decreasing linearly, the optimal problem is described by a Nash equilibrium in finite time horizon. The stochastic component of the price process is eliminated from the mean-variance. Mathematically, the Nash equilibrium is considered as the second-order linear differential equation with variable coefficients. We prove the existence and uniqueness of solutions for the differential equation with two boundaries and find the closed-form solutions in special situations. The numerical examples and properties of the solution are given. The corresponding finance phenomenon is interpreted.

  4. On an Optimal -Control Problem in Coefficients for Linear Elliptic Variational Inequality

    Olha P. Kupenko

    2013-01-01

    Full Text Available We consider optimal control problems for linear degenerate elliptic variational inequalities with homogeneous Dirichlet boundary conditions. We take the matrix-valued coefficients in the main part of the elliptic operator as controls in . Since the eigenvalues of such matrices may vanish and be unbounded in , it leads to the “noncoercivity trouble.” Using the concept of convergence in variable spaces and following the direct method in the calculus of variations, we establish the solvability of the optimal control problem in the class of the so-called -admissible solutions.

  5. An investigation on the solutions for the linear inverse problem in gamma ray tomography

    Araujo, Bruna G.M.; Dantas, Carlos C.; Santos, Valdemir A. dos; Finkler, Christine L.L.; Oliveira, Eric F. de; Melo, Silvio B.; Santos, M. Graca dos

    2009-01-01

    This paper the results obtained in single beam gamma ray tomography are investigated according to direct problem formulation and the applied solution for the linear system of equations. By image reconstruction based algebraic computational algorithms are used. The sparse under and over-determined linear system of equations was analyzed. Build in functions of Matlab software were applied and optimal solutions were investigate. Experimentally a section of the tube is scanned from various positions and at different angles. The solution, to find the vector of coefficients μ, from the vector of measured p values through the W matrix inversion, constitutes an inverse problem. A industrial tomography process requires a numerical solution of the system of equations. The definition of inverse problem according to Hadmard's is considered and as well the requirement of a well posed problem to find stable solutions. The formulation of the basis function and the computational algorithm to structure the weight matrix W were analyzed. For W full rank matrix the obtained solution is unique as expected. Total Least Squares was implemented which theory and computation algorithm gives adequate treatment for the problems due to non-unique solutions of the system of equations. Stability of the solution was investigating by means of a regularization technique and the comparison shows that it improves the results. An optimal solution as a function of the image quality, computation time and minimum residuals were quantified. The corresponding reconstructed images are shown in 3D graphics in order to compare with the solution. (author)

  6. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

    Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

    1996-12-31

    The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

  7. Adaptive Finite Element Method for Optimal Control Problem Governed by Linear Quasiparabolic Integrodifferential Equations

    Wanfang Shen

    2012-01-01

    Full Text Available The mathematical formulation for a quadratic optimal control problem governed by a linear quasiparabolic integrodifferential equation is studied. The control constrains are given in an integral sense: Uad={u∈X;∫ΩUu⩾0, t∈[0,T]}. Then the a posteriori error estimates in L∞(0,T;H1(Ω-norm and L2(0,T;L2(Ω-norm for both the state and the control approximation are given.

  8. Multi-point boundary value problems for linear functional-differential equations

    Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich

    2017-01-01

    Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional- differential equations * functional- differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076.xml

  9. Multi-point boundary value problems for linear functional-differential equations

    Domoshnitsky, A.; Hakl, Robert; Půža, Bedřich

    2017-01-01

    Roč. 24, č. 2 (2017), s. 193-206 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : boundary value problems * linear functional-differential equations * functional-differential inequalities Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.290, year: 2016 https://www.degruyter.com/view/j/gmj.2017.24.issue-2/gmj-2016-0076/gmj-2016-0076. xml

  10. Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

    Ito, Kazufumi; Teglas, Russell

    1987-01-01

    The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

  11. On the Cauchy problem for a Sobolev-type equation with quadratic non-linearity

    Aristov, Anatoly I

    2011-01-01

    We investigate the asymptotic behaviour as t→∞ of the solution of the Cauchy problem for a Sobolev-type equation with quadratic non-linearity and develop ideas used by I. A. Shishmarev and other authors in the study of classical and Sobolev-type equations. Conditions are found under which it is possible to consider the case of an arbitrary dimension of the spatial variable.

  12. Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

    Ito, K.; Teglas, R.

    1984-01-01

    The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

  13. FUNDAMENTAL MATRIX OF LINEAR CONTINUOUS SYSTEM IN THE PROBLEM OF ESTIMATING ITS TRANSPORT DELAY

    N. A. Dudarenko

    2014-09-01

    Full Text Available The paper deals with the problem of quantitative estimation for transport delay of linear continuous systems. The main result is received by means of fundamental matrix of linear differential equations solutions specified in the normal Cauchy form for the cases of SISO and MIMO systems. Fundamental matrix has the dual property. It means that the weight function of the system can be formed as a free motion of systems. Last one is generated by the vector of initial system conditions, which coincides with the matrix input of the system being researched. Thus, using the properties of the system- solving for fundamental matrix has given the possibility to solve the problem of estimating transport linear continuous system delay without the use of derivation procedure in hardware environment and without formation of exogenous Dirac delta function. The paper is illustrated by examples. The obtained results make it possible to solve the problem of modeling the pure delay links using consecutive chain of aperiodic links of the first order with the equal time constants. Modeling results have proved the correctness of obtained computations. Knowledge of transport delay can be used when configuring multi- component technological complexes and in the diagnosis of their possible functional degeneration.

  14. Stability of multi-objective bi-level linear programming problems under fuzziness

    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.

  15. A parallel algorithm for solving linear equations arising from one-dimensional network problems

    Mesina, G.L.

    1991-01-01

    One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs

  16. Scilab software as an alternative low-cost computing in solving the linear equations problem

    Agus, Fahrul; Haviluddin

    2017-02-01

    Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.

  17. A linear programming approach to max-sum problem: a review.

    Werner, Tomás

    2007-07-01

    The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.

  18. Implementation of a multi-layer perception for a non-linear control problem

    Lister, J.B.; Schnurrenberger, H.; Marmillod, P.

    1990-12-01

    We present the practical application of a 1-hidden-layer multilayer perception (MLP) to provide a non-linear continuous multi-variable mapping with 42 inputs and 13 outputs. The problem resolved is one of extracting information from experimental signals with a bandwidth of many kilohertz. We have an exact model of the inverse mapping of this problem, but we have no explicit form of the required forward mapping. This is the typical situation in data interpretation. The MLP was trained to provide this mapping by learning on 500 input-output examples. The success of the off-line solution to this problem using an MLP led us to examine the robustness of the MLP to different noise sources. We found that the MLP is more robust than an approximate linear mapping of the same problem. 12 bits of resolution in the weights are necessary to avoid a significant loss of precision. The practical implementation of large analog weight matrices using DAS-multipliers and a simple segmented sigmoid is also presented. A General Adaptive Recipe (GAR) for improving the performance of conventional back-propagation was developed. The GAR uses an adaptive step length and both the bias terms and the initial weight seeding are determined by the network size. The GAR was found to be robust and much faster than conventional back-propagation. (author) 20 figs., 1 tab., 15 refs

  19. Arbitrary Lagrangian-Eulerian method for non-linear problems of geomechanics

    Nazem, M; Carter, J P; Airey, D W

    2010-01-01

    In many geotechnical problems it is vital to consider the geometrical non-linearity caused by large deformation in order to capture a more realistic model of the true behaviour. The solutions so obtained should then be more accurate and reliable, which should ultimately lead to cheaper and safer design. The Arbitrary Lagrangian-Eulerian (ALE) method originated from fluid mechanics, but has now been well established for solving large deformation problems in geomechanics. This paper provides an overview of the ALE method and its challenges in tackling problems involving non-linearities due to material behaviour, large deformation, changing boundary conditions and time-dependency, including material rate effects and inertia effects in dynamic loading applications. Important aspects of ALE implementation into a finite element framework will also be discussed. This method is then employed to solve some interesting and challenging geotechnical problems such as the dynamic bearing capacity of footings on soft soils, consolidation of a soil layer under a footing, and the modelling of dynamic penetration of objects into soil layers.

  20. Assessment of Two Analytical Methods in Solving the Linear and Nonlinear Elastic Beam Deformation Problems

    Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari

    2010-01-01

    and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However......, as with other analytical techniques, certain limitations restrict the wide application of perturbation methods, most important of which is the dependence of these methods on the existence of a small parameter in the equation. Disappointingly, the majority of nonlinear problems have no small parameter at all......Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...

  1. 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.

  2. Comments on the comparison of global methods for linear two-point boundary value problems

    de Boor, C.; Swartz, B.

    1977-01-01

    A more careful count of the operations involved in solving the linear system associated with collocation of a two-point boundary value problem using a rough splines reverses results recently reported by others in this journal. In addition, it is observed that the use of the technique of ''condensation of parameters'' can decrease the computer storage required. Furthermore, the use of a particular highly localized basis can also reduce the setup time when the mesh is irregular. Finally, operation counts are roughly estimated for the solution of certain linear system associated with two competing collocation methods; namely, collocation with smooth splines and collocation of the equivalent first order system with continuous piecewise polynomials

  3. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

    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.

  4. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

    Li, Yanning; Canepa, Edward S.; Claudel, Christian G.

    2013-01-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.

  5. 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.

  6. A novel approach based on preference-based index for interval bilevel linear programming problem

    Aihong Ren

    2017-05-01

    Full Text Available Abstract 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 ⪯ m w $\\preceq_{mw}$ . 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.

  7. Boundary value problems of the circular cylinders in the strain-gradient theory of linear elasticity

    Kao, B.G.

    1979-11-01

    Three boundary value problems in the strain-gradient theory of linear elasticity are solved for circular cylinders. They are the twisting of circular cylinder, uniformly pressuring of concentric circular cylinder, and pure-bending of simply connected cylinder. The comparisons of these solutions with the solutions in classical elasticity and in couple-stress theory reveal the differences in the stress fields as well as the apparent stress fields due to the influences of the strain-gradient. These aspects of the strain-gradient theory could be important in modeling the failure behavior of structural materials

  8. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... 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...

  9. Variance analysis of the Monte-Carlo perturbation source method in inhomogeneous linear particle transport problems

    Noack, K.

    1982-01-01

    The perturbation source method may be a powerful Monte-Carlo means to calculate small effects in a particle field. In a preceding paper we have formulated this methos in inhomogeneous linear particle transport problems describing the particle fields by solutions of Fredholm integral equations and have derived formulae for the second moment of the difference event point estimator. In the present paper we analyse the general structure of its variance, point out the variance peculiarities, discuss the dependence on certain transport games and on generation procedures of the auxiliary particles and draw conclusions to improve this method

  10. Solving the linear radiation problem using a volume method on an overset grid

    Read, Robert; Bingham, Harry B.

    2012-01-01

    of numerical results with established analytical solutions. The linear radiation problem is considered in this paper. A two-dimensional computational tool has been developed to calculate the force applied to a floating body of arbitrary form in response to a prescribed displacement. Fourier transforms......This paper describes recent progress towards the development of a computational tool, based on potential ow theory, that can accurately and effciently simulate wave-induced loadings on marine structures. Engsig-Karup et al. (2009) have successfully developed an arbitrary-order, finite...

  11. Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems

    Oskar Cahueñas

    2013-05-01

    Full Text Available We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new preconditioning strategies are embedded into simple and well-known iterative schemes that avoid the use of the, usually ill-conditioned, normal equations. We analyze a scheme to approximate the pseudoinverse, based on Schulz iterative method, and also different iterative schemes, based on extensions of Richardson's method, and the conjugate gradient method, that are suitable for preconditioning strategies. We present preliminary numerical results to illustrate the advantages of the proposed schemes.

  12. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

    Aihong Ren

    2016-01-01

    This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...

  13. A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

    Huang Zhenghai; Gu Weizhe

    2008-01-01

    In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms

  14. Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems

    Suliman, Mohamed Abdalla Elhag; Ballal, Tarig; Al-Naffouri, Tareq Y.

    2016-01-01

    Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.

  15. Perturbation-Based Regularization for Signal Estimation in Linear Discrete Ill-posed Problems

    Suliman, Mohamed Abdalla Elhag

    2016-11-29

    Estimating the values of unknown parameters from corrupted measured data faces a lot of challenges in ill-posed problems. In such problems, many fundamental estimation methods fail to provide a meaningful stabilized solution. In this work, we propose a new regularization approach and a new regularization parameter selection approach for linear least-squares discrete ill-posed problems. The proposed approach is based on enhancing the singular-value structure of the ill-posed model matrix to acquire a better solution. Unlike many other regularization algorithms that seek to minimize the estimated data error, the proposed approach is developed to minimize the mean-squared error of the estimator which is the objective in many typical estimation scenarios. The performance of the proposed approach is demonstrated by applying it to a large set of real-world discrete ill-posed problems. Simulation results demonstrate that the proposed approach outperforms a set of benchmark regularization methods in most cases. In addition, the approach also enjoys the lowest runtime and offers the highest level of robustness amongst all the tested benchmark regularization methods.

  16. A Hierarchical Bayesian Setting for an Inverse Problem in Linear Parabolic PDEs with Noisy Boundary Conditions

    Ruggeri, Fabrizio

    2016-05-12

    In this work we develop a Bayesian setting to infer unknown parameters in initial-boundary value problems related to linear parabolic partial differential equations. We realistically assume that the boundary data are noisy, for a given prescribed initial condition. We show how to derive the joint likelihood function for the forward problem, given some measurements of the solution field subject to Gaussian noise. Given Gaussian priors for the time-dependent Dirichlet boundary values, we analytically marginalize the joint likelihood using the linearity of the equation. Our hierarchical Bayesian approach is fully implemented in an example that involves the heat equation. In this example, the thermal diffusivity is the unknown parameter. We assume that the thermal diffusivity parameter can be modeled a priori through a lognormal random variable or by means of a space-dependent stationary lognormal random field. Synthetic data are used to test the inference. We exploit the behavior of the non-normalized log posterior distribution of the thermal diffusivity. Then, we use the Laplace method to obtain an approximated Gaussian posterior and therefore avoid costly Markov Chain Monte Carlo computations. Expected information gains and predictive posterior densities for observable quantities are numerically estimated using Laplace approximation for different experimental setups.

  17. Existence and uniqueness to the Cauchy problem for linear and semilinear parabolic equations with local conditions⋆

    Rubio Gerardo

    2011-03-01

    Full Text Available We consider the Cauchy problem in ℝd for a class of semilinear parabolic partial differential equations that arises in some stochastic control problems. We assume that the coefficients are unbounded and locally Lipschitz, not necessarily differentiable, with continuous data and local uniform ellipticity. We construct a classical solution by approximation with linear parabolic equations. The linear equations involved can not be solved with the traditional results. Therefore, we construct a classical solution to the linear Cauchy problem under the same hypotheses on the coefficients for the semilinear equation. Our approach is using stochastic differential equations and parabolic differential equations in bounded domains. Finally, we apply the results to a stochastic optimal consumption problem. Nous considérons le problème de Cauchy dans ℝd pour une classe d’équations aux dérivées partielles paraboliques semi linéaires qui se pose dans certains problèmes de contrôle stochastique. Nous supposons que les coefficients ne sont pas bornés et sont localement Lipschitziennes, pas nécessairement différentiables, avec des données continues et ellipticité local uniforme. Nous construisons une solution classique par approximation avec les équations paraboliques linéaires. Les équations linéaires impliquées ne peuvent être résolues avec les résultats traditionnels. Par conséquent, nous construisons une solution classique au problème de Cauchy linéaire sous les mêmes hypothèses sur les coefficients pour l’équation semi-linéaire. Notre approche utilise les équations différentielles stochastiques et les équations différentielles paraboliques dans les domaines bornés. Enfin, nous appliquons les résultats à un problème stochastique de consommation optimale.

  18. Inverse eigenvalue problems for Sturm-Liouville equations with spectral parameter linearly contained in one of the boundary conditions

    Guliyev, Namig J.

    2008-01-01

    International audience; Inverse problems of recovering the coefficients of Sturm–Liouville problems with the eigenvalue parameter linearly contained in one of the boundary conditions are studied: 1) from the sequences of eigenvalues and norming constants; 2) from two spectra. Necessary and sufficient conditions for the solvability of these inverse problems are obtained.

  19. Parallel supercomputing: Advanced methods, algorithms, and software for large-scale linear and nonlinear problems

    Carey, G.F.; Young, D.M.

    1993-12-31

    The program outlined here is directed to research on methods, algorithms, and software for distributed parallel supercomputers. Of particular interest are finite element methods and finite difference methods together with sparse iterative solution schemes for scientific and engineering computations of very large-scale systems. Both linear and nonlinear problems will be investigated. In the nonlinear case, applications with bifurcation to multiple solutions will be considered using continuation strategies. The parallelizable numerical methods of particular interest are a family of partitioning schemes embracing domain decomposition, element-by-element strategies, and multi-level techniques. The methods will be further developed incorporating parallel iterative solution algorithms with associated preconditioners in parallel computer software. The schemes will be implemented on distributed memory parallel architectures such as the CRAY MPP, Intel Paragon, the NCUBE3, and the Connection Machine. We will also consider other new architectures such as the Kendall-Square (KSQ) and proposed machines such as the TERA. The applications will focus on large-scale three-dimensional nonlinear flow and reservoir problems with strong convective transport contributions. These are legitimate grand challenge class computational fluid dynamics (CFD) problems of significant practical interest to DOE. The methods developed and algorithms will, however, be of wider interest.

  20. An improved exploratory search technique for pure integer linear programming problems

    Fogle, F. R.

    1990-01-01

    The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

  1. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.

  2. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.

  3. Reorganizing Neural Network System for Two Spirals and Linear Low-Density Polyethylene Copolymer Problems

    G. M. Behery

    2009-01-01

    Full Text Available This paper presents an automatic system of neural networks (NNs that has the ability to simulate and predict many of applied problems. The system architectures are automatically reorganized and the experimental process starts again, if the required performance is not reached. This processing is continued until the performance obtained. This system is first applied and tested on the two spiral problem; it shows that excellent generalization performance obtained by classifying all points of the two-spirals correctly. After that, it is applied and tested on the shear stress and the pressure drop problem across the short orifice die as a function of shear rate at different mean pressures for linear low-density polyethylene copolymer (LLDPE at 190∘C. The system shows a better agreement with an experimental data of the two cases: shear stress and pressure drop. The proposed system has been also designed to simulate other distributions not presented in the training set (predicted and matched them effectively.

  4. The initial value problem for linearized gravitational perturbations of the Schwarzschild naked singularity

    Dotti, Gustavo; Gleiser, Reinaldo J [Facultad de Matematica, AstronomIa y Fisica (FaMAF), Universidad Nacional de Cordoba, Ciudad Universitaria, 5000 Cordoba (Argentina)

    2009-11-07

    The coupled equations for the scalar modes of the linearized Einstein equations around Schwarzschild's spacetime were reduced by Zerilli to a (1+1) wave equation partial deriv{sup 2}PSI{sub z} /partial derivt{sup 2} +HPSI{sub z} =0, where H= -partial deriv{sup 2} /partial derivx{sup 2} + V(x) is the Zerilli 'Hamiltonian' and x is the tortoise radial coordinate. From its definition, for smooth metric perturbations the field PSI{sub z} is singular at r{sub s} = -6M/(l - 1)(l +2), with l being the mode harmonic number. The equation PSI{sub z} obeys is also singular, since V has a second-order pole at r{sub s}. This is irrelevant to the black hole exterior stability problem, where r > 2M > 0, and r{sub s} < 0, but it introduces a non-trivial problem in the naked singular case where M < 0, then r{sub s} > 0, and the singularity appears in the relevant range of r (0 < r < infinity). We solve this problem by developing a new approach to the evolution of the even mode, based on a new gauge invariant function, PSI-circumflex, that is a regular function of the metric perturbation for any value of M. The relation of PSI-circumflex to PSI{sub z} is provided by an intertwiner operator. The spatial pieces of the (1 + 1) wave equations that PSI-circumflex and PSI{sub z} obey are related as a supersymmetric pair of quantum Hamiltonians H and H-circumflex. For M < 0,H-circumflex has a regular potential and a unique self-adjoint extension in a domain D defined by a physically motivated boundary condition at r = 0. This allows us to address the issue of evolution of gravitational perturbations in this non-globally hyperbolic background. This formulation is used to complete the proof of the linear instability of the Schwarzschild naked singularity, by showing that a previously found unstable mode belongs to a complete basis of H-circumflex in D, and thus is excitable by generic initial data. This is further illustrated by numerically solving the linearized equations for

  5. A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

    Banks, H. T.; Ito, K.

    1991-01-01

    A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

  6. Optimal Stochastic Control Problem for General Linear Dynamical Systems in Neuroscience

    Yan Chen

    2017-01-01

    Full Text Available This paper considers a d-dimensional stochastic optimization problem in neuroscience. Suppose the arm’s movement trajectory is modeled by high-order linear stochastic differential dynamic system in d-dimensional space, the optimal trajectory, velocity, and variance are explicitly obtained by using stochastic control method, which allows us to analytically establish exact relationships between various quantities. Moreover, the optimal trajectory is almost a straight line for a reaching movement; the optimal velocity bell-shaped and the optimal variance are consistent with the experimental Fitts law; that is, the longer the time of a reaching movement, the higher the accuracy of arriving at the target position, and the results can be directly applied to designing a reaching movement performed by a robotic arm in a more general environment.

  7. On the global "two-sided" characteristic Cauchy problem for linear wave equations on manifolds

    Lupo, Umberto

    2018-04-01

    The global characteristic Cauchy problem for linear wave equations on globally hyperbolic Lorentzian manifolds is examined, for a class of smooth initial value hypersurfaces satisfying favourable global properties. First it is shown that, if geometrically well-motivated restrictions are placed on the supports of the (smooth) initial datum and of the (smooth) inhomogeneous term, then there exists a continuous global solution which is smooth "on each side" of the initial value hypersurface. A uniqueness result in Sobolev regularity H^{1/2+ɛ }_{loc} is proved among solutions supported in the union of the causal past and future of the initial value hypersurface, and whose product with the indicator function of the causal future (resp. past) of the hypersurface is past compact (resp. future compact). An explicit representation formula for solutions is obtained, which prominently features an invariantly defined, densitised version of the null expansion of the hypersurface. Finally, applications to quantum field theory on curved spacetimes are briefly discussed.

  8. Constraints to solve parallelogram grid problems in 2D non separable linear canonical transform

    Zhao, Liang; Healy, John J.; Muniraj, Inbarasan; Cui, Xiao-Guang; Malallah, Ra'ed; Ryle, James P.; Sheridan, John T.

    2017-05-01

    The 2D non-separable linear canonical transform (2D-NS-LCT) can model a range of various paraxial optical systems. Digital algorithms to evaluate the 2D-NS-LCTs are important in modeling the light field propagations and also of interest in many digital signal processing applications. In [Zhao 14] we have reported that a given 2D input image with rectangular shape/boundary, in general, results in a parallelogram output sampling grid (generally in an affine coordinates rather than in a Cartesian coordinates) thus limiting the further calculations, e.g. inverse transform. One possible solution is to use the interpolation techniques; however, it reduces the speed and accuracy of the numerical approximations. To alleviate this problem, in this paper, some constraints are derived under which the output samples are located in the Cartesian coordinates. Therefore, no interpolation operation is required and thus the calculation error can be significantly eliminated.

  9. The method of varying amplitudes for solving (non)linear problems involving strong parametric excitation

    Sorokin, Vladislav; Thomsen, Jon Juel

    2015-01-01

    Parametrically excited systems appear in many fields of science and technology, intrinsically or imposed purposefully; e.g. spatially periodic structures represent an important class of such systems [4]. When the parametric excitation can be considered weak, classical asymptotic methods like...... the method of averaging [2] or multiple scales [6] can be applied. However, with many practically important applications this simplification is inadequate, e.g. with spatially periodic structures it restricts the possibility to affect their effective dynamic properties by a structural parameter modulation...... of considerable magnitude. Approximate methods based on Floquet theory [4] for analyzing problems involving parametric excitation, e.g. the classical Hill’s method of infinite determinants [3,4], can be employed also in cases of strong excitation; however, with Floquet theory being applicable only for linear...

  10. First-order system least squares for the pure traction problem in planar linear elasticity

    Cai, Z.; Manteuffel, T.; McCormick, S.; Parter, S.

    1996-12-31

    This talk will develop two first-order system least squares (FOSLS) approaches for the solution of the pure traction problem in planar linear elasticity. Both are two-stage algorithms that first solve for the gradients of displacement, then for the displacement itself. One approach, which uses L{sup 2} norms to define the FOSLS functional, is shown under certain H{sup 2} regularity assumptions to admit optimal H{sup 1}-like performance for standard finite element discretization and standard multigrid solution methods that is uniform in the Poisson ratio for all variables. The second approach, which is based on H{sup -1} norms, is shown under general assumptions to admit optimal uniform performance for displacement flux in an L{sup 2} norm and for displacement in an H{sup 1} norm. These methods do not degrade as other methods generally do when the material properties approach the incompressible limit.

  11. A linear programming model for protein inference problem in shotgun proteomics.

    Huang, Ting; He, Zengyou

    2012-11-15

    Assembling peptides identified from tandem mass spectra into a list of proteins, referred to as protein inference, is an important issue in shotgun proteomics. The objective of protein inference is to find a subset of proteins that are truly present in the sample. Although many methods have been proposed for protein inference, several issues such as peptide degeneracy still remain unsolved. In this article, we present a linear programming model for protein inference. In this model, we use a transformation of the joint probability that each peptide/protein pair is present in the sample as the variable. Then, both the peptide probability and protein probability can be expressed as a formula in terms of the linear combination of these variables. Based on this simple fact, the protein inference problem is formulated as an optimization problem: minimize the number of proteins with non-zero probabilities under the constraint that the difference between the calculated peptide probability and the peptide probability generated from peptide identification algorithms should be less than some threshold. This model addresses the peptide degeneracy issue by forcing some joint probability variables involving degenerate peptides to be zero in a rigorous manner. The corresponding inference algorithm is named as ProteinLP. We test the performance of ProteinLP on six datasets. Experimental results show that our method is competitive with the state-of-the-art protein inference algorithms. The source code of our algorithm is available at: https://sourceforge.net/projects/prolp/. zyhe@dlut.edu.cn. Supplementary data are available at Bioinformatics Online.

  12. Interpolation problem for the solutions of linear elasticity equations based on monogenic functions

    Grigor'ev, Yuri; Gürlebeck, Klaus; Legatiuk, Dmitrii

    2017-11-01

    Interpolation is an important tool for many practical applications, and very often it is beneficial to interpolate not only with a simple basis system, but rather with solutions of a certain differential equation, e.g. elasticity equation. A typical example for such type of interpolation are collocation methods widely used in practice. It is known, that interpolation theory is fully developed in the framework of the classical complex analysis. However, in quaternionic analysis, which shows a lot of analogies to complex analysis, the situation is more complicated due to the non-commutative multiplication. Thus, a fundamental theorem of algebra is not available, and standard tools from linear algebra cannot be applied in the usual way. To overcome these problems, a special system of monogenic polynomials the so-called Pseudo Complex Polynomials, sharing some properties of complex powers, is used. In this paper, we present an approach to deal with the interpolation problem, where solutions of elasticity equations in three dimensions are used as an interpolation basis.

  13. Response of Non-Linear Shock Absorbers-Boundary Value Problem Analysis

    Rahman, M. A.; Ahmed, U.; Uddin, M. S.

    2013-08-01

    A nonlinear boundary value problem of two degrees-of-freedom (DOF) untuned vibration damper systems using nonlinear springs and dampers has been numerically studied. As far as untuned damper is concerned, sixteen different combinations of linear and nonlinear springs and dampers have been comprehensively analyzed taking into account transient terms. For different cases, a comparative study is made for response versus time for different spring and damper types at three important frequency ratios: one at r = 1, one at r > 1 and one at r <1. The response of the system is changed because of the spring and damper nonlinearities; the change is different for different cases. Accordingly, an initially stable absorber may become unstable with time and vice versa. The analysis also shows that higher nonlinearity terms make the system more unstable. Numerical simulation includes transient vibrations. Although problems are much more complicated compared to those for a tuned absorber, a comparison of the results generated by the present numerical scheme with the exact one shows quite a reasonable agreement

  14. Stabilizing inverse problems by internal data. II: non-local internal data and generic linearized uniqueness

    Kuchment, Peter

    2015-05-10

    © 2015, Springer Basel. In the previous paper (Kuchment and Steinhauer in Inverse Probl 28(8):084007, 2012), the authors introduced a simple procedure that allows one to detect whether and explain why internal information arising in several novel coupled physics (hybrid) imaging modalities could turn extremely unstable techniques, such as optical tomography or electrical impedance tomography, into stable, good-resolution procedures. It was shown that in all cases of interest, the Fréchet derivative of the forward mapping is a pseudo-differential operator with an explicitly computable principal symbol. If one can set up the imaging procedure in such a way that the symbol is elliptic, this would indicate that the problem was stabilized. In the cases when the symbol is not elliptic, the technique suggests how to change the procedure (e.g., by adding extra measurements) to achieve ellipticity. In this article, we consider the situation arising in acousto-optical tomography (also called ultrasound modulated optical tomography), where the internal data available involves the Green’s function, and thus depends globally on the unknown parameter(s) of the equation and its solution. It is shown that the technique of (Kuchment and Steinhauer in Inverse Probl 28(8):084007, 2012) can be successfully adopted to this situation as well. A significant part of the article is devoted to results on generic uniqueness for the linearized problem in a variety of situations, including those arising in acousto-electric and quantitative photoacoustic tomography.

  15. Portfolio selection problem: a comparison of fuzzy goal programming and linear physical programming

    Fusun Kucukbay

    2016-04-01

    Full Text Available Investors have limited budget and they try to maximize their return with minimum risk. Therefore this study aims to deal with the portfolio selection problem. In the study two criteria are considered which are expected return, and risk. In this respect, linear physical programming (LPP technique is applied on Bist 100 stocks to be able to find out the optimum portfolio. The analysis covers the period April 2009- March 2015. This period is divided into two; April 2009-March 2014 and April 2014 – March 2015. April 2009-March 2014 period is used as data to find an optimal solution. April 2014-March 2015 period is used to test the real performance of portfolios. The performance of the obtained portfolio is compared with that obtained from fuzzy goal programming (FGP. Then the performances of both method, LPP and FGP are compared with BIST 100 in terms of their Sharpe Indexes. The findings reveal that LPP for portfolio selection problem is a good alternative to FGP.

  16. Greedy algorithms for high-dimensional non-symmetric linear problems***

    Cancès E.

    2013-12-01

    Full Text Available In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor product functions, each term of which is iteratively computed via a greedy algorithm ? . There exists a good theoretical framework for these methods in the case of (linear and nonlinear symmetric elliptic problems. However, the convergence results are not valid any more as soon as the problems under consideration are not symmetric. We present here a review of the main algorithms proposed in the literature to circumvent this difficulty, together with some new approaches. The theoretical convergence results and the practical implementation of these algorithms are discussed. Their behaviors are illustrated through some numerical examples. Dans cet article, nous présentons une famille de méthodes numériques pour résoudre des problèmes linéaires non symétriques en grande dimension. Le principe de ces approches est de représenter une fonction dépendant d’un grand nombre de variables sous la forme d’une somme de fonctions produit tensoriel, dont chaque terme est calculé itérativement via un algorithme glouton ? . Ces méthodes possèdent de bonnes propriétés théoriques dans le cas de problèmes elliptiques symétriques (linéaires ou non linéaires, mais celles-ci ne sont plus valables dès lors que les problèmes considérés ne sont plus symétriques. Nous présentons une revue des principaux algorithmes proposés dans la littérature pour contourner cette difficulté ainsi que de nouvelles approches que nous proposons. Les résultats de convergence théoriques et la mise en oeuvre pratique de ces algorithmes sont détaillés et leur comportement est illustré au travers d’exemples numériques.

  17. A study of the use of linear programming techniques to improve the performance in design optimization problems

    Young, Katherine C.; Sobieszczanski-Sobieski, Jaroslaw

    1988-01-01

    This project has two objectives. The first is to determine whether linear programming techniques can improve performance when handling design optimization problems with a large number of design variables and constraints relative to the feasible directions algorithm. The second purpose is to determine whether using the Kreisselmeier-Steinhauser (KS) function to replace the constraints with one constraint will reduce the cost of total optimization. Comparisons are made using solutions obtained with linear and non-linear methods. The results indicate that there is no cost saving using the linear method or in using the KS function to replace constraints.

  18. Does the Incredible Years Teacher Classroom Management Training programme have positive effects for young children exhibiting severe externalizing problems in school?: a quasi-experimental pre-post study.

    Kirkhaug, Bente; Drugli, May Britt; Handegård, Bjørn Helge; Lydersen, Stian; Åsheim, Merethe; Fossum, Sturla

    2016-10-26

    Young children exhibiting severe externalizing problems in school are at risk of developing several poor outcomes. School-based intervention programs have been found to be effective for students with different problems, including those with behavioral problems, emotional distress, or social problems. The present study investigated whether the IY-TCM programme, as a universal stand-alone school intervention programme, reduced severe child externalizing problems as reported by the teacher, and evaluated if these children improved their social competence, internalizing problems, academic performances and student- teacher relationship as a result of the IY TCM training. A quasi-experimental pre-post study was conducted, including 21 intervention schools and 22 control schools. Children in 1 st - 3 rd grade (age 6-8 years) assessed by their teacher as having severe externalizing problems on the Sutter-Eyberg Student Behavior Inventory-Revised (SESBI-R) total Intensity score, were included in the study, N = 83 (65 boys and 18 girls). Treatment effects were evaluated using 3- level linear mixed models analysis. In our study we found no differences in change between the two conditions from baseline to follow-up in externalizing problems, social skills, internalizing problems and closeness with teacher. The intervention condition did however show advantageous development in terms of student-teacher conflicts and increased academic performances. The IY Teacher Classroom Management program is not sufficient being a stand-alone universal program in a Norwegian primary school setting, for students with severe externalizing problems. However; some important secondary findings were found. Still, young school children with severe externalizing problems are in need of more comprehensive and tailored interventions.

  19. Does the Incredible Years Teacher Classroom Management Training programme have positive effects for young children exhibiting severe externalizing problems in school?: a quasi-experimental pre-post study

    Bente Kirkhaug

    2016-10-01

    Full Text Available Abstract Background Young children exhibiting severe externalizing problems in school are at risk of developing several poor outcomes. School-based intervention programs have been found to be effective for students with different problems, including those with behavioral problems, emotional distress, or social problems. The present study investigated whether the IY-TCM programme, as a universal stand-alone school intervention programme, reduced severe child externalizing problems as reported by the teacher, and evaluated if these children improved their social competence, internalizing problems, academic performances and student- teacher relationship as a result of the IY TCM training. Methods A quasi-experimental pre-post study was conducted, including 21 intervention schools and 22 control schools. Children in 1st – 3rd grade (age 6–8 years assessed by their teacher as having severe externalizing problems on the Sutter–Eyberg Student Behavior Inventory-Revised (SESBI-R total Intensity score, were included in the study, N = 83 (65 boys and 18 girls. Treatment effects were evaluated using 3- level linear mixed models analysis. Results In our study we found no differences in change between the two conditions from baseline to follow-up in externalizing problems, social skills, internalizing problems and closeness with teacher. The intervention condition did however show advantageous development in terms of student-teacher conflicts and increased academic performances. Conclusion The IY Teacher Classroom Management program is not sufficient being a stand-alone universal program in a Norwegian primary school setting, for students with severe externalizing problems. However; some important secondary findings were found. Still, young school children with severe externalizing problems are in need of more comprehensive and tailored interventions.

  20. Technology Exhibition

    Anon.

    1979-09-15

    Linked to the 25th Anniversary celebrations, an exhibition of some of CERN's technological achievements was opened on 22 June. Set up in a new 600 m{sup 2} Exhibition Hall on the CERN site, the exhibition is divided into eight technology areas — magnets, vacuum, computers and data handling, survey and alignment, radiation protection, beam monitoring and handling, detectors, and workshop techniques.

  1. Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft

    Yuma Fukushima

    2015-01-01

    Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.

  2. Error Analysis Of Students Working About Word Problem Of Linear Program With NEA Procedure

    Santoso, D. A.; Farid, A.; Ulum, B.

    2017-06-01

    Evaluation and assessment is an important part of learning. In evaluation process of learning, written test is still commonly used. However, the tests usually do not following-up by further evaluation. The process only up to grading stage not to evaluate the process and errors which done by students. Whereas if the student has a pattern error and process error, actions taken can be more focused on the fault and why is that happen. NEA procedure provides a way for educators to evaluate student progress more comprehensively. In this study, students’ mistakes in working on some word problem about linear programming have been analyzed. As a result, mistakes are often made students exist in the modeling phase (transformation) and process skills (process skill) with the overall percentage distribution respectively 20% and 15%. According to the observations, these errors occur most commonly due to lack of precision of students in modeling and in hastiness calculation. Error analysis with students on this matter, it is expected educators can determine or use the right way to solve it in the next lesson.

  3. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

    Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin

    2017-12-06

    Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these

  4. Immersive Exhibitions

    Achiam, Marianne

    2015-01-01

    The immersive exhibition is a specialized exhibition genre in museums, which creates the illusion of time and place by representing key characteristics of a reference world and by integrating the visitor in this three-dimensionally reconstructed world (Mortensen 2010). A successful representation...... of the reference world depends on three criteria: whether the exhibition is staged as a coherent whole with all the displayed objects supporting the representation, whether the visitor is integrated as a component of the exhibition, and whether the content and message of the exhibition become dramatized...

  5. Asymptotics of linear initial boundary value problems with periodic boundary data on the half-line and finite intervals

    Dujardin, G. M.

    2009-08-12

    This paper deals with the asymptotic behaviour of the solutions of linear initial boundary value problems with constant coefficients on the half-line and on finite intervals. We assume that the boundary data are periodic in time and we investigate whether the solution becomes time-periodic after sufficiently long time. Using Fokas\\' transformation method, we show that, for the linear Schrödinger equation, the linear heat equation and the linearized KdV equation on the half-line, the solutions indeed become periodic for large time. However, for the same linear Schrödinger equation on a finite interval, we show that the solution, in general, is not asymptotically periodic; actually, the asymptotic behaviour of the solution depends on the commensurability of the time period T of the boundary data with the square of the length of the interval over. © 2009 The Royal Society.

  6. Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

    Nelson Maculan

    2003-01-01

    Full Text Available We present integer linear models with a polynomial number of variables and constraints for combinatorial optimization problems in graphs: optimum elementary cycles, optimum elementary paths and optimum tree problems.Apresentamos modelos lineares inteiros com um número polinomial de variáveis e restrições para problemas de otimização combinatória em grafos: ciclos elementares ótimos, caminhos elementares ótimos e problemas em árvores ótimas.

  7. Multiple Linear Regression for Reconstruction of Gene Regulatory Networks in Solving Cascade Error Problems

    Faridah Hani Mohamed Salleh

    2017-01-01

    Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.

  8. Multiple Linear Regression for Reconstruction of Gene Regulatory Networks in Solving Cascade Error Problems.

    Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M

    2017-01-01

    Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.

  9. A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

    Heinkenschloss, Matthias

    2005-01-01

    We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.

  10. A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

    Ebrahimnejad, Ali

    2015-08-01

    There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

  11. A two-dimensional linear elasticity problem for anisotropic materials, solved with a parallelization code

    Mihai-Victor PRICOP

    2010-09-01

    Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.

  12. Exhibit Engineering

    Mortensen, Marianne Foss

    Science museums define the objectives of their exhibitions in terms of visitor learning outcomes. Yet, exhibit designers lack theoretical and empirical research findings on which to base the creation of such educational environments. Here, this shortcoming is addressed through the development...... of tools and processes to guide the design of educational science exhibits. The guiding paradigm for this development is design-based research, which is characterised by an iterative cycle of design, enactment, and analysis. In the design phase, an educational intervention is planned and carried out based...... on the generation of theoretical ideas for exhibit design is offered in a fourth and parallel research undertaking, namely the application of the notion of cultural border-crossing to a hypothetical case of exhibit design....

  13. On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method

    Červinka, Michal

    2010-01-01

    Roč. 2010, č. 4 (2010), s. 730-753 ISSN 0023-5954 Institutional research plan: CEZ:AV0Z10750506 Keywords : equilibrium problems with complementarity constraints * homotopy * C-stationarity Subject RIV: BC - Control Systems Theory Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/cervinka-on computation of c-stationary points for equilibrium problems with linear complementarity constraints via homotopy method.pdf

  14. A Family of Symmetric Linear Multistep Methods for the Numerical Solution of the Schroedinger Equation and Related Problems

    Anastassi, Z. A.; Simos, T. E.

    2010-01-01

    We develop a new family of explicit symmetric linear multistep methods for the efficient numerical solution of the Schroedinger equation and related problems with oscillatory solution. The new methods are trigonometrically fitted and have improved intervals of periodicity as compared to the corresponding classical method with constant coefficients and other methods from the literature. We also apply the methods along with other known methods to real periodic problems, in order to measure their efficiency.

  15. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

    Aihong Ren

    2016-01-01

    Full Text Available This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.

  16. Unique solvability of a non-linear non-local boundary-value problem for systems of non-linear functional differential equations

    Dilna, N.; Rontó, András

    2010-01-01

    Roč. 60, č. 3 (2010), s. 327-338 ISSN 0139-9918 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : non-linear boundary value-problem * functional differential equation * non-local condition * unique solvability * differential inequality Subject RIV: BA - General Mathematics Impact factor: 0.316, year: 2010 http://link.springer.com/article/10.2478%2Fs12175-010-0015-9

  17. Solution of the linearly anisotropic neutron transport problem in a infinite cylinder combining the decomposition and HTSN methods

    Goncalves, Glenio A.; Bodmann, Bardo; Bogado, Sergio; Vilhena, Marco T.

    2008-01-01

    Analytical solutions for neutron transport in cylindrical geometry is available for isotropic problems, but to the best of our knowledge for anisotropic problems are not available, yet. In this work, an analytical solution for the neutron transport equation in an infinite cylinder assuming anisotropic scattering is reported. Here we specialize the solution, without loss of generality, for the linearly anisotropic problem using the combined decomposition and HTS N methods. The key feature of this method consists in the application of the decomposition method to the anisotropic problem by virtue of the fact that the inverse of the operator associated to isotropic problem is well know and determined by the HTS N approach. So far, following the idea of the decomposition method, we apply this operator to the integral term, assuming that the angular flux appearing in the integrand is considered to be equal to the HTS N solution interpolated by polynomial considering only even powers. This leads to the first approximation for an anisotropic solution. Proceeding further, we replace this solution for the angular flux in the integral and apply again the inverse operator for the isotropic problem in the integral term and obtain a new approximation for the angular flux. This iterative procedure yields a closed form solution for the angular flux. This methodology can be generalized, in a straightforward manner, for transport problems with any degree of anisotropy. For the sake of illustration, we report numerical simulations for linearly anisotropic transport problems. (author)

  18. Penalized linear regression for discrete ill-posed problems: A hybrid least-squares and mean-squared error approach

    Suliman, Mohamed Abdalla Elhag; Ballal, Tarig; Kammoun, Abla; Al-Naffouri, Tareq Y.

    2016-01-01

    This paper proposes a new approach to find the regularization parameter for linear least-squares discrete ill-posed problems. In the proposed approach, an artificial perturbation matrix with a bounded norm is forced into the discrete ill-posed model

  19. Solvability conditions for non-local boundary value problems for two-dimensional half-linear differential systems

    Kiguradze, I.; Šremr, Jiří

    2011-01-01

    Roč. 74, č. 17 (2011), s. 6537-6552 ISSN 0362-546X Institutional research plan: CEZ:AV0Z10190503 Keywords : half-linear differential system * non-local boundary value problem * solvability Subject RIV: BA - General Mathematics Impact factor: 1.536, year: 2011 http://www.sciencedirect.com/science/article/pii/S0362546X11004573

  20. Asymptotics of linear initial boundary value problems with periodic boundary data on the half-line and finite intervals

    Dujardin, G. M.

    2009-01-01

    This paper deals with the asymptotic behaviour of the solutions of linear initial boundary value problems with constant coefficients on the half-line and on finite intervals. We assume that the boundary data are periodic in time and we investigate

  1. Cost Cumulant-Based Control for a Class of Linear Quadratic Tracking Problems

    Pham, Khanh D

    2007-01-01

    .... For instance, the present paper extends the application of cost-cumulant controller design to control of a wide class of linear-quadratic tracking systems where output measurements of a tracker...

  2. Multiple Problem-Solving Strategies Provide Insight into Students' Understanding of Open-Ended Linear Programming Problems

    Sole, Marla A.

    2016-01-01

    Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…

  3. Half-space albedo problem with modified F{sub N} method for linear and quadratic anisotropic scattering

    Tuereci, R.G. [Kirikkale Univ., Kirikkale (Turkey). Kirikkale Vocational School; Tuereci, D. [Ministry of Education, Ankara (Turkey). 75th year Anatolia High School

    2017-05-15

    One speed, time independent and homogeneous medium neutron transport equation can be solved with the anisotropic scattering which includes both the linear anisotropic and the quadratic anisotropic scattering properties. Having solved Case's eigenfunctions and the orthogonality relations among these eigenfunctions, some neutron transport problems such as albedo problem can be calculated as numerically by using numerical or semi-analytic methods. In this study the half-space albedo problem is investigated by using the modified F{sub N} method.

  4. A separation theorem for the stochastic sampled-data LQG problem. [control of continuous linear plant disturbed by white noise

    Halyo, N.; Caglayan, A. K.

    1976-01-01

    This paper considers the control of a continuous linear plant disturbed by white plant noise when the control is constrained to be a piecewise constant function of time; i.e. a stochastic sampled-data system. The cost function is the integral of quadratic error terms in the state and control, thus penalizing errors at every instant of time while the plant noise disturbs the system continuously. The problem is solved by reducing the constrained continuous problem to an unconstrained discrete one. It is shown that the separation principle for estimation and control still holds for this problem when the plant disturbance and measurement noise are Gaussian.

  5. Some problems on non-linear semigroups and the blow-up of integral solutions

    Pavel, N.H.

    1983-07-01

    After some introductory remarks, this highly mathematical document considers a unifying approach in the theory of non-linear semigroups. Then a brief survey is given on blow-up of mild solutions from the semilinear case. Finally, the global behavior of solutions to non-linear evolution equations is addressed; it is found that classical results on the behavior of the maximal solution u as t up-arrow tsub(max) hold also for integral solutions

  6. Comparative Study of Evolutionary Multi-objective Optimization Algorithms for a Non-linear Greenhouse Climate Control Problem

    Ghoreishi, Newsha; Sørensen, Jan Corfixen; Jørgensen, Bo Nørregaard

    2015-01-01

    Non-trivial real world decision-making processes usually involve multiple parties having potentially conflicting interests over a set of issues. State-of-the-art multi-objective evolutionary algorithms (MOEA) are well known to solve this class of complex real-world problems. In this paper, we...... compare the performance of state-of-the-art multi-objective evolutionary algorithms to solve a non-linear multi-objective multi-issue optimisation problem found in Greenhouse climate control. The chosen algorithms in the study includes NSGAII, eNSGAII, eMOEA, PAES, PESAII and SPEAII. The performance...... of all aforementioned algorithms is assessed and compared using performance indicators to evaluate proximity, diversity and consistency. Our insights to this comparative study enhanced our understanding of MOEAs performance in order to solve a non-linear complex climate control problem. The empirical...

  7. High Order A-stable Continuous General Linear Methods for Solution of Systems of Initial Value Problems in ODEs

    Dauda GuliburYAKUBU

    2012-12-01

    Full Text Available Accurate solutions to initial value systems of ordinary differential equations may be approximated efficiently by Runge-Kutta methods or linear multistep methods. Each of these has limitations of one sort or another. In this paper we consider, as a middle ground, the derivation of continuous general linear methods for solution of stiff systems of initial value problems in ordinary differential equations. These methods are designed to combine the advantages of both Runge-Kutta and linear multistep methods. Particularly, methods possessing the property of A-stability are identified as promising methods within this large class of general linear methods. We show that the continuous general linear methods are self-starting and have more ability to solve the stiff systems of ordinary differential equations, than the discrete ones. The initial value systems of ordinary differential equations are solved, for instance, without looking for any other method to start the integration process. This desirable feature of the proposed approach leads to obtaining very high accuracy of the solution of the given problem. Illustrative examples are given to demonstrate the novelty and reliability of the methods.

  8. Solving the linearized forward-speed radiation problem using a high-order finite difference method on overlapping grids

    Amini Afshar, Mostafa; Bingham, Harry B.

    2017-01-01

    . Frequency-domain results are then obtained from a Fourier transform of the force and motion signals. In order to make a robust Fourier transform, and capture the response around the critical frequency, the tail of the force signal is asymptotically extrapolated assuming a linear decay rate. Fourth......The linearized potential flow approximation for the forward speed radiation problem is solved in the time domain using a high-order finite difference method. The finite-difference discretization is developed on overlapping, curvilinear body-fitted grids. To ensure numerical stability...

  9. Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix --- The full report.

    Ben Gharbia , Ibtihel; Gilbert , Jean Charles

    2012-01-01

    The plain Newton-min algorithm to solve the linear complementarity problem (LCP for short) 0 ≤ x ⊥ (Mx+q) ≥ 0 can be viewed as a nonsmooth Newton algorithm without globalization technique to solve the system of piecewise linear equations min(x,Mx+q)=0, which is equivalent to the LCP. When M is an M-matrix of order n, the algorithm is known to converge in at most n iterations. We show in this paper that this result no longer holds when M is a P-matrix of order ≥ 3, since then the algorithm may...

  10. The longitudinal space charge problem in the high current linear proton accelerators

    Lustfeld, H.

    1984-01-01

    In a linear proton accelerator peak currents of 200 mA lead to high space charge densities and the resultant space charge forces reduce the effective focussing considerably. In particular the longitudinal focussing is affected. A new concept based on linear theory is proposed that restricts the influence of the space charge forces on the longitudinal focussing by increasing a, the mean transverse bunch radius, as a proportional(βγ)sup(3/8). This concept is compared with other concepts for the Alvarez (1 MeV - 100 MeV) and for the high energy part (100 MeV - 1100 MeV) of the SNQ linear accelerator. (orig.)

  11. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

    Van Benthem, Mark H.; Keenan, Michael R.

    2008-11-11

    A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

  12. Near-optimal alternative generation using modified hit-and-run sampling for non-linear, non-convex problems

    Rosenberg, D. E.; Alafifi, A.

    2016-12-01

    Water resources systems analysis often focuses on finding optimal solutions. Yet an optimal solution is optimal only for the modelled issues and managers often seek near-optimal alternatives that address un-modelled objectives, preferences, limits, uncertainties, and other issues. Early on, Modelling to Generate Alternatives (MGA) formalized near-optimal as the region comprising the original problem constraints plus a new constraint that allowed performance within a specified tolerance of the optimal objective function value. MGA identified a few maximally-different alternatives from the near-optimal region. Subsequent work applied Markov Chain Monte Carlo (MCMC) sampling to generate a larger number of alternatives that span the near-optimal region of linear problems or select portions for non-linear problems. We extend the MCMC Hit-And-Run method to generate alternatives that span the full extent of the near-optimal region for non-linear, non-convex problems. First, start at a feasible hit point within the near-optimal region, then run a random distance in a random direction to a new hit point. Next, repeat until generating the desired number of alternatives. The key step at each iterate is to run a random distance along the line in the specified direction to a new hit point. If linear equity constraints exist, we construct an orthogonal basis and use a null space transformation to confine hits and runs to a lower-dimensional space. Linear inequity constraints define the convex bounds on the line that runs through the current hit point in the specified direction. We then use slice sampling to identify a new hit point along the line within bounds defined by the non-linear inequity constraints. This technique is computationally efficient compared to prior near-optimal alternative generation techniques such MGA, MCMC Metropolis-Hastings, evolutionary, or firefly algorithms because search at each iteration is confined to the hit line, the algorithm can move in one

  13. Advanced topics in linear algebra weaving matrix problems through the Weyr form

    O'Meara, Kevin; Vinsonhaler, Charles

    2011-01-01

    The Weyr matrix canonical form is a largely unknown cousin of the Jordan canonical form. Discovered by Eduard Weyr in 1885, the Weyr form outperforms the Jordan form in a number of mathematical situations, yet it remains somewhat of a mystery, even to many who are skilled in linear algebra. Written in an engaging style, this book presents various advanced topics in linear algebra linked through the Weyr form. Kevin O'Meara, John Clark, and Charles Vinsonhaler develop the Weyr form from scratch and include an algorithm for computing it. A fascinating duality exists between the Weyr form and the

  14. Half-linear Sturm-Liouville problem with weights: asymptotic behavior of eigenfunctions

    Drábek, P.; Kufner, Alois; Kuliev, K.

    2014-01-01

    Roč. 284, č. 1 (2014), s. 148-154 ISSN 0081-5438 Institutional support: RVO:67985840 Keywords : Sturm-Liouville problem * spectral problems * Hardy inequality Subject RIV: BA - General Mathematics Impact factor: 0.302, year: 2014 http://link.springer.com/article/10.1134%2FS008154381401009X

  15. Solution of the spherically symmetric linear thermoviscoelastic problem in the inertia-free limit

    Christensen, Tage Emil; Dyre, J. C.

    2008-01-01

    paper-the thermoviscoelastic  problem may be solved analytically in the inertia-free limit, i.e., the limit where the sample is much smaller than the wavelength of sound waves at the frequencies of interest. As for the one-dimensional thermoviscoelastic problem [Christensen et al., Phys. Rev. E 75...

  16. Novel method of interpolation and extrapolation of functions by a linear initial value problem

    Shatalov, M

    2008-09-01

    Full Text Available A novel method of function approximation using an initial value, linear, ordinary differential equation (ODE) is presented. The main advantage of this method is to obtain the approximation expressions in a closed form. This technique can be taught...

  17. The Total Synthesis Problem of linear multivariable control. II - Unity feedback and the design morphism

    Sain, M. K.; Antsaklis, P. J.; Gejji, R. R.; Wyman, B. F.; Peczkowski, J. L.

    1981-01-01

    Zames (1981) has observed that there is, in general, no 'separation principle' to guarantee optimality of a division between control law design and filtering of plant uncertainty. Peczkowski and Sain (1978) have solved a model matching problem using transfer functions. Taking into consideration this investigation, Peczkowski et al. (1979) proposed the Total Synthesis Problem (TSP), wherein both the command/output-response and command/control-response are to be synthesized, subject to the plant constraint. The TSP concept can be subdivided into a Nominal Design Problem (NDP), which is not dependent upon specific controller structures, and a Feedback Synthesis Problem (FSP), which is. Gejji (1980) found that NDP was characterized in terms of the plant structural matrices and a single, 'good' transfer function matrix. Sain et al. (1981) have extended this NDP work. The present investigation is concerned with a study of FSP for the unity feedback case. NDP, together with feedback synthesis, is understood as a Total Synthesis Problem.

  18. Non-linear singular problems in p-adic analysis: associative algebras of p-adic distributions

    Albeverio, S; Khrennikov, A Yu; Shelkovich, V M

    2005-01-01

    We propose an algebraic theory which can be used for solving both linear and non-linear singular problems of p-adic analysis related to p-adic distributions (generalized functions). We construct the p-adic Colombeau-Egorov algebra of generalized functions, in which Vladimirov's pseudo-differential operator plays the role of differentiation. This algebra is closed under Fourier transformation and associative convolution. Pointvalues of generalized functions are defined, and it turns out that any generalized function is uniquely determined by its pointvalues. We also construct an associative algebra of asymptotic distributions, which is generated by the linear span of the set of associated homogeneous p-adic distributions. This algebra is embedded in the Colombeau-Egorov algebra as a subalgebra. In addition, a new technique for constructing weak asymptotics is developed

  19. State-space models’ dirty little secrets: even simple linear Gaussian models can have estimation problems

    Auger-Méthé, Marie; Field, Chris; Albertsen, Christoffer Moesgaard

    2016-01-01

    problems. We demonstrate that these problems occur primarily when measurement error is larger than biological stochasticity, the condition that often drives ecologists to use SSMs. Using an animal movement example, we show how these estimation problems can affect ecological inference. Biased parameter......State-space models (SSMs) are increasingly used in ecology to model time-series such as animal movement paths and population dynamics. This type of hierarchical model is often structured to account for two levels of variability: biological stochasticity and measurement error. SSMs are flexible...

  20. Synthetic acceleration methods for linear transport problems with highly anisotropic scattering

    Khattab, K.M.; Larsen, E.W.

    1992-01-01

    The diffusion synthetic acceleration (DSA) algorithm effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analysis that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented. (author). 10 refs., 7 figs., 5 tabs

  1. Synthetic acceleration methods for linear transport problems with highly anisotropic scattering

    Khattab, K.M.; Larsen, E.W.

    1991-01-01

    This paper reports on the diffusion synthetic acceleration (DSA) algorithm that effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analyses that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented

  2. Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems

    Skajaa, Anders; Andersen, Erling D.; Ye, Yinyu

    2013-01-01

    and their negligible computational cost. This is a major advantage when compared to previously suggested strategies that require a pool of iterates from the solution process of the initial problem. Consequently our strategies are better suited for users who use optimization algorithms as black-box routines which...... worst-case complexity. We present extensive computational results showing work reductions when warmstarting compared to coldstarting in the range 30–75% depending on the problem class and magnitude of the problem perturbation. The computational experiments thus substantiate that the warmstarting...

  3. Variations on the planar Landau problem: canonical transformations, a purely linear potential and the half-plane

    Govaerts, Jan; Hounkonnou, M Norbert; Mweene, Habatwa V

    2009-01-01

    The ordinary Landau problem of a charged particle in a plane subjected to a perpendicular homogeneous and static magnetic field is reconsidered from different points of view. The role of phase space canonical transformations and their relation to a choice of gauge in the solution of the problem is addressed. The Landau problem is then extended to different contexts, in particular the singular situation of a purely linear potential term being added as an interaction, for which a complete purely algebraic solution is presented. This solution is then exploited to solve this same singular Landau problem in the half-plane, with as motivation the potential relevance of such a geometry for quantum Hall measurements in the presence of an electric field or a gravitational quantum well.

  4. Variations on the planar Landau problem: canonical transformations, a purely linear potential and the half-plane

    Govaerts, Jan [Center for Particle Physics and Phenomenology (CP3), Institut de Physique Nucleaire, Universite catholique de Louvain (UCL), 2, Chemin du Cyclotron, B-1348 Louvain-la Neuve (Belgium); Hounkonnou, M Norbert [International Chair in Mathematical Physics and Applications (ICMPA-UNESCO Chair), University of Abomey-Calavi, 072 BP 50, Cotonou (Benin); Mweene, Habatwa V [Physics Department, University of Zambia, PO Box 32379, Lusaka (Zambia)], E-mail: Jan.Govaerts@uclouvain.be, E-mail: hounkonnou@yahoo.fr, E-mail: norbert.hounkonnou@cipma.uac.bj, E-mail: habatwamweene@yahoo.com, E-mail: hmweene@unza.zm

    2009-12-04

    The ordinary Landau problem of a charged particle in a plane subjected to a perpendicular homogeneous and static magnetic field is reconsidered from different points of view. The role of phase space canonical transformations and their relation to a choice of gauge in the solution of the problem is addressed. The Landau problem is then extended to different contexts, in particular the singular situation of a purely linear potential term being added as an interaction, for which a complete purely algebraic solution is presented. This solution is then exploited to solve this same singular Landau problem in the half-plane, with as motivation the potential relevance of such a geometry for quantum Hall measurements in the presence of an electric field or a gravitational quantum well.

  5. Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

    Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)

    2016-12-15

    An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

  6. Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP

    Fernandes, L.; Friedlander, A.; Guedes, M.; Judice, J.

    2001-01-01

    This paper addresses a General Linear Complementarity Problem (GLCP) that has found applications in global optimization. It is shown that a solution of the GLCP can be computed by finding a stationary point of a differentiable function over a set defined by simple bounds on the variables. The application of this result to the solution of bilinear programs and LCPs is discussed. Some computational evidence of its usefulness is included in the last part of the paper

  7. An interior-point method for the Cartesian P*(k-linear complementarity problem over symmetric cones

    B Kheirfam

    2014-06-01

    Full Text Available A novel primal-dual path-following interior-point algorithm for the Cartesian P*(k-linear complementarity problem over symmetric cones is presented. The algorithm is based on a reformulation of the central path for finding the search directions. For a full Nesterov-Todd step feasible interior-point algorithm based on the new search directions, the complexity bound of the algorithm with small-update approach is the best-available bound.

  8. The application of LQR synthesis techniques to the turboshaft engine control problem. [Linear Quadratic Regulator

    Pfeil, W. H.; De Los Reyes, G.; Bobula, G. A.

    1985-01-01

    A power turbine governor was designed for a recent-technology turboshaft engine coupled to a modern, articulated rotor system using Linear Quadratic Regulator (LQR) and Kalman Filter (KF) techniques. A linear, state-space model of the engine and rotor system was derived for six engine power settings from flight idle to maximum continuous. An integrator was appended to the fuel flow input to reduce the steady-state governor error to zero. Feedback gains were calculated for the system states at each power setting using the LQR technique. The main rotor tip speed state is not measurable, so a Kalman Filter of the rotor was used to estimate this state. The crossover of the system was increased to 10 rad/s compared to 2 rad/sec for a current governor. Initial computer simulations with a nonlinear engine model indicate a significant decrease in power turbine speed variation with the LQR governor compared to a conventional governor.

  9. Management of surgical waiting lists through a Possibilistic Linear Multiobjective Programming problem

    Pérez Gladish, Blanca María; Arenas Parra, María del Mar; Bilbao Terol, Amelia María; Rodríguez Uria, María Victoria

    2005-01-01

    This study attempts to apply a management science technique to improve the efficiency of Hospital Administration. We aim to design the performance of the surgical services at a Public Hospital that allows the Decision-Maker to plan surgical scheduling over one year in order to reduce waiting lists. Real decision problems usually involve several objectives that have parameters which are often given by the decision maker in an imprecise way. It is possible to handle these kinds of problems ...

  10. SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression

    Flores, Salvador

    2015-01-01

    This paper deals with the problem of finding the globally optimal subset of h elements from a larger set of n elements in d space dimensions so as to minimize a quadratic criterion, with an special emphasis on applications to computing the Least Trimmed Squares Estimator (LTSE) for robust regression. The computation of the LTSE is a challenging subset selection problem involving a nonlinear program with continuous and binary variables, linked in a highly nonlinear fashion. The selection of a ...

  11. Multiplicity of Solutions for a Class of Fourth-Order Elliptic Problems with Asymptotically Linear Term

    Qiong Liu

    2012-01-01

    Full Text Available We study the following fourth-order elliptic equations: Δ2+Δ=(,,∈Ω,=Δ=0,∈Ω, where Ω⊂ℝ is a bounded domain with smooth boundary Ω and (, is asymptotically linear with respect to at infinity. Using an equivalent version of Cerami's condition and the symmetric mountain pass lemma, we obtain the existence of multiple solutions for the equations.

  12. Guaranteed and computable bounds of the limit load for variational problems with linear growth energy functionals

    Haslinger, Jaroslav; Repin, S.; Sysala, Stanislav

    2016-01-01

    Roč. 61, č. 5 (2016), s. 527-564 ISSN 0862-7940 R&D Projects: GA MŠk LQ1602 Institutional support: RVO:68145535 Keywords : functionals with linear growth * limit load * truncation method * perfect plasticity Subject RIV: BA - General Mathematics Impact factor: 0.618, year: 2016 http://link.springer.com/article/10.1007/s10492-016-0146-6

  13. A Unique Technique to get Kaprekar Iteration in Linear Programming Problem

    Sumathi, P.; Preethy, V.

    2018-04-01

    This paper explores about a frivolous number popularly known as Kaprekar constant and Kaprekar numbers. A large number of courses and the different classroom capacities with difference in study periods make the assignment between classrooms and courses complicated. An approach of getting the minimum value of number of iterations to reach the Kaprekar constant for four digit numbers and maximum value is also obtained through linear programming techniques.

  14. Some mathematical problems in non-linear Physics; Algunos problemas matematicos en fisica no-lineal

    NONE

    1983-07-01

    The main results contained in this report are the following: I) A general analysis of non-autonomous conserved densities for simple linear evolution systems. II) Partial differential systems within a wide class are converted into Lagrange an form. III) Rigorous criteria for existence of integrating factor matrices. IV) Isolation of all third-order evolution equations with high order symmetries and conservation laws. (Author) 3 refs.

  15. A Linear Time Algorithm for the k Maximal Sums Problem

    Brodal, Gerth Stølting; Jørgensen, Allan Grønlund

    2007-01-01

     k maximal sums problem. We use this algorithm to obtain algorithms solving the two-dimensional k maximal sums problem in O(m 2·n + k) time, where the input is an m ×n matrix with m ≤ n. We generalize this algorithm to solve the d-dimensional problem in O(n 2d − 1 + k) time. The space usage of all......Finding the sub-vector with the largest sum in a sequence of n numbers is known as the maximum sum problem. Finding the k sub-vectors with the largest sums is a natural extension of this, and is known as the k maximal sums problem. In this paper we design an optimal O(n + k) time algorithm for the...... the algorithms can be reduced to O(n d − 1 + k). This leads to the first algorithm for the k maximal sums problem in one dimension using O(n + k) time and O(k) space....

  16. An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem

    Meriem Ait Mehdi

    2014-01-01

    Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.

  17. Reduction of Linear Programming to Linear Approximation

    Vaserstein, Leonid N.

    2006-01-01

    It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.

  18. Human Exhibitions

    Andreassen, Rikke

    light on the staging of exhibitions, the daily life of the exhibitees, the wider connections between shows across Europe and the thinking of the time on matters of race, science, gender and sexuality. A window onto contemporary racial understandings, the book presents interviews with the descendants...... of displayed people, connecting the attitudes and science of the past with both our (continued) modern fascination with ‘the exotic’, and contemporary language and popular culture. As such, it will be of interest to scholars of sociology, anthropology and history working in the areas of gender and sexuality...

  19. A Review On Linear Programming Analysis Of The Outsourcing Problem Using MATLAB

    FLt Lt Dinesh Kumar Gupta Retd.

    2015-08-01

    Full Text Available Abstract This study examines the case where market demand exceeds the companys capacity to manufacture. Manufacturing companies often function in situations where internal production resources constrain their throughput. Such situations are characterized as the problem of finite capacity scheduling. Management policy is to meet all demand in order to prevent competitor from entering the field. Now if management needs to decide what quantities of each product to manufacture and what quantities to buy from external contractors. In this study we have described two methodologies based on LP analysis to solve production outsourcing problem using latest version of MATLAB. We choose the best methodology which gives us maximum profits.

  20. Primal and Dual Penalty Methods for Contact Problems with Geometrical Non-linearities

    Vondrák, V.; Dostál, Z.; Dobiáš, Jiří; Pták, Svatopluk

    -, č. 5 (2005), s. 449-450 ISSN 1617-7061. [GAMM Annual Meeting 2005. Luxembourg, 28.03.2005-01.04.2005] R&D Projects: GA ČR(CZ) GA101/05/0423 Institutional research plan: CEZ:AV0Z20760514 Keywords : primal penalty * dual penalty * contact problem Subject RIV: BA - General Mathematics

  1. Representation of Students in Solving Simultaneous Linear Equation Problems Based on Multiple Intelligence

    Yanti, Y. R.; Amin, S. M.; Sulaiman, R.

    2018-01-01

    This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.

  2. On nonseparated three-point boundary value problems for linear functional differential equations

    Rontó, András; Rontó, M.

    2011-01-01

    Roč. 2011, - (2011), s. 326052 ISSN 1085-3375 Institutional research plan: CEZ:AV0Z10190503 Keywords : functional-differential equation * three-point boundary value problem * nonseparated boundary condition Subject RIV: BA - General Mathematics Impact factor: 1.318, year: 2011 http://www.hindawi.com/journals/ aaa /2011/326052/

  3. Comparing Linear Discriminant Function with Logistic Regression for the Two-Group Classification Problem.

    Fan, Xitao; Wang, Lin

    The Monte Carlo study compared the performance of predictive discriminant analysis (PDA) and that of logistic regression (LR) for the two-group classification problem. Prior probabilities were used for classification, but the cost of misclassification was assumed to be equal. The study used a fully crossed three-factor experimental design (with…

  4. Well-posedness of the second-order linear singular Dirichlet problem

    Lomtatidze, Alexander; Opluštil, Z.

    2015-01-01

    Roč. 22, č. 3 (2015), s. 409-419 ISSN 1072-947X Institutional support: RVO:67985840 Keywords : singular Dirichlet problem * well-posedness Subject RIV: BA - General Mathematics Impact factor: 0.417, year: 2015 http://www.degruyter.com/view/j/gmj.2015.22.issue-3/gmj-2015-0023/gmj-2015-0023. xml

  5. Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

    Lukšan, Ladislav; Vlček, Jan

    1998-01-01

    Roč. 5, č. 3 (1998), s. 219-247 ISSN 1070-5325 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear programming * sparse problems * equality constraints * truncated Newton method * augmented Lagrangian function * indefinite systems * indefinite preconditioners * conjugate gradient method * residual smoothing Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 1998

  6. On the consistency of adjoint sensitivity analysis for structural optimization of linear dynamic problems

    Jensen, Jakob Søndergaard; Nakshatrala, Praveen B.; Tortorelli, Daniel A.

    2014-01-01

    Gradient-based topology optimization typically involves thousands or millions of design variables. This makes efficient sensitivity analysis essential and for this the adjoint variable method (AVM) is indispensable. For transient problems it has been observed that the traditional AVM, based on a ...

  7. Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

    H Kazemipoor

    2012-04-01

    Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.

  8. Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems

    Umbarkar, A. J.; Balande, U. T.; Seth, P. D.

    2017-06-01

    The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problems in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimization problems. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension.

  9. Intuitionistic Fuzzy Goal Programming Technique for Solving Non-Linear Multi-objective Structural Problem

    Samir Dey

    2015-07-01

    Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.

  10. The Dirichlet problem with L2-boundary data for elliptic linear equations

    Chabrowski, Jan

    1991-01-01

    The Dirichlet problem has a very long history in mathematics and its importance in partial differential equations, harmonic analysis, potential theory and the applied sciences is well-known. In the last decade the Dirichlet problem with L2-boundary data has attracted the attention of several mathematicians. The significant features of this recent research are the use of weighted Sobolev spaces, existence results for elliptic equations under very weak regularity assumptions on coefficients, energy estimates involving L2-norm of a boundary data and the construction of a space larger than the usual Sobolev space W1,2 such that every L2-function on the boundary of a given set is the trace of a suitable element of this space. The book gives a concise account of main aspects of these recent developments and is intended for researchers and graduate students. Some basic knowledge of Sobolev spaces and measure theory is required.

  11. Special Cases in Optimization Problems for Stationary Linear Closed-Loop Systems

    Aliev, F. A.; Larin, Vladimir Borisovich

    2003-03-01

    Consideration is given to problems of solving the algebraic Riccati equation (ARE)— J-factorization of matrix polynomials and J-factorization of rational matrices—to which traditional solution algorithms are not applicable. In this connection, solution algorithms for these problems are discussed where the eigenvalues of the Hamiltonian matrix corresponding to the ARE and the zeros of matrix polynomials are located on the imaginary axis. Moreover, a procedure is set forth for asymptotic expansion of a stabilizing solution of the ARE in the neighborhood of a point at which the ARE has no stabilizing solution. It is shown how this expansion can be used for constructing canonical J-factorization of matrix polynomials that is nearly a noncanonical J-factorization. It is pointed out that the algorithms described can be implemented with the help of MATLAB routines

  12. Non-linear time series extreme events and integer value problems

    Turkman, Kamil Feridun; Zea Bermudez, Patrícia

    2014-01-01

    This book offers a useful combination of probabilistic and statistical tools for analyzing nonlinear time series. Key features of the book include a study of the extremal behavior of nonlinear time series and a comprehensive list of nonlinear models that address different aspects of nonlinearity. Several inferential methods, including quasi likelihood methods, sequential Markov Chain Monte Carlo Methods and particle filters, are also included so as to provide an overall view of the available tools for parameter estimation for nonlinear models. A chapter on integer time series models based on several thinning operations, which brings together all recent advances made in this area, is also included. Readers should have attended a prior course on linear time series, and a good grasp of simulation-based inferential methods is recommended. This book offers a valuable resource for second-year graduate students and researchers in statistics and other scientific areas who need a basic understanding of nonlinear time ...

  13. Aspects on increase and decrease within a national economy as eigenvalue problem of linear homogeneous equations

    Mueller, E.

    2007-01-01

    The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)

  14. A non-linear optimal control problem in obtaining homogeneous concentration for semiconductor materials

    Huang, C.-H.; Li, J.-X.

    2006-01-01

    A non-linear optimal control algorithm is examined in this study for the diffusion process of semiconductor materials. The purpose of this algorithm is to estimate an optimal control function such that the homogeneity of the concentration can be controlled during the diffusion process and the diffusion-induced stresses for the semiconductor materials can thus be reduced. The validation of this optimal control analysis utilizing the conjugate gradient method of minimization is analysed by using numerical experiments. Three different diffusion processing times are given and the corresponding optimal control functions are to be determined. Results show that the diffusion time can be shortened significantly by applying the optimal control function at the boundary and the homogeneity of the concentration is also guaranteed. This control function can be obtained within a very short CPU time on a Pentium III 600 MHz PC

  15. Aspects on increase and decrease within a national economy as eigenvalue problem of linear homogeneous equations

    Mueller, E.

    2007-12-15

    The paper presents an approach which treats topics of macroeconomics by methods familiar in physics and technology, especially in nuclear reactor technology and in quantum mechanics. Such methods are applied to simplified models for the money flows within a national economy, their variation in time and thereby for the annual national growth rate. As usual, money flows stand for economic activities. The money flows between the economic groups are described by a set of difference equations or by a set of approximative differential equations or eventually by a set of linear algebraic equations. Thus this paper especially deals with the time behaviour of model economies which are under the influence of imbalances and of delay processes, thereby dealing also with economic growth and recession rates. These differential equations are solved by a completely numerical Runge-Kutta algorithm. Case studies are presented for cases with 12 groups only and are to show the capability of the methods which have been worked out. (orig.)

  16. Parametric linear programming for a materials requirement planning problem solution with uncertainty

    Martin Darío Arango Serna; Conrado Augusto Serna; Giovanni Pérez Ortega

    2010-01-01

    Using fuzzy set theory as a methodology for modelling and analysing decision systems is particularly interesting for researchers in industrial engineering because it allows qualitative and quantitative analysis of problems involving uncertainty and imprecision. Thus, in an effort to gain a better understanding of the use of fuzzy logic in industrial engineering, more specifically in the field of production planning, this article was aimed at providing a materials requirement planning (MRP) pr...

  17. The general linear thermoelastic end problem for solid and hollow cylinders

    Thompson, J.J.; Chen, P.Y.P.

    1977-01-01

    This paper reports on three topics arising from work in progress on theoretical and computational aspects of the utilization of self equilibrating and load stress systems, to solve thermoelastic problems of finite, or semi-infinite, solid or hollow circular cylinders, with particular reference to the pellets, rods, tubes and shells with arbitrary internal heat generation encountered in Nuclear Reactor Technology. Specifically the work is aimed at the evaluation of stress intensification factors in the end elastic boundary layer region, due to various thermal and mechanical end load conditions, in relation to the external, exact stress solutions, which satisfy conditions on the curved surfaces only and are valid over the remainder of the cylindrical body. More generally, it is possible, at least for symmetric thermoelastic problems, to derive exact external solutions, using self equilibrating end load systems, which describe the stress/displacement state completely as a combination of a simple local plane strain solution and a correction dependent on the magnitude of axial thermal gradients. Thus plane strain, and self equilibrating end load systems are sufficient for the complete external and boundary layer solution of a finite cylindrical body. This formulation is capable of further extension, e.g., to concentric multi-region problems, and provides a useful approach to the study of local stress intensification factors due to thermal perturbations

  18. Box-triangular multiobjective linear programs for resource allocation with application to load management and energy market problems

    Ekel, P.Y.; Galperin, E.A.

    2003-01-01

    Models for multicriteria resource allocation are constructed with the specific box-triangular structure of a feasible region. The method of balance set equations is extended for the satisfaction level representation of the cost function space including the case of linearly dependent cost functions. On this basis, different goal criteria on the balance set are investigated for linear cases. Procedures for determining the balance set and finding goal-optimal Pareto solutions are illustrated on examples. The results of the paper are of universal character and can find wide applications in allocating diverse types of resources on the multiobjective basis in planning and control of complex systems including load management and energy market problems. (Author)

  19. Existence and Linear Stability of Equilibrium Points in the Robe’s Restricted Three-Body Problem with Oblateness

    Jagadish Singh

    2012-01-01

    Full Text Available This paper investigates the positions and linear stability of an infinitesimal body around the equilibrium points in the framework of the Robe’s circular restricted three-body problem, with assumptions that the hydrostatic equilibrium figure of the first primary is an oblate spheroid and the second primary is an oblate body as well. It is found that equilibrium point exists near the centre of the first primary. Further, there can be one more equilibrium point on the line joining the centers of both primaries. Points on the circle within the first primary are also equilibrium points under certain conditions and the existence of two out-of-plane points is also observed. The linear stability of this configuration is examined and it is found that points near the center of the first primary are conditionally stable, while the circular and out of plane equilibrium points are unstable.

  20. Optimization of lift gas allocation in a gas lifted oil field as non-linear optimization problem

    Roshan Sharma

    2012-01-01

    Full Text Available Proper allocation and distribution of lift gas is necessary for maximizing total oil production from a field with gas lifted oil wells. When the supply of the lift gas is limited, the total available gas should be optimally distributed among the oil wells of the field such that the total production of oil from the field is maximized. This paper describes a non-linear optimization problem with constraints associated with the optimal distribution of the lift gas. A non-linear objective function is developed using a simple dynamic model of the oil field where the decision variables represent the lift gas flow rate set points of each oil well of the field. The lift gas optimization problem is solved using the emph'fmincon' solver found in MATLAB. As an alternative and for verification, hill climbing method is utilized for solving the optimization problem. Using both of these methods, it has been shown that after optimization, the total oil production is increased by about 4. For multiple oil wells sharing lift gas from a common source, a cascade control strategy along with a nonlinear steady state optimizer behaves as a self-optimizing control structure when the total supply of lift gas is assumed to be the only input disturbance present in the process. Simulation results show that repeated optimization performed after the first time optimization under the presence of the input disturbance has no effect in the total oil production.

  1. Linear algebra

    Shilov, Georgi E

    1977-01-01

    Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.

  2. A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.

    1987-10-01

    ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works...ari cl(cck to iceat reguilar rnct’vtuls. For c’xamiic, oi1cc Wwitiil pcroccc’ssicg svlstcici1 rccjcilrcc thicit I iisc wires ice repeated verr 200W

  3. The Prediction Properties of Inverse and Reverse Regression for the Simple Linear Calibration Problem

    Parker, Peter A.; Geoffrey, Vining G.; Wilson, Sara R.; Szarka, John L., III; Johnson, Nels G.

    2010-01-01

    The calibration of measurement systems is a fundamental but under-studied problem within industrial statistics. The origins of this problem go back to basic chemical analysis based on NIST standards. In today's world these issues extend to mechanical, electrical, and materials engineering. Often, these new scenarios do not provide "gold standards" such as the standard weights provided by NIST. This paper considers the classic "forward regression followed by inverse regression" approach. In this approach the initial experiment treats the "standards" as the regressor and the observed values as the response to calibrate the instrument. The analyst then must invert the resulting regression model in order to use the instrument to make actual measurements in practice. This paper compares this classical approach to "reverse regression," which treats the standards as the response and the observed measurements as the regressor in the calibration experiment. Such an approach is intuitively appealing because it avoids the need for the inverse regression. However, it also violates some of the basic regression assumptions.

  4. A new numerical scheme for non uniform homogenized problems: Application to the non linear Reynolds compressible equation

    Buscaglia Gustavo C.

    2001-01-01

    Full Text Available A new numerical approach is proposed to alleviate the computational cost of solving non-linear non-uniform homogenized problems. The article details the application of the proposed approach to lubrication problems with roughness effects. The method is based on a two-parameter Taylor expansion of the implicit dependence of the homogenized coefficients on the average pressure and on the local value of the air gap thickness. A fourth-order Taylor expansion provides an approximation that is accurate enough to be used in the global problem solution instead of the exact dependence, without introducing significant errors. In this way, when solving the global problem, the solution of local problems is simply replaced by the evaluation of a polynomial. Moreover, the method leads naturally to Newton-Raphson nonlinear iterations, that further reduce the cost. The overall efficiency of the numerical methodology makes it feasible to apply rigorous homogenization techniques in the analysis of compressible fluid contact considering roughness effects. Previous work makes use of an heuristic averaging technique. Numerical comparison proves that homogenization-based methods are superior when the roughness is strongly anisotropic and not aligned with the flow direction.

  5. Status of the Monte Carlo library least-squares (MCLLS) approach for non-linear radiation analyzer problems

    Gardner, Robin P.; Xu, Libai

    2009-10-01

    The Center for Engineering Applications of Radioisotopes (CEAR) has been working for over a decade on the Monte Carlo library least-squares (MCLLS) approach for treating non-linear radiation analyzer problems including: (1) prompt gamma-ray neutron activation analysis (PGNAA) for bulk analysis, (2) energy-dispersive X-ray fluorescence (EDXRF) analyzers, and (3) carbon/oxygen tool analysis in oil well logging. This approach essentially consists of using Monte Carlo simulation to generate the libraries of all the elements to be analyzed plus any other required background libraries. These libraries are then used in the linear library least-squares (LLS) approach with unknown sample spectra to analyze for all elements in the sample. Iterations of this are used until the LLS values agree with the composition used to generate the libraries. The current status of the methods (and topics) necessary to implement the MCLLS approach is reported. This includes: (1) the Monte Carlo codes such as CEARXRF, CEARCPG, and CEARCO for forward generation of the necessary elemental library spectra for the LLS calculation for X-ray fluorescence, neutron capture prompt gamma-ray analyzers, and carbon/oxygen tools; (2) the correction of spectral pulse pile-up (PPU) distortion by Monte Carlo simulation with the code CEARIPPU; (3) generation of detector response functions (DRF) for detectors with linear and non-linear responses for Monte Carlo simulation of pulse-height spectra; and (4) the use of the differential operator (DO) technique to make the necessary iterations for non-linear responses practical. In addition to commonly analyzed single spectra, coincidence spectra or even two-dimensional (2-D) coincidence spectra can also be used in the MCLLS approach and may provide more accurate results.

  6. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  7. On the solution of two-point linear differential eigenvalue problems. [numerical technique with application to Orr-Sommerfeld equation

    Antar, B. N.

    1976-01-01

    A numerical technique is presented for locating the eigenvalues of two point linear differential eigenvalue problems. The technique is designed to search for complex eigenvalues belonging to complex operators. With this method, any domain of the complex eigenvalue plane could be scanned and the eigenvalues within it, if any, located. For an application of the method, the eigenvalues of the Orr-Sommerfeld equation of the plane Poiseuille flow are determined within a specified portion of the c-plane. The eigenvalues for alpha = 1 and R = 10,000 are tabulated and compared for accuracy with existing solutions.

  8. Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems

    Zhifeng Dai

    2014-01-01

    Full Text Available Combining the Rosen gradient projection method with the two-term Polak-Ribière-Polyak (PRP conjugate gradient method, we propose a two-term Polak-Ribière-Polyak (PRP conjugate gradient projection method for solving linear equality constraints optimization problems. The proposed method possesses some attractive properties: (1 search direction generated by the proposed method is a feasible descent direction; consequently the generated iterates are feasible points; (2 the sequences of function are decreasing. Under some mild conditions, we show that it is globally convergent with Armijio-type line search. Preliminary numerical results show that the proposed method is promising.

  9. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....

  10. Generalized Uncertainty Quantification for Linear Inverse Problems in X-ray Imaging

    Fowler, Michael James [Clarkson Univ., Potsdam, NY (United States)

    2014-04-25

    In industrial and engineering applications, X-ray radiography has attained wide use as a data collection protocol for the assessment of material properties in cases where direct observation is not possible. The direct measurement of nuclear materials, particularly when they are under explosive or implosive loading, is not feasible, and radiography can serve as a useful tool for obtaining indirect measurements. In such experiments, high energy X-rays are pulsed through a scene containing material of interest, and a detector records a radiograph by measuring the radiation that is not attenuated in the scene. One approach to the analysis of these radiographs is to model the imaging system as an operator that acts upon the object being imaged to produce a radiograph. In this model, the goal is to solve an inverse problem to reconstruct the values of interest in the object, which are typically material properties such as density or areal density. The primary objective in this work is to provide quantitative solutions with uncertainty estimates for three separate applications in X-ray radiography: deconvolution, Abel inversion, and radiation spot shape reconstruction. For each problem, we introduce a new hierarchical Bayesian model for determining a posterior distribution on the unknowns and develop efficient Markov chain Monte Carlo (MCMC) methods for sampling from the posterior. A Poisson likelihood, based on a noise model for photon counts at the detector, is combined with a prior tailored to each application: an edge-localizing prior for deconvolution; a smoothing prior with non-negativity constraints for spot reconstruction; and a full covariance sampling prior based on a Wishart hyperprior for Abel inversion. After developing our methods in a general setting, we demonstrate each model on both synthetically generated datasets, including those from a well known radiation transport code, and real high energy radiographs taken at two U. S. Department of Energy

  11. Synthetic acceleration methods for linear transport problems with highly anisotropic scattering

    Khattab, K.M.

    1989-01-01

    One of the iterative methods which is used to solve the discretized transport equation is called the Source Iteration Method (SI). The SI method converges very slowly for problems with optically thick regions and scattering ratios (σ s /σ t ) near unity. The Diffusion-Synthetic Acceleration method (DSA) is one of the methods which has been devised to improve the convergence rate of the SI method. The DSA method is a good tool to accelerate the SI method, if the particle which is being dealt with is a neutron. This is because the scattering process for neutrons is not severely anisotropic. However, if the particle is a charged particle (electron), DSA becomes ineffective as an acceleration device because here the scattering process is severely anisotropic. To improve the DSA algorithm for electron transport, the author approaches the problem in two different ways in this thesis. He develops the first approach by accelerating more angular moments (φ 0 , φ 1 , φ 2 , φ 3 ,...) than is done in DSA; he calls this approach the Modified P N Synthetic Acceleration (MPSA) method. In the second approach he modifies the definition of the transport sweep, using the physics of the scattering; he calls this approach the Modified Diffusion Synthetic Acceleration (MDSA) method. In general, he has developed, analyzed, and implemented the MPSA and MDSA methods in this thesis and has shown that for a high order quadrature set and mesh widths about 1.0 cm, they are each about 34 times faster (clock time) than the DSA method. Also, he has found that the MDSA spectral radius decreases as the mesh size increases. This makes the MDSA method a better choice for large spatial meshes

  12. A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy.

    Herman, Gabor T; Chen, Wei

    2008-03-01

    The goal of Intensity-Modulated Radiation Therapy (IMRT) is to deliver sufficient doses to tumors to kill them, but without causing irreparable damage to critical organs. This requirement can be formulated as a linear feasibility problem. The sequential (i.e., iteratively treating the constraints one after another in a cyclic fashion) algorithm ART3 is known to find a solution to such problems in a finite number of steps, provided that the feasible region is full dimensional. We present a faster algorithm called ART3+. The idea of ART3+ is to avoid unnecessary checks on constraints that are likely to be satisfied. The superior performance of the new algorithm is demonstrated by mathematical experiments inspired by the IMRT application.

  13. Penalized linear regression for discrete ill-posed problems: A hybrid least-squares and mean-squared error approach

    Suliman, Mohamed Abdalla Elhag

    2016-12-19

    This paper proposes a new approach to find the regularization parameter for linear least-squares discrete ill-posed problems. In the proposed approach, an artificial perturbation matrix with a bounded norm is forced into the discrete ill-posed model matrix. This perturbation is introduced to enhance the singular-value (SV) structure of the matrix and hence to provide a better solution. The proposed approach is derived to select the regularization parameter in a way that minimizes the mean-squared error (MSE) of the estimator. Numerical results demonstrate that the proposed approach outperforms a set of benchmark methods in most cases when applied to different scenarios of discrete ill-posed problems. Jointly, the proposed approach enjoys the lowest run-time and offers the highest level of robustness amongst all the tested methods.

  14. An A Posteriori Error Analysis of Mixed Finite Element Galerkin Approximations to Second Order Linear Parabolic Problems

    Memon, Sajid; Nataraj, Neela; Pani, Amiya Kumar

    2012-01-01

    In this article, a posteriori error estimates are derived for mixed finite element Galerkin approximations to second order linear parabolic initial and boundary value problems. Using mixed elliptic reconstructions, a posteriori error estimates in L∞(L2)- and L2(L2)-norms for the solution as well as its flux are proved for the semidiscrete scheme. Finally, based on a backward Euler method, a completely discrete scheme is analyzed and a posteriori error bounds are derived, which improves upon earlier results on a posteriori estimates of mixed finite element approximations to parabolic problems. Results of numerical experiments verifying the efficiency of the estimators have also been provided. © 2012 Society for Industrial and Applied Mathematics.

  15. Difficulties faced by eighth grade students in the learning of linear equation problems at a high school in Heredia

    Gilberto Chavarría Arroyo

    2014-06-01

    Full Text Available The current article presents the results of a study that aimed to analyze the difficulties faced by eighth grade students when learning to solve algebraic problems based on linear equations with one unknown variable. The participants were learners with low average performance in mathematics at a high school in Heredia. The research followed a naturalistic paradigm and the case study method with a qualitative approach. Different techniques like class observations, questionnaires to students, non-structured interviews to teachers and interviews to the learners were applied. The research helped to identify the main causes of difficulty when learning to solve algebraic problems. Some of the causes that were identified are affective aspects, lack of previous knowledge, poor relational understanding, fatigue, diversion, reading deficiencies and misunderstanding of terminology.

  16. Data-driven non-linear elasticity: constitutive manifold construction and problem discretization

    Ibañez, Ruben; Borzacchiello, Domenico; Aguado, Jose Vicente; Abisset-Chavanne, Emmanuelle; Cueto, Elias; Ladeveze, Pierre; Chinesta, Francisco

    2017-11-01

    The use of constitutive equations calibrated from data has been implemented into standard numerical solvers for successfully addressing a variety problems encountered in simulation-based engineering sciences (SBES). However, the complexity remains constantly increasing due to the need of increasingly detailed models as well as the use of engineered materials. Data-Driven simulation constitutes a potential change of paradigm in SBES. Standard simulation in computational mechanics is based on the use of two very different types of equations. The first one, of axiomatic character, is related to balance laws (momentum, mass, energy,\\ldots ), whereas the second one consists of models that scientists have extracted from collected, either natural or synthetic, data. Data-driven (or data-intensive) simulation consists of directly linking experimental data to computers in order to perform numerical simulations. These simulations will employ laws, universally recognized as epistemic, while minimizing the need of explicit, often phenomenological, models. The main drawback of such an approach is the large amount of required data, some of them inaccessible from the nowadays testing facilities. Such difficulty can be circumvented in many cases, and in any case alleviated, by considering complex tests, collecting as many data as possible and then using a data-driven inverse approach in order to generate the whole constitutive manifold from few complex experimental tests, as discussed in the present work.

  17. An Alternate Approach to Optimal L 2 -Error Analysis of Semidiscrete Galerkin Methods for Linear Parabolic Problems with Nonsmooth Initial Data

    Goswami, Deepjyoti; Pani, Amiya K.

    2011-01-01

    In this article, we propose and analyze an alternate proof of a priori error estimates for semidiscrete Galerkin approximations to a general second order linear parabolic initial and boundary value problem with rough initial data. Our analysis

  18. Existence and Stability of the Periodic Solution with an Interior Transitional Layer in the Problem with a Weak Linear Advection

    Nikolay N. Nefedov

    2018-01-01

    Full Text Available In the paper, we study a singularly perturbed periodic in time problem for the parabolic reaction-advection-diffusion equation with a weak linear advection. The case of the reactive term in the form of a cubic nonlinearity is considered. On the basis of already known results, a more general formulation of the problem is investigated, with weaker sufficient conditions for the existence of a solution with an internal transition layer to be provided than in previous studies. For convenience, the known results are given, which ensure the fulfillment of the existence theorem of the contrast structure. The justification for the existence of a solution with an internal transition layer is based on the use of an asymptotic method of differential inequalities based on the modification of the terms of the constructed asymptotic expansion. Further, sufficient conditions are established to fulfill these requirements, and they have simple and concise formulations in the form of the algebraic equation w(x0,t = 0 and the condition wx(x0,t < 0, which is essentially a condition of simplicity of the root x0(t and ensuring the stability of the solution found. The function w is a function of the known functions appearing in the reactive and advective terms of the original problem. The equation w(x0,t = 0 is a problem for finding the zero approximation x0(t to determine the localization region of the inner transition layer. In addition, the asymptotic Lyapunov stability of the found periodic solution is investigated, based on the application of the so-called compressible barrier method. The main result of the paper is formulated as a theorem. 

  19. On linear transport problems

    Ignatovich, V.K.

    1989-01-01

    The equations. governing the transport of radiation in plane media of finite thickness are formulated and solved in terms reflection and extintion of radiation inthe case of semi infinite media. 13 refs

  20. Modelos lineares e não lineares inteiros para problemas da mochila bidimensional restrita a 2 estágios Linear and nonlinear integer models for constrained two-stage two-dimensional knapsack problems

    Horacio Hideki Yanasse

    2013-01-01

    Full Text Available Neste trabalho revemos alguns modelos lineares e não lineares inteiros para gerar padrões de corte bidimensionais guilhotinados de 2 estágios, incluindo os casos exato e não exato e restrito e irrestrito. Esses problemas são casos particulares do problema da mochila bidimensional. Apresentamos também novos modelos para gerar esses padrões de corte, baseados em adaptações ou extensões de modelos para gerar padrões de corte bidimensionais restritos 1-grupo. Padrões 2 estágios aparecem em diferentes processos de corte, como, por exemplo, em indústrias de móveis e de chapas de madeira. Os modelos são úteis para a pesquisa e o desenvolvimento de métodos de solução mais eficientes, explorando estruturas particulares, a decomposição do modelo, relaxações do modelo etc. Eles também são úteis para a avaliação do desempenho de heurísticas, já que permitem (pelo menos para problemas de tamanho moderado uma estimativa do gap de otimalidade de soluções obtidas por heurísticas. Para ilustrar a aplicação dos modelos, analisamos os resultados de alguns experimentos computacionais com exemplos da literatura e outros gerados aleatoriamente. Os resultados foram produzidos usando um software comercial conhecido e mostram que o esforço computacional necessário para resolver os modelos pode ser bastante diferente.In this work we review some linear and nonlinear integer models to generate two stage two-dimensional guillotine cutting patterns, including the constrained, non constrained, exact and non exact cases. These problems are particular cases of the two dimensional knapsack problems. We also present new models to generate these cutting patterns, based on adaptations and extensions of models that generate one-group constrained two dimensional cutting patterns. Two stage patterns arise in different cutting processes like, for instance, in the furniture industry and wooden hardboards. The models are useful for the research and

  1. Solution of a Problem Linear Plane Elasticity with Mixed Boundary Conditions by the Method of Boundary Integrals

    Nahed S. Hussein

    2014-01-01

    Full Text Available A numerical boundary integral scheme is proposed for the solution to the system of …eld equations of plane. The stresses are prescribed on one-half of the circle, while the displacements are given. The considered problem with mixed boundary conditions in the circle is replaced by two problems with homogeneous boundary conditions, one of each type, having a common solution. The equations are reduced to a system of boundary integral equations, which is then discretized in the usual way, and the problem at this stage is reduced to the solution to a rectangular linear system of algebraic equations. The unknowns in this system of equations are the boundary values of four harmonic functions which define the full elastic solution and the unknown boundary values of stresses or displacements on proper parts of the boundary. On the basis of the obtained results, it is inferred that a stress component has a singularity at each of the two separation points, thought to be of logarithmic type. The results are discussed and boundary plots are given. We have also calculated the unknown functions in the bulk directly from the given boundary conditions using the boundary collocation method. The obtained results in the bulk are discussed and three-dimensional plots are given. A tentative form for the singular solution is proposed and the corresponding singular stresses and displacements are plotted in the bulk. The form of the singular tangential stress is seen to be compatible with the boundary values obtained earlier. The efficiency of the used numerical schemes is discussed.

  2. A Semi-linear Backward Parabolic Cauchy Problem with Unbounded Coefficients of Hamilton–Jacobi–Bellman Type and Applications to Optimal Control

    Addona, Davide, E-mail: d.addona@campus.unimib.it [Università degli Studi di Milano Bicocca, (MILANO BICOCCA) Dipartimento di Matematica (Italy)

    2015-08-15

    We obtain weighted uniform estimates for the gradient of the solutions to a class of linear parabolic Cauchy problems with unbounded coefficients. Such estimates are then used to prove existence and uniqueness of the mild solution to a semi-linear backward parabolic Cauchy problem, where the differential equation is the Hamilton–Jacobi–Bellman equation of a suitable optimal control problem. Via backward stochastic differential equations, we show that the mild solution is indeed the value function of the controlled equation and that the feedback law is verified.

  3. An Alternate Approach to Optimal L 2 -Error Analysis of Semidiscrete Galerkin Methods for Linear Parabolic Problems with Nonsmooth Initial Data

    Goswami, Deepjyoti

    2011-09-01

    In this article, we propose and analyze an alternate proof of a priori error estimates for semidiscrete Galerkin approximations to a general second order linear parabolic initial and boundary value problem with rough initial data. Our analysis is based on energy arguments without using parabolic duality. Further, it follows the spirit of the proof technique used for deriving optimal error estimates for finite element approximations to parabolic problems with smooth initial data and hence, it unifies both theories, that is, one for smooth initial data and other for nonsmooth data. Moreover, the proposed technique is also extended to a semidiscrete mixed method for linear parabolic problems. In both cases, optimal L2-error estimates are derived, when the initial data is in L2. A superconvergence phenomenon is also observed, which is then used to prove L∞-estimates for linear parabolic problems defined on two-dimensional spatial domain again with rough initial data. Copyright © Taylor & Francis Group, LLC.

  4. Semi-analog Monte Carlo (SMC) method for time-dependent non-linear three-dimensional heterogeneous radiative transfer problems

    Yun, Sung Hwan

    2004-02-01

    Radiative transfer is a complex phenomenon in which radiation field interacts with material. This thermal radiative transfer phenomenon is composed of two equations which are the balance equation of photons and the material energy balance equation. The two equations involve non-linearity due to the temperature and that makes the radiative transfer equation more difficult to solve. During the last several years, there have been many efforts to solve the non-linear radiative transfer problems by Monte Carlo method. Among them, it is known that Semi-Analog Monte Carlo (SMC) method developed by Ahrens and Larsen is accurate regard-less of the time step size in low temperature region. But their works are limited to one-dimensional, low temperature problems. In this thesis, we suggest some method to remove their limitations in the SMC method and apply to the more realistic problems. An initially cold problem was solved over entire temperature region by using piecewise linear interpolation of the heat capacity, while heat capacity is still fitted as a cubic curve within the lowest temperature region. If we assume the heat capacity to be linear in each temperature region, the non-linearity still remains in the radiative transfer equations. We then introduce the first-order Taylor expansion to linearize the non-linear radiative transfer equations. During the linearization procedure, absorption-reemission phenomena may be described by a conventional reemission time sampling scheme which is similar to the repetitive sampling scheme in particle transport Monte Carlo method. But this scheme causes significant stochastic errors, which necessitates many histories. Thus, we present a new reemission time sampling scheme which reduces stochastic errors by storing the information of absorption times. The results of the comparison of the two schemes show that the new scheme has less stochastic errors. Therefore, the improved SMC method is able to solve more realistic problems with

  5. Non-linear instability analysis of the two-dimensional Navier-Stokes equation: The Taylor-Green vortex problem

    Sengupta, Tapan K.; Sharma, Nidhi; Sengupta, Aditi

    2018-05-01

    An enstrophy-based non-linear instability analysis of the Navier-Stokes equation for two-dimensional (2D) flows is presented here, using the Taylor-Green vortex (TGV) problem as an example. This problem admits a time-dependent analytical solution as the base flow, whose instability is traced here. The numerical study of the evolution of the Taylor-Green vortices shows that the flow becomes turbulent, but an explanation for this transition has not been advanced so far. The deviation of the numerical solution from the analytical solution is studied here using a high accuracy compact scheme on a non-uniform grid (NUC6), with the fourth-order Runge-Kutta method. The stream function-vorticity (ψ, ω) formulation of the governing equations is solved here in a periodic square domain with four vortices at t = 0. Simulations performed at different Reynolds numbers reveal that numerical errors in computations induce a breakdown of symmetry and simultaneous fragmentation of vortices. It is shown that the actual physical instability is triggered by the growth of disturbances and is explained by the evolution of disturbance mechanical energy and enstrophy. The disturbance evolution equations have been traced by looking at (a) disturbance mechanical energy of the Navier-Stokes equation, as described in the work of Sengupta et al., "Vortex-induced instability of an incompressible wall-bounded shear layer," J. Fluid Mech. 493, 277-286 (2003), and (b) the creation of rotationality via the enstrophy transport equation in the work of Sengupta et al., "Diffusion in inhomogeneous flows: Unique equilibrium state in an internal flow," Comput. Fluids 88, 440-451 (2013).

  6. Spectral nodal methodology for multigroup slab-geometry discrete ordinates neutron transport problems with linearly anisotropic scattering

    Oliva, Amaury M.; Filho, Hermes A.; Silva, Davi M.; Garcia, Carlos R., E-mail: aoliva@iprj.uerj.br, E-mail: halves@iprj.uerj.br, E-mail: davijmsilva@yahoo.com.br, E-mail: cgh@instec.cu [Universidade do Estado do Rio de Janeiro (UERJ), Nova Friburgo, RJ (Brazil). Instituto Politecnico. Departamento de Modelagem Computacional; Instituto Superior de Tecnologias y Ciencias Aplicadas (InSTEC), La Habana (Cuba)

    2017-07-01

    In this paper, we propose a numerical methodology for the development of a method of the spectral nodal class that will generate numerical solutions free from spatial truncation errors. This method, denominated Spectral Deterministic Method (SDM), is tested as an initial study of the solutions (spectral analysis) of neutron transport equations in the discrete ordinates (S{sub N}) formulation, in one-dimensional slab geometry, multigroup approximation, with linearly anisotropic scattering, considering homogeneous and heterogeneous domains with fixed source. The unknowns in the methodology are the cell-edge, and cell average angular fluxes, the numerical values calculated for these quantities coincide with the analytic solution of the equations. These numerical results are shown and compared with the traditional ne- mesh method Diamond Difference (DD) and the coarse-mesh method spectral Green's function (SGF) to illustrate the method's accuracy and stability. The solution algorithms problems are implemented in a computer simulator made in C++ language, the same that was used to generate the results of the reference work. (author)

  7. Goertler vortices in growing boundary layers: The leading edge receptivity problem, linear growth and the nonlinear breakdown stage

    Hall, Philip

    1989-01-01

    Goertler vortices are thought to be the cause of transition in many fluid flows of practical importance. A review of the different stages of vortex growth is given. In the linear regime, nonparallel effects completely govern this growth, and parallel flow theories do not capture the essential features of the development of the vortices. A detailed comparison between the parallel and nonparallel theories is given and it is shown that at small vortex wavelengths, the parallel flow theories have some validity; otherwise nonparallel effects are dominant. New results for the receptivity problem for Goertler vortices are given; in particular vortices induced by free stream perturbations impinging on the leading edge of the walls are considered. It is found that the most dangerous mode of this type can be isolated and it's neutral curve is determined. This curve agrees very closely with the available experimental data. A discussion of the different regimes of growth of nonlinear vortices is also given. Again it is shown that, unless the vortex wavelength is small, nonparallel effects are dominant. Some new results for nonlinear vortices of 0(1) wavelengths are given and compared to experimental observations.

  8. New results on the mathematical problems in nonlinear physics; Nuevos resultados sobre problemas matematicos en fisica no-linear

    NONE

    1980-07-01

    The main topics treated in this report are: I) Existence of generalized Lagrangians. II) Conserved densities for odd-order polynomial evolution equations and linear evolution systems. III ) Conservation laws for Klein-Gordon, Di rae and Maxwell equations. IV) Stability conditions for finite-energy solutions of a non-linear Klein-Gordon equation. V) Hamiltonian approach to non-linear evolution equations and Backlund transformations. VI) Anharmonic vibrations: Status of results and new possible approaches. (Author) 83 refs.

  9. Constrained non-linear optimization in 3D reflexion tomography; Problemes d'optimisation non-lineaire avec contraintes en tomographie de reflexion 3D

    Delbos, F.

    2004-11-01

    Reflexion tomography allows the determination of a subsurface velocity model from the travel times of seismic waves. The introduction of a priori information in this inverse problem can lead to the resolution of a constrained non-linear least-squares problem. The goal of the thesis is to improve the resolution techniques of this optimization problem, whose main difficulties are its ill-conditioning, its large scale and an expensive cost function in terms of CPU time. Thanks to a detailed study of the problem and to numerous numerical experiments, we justify the use of a sequential quadratic programming method, in which the tangential quadratic programs are solved by an original augmented Lagrangian method. We show the global linear convergence of the latter. The efficiency and robustness of the approach are demonstrated on several synthetic examples and on two real data cases. (author)

  10. Constrained non-linear optimization in 3D reflexion tomography; Problemes d'optimisation non-lineaire avec contraintes en tomographie de reflexion 3D

    Delbos, F

    2004-11-01

    Reflexion tomography allows the determination of a subsurface velocity model from the travel times of seismic waves. The introduction of a priori information in this inverse problem can lead to the resolution of a constrained non-linear least-squares problem. The goal of the thesis is to improve the resolution techniques of this optimization problem, whose main difficulties are its ill-conditioning, its large scale and an expensive cost function in terms of CPU time. Thanks to a detailed study of the problem and to numerous numerical experiments, we justify the use of a sequential quadratic programming method, in which the tangential quadratic programs are solved by an original augmented Lagrangian method. We show the global linear convergence of the latter. The efficiency and robustness of the approach are demonstrated on several synthetic examples and on two real data cases. (author)

  11. Problem Based Learning Technique and Its Effect on Acquisition of Linear Programming Skills by Secondary School Students in Kenya

    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…

  12. The Effects of the Concrete-Representational-Abstract Integration Strategy on the Ability of Students with Learning Disabilities to Multiply Linear Expressions within Area Problems

    Strickland, Tricia K.; Maccini, Paula

    2013-01-01

    We examined the effects of the Concrete-Representational-Abstract Integration strategy on the ability of secondary students with learning disabilities to multiply linear algebraic expressions embedded within contextualized area problems. A multiple-probe design across three participants was used. Results indicated that the integration of the…

  13. Existence of 2m-1 Positive Solutions for Sturm-Liouville Boundary Value Problems with Linear Functional Boundary Conditions on the Half-Line

    Yanmei Sun

    2012-01-01

    Full Text Available By using the Leggett-Williams fixed theorem, we establish the existence of multiple positive solutions for second-order nonhomogeneous Sturm-Liouville boundary value problems with linear functional boundary conditions. One explicit example with singularity is presented to demonstrate the application of our main results.

  14. Online Exhibits & Concept Maps

    Douma, M.

    2009-12-01

    Presenting the complexity of geosciences to the public via the Internet poses a number of challenges. For example, utilizing various - and sometimes redundant - Web 2.0 tools can quickly devour limited time. Do you tweet? Do you write press releases? Do you create an exhibit or concept map? The presentation will provide participants with a context for utilizing Web 2.0 tools by briefly highlighting methods of online scientific communication across several dimensions. It will address issues of: * breadth and depth (e.g. from narrow topics to well-rounded views), * presentation methods (e.g. from text to multimedia, from momentary to enduring), * sources and audiences (e.g. for experts or for the public, content developed by producers to that developed by users), * content display (e.g. from linear to non-linear, from instructive to entertaining), * barriers to entry (e.g. from an incumbent advantage to neophyte accessible, from amateur to professional), * cost and reach (e.g. from cheap to expensive), and * impact (e.g. the amount learned, from anonymity to brand awareness). Against this backdrop, the presentation will provide an overview of two methods of online information dissemination, exhibits and concept maps, using the WebExhibits online museum (www.webexhibits.org) and SpicyNodes information visualization tool (www.spicynodes.org) as examples, with tips on how geoscientists can use either to communicate their science. Richly interactive online exhibits can serve to engage a large audience, appeal to visitors with multiple learning styles, prompt exploration and discovery, and present a topic’s breadth and depth. WebExhibits, which was among the first online museums, delivers interactive information, virtual experiments, and hands-on activities to the public. While large, multidisciplinary exhibits on topics like “Color Vision and Art” or “Calendars Through the Ages” require teams of scholars, user interface experts, professional writers and editors

  15. Use Residual Correction Method and Monotone Iterative Technique to Calculate the Upper and Lower Approximate Solutions of Singularly Perturbed Non-linear Boundary Value Problems

    Chi-Chang Wang

    2013-09-01

    Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.

  16. Numerical solution to a multi-dimensional linear inverse heat conduction problem by a splitting-based conjugate gradient method

    Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem

    2008-01-01

    In this paper we consider a multi-dimensional inverse heat conduction problem with time-dependent coefficients in a box, which is well-known to be severely ill-posed, by a variational method. The gradient of the functional to be minimized is obtained by aids of an adjoint problem and the conjugate gradient method with a stopping rule is then applied to this ill-posed optimization problem. To enhance the stability and the accuracy of the numerical solution to the problem we apply this scheme to the discretized inverse problem rather than to the continuous one. The difficulties with large dimensions of discretized problems are overcome by a splitting method which only requires the solution of easy-to-solve one-dimensional problems. The numerical results provided by our method are very good and the techniques seem to be very promising.

  17. Unique solvability of some two-point boundary value problems for linear functional differential equations with singularities

    Rontó, András; Samoilenko, A. M.

    2007-01-01

    Roč. 41, - (2007), s. 115-136 ISSN 1512-0015 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : two-point problem * functional differential equation * singular boundary problem Subject RIV: BA - General Mathematics

  18. A Test of a Linear Programming Model as an Optimal Solution to the Problem of Combining Methods of Reading Instruction

    Mills, James W.; And Others

    1973-01-01

    The Study reported here tested an application of the Linear Programming Model at the Reading Clinic of Drew University. Results, while not conclusive, indicate that this approach yields greater gains in speed scores than a traditional approach for this population. (Author)

  19. Riemann-problem and level-set approaches for two-fluid flow computations I. Linearized Godunov scheme

    B. Koren (Barry); M.R. Lewis; E.H. van Brummelen (Harald); B. van Leer

    2001-01-01

    textabstractA finite-volume method is presented for the computation of compressible flows of two immiscible fluids at very different densities. The novel ingredient in the method is a two-fluid linearized Godunov scheme, allowing for flux computations in case of different fluids (e.g., water and

  20. Linearly constrained minimax optimization

    Madsen, Kaj; Schjær-Jacobsen, Hans

    1978-01-01

    We present an algorithm for nonlinear minimax optimization subject to linear equality and inequality constraints which requires first order partial derivatives. The algorithm is based on successive linear approximations to the functions defining the problem. The resulting linear subproblems...

  1. LS-APC v1.0: a tuning-free method for the linear inverse problem and its application to source-term determination

    Tichý, Ondřej; Šmídl, Václav; Hofman, Radek; Stohl, A.

    2016-01-01

    Roč. 9, č. 11 (2016), s. 4297-4311 ISSN 1991-959X R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Linear inverse problem * Bayesian regularization * Source-term determination * Variational Bayes method Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 3.458, year: 2016 http://library.utia.cas.cz/separaty/2016/AS/tichy-0466029.pdf

  2. A linear programming manual

    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.

  3. Britain exhibition at CERN

    Bertin; CERN PhotoLab

    1969-01-01

    The United Kingdom inaugurated the Industrial Exhibitions in 1968, and it wasn't till 1971 that other countries staged exhibitions at CERN. This photo was taken in 1969, at the second British exhibition, where 16 companies were present.

  4. A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity

    Mercier, Sylvain; Gratton, Serge; Tardieu, Nicolas; Vasseur, Xavier

    2017-12-01

    Many applications in structural mechanics require the numerical solution of sequences of linear systems typically issued from a finite element discretization of the governing equations on fine meshes. The method of Lagrange multipliers is often used to take into account mechanical constraints. The resulting matrices then exhibit a saddle point structure and the iterative solution of such preconditioned linear systems is considered as challenging. A popular strategy is then to combine preconditioning and deflation to yield an efficient method. We propose an alternative that is applicable to the general case and not only to matrices with a saddle point structure. In this approach, we consider to update an existing algebraic or application-based preconditioner, using specific available information exploiting the knowledge of an approximate invariant subspace or of matrix-vector products. The resulting preconditioner has the form of a limited memory quasi-Newton matrix and requires a small number of linearly independent vectors. Numerical experiments performed on three large-scale applications in elasticity highlight the relevance of the new approach. We show that the proposed method outperforms the deflation method when considering sequences of linear systems with varying matrices.

  5. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs

    Stolpe, Mathias

    2004-01-01

    of structures subjected to either static or periodic loads, design of composite materials with prescribed homogenized properties using the inverse homogenization approach, optimization of fluids in Stokes flow, design of band gap structures, and multi-physics problems involving coupled steady-state heat...

  6. On the reformulation of topology optimization problems as linear or convex quadratic mixed 0–1 programs

    Stolpe, Mathias

    2007-01-01

    of structures subjected to static or periodic loads, design of composite materials with prescribed homogenized properties using the inverse homogenization approach, optimization of fluids in Stokes flow, design of band gap structures, and multi-physics problems involving coupled steady-state heat conduction...

  7. Solvability conditions of the Cauchy problem for two-dimensional systems of linear functional differential equations with monotone operators

    Šremr, Jiří

    2007-01-01

    Roč. 132, č. 3 (2007), s. 263-295 ISSN 0862-7959 R&D Projects: GA ČR GP201/04/P183 Institutional research plan: CEZ:AV0Z10190503 Keywords : system of functional differential equations with monotone operators * initial value problem * unique solvability Subject RIV: BA - General Mathematics

  8. Critical system issues and modeling requirements - the problem of beam energy sweep in an electron linear induction accelerator

    Turner, W.C.; Barrett, D.M.; Sampayan, S.E.

    1991-01-01

    In this paper the authors attempt to motivate the development of modeling tools for linear induction accelerator components by giving examples of performance limitations related to energy sweep. The most pressing issues is the development of an accurate model of the switching behavior of large magnetic cores at high dB/dt in the accelerator and magnetic compression modulators. Ideally one would like to have a model with as few parameters as possible that allows the user to choose the core geometry and magnetic material and perhaps a few parameters characterizing the switch model. Beyond this, the critical modeling tasks are: simulation of a magnetic compression modulator, modeling the reset dynamics of a magnetic compression modulator, modeling the loading characteristics of a linear induction accelerator cell, and modeling the electron injector current including the dynamics of feedback modulation and beam loading in an accelerator cell. Of course in the development of these models care should be given to benchmarking them against data from experimental systems. Beyond that one should aim for tools that have predictive power so that they can be used as design tools and not merely to replicate existing data

  9. Some contributions to non-linear physic: Mathematical problems; Contribuciones a problemas matematicos en fisica no-lineal

    NONE

    1981-07-01

    The main results contained in this report are the following: i ) Lagrangian universality holds in a precisely defined weak sense. II ) Isolation of 5th order polynomial evolution equations having high order conservation laws. III ) Hamiltonian formulation of a wide class of non-linear evolution equations. IV) Some properties of the symmetries of Gardner-like systems. v) Characterization of the range and Kernel of {zeta}/{zeta} u{sub {alpha}}, |{alpha} | - 1. vi) A generalized variational approach and application to the anharmonic oscillator. v II ) Relativistic correction and quasi-classical approximation to the anechoic oscillator. VII ) Properties of a special class of 6th-order anharmonic oscillators. ix) A new method for constructing conserved densities In PDE. (Author) 97 refs.

  10. A COMPARATIVE STUDY ON MULTI-SWARM OPTIMISATION AND BAT ALGORITHM FOR UNCONSTRAINED NON LINEAR OPTIMISATION PROBLEMS

    Evans BAIDOO

    2016-12-01

    Full Text Available A study branch that mocks-up a population of network of swarms or agents with the ability to self-organise is Swarm intelligence. In spite of the huge amount of work that has been done in this area in both theoretically and empirically and the greater success that has been attained in several aspects, it is still ongoing and at its infant stage. An immune system, a cloud of bats, or a flock of birds are distinctive examples of a swarm system. . In this study, two types of meta-heuristics algorithms based on population and swarm intelligence - Multi Swarm Optimization (MSO and Bat algorithms (BA - are set up to find optimal solutions of continuous non-linear optimisation models. In order to analyze and compare perfect solutions at the expense of performance of both algorithms, a chain of computational experiments on six generally used test functions for assessing the accuracy and the performance of algorithms, in swarm intelligence fields are used. Computational experiments show that MSO algorithm seems much superior to BA.

  11. Utilizing a Coupled Nonlinear Schrödinger Model to Solve the Linear Modal Problem for Stratified Flows

    Liu, Tianyang; Chan, Hiu Ning; Grimshaw, Roger; Chow, Kwok Wing

    2017-11-01

    The spatial structure of small disturbances in stratified flows without background shear, usually named the `Taylor-Goldstein equation', is studied by employing the Boussinesq approximation (variation in density ignored except in the buoyancy). Analytical solutions are derived for special wavenumbers when the Brunt-Väisälä frequency is quadratic in hyperbolic secant, by comparison with coupled systems of nonlinear Schrödinger equations intensively studied in the literature. Cases of coupled Schrödinger equations with four, five and six components are utilized as concrete examples. Dispersion curves for arbitrary wavenumbers are obtained numerically. The computations of the group velocity, second harmonic, induced mean flow, and the second derivative of the angular frequency can all be facilitated by these exact linear eigenfunctions of the Taylor-Goldstein equation in terms of hyperbolic function, leading to a cubic Schrödinger equation for the evolution of a wavepacket. The occurrence of internal rogue waves can be predicted if the dispersion and cubic nonlinearity terms of the Schrödinger equations are of the same sign. Partial financial support has been provided by the Research Grants Council contract HKU 17200815.

  12. LS-APC v1.0: a tuning-free method for the linear inverse problem and its application to source-term determination

    O. Tichý

    2016-11-01

    Full Text Available Estimation of pollutant releases into the atmosphere is an important problem in the environmental sciences. It is typically formalized as an inverse problem using a linear model that can explain observable quantities (e.g., concentrations or deposition values as a product of the source-receptor sensitivity (SRS matrix obtained from an atmospheric transport model multiplied by the unknown source-term vector. Since this problem is typically ill-posed, current state-of-the-art methods are based on regularization of the problem and solution of a formulated optimization problem. This procedure depends on manual settings of uncertainties that are often very poorly quantified, effectively making them tuning parameters. We formulate a probabilistic model, that has the same maximum likelihood solution as the conventional method using pre-specified uncertainties. Replacement of the maximum likelihood solution by full Bayesian estimation also allows estimation of all tuning parameters from the measurements. The estimation procedure is based on the variational Bayes approximation which is evaluated by an iterative algorithm. The resulting method is thus very similar to the conventional approach, but with the possibility to also estimate all tuning parameters from the observations. The proposed algorithm is tested and compared with the standard methods on data from the European Tracer Experiment (ETEX where advantages of the new method are demonstrated. A MATLAB implementation of the proposed algorithm is available for download.

  13. LS-APC v1.0: a tuning-free method for the linear inverse problem and its application to source-term determination

    Tichý, Ondřej; Šmídl, Václav; Hofman, Radek; Stohl, Andreas

    2016-11-01

    Estimation of pollutant releases into the atmosphere is an important problem in the environmental sciences. It is typically formalized as an inverse problem using a linear model that can explain observable quantities (e.g., concentrations or deposition values) as a product of the source-receptor sensitivity (SRS) matrix obtained from an atmospheric transport model multiplied by the unknown source-term vector. Since this problem is typically ill-posed, current state-of-the-art methods are based on regularization of the problem and solution of a formulated optimization problem. This procedure depends on manual settings of uncertainties that are often very poorly quantified, effectively making them tuning parameters. We formulate a probabilistic model, that has the same maximum likelihood solution as the conventional method using pre-specified uncertainties. Replacement of the maximum likelihood solution by full Bayesian estimation also allows estimation of all tuning parameters from the measurements. The estimation procedure is based on the variational Bayes approximation which is evaluated by an iterative algorithm. The resulting method is thus very similar to the conventional approach, but with the possibility to also estimate all tuning parameters from the observations. The proposed algorithm is tested and compared with the standard methods on data from the European Tracer Experiment (ETEX) where advantages of the new method are demonstrated. A MATLAB implementation of the proposed algorithm is available for download.

  14. Digital collections and exhibits

    Denzer, Juan

    2015-01-01

    Today's libraries are taking advantage of cutting-edge technologies such as flat panel displays using touch, sound, and hands-free motions to design amazing exhibits using everything from simple computer hardware to advanced technologies such as the Microsoft Kinect. Libraries of all types are striving to add new interactive experiences for their patrons through exciting digital exhibits, both online and off. Digital Collections and Exhibits takes away the mystery of designing stunning digital exhibits to spotlight library trea

  15. Exhibiting Epistemic Objects

    Tybjerg, Karin

    2017-01-01

    of exhibiting epistemic objects that utilize their knowledge-generating potential and allow them to continue to stimulate curiosity and generate knowledge in the exhibition. The epistemic potential of the objects can then be made to work together with the function of the exhibition as a knowledge-generating set...

  16. Discrimination? - Exhibition of posters

    Jakimovska, Jana

    2017-01-01

    Participation in the exhibition with the students form the Art Academy. The exhibition consisted of 15 posters tackling the subjects of hate speech and discrimination. The exhibition happened thanks to the invitation of the Faculty of Law at UGD, and it was a part of a larger event of launching books on the aforementioned subjects.

  17. Shielding problems set by the use of a natural uranium target with a linear electron accelerator. Shielding and safety systems necessary

    Vialettes, Henry; Rocchesani, Jean; Lemure, Pierre

    1971-06-01

    The use of a natural uranium target for neutron production with a linear electron accelerator set special shielding problems due to the fact that, to standard photonuclear reactions, are added photoneutron induced photofission reactions giving rise to fission products of which the untimely liberation could cause very serious contamination problems. On the occasion of a recent accident on the target used with the Saclay 60 MeV linear accelerator, activity measurements were carried out on a certain number of samples taken. This revealed the presence of some twenty radionuclides of hall-lives between 30 minutes and 30 years and of activities such that the combustion of 1 g of target would release about 30 mCi of fission products of medium and short half-life (over 1 hour), This figure shows the magnitude of a contamination accident on a unit of this type, which is why the present report describes the systems to be employed in order on the one hand to detect the appearance of contamination as quickly as possible, and on the other hand to channel and retain this contamination so as to avoid a personnel contamination accident and/or the spread of contamination towards the outside [fr

  18. Linear algebra

    Edwards, Harold M

    1995-01-01

    In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject

  19. Exhibition; Image display agency

    Normazlin Ismail

    2008-01-01

    This article touches on the role of Malaysian Nuclear Agency as nuclear research institutions to promote, develop and encourage the peaceful uses of nuclear technology in its agricultural, medical, manufacturing, industrial, health and environment for the development of the country running successfully. Maturity of Malaysian Nuclear Agency in dealing with nuclear technology that are very competitive and globalization cannot be denied. On this basis Malaysian Nuclear Agency was given the responsibility to strengthen the nuclear technology in Malaysia. One way is through an exhibition featuring the research, discoveries and new technology products of the nuclear technology. Through this exhibition is to promote the nuclear technology and introduce the image of the agency in the public eye. This article also states a number of exhibits entered by the Malaysian Nuclear Agency and achievements during the last exhibition. Authors hope that the exhibition can be intensified further in the future.

  20. Classifying Linear Canonical Relations

    Lorand, Jonathan

    2015-01-01

    In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an elementary introduction to the theory of linear canonical relations and present partial results toward the classification problem. This exposition should be accessible to undergraduate students with a basic familiarity with linear algebra.

  1. Council Chamber exhibition

    CERN Bulletin

    2010-01-01

    To complete the revamp of CERN’s Council Chamber, a new exhibition is being installed just in time for the June Council meetings.   Panels will showcase highlights of CERN’s history, using some of the content prepared for the exhibitions marking 50 years of the PS, which were displayed in the main building last November. The previous photo exhibition in the Council Chamber stopped at the 1970s. To avoid the new panels becoming quickly out of date, photos are grouped together around specific infrastructures, rather than following a classic time-line. “We have put the focus on the accelerators – the world-class facilities that CERN has been offering researchers over the years, from the well-known large colliders to the lesser-known smaller facilities,” says Emma Sanders, who worked on the content. The new exhibition will be featured in a future issue of the Bulletin with photos and an interview with Fabienne Marcastel, designer of the exhibit...

  2. EXHIBITION: Accelerated Particles

    2004-01-01

    An exhibition of plastic arts and two evenings of performances by sound and visual artists as part of CERN's 50th anniversary celebrations. Fifty candles for CERN, an international laboratory renowned for fundamental research, is a cause for celebration. Since March this year, Geneva and neighbouring parts of France have been the venues for a wealth of small and large-scale events, which will continue until November. Given CERN's location in the commune of Meyrin, the ForuMeyrin is hosting exhibitions of plastic arts and performances entitled: Accelerated Particles. Several works will be exhibited and performed in two 'salons'. Salon des matières: An exhibition of plastic arts From Tues 12 October to Wed 3 November 2004 Tuesdays to Fridays: 16:00 to 19:00 Saturdays: 14:00 to 18:00 Exhibition open late on performance nights, entrance free Salon des particules: Musical and visual performances Tues 12 and Mon 25 October from 20:00 to 23:00 Preview evening for both events: Tues 12 October from 18:...

  3. Accurate Solution of Multi-Region Continuum Biomolecule Electrostatic Problems Using the Linearized Poisson-Boltzmann Equation with Curved Boundary Elements

    Altman, Michael D.; Bardhan, Jaydeep P.; White, Jacob K.; Tidor, Bruce

    2009-01-01

    We present a boundary-element method (BEM) implementation for accurately solving problems in biomolecular electrostatics using the linearized Poisson–Boltzmann equation. Motivating this implementation is the desire to create a solver capable of precisely describing the geometries and topologies prevalent in continuum models of biological molecules. This implementation is enabled by the synthesis of four technologies developed or implemented specifically for this work. First, molecular and accessible surfaces used to describe dielectric and ion-exclusion boundaries were discretized with curved boundary elements that faithfully reproduce molecular geometries. Second, we avoided explicitly forming the dense BEM matrices and instead solved the linear systems with a preconditioned iterative method (GMRES), using a matrix compression algorithm (FFTSVD) to accelerate matrix-vector multiplication. Third, robust numerical integration methods were employed to accurately evaluate singular and near-singular integrals over the curved boundary elements. Finally, we present a general boundary-integral approach capable of modeling an arbitrary number of embedded homogeneous dielectric regions with differing dielectric constants, possible salt treatment, and point charges. A comparison of the presented BEM implementation and standard finite-difference techniques demonstrates that for certain classes of electrostatic calculations, such as determining absolute electrostatic solvation and rigid-binding free energies, the improved convergence properties of the BEM approach can have a significant impact on computed energetics. We also demonstrate that the improved accuracy offered by the curved-element BEM is important when more sophisticated techniques, such as non-rigid-binding models, are used to compute the relative electrostatic effects of molecular modifications. In addition, we show that electrostatic calculations requiring multiple solves using the same molecular geometry

  4. EXHIBITION: Accelerated Particles

    2004-01-01

    http://www.cern.ch/cern50/ An exhibition of plastic arts and two evenings of performances by sound and visual artists as part of CERN's fiftieth anniversary celebrations. The fiftieth anniversary of a world famous organization like CERN, an international laboratory specializing in fundamental research, is a cause for celebration. Since March this year, Geneva and neighbouring parts of France have been the venues for a wealth of small and large-scale events, which will continue until November. Given CERN's location in the commune of Meyrin, the ForuMeyrin is hosting two "salons" consisting of an exhibition of plastic arts and evenings of music and visual arts performances with the collective title of "Accelerated Particles". Several works will be exhibited and performed. Salon des matières: An exhibition of plastic arts Until Wednesday 3 November 2004. Tuesdays to Fridays: 4.00 p.m. to 7.00 p.m. Saturdays: 2.00 p.m. to 6.00 p.m. Doors open late on the evening of the performances. Salon des ...

  5. Study of the morphology exhibited by linear segmented polyurethanes

    Pereira, I.M.; Orefice, R.L.

    2009-01-01

    Five series of segmented polyurethanes with different hard segment content were prepared by the prepolymer mixing method. The nano-morphology of the obtained polyurethanes and their microphase separation were investigated by infrared spectroscopy, modulated differential scanning calorimetry and small-angle X-ray scattering. Although highly hydrogen bonded hard segments were formed, high hard segment contents promoted phase mixture and decreased the chain mobility, decreasing the hard segment domain precipitation and the soft segments crystallization. The applied techniques were able to show that the hard-segment content and the hard-segment interactions were the two controlling factors for determining the structure of segmented polyurethanes. (author)

  6. Linear collider: a preview

    Wiedemann, H.

    1981-11-01

    Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center.

  7. Linear collider: a preview

    Wiedemann, H.

    1981-11-01

    Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center

  8. International Space Station exhibit

    2000-01-01

    The International Space Station (ISS) exhibit in StenniSphere at John C. Stennis Space Center in Hancock County, Miss., gives visitors an up-close look at the largest international peacetime project in history. Step inside a module of the ISS and glimpse how astronauts will live and work in space. Currently, 16 countries contribute resources and hardware to the ISS. When complete, the orbiting research facility will be larger than a football field.

  9. Upcycling CERN Exhibitions

    Katarina Anthony

    2015-01-01

    Summer is coming - and with it, a new Microcosm exhibition showcasing CERN (see here). But while the new exhibit is preparing to enchant visitors, many have been asking about the site's former content. Will it simply be out with the old and in with the new? Not as such!   The plasma ball from Microcosm is now on display at the LHCb site. As Microcosm's new content is moving in, its old content is moving up. From LHCb to IdeaSquare, former Microcosm displays and objects are being installed across the CERN site. "Microcosm featured many elements that were well suited to life outside of the exhibition," says Emma Sanders, Microcosm project leader in the EDU group. "We didn't want this popular content to go to waste, and so set out to find them new homes across CERN." The LHCb experiment has received a number of Microcosm favourites, including the Rutherford experiment, the cosmic ray display and the Thomson experiment. "We&...

  10. Artefact in Physiological Data Collected from Patients with Brain Injury: Quantifying the Problem and Providing a Solution Using a Factorial Switching Linear Dynamical Systems Approach.

    Georgatzis, Konstantinos; Lal, Partha; Hawthorne, Christopher; Shaw, Martin; Piper, Ian; Tarbert, Claire; Donald, Rob; Williams, Christopher K I

    2016-01-01

    High-resolution, artefact-free and accurately annotated physiological data are desirable in patients with brain injury both to inform clinical decision-making and for intelligent analysis of the data in applications such as predictive modelling. We have quantified the quality of annotation surrounding artefactual events and propose a factorial switching linear dynamical systems (FSLDS) approach to automatically detect artefact in physiological data collected in the neurological intensive care unit (NICU). Retrospective analysis of the BrainIT data set to discover potential hypotensive events corrupted by artefact and identify the annotation of associated clinical interventions. Training of an FSLDS model on clinician-annotated artefactual events in five patients with severe traumatic brain injury. In a subset of 187 patients in the BrainIT database, 26.5 % of potential hypotensive events were abandoned because of artefactual data. Only 30 % of these episodes could be attributed to an annotated clinical intervention. As assessed by the area under the receiver operating characteristic curve metric, FSLDS model performance in automatically identifying the events of blood sampling, arterial line damping and patient handling was 0.978, 0.987 and 0.765, respectively. The influence of artefact on physiological data collected in the NICU is a significant problem. This pilot study using an FSLDS approach shows real promise and is under further development.

  11. Miniaturized Stretchable and High-Rate Linear Supercapacitors

    Zhu, Wenjun; Zhang, Yang; Zhou, Xiaoshuang; Xu, Jiang; Liu, Zunfeng; Yuan, Ningyi; Ding, Jianning

    2017-07-01

    Linear stretchable supercapacitors have attracted much attention because they are well suited to applications in the rapidly expanding field of wearable electronics. However, poor conductivity of the electrode material, which limits the transfer of electrons in the axial direction of the linear supercapacitors, leads to a serious loss of capacity at high rates. To solve this problem, we use gold nanoparticles to decorate aligned multiwall carbon nanotube to fabricate stretchable linear electrodes. Furthermore, we have developed fine stretchable linear supercapacitors, which exhibited an extremely high elasticity up to 400% strain with a high capacitance of about 8.7 F g-1 at the discharge current of 1 A g-1.

  12. Mobile exhibition in Mexico

    NONE

    1960-04-15

    Since January this year, a mobile atomic energy exhibition has been touring the principal cities of Mexico. In organizing this exhibition, the National Nuclear Energy Commission of Mexico was assisted by the International Atomic Energy Agency which has placed its second mobile radioisotope laboratory at the disposal of the Mexican authorities. In many States of the Republic, the visit of the mobile laboratory has given a powerful impetus to atomic training and research. Universities have made use of the laboratory for the training of young scientists in the basic isotope techniques. As a sequel to the work initiated with its aid, some universities are planning to start regular training courses in this field. The laboratory, which is a gift to the Agency from the United States, has been put to its first assignment in Mexico. It will shortly be sent to Argentina for a period of six months for use in training courses. IAEA's first mobile radioisotope unit, also donated by the United States, has been used for training purposes in Austria, the Federal Republic of Germany, Greece and Yugoslavia, and has now been sent to the Far East

  13. Mobile exhibition in Mexico

    1960-01-01

    Since January this year, a mobile atomic energy exhibition has been touring the principal cities of Mexico. In organizing this exhibition, the National Nuclear Energy Commission of Mexico was assisted by the International Atomic Energy Agency which has placed its second mobile radioisotope laboratory at the disposal of the Mexican authorities. In many States of the Republic, the visit of the mobile laboratory has given a powerful impetus to atomic training and research. Universities have made use of the laboratory for the training of young scientists in the basic isotope techniques. As a sequel to the work initiated with its aid, some universities are planning to start regular training courses in this field. The laboratory, which is a gift to the Agency from the United States, has been put to its first assignment in Mexico. It will shortly be sent to Argentina for a period of six months for use in training courses. IAEA's first mobile radioisotope unit, also donated by the United States, has been used for training purposes in Austria, the Federal Republic of Germany, Greece and Yugoslavia, and has now been sent to the Far East

  14. Anniversary Exhibition. Nechvolodov.

    - -

    2006-03-01

    Full Text Available On the 10th of August, 2005 in Tartu (the second biggest educational and cultural city in Estonia Stanislav Nechvolodov's exhibition was opened to show the 5-year cycle of his work, traditional for the author and his admirers. At the opening ceremony Nechvolodov said that the exhibition was the last one and appointed on his 70th anniversary.The architectural and building society in Irkutsk remembers Stanislav Nechvolodov as an architect working on dwelling and civil buildings in 1960-70s. Below are some extracts from the Estonian press.«Postimees» newspaper, December 1993. The interview «Expressionistic naturalist, conservative Nechvolodov» by journalist Eric Linnumyagi. He asks about all the details and describes the troubles experienced by Nechvolodov during the perestroika period in Estonia, for example: the Tartu University refused to install the sculpture of Socrat, the art school refused to engage him as an instructor, the sculpture of Socrat moved to Vrotzlav, Poland, and Nechvolodov moved to Poland to read lectures there.«Tartu» newspaper, November 2000. Mats Oun, artist, says in the article «Nechvolodov: a man of Renaissance»: «Nechvolodov works in Estonia, his works are placed in many local and foreign museums. Regardless some insignificant faults, he deserves a high estimation, and his manysided open exhibition can be an example for other artists. He is a man of Renaissance».

  15. Effectiveness in improving knowledge, practices, and intakes of "key problem nutrients" of a complementary feeding intervention developed by using linear programming: experience in Lombok, Indonesia.

    Fahmida, Umi; Kolopaking, Risatianti; Santika, Otte; Sriani, Sriani; Umar, Jahja; Htet, Min Kyaw; Ferguson, Elaine

    2015-03-01

    Complementary feeding recommendations (CFRs) with the use of locally available foods can be developed by using linear programming (LP). Although its potential has been shown for planning phases of food-based interventions, the effectiveness in the community setting has not been tested to our knowledge. We aimed to assess effectiveness of promoting optimized CFRs for improving maternal knowledge, feeding practices, and child intakes of key problem nutrients (calcium, iron, niacin, and zinc). A community-intervention trial with a quasi-experimental design was conducted in East Lombok, West Nusa Tenggara Province, Indonesia, on children aged 9-16 mo at baseline. A CFR group (n = 240) was compared with a non-CFR group (n = 215). The CFRs, which were developed using LP, were promoted in an intervention that included monthly cooking sessions and weekly home visits. The mother's nutrition knowledge and her child's feeding practices and the child's nutrient intakes were measured before and after the 6-mo intervention by using a structured interview, 24-h recall, and 1-wk food-frequency questionnaire. The CFR intervention improved mothers' knowledge and children's feeding practices and improved children's intakes of calcium, iron, and zinc. At the end line, median (IQR) nutrient densities were significantly higher in the CFR group than in the non-CFR group for iron [i.e., 0.6 mg/100 kcal (0.4-0.8 mg/100 kcal) compared with 0.5 mg/100 kcal (0.4-0.7 mg/100 kcal)] and niacin [i.e., 0.8 mg/100 kcal (0.5-1.0 mg/100 kcal) compared with 0.6 mg/100 kcal (0.4-0.8 mg/100 kcal)]. However, median nutrient densities for calcium, iron, niacin, and zinc in the CFR group (23, 0.6, 0.7, and 0.5 mg/100 kcal, respectively) were still below desired densities (63, 1.0, 0.9, and 0.6 mg/100 kcal, respectively). The CFRs significantly increased intakes of calcium, iron, niacin, and zinc, but nutrient densities were still below desired nutrient densities. When the adoption of optimized CFRs is

  16. ON THE APPLICATION OF THE METHOD OF B.G. GALERKIN TO LINEAR PROBLEMS ARISING FROM DYNAMICAL SYSTEMS WITH DISTRIBUTED PARAMETERS

    Gurevich, S. G.

    1955-07-01

    Galerkin's method is applied to the solution of a linear partial differential equation of arbitrary order under specified initial and boundary conditions. An example is carried through in complete detail to illustrate the method. (auth)

  17. The presentation of energy topics at exhibitions

    Moergeli, H.P.

    1984-01-01

    The author examines the problems confronting an electricity supply company when trying to communicate its energy policy to the general public at exhibitions and fairs. The company has to convey a message of reliable power supplies, increasing demand, the advantages of nuclear energy, the safe storage of radioactive waste and the need for new generating plants. The author describes some of the displays being used to attract the public to the Bern Power Stations stand at the Bern Exhibition 1984. (R.S.)

  18. Finite-dimensional linear algebra

    Gockenbach, Mark S

    2010-01-01

    Some Problems Posed on Vector SpacesLinear equationsBest approximationDiagonalizationSummaryFields and Vector SpacesFields Vector spaces Subspaces Linear combinations and spanning sets Linear independence Basis and dimension Properties of bases Polynomial interpolation and the Lagrange basis Continuous piecewise polynomial functionsLinear OperatorsLinear operatorsMore properties of linear operatorsIsomorphic vector spaces Linear operator equations Existence and uniqueness of solutions The fundamental theorem; inverse operatorsGaussian elimination Newton's method Linear ordinary differential eq

  19. Crows spontaneously exhibit analogical reasoning.

    Smirnova, Anna; Zorina, Zoya; Obozova, Tanya; Wasserman, Edward

    2015-01-19

    Analogical reasoning is vital to advanced cognition and behavioral adaptation. Many theorists deem analogical thinking to be uniquely human and to be foundational to categorization, creative problem solving, and scientific discovery. Comparative psychologists have long been interested in the species generality of analogical reasoning, but they initially found it difficult to obtain empirical support for such thinking in nonhuman animals (for pioneering efforts, see [2, 3]). Researchers have since mustered considerable evidence and argument that relational matching-to-sample (RMTS) effectively captures the essence of analogy, in which the relevant logical arguments are presented visually. In RMTS, choice of test pair BB would be correct if the sample pair were AA, whereas choice of test pair EF would be correct if the sample pair were CD. Critically, no items in the correct test pair physically match items in the sample pair, thus demanding that only relational sameness or differentness is available to support accurate choice responding. Initial evidence suggested that only humans and apes can successfully learn RMTS with pairs of sample and test items; however, monkeys have subsequently done so. Here, we report that crows too exhibit relational matching behavior. Even more importantly, crows spontaneously display relational responding without ever having been trained on RMTS; they had only been trained on identity matching-to-sample (IMTS). Such robust and uninstructed relational matching behavior represents the most convincing evidence yet of analogical reasoning in a nonprimate species, as apes alone have spontaneously exhibited RMTS behavior after only IMTS training. Copyright © 2015 Elsevier Ltd. All rights reserved.

  20. Piecewise linear regression splines with hyperbolic covariates

    Cologne, John B.; Sposto, Richard

    1992-09-01

    Consider the problem of fitting a curve to data that exhibit a multiphase linear response with smooth transitions between phases. We propose substituting hyperbolas as covariates in piecewise linear regression splines to obtain curves that are smoothly joined. The method provides an intuitive and easy way to extend the two-phase linear hyperbolic response model of Griffiths and Miller and Watts and Bacon to accommodate more than two linear segments. The resulting regression spline with hyperbolic covariates may be fit by nonlinear regression methods to estimate the degree of curvature between adjoining linear segments. The added complexity of fitting nonlinear, as opposed to linear, regression models is not great. The extra effort is particularly worthwhile when investigators are unwilling to assume that the slope of the response changes abruptly at the join points. We can also estimate the join points (the values of the abscissas where the linear segments would intersect if extrapolated) if their number and approximate locations may be presumed known. An example using data on changing age at menarche in a cohort of Japanese women illustrates the use of the method for exploratory data analysis. (author)

  1. A primer on linear models

    Monahan, John F

    2008-01-01

    Preface Examples of the General Linear Model Introduction One-Sample Problem Simple Linear Regression Multiple Regression One-Way ANOVA First Discussion The Two-Way Nested Model Two-Way Crossed Model Analysis of Covariance Autoregression Discussion The Linear Least Squares Problem The Normal Equations The Geometry of Least Squares Reparameterization Gram-Schmidt Orthonormalization Estimability and Least Squares Estimators Assumptions for the Linear Mean Model Confounding, Identifiability, and Estimability Estimability and Least Squares Estimators F

  2. 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.

  3. Exhibition

    Staff Association

    2014-01-01

    Energie sombre, matière noire J.-J. Dalmais - J. Maréchal Du 11 au 27 novembre 2014, CERN Meyrin, Bâtiment principal A l’image des particules atomiques qui ont tissé des liens pour créer la matière, deux artistes haut bugistes croisent leurs regards et conjuguent leurs expressions singulières pour faire naître une vision commune de l’univers, produit des forces primordiales. Les sculptures de Jean-Jacques Dalmais et les peintures de Jacki Maréchal se rencontrent pour la première fois et se racontent par un enrichissement mutuel la belle histoire de la Vie. Dialogue magique des œuvres en mouvement qui questionnent en écho l’énergie sombre et la matière noire. Cette harmonieuse confluence de jeux de miroir et de résonnance illumine de poésie et de sobriété l’espace expos&...

  4. Exhibition

    Staff Association

    2017-01-01

    Gaïa Manuella Cany Du 10 au 28 avril 2017 CERN Meyrin, Bâtiment principal Oiseau - Manuella Cany. Tableaux abstraits inspirés de vues satellites ou photos prises du ciel. Certains sont à la frontière du figuratif alors que d'autres permettent de laisser libre cours à son imagination. Aux détails infinis, ces tableaux sont faits pour être vus de loin et de près grâce à une attention toute particulière apportée aux effets de matières et aux couleurs le long de volutes tantôt nuancées tantôt contrastées.   Pour plus d’informations : staff.association@cern.ch | Tél: 022 766 37 38

  5. Exhibition

    Staff Association

    2018-01-01

    En dehors des frontières Maxence Piquet Du 2 au 11 mai 2018 | CERN Meyrin, Bâtiment principal Exposition de peinture d'un artiste autodidacte Maxence Piquet (signature artiste M-P), avec différentes techniques (acrylique, huile, fusain, collage...) et sur différents supports. Un art souvent brut et parfois provoquant, avec des touches expressionnistes et cubistes principale origine de son art. Des œuvres souvent vivent et colorées... Cette exposition est la première en dehors d ses frontières Lorraine et a pour but de faire voyager son art au regard du plus grand nombre . Pour plus d’informations et demandes d’accès : staff.association@cern.ch | Tél: 022 766 37 38

  6. Exhibition

    Staff Association

    2016-01-01

    The Elementary Particles of Painting Alfonso Fratteggiani Bianchi and Ermanno Imbergamo From September 26 to October 7, 2016 CERN Meyrin, Main Building With intentions similar to those of CERN physicists, the artist Alfonso Fratteggiani Bianchi investigates the color pigment, studying its interaction with light and with the support on which it is deposited. He creates monochrome paintings by spreading the color pigment in the pure state on stones, without using glue or any other type of adhesive. With intentions similar to artists, the physicist Ermanno Imbergamo investigates the use of luminescent wavelength shifters, materials commonly used in Particle Physics, for art. He creates other monochrome artworks, which disclose further aspects of interaction among light, color pigments and support. For more information: staff.association@cern.ch | Tel: 022 767 28 19

  7. Exhibition

    Staff Association

    2016-01-01

    COLORATION Sandra Duchêne From September 5 to 16, 2016 CERN Meyrin, Main Building La recherche de l’Universel. Après tout ! C’est de l’Amour ! What else to say ? …La couleur, l’ENERGIE de la vie…

  8. Exhibition

    Staff Association

    2014-01-01

      Parallels vision Astronomical subjects which evoke extrasensory kinetic visions Alberto Di Fabio From 8 to 10 October, CERN Meyrin, Main Building In the framework of Italy@cern, the Staff Association presents Alberto Di Fabio. Di Fabio’s work is inspired by the fundamental laws of the physical world, as well as organic elements and their interrelation. His paintings and works on paper merge the worlds of art and science, depicting natural forms and biological structures in vivid colour and imaginative detail. For all additional information: staff.association@cern.ch | Tel: 022 767 28 19

  9. Exhibition

    Staff Association

    2017-01-01

    Le Point Isabelle Gailland Du 20 février au 3 mars 2017 CERN Meyrin, Bâtiment principal La Diagonale - Isabelle Gailland. Au départ, un toujours même point minuscule posé au centre de ce que la toile est un espace. Une réplique d'autres points, condensés, alignés, isolés, disséminés construiront dans leur extension, la ligne. Ces lignes, croisées, courbées, déviées, prolongées, seront la structure contenant et séparant la matière des couleurs. La rotation de chaque toile en cours d'exécution va offrir un accès illimité à la non-forme et à la forme. Le point final sera l'ouverture sur différents points de vue de ce que le point et la ligne sont devenus une représentation pour l'œil et l'im...

  10. Exhibition

    Staff Association

    2018-01-01

    La danse mécanique Daria Grigoryeva Du 22 mai au 1er juin 2018 | CERN Meyrin, Bâtiment principal La danse mécanique est une métaphore large. La mécanique établit les règles et les limites, les frontières dans lesquelles la vie et la créativité peuvent se développer. La musique est « mathématique », une poupée mécanique se tourne toujours dans la même direction, selon les règles prescrites par la nature les fleurs fleurissent au printemps. Même s'ils ne le voulaient pas. La participation à la "danse mécanique" est prédéterminée et inévitable. Il ne reste plus qu'à comprendre comment le faire "magnifiquement". En tout, il y a une signification cachée et un...

  11. Exhibition

    Staff Association

    2017-01-01

    Still Life Jérémy Bajulaz Du 25 septembre au 6 octobre 2017 CERN Meyrin, Main Building (Aubergine - Jérémy Bajulaz) Né en 1991 en Haute-Savoie, France. Diplômé de l'Ecole Emile Cohl à Lyon, Jérémy Bajulaz intègre en 2014 le programme d'artiste en résidence au Centre Genevois de Gravure Contemporaine. C'est là que son travail prendra corps, autour de la lumière et de ses vibrations aux travers de sujets comme le portrait et la nature morte, dans le souci de l'observation; le regard prenant une place importante dans le processus créatif. Lauréat 2017 du VII Premio AAAC, son travail a été présenté dans de nombreuses expositions collectives, en 2015 au Bâtiment d’Art Contemporain de Genève, en 2016 au 89e Salon de Lyon et du ...

  12. Exhibition

    Staff Association

    2017-01-01

    Œuvres recentes Fabienne Wyler Du 6 au 17 février 2017 CERN Meyrin, Bâtiment principal L'escalier du diable B - aquarelle, encre de Chine XLV - Fabienne Wyler. En relation avec certains procédés d’écriture contemporaine (par ex. Webern ou certaines musiques conçues par ordinateur), les compositions picturales de Fabienne Wyler s’élaborent à partir de « modules » (groupes de quadrangles) qu’elle reproduit en leur faisant subir toutes sortes de transformations et de déplacements : étirements, renversements, rotations, effet miroir, transpositions, déphasages, superpositions, etc., et ceci à toutes les échelles. Au fil des œuvres sont apparues des séries intitulées, Bifurcations, Intermittences, Attracteurs étranges, Polyrythmies. Ces titres ont un lien &e...

  13. Exhibition

    Staff Association

    2017-01-01

    Les vibrantes Patrick Robbe-Grillet Du 30 octobre au 10 novembre 2017 CERN Meyrin, Main Building Patrick Robbe-Grillet - Feux d'artifices Qui est Patrick Robbe-Grillet ? Artiste Franco-Suisse, né en 1968 à Genève. En recherche du sentiment de paix, autodidacte, après un séjour en Chine en 2000, puis au Japon en 2002, suivi d’un long questionnement, il trouve sa voie dans la peinture, élément libérateur de sa créativité et expression de sa sensibilité à fleur de peau. « La Chine m’a enseigné les courbes, les nuances. Le Japon, la ligne droite, la rigueur. » Vous avez su rendre visible l'invisible ! - commentaire de Monsieur Fawaz Gruosi Pour plus d’informations et demandes d’accès : staff.association@cern.ch | Tél : 022 766 37 38

  14. Exhibition

    Staff Association

    2017-01-01

    La couleur des jours oriSio Du 2 au 12 mai 2017 CERN Meyrin, Bâtiment principal oriSio - Motus Suite à un fort intérêt pour la Chine et une curiosité pour un médium très ancien, la laque ! Je réinterprète cet art à travers un style abstrait. Je présente ici des laques sur aluminium, travaillés au plasma et ensuite colorés à l’aide de pigments pour l’essentiel. Mes œuvres je les veux brutes, déchirées, évanescentes, gondolées, voire trouées mais avec une belle approche de profondeur de la couleur.   Pour plus d’informations : staff.association@cern.ch | Tél: 022 766 37 38

  15. Exhibition

    Staff Association

    2011-01-01

    Jan Hladky, physicien de l'Institut de Physique de l'Académie des Sciences de la République tchèque, et membre de la collaboration Alice, expose ses œuvres au Bâtiment principal du 20 avril au 6 mai. Son exposition est dédiée aux victimes du séisme de Sendai. Des copies de ses œuvres seront mises en vente et les sommes récoltées seront versées au profit des victimes.

  16. Exhibition

    Staff Association

    2016-01-01

    La mosaïque ou quand détruire permet de construire Lauren Decamps Du 28 novembre au 9 décembre 2016 CERN Meyrin, Bâtiment principal Paysage d'Amsterdam - Lauren Decamps On ne doit jamais rien détruire qu'on ne soit sûr de pouvoir remplacer aussi avantageusement " écrivait Plutarque dans ses Œuvres morales du 1er siècle après JC. L'artiste mosaïste Lauren Decamps adhère à cette idée et tente à sa manière de donner une nouvelle vie à ses matériaux en les taillant puis les réassemblant, créant ainsi des œuvres abstraites et figuratives.

  17. Exhibition

    Staff Association

    2017-01-01

    Firmament des toiles Joëlle Lalagüe Du 6 au 16 juin 2017 CERN Meyrin, Bâtiment principal Phylaë Voyage - Joëlle Lalagüe. Each picture is an invitation for a cosmic trip. This is a whispering of soul, which comes from origins. A symphony of the world, some notes of love, a harmony for us to fly to infinity. Pour plus d’informations et demandes d'accès : staff.association@cern.ch | Tél: 022 766 37 38

  18. Exhibition

    Staff Association

    2018-01-01

    Univers Du 9 au 20 avril 2018 | CERN Meyrin, Bâtiment principal Stéphanie Cousin Obsédée par les rêves, les mondes surréalistes et insolites, je m’empare de formes provenant des mes propres travaux photographiques ou d’images que je modifie et mixe. Je fais évoluer mes univers oniriques de femmes-animaux ainsi que mes espaces et natures imaginaires. Avec ma démarche artistique, je cherche à mettre en images nos rêves et nos cauchemars, l’irréel et le surréel, le mystique et les affres de notre inconscient. Je cherche à représenter tout ce qui sommeille au plus profond de nous-même à l’aide de symboles, parfois en utilisant des images de cultures ancestrales. Photographie-collage, je cherche à ajouter quelques notes à la définition de la photographie du 21iè...

  19. Exhibition

    Staff Association

    2017-01-01

    Harmonie Nathalie Lenoir Du 4 au 15 septembre 2017 CERN Meyrin, Bâtiment principal Peindre est un langage. Le tracé du pinceau sur le lin en est l'expression. A qui appartient un tableau en définitive ? A celui qui l'a peint ? A celui qui le regarde ? A celui qui l'emporte ? La peinture est une émotion partagée... Laissez-vous projeter de l'autre côté de la toile, prenez un moment pour rêver, en harmonie avec les éléments, parce-que la peinture parle à votre âme… Pour plus d’informations et demandes d’accès : staff.association@cern.ch | Tél : 022 766 37 38

  20. Exhibition

    Staff Association

    2018-01-01

    Cosmos KOLI Du 15 au 26 janvier 2018 CERN Meyrin, Main Building (Nébuleuse d'Orion- KOLI) KOLI, Artiste confirmé, diplômé de l’Académie de Beaux Arts de Tirana, depuis 26 ans en Suisse, où il a participé à maintes expositions collectives et organisé 10 expositions privées avec  beaucoup de succès, s’exprime actuellement dans un bonheur de couleur et de matières qui côtoient des hautes sphères… le cosmos ! Gagnant d’un premier prix lors d’une exposition collective organisée par le consulat Italien, il s’est installé au bord du lac dans le canton de Vaud où il vit depuis maintenant déjà 13 ans. www.kolicreation.com Pour plus d’informations et demandes d’accès : staff.association@cern.ch | T&eacut...

  1. Handling of computational in vitro/in vivo correlation problems by Microsoft Excel: IV. Generalized matrix analysis of linear compartment systems.

    Langenbucher, Frieder

    2005-01-01

    A linear system comprising n compartments is completely defined by the rate constants between any of the compartments and the initial condition in which compartment(s) the drug is present at the beginning. The generalized solution is the time profiles of drug amount in each compartment, described by polyexponential equations. Based on standard matrix operations, an Excel worksheet computes the rate constants and the coefficients, finally the full time profiles for a specified range of time values.

  2. Exhibition at the AAA library

    2013-01-01

    Sonnesgade 11 The exhibition at the AAA library presents selected work produced by students prior to the exhibition of installations in project and praxis constructing an archive at Sonnesgade 11. The exhibition at Sonnesgade 11 was the culmination of collaboration with SLETH architects and studio...

  3. Linear gate

    Suwono.

    1978-01-01

    A linear gate providing a variable gate duration from 0,40μsec to 4μsec was developed. The electronic circuity consists of a linear circuit and an enable circuit. The input signal can be either unipolar or bipolar. If the input signal is bipolar, the negative portion will be filtered. The operation of the linear gate is controlled by the application of a positive enable pulse. (author)

  4. Linear Accelerators

    Vretenar, M

    2014-01-01

    The main features of radio-frequency linear accelerators are introduced, reviewing the different types of accelerating structures and presenting the main characteristics aspects of linac beam dynamics

  5. Analysis of convergence for control problems governed by evolution ...

    The convergence of a scheme to minimize a class of a system of continuous optimal control problems characterized by a system of evolution equations and a system of linear inequality and equality constraints with multiplier imbedding is considered. The result is applied to some problems and the scheme is found to exhibit ...

  6. Linearization Method and Linear Complexity

    Tanaka, Hidema

    We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N(≅2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.

  7. The theory of discrete barriers and its applications to linear boundary-value problems of the 'Dirichlet type'; Theorie des barrieres discretes et applications a des problemes lineaires elliptiques du ''type de dirichlet''

    Jamet, P [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1967-07-01

    This report gives a general presentation of barrier theory for finite difference operators, with its applications to some boundary value problems. (author) [French] Ce rapport est un expose synthetique de la theorie des barrieres pour les operateurs aux differences finies et ses applications a certaines classes de problemes lineaires elliptiques du 'type de Dirichlet'. (auteur)

  8. A mini-exhibition with maximum content

    Laëtitia Pedroso

    2011-01-01

    The University of Budapest has been hosting a CERN mini-exhibition since 8 May. While smaller than the main travelling exhibition it has a number of major advantages: its compact design alleviates transport difficulties and makes it easier to find suitable venues in the Member States. Its content can be updated almost instantaneously and it will become even more interactive and high-tech as time goes by.   The exhibition on display in Budapest. The purpose of CERN's new mini-exhibition is to be more interactive and easier to install. Due to its size, the main travelling exhibition cannot be moved around quickly, which is why it stays in the same country for 4 to 6 months. But this means a long waiting list for the other Member States. To solve this problem, the Education Group has designed a new exhibition, which is smaller and thus easier to install. Smaller maybe, but no less rich in content, as the new exhibition conveys exactly the same messages as its larger counterpart. However, in the slimm...

  9. Topics in computational linear optimization

    Hultberg, Tim Helge

    2000-01-01

    Linear optimization has been an active area of research ever since the pioneering work of G. Dantzig more than 50 years ago. This research has produced a long sequence of practical as well as theoretical improvements of the solution techniques avilable for solving linear optimization problems...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...

  10. The better of two evils? Evidence that children exhibiting continuous conduct problems high or low on callous-unemotional traits score on opposite directions on physiological and behavioral measures of fear.

    Fanti, Kostas A; Panayiotou, Georgia; Lazarou, Chrysostomos; Michael, Raphaelia; Georgiou, Giorgos

    2016-02-01

    The present study examines whether heterogeneous groups of children identified based on their longitudinal scores on conduct problems (CP) and callous-unemotional (CU) traits differ on physiological and behavioral measures of fear. Specifically, it aims to test the hypothesis that children with high/stable CP differentiated on CU traits score on opposite directions on a fear-fearless continuum. Seventy-three participants (M age = 11.21; 45.2% female) were selected from a sample of 1,200 children. Children and their parents completed a battery of questionnaires assessing fearfulness, sensitivity to punishment, and behavioral inhibition. Children also participated in an experiment assessing their startle reactivity to fearful mental imagery, a well-established index of defensive motivation. The pattern of results verifies the hypothesis that fearlessness, assessed with physiological and behavioral measures, is a core characteristic of children high on both CP and CU traits (i.e., receiving the DSM-5 specifier of limited prosocial emotions). To the contrary, children with high/stable CP and low CU traits demonstrated high responsiveness to fear, high behavioral inhibition, and high sensitivity to punishment. The study is in accord with the principle of equifinality, in that different developmental mechanisms (i.e., extremes of high and low fear) may have the same behavioral outcome manifested as phenotypic antisocial behavior.

  11. Linear algebra

    Said-Houari, Belkacem

    2017-01-01

    This self-contained, clearly written textbook on linear algebra is easily accessible for students. It begins with the simple linear equation and generalizes several notions from this equation for the system of linear equations and introduces the main ideas using matrices. It then offers a detailed chapter on determinants and introduces the main ideas with detailed proofs. The third chapter introduces the Euclidean spaces using very simple geometric ideas and discusses various major inequalities and identities. These ideas offer a solid basis for understanding general Hilbert spaces in functional analysis. The following two chapters address general vector spaces, including some rigorous proofs to all the main results, and linear transformation: areas that are ignored or are poorly explained in many textbooks. Chapter 6 introduces the idea of matrices using linear transformation, which is easier to understand than the usual theory of matrices approach. The final two chapters are more advanced, introducing t...

  12. Education or business? - exhibition of human corpses

    Grzegorz Wróbel

    2017-09-01

    Full Text Available Exhibition "BODY WORLDS" which are presented exhibits of human remains are presented all over the world and are a major problem for the modern man, as presented on the preparations of the human not only serve scientific research, are not transferred to the medical schools to educate future doctors, but they were made available to the general public in the form of commercial and ambiguous. The aim of this study was to assess the ethical commercialization of human corpses "BODY WORLDS" exhibitions. Individual approach to the problems presented the dignity and value of human remains after death, of course, strongly related to the professed worldview. In the exhibits can be seen in both the scientific interest anatomical structures, as well as desecrated human remains or beautiful by its functional perfection of the body, understood also in terms of art. The question of ethics determines the right to decide for themselves, on the other hand, allows you to protect bodily integrity even after death. "BODY WORLDS" exhibition goes for the moral and ethical boundaries. In terms of people Gunther von Hagens for plastination of human remains which became a very profitable business, and its current activities defined as "plastination business" should be firmly said about the lack of moral principles.

  13. Linear algebra

    Stoll, R R

    1968-01-01

    Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand

  14. The World of Virtual Exhibitions

    Irena Eiselt

    2013-09-01

    Full Text Available EXTENDED ABSTRACTSpecial collections of the National and University Library (NUK hide a lot of items of precious value. The Slovenian cultural heritage is stored on paper or on other media as a part of the library’s Manuscripts, Incunabula and Rare Books Collection, Old Prints Collection, Maps and Pictorial Collection, Music Collection, Ephemera Collection, Serials Collection, and Slovenian Diaspora Publications Collection. Only a small part of the treasures is temporary revealed to the public on special exhibitions. The idea of virtual exhibitions of library treasures was born in 2005. The library aimed to exhibit precious items of special collections of high historical or artistic value. In 2008 the first two virtual exhibitions were created in-house offering access to the rich collections of old postcards of Ljubljana at the beginning of 20th century kept in the Maps and Pictorial Collection of NUK. They were soon followed by other virtual exhibitions. At the beginning they were organised in the same way as physical exhibitions, afterwards different programs were used for creation of special effects (for ex. 3D wall. About two years ago it was decided that the creation of virtual exhibitions will be simplified. Files of digitised and borndigital library materials in jpg format are imported to MS PowerPoint 2010. Each jpg file is now formatted by adding a frame, a description … to the slides which are saved as jpg files. The last step is the import of jpg files into Cooliris application used for NUK web exhibitions. In the paper the virtual exhibition design and creation, the technical point of view and criteria for the selection of exhibition content are explained following the example of the virtual exhibitions the Old Postcards of Ljubljana, Photo Ateliers in Slovenia, a collection of photographs Four Seasons by Fran Krašovec and photos of Post-Earthquake Ljubljana in 1895.

  15. Elements of linear space

    Amir-Moez, A R; Sneddon, I N

    1962-01-01

    Elements of Linear Space is a detailed treatment of the elements of linear spaces, including real spaces with no more than three dimensions and complex n-dimensional spaces. The geometry of conic sections and quadric surfaces is considered, along with algebraic structures, especially vector spaces and transformations. Problems drawn from various branches of geometry are given.Comprised of 12 chapters, this volume begins with an introduction to real Euclidean space, followed by a discussion on linear transformations and matrices. The addition and multiplication of transformations and matrices a

  16. Linear programming

    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.

  17. Linear algebra

    Liesen, Jörg

    2015-01-01

    This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...

  18. Linear algebra

    Berberian, Sterling K

    2014-01-01

    Introductory treatment covers basic theory of vector spaces and linear maps - dimension, determinants, eigenvalues, and eigenvectors - plus more advanced topics such as the study of canonical forms for matrices. 1992 edition.

  19. Linear Models

    Searle, Shayle R

    2012-01-01

    This 1971 classic on linear models is once again available--as a Wiley Classics Library Edition. It features material that can be understood by any statistician who understands matrix algebra and basic statistical methods.

  20. Linearly Adjustable International Portfolios

    Fonseca, R. J.; Kuhn, D.; Rustem, B.

    2010-09-01

    We present an approach to multi-stage international portfolio optimization based on the imposition of a linear structure on the recourse decisions. Multiperiod decision problems are traditionally formulated as stochastic programs. Scenario tree based solutions however can become intractable as the number of stages increases. By restricting the space of decision policies to linear rules, we obtain a conservative tractable approximation to the original problem. Local asset prices and foreign exchange rates are modelled separately, which allows for a direct measure of their impact on the final portfolio value.

  1. Linearly Adjustable International Portfolios

    Fonseca, R. J.; Kuhn, D.; Rustem, B.

    2010-01-01

    We present an approach to multi-stage international portfolio optimization based on the imposition of a linear structure on the recourse decisions. Multiperiod decision problems are traditionally formulated as stochastic programs. Scenario tree based solutions however can become intractable as the number of stages increases. By restricting the space of decision policies to linear rules, we obtain a conservative tractable approximation to the original problem. Local asset prices and foreign exchange rates are modelled separately, which allows for a direct measure of their impact on the final portfolio value.

  2. LINEAR ACCELERATOR

    Christofilos, N.C.; Polk, I.J.

    1959-02-17

    Improvements in linear particle accelerators are described. A drift tube system for a linear ion accelerator reduces gap capacity between adjacent drift tube ends. This is accomplished by reducing the ratio of the diameter of the drift tube to the diameter of the resonant cavity. Concentration of magnetic field intensity at the longitudinal midpoint of the external sunface of each drift tube is reduced by increasing the external drift tube diameter at the longitudinal center region.

  3. Collective processes in a tokamak with high-energy particles: general problems of the linear theory of Alfven instabilities of a tokamak with high-energy ions

    Mikhailovskii, A.B.

    1986-01-01

    Some general problems of the theory of Alfven instabilities of a tokamak with high-energy ions are considered. It is assumed that such ions are due to either ionization of fast neutral atoms, injected into the tokamak, or production of them under thermo-nuclear conditions. Small-oscillation equations are derived for the Alfven-type waves, which allow for both destabilizing effects, associated with the high-energy particles, and stabilizing ones, such as effects of shear and bulk-plasm dissipation. A high-energy ion contribution is calculated into the growth rate of the Alfven waves. The author considers the role of trapped-electron collisional dissipation

  4. 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

  5. Non-linear Heart Rate Variability as a Discriminator of Internalizing Psychopathology and Negative Affect in Children With Internalizing Problems and Healthy Controls

    Charlotte Fiskum

    2018-05-01

    Full Text Available Background: Internalizing psychopathology and dysregulated negative affect are characterized by dysregulation in the autonomic nervous system and reduced heart rate variability (HRV due to increases in sympathetic activity alongside reduced vagal tone. The neurovisceral system is however, a complex nonlinear system, and nonlinear indices related to psychopathology are so far less studied in children. Essential nonlinear properties of a system can be found in two main domains: the informational domain and the invariant domain. sample entropy (SampEn is a much-used method from the informational domain, while detrended fluctuation analysis (DFA represents a widely-used method from the invariant domain. To see if nonlinear HRV can provide information beyond linear indices of autonomic activation, this study investigated SampEn and DFA as discriminators of internalizing psychopathology and negative affect alongside measures of vagally-mediated HRV and sympathetic activation.Material and Methods: Thirty-Two children with internalizing difficulties and 25 healthy controls (aged 9–13 were assessed with the Child Behavior Checklist and the Early Adolescent Temperament Questionnaire, Revised, giving an estimate of internalizing psychopathology, negative affect and effortful control, a protective factor against psychopathology. Five minute electrocardiogram and impedance cardiography recordings were collected during a resting baseline, giving estimates of SampEn, DFA short-term scaling exponent α1, root mean square of successive differences (RMSSD, and pre-ejection period (PEP. Between-group differences and correlations were assessed with parametric and non-parametric tests, and the relationships between cardiac variables, psychopathology and negative affect were assessed using generalized linear modeling.Results: SampEn and DFA were not significantly different between the groups. SampEn was weakly negatively related to heart rate (HR in the controls

  6. Problems in the radon versus lung cancer test of the linear no-threshold theory and a procedure for resolving them

    Cohen, B.L.

    1996-01-01

    It has been shown that lung cancer rates in U.S. counties, with or without correction for smoking, decrease with increasing radon exposure, in sharp contrast to the increase predicted by the linear-no-threshold (LNT) theory. The discrepancy is by 20 standard deviations, and very extensive efforts to explain it were not successful. Unless a plausible explanation for this discrepancy (or conflicting evidence) can be found, continued use of the LNT theory is a violation of open-quotes the scientific method.close quotes Nevertheless, LNT continues to be accepted and used by all official and governmental organizations, such as the International Commission on Radiological Protection, the National Council on Radiation Protection and Measurements, the Council on Radiation Protection and Measurements, the National Academy of Sciences - U.S. Nuclear Regulatory Commission Board of Radiation Effects Research, Environmental Protection Agency etc., and there has been no move by any of these bodies to discontinue or limit its use. Assuming that they rely on the scientific method, this clearly implies that they have a plausible explanation for the discrepancy. The author has made great efforts to discover these 'plausible explanations' by inquiries through various channels, and the purpose of this paper is to describe and discuss them

  7. RESOLUCIÓN DE UN PROBLEMA INVERSO VÍA SUBESTIMACIÓN LINEAL A TROZOS //\tAN INVERSE PROBLEM RESOLUTION VIA PIECEWISE LINEAR UNDERESTIMATION

    Javier Hernádez Benítez

    2012-12-01

    Full Text Available In reactor design phase bubble column type (CBT is required to have the distribution of solids within the reactor. This distribution satisfies an ordinary differential equation (ODE of order two, with boundary conditions that was developed by D. R. Cova [2], followed by D. N. Smith and J. A. Ruether [8]. Some elements of this equation are given by correlations that depend on certain parameters that are unknown but may be obtained from experimental data. The methodology used to determine these parameters is the sub- piecewise linear underestimation developed by O. L. Mangasarian, J. B. Rosen, M. E. Thompson. // RESUMEN: En el diseño de reactores trifásicos tipo columna de burbujeo (CBT, se requiere tener la distribución de solidos dentro del reactor. Esta distribución satisface una ecuación diferencial ordinaria (EDO de orden dos, con condiciones de frontera que fue desarrollada por D. R. Cova [2], y posteriormente por D. N. Smith y J. A. Ruether [8]. Algunos elementos de esta ecuación están dados por correlaciones que dependen de ciertos parámetros que son desconocidos, pero se pueden obtener a partir de datos experimentales. La metodología utilizada para determinar dichos parámetros es la sub-estimación lineal a trozos desarrollada por O. L. Mangasarian, J. B. Rosen y M. E. Thompson.

  8. Linear Motor With Air Slide

    Johnson, Bruce G.; Gerver, Michael J.; Hawkey, Timothy J.; Fenn, Ralph C.

    1993-01-01

    Improved linear actuator comprises air slide and linear electric motor. Unit exhibits low friction, low backlash, and more nearly even acceleration. Used in machinery in which positions, velocities, and accelerations must be carefully controlled and/or vibrations must be suppressed.

  9. Fundamentals of linear algebra

    Dash, Rajani Ballav

    2008-01-01

    FUNDAMENTALS OF LINEAR ALGEBRA is a comprehensive Text Book, which can be used by students and teachers of All Indian Universities. The Text has easy, understandable form and covers all topics of UGC Curriculum. There are lots of worked out examples which helps the students in solving the problems without anybody's help. The Problem sets have been designed keeping in view of the questions asked in different examinations.

  10. Mean-Variance Portfolio Selection Problem with Stochastic Salary for a Defined Contribution Pension Scheme: A Stochastic Linear-Quadratic-Exponential Framework

    Charles Nkeki

    2013-11-01

    Full Text Available This paper examines a mean-variance portfolio selection problem with stochastic salary and inflation protection strategy in the accumulation phase of a defined contribution (DC pension plan. The utility function is assumed to be quadratic. It was assumed that the flow of contributions made by the PPM are invested into a market that is characterized by a cash account, an inflation-linked bond and a stock. In this paper, inflationlinked bond is traded and used to hedge inflation risks associated with the investment. The aim of this paper is to maximize the expected final wealth and minimize its variance. Efficient frontier for the three classes of assets (under quadratic utility function that will enable pension plan members (PPMs to decide their own wealth and risk in their investment profile at retirement was obtained.

  11. Linear regression

    Olive, David J

    2017-01-01

    This text covers both multiple linear regression and some experimental design models. The text uses the response plot to visualize the model and to detect outliers, does not assume that the error distribution has a known parametric distribution, develops prediction intervals that work when the error distribution is unknown, suggests bootstrap hypothesis tests that may be useful for inference after variable selection, and develops prediction regions and large sample theory for the multivariate linear regression model that has m response variables. A relationship between multivariate prediction regions and confidence regions provides a simple way to bootstrap confidence regions. These confidence regions often provide a practical method for testing hypotheses. There is also a chapter on generalized linear models and generalized additive models. There are many R functions to produce response and residual plots, to simulate prediction intervals and hypothesis tests, to detect outliers, and to choose response trans...

  12. Linear Colliders

    Alcaraz, J.

    2001-01-01

    After several years of study e''+ e''- linear colliders in the TeV range have emerged as the major and optimal high-energy physics projects for the post-LHC era. These notes summarize the present status form the main accelerator and detector features to their physics potential. The LHC era. These notes summarize the present status, from the main accelerator and detector features to their physics potential. The LHC is expected to provide first discoveries in the new energy domain, whereas an e''+ e''- linear collider in the 500 GeV-1 TeV will be able to complement it to an unprecedented level of precision in any possible areas: Higgs, signals beyond the SM and electroweak measurements. It is evident that the Linear Collider program will constitute a major step in the understanding of the nature of the new physics beyond the Standard Model. (Author) 22 refs

  13. Photowalk Exhibition opens at Microcosm

    Katarina Anthony

    2011-01-01

    The winning photographs from the 2010 Global Particle Physics Photowalk competition will go on display at Microcosm from 11 February to 2 April. The exhibition is part of a global photography event taking place over three continents, with Photowalk exhibitions opening simultaneously at Fermilab in the US, KEK in Japan and here at CERN.   DESY wire chamber - First place people's choice; second place global jury competition. Photographer: Hans-Peter Hildebrandt  If you were one of the 1,300 photography lovers who voted in last year’s Photowalk competition, this exhibition is your chance to see the winning entries in print. The exhibition will take place in the downstairs gallery of Microcosm, overlooking the garden. 15 photographs will be on display, with each of the laboratories that participated in Photowalk represented by their 3 winning entries. Among them will be the “people’s choice” sunburst photo of a particle detector at DESY (Photo 1), and...

  14. Globe exhibit wins international acclaim

    Katarina Anthony

    2011-01-01

    The Globe’s “Universe of Particles” exhibition has recently received four prestigious awards for its avant-garde design. This external praise is great encouragement for the CERN exhibitions currently on the drawing board.   The Universe of Particles exhibition has won 4 awards for its avant-garde design. Back in 2008, the design company Atelier Brückner was presented with a challenge: to design the layout of a new permanent exhibition for CERN, one that would epitomize both the Organization and its research. The brief was concise but complex: the exhibit had to be symbolic of the Organization, use modern technology, engage and immerse visitors, and, preferably, use touch-screen technology. With the help of IArt, an interactive technology firm, and based on the content provided by CERN’s Education Group, Atelier Brückner developed the “Universe of Particles” exhibit as it is today. Its principal concept centred on the s...

  15. Greenhouse Earth: A Traveling Exhibition

    Booth, W.H.; Caesar, S.

    1992-09-01

    The Franklin Institute Science Museum provided an exhibit entitled the Greenhouse Earth: A Traveling Exhibition. This 3500 square-foot exhibit on global climate change was developed in collaboration with the Association of Science-Technology Centers. The exhibit opened at The Franklin Institute on February 14, 1992, welcoming 291,000 visitors over its three-month stay. During its three-year tour, Greenhouse Earth will travel to ten US cities, reaching two million visitors. Greenhouse Earth aims to deepen public understanding of the scientific issues of global warming and the conservation measures that can be taken to slow its effects. The exhibit features hands-on exhibitry, interactive computer programs and videos, a theater production, a ''demonstration cart,'' guided tours, and lectures. supplemental educational programs at the Institute included a teachers preview, a symposium on climate change, and a ''satellite field trip.'' The development of Greenhouse Earth included front-end and formative evaluation procedures. Evaluation includes interviews with visitors, prototypes, and summative surveys for participating museums. During its stay in Philadelphia, Greenhouse Earth was covered by the local and national press, with reviews in print and broadcast media. Greenhouse Earth is the first large-scale museum exhibit to address global climate change

  16. The use of linear fractional analogues of rheological models in the problem of approximating the experimental data on the stretch polyvinylchloride elastron

    Luiza G. Ungarova

    2016-12-01

    Full Text Available We considere and analyze the uniaxial phenomenological models of viscoelastic deformation based on fractional analogues of Scott Blair, Voigt, Maxwell, Kelvin and Zener rheological models. Analytical solutions of the corresponding differential equations are obtained with fractional Riemann–Liouville operators under constant stress with further unloading, that are written by the generalized (two-parameter fractional exponential function and contains from two to four parameters depending on the type of model. A method for identifying the model parameters based on the background information for the experimental creep curves with constant stresses was developed. Nonlinear problem of parametric identification is solved by two-step iterative method. The first stage uses the characteristic data points diagrams and features in the behavior of the models under unrestricted growth of time and the initial approximation of parameters are determined. At the second stage, the refinement of these parameters by coordinate descent (the Hooke–Jeeves's method and minimizing the functional standard deviation for calculated and experimental values is made. Method of identification is realized for all the considered models on the basis of the known experimental data uniaxial viscoelastic deformation of Polyvinylchloride Elastron at a temperature of 20∘C and five the tensile stress levels. Table-valued parameters for all models are given. The errors analysis of constructed phenomenological models is made to experimental data over the entire ensemble of curves viscoelastic deformation. It was found that the approximation errors for the Scott Blair fractional model is 14.17 %, for the Voigt fractional model is 11.13 %, for the Maxvell fractional model is 13.02 %, for the Kelvin fractional model 10.56 %, for the Zener fractional model is 11.06 %. The graphs of the calculated and experimental dependences of viscoelastic deformation of Polyvinylchloride

  17. A variational formulation for linear models in coupled dynamic thermoelasticity

    Feijoo, R.A.; Moura, C.A. de.

    1981-07-01

    A variational formulation for linear models in coupled dynamic thermoelasticity which quite naturally motivates the design of a numerical scheme for the problem, is studied. When linked to regularization or penalization techniques, this algorithm may be applied to more general models, namely, the ones that consider non-linear constraints associated to variational inequalities. The basic postulates of Mechanics and Thermodynamics as well as some well-known mathematical techniques are described. A thorough description of the algorithm implementation with the finite-element method is also provided. Proofs for existence and uniqueness of solutions and for convergence of the approximations are presented, and some numerical results are exhibited. (Author) [pt

  18. Exhibition - Mathematics, A Beautiful Elsewhere

    2011-01-01

    From 21 October 2011 to 18 March 2012, the Fondation Cartier pour l’art contemporain will present the exhibition Mathematics: A Beautiful Elsewhere, an exhibition developed in association with the Institut des Hautes Études Scientifiques (IHÉS) and under the patronage of UNESCO. For this unprecedented event, the foundation invited mathematicians to work with artists with whom it has previously worked to create an exhibition that allows visitors to see, hear, do, interpret and think about mathematics. By bringing mathematics into its premises, the Fondation Cartier is itself undergoing the “sudden change of scenery” described by mathematician Alexandre Grothendieck. More information is available here. Fondation Cartier pour l’art contemporain 261, boulevard Raspail 75014 Paris http://fondation.cartier.com Private Visit For professors, researchers and all the staff of Mathematics departments...

  19. Miniaturized Stretchable and High-Rate Linear Supercapacitors.

    Zhu, Wenjun; Zhang, Yang; Zhou, Xiaoshuang; Xu, Jiang; Liu, Zunfeng; Yuan, Ningyi; Ding, Jianning

    2017-12-01

    Linear stretchable supercapacitors have attracted much attention because they are well suited to applications in the rapidly expanding field of wearable electronics. However, poor conductivity of the electrode material, which limits the transfer of electrons in the axial direction of the linear supercapacitors, leads to a serious loss of capacity at high rates. To solve this problem, we use gold nanoparticles to decorate aligned multiwall carbon nanotube to fabricate stretchable linear electrodes. Furthermore, we have developed fine stretchable linear supercapacitors, which exhibited an extremely high elasticity up to 400% strain with a high capacitance of about 8.7 F g -1 at the discharge current of 1 A g -1 .

  20. Linear programming

    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...

  1. Learning from Exhibitions: Chuck Close.

    Johnson, Mark M.

    1998-01-01

    Discusses the artwork of Chuck Close, who is well known for his over-sized portraits of fellow artists and anonymous sitters, and the exhibition of his work that premiered at New York's Museum of Modern Art before traveling to other cities in the United States. (CMK)

  2. Linear Algebraic Method for Non-Linear Map Analysis

    Yu, L.; Nash, B.

    2009-01-01

    We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.

  3. Mobile Technologies in Museum Exhibitions

    Sandra Medić; Nataša Pavlović

    2014-01-01

    In order to be up–to–date and give visitors a memorable and unique experience, museums are including usage of digital technologies in their exhibitions. Even though museums in Serbia are very important part of tourism offer, they still have traditional settings that are poorly interpreted. The majority of them have a scientific and historical review which is unattractive for various target groups of visitors and for museums it’s important to continually try out new ways in interpretation of t...

  4. A New Exhibition in Microcosm

    2000-01-01

    Sebastien Pelletier explains states of matter to an enthusiastic group of youngsters during the opening of a new exhibition in Microcosm last week. The Fun with Physics workshop will be offered to all 13-14 year olds in school groups visiting CERN this year. The new Microcosm contents have been developed in collaboration with the local teaching community, and cover particles and the forces that act between them.

  5. "Big Science" exhibition at Balexert

    2008-01-01

    CERN is going out to meet those members of the general public who were unable to attend the recent Open Day. The Laboratory will be taking its "Big Science" exhibition from the Globe of Science and Innovation to the Balexert shopping centre from 19 to 31 May 2008. The exhibition, which shows the LHC and its experiments through the eyes of a photographer, features around thirty spectacular photographs measuring 4.5 metres high and 2.5 metres wide. Welcomed and guided around the exhibition by CERN volunteers, shoppers at Balexert will also have the opportunity to discover LHC components on display and watch films. "Fun with Physics" workshops will be held at certain times of the day. Main hall of the Balexert shopping centre, ground floor, from 9.00 a.m. to 7.00 p.m. Monday to Friday and from 10 a.m. to 6 p.m. on the two Saturdays. Call for volunteers All members of the CERN personnel are invited to enrol as volunteers to help welcom...

  6. Mobile Technologies in Museum Exhibitions

    Sandra Medić

    2014-10-01

    Full Text Available In order to be up–to–date and give visitors a memorable and unique experience, museums are including usage of digital technologies in their exhibitions. Even though museums in Serbia are very important part of tourism offer, they still have traditional settings that are poorly interpreted. The majority of them have a scientific and historical review which is unattractive for various target groups of visitors and for museums it’s important to continually try out new ways in interpretation of their settings. Because technology continues to rapidly change the way we communicate, cultural institutions should adapt to new ways of communication with their visitors. This paper examines mobile technologies that can be used in museums to give visitors a different experience and transfer the knowledge innovatively. In that way it will be presented the modern concept of presentation of museum exhibitions, focusing on usage of mobile devices through mobile applications and QR codes. The paper provides the broad understanding of usage mobile technologies in museum exhibitions with its advantages and limitations. The research results can help the museums management to improve interpretation and communication with visitors and enrich the visitor experience.

  7. An introduction to linear algebra

    Mirsky, L

    2003-01-01

    Rigorous, self-contained coverage of determinants, vectors, matrices and linear equations, quadratic forms, more. Elementary, easily readable account with numerous examples and problems at the end of each chapter.

  8. Adaptive regularization of noisy linear inverse problems

    Hansen, Lars Kai; Madsen, Kristoffer Hougaard; Lehn-Schiøler, Tue

    2006-01-01

    In the Bayesian modeling framework there is a close relation between regularization and the prior distribution over parameters. For prior distributions in the exponential family, we show that the optimal hyper-parameter, i.e., the optimal strength of regularization, satisfies a simple relation: T......: The expectation of the regularization function, i.e., takes the same value in the posterior and prior distribution. We present three examples: two simulations, and application in fMRI neuroimaging....

  9. Linear Programming Problems for Generalized Uncertainty

    Thipwiwatpotjana, Phantipa

    2010-01-01

    Uncertainty occurs when there is more than one realization that can represent an information. This dissertation concerns merely discrete realizations of an uncertainty. Different interpretations of an uncertainty and their relationships are addressed when the uncertainty is not a probability of each realization. A well known model that can handle…

  10. 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…

  11. Dimension of linear models

    Høskuldsson, Agnar

    1996-01-01

    Determination of the proper dimension of a given linear model is one of the most important tasks in the applied modeling work. We consider here eight criteria that can be used to determine the dimension of the model, or equivalently, the number of components to use in the model. Four of these cri......Determination of the proper dimension of a given linear model is one of the most important tasks in the applied modeling work. We consider here eight criteria that can be used to determine the dimension of the model, or equivalently, the number of components to use in the model. Four...... the basic problems in determining the dimension of linear models. Then each of the eight measures are treated. The results are illustrated by examples....

  12. Linear programming using Matlab

    Ploskas, Nikolaos

    2017-01-01

    This book offers a theoretical and computational presentation of a variety of linear programming algorithms and methods with an emphasis on the revised simplex method and its components. A theoretical background and mathematical formulation is included for each algorithm as well as comprehensive numerical examples and corresponding MATLAB® code. The MATLAB® implementations presented in this book  are sophisticated and allow users to find solutions to large-scale benchmark linear programs. Each algorithm is followed by a computational study on benchmark problems that analyze the computational behavior of the presented algorithms. As a solid companion to existing algorithmic-specific literature, this book will be useful to researchers, scientists, mathematical programmers, and students with a basic knowledge of linear algebra and calculus.  The clear presentation enables the reader to understand and utilize all components of simplex-type methods, such as presolve techniques, scaling techniques, pivoting ru...

  13. ALPS: A Linear Program Solver

    Ferencz, Donald C.; Viterna, Larry A.

    1991-01-01

    ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.

  14. Linear Water Waves

    Kuznetsov, N.; Maz'ya, V.; Vainberg, B.

    2002-08-01

    This book gives a self-contained and up-to-date account of mathematical results in the linear theory of water waves. The study of waves has many applications, including the prediction of behavior of floating bodies (ships, submarines, tension-leg platforms etc.), the calculation of wave-making resistance in naval architecture, and the description of wave patterns over bottom topography in geophysical hydrodynamics. The first section deals with time-harmonic waves. Three linear boundary value problems serve as the approximate mathematical models for these types of water waves. The next section uses a plethora of mathematical techniques in the investigation of these three problems. The techniques used in the book include integral equations based on Green's functions, various inequalities between the kinetic and potential energy and integral identities which are indispensable for proving the uniqueness theorems. The so-called inverse procedure is applied to constructing examples of non-uniqueness, usually referred to as 'trapped nodes.'

  15. The rational complementarity problem

    Heemels, W.P.M.H.; Schumacher, J.M.; Weiland, S.

    1999-01-01

    An extension of the linear complementarity problem (LCP) of mathematical programming is the so-called rational complementarity problem (RCP). This problem occurs if complementarity conditions are imposed on input and output variables of linear dynamical input/state/output systems. The resulting

  16. Contemporary Developments in Cinema Exhibition

    Hanson, Stuart

    2014-01-01

    he work offered for this PhD by Published Works charts the history of cinema exhibition in Britain from the late 1950s to the present. At the start of this period, cinemagoing as a form of public entertainment entered a long period of decline that was only arrested with the development and growth of multiplex cinemas in the 1980s and 1990s. Despite these changes, the feature film itself remained a culturally and commercially valuable artefact, though increasingly this meant the Hollywood fil...

  17. Extended linear chain compounds

    Linear chain substances span a large cross section of contemporary chemistry ranging from covalent polymers, to organic charge transfer com­ plexes to nonstoichiometric transition metal coordination complexes. Their commonality, which coalesced intense interest in the theoretical and exper­ imental solid state physics/chemistry communities, was based on the obser­ vation that these inorganic and organic polymeric substrates exhibit striking metal-like electrical and optical properties. Exploitation and extension of these systems has led to the systematic study of both the chemistry and physics of highly and poorly conducting linear chain substances. To gain a salient understanding of these complex materials rich in anomalous aniso­ tropic electrical, optical, magnetic, and mechanical properties, the conver­ gence of diverse skills and talents was required. The constructive blending of traditionally segregated disciplines such as synthetic and physical organic, inorganic, and polymer chemistry, crystallog...

  18. Collaborative virtual environments art exhibition

    Dolinsky, Margaret; Anstey, Josephine; Pape, Dave E.; Aguilera, Julieta C.; Kostis, Helen-Nicole; Tsoupikova, Daria

    2005-03-01

    This panel presentation will exhibit artwork developed in CAVEs and discuss how art methodologies enhance the science of VR through collaboration, interaction and aesthetics. Artists and scientists work alongside one another to expand scientific research and artistic expression and are motivated by exhibiting collaborative virtual environments. Looking towards the arts, such as painting and sculpture, computer graphics captures a visual tradition. Virtual reality expands this tradition to not only what we face, but to what surrounds us and even what responds to our body and its gestures. Art making that once was isolated to the static frame and an optimal point of view is now out and about, in fully immersive mode within CAVEs. Art knowledge is a guide to how the aesthetics of 2D and 3D worlds affect, transform, and influence the social, intellectual and physical condition of the human body through attention to psychology, spiritual thinking, education, and cognition. The psychological interacts with the physical in the virtual in such a way that each facilitates, enhances and extends the other, culminating in a "go together" world. Attention to sharing art experience across high-speed networks introduces a dimension of liveliness and aliveness when we "become virtual" in real time with others.

  19. An introduction to linear algebra and tensors

    Akivis, M A; Silverman, Richard A

    1978-01-01

    Eminently readable, completely elementary treatment begins with linear spaces and ends with analytic geometry, covering multilinear forms, tensors, linear transformation, and more. 250 problems, most with hints and answers. 1972 edition.

  20. linear-quadratic-linear model

    Tanwiwat Jaikuna

    2017-02-01

    Full Text Available Purpose: To develop an in-house software program that is able to calculate and generate the biological dose distribution and biological dose volume histogram by physical dose conversion using the linear-quadratic-linear (LQL model. Material and methods : The Isobio software was developed using MATLAB version 2014b to calculate and generate the biological dose distribution and biological dose volume histograms. The physical dose from each voxel in treatment planning was extracted through Computational Environment for Radiotherapy Research (CERR, and the accuracy was verified by the differentiation between the dose volume histogram from CERR and the treatment planning system. An equivalent dose in 2 Gy fraction (EQD2 was calculated using biological effective dose (BED based on the LQL model. The software calculation and the manual calculation were compared for EQD2 verification with pair t-test statistical analysis using IBM SPSS Statistics version 22 (64-bit. Results: Two and three-dimensional biological dose distribution and biological dose volume histogram were displayed correctly by the Isobio software. Different physical doses were found between CERR and treatment planning system (TPS in Oncentra, with 3.33% in high-risk clinical target volume (HR-CTV determined by D90%, 0.56% in the bladder, 1.74% in the rectum when determined by D2cc, and less than 1% in Pinnacle. The difference in the EQD2 between the software calculation and the manual calculation was not significantly different with 0.00% at p-values 0.820, 0.095, and 0.593 for external beam radiation therapy (EBRT and 0.240, 0.320, and 0.849 for brachytherapy (BT in HR-CTV, bladder, and rectum, respectively. Conclusions : The Isobio software is a feasible tool to generate the biological dose distribution and biological dose volume histogram for treatment plan evaluation in both EBRT and BT.

  1. Enrico Fermi exhibition at CERN

    2002-01-01

    A touring exhibition celebrating the centenary of Enrico Fermi's birth in 1901 will be on display at CERN (Main Building, Mezzanine) from 12-27 September. You are cordially invited to the opening celebration on Thursday 12 September at 16:00 (Main Building, Council Chamber), which will include speechs from: Luciano Maiani Welcome and Introduction Arnaldo Stefanini Celebrating Fermi's Centenary in Documents and Pictures Antonino Zichichi The New 'Centro Enrico Fermi' at Via Panisperna Ugo Amaldi Fermi at Via Panisperna and the birth of Nuclear Medicine Jack Steinberger Fermi in Chicago Valentin Telegdi A Close-up of Fermi and the screening of a documentary video about Fermi: Scienziati a Pisa: Enrico Fermi (Scientists at Pisa: Enrico Fermi) created by Francesco Andreotti for La Limonaia from early film, photographs and sound recordings (In Italian, with English subtitles - c. 30 mins). This will be followed by an aperitif on the Mezz...

  2. 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

  3. Duality in constrained location problems

    Juel, Henrik; Love, Robert F.

    1987-01-01

    The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated.......The dual of a facility location problem with general norms, distance constraints, and linear constraints is formulated....

  4. EU Climate Change Exhibition Held

    2008-01-01

    <正>On April 25, the CPAFFC, the China-EU Association (CEUA) and the Delegation of the European Commission to China jointly held the opening ceremony for the EU Exhibition on Climate Change in the CPAFFC. He Luli, former vice chairperson of the NPC Standing Committee and honorary president of the CEUA, Jose Manuel Barroso, president of the European Commission, and Li Jianping, vice president of the CPAFFC, attended the opening ceremony and made speeches. Honorary President He Luli highly praised the achievements made by China and the EU in their longtime cooperation of mutual benefits in various fields including environmental protection. She said, for many years China and EU have both committed to the development of all-round strategic partnership and establishment of a multi-level mechanism of political dialogue. She expressed, with increasing enthusiasm the CEUA would continue to actively carry out nongovernmental exchanges between China and the EU, and promote cooperation between the two sides in the fields of economy, society, environmental protection, science and technology, culture, etc.

  5. The Road Transport world exhibition in Paris

    Anon.

    1995-01-01

    Following the agreement between French and German professionals of automobile and industrial vehicle, the Road Transport world exhibition will take place alternatively in Paris and Hanover. The 1995 meeting has taken place in Paris (September 15-21) and about 20 countries were represented. Road transport is the principal way of goods transportation in France and represent 88% of the traffic explained in tons gross and 70% in tons km. The petroleum dependence of the transportation sector is becoming a worrying problem as the gasoline and diesel fuels taxes will be discussed in the 1996 financial laws project. According to the last ''Worldwide energetic perspectives'' report published by the IEA, in 2010 the transportation sector could absorb more than 60% of the worldwide petroleum consumption. This increase represents a challenge to the petroleum industry to increase the energetic efficiency of the vehicle fuels and the production of diesel fuels, and conversely to reduce the pollution effluents. (J.S.). 4 tabs

  6. Dimension of linear models

    Høskuldsson, Agnar

    1996-01-01

    Determination of the proper dimension of a given linear model is one of the most important tasks in the applied modeling work. We consider here eight criteria that can be used to determine the dimension of the model, or equivalently, the number of components to use in the model. Four...... the basic problems in determining the dimension of linear models. Then each of the eight measures are treated. The results are illustrated by examples....... of these criteria are widely used ones, while the remaining four are ones derived from the H-principle of mathematical modeling. Many examples from practice show that the criteria derived from the H-principle function better than the known and popular criteria for the number of components. We shall briefly review...

  7. Uso combinado de sistemas de informações geográficas para transportes e programação linear inteira mista em problemas de localização de instalações Combining geographic information systems for transportation and mixed integer linear programming in location-allocation problems

    Sílvia Maria Santana Mapa

    2012-01-01

    Full Text Available O objetivo do trabalho é avaliar a qualidade das soluções para o problema de localização-alocação de instalações geradas por um SIG-T (Sistema de Informação Geográfica para Transportes, obtidas após a utilização combinada das rotinas Localização de Facilidades e Problema do Transporte, quando comparadas com as soluções ótimas obtidas a partir de modelo matemático exato baseado em Programação Linear Inteira Mista (PLIM, desenvolvido externamente ao SIG. Os modelos foram aplicados a três simulações: a primeira propõe a abertura de fábricas e alocação de clientes no Estado de São Paulo; a segunda envolve um atacadista e um estudo de localização de centros de distribuição e alocação dos clientes varejistas; a terceira localiza creches em um contexto urbano, alocando a demanda. Os resultados mostraram que, quando se considera a capacidade das instalações, o modelo otimizante PLIM chegou a apresentar, em um dos cenários simulados, resultados até 37% melhores do que o SIG, além de propor locais diferentes para abertura de novas instalações. Quando não se considera a capacidade, o modelo SIG se mostrou tão eficiente quanto o modelo exato PLIM, chegando exatamente às mesmas soluções.This study aims to evaluate the quality of the solutions for facility location-allocation problems generated by a GIS-T (Geographic Information System for Transportation software. These solutions were obtained from combining the Facility Location and Transportation Problem routines, when compared with the optimal solutions, which were obtained using the exact mathematical model based on the Mixed Integer Linear Programming (MILP developed externally to the GIS. The models were applied to three simulations: the first one proposes set up businesses and customers' allocation in the state of São Paulo; the second involves a wholesaler and an investigation of distribution center location and retailers' allocation; and the third one

  8. Nonlinear Modeling by Assembling Piecewise Linear Models

    Yao, Weigang; Liou, Meng-Sing

    2013-01-01

    To preserve nonlinearity of a full order system over a parameters range of interest, we propose a simple modeling approach by assembling a set of piecewise local solutions, including the first-order Taylor series terms expanded about some sampling states. The work by Rewienski and White inspired our use of piecewise linear local solutions. The assembly of these local approximations is accomplished by assigning nonlinear weights, through radial basis functions in this study. The efficacy of the proposed procedure is validated for a two-dimensional airfoil moving at different Mach numbers and pitching motions, under which the flow exhibits prominent nonlinear behaviors. All results confirm that our nonlinear model is accurate and stable for predicting not only aerodynamic forces but also detailed flowfields. Moreover, the model is robustness-accurate for inputs considerably different from the base trajectory in form and magnitude. This modeling preserves nonlinearity of the problems considered in a rather simple and accurate manner.

  9. Linear and quasi-linear equations of parabolic type

    Ladyženskaja, O A; Ural′ceva, N N; Uralceva, N N

    1968-01-01

    Equations of parabolic type are encountered in many areas of mathematics and mathematical physics, and those encountered most frequently are linear and quasi-linear parabolic equations of the second order. In this volume, boundary value problems for such equations are studied from two points of view: solvability, unique or otherwise, and the effect of smoothness properties of the functions entering the initial and boundary conditions on the smoothness of the solutions.

  10. Linear Algebra and Smarandache Linear Algebra

    Vasantha, Kandasamy

    2003-01-01

    The present book, on Smarandache linear algebra, not only studies the Smarandache analogues of linear algebra and its applications, it also aims to bridge the need for new research topics pertaining to linear algebra, purely in the algebraic sense. We have introduced Smarandache semilinear algebra, Smarandache bilinear algebra and Smarandache anti-linear algebra and their fuzzy equivalents. Moreover, in this book, we have brought out the study of linear algebra and vector spaces over finite p...

  11. Some new ternary linear codes

    Rumen Daskalov

    2017-07-01

    Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].

  12. Stability of Linear Equations--Algebraic Approach

    Cherif, Chokri; Goldstein, Avraham; Prado, Lucio M. G.

    2012-01-01

    This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…

  13. 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…

  14. Optimal control linear quadratic methods

    Anderson, Brian D O

    2007-01-01

    This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the

  15. Local food-based complementary feeding recommendations developed by the linear programming approach to improve the intake of problem nutrients among 12-23-month-old Myanmar children.

    Hlaing, Lwin Mar; Fahmida, Umi; Htet, Min Kyaw; Utomo, Budi; Firmansyah, Agus; Ferguson, Elaine L

    2016-07-01

    Poor feeding practices result in inadequate nutrient intakes in young children in developing countries. To improve practices, local food-based complementary feeding recommendations (CFR) are needed. This cross-sectional survey aimed to describe current food consumption patterns of 12-23-month-old Myanmar children (n 106) from Ayeyarwady region in order to identify nutrient requirements that are difficult to achieve using local foods and to formulate affordable and realistic CFR to improve dietary adequacy. Weekly food consumption patterns were assessed using a 12-h weighed dietary record, single 24-h recall and a 5-d food record. Food costs were estimated by market surveys. CFR were formulated by linear programming analysis using WHO Optifood software and evaluated among mothers (n 20) using trial of improved practices (TIP). Findings showed that Ca, Zn, niacin, folate and Fe were 'problem nutrients': nutrients that did not achieve 100 % recommended nutrient intake even when the diet was optimised. Chicken liver, anchovy and roselle leaves were locally available nutrient-dense foods that would fill these nutrient gaps. The final set of six CFR would ensure dietary adequacy for five of twelve nutrients at a minimal cost of 271 kyats/d (based on the exchange rate of 900 kyats/USD at the time of data collection: 3rd quarter of 2012), but inadequacies remained for niacin, folate, thiamin, Fe, Zn, Ca and vitamin B6. TIP showed that mothers believed liver and vegetables would cause worms and diarrhoea, but these beliefs could be overcome to successfully promote liver consumption. Therefore, an acceptable set of CFR were developed to improve the dietary practices of 12-23-month-old Myanmar children using locally available foods. Alternative interventions such as fortification, however, are still needed to ensure dietary adequacy of all nutrients.

  16. Parametric Linear Dynamic Logic

    Peter Faymonville

    2014-08-01

    Full Text Available We introduce Parametric Linear Dynamic Logic (PLDL, which extends Linear Dynamic Logic (LDL by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL that is able to express all ω-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all ω-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.

  17. Electrodynamic linear motor

    Munehiro, H

    1980-05-29

    When driving the carriage of a printer through a rotating motor, there are problems regarding the limited accuracy of the carriage position due to rotation or contraction and ageing of the cable. In order to solve the problem, a direct drive system was proposed, in which the printer carriage is driven by a linear motor. If one wants to keep the motor circuit of such a motor compact, then the magnetic flux density in the air gap must be reduced or the motor travel must be reduced. It is the purpose of this invention to create an electrodynamic linear motor, which on the one hand is compact and light and on the other hand has a relatively high constant force over a large travel. The invention is characterised by the fact that magnetic fields of alternating polarity are generated at equal intervals in the magnetic field, and that the coil arrangement has 2 adjacent coils, whose size corresponds to half the length of each magnetic pole. A logic circuit is provided to select one of the two coils and to determine the direction of the current depending on the signals of a magnetic field sensor on the coil arrangement.

  18. Linear quadratic optimization for positive LTI system

    Muhafzan, Yenti, Syafrida Wirma; Zulakmal

    2017-05-01

    Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

  19. Calculus problems

    Baronti, Marco; van der Putten, Robertus; Venturi, Irene

    2016-01-01

    This book, intended as a practical working guide for students in Engineering, Mathematics, Physics, or any other field where rigorous calculus is needed, includes 450 exercises. Each chapter starts with a summary of the main definitions and results, which is followed by a selection of solved exercises accompanied by brief, illustrative comments. A selection of problems with indicated solutions rounds out each chapter. A final chapter explores problems that are not designed with a single issue in mind but instead call for the combination of a variety of techniques, rounding out the book’s coverage. Though the book’s primary focus is on functions of one real variable, basic ordinary differential equations (separation of variables, linear first order and constant coefficients ODEs) are also discussed. The material is taken from actual written tests that have been delivered at the Engineering School of the University of Genoa. Literally thousands of students have worked on these problems, ensuring their real-...

  20. Artefacts and the performance of an exhibition

    Svabo, Connie

    2008-01-01

    The article explores the role of mediating artefacts in children's encounters with a museum of natural history. Using actor network theory it explores how a specific artefact shapes the way users relate to exhibited objects and how the artefact guides users' movements in the exhibition....... The mediated performance of an exhibition is explored through an empirical case....

  1. Periodic linear differential stochastic processes

    Kwakernaak, H.

    1975-01-01

    Periodic linear differential processes are defined and their properties are analyzed. Equivalent representations are discussed, and the solutions of related optimal estimation problems are given. An extension is presented of Kailath and Geesey’s [1] results concerning the innovations representation

  2. Uniqueness theorems in linear elasticity

    Knops, Robin John

    1971-01-01

    The classical result for uniqueness in elasticity theory is due to Kirchhoff. It states that the standard mixed boundary value problem for a homogeneous isotropic linear elastic material in equilibrium and occupying a bounded three-dimensional region of space possesses at most one solution in the classical sense, provided the Lame and shear moduli, A and J1 respectively, obey the inequalities (3 A + 2 J1) > 0 and J1>O. In linear elastodynamics the analogous result, due to Neumann, is that the initial-mixed boundary value problem possesses at most one solution provided the elastic moduli satisfy the same set of inequalities as in Kirchhoffs theorem. Most standard textbooks on the linear theory of elasticity mention only these two classical criteria for uniqueness and neglect altogether the abundant literature which has appeared since the original publications of Kirchhoff. To remedy this deficiency it seems appropriate to attempt a coherent description ofthe various contributions made to the study of uniquenes...

  3. Affordances and distributed cognition in museum exhibitions

    Achiam, Marianne; May, Michael; Marandino, Martha

    2014-01-01

    consistent framework. Here, we invoke the notions of affordance and distributed cognition to explain in a coherent way how visitors interact with exhibits and exhibit spaces and make meaning from those interactions, and we exemplify our points using observations of twelve visitors to exhibits at a natural...... history museum. We show how differences in exhibit characteristics give rise to differences in the interpretive strategies used by visitors in their meaning-making process, and conclude by discussing how the notions of affordance and distributed cognition can be used in an exhibit design perspective....

  4. Inverse problems of geophysics

    Yanovskaya, T.B.

    2003-07-01

    This report gives an overview and the mathematical formulation of geophysical inverse problems. General principles of statistical estimation are explained. The maximum likelihood and least square fit methods, the Backus-Gilbert method and general approaches for solving inverse problems are discussed. General formulations of linearized inverse problems, singular value decomposition and properties of pseudo-inverse solutions are given

  5. A New Finite Continuation Algorithm for Linear Programming

    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...

  6. A solution approach for non-linear analysis of concrete members

    Hadi, N. M.; Das, S.

    1999-01-01

    Non-linear solution of reinforced concrete structural members, at and beyond its maximum strength poses complex numerical problems. This is due to the fact that concrete exhibits strain softening behaviour once it reaches its maximum strength. This paper introduces an improved non-linear solution capable to overcome the numerical problems efficiently. The paper also presents a new concept of modeling discrete cracks in concrete members by using gap elements. Gap elements are placed in between two adjacent concrete elements in tensile zone. The magnitude of elongation of gap elements, which represents the width of the crack in concrete, increases edith the increase of tensile stress in those elements. As a result, transfer of local from one concrete element to adjacent elements reduces. Results of non-linear finite element analysis of three concrete beams using this new solution strategy are compared with those obtained by other researchers, and a good agreement is achieved. (authors). 13 refs. 9 figs.,

  7. 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.

  8. The simplex method of linear programming

    Ficken, Frederick A

    1961-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

  9. Foundations of linear and generalized linear models

    Agresti, Alan

    2015-01-01

    A valuable overview of the most important ideas and results in statistical analysis Written by a highly-experienced author, Foundations of Linear and Generalized Linear Models is a clear and comprehensive guide to the key concepts and results of linear statistical models. The book presents a broad, in-depth overview of the most commonly used statistical models by discussing the theory underlying the models, R software applications, and examples with crafted models to elucidate key ideas and promote practical model building. The book begins by illustrating the fundamentals of linear models,

  10. Fuzzy linear programming approach for solving transportation

    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 ...

  11. Investigating Design Research Landscapes through Exhibition

    Jönsson, Li; Hansen, Flemming Tvede; Mäkelä, Maarit

    2013-01-01

    What characterizes a design research exhibition compared to a traditional design and art exhibition? How do you show the very materialities of the design experiments as a means for communicating knowledge of research and of practice? How do you present, review and utilize such an exhibition......? With those questions in mind, the intention and challenge for the Nordes 2013 Design Research Exhibition was to expand on current notions of staging research enquires in design research conference contexts. Artefacts, installations, performances, and other materialities that relate to the theme...... of the conference - Experiments in Design Research – were displayed as tools to express and communicate different design research enquires. Through this paper we will describe the Nordes exhibition as a specific case that renders questions visible in relation to how to utilize a design research exhibition...

  12. Superconductive microstrip exhibiting negative differential resistivity

    Huebener, R.P.; Gallus, D.E.

    1975-01-01

    A device capable of exhibiting negative differential electrical resistivity over a range of values of current and voltage is formed by vapor-depositing a thin layer of a material capable of exhibiting superconductivity on an insulating substrate, establishing electrical connections at opposite ends of the deposited strip, and cooling the alloy into its superconducting range. The device will exhibit negative differential resistivity when biased in the current-induced resistive state

  13. Novel processing of Barkhausen noise signal for assessment of residual stress in surface ground components exhibiting poor magnetic response

    Vashista, M.; Paul, S.

    2011-01-01

    The Barkhausen Noise Analysis (BNA) technique has been utilised to assess surface integrity of steels. But the BNA technique is not very successful in evaluating surface integrity of ground steels that exhibit poor micro-magnetic response. A new approach has been proposed for the processing of BN signal and two newly proposed parameters, namely 'count' and 'event', have been shown to correlate linearly with the residual stress upon grinding, with judicious choice of user defined 'threshold', even when the micro-magnetic response of the work material is poor. In the present study, residual stress induced upon conventional plunge surface grinding of hardened bearing steel has been investigated along with unhardened bearing steel for benchmarking. Moreover, similar correlation has been established, when primarily compressive stress is induced upon high speed grinding using cBN wheel with moderately deep cut suppressing the micro-magnetic response from the ground medium carbon steel as the work material. - Highlights: → The problem of work materials exhibiting poor BN response and poor Barkhausen Noise response is identified. → A novel signal processing strategy is introduced to address the issue of poor micro-magnetic response of some ferromagnetic material. → Potential of newly introduced BN parameters has been studied. → These two BN parameters exhibited linear correlation with residual stress for work material with poor micro-magnetic response.

  14. Principles of linear algebra with Mathematica

    Shiskowski, Kenneth M

    2013-01-01

    A hands-on introduction to the theoretical and computational aspects of linear algebra using Mathematica® Many topics in linear algebra are simple, yet computationally intensive, and computer algebra systems such as Mathematica® are essential not only for learning to apply the concepts to computationally challenging problems, but also for visualizing many of the geometric aspects within this field of study. Principles of Linear Algebra with Mathematica uniquely bridges the gap between beginning linear algebra and computational linear algebra that is often encountered in applied settings,

  15. Correct Linearization of Einstein's Equations

    Rabounski D.

    2006-06-01

    Full Text Available Regularly Einstein's equations can be reduced to a wave form (linearly dependent from the second derivatives of the space metric in the absence of gravitation, the space rotation and Christoffel's symbols. As shown here, the origin of the problem is that one uses the general covariant theory of measurement. Here the wave form of Einstein's equations is obtained in the terms of Zelmanov's chronometric invariants (physically observable projections on the observer's time line and spatial section. The obtained equations depend on solely the second derivatives even if gravitation, the space rotation and Christoffel's symbols. The correct linearization proves: the Einstein equations are completely compatible with weak waves of the metric.

  16. Introduction to computational linear algebra

    Nassif, Nabil; Erhel, Jocelyne

    2015-01-01

    Introduction to Computational Linear Algebra introduces the reader with a background in basic mathematics and computer programming to the fundamentals of dense and sparse matrix computations with illustrating examples. The textbook is a synthesis of conceptual and practical topics in ""Matrix Computations."" The book's learning outcomes are twofold: to understand state-of-the-art computational tools to solve matrix computations problems (BLAS primitives, MATLAB® programming) as well as essential mathematical concepts needed to master the topics of numerical linear algebra. It is suitable for s

  17. Piecewise Linear-Linear Latent Growth Mixture Models with Unknown Knots

    Kohli, Nidhi; Harring, Jeffrey R.; Hancock, Gregory R.

    2013-01-01

    Latent growth curve models with piecewise functions are flexible and useful analytic models for investigating individual behaviors that exhibit distinct phases of development in observed variables. As an extension of this framework, this study considers a piecewise linear-linear latent growth mixture model (LGMM) for describing segmented change of…

  18. A Heuristic for Improving Transmedia Exhibition Experience

    Selvadurai, Vashanth; Rosenstand, Claus Andreas Foss

    2017-01-01

    in the scientific field of designing transmedia experience in an exhibition context that links the pre- and post-activities to the actual visit (during-activities). The result of this study is a preliminary heuristic for establishing a relation between the platform and content complexity in transmedia exhibitions....

  19. Memory and Mourning: An Exhibit History

    Eberle, Scott G.

    2005-01-01

    Mounted by the Strong Museum in Rochester, New York, in 1993, and traveling nationally thereafter, the exhibit Memory and Mourning provided historical and contemporary perspectives to help museum guests explore their own reactions to loss and grief. In the process the exhibit's development team encountered a range of philosophical, historical,…

  20. Let's play game exhibitions : A curator's perspective

    de Vos, Jesse; Glas, M.A.J.|info:eu-repo/dai/nl/330981447; van Vught, J.F.|info:eu-repo/dai/nl/413532682

    2017-01-01

    The Netherlands Institute for Sound and Vision is home to The Experience, a museum exhibiting the history of media in the Netherlands. For ten months in 2016 and 2017, The Experience hosted a temporary exhibition entitled Let’s YouTube . During the Let’s YouTube game month, we programmed a ten-day