WorldWideScience

Sample records for integer arturas dubickas

  1. Investigating Students’ Development of Learning Integer Concept and Integer Addition

    Directory of Open Access Journals (Sweden)

    Nenden Octavarulia Shanty

    2016-09-01

    Full Text Available This research aimed at investigating students’ development of learning integer concept and integer addition. The investigation was based on analyzing students’ works in solving the given mathematical problems in each instructional activity designed based on Realistic Mathematics Education (RME levels. Design research was chosen to achieve and to contribute in developing a local instruction theory for teaching and learning of integer concept and integer addition. In design research, the Hypothetical Learning Trajectory (HLT plays important role as a design and research instrument. It was designed in the phase of preliminary design and tested to three students of grade six OASIS International School, Ankara – Turkey. The result of the experiments showed that temperature in the thermometer context could stimulate students’ informal knowledge of integer concept. Furthermore, strategies and tools used by the students in comparing and relating two temperatures were gradually be developed into a more formal mathematics. The representation of line inside thermometer which then called the number line could bring the students to the last activity levels, namely rules for adding integer, and became the model for more formal reasoning. Based on these findings, it can be concluded that students’ learning integer concept and integer addition developed through RME levels.Keywords: integer concept, integer addition, Realistic Mathematics Education DOI: http://dx.doi.org/10.22342/jme.7.2.3538.57-72

  2. Quantum Integers

    International Nuclear Information System (INIS)

    Khrennikov, Andrei; Klein, Moshe; Mor, Tal

    2010-01-01

    In number theory, a partition of a positive integer n is a way of writing n as a sum of positive integers. The number of partitions of n is given by the partition function p(n). Inspired by quantum information processing, we extend the concept of partitions in number theory as follows: for an integer n, we treat each partition as a basis state of a quantum system representing that number n, so that the Hilbert-space that corresponds to that integer n is of dimension p(n); the 'classical integer' n can thus be generalized into a (pure) quantum state ||ψ(n) > which is a superposition of the partitions of n, in the same way that a quantum bit (qubit) is a generalization of a classical bit. More generally, ρ(n) is a density matrix in that same Hilbert-space (a probability distribution over pure states). Inspired by the notion of quantum numbers in quantum theory (such as in Bohr's model of the atom), we then try to go beyond the partitions, by defining (via recursion) the notion of 'sub-partitions' in number theory. Combining the two notions mentioned above, sub-partitions and quantum integers, we finally provide an alternative definition of the quantum integers [the pure-state |ψ'(n)> and the mixed-state ρ'(n),] this time using the sub-partitions as the basis states instead of the partitions, for describing the quantum number that corresponds to the integer n.

  3. Integer anatomy

    Energy Technology Data Exchange (ETDEWEB)

    Doolittle, R. [ONR, Arlington, VA (United States)

    1994-11-15

    The title integer anatomy is intended to convey the idea of a systematic method for displaying the prime decomposition of the integers. Just as the biological study of anatomy does not teach us all things about behavior of species neither would we expect to learn everything about the number theory from a study of its anatomy. But, some number-theoretic theorems are illustrated by inspection of integer anatomy, which tend to validate the underlying structure and the form as developed and displayed in this treatise. The first statement to be made in this development is: the way structure of the natural numbers is displayed depends upon the allowed operations.

  4. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems

    KAUST Repository

    Domínguez, Luis F.

    2010-12-01

    This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd.

  5. Integer programming

    CERN Document Server

    Conforti, Michele; Zambelli, Giacomo

    2014-01-01

    This book is an elegant and rigorous presentation of integer programming, exposing the subject’s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader’s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.

  6. PageRank of integers

    International Nuclear Information System (INIS)

    Frahm, K M; Shepelyansky, D L; Chepelianskii, A D

    2012-01-01

    We up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is approximately inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows us to find this vector for matrices of billion size. This network provides a new PageRank order of integers. (paper)

  7. Integer programming theory, applications, and computations

    CERN Document Server

    Taha, Hamdy A

    1975-01-01

    Integer Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming.Organized into eight chapters, this book begins with an overview of the general categorization of integer applications and explains the three fundamental techniques of integer programming. This text then explores the concept of implicit enumeration, which is general in a sense that it is applicable to any well-defined binary program. Other

  8. Hard equality constrained integer knapsacks

    NARCIS (Netherlands)

    Aardal, K.I.; Lenstra, A.K.; Cook, W.J.; Schulz, A.S.

    2002-01-01

    We consider the following integer feasibility problem: "Given positive integer numbers a 0, a 1,..., a n, with gcd(a 1,..., a n) = 1 and a = (a 1,..., a n), does there exist a nonnegative integer vector x satisfying ax = a 0?" Some instances of this type have been found to be extremely hard to solve

  9. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems

    KAUST Repository

    Domí nguez, Luis F.; Pistikopoulos, Efstratios N.

    2010-01-01

    continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem

  10. Applied Integer Programming Modeling and Solution

    CERN Document Server

    Chen, Der-San; Dang, Yu

    2011-01-01

    An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and

  11. Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers

    Science.gov (United States)

    Donnell, William A.

    2012-01-01

    In intermediate and college algebra courses there are a number of methods for factoring quadratic trinomials with integer coefficients over the integers. Some of these methods have been given names, such as trial and error, reversing FOIL, AC method, middle term splitting method and slip and slide method. The purpose of this article is to discuss…

  12. A statistical mechanical approach to restricted integer partition functions

    Science.gov (United States)

    Zhou, Chi-Chun; Dai, Wu-Sheng

    2018-05-01

    The main aim of this paper is twofold: (1) suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions—a way of writing an integer as a sum of other integers under certain restrictions. In this approach, the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases. (2) Introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of Gentile statistics in statistical mechanics; many kinds of restricted integer partition functions are special cases of this restricted integer partition function. Moreover, with statistical mechanics as a bridge, we reveal a mathematical fact: the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups. Using this approach, we provide some expressions of restricted integer partition functions as examples.

  13. Integer-valued trawl processes

    DEFF Research Database (Denmark)

    Barndorff-Nielsen, Ole E.; Lunde, Asger; Shephard, Neil

    2014-01-01

    the probabilistic properties of such processes in detail and, in addition, study volatility modulation and multivariate extensions within the new modelling framework. Moreover, we describe how the parameters of a trawl process can be estimated and obtain promising estimation results in our simulation study. Finally......This paper introduces a new continuous-time framework for modelling serially correlated count and integer-valued data. The key component in our new model is the class of integer-valued trawl processes, which are serially correlated, stationary, infinitely divisible processes. We analyse...

  14. Integer and combinatorial optimization

    CERN Document Server

    Nemhauser, George L

    1999-01-01

    Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f

  15. Analysis misconception of integers in microteaching activities

    Science.gov (United States)

    Setyawati, R. D.; Indiati, I.

    2018-05-01

    This study view to analyse student misconceptions on integers in microteaching activities. This research used qualitative research design. An integers test contained questions from eight main areas of integers. The Integers material test includes (a) converting the image into fractions, (b) examples of positive numbers including rational numbers, (c) operations in fractions, (d) sorting fractions from the largest to the smallest, and vice versa; e) equate denominator, (f) concept of ratio mark, (g) definition of fraction, and (h) difference between fractions and parts. The results indicated an integers concepts: (1) the students have not been able to define concepts well based on the classification of facts in organized part; (2) The correlational concept: students have not been able to combine interrelated events in the form of general principles; and (3) theoretical concepts: students have not been able to use concepts that facilitate in learning the facts or events in an organized system.

  16. Harmonic oscillator states with integer and non-integer orbital angular momentum

    International Nuclear Information System (INIS)

    Land, Martin

    2011-01-01

    We study the quantum mechanical harmonic oscillator in two and three dimensions, with particular attention to the solutions as basis states for representing their respective symmetry groups — O(2), O(1,1), O(3), and O(2,1). The goal of this study is to establish a correspondence between Hilbert space descriptions found by solving the Schrodinger equation in polar coordinates, and Fock space descriptions constructed by expressing the symmetry operators in terms of creation/annihilation operators. We obtain wavefunctions characterized by a principal quantum number, the group Casimir eigenvalue, and one group generator whose eigenvalue is m + s, for integer m and real constant parameter s. For the three groups that contain O(2), the solutions split into two inequivalent representations, one associated with s = 0, from which we recover the familiar description of the oscillator as a product of one-dimensional solutions, and the other with s > 0 (in three dimensions, solutions are found for s = 0 and s = 1/2) whose solutions are non-separable in Cartesian coordinates, and are hence overlooked by the standard Fock space approach. The O(1,1) solutions are singlet states, restricted to zero eigenvalue of the symmetry operator, which represents the boost, not angular momentum. For O(2), a single set of creation and annihilation operators forms a ladder representation for the allowed oscillator states for any s, and the degeneracy of energy states is always finite. However, in three dimensions, the integer and half-integer eigenstates are qualitatively different: the former can be expressed as finite dimensional irreducible tensors under O(3) or O(2,1) while the latter exhibit infinite degeneracy. Creation operators that produce the allowed integer states by acting on the non-degenerate ground state are constructed as irreducible tensor products of the fundamental vector representation. However, the half-integer eigenstates are infinite-dimensional, as expected for the non

  17. On the Delone property of (−β-integers

    Directory of Open Access Journals (Sweden)

    Wolfgang Steiner

    2011-08-01

    Full Text Available The (−β-integers are natural generalisations of the β-integers, and thus of the integers, for negative real bases. They can be described by infinite words which are fixed points of anti-morphisms. We show that they are not necessarily uniformly discrete and relatively dense in the real numbers.

  18. Quasi-greedy systems of integer translates

    DEFF Research Database (Denmark)

    Nielsen, Morten; Sikic, Hrvoje

    We consider quasi-greedy systems of integer translates in a finitely generated shift invariant subspace of L2(Rd), that is systems for which the thresholding approximation procedure is well behaved. We prove that every quasi-greedy system of integer translates is also a Riesz basis for its closed...

  19. Quasi-greedy systems of integer translates

    DEFF Research Database (Denmark)

    Nielsen, Morten; Sikic, Hrvoje

    2008-01-01

    We consider quasi-greedy systems of integer translates in a finitely generated shift-invariant subspace of L2(Rd), that is systems for which the thresholding approximation procedure is well behaved. We prove that every quasi-greedy system of integer translates is also a Riesz basis for its closed...

  20. Ramsey theory on the integers

    CERN Document Server

    Landman, Bruce M

    2003-01-01

    Ramsey theory is the study of the structure of mathematical objects that is preserved under partitions. In its full generality, Ramsey theory is quite powerful, but can quickly become complicated. By limiting the focus of this book to Ramsey theory applied to the set of integers, the authors have produced a gentle, but meaningful, introduction to an important and enticing branch of modern mathematics. Ramsey Theory on the Integers offers students something quite rare for a book at this level: a glimpse into the world of mathematical research and the opportunity to begin pondering unsolved problems themselves. In addition to being the first truly accessible book on Ramsey theory, this innovative book also provides the first cohesive study of Ramsey theory on the integers. It contains perhaps the most substantial account of solved and unsolved problems in this blossoming subarea of Ramsey theory. The result is a breakthrough book that will engage students, teachers, and researchers alike.

  1. Fractal electrodynamics via non-integer dimensional space approach

    Science.gov (United States)

    Tarasov, Vasily E.

    2015-09-01

    Using the recently suggested vector calculus for non-integer dimensional space, we consider electrodynamics problems in isotropic case. This calculus allows us to describe fractal media in the framework of continuum models with non-integer dimensional space. We consider electric and magnetic fields of fractal media with charges and currents in the framework of continuum models with non-integer dimensional spaces. An application of the fractal Gauss's law, the fractal Ampere's circuital law, the fractal Poisson equation for electric potential, and equation for fractal stream of charges are suggested. Lorentz invariance and speed of light in fractal electrodynamics are discussed. An expression for effective refractive index of non-integer dimensional space is suggested.

  2. Linear and integer programming made easy

    CERN Document Server

    Hu, T C

    2016-01-01

    Linear and integer programming are fundamental toolkits for data and information science and technology, particularly in the context of today’s megatrends toward statistical optimization, machine learning, and big data analytics. Drawn from over 30 years of classroom teaching and applied research experience, this textbook provides a crisp and practical introduction to the basics of linear and integer programming. The authors’ approach is accessible to students from all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification, and computer vision. Readers will learn to cast hard combinatorial problems as mathematical programming optimizations, understand how to achieve formulations where the objective and constraints are linear, choose appropriate solution methods, and interpret results appropriately. •Provides a concise introduction to linear and integer programming, appropriate for undergraduates, graduates, a short cours...

  3. Positive integer solutions of certain diophantine equations

    Indian Academy of Sciences (India)

    BIJAN KUMAR PATEL

    2018-03-19

    Mar 19, 2018 ... integer solutions. They also found all the positive integer solutions of the given equations in terms of Fibonacci and Lucas numbers. Another interesting number sequence which is closely related to the sequence of. Fibonacci numbers is the sequence of balancing numbers. In 1999, Behera et al. [1] intro-.

  4. Diversity and non-integer differentiation for system dynamics

    CERN Document Server

    Oustaloup, Alain

    2014-01-01

    Based on a structured approach to diversity, notably inspired by various forms of diversity of natural origins, Diversity and Non-integer Derivation Applied to System Dynamics provides a study framework to the introduction of the non-integer derivative as a modeling tool. Modeling tools that highlight unsuspected dynamical performances (notably damping performances) in an ""integer"" approach of mechanics and automation are also included. Written to enable a two-tier reading, this is an essential resource for scientists, researchers, and industrial engineers interested in this subject area. Ta

  5. Superposition of two optical vortices with opposite integer or non-integer orbital angular momentum

    Directory of Open Access Journals (Sweden)

    Carlos Fernando Díaz Meza

    2016-01-01

    Full Text Available This work develops a brief proposal to achieve the superposition of two opposite vortex beams, both with integer or non-integer mean value of the orbital angular momentum. The first part is about the generation of this kind of spatial light distributions through a modified Brown and Lohmann’s hologram. The inclusion of a simple mathematical expression into the pixelated grid’s transmittance function, based in Fourier domain properties, shifts the diffraction orders counterclockwise and clockwise to the same point and allows the addition of different modes. The strategy is theoretically and experimentally validated for the case of two opposite rotation helical wavefronts.

  6. S-parts of terms of integer linear recurrence sequences

    NARCIS (Netherlands)

    Bugeaud, Y.; Evertse, J.H.

    2017-01-01

    Let S = {q1 , . . . , qs } be a finite, non-empty set of distinct prime numbers. For a non-zero integer m, write m = q1^ r1 . . . qs^rs M, where r1 , . . . , rs  are non-negative integers and M is an integer relatively prime to q1 . . . qs. We define the S-part [m]_S of m by [m]_S := q1^r1 . . .

  7. Neomysis integer: a review

    OpenAIRE

    Fockedey, N.

    2005-01-01

    The present chapter aims to be a literature review on the brackish water mysid Neomysis integer, with focus on its feeding ecology, life history aspects, behaviour, physiology, biochemical composition, bioenergetics and ecotoxico10gy. All records on the species, available from literature, are listed as an appendix. The review aims to identify the state-of-the-art and the gaps in our knowledge on the species. Abundant information is available on the distribution patterns of Neomysis integer in...

  8. Former health care vice minister sentenced / Rokas M. Tracevskis

    Index Scriptorium Estoniae

    Tracevskis, Rokas M.

    2010-01-01

    Leedu endise tervishoiu aseministri Arturas Skikase kohtuotsusest seoses altkäemaksu võtmisega. Arturas Skikas tunnistas üles, et soovis saada verekeskuse direktori käest 5800 eurot. Tervishoiuminister Algis Caplikas jääb ametisse

  9. Binary Positive Semidefinite Matrices and Associated Integer Polytopes

    DEFF Research Database (Denmark)

    Letchford, Adam N.; Sørensen, Michael Malmros

    2012-01-01

    We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...

  10. Neutrosophic Integer Programming Problem

    Directory of Open Access Journals (Sweden)

    Mai Mohamed

    2017-02-01

    Full Text Available In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered.

  11. Garbage-free reversible constant multipliers for arbitrary integers

    DEFF Research Database (Denmark)

    Mogensen, Torben Ægidius

    2013-01-01

    We present a method for constructing reversible circuitry for multiplying integers by arbitrary integer constants. The method is based on Mealy machines and gives circuits whose size are (in the worst case) linear in the size of the constant. This makes the method unsuitable for large constants...

  12. A fixed recourse integer programming approach towards a ...

    African Journals Online (AJOL)

    Regardless of the success that linear programming and integer linear programming has had in applications in engineering, business and economics, one has to challenge the assumed reality that these optimization models represent. In this paper the certainty assumptions of an integer linear program application is ...

  13. Integers annual volume 2013

    CERN Document Server

    Landman, Bruce

    2014-01-01

    ""Integers"" is a refereed online journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. This work presents all papers of the 2013 volume in book form.

  14. A General Approach for Orthogonal 4-Tap Integer Multiwavelet Transforms

    Directory of Open Access Journals (Sweden)

    Mingli Jing

    2010-01-01

    Full Text Available An algorithm for orthogonal 4-tap integer multiwavelet transforms is proposed. We compute the singular value decomposition (SVD of block recursive matrices of transform matrix, and then transform matrix can be rewritten in a product of two block diagonal matrices and a permutation matrix. Furthermore, we factorize the block matrix of block diagonal matrices into triangular elementary reversible matrices (TERMs, which map integers to integers by rounding arithmetic. The cost of factorizing block matrix into TERMs does not increase with the increase of the dimension of transform matrix, and the proposed algorithm is in-place calculation and without allocating auxiliary memory. Examples of integer multiwavelet transform using DGHM and CL are given, which verify that the proposed algorithm is an executable algorithm and outperforms the existing algorithm for orthogonal 4-tap integer multiwavelet transform.

  15. Spreading Sequences Generated Using Asymmetrical Integer-Number Maps

    Directory of Open Access Journals (Sweden)

    V. Sebesta

    2007-09-01

    Full Text Available Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed to the binary sequences. The binary sequences produced via proposed modified integer-number maps are perfectly balanced and embody good autocorrelation and crosscorrelation properties. The number of different binary sequences is sizable. The sequences are suitable as spreading sequences in DS/CDMA systems.

  16. Integer-valued time series

    NARCIS (Netherlands)

    van den Akker, R.

    2007-01-01

    This thesis adresses statistical problems in econometrics. The first part contributes statistical methodology for nonnegative integer-valued time series. The second part of this thesis discusses semiparametric estimation in copula models and develops semiparametric lower bounds for a large class of

  17. Integer programming techniques for educational timetabling

    DEFF Research Database (Denmark)

    Fonseca, George H.G.; Santos, Haroldo G.; Carrano, Eduardo G.

    2017-01-01

    in recent studies in the field. This work presents new cuts and reformulations for the existing integer programming model for XHSTT. The proposed cuts improved hugely the linear relaxation of the formulation, leading to an average gap reduction of 32%. Applied to XHSTT-2014 instance set, the alternative...... formulation provided four new best known lower bounds and, used in a matheuristic framework, improved eleven best known solutions. The computational experiments also show that the resulting integer programming models from the proposed formulation are more effectively solved for most of the instances....

  18. Anisotropic fractal media by vector calculus in non-integer dimensional space

    Energy Technology Data Exchange (ETDEWEB)

    Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru [Skobeltsyn Institute of Nuclear Physics, Lomonosov Moscow State University, Moscow 119991 (Russian Federation)

    2014-08-15

    A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.

  19. Anisotropic fractal media by vector calculus in non-integer dimensional space

    Science.gov (United States)

    Tarasov, Vasily E.

    2014-08-01

    A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.

  20. Anisotropic fractal media by vector calculus in non-integer dimensional space

    International Nuclear Information System (INIS)

    Tarasov, Vasily E.

    2014-01-01

    A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media

  1. Mixed integer evolution strategies for parameter optimization.

    Science.gov (United States)

    Li, Rui; Emmerich, Michael T M; Eggermont, Jeroen; Bäck, Thomas; Schütz, M; Dijkstra, J; Reiber, J H C

    2013-01-01

    Evolution strategies (ESs) are powerful probabilistic search and optimization algorithms gleaned from biological evolution theory. They have been successfully applied to a wide range of real world applications. The modern ESs are mainly designed for solving continuous parameter optimization problems. Their ability to adapt the parameters of the multivariate normal distribution used for mutation during the optimization run makes them well suited for this domain. In this article we describe and study mixed integer evolution strategies (MIES), which are natural extensions of ES for mixed integer optimization problems. MIES can deal with parameter vectors consisting not only of continuous variables but also with nominal discrete and integer variables. Following the design principles of the canonical evolution strategies, they use specialized mutation operators tailored for the aforementioned mixed parameter classes. For each type of variable, the choice of mutation operators is governed by a natural metric for this variable type, maximal entropy, and symmetry considerations. All distributions used for mutation can be controlled in their shape by means of scaling parameters, allowing self-adaptation to be implemented. After introducing and motivating the conceptual design of the MIES, we study the optimality of the self-adaptation of step sizes and mutation rates on a generalized (weighted) sphere model. Moreover, we prove global convergence of the MIES on a very general class of problems. The remainder of the article is devoted to performance studies on artificial landscapes (barrier functions and mixed integer NK landscapes), and a case study in the optimization of medical image analysis systems. In addition, we show that with proper constraint handling techniques, MIES can also be applied to classical mixed integer nonlinear programming problems.

  2. Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg

    2003-01-01

    We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, bf Z[ ]i.e. the integers extended with , a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd and deri......We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, bf Z[ ]i.e. the integers extended with , a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd...

  3. Spinor Field Realizations of the half-integer $W_{2,s}$ Strings

    OpenAIRE

    Wei, Shao-Wen; Liu, Yu-Xiao; Zhang, Li-Jie; Ren, Ji-Rong

    2008-01-01

    The grading Becchi-Rouet-Stora-Tyutin (BRST) method gives a way to construct the integer $W_{2,s}$ strings, where the BRST charge is written as $Q_B=Q_0+Q_1$. Using this method, we reconstruct the nilpotent BRST charges $Q_{0}$ for the integer $W_{2,s}$ strings and the half-integer $W_{2,s}$ strings. Then we construct the exact grading BRST charge with spinor fields and give the new realizations of the half-integer $W_{2,s}$ strings for the cases of $s=3/2$, 5/2, and 7/2.

  4. Presolving and regularization in mixed-integer second-order cone optimization

    DEFF Research Database (Denmark)

    Friberg, Henrik Alsing

    Mixed-integer second-order cone optimization is a powerful mathematical framework capable of representing both logical conditions and nonlinear relationships in mathematical models of industrial optimization problems. What is more, solution methods are already part of many major commercial solvers...... both continuous and mixed-integer conic optimization in general, is discovered and treated. This part of the thesis continues the studies of facial reduction preceding the work of Borwein and Wolkowicz [17] in 1981, when the first algorithmic cure for these kinds of reliability issues were formulated....... An important distinction to make between continuous and mixed-integer optimization, however, is that the reliability issues occurring in mixed-integer optimization cannot be blamed on the practitioner’s formulation of the problem. Specifically, as shown, the causes for these issues may well lie within...

  5. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    Science.gov (United States)

    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.

  6. Rewrite systems for integer arithmetic

    NARCIS (Netherlands)

    H.R. Walters (Pum); H. Zantema (Hans)

    1995-01-01

    textabstractWe present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by

  7. Rewrite systems for integer arithmetic

    NARCIS (Netherlands)

    Walters, H.R.; Zantema, H.

    1994-01-01

    We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground con uent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and

  8. A few Smarandache Integer Sequences

    OpenAIRE

    Ibstedt, Henry

    2010-01-01

    This paper deals with the analysis of a few Smarandache Integer Sequences which first appeared in Properties or the Numbers, F. Smarandache, University or Craiova Archives, 1975. The first four sequences are recurrence generated sequences while the last three are concatenation sequences.

  9. A time series model: First-order integer-valued autoregressive (INAR(1))

    Science.gov (United States)

    Simarmata, D. M.; Novkaniza, F.; Widyaningsih, Y.

    2017-07-01

    Nonnegative integer-valued time series arises in many applications. A time series model: first-order Integer-valued AutoRegressive (INAR(1)) is constructed by binomial thinning operator to model nonnegative integer-valued time series. INAR (1) depends on one period from the process before. The parameter of the model can be estimated by Conditional Least Squares (CLS). Specification of INAR(1) is following the specification of (AR(1)). Forecasting in INAR(1) uses median or Bayesian forecasting methodology. Median forecasting methodology obtains integer s, which is cumulative density function (CDF) until s, is more than or equal to 0.5. Bayesian forecasting methodology forecasts h-step-ahead of generating the parameter of the model and parameter of innovation term using Adaptive Rejection Metropolis Sampling within Gibbs sampling (ARMS), then finding the least integer s, where CDF until s is more than or equal to u . u is a value taken from the Uniform(0,1) distribution. INAR(1) is applied on pneumonia case in Penjaringan, Jakarta Utara, January 2008 until April 2016 monthly.

  10. Integers without large prime factors in short intervals: Conditional ...

    Indian Academy of Sciences (India)

    α > 0 the interval (X, X +. √. X(log X)1/2+o(1)] contains an integer having no prime factor exceeding Xα for all X sufficiently large. Keywords. Smooth numbers; Riemann zeta function. 1. Introduction. Suppose P (n) denotes the largest prime factor of an integer n > 1 and let us declare. P(1) = 1. Given a positive real number y, ...

  11. Parallel Integer Factorization Using Quadratic Forms

    National Research Council Canada - National Science Library

    McMath, Stephen S

    2005-01-01

    Factorization is important for both practical and theoretical reasons. In secure digital communication, security of the commonly used RSA public key cryptosystem depends on the difficulty of factoring large integers...

  12. Optimal Diet Planning for Eczema Patient Using Integer Programming

    Science.gov (United States)

    Zhen Sheng, Low; Sufahani, Suliadi

    2018-04-01

    Human diet planning is conducted by choosing appropriate food items that fulfill the nutritional requirements into the diet formulation. This paper discusses the application of integer programming to build the mathematical model of diet planning for eczema patients. The model developed is used to solve the diet problem of eczema patients from young age group. The integer programming is a scientific approach to select suitable food items, which seeks to minimize the costs, under conditions of meeting desired nutrient quantities, avoiding food allergens and getting certain foods into the diet that brings relief to the eczema conditions. This paper illustrates that the integer programming approach able to produce the optimal and feasible solution to deal with the diet problem of eczema patient.

  13. A new algorithm for benchmarking in integer data envelopment analysis

    Directory of Open Access Journals (Sweden)

    M. M. Omran

    2012-08-01

    Full Text Available The aim of this study is to investigate the effect of integer data in data envelopment analysis (DEA. The inputs and outputs in different types of DEA are considered to be continuous. In most application-oriented problems, some or all data are integers; and subsequently, the continuous condition of the values is omitted. For example, situations in which the inputs/outputs are representatives of the number of cars, people, etc. In fact, the benchmark unit is artificial and does not contain integer inputs/outputs after projection on the efficiency frontier. By rounding off the projection point, we may lose the feasibility or end up having inefficient DMU. In such cases, it is required to provide a benchmark unit such that the considered unit reaches the efficiency. In the present short communication, by proposing a novel algorithm, the projecting of an inefficient DMU is carried out in such a way that produced benchmarking takes values with fully integer inputs/outputs.

  14. Stochastic programming with integer recourse

    NARCIS (Netherlands)

    van der Vlerk, Maarten Hendrikus

    1995-01-01

    In this thesis we consider two-stage stochastic linear programming models with integer recourse. Such models are at the intersection of two different branches of mathematical programming. On the one hand some of the model parameters are random, which places the problem in the field of stochastic

  15. Ramsey theory on the integers

    CERN Document Server

    Landman, Bruce M

    2014-01-01

    Ramsey theory is the study of the structure of mathematical objects that is preserved under partitions. In its full generality, Ramsey theory is quite powerful, but can quickly become complicated. By limiting the focus of this book to Ramsey theory applied to the set of integers, the authors have produced a gentle, but meaningful, introduction to an important and enticing branch of modern mathematics. Ramsey Theory on the Integers offers students a glimpse into the world of mathematical research and the opportunity for them to begin pondering unsolved problems. For this new edition, several sections have been added and others have been significantly updated. Among the newly introduced topics are: rainbow Ramsey theory, an "inequality" version of Schur's theorem, monochromatic solutions of recurrence relations, Ramsey results involving both sums and products, monochromatic sets avoiding certain differences, Ramsey properties for polynomial progressions, generalizations of the Erdős-Ginzberg-Ziv theorem, and t...

  16. Suppression of tunneling by interference in half-integer--spin particles

    OpenAIRE

    Loss, Daniel; DiVincenzo, David P.; Grinstein, G.

    1992-01-01

    Within a wide class of ferromagnetic and antiferromagnetic systems, quantum tunneling of magnetization direction is spin-parity dependent: it vanishes for magnetic particles with half-integer spin, but is allowed for integer spin. A coherent-state path integral calculation shows that this topological effect results from interference between tunneling paths.

  17. Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

    Science.gov (United States)

    Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

    2010-01-01

    We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

  18. Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.

    Science.gov (United States)

    Demirci, Nagehan; Tönük, Ergin

    2014-01-01

    During the last decades, derivatives and integrals of non-integer orders are being more commonly used for the description of constitutive behavior of various viscoelastic materials including soft biological tissues. Compared to integer order constitutive relations, non-integer order viscoelastic material models of soft biological tissues are capable of capturing a wider range of viscoelastic behavior obtained from experiments. Although integer order models may yield comparably accurate results, non-integer order material models have less number of parameters to be identified in addition to description of an intermediate material that can monotonically and continuously be adjusted in between an ideal elastic solid and an ideal viscous fluid. In this work, starting with some preliminaries on non-integer (fractional) calculus, the "spring-pot", (intermediate mechanical element between a solid and a fluid), non-integer order three element (Zener) solid model, finally a user-defined large strain non-integer order viscoelastic constitutive model was constructed to be used in finite element simulations. Using the constitutive equation developed, by utilizing inverse finite element method and in vivo indentation experiments, soft tissue material identification was performed. The results indicate that material coefficients obtained from relaxation experiments, when optimized with creep experimental data could simulate relaxation, creep and cyclic loading and unloading experiments accurately. Non-integer calculus viscoelastic constitutive models, having physical interpretation and modeling experimental data accurately is a good alternative to classical phenomenological viscoelastic constitutive equations.

  19. 7th Conference on Non-Integer Order Calculus and Its Applications

    CERN Document Server

    Dworak, Paweł

    2016-01-01

    This volume is devoted to presentation of new results of research on systems of non-integer order, called also fractional systems. Their analysis and practical implementation have been the object of spontaneous development for a few last decades. The fractional order models can depict a physical plant better than the classical integer order ones. This covers different research fields such as insulator properties, visco-elastic materials, electrodynamic, electrothermal, electrochemical, economic processes modelling etc. On the other hand fractional controllers often outperform their integer order counterparts. This volume contains new ideas and examples of implementation, theoretical and pure practical aspects of using a non-integer order calculus. It is divided into four parts covering: mathematical fundamentals, modeling and approximations, controllability, observability and stability problems and practical applications of fractional control systems. The first part expands the base of tools and methods of th...

  20. Frozen density embedding with non-integer subsystems' particle numbers.

    Science.gov (United States)

    Fabiano, Eduardo; Laricchia, Savio; Della Sala, Fabio

    2014-03-21

    We extend the frozen density embedding theory to non-integer subsystems' particles numbers. Different features of this formulation are discussed, with special concern for approximate embedding calculations. In particular, we highlight the relation between the non-integer particle-number partition scheme and the resulting embedding errors. Finally, we provide a discussion of the implications of the present theory for the derivative discontinuity issue and the calculation of chemical reactivity descriptors.

  1. Deterministic integer multiple firing depending on initial state in Wang model

    Energy Technology Data Exchange (ETDEWEB)

    Xie Yong [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China)]. E-mail: yxie@mail.xjtu.edu.cn; Xu Jianxue [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China); Jiang Jun [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China)

    2006-12-15

    We investigate numerically dynamical behaviour of the Wang model, which describes the rhythmic activities of thalamic relay neurons. The model neuron exhibits Type I excitability from a global view, but Type II excitability from a local view. There exists a narrow range of bistability, in which a subthreshold oscillation and a suprathreshold firing behaviour coexist. A special firing pattern, integer multiple firing can be found in the certain part of the bistable range. The characteristic feature of such firing pattern is that the histogram of interspike intervals has a multipeaked structure, and the peaks are located at about integer multiples of a basic interspike interval. Since the Wang model is noise-free, the integer multiple firing is a deterministic firing pattern. The existence of bistability leads to the deterministic integer multiple firing depending on the initial state of the model neuron, i.e., the initial values of the state variables.

  2. Deterministic integer multiple firing depending on initial state in Wang model

    International Nuclear Information System (INIS)

    Xie Yong; Xu Jianxue; Jiang Jun

    2006-01-01

    We investigate numerically dynamical behaviour of the Wang model, which describes the rhythmic activities of thalamic relay neurons. The model neuron exhibits Type I excitability from a global view, but Type II excitability from a local view. There exists a narrow range of bistability, in which a subthreshold oscillation and a suprathreshold firing behaviour coexist. A special firing pattern, integer multiple firing can be found in the certain part of the bistable range. The characteristic feature of such firing pattern is that the histogram of interspike intervals has a multipeaked structure, and the peaks are located at about integer multiples of a basic interspike interval. Since the Wang model is noise-free, the integer multiple firing is a deterministic firing pattern. The existence of bistability leads to the deterministic integer multiple firing depending on the initial state of the model neuron, i.e., the initial values of the state variables

  3. 5th Conference on Non-integer Order Calculus and Its Applications

    CERN Document Server

    Kacprzyk, Janusz; Baranowski, Jerzy

    2013-01-01

    This volume presents various aspects of non-integer order systems, also known as fractional systems, which have recently attracted an increasing attention in the scientific community of systems science, applied mathematics, control theory. Non-integer systems have become relevant for many fields of science and technology exemplified by the modeling of signal transmission, electric noise, dielectric polarization, heat transfer, electrochemical reactions, thermal processes,  acoustics, etc. The content is divided into six parts, every of which considers one of the currently relevant problems. In the first part the Realization problem is discussed, with a special focus on positive systems. The second part considers stability of certain classes of non-integer order systems with and without delays. The third part is focused on such important aspects as controllability, observability and optimization especially in discrete time. The fourth part is focused on distributed systems where non-integer calculus leads to ...

  4. Performance Analysis for Cooperative Communication System with QC-LDPC Codes Constructed with Integer Sequences

    Directory of Open Access Journals (Sweden)

    Yan Zhang

    2015-01-01

    Full Text Available This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.

  5. Leedu kunst on integratsioonivõimeline / Eha Komissarov

    Index Scriptorium Estoniae

    Komissarov, Eha, 1947-

    2004-01-01

    Leedu kaasaegse kunsti näitus "Omas mahlas" Tallinna Kunstihoones (Evaldas Jansas, Egle Rakauskaite) ja Rotermanni soolalaos (Loreta Bilinskaite-Burke, Laura Barbshtiene & Arturas Bumshteinas (G-Lab), Jonas Gasiunas, Arunas Gudaitis, Linas Jablonskis, Dainius Lishkevicius, Mindaugas Lukoshaitis, Gintaras Makarevicius, Deimantas Narkevicius, Egle Ridikaite, Irma Stanaityte, Laura Stasiulyte, Mindaugas Shimkus, Arturas Valiauga, Rimaldas Vikshraitis, Darius Zhiura). Kuraator Anders Kreuger leedu kunstniku kuvandiloomest

  6. Searching for optimal integer solutions to set partitioning problems using column generation

    OpenAIRE

    Bredström, David; Jörnsten, Kurt; Rönnqvist, Mikael

    2007-01-01

    We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can re...

  7. DESIGN STUDY: INTEGER SUBTRACTION OPERATION TEACHING LEARNING USING MULTIMEDIA IN PRIMARY SCHOOL

    Directory of Open Access Journals (Sweden)

    Rendi Muhammad Aris

    2016-12-01

    Full Text Available This study aims to develop a learning trajectory to help students understand concept of subtraction of integers using multimedia in the fourth grade. This study is thematic integrative learning in Curriculum 2013 PMRI based. The method used is design research consists of three stages; preparing for the experiment, design experiment, retrospective analysis. The studied was conducted on 20 students of grade four SDN 1 Muara Batun, OKI. The activities of students in this study consisted of six learning trajectories. The first activity asks the students to classify heroism and non-heroism acts, summarize, and classify integers and non-integer. The second activity asks the students to answer the questions in the film given. The third activity asks students to count the remaining gravel in the film. The fourth activity asks students to count remaining spent money in the film. The fifth activity invites students to play rubber seeds in the bag. The last activity asks students to answer the questions in the student worksheet. The media used along the learning activities are a ruler, rubber seed, student worksheet, money, gravel, and film. The results indicate that the learning trajectory using multimedia help students understand the concept of integer subtraction integer. Keywords: Subtraction Integer, PMRI, Multimedia DOI: http://dx.doi.org/10.22342/jme.8.1.3233.95-102

  8. Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic

    NARCIS (Netherlands)

    Bruintjes, Tom; Walters, K.H.G.; Gerez, Sabih H.; Molenkamp, Egbert; Smit, Gerardus Johannes Maria

    In spite of the fact that floating-point arithmetic is costly in terms of silicon area, the joint design of hardware for floating-point and integer arithmetic is seldom considered. While components like multipliers and adders can potentially be shared, floating-point and integer units in

  9. Reversible Integer Wavelet Transform for the Joint of Image Encryption and Watermarking

    Directory of Open Access Journals (Sweden)

    Bin Wang

    2015-01-01

    Full Text Available In recent years, signal processing in the encrypted domain has attracted considerable research interest, especially embedding watermarking in encrypted image. In this work, a novel joint of image encryption and watermarking based on reversible integer wavelet transform is proposed. Firstly, the plain-image is encrypted by chaotic maps and reversible integer wavelet transform. Then the lossless watermarking is embedded in the encrypted image by reversible integer wavelet transform and histogram modification. Finally an encrypted image containing watermarking is obtained by the inverse integer wavelet transform. What is more, the original image and watermarking can be completely recovered by inverse process. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security and embedding capacity than previous works. It is suitable for protecting the image information.

  10. Stochastic integer programming by dynamic programming

    NARCIS (Netherlands)

    Lageweg, B.J.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; Stougie, L.; Ermoliev, Yu.; Wets, R.J.B.

    1988-01-01

    Stochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions. Dynamic programming techniques can be used to

  11. Population transfer HMQC for half-integer quadrupolar nuclei

    International Nuclear Information System (INIS)

    Wang, Qiang; Xu, Jun; Feng, Ningdong; Deng, Feng; Li, Yixuan; Trébosc, Julien; Lafon, Olivier; Hu, Bingwen; Chen, Qun; Amoureux, Jean-Paul

    2015-01-01

    This work presents a detailed analysis of a recently proposed nuclear magnetic resonance method [Wang et al., Chem. Commun. 49(59), 6653-6655 (2013)] for accelerating heteronuclear coherence transfers involving half-integer spin quadrupolar nuclei by manipulating their satellite transitions. This method, called Population Transfer Heteronuclear Multiple Quantum Correlation (PT-HMQC), is investigated in details by combining theoretical analyses, numerical simulations, and experimental investigations. We find that compared to instant inversion or instant saturation, continuous saturation is the most practical strategy to accelerate coherence transfers on half-integer quadrupolar nuclei. We further demonstrate that this strategy is efficient to enhance the sensitivity of J-mediated heteronuclear correlation experiments between two half-integer quadrupolar isotopes (e.g., 27 Al- 17 O). In this case, the build-up is strongly affected by relaxation for small T 2 ′ and J coupling values, and shortening the mixing time makes a huge signal enhancement. Moreover, this concept of population transfer can also be applied to dipolar-mediated HMQC experiments. Indeed, on the AlPO 4 -14 sample, one still observes experimentally a 2-fold shortening of the optimum mixing time albeit with no significant signal gain in the 31 P-( 27 Al) experiments

  12. Edge states and integer quantum Hall effect in topological insulator thin films.

    Science.gov (United States)

    Zhang, Song-Bo; Lu, Hai-Zhou; Shen, Shun-Qing

    2015-08-25

    The integer quantum Hall effect is a topological state of quantum matter in two dimensions, and has recently been observed in three-dimensional topological insulator thin films. Here we study the Landau levels and edge states of surface Dirac fermions in topological insulators under strong magnetic field. We examine the formation of the quantum plateaux of the Hall conductance and find two different patterns, in one pattern the filling number covers all integers while only odd integers in the other. We focus on the quantum plateau closest to zero energy and demonstrate the breakdown of the quantum spin Hall effect resulting from structure inversion asymmetry. The phase diagrams of the quantum Hall states are presented as functions of magnetic field, gate voltage and chemical potential. This work establishes an intuitive picture of the edge states to understand the integer quantum Hall effect for Dirac electrons in topological insulator thin films.

  13. Network interdiction and stochastic integer programming

    CERN Document Server

    2003-01-01

    On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part....

  14. Logic integer programming models for signaling networks.

    Science.gov (United States)

    Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert

    2009-05-01

    We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.

  15. Elasticity of fractal materials using the continuum model with non-integer dimensional space

    Science.gov (United States)

    Tarasov, Vasily E.

    2015-01-01

    Using a generalization of vector calculus for space with non-integer dimension, we consider elastic properties of fractal materials. Fractal materials are described by continuum models with non-integer dimensional space. A generalization of elasticity equations for non-integer dimensional space, and its solutions for the equilibrium case of fractal materials are suggested. Elasticity problems for fractal hollow ball and cylindrical fractal elastic pipe with inside and outside pressures, for rotating cylindrical fractal pipe, for gradient elasticity and thermoelasticity of fractal materials are solved.

  16. A note on number fields having reciprocal integer generators | Zaïmi ...

    African Journals Online (AJOL)

    We prove that a totally complex algebraic number field K; having a conjugate which is not closed under complex conjugation, can be generated by a reciprocal integer, when the Galois group of its normal closure is contained in the hyperoctahedral group Bdeg(K)/2. Keywords: Reciprocal integers, unit primitive elements, ...

  17. Predecessor queries in dynamic integer sets

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting

    1997-01-01

    We consider the problem of maintaining a set of n integers in the range 0.2w–1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum queries on a unit cost RAM with word size w bits. Let f (n) be an arbitrary nondecreasing smooth function satisfying n...

  18. Vector calculus in non-integer dimensional space and its applications to fractal media

    Science.gov (United States)

    Tarasov, Vasily E.

    2015-02-01

    We suggest a generalization of vector calculus for the case of non-integer dimensional space. The first and second orders operations such as gradient, divergence, the scalar and vector Laplace operators for non-integer dimensional space are defined. For simplification we consider scalar and vector fields that are independent of angles. We formulate a generalization of vector calculus for rotationally covariant scalar and vector functions. This generalization allows us to describe fractal media and materials in the framework of continuum models with non-integer dimensional space. As examples of application of the suggested calculus, we consider elasticity of fractal materials (fractal hollow ball and fractal cylindrical pipe with pressure inside and outside), steady distribution of heat in fractal media, electric field of fractal charged cylinder. We solve the correspondent equations for non-integer dimensional space models.

  19. An overview of solution methods for multi-objective mixed integer linear programming programs

    DEFF Research Database (Denmark)

    Andersen, Kim Allan; Stidsen, Thomas Riis

    Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...

  20. Nonlinear feedback synchronisation control between fractional-order and integer-order chaotic systems

    International Nuclear Information System (INIS)

    Jia Li-Xin; Dai Hao; Hui Meng

    2010-01-01

    This paper focuses on the synchronisation between fractional-order and integer-order chaotic systems. Based on Lyapunov stability theory and numerical differentiation, a nonlinear feedback controller is obtained to achieve the synchronisation between fractional-order and integer-order chaotic systems. Numerical simulation results are presented to illustrate the effectiveness of this method

  1. Linear Independence of -Logarithms over the Eisenstein Integers

    Directory of Open Access Journals (Sweden)

    Peter Bundschuh

    2010-01-01

    Full Text Available For fixed complex with ||>1, the -logarithm is the meromorphic continuation of the series ∑>0/(−1,||1,≠,2,3,…. In 2004, Tachiya showed that this is true in the Subcase =ℚ, ∈ℤ, =−1, and the present authors extended this result to arbitrary integer from an imaginary quadratic number field , and provided a quantitative version. In this paper, the earlier method, in particular its arithmetical part, is further developed to answer the above question in the affirmative if is the Eisenstein number field √ℚ(−3, an integer from , and a primitive third root of unity. Under these conditions, the linear independence holds also for 1,(,(−1, and both results are quantitative.

  2. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  3. Application of a non-integer Bessel uniform approximation to inelastic molecular collisions

    International Nuclear Information System (INIS)

    Connor, J.N.L.; Mayne, H.R.

    1979-01-01

    A non-integer Bessel uniform approximation has been used to calculate transition probabilities for collinear atom-oscillator collisions. The collision systems used are a harmonic oscillator interacting via a Lennard-Jones potential and a Morse oscillator interacting via an exponential potential. Both classically allowed and classically forbidden transitions have been treated. The order of the Bessel function is chosen by a physical argument that makes use of information contained in the final-action initial-angle plot. Limitations of this procedure are discussed. It is shown that the non-integer Bessel approximation is accurate for elastic 0 → 0 collisions at high collision energies, where the integer Bessel approximation is inaccurate or inapplicable. (author)

  4. Hierarchical Hidden Markov Models for Multivariate Integer-Valued Time-Series

    DEFF Research Database (Denmark)

    Catania, Leopoldo; Di Mari, Roberto

    2018-01-01

    We propose a new flexible dynamic model for multivariate nonnegative integer-valued time-series. Observations are assumed to depend on the realization of two additional unobserved integer-valued stochastic variables which control for the time-and cross-dependence of the data. An Expectation......-Maximization algorithm for maximum likelihood estimation of the model's parameters is derived. We provide conditional and unconditional (cross)-moments implied by the model, as well as the limiting distribution of the series. A Monte Carlo experiment investigates the finite sample properties of our estimation...

  5. Integer factoring and modular square roots

    Czech Academy of Sciences Publication Activity Database

    Jeřábek, Emil

    2016-01-01

    Roč. 82, č. 2 (2016), s. 380-394 ISSN 0022-0000 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : integer factoring * quadratic residue * PPA Subject RIV: BA - General Mathematics Impact factor: 1.678, year: 2016 http://www.sciencedirect.com/science/article/pii/S0022000015000768

  6. Obstacles and Affordances for Integer Reasoning: An Analysis of Children's Thinking and the History of Mathematics

    Science.gov (United States)

    Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.; Lewis, Melinda L.

    2014-01-01

    We identify and document 3 cognitive obstacles, 3 cognitive affordances, and 1 type of integer understanding that can function as either an obstacle or affordance for learners while they extend their numeric domains from whole numbers to include negative integers. In particular, we highlight 2 key subsets of integer reasoning: understanding or…

  7. A quantum architecture for multiplying signed integers

    International Nuclear Information System (INIS)

    Alvarez-Sanchez, J J; Alvarez-Bravo, J V; Nieto, L M

    2008-01-01

    A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.

  8. THE PHENOMENON OF HALF-INTEGER SPIN, QUATERNIONS, AND PAULI MATRICES

    Directory of Open Access Journals (Sweden)

    FERNANDO R. GONZÁLEZ DÍAZ

    2017-01-01

    Full Text Available In this paper the phenomenon of half-integer spin exemplification Paul AM Dirac made with a pair of scissors, an elastic cord and chair play. Four examples in which the same phenomenon appears and the algebraic structure of quaternions is related to one of the examples are described. Mathematical proof of the phenomenon using known topological and algebraic results are explained. The basic results of algebraic structures are described quaternions H , and an intrinsic relationship with the phenomenon half-integer spin and the Pauli matrices is established.

  9. Mixed integer (0-1) fractional programming for decision support in paper production industry

    NARCIS (Netherlands)

    Claassen, G.D.H.

    2014-01-01

    This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional

  10. An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

    Science.gov (United States)

    Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril

    2018-01-01

    In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.

  11. An Efficient Integer Coding and Computing Method for Multiscale Time Segment

    Directory of Open Access Journals (Sweden)

    TONG Xiaochong

    2016-12-01

    Full Text Available This article focus on the exist problem and status of current time segment coding, proposed a new set of approach about time segment coding: multi-scale time segment integer coding (MTSIC. This approach utilized the tree structure and the sort by size formed among integer, it reflected the relationship among the multi-scale time segments: order, include/contained, intersection, etc., and finally achieved an unity integer coding processing for multi-scale time. On this foundation, this research also studied the computing method for calculating the time relationships of MTSIC, to support an efficient calculation and query based on the time segment, and preliminary discussed the application method and prospect of MTSIC. The test indicated that, the implement of MTSIC is convenient and reliable, and the transformation between it and the traditional method is convenient, it has the very high efficiency in query and calculating.

  12. STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP

    Directory of Open Access Journals (Sweden)

    Tessa Vanina Soetanto

    2004-01-01

    Full Text Available This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP method in solving flowshop scheduling problem to reach minimum makespan. Performance appraisal is based on Efficiency Index (EI, Relative Error (RE and Elapsed Runtime. Abstract in Bahasa Indonesia : Makalah ini menyajikan penelitian tentang performance algoritma heuristik Pour terhadap metode Mixed Integer Programming (MIP dalam menyelesaikan masalah penjadwalan flowshop dengan tujuan meminimalkan makespan. Penilaian performance dilakukan berdasarkan nilai Efficiency Index (EI, Relative Error (RE dan Elapsed Runtime. Kata kunci: flowshop, makespan, algoritma heuristik Pour, Mixed Integer Programming.

  13. Bivium as a Mixed Integer Programming Problem

    DEFF Research Database (Denmark)

    Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias

    2009-01-01

    over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...

  14. Winding numbers in homotopy theory from integers to reals

    International Nuclear Information System (INIS)

    Mekhfi, M.

    1993-07-01

    In Homotopy Theory (HT) we define paths on a given topological space. Closed paths prove to be construction elements of a group (the fundamental group) Π 1 and carry charges, the winding numbers. The charges are integers as they indicate how many times closed paths encircle a given hole (or set of holes). Open paths as they are defined in (HT) do not possess any groups structure and as such they are less useful in topology. In the present paper we enlarge the concept of a path in such a way that both types of paths do possess a group structure. In this broad sense we have two fundamental groups the Π i = Z group and the SO(2) group of rotations but the latter has the global property that there is no periodicity in the rotation angle. There is also two charge operators W and W λ whose eigenvalues are either integers or reals depending respectively on the paths being closed or open. Also the SO(2) group and the real charge operator W λ are not independently defined but directly related respectively to the Π i group and to the integer charge operator W. Thus well defined links can be established between seemingly different groups and charges. (author). 3 refs, 1 fig

  15. Metamorphic Testing Integer Overflow Faults of Mission Critical Program: A Case Study

    Directory of Open Access Journals (Sweden)

    Zhanwei Hui

    2013-01-01

    Full Text Available For mission critical programs, integer overflow is one of the most dangerous faults. Different testing methods provide several effective ways to detect the defect. However, it is hard to validate the testing outputs, because the oracle of testing is not always available or too expensive to get, unless the program throws an exception obviously. In the present study, the authors conduct a case study, where the authors apply a metamorphic testing (MT method to detect the integer overflow defect and alleviate the oracle problem in testing critical program of Traffic Collision Avoidance System (TCAS. Experimental results show that, in revealing typical integer mutations, compared with traditional safety property testing method, MT with a novel symbolic metamorphic relation is more effective than the traditional method in some cases.

  16. Integers in number systems with positive and negative quadratic Pisot base

    OpenAIRE

    Masáková, Zuzana; Vávra, Tomáš

    2013-01-01

    We consider numeration systems with base $\\beta$ and $-\\beta$, for quadratic Pisot numbers $\\beta$ and focus on comparing the combinatorial structure of the sets $\\Z_\\beta$ and $\\Z_{-\\beta}$ of numbers with integer expansion in base $\\beta$, resp. $-\\beta$. Our main result is the comparison of languages of infinite words $u_\\beta$ and $u_{-\\beta}$ coding the ordering of distances between consecutive $\\beta$- and $(-\\beta)$-integers. It turns out that for a class of roots $\\beta$ of $x^2-mx-m$...

  17. Optimization of Product Instantiation using Integer Programming

    NARCIS (Netherlands)

    van den Broek, P.M.; Botterweck, Goetz; Jarzabek, Stan; Kishi, Tomoji

    2010-01-01

    We show that Integer Programming (IP) can be used as an optimization technique for the instantiation of products of feature models. This is done by showing that the constraints of feature models can be written in linear form. As particular IP technique, we use Gomory cutting planes. We have applied

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

    International Nuclear Information System (INIS)

    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

  19. A fuzzy mixed integer programming for marketing planning

    Directory of Open Access Journals (Sweden)

    Abolfazl Danaei

    2014-03-01

    Full Text Available One of the primary concerns to market a product is to find appropriate channel to target customers. The recent advances on information technology have created new products with tremendous opportunities. This paper presents a mixed integer programming technique based on McCarthy's 4PS to locate suitable billboards for marketing newly introduced IPHONE product. The paper considers two types of information including age and income and tries to find the best places such that potential consumers aged 25-35 with high income visit the billboards and the cost of advertisement is minimized. The model is formulated in terms of mixed integer programming and it has been applied for potential customers who live in city of Tabriz, Iran. Using a typical software package, the model detects appropriate places in various parts of the city.

  20. Fabry-Perot Interferometry in the Integer and Fractional Quantum Hall Regimes

    Science.gov (United States)

    McClure, Douglas; Chang, Willy; Kou, Angela; Marcus, Charles; Pfeiffer, Loren; West, Ken

    2011-03-01

    We present measurements of electronic Fabry-Perot interferometers in the integer and fractional quantum Hall regimes. Two classes of resistance oscillations may be seen as a function of magnetic field and gate voltage, as we have previously reported. In small interferometers in the integer regime, oscillations of the type associated with Coulomb interaction are ubiquitous, while those consistent with single-particle Aharonov-Bohm interference are seen to co-exist in some configurations. The amplitude scaling of both types with temperature and device size is consistent with a theoretical model. Oscillations are further observed in the fractional quantum Hall regime. Here the dependence of the period on the filling factors in the constrictions and bulk of the interferometer can shed light on the effective charge of the interfering quasiparticles, but care is needed to distinguish these oscillations from those associated with integer quantum Hall states. We acknowledge funding from Microsoft Project Q and IBM.

  1. Network Model for The Problem of Integer Balancing of a Fourdimensional Matrix

    Directory of Open Access Journals (Sweden)

    A. V. Smirnov

    2016-01-01

    Full Text Available The problem of integer balancing of a four-dimensional matrix is studied. The elements of the inner part (all four indices are greater than zero of the given real matrix are summed in each direction and each two- and three-dimensional section of the matrix; the total sum is also found. These sums are placed into the elements where one or more indices are equal to zero (according to the summing directions. The problem is to find an integer matrix of the same structure, which can be produced from the initial one by replacing the elements with the largest previous or the smallest following integer. At the same time, the element with four zero indices should be produced with standard rules of rounding - off. In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity   is also studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of   linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. There are defined the basic principles for reducing the integer balancing problem of an  -dimensional matrix (  to the problem of finding the maximum flow in a divisible multiple network of multiplicity  . There are stated the rules for reducing the four-dimensional balancing problem to the maximum flow problem in the network of multiplicity 5. The algorithm of finding the maximum flow, which meets the solvability conditions for the integer balancing problem, is formulated for such a network.

  2. 50 Years of Integer Programming 1958-2008 From the Early Years to the State-of-the-Art

    CERN Document Server

    Jünger, Michael; Naddef, Denis

    2010-01-01

    In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the

  3. Triangular Numbers, Gaussian Integers, and KenKen

    Science.gov (United States)

    Watkins, John J.

    2012-01-01

    Latin squares form the basis for the recreational puzzles sudoku and KenKen. In this article we show how useful several ideas from number theory are in solving a KenKen puzzle. For example, the simple notion of triangular number is surprisingly effective. We also introduce a variation of KenKen that uses the Gaussian integers in order to…

  4. Integer Quantum Magnon Hall Plateau-Plateau Transition in a Spin Ice Model

    OpenAIRE

    Xu, Baolong; Ohtsuki, Tomi; Shindou, Ryuichi

    2016-01-01

    Low-energy magnon bands in a two-dimensional spin ice model become integer quantum magnon Hall bands. By calculating the localization length and the two-terminal conductance of magnon transport, we show that the magnon bands with disorders undergo a quantum phase transition from an integer quantum magnon Hall regime to a conventional magnon localized regime. Finite size scaling analysis as well as a critical conductance distribution shows that the quantum critical point belongs to the same un...

  5. Quadratic Sieve integer factorization using Hadoop

    OpenAIRE

    Ghebregiorgish, Semere Tsehaye

    2012-01-01

    Master's thesis in Computer Science Integer factorization problem is one of the most important parts in the world of cryptography. The security of the widely-used public-key cryptographic algorithm, RSA [1], and the Blum Blum Shub cryptographic pseudorandom number generator [2] heavily depend on the presumed difficulty of factoring a number to its prime constituents. As the size of the number to be factored gets larger, the difficulty of the problem increases enormously. Thi...

  6. RSM 1.0 - A RESUPPLY SCHEDULER USING INTEGER OPTIMIZATION

    Science.gov (United States)

    Viterna, L. A.

    1994-01-01

    RSM, Resupply Scheduling Modeler, is a fully menu-driven program that uses integer programming techniques to determine an optimum schedule for replacing components on or before the end of a fixed replacement period. Although written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user-defined resource constraints. RSM 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 computationally intensive, integer programming was required for accuracy when modeling systems with small quantities of components. Input values for component life cane be real numbers, RSM converts them to integers by dividing the lifetime by the period duration, then reducing the result to the next lowest integer. For each component, there is a set of constraints that insure that it is replaced before its lifetime expires. RSM includes user-defined constraints such as transportation mass and volume limits, as well as component life, available repair crew time and assembly sequences. A weighting factor allows the program to minimize factors such as cost. The program then performs an iterative analysis, which is displayed during the processing. A message gives the first period in which resources are being exceeded on each iteration. If the scheduling problem is unfeasible, the final message will also indicate the first period in which resources were exceeded. RSM is written in APL2 for IBM PC series computers and compatibles. A stand-alone executable version of RSM is provided; however, this is a "packed" version of RSM which can only utilize the memory within the 640K DOS limit. This executable requires at least 640K of memory and DOS 3.1 or higher. Source code for an APL2/PC workspace version is also provided. This version of RSM can make full use of any

  7. Selecting Tools to Model Integer and Binomial Multiplication

    Science.gov (United States)

    Pratt, Sarah Smitherman; Eddy, Colleen M.

    2017-01-01

    Mathematics teachers frequently provide concrete manipulatives to students during instruction; however, the rationale for using certain manipulatives in conjunction with concepts may not be explored. This article focuses on area models that are currently used in classrooms to provide concrete examples of integer and binomial multiplication. The…

  8. Core barrier formation near integer q surfaces in DIII-D

    International Nuclear Information System (INIS)

    Austin, M. E.; Gentle, K. W.; Burrell, K. H.; Waltz, R. E.; Gohil, P.; Greenfield, C. M.; Groebner, R. J.; Petty, C. C.; Prater, R.; Heidbrink, W. W.; Luo, Y.; Kinsey, J. E.; Makowski, M. A.; McKee, G. R.; Shafer, M. W.; Nazikian, R.; Rhodes, T. L.; Van Zeeland, M. A.

    2006-01-01

    Recent DIII-D experiments have significantly improved the understanding of internal transport barriers (ITBs) that are triggered close to the time when an integer value of the minimum in q is crossed. While this phenomenon has been observed on many tokamaks, the extensive transport and fluctuation diagnostics on DIII-D have permitted a detailed study of the generation mechanisms of q-triggered ITBs as pertaining to turbulence suppression dynamics, shear flows, and energetic particle modes. In these discharges, the evolution of the q profile is measured using motional Stark effect polarimetry and the integer q min crossings are further pinpointed in time by the observation of Alfven cascades. High time resolution measurements of the ion and electron temperatures and the toroidal rotation show that the start of improved confinement is simultaneous in all three channels, and that this event precedes the traversal of integer q min by 5-20 ms. There is no significant low-frequency magnetohydrodynamic activity prior to or just after the crossing of the integer q min and hence magnetic reconnection is determined not to be the precipitant of the confinement change. Instead, results from the GYRO code point to the effects of zonal flows near low order rational q values as playing a role in ITB triggering. A reduction in local turbulent fluctuations is observed at the start of the temperature rise and, concurrently, an increase in turbulence poloidal flow velocity and flow shear is measured with the beam emission spectroscopy diagnostic. For the case of a transition to an enduring internal barrier the fluctuation level remains at a reduced amplitude. The timing and nature of the temperature, rotation, and fluctuation changes leading to internal barriers suggests transport improvement due to increased shear flow arising from the zonal flow structures

  9. A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

    Science.gov (United States)

    Shyu, H. C.; Reed, I. S.; Truong, T. K.; Hsu, I. S.; Chang, J. J.

    1987-01-01

    A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

  10. Pinning mode of integer quantum Hall Wigner crystal of skyrmions

    Science.gov (United States)

    Zhu, Han; Sambandamurthy, G.; Chen, Y. P.; Jiang, P.-H.; Engel, L. W.; Tsui, D. C.; Pfeiffer, L. N.; West, K. W.

    2009-03-01

    Just away from integer Landau level (LL) filling factors ν, the dilute quasi-particles/holes at the partially filled LL form an integer-quantum-Hall Wigner crystal, which exhibits microwave pinning mode resonances [1]. Due to electron-electron interaction, it was predicted that the elementary excitation around ν= 1 is not a single spin flip, but a larger-scale spin texture, known as a skyrmion [2]. We have compared the pinning mode resonances [1] of integer quantum Hall Wigner crystals formed in the partly filled LL just away from ν= 1 and ν= 2, in the presence of an in-plane magnetic field. As an in-plane field is applied, the peak frequencies of the resonances near ν= 1 increase, while the peak frequencies below ν= 2 show neligible dependence on in-plane field. We interpret this observation as due to a skyrmion crystal phase around ν= 1 and a single-hole Wigner crystal phase below ν= 2. The in-plane field increases the Zeeman gap and causes shrinking of the skyrmion size toward single spin flips. [1] Yong P. Chen et al., Phys. Rev. Lett. 91, 016801 (2003). [2] S. L. Sondhi et al., Phys. Rev. B 47, 16 419 (1993); L. Brey et al., Phys. Rev. Lett. 75, 2562 (1995).

  11. Allocating the Fixed Resources and Setting Targets in Integer Data Envelopment Analysis

    Directory of Open Access Journals (Sweden)

    Kobra Gholami

    2013-11-01

    Full Text Available Data envelopment analysis (DEA is a non-parametric approach to evaluate a set of decision making units (DMUs consuming multiple inputs to produce multiple outputs. Formally, DEA use to estimate the efficiency score into the empirical efficient frontier. Also, DEA can be used to allocate resources and set targets for future forecast. The data are continuous in the standard DEA model whereas there are many problems in the real life that data must be integer such as number of employee, machinery, expert and so on. Thus in this paper we propose an approach to allocate fixed resources and set fixed targets with selective integer assumption that is based on an integer data envelopment analysis (IDEA approach for the first time. The major aim in this approach is preserving the efficiency score of DMUs. We use the concept of benchmarking to reach this aim. The numerical example gets to illustrate the applicability of the proposed method.

  12. Note on Integer-Valued Bilinear Time Series Models

    NARCIS (Netherlands)

    Drost, F.C.; van den Akker, R.; Werker, B.J.M.

    2007-01-01

    Summary. This note reconsiders the nonnegative integer-valued bilinear processes introduced by Doukhan, Latour, and Oraichi (2006). Using a hidden Markov argument, we extend their result of the existence of a stationary solution for the INBL(1,0,1,1) process to the class of superdiagonal INBL(p; q;

  13. Computer Corner: Spreadsheets, Power Series, Generating Functions, and Integers.

    Science.gov (United States)

    Snow, Donald R.

    1989-01-01

    Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)

  14. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

    Science.gov (United States)

    Chang, Weng-Long

    2012-03-01

    Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

  15. An integer ambiguity resolution method for the global positioning system (GPS)-based land vehicle attitude determination

    International Nuclear Information System (INIS)

    Wang, Bo; Miao, Lingjuan; Wang, Shunting; Shen, Jun

    2009-01-01

    During attitude determination using a global positioning system (GPS), cycle slips occur due to the loss of lock and noise disturbance. Therefore, the integer ambiguity needs re-computation to isolate the error in carrier phase. This paper presents a fast method for integer ambiguity resolution for land vehicle application. After the cycle slips are detected, the velocity vector is utilized to obtain the rough baseline vector. The obtained baseline vector is substituted into carrier phase observation equations to solve the float ambiguity solution which can be used as a constraint to accelerate the integer ambiguity search procedure at next epochs. The probability of correct integer estimation in the expanded search space is analyzed. Experimental results demonstrate that the proposed method gives a fast approach to obtain new fixed ambiguities while the regular method takes longer time and sometimes results in incorrect solutions

  16. Spatial “Artistic” Networks: From Deconstructing Integer-Functions to Visual Arts

    Directory of Open Access Journals (Sweden)

    Ernesto Estrada

    2018-01-01

    Full Text Available Deconstructivism is an aesthetically appealing architectonic style. Here, we identify some general characteristics of this style, such as decomposition of the whole into parts, superposition of layers, and conservation of the memory of the whole. Using these attributes, we propose a method to deconstruct functions based on integers. Using this integer-function deconstruction we generate spatial networks which display a few artistic attributes such as (i biomorphic shapes, (ii symmetry, and (iii beauty. In building these networks, the deconstructed integer-functions are used as the coordinates of the nodes in a unit square, which are then joined according to a given connection radius like in random geometric graphs (RGGs. Some graph-theoretic invariants of these networks are calculated and compared with the classical RGGs. We then show how these networks inspire an artist to create artistic compositions using mixed techniques on canvas and on paper. Finally, we call for avoiding that the applicability of (network sciences should not go in detriment of curiosity-driven, and aesthetic-driven, researches. We claim that the aesthetic of network research, and not only its applicability, would be an attractor for new minds to this field.

  17. FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Program Solver

    National Research Council Canada - National Science Library

    Chen, Qun

    1999-01-01

    We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers...

  18. A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs

    DEFF Research Database (Denmark)

    Stidsen, Thomas Riis; Andersen, Kim Allan; Dammann, Bernd

    2014-01-01

    there is the complicating factor that some of the variables are required to be integral. The resulting class of problems is named multiobjective mixed integer programming (MOMIP) problems. Solving these kinds of optimization problems exactly requires a method that can generate the whole set of nondominated points (the...... Pareto-optimal front). In this paper, we first give a survey of the newly developed branch and bound methods for solving MOMIP problems. After that, we propose a new branch and bound method for solving a subclass of MOMIP problems, where only two objectives are allowed, the integer variables are binary......, and one of the two objectives has only integer variables. The proposed method is able to find the full set of nondominated points. It is tested on a large number of problem instances, from six different classes of MOMIP problems. The results reveal that the developed biobjective branch and bound method...

  19. Fractional and integer charges from Levinson's theorem

    International Nuclear Information System (INIS)

    Farhi, E.; Graham, N.; Jaffe, R.L.; Weigel, H.

    2001-01-01

    We compute fractional and integer fermion quantum numbers of static background field configurations using phase shifts and Levinson's theorem. By extending fermionic scattering theory to arbitrary dimensions, we implement dimensional regularization in a (1+1)-dimensional gauge theory. We demonstrate that this regularization procedure automatically eliminates the anomaly in the vector current that a naive regulator would produce. We also apply these techniques to bag models in one and three dimensions

  20. Solving stochastic programs with integer recourse by enumeration : a framework using Gröbner basis reductions

    NARCIS (Netherlands)

    Schultz, R.; Stougie, L.; Vlerk, van der M.H.

    1998-01-01

    In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the

  1. Designing fractional factorial split-plot experiments using integer programming

    DEFF Research Database (Denmark)

    Capehart, Shay R.; Keha, Ahmet; Kulahci, Murat

    2011-01-01

    factorial (FF) design, with the restricted randomisation structure to account for the whole plots and subplots. We discuss the formulation of FFSP designs using integer programming (IP) to achieve various design criteria. We specifically look at the maximum number of clear two-factor interactions...

  2. Quantum recurrence and integer ratios in neutron resonances

    Energy Technology Data Exchange (ETDEWEB)

    Ohkubo, Makio

    1998-03-01

    Quantum recurrence of the compound nucleus in neutron resonance reactions are described for normal modes which are excited on the compound nucleus simultaneously. In the structure of the recurrence time, integer relations among dominant level spacings are derived. The `base modes` are assumed as stable combinations of the normal modes, preferably excited in many nuclei. (author)

  3. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    Science.gov (United States)

    Cheng, Jian

    The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it

  4. Integers without Large Prime Factors in Short Intervals: Conditional ...

    Indian Academy of Sciences (India)

    ... Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 120; Issue 5. Integers without Large Prime Factors in Short Intervals: Conditional Results. Goutam Pal Satadal Ganguly. Volume 120 Issue 5 November 2010 pp 515-524 ...

  5. Integer Set Compression and Statistical Modeling

    DEFF Research Database (Denmark)

    Larsson, N. Jesper

    2014-01-01

    enumeration of elements may be arbitrary or random, but where statistics is kept in order to estimate probabilities of elements. We present a recursive subset-size encoding method that is able to benefit from statistics, explore the effects of permuting the enumeration order based on element probabilities......Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher compression performance. In this work, we address the case where...

  6. On the price of integer charge quarks

    International Nuclear Information System (INIS)

    Okun, L.B.; Voloshin, M.B.; Zakharov, V.I.

    1979-01-01

    Implication of the integer charge quark (ICQ) model with a broken SU(3)xU(1) gauge symmetry for interactions in the leptonic sector were discussed. In this model there should be very large deviations of e + e - →μ + μ - annihilation processes in the GeV region from the standard QED behaviour. Such deviations seem to be completely excluded by existing data. Therefore it is concluded that the ICQ model is ruled out

  7. BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm.

    Science.gov (United States)

    Loving, Joshua; Hernandez, Yozen; Benson, Gary

    2014-11-15

    Mapping of high-throughput sequencing data and other bulk sequence comparison applications have motivated a search for high-efficiency sequence alignment algorithms. The bit-parallel approach represents individual cells in an alignment scoring matrix as bits in computer words and emulates the calculation of scores by a series of logic operations composed of AND, OR, XOR, complement, shift and addition. Bit-parallelism has been successfully applied to the longest common subsequence (LCS) and edit-distance problems, producing fast algorithms in practice. We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment. Integer-scoring schemes assign integer weights for match, mismatch and insertion/deletion. The BitPAl method uses structural properties in the relationship between adjacent scores in the scoring matrix to construct classes of efficient algorithms, each designed for a particular set of weights. In timed tests, we show that BitPAl runs 7-25 times faster than a standard iterative algorithm. Source code is freely available for download at http://lobstah.bu.edu/BitPAl/BitPAl.html. BitPAl is implemented in C and runs on all major operating systems. jloving@bu.edu or yhernand@bu.edu or gbenson@bu.edu Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.

  8. Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths

    DEFF Research Database (Denmark)

    Bresolin, Davide; Goranko, Valentin; Montanari, Angelo

    2009-01-01

    Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontological entities. In this paper we introduce and study Right Propositional Neighborhood Logic over natural numbers...... with integer constraints for interval lengths, which is a propositional interval temporal logic featuring a modality for the 'right neighborhood' relation between intervals and explicit integer constraints for interval lengths. We prove that it has the bounded model property with respect to ultimately periodic...

  9. New Approaches for Very Large-Scale Integer Programming

    Science.gov (United States)

    2016-06-24

    DISTRIBUTION/ AVAILABILITY STATEMENT Approved for Public Release 13. SUPPLEMENTARY NOTES 14. ABSTRACT The focus of this project is new computational... heuristics for integer programs in order to rapidly improve dual bounds. 2. Choosing good branching variables in branch-and-bound algorithms for MIP. 3...programming, algorithms, parallel processing, machine learning, heuristics 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF

  10. What Else Is Decidable about Integer Arrays?

    OpenAIRE

    Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš

    2008-01-01

    International audience; We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the ∃ * ∀ * first-order fragment and allows (1) Presburger constraints on existentially quantified variables, (2) difference constraints as well as periodicity constraints on universally quantified indices, and (3) difference constraints on values. In particular, using our logic, one can express constraints on consecutive elements of arrays (e.g. ∀i. 0 ≤ i < n → a[i + 1]...

  11. Integer programming for the generalized high school timetabling problem

    DEFF Research Database (Denmark)

    Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis

    2015-01-01

    , the XHSTT format serves as a common ground for researchers within this area. This paper describes the first exact method capable of handling an arbitrary instance of the XHSTT format. The method is based on a mixed-integer linear programming (MIP) model, which is solved in two steps with a commercial...

  12. Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers?

    Directory of Open Access Journals (Sweden)

    Tyszka Apoloniusz

    2017-03-01

    Full Text Available Let Bn = {xi · xj = xk : i, j, k ∈ {1, . . . , n}} ∪ {xi + 1 = xk : i, k ∈ {1, . . . , n}} denote the system of equations in the variables x1, . . . , xn. For a positive integer n, let _(n denote the smallest positive integer b such that for each system of equations S ⊆ Bn with a unique solution in positive integers x1, . . . , xn, this solution belongs to [1, b]n. Let g(1 = 1, and let g(n + 1 = 22g(n for every positive integer n. We conjecture that ξ (n 6 g(2n for every positive integer n. We prove: (1 the function ξ : N \\ {0} → N \\ {0} is computable in the limit; (2 if a function f : N \\ {0} → N \\ {0} has a single-fold Diophantine representation, then there exists a positive integer m such that f (n m; (3 the conjecture implies that there exists an algorithm which takes as input a Diophantine equation D(x1, . . . , xp = 0 and returns a positive integer d with the following property: for every positive integers a1, . . . , ap, if the tuple (a1, . . . , ap solely solves the equation D(x1, . . . , xp = 0 in positive integers, then a1, . . . , ap 6 d; (4 the conjecture implies that if a set M ⊆ N has a single-fold Diophantine representation, then M is computable; (5 for every integer n > 9, the inequality ξ (n < (22n−5 − 12n−5 + 1 implies that 22n−5 + 1 is composite.

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

    Science.gov (United States)

    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.

  14. Direct comparison of fractional and integer quantized Hall resistance

    Science.gov (United States)

    Ahlers, Franz J.; Götz, Martin; Pierz, Klaus

    2017-08-01

    We present precision measurements of the fractional quantized Hall effect, where the quantized resistance {{R}≤ft[ 1/3 \\right]} in the fractional quantum Hall state at filling factor 1/3 was compared with a quantized resistance {{R}[2]} , represented by an integer quantum Hall state at filling factor 2. A cryogenic current comparator bridge capable of currents down to the nanoampere range was used to directly compare two resistance values of two GaAs-based devices located in two cryostats. A value of 1-(5.3  ±  6.3) 10-8 (95% confidence level) was obtained for the ratio ({{R}≤ft[ 1/3 \\right]}/6{{R}[2]} ). This constitutes the most precise comparison of integer resistance quantization (in terms of h/e 2) in single-particle systems and of fractional quantization in fractionally charged quasi-particle systems. While not relevant for practical metrology, such a test of the validity of the underlying physics is of significance in the context of the upcoming revision of the SI.

  15. Rigorous solution to Bargmann-Wigner equation for integer spin

    CERN Document Server

    Huang Shi Zhong; Wu Ning; Zheng Zhi Peng

    2002-01-01

    A rigorous method is developed to solve the Bargamann-Wigner equation for arbitrary integer spin in coordinate representation in a step by step way. The Bargmann-Wigner equation is first transformed to a form easier to solve, the new equations are then solved rigorously in coordinate representation, and the wave functions in a closed form are thus derived

  16. Unimodular lattices in dimensions 14 and 15 over the Eisenstein integers

    Science.gov (United States)

    Abdukhalikov, Kanat; Scharlau, Rudolf

    2009-03-01

    All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in mathbb{Q}(sqrt{-3}) are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.

  17. Mixed-Integer Conic Linear Programming: Challenges and Perspectives

    Science.gov (United States)

    2013-10-01

    The novel DCCs for MISOCO may be used in branch- and-cut algorithms when solving MISOCO problems. The experimental software CICLO was developed to...perform limited, but rigorous computational experiments. The CICLO solver utilizes continuous SOCO solvers, MOSEK, CPLES or SeDuMi, builds on the open...submitted Fall 2013. Software: 1. CICLO : Integer conic linear optimization package. Authors: J.C. Góez, T.K. Ralphs, Y. Fu, and T. Terlaky

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

    NARCIS (Netherlands)

    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

  19. A mixed integer linear program for an integrated fishery | Hasan ...

    African Journals Online (AJOL)

    ... and labour allocation of quota based integrated fisheries. We demonstrate the workability of our model with a numerical example and sensitivity analysis based on data obtained from one of the major fisheries in New Zealand. Keywords: mixed integer linear program, fishing, trawler scheduling, processing, quotas ORiON: ...

  20. IMC-PID-fractional-order-filter controllers design for integer order systems.

    Science.gov (United States)

    Maâmar, Bettayeb; Rachid, Mansouri

    2014-09-01

    One of the reasons of the great success of standard PID controllers is the presence of simple tuning rules, of the automatic tuning feature and of tables that simplify significantly their design. For the fractional order case, some tuning rules have been proposed in the literature. However, they are not general because they are valid only for some model cases. In this paper, a new approach is investigated. The fractional property is not especially imposed by the controller structure but by the closed loop reference model. The resulting controller is fractional but it has a very interesting structure for its implementation. Indeed, the controller can be decomposed into two transfer functions: an integer transfer function which is generally an integer PID controller and a simple fractional filter. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

  1. Adamkus suggests that both Uspaskich, Zuokas resign posts / Milda Seputyte

    Index Scriptorium Estoniae

    Seputyte, Milda

    2005-01-01

    President Valdas Adamkus soovitas majandusminister Viktor Uspaskihhil ja Vilniuse linnapeal Arturas Zuokasel tagasi astuda, kuna nendevaheline konflikt kahjustab Leedu mainet ja julgustas poliitikutega seotud uurimist

  2. A new Tevatron Collider working point near the integer

    International Nuclear Information System (INIS)

    Johnson, R.P.; Zhang, P.

    1989-12-01

    It is well established that in hadron colliders the beam-beam interaction is more harmful in the presence of machine resonances of the form mν x + nν y = p, where |m| + |n| is the order of the resonance. Since the closest a resonance line can be to the integer stopband is 1/order, the closer the working point is to the integer, the fewer lower order resonances there are to enhance the beam-beam effects. A shift of the working point of the Tevatron from 19.4 to values near 19 and 20 has been studied. Problems with closed orbit control, dispersion matching, and matched low β insertions were considered. An excellent solution for the B0 insertion was found which has an improved β*. A new injection optics allows a transition to the low β optics which is much easier than the one now used. Results from the first machine studies demonstrate the ability to control the orbit with tunes of 19.03 horizontal and 20.03 vertical. Further studies require the activation of additional quadrupole compensation circuits. 4 refs. , 2 figs

  3. Solving the Water Jugs Problem by an Integer Sequence Approach

    Science.gov (United States)

    Man, Yiu-Kwong

    2012-01-01

    In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and…

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

    Science.gov (United States)

    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.

  5. Time-Series INSAR: An Integer Least-Squares Approach For Distributed Scatterers

    Science.gov (United States)

    Samiei-Esfahany, Sami; Hanssen, Ramon F.

    2012-01-01

    The objective of this research is to extend the geode- tic mathematical model which was developed for persistent scatterers to a model which can exploit distributed scatterers (DS). The main focus is on the integer least- squares framework, and the main challenge is to include the decorrelation effect in the mathematical model. In order to adapt the integer least-squares mathematical model for DS we altered the model from a single master to a multi-master configuration and introduced the decorrelation effect stochastically. This effect is described in our model by a full covariance matrix. We propose to de- rive this covariance matrix by numerical integration of the (joint) probability distribution function (PDF) of interferometric phases. This PDF is a function of coherence values and can be directly computed from radar data. We show that the use of this model can improve the performance of temporal phase unwrapping of distributed scatterers.

  6. Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

    Science.gov (United States)

    Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

    2016-08-01

    This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

  7. Application of Integer and Fractional Models in Electrochemical Systems

    Directory of Open Access Journals (Sweden)

    Isabel S. Jesus

    2012-01-01

    Full Text Available This paper describes the use of integer and fractional electrical elements, for modelling two electrochemical systems. A first type of system consists of botanical elements and a second type is implemented by electrolyte processes with fractal electrodes. Experimental results are analyzed in the frequency domain, and the pros and cons of adopting fractional-order electrical components for modelling these systems are compared.

  8. Penempatan Optimal Phasor Measurement Unit (PMU) Dengan Integer Programming

    OpenAIRE

    Amrulloh, Yunan Helmy

    2013-01-01

    Phasor Measurement Unit (PMU) merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP) yang akan memberikan variabel dengan pilihan nilai (0,1) yang menu...

  9. Municipal elections: Zuokas-led non-party coalition conquers Vilnius / Rokas M. Tracevskis

    Index Scriptorium Estoniae

    Tracevskis, Rokas M.

    2011-01-01

    27. veebruaril Leedus peetud kohalikel valimistel kogus enim hääli Leedu Sotsiaaldemokraatlik Partei. Praeguse Vilniuse linnapea Arturas Zuokase koalitsioon on saanud 12 kohta Vilniuse linnavolikogus

  10. Half-integer flux quantum effect in cuprate superconductors - a probe of pairing symmetry

    International Nuclear Information System (INIS)

    Tsuei, C.C.; Kirtley, J.R.; Gupta, A.; Sun, J.Z.; Moler, K.A.; Wang, J.H.

    1996-01-01

    Based on macroscopic quantum coherence effects arising from pair tunneling and flux quantization, a series of tricrystal experiments have been designed and carried out to test the order parameter symmetry in high-T c cuprate superconductors. By using a scanning SQUID microscope, we have directly and non-invasively observed the spontaneously generated half-integer flux quantum effect in controlled-orientation tricrystal cuprate superconducting systems. The presence or absence of the half-integer flux quantum effect as a function of the tricrystal geometry allows us to prove that the order parameter symmetry in the YBCO and Tl2201 systems is consistent with that of the d x 2 -y 2 pair state. (orig.)

  11. DESIGN OF DYADIC-INTEGER-COEFFICIENTS BASED BI-ORTHOGONAL WAVELET FILTERS FOR IMAGE SUPER-RESOLUTION USING SUB-PIXEL IMAGE REGISTRATION

    Directory of Open Access Journals (Sweden)

    P.B. Chopade

    2014-05-01

    Full Text Available This paper presents image super-resolution scheme based on sub-pixel image registration by the design of a specific class of dyadic-integer-coefficient based wavelet filters derived from the construction of a half-band polynomial. First, the integer-coefficient based half-band polynomial is designed by the splitting approach. Next, this designed half-band polynomial is factorized and assigned specific number of vanishing moments and roots to obtain the dyadic-integer coefficients low-pass analysis and synthesis filters. The possibility of these dyadic-integer coefficients based wavelet filters is explored in the field of image super-resolution using sub-pixel image registration. The two-resolution frames are registered at a specific shift from one another to restore the resolution lost by CCD array of camera. The discrete wavelet transform (DWT obtained from the designed coefficients is applied on these two low-resolution images to obtain the high resolution image. The developed approach is validated by comparing the quality metrics with existing filter banks.

  12. Conference on Commutative rings, integer-valued polynomials and polynomial functions

    CERN Document Server

    Frisch, Sophie; Glaz, Sarah; Commutative Algebra : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions

    2014-01-01

    This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: ·    Homological dimensions of Prüfer-like rings ·    Quasi complete rings ·    Total graphs of rings ·    Properties of prime ideals over various rings ·    Bases for integer-valued polynomials ·    Boolean subrings ·    The portable property of domains ·    Probabilistic topics in Intn(D) ·    Closure operations in Zariski-Riemann spaces of valuation domains ·    Stability of do...

  13. Heuristic Methods of Integer Programming and Its Applications in Economics

    Directory of Open Access Journals (Sweden)

    Dominika Crnjac Milić

    2010-12-01

    Full Text Available A short overview of the results related to integer programming is described in the introductory part of this paper. Furthermore, there is a list of literature related to this field. The main part of the paper analyses the Heuristic method which yields a very fast result without the use of significant mathematical tools.

  14. On the convex hull of the simple integer recourse objective function

    NARCIS (Netherlands)

    Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.

    1995-01-01

    We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an

  15. Multi-task feature selection in microarray data by binary integer programming.

    Science.gov (United States)

    Lan, Liang; Vucetic, Slobodan

    2013-12-20

    A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.

  16. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.; Claudel, Christian G.

    2012-01-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  17. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.

    2012-09-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  18. Vilnius mayor dragged into corruption scandal / Steven Paulikas

    Index Scriptorium Estoniae

    Paulikas, Steven

    2004-01-01

    Vilniuse linnapea Arturas Zuokase suhtes on algatatud kriminaalmenetlus, süüdistuseks koos korporatsiooni Rubicon juhi Andrius Janukonisega altkäemaksu pakkumine linnavolikogu liikmele Vilmantas Dremale linnapea valimiste eel

  19. Mayoral controversy resurrects political hostility / Steven Paulikas

    Index Scriptorium Estoniae

    Paulikas, Steven

    2004-01-01

    Vilniuse linnapea Arturas Zuokas kuulati üle seoses võimaliku häälteostmisega kohalike omavalitsuste valimistel. A. Zuokas peab ülekuulamise põhjuseks president Rolandas Paksase survet uurimisorganitele

  20. Non-Porod scattering and non-integer scaling of resistance in rough films

    Science.gov (United States)

    Bupathy, Arunkumar; Verma, Rupesh; Banerjee, Varsha; Puri, Sanjay

    2017-04-01

    In many physical systems, films are rough due to the stochastic behavior of depositing particles. They are characterized by non-Porod power law decays in the structure factor S (k) . Theoretical studies predict anomalous diffusion in such morphologies, with important implications for diffusivity, conductivity, etc. We use the non-Porod decay to accurately determine the fractal properties of two prototypical nanoparticle films: (i) Palladium (Pd) and (ii) Cu2O. Using scaling arguments, we find that the resistance of rough films of lateral size L obeys a non-integer power law R ∼L-ζ , in contrast to integer power laws for compact structures. The exponent ζ is anisotropic. We confirm our predictions by re-analyzing experimental data from Cu2O nano-particle films. Our results are valuable for understanding recent experiments that report anisotropic electrical properties in (rough) thin films.

  1. Accurate Computation of Periodic Regions' Centers in the General M-Set with Integer Index Number

    Directory of Open Access Journals (Sweden)

    Wang Xingyuan

    2010-01-01

    Full Text Available This paper presents two methods for accurately computing the periodic regions' centers. One method fits for the general M-sets with integer index number, the other fits for the general M-sets with negative integer index number. Both methods improve the precision of computation by transforming the polynomial equations which determine the periodic regions' centers. We primarily discuss the general M-sets with negative integer index, and analyze the relationship between the number of periodic regions' centers on the principal symmetric axis and in the principal symmetric interior. We can get the centers' coordinates with at least 48 significant digits after the decimal point in both real and imaginary parts by applying the Newton's method to the transformed polynomial equation which determine the periodic regions' centers. In this paper, we list some centers' coordinates of general M-sets' k-periodic regions (k=3,4,5,6 for the index numbers α=−25,−24,…,−1 , all of which have highly numerical accuracy.

  2. Towards Merging Binary Integer Programming Techniques with Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Reza Zamani

    2017-01-01

    Full Text Available This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable u with binary restriction, u is considered as real number between 0 and 1, with the penalty of Mu(1-u, in which M is a large number. Values not near to the boundary extremes of 0 and 1 make the component of Mu(1-u large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.

  3. Integer Charge Transfer and Hybridization at an Organic Semiconductor/Conductive Oxide Interface

    KAUST Repository

    Gruenewald, Marco; Schirra, Laura K.; Winget, Paul; Kozlik, Michael; Ndione, Paul F.; Sigdel, Ajaya K.; Berry, Joseph J.; Forker, Roman; Bredas, Jean-Luc; Fritz, Torsten; Monti, Oliver L. A.

    2015-01-01

    with localized states (the shallow donors) in the substrate and charge back-donation, resulting in an effectively integer charge transfer across the interface. Charge transfer is thus not merely a question of locating the Fermi level above the PTCDA electron

  4. Applications exponential approximation by integer shifts of Gaussian functions

    Directory of Open Access Journals (Sweden)

    S. M. Sitnik

    2013-01-01

    Full Text Available In this paper we consider approximations of functions using integer shifts of Gaussians – quadratic exponentials. A method is proposed to find coefficients of node functions by solving linear systems of equations. The explicit formula for the determinant of the system is found, based on it solvability of linear system under consideration is proved and uniqueness of its solution. We compare results with known ones and briefly indicate applications to signal theory.

  5. Binary integer programming solution for troubleshooting with dependent actions

    Czech Academy of Sciences Publication Activity Database

    Lín, Václav

    2017-01-01

    Roč. 53, č. 3 (2017), s. 493-512 ISSN 0023-5954 R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : binary integer programming * decision-theoretic troubleshooting Subject RIV: JD - Computer Applications, Robotics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.379, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/lin-0476547.pdf

  6. Sheaves in Elementary Mathematics: The case of positive integer numbers

    OpenAIRE

    Luna-Torres, Joaquin

    2015-01-01

    We aim to use the concept of sheaf to establish a link between certain aspects of the set of positive integers numbers, a topic corresponding to the elementary mathematics, and some fundamental ideas of contemporary mathematics. We hope that this type of approach helps the school students to restate some problems of elementary mathematics in an environment deeper and suitable for its study.

  7. An n -material thresholding method for improving integerness of solutions in topology optimization

    International Nuclear Information System (INIS)

    Watts, Seth; Engineering); Tortorelli, Daniel A.; Engineering)

    2016-01-01

    It is common in solving topology optimization problems to replace an integer-valued characteristic function design field with the material volume fraction field, a real-valued approximation of the design field that permits "fictitious" mixtures of materials during intermediate iterations in the optimization process. This is reasonable so long as one can interpolate properties for such materials and so long as the final design is integer valued. For this purpose, we present a method for smoothly thresholding the volume fractions of an arbitrary number of material phases which specify the design. This method is trivial for two-material design problems, for example, the canonical topology design problem of specifying the presence or absence of a single material within a domain, but it becomes more complex when three or more materials are used, as often occurs in material design problems. We take advantage of the similarity in properties between the volume fractions and the barycentric coordinates on a simplex to derive a thresholding, method which is applicable to an arbitrary number of materials. As we show in a sensitivity analysis, this method has smooth derivatives, allowing it to be used in gradient-based optimization algorithms. Finally, we present results, which show synergistic effects when used with Solid Isotropic Material with Penalty and Rational Approximation of Material Properties material interpolation functions, popular methods of ensuring integerness of solutions.

  8. Integer programming of cement distribution by train

    Science.gov (United States)

    Indarsih

    2018-01-01

    Cement industry in Central Java distributes cement by train to meet daily demand in Yogyakarta and Central Java area. There are five destination stations. For each destination station, there is a warehouse to load cements. Decision maker of cement industry have a plan to redesign the infrastructure and transportation system. The aim is to determine how many locomotives, train wagons, and containers and how to arrange train schedules with subject to the delivery time. For this purposes, we consider an integer programming to minimize the total of operational cost. Further, we will discuss a case study and the solution the problem can be calculated by LINGO software.

  9. CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization

    DEFF Research Database (Denmark)

    Friberg, Henrik Alsing

    2016-01-01

    The Conic Benchmark Library is an ongoing community-driven project aiming to challenge commercial and open source solvers on mainstream cone support. In this paper, 121 mixed-integer and continuous second-order cone problem instances have been selected from 11 categories as representative...

  10. Mixed-integer nonlinear approach for the optimal scheduling of a head-dependent hydro chain

    Energy Technology Data Exchange (ETDEWEB)

    Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)

    2010-08-15

    This paper is on the problem of short-term hydro scheduling (STHS), particularly concerning a head-dependent hydro chain. We propose a novel mixed-integer nonlinear programming (MINLP) approach, considering hydroelectric power generation as a nonlinear function of water discharge and of the head. As a new contribution to earlier studies, we model the on-off behavior of the hydro plants using integer variables, in order to avoid water discharges at forbidden areas. Thus, an enhanced STHS is provided due to the more realistic modeling presented in this paper. Our approach has been applied successfully to solve a test case based on one of the Portuguese cascaded hydro systems with a negligible computational time requirement. (author)

  11. Split diversity in constrained conservation prioritization using integer linear programming.

    Science.gov (United States)

    Chernomor, Olga; Minh, Bui Quang; Forest, Félix; Klaere, Steffen; Ingram, Travis; Henzinger, Monika; von Haeseler, Arndt

    2015-01-01

    Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.

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

    Directory of Open Access Journals (Sweden)

    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.

  13. Raw material utilization in slaughterhouses – optimizing expected profit using mixed-integer programming

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Kjærsgaard, Niels Christian

    Slaughterhouses are major players in the pork supply chain, and supply and demand must be matched in order to generate the highest profit. In particular, carcasses must be sorted in order to produce the “right” final products from the “right” carcasses. We develop a mixed-integer programming (MIP) ...... at slaughterhouses. Finally, we comment on the expected effect of variations in the raw material supply and the demand as well as future research concerning joint modelling of supply chain aspects.......Slaughterhouses are major players in the pork supply chain, and supply and demand must be matched in order to generate the highest profit. In particular, carcasses must be sorted in order to produce the “right” final products from the “right” carcasses. We develop a mixed-integer programming (MIP...

  14. A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem

    DEFF Research Database (Denmark)

    Pour, Shahrzad M.; Drake, John H.; Ejlertsen, Lena Secher

    2017-01-01

    A railway signaling system is a complex and interdependent system which should ensure the safe operation of trains. We introduce and address a mixed integer optimisation model for the preventive signal maintenance crew scheduling problem in the Danish railway system. The problem contains many...... to feed as ‘warm start’ solutions to a Mixed Integer Programming (MIP) solver for further optimisation. We apply the CP/MIP framework to a section of the Danish rail network and benchmark our results against both direct application of a MIP solver and modelling the problem as a Constraint Optimisation...

  15. Polynomial selection in number field sieve for integer factorization

    Directory of Open Access Journals (Sweden)

    Gireesh Pandey

    2016-09-01

    Full Text Available The general number field sieve (GNFS is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.

  16. Relaxation and decomposition methods for mixed integer nonlinear programming

    CERN Document Server

    Nowak, Ivo; Bank, RE

    2005-01-01

    This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.

  17. Multiplicity of summands in the random partitions of an integer

    Indian Academy of Sciences (India)

    We prove that the probability that there is a summand of multiplicity j in any randomly chosen partition or composition of an integer n goes to zero asymptotically with n provided j is larger than a critical value. As a corollary, we strengthen a result due to Erdös and Lehner (Duke. Math. J. 8 (1941) 335–345) that concerns the ...

  18. Lawmakers target Zuokas after commission fingers him as mysterious "subscriber" / Milda Seputyte

    Index Scriptorium Estoniae

    Seputyte, Milda

    2005-01-01

    Vilniuse linnavalitsuses korruptsioonijuhtumit uurinud komisjon leidis, et Rubicon Group'ilt altkäemaksu võtnud isik oli linnapea Arturas Zuokas. Linnapea arvates on komisjoni otsus mõnede poliitikute kättemaks talle

  19. Learning decision trees with flexible constraints and objectives using integer optimization

    NARCIS (Netherlands)

    Verwer, S.; Zhang, Y.

    2017-01-01

    We encode the problem of learning the optimal decision tree of a given depth as an integer optimization problem. We show experimentally that our method (DTIP) can be used to learn good trees up to depth 5 from data sets of size up to 1000. In addition to being efficient, our new formulation allows

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

    Directory of Open Access Journals (Sweden)

    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.

  1. Determining on-fault earthquake magnitude distributions from integer programming

    Science.gov (United States)

    Geist, Eric L.; Parsons, Thomas E.

    2018-01-01

    Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106  variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions. 

  2. LOW COMPLEXITY HYBRID LOSSY TO LOSSLESS IMAGE CODER WITH COMBINED ORTHOGONAL POLYNOMIALS TRANSFORM AND INTEGER WAVELET TRANSFORM

    Directory of Open Access Journals (Sweden)

    R. Krishnamoorthy

    2012-05-01

    Full Text Available In this paper, a new lossy to lossless image coding scheme combined with Orthogonal Polynomials Transform and Integer Wavelet Transform is proposed. The Lifting Scheme based Integer Wavelet Transform (LS-IWT is first applied on the image in order to reduce the blocking artifact and memory demand. The Embedded Zero tree Wavelet (EZW subband coding algorithm is used in this proposed work for progressive image coding which achieves efficient bit rate reduction. The computational complexity of lower subband coding of EZW algorithm is reduced in this proposed work with a new integer based Orthogonal Polynomials transform coding. The normalization and mapping are done on the subband of the image for exploiting the subjective redundancy and the zero tree structure is obtained for EZW coding and so the computation complexity is greatly reduced in this proposed work. The experimental results of the proposed technique also show that the efficient bit rate reduction is achieved for both lossy and lossless compression when compared with existing techniques.

  3. A binary mixed integer coded genetic algorithm for multi-objective optimization of nuclear research reactor fuel reloading

    Energy Technology Data Exchange (ETDEWEB)

    Binh, Do Quang [University of Technical Education Ho Chi Minh City (Viet Nam); Huy, Ngo Quang [University of Industry Ho Chi Minh City (Viet Nam); Hai, Nguyen Hoang [Centre for Research and Development of Radiation Technology, Ho Chi Minh City (Viet Nam)

    2014-12-15

    This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.

  4. A binary mixed integer coded genetic algorithm for multi-objective optimization of nuclear research reactor fuel reloading

    International Nuclear Information System (INIS)

    Binh, Do Quang; Huy, Ngo Quang; Hai, Nguyen Hoang

    2014-01-01

    This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.

  5. A Method of Determination of an Acquisition Program in Order to Maximize the Total Utility Using Linear Programming in Integer Numbers

    Directory of Open Access Journals (Sweden)

    Alin Cristian Ioan

    2010-03-01

    Full Text Available This paper solves in a different way the problem of maximization of the total utility using the linear programming in integer numbers. The author uses the diofantic equations (equations in integers numbers and after a decomposing in different cases, he obtains the maximal utility.

  6. Integer Charge Transfer and Hybridization at an Organic Semiconductor/Conductive Oxide Interface

    KAUST Repository

    Gruenewald, Marco

    2015-02-11

    We investigate the prototypical hybrid interface formed between PTCDA and conductive n-doped ZnO films by means of complementary optical and electronic spectroscopic techniques. We demonstrate that shallow donors in the vicinity of the ZnO surface cause an integer charge transfer to PTCDA, which is clearly restricted to the first monolayer. By means of DFT calculations, we show that the experimental signatures of the anionic PTCDA species can be understood in terms of strong hybridization with localized states (the shallow donors) in the substrate and charge back-donation, resulting in an effectively integer charge transfer across the interface. Charge transfer is thus not merely a question of locating the Fermi level above the PTCDA electron-transport level but requires rather an atomistic understanding of the interfacial interactions. The study reveals that defect sites and dopants can have a significant influence on the specifics of interfacial coupling and thus on carrier injection or extraction.

  7. Testosterone metabolism in the estuarine mysid Neomysis integer (Crustacea; Mysidacea) following tributyltin exposure.

    Science.gov (United States)

    Verslycke, Tim; Poelmans, Sofie; De Wasch, Katia; Vercauteren, Jordy; Devos, Christophe; Moens, Luc; Sandra, Patrick; De Brabander, Hubert F; Janssen, Colin R

    2003-09-01

    Current evidence suggests that the biocide tributyltin (TBT) causes the development of imposex, a state of pseudohermaphrodism in which females exhibit functional secondary male characteristics, by altering the biotransformation or elimination of testosterone. Imposex in gastropods following TBT exposure is the most complete example of the effects of an endocrine disrupter on marine invertebrates. Previous studies have demonstrated that the estuarine mysid Neomysis integer converts testosterone into multiple polar and nonpolar metabolites resulting from both phase I and phase II biotransformations. In this study, the effects of TBT chloride (TBTCl) on the phase I and II testosterone metabolism of N. integer were evaluated. The TBTCl was highly toxic to N. integer (96-h median lethal concentration [LC50] of 164 ng/L). To assess the effects on testosterone metabolism, mysids were exposed for 96 h to different concentrations of TBTCl (control, 10, 100, and 1,000 ng/L), and testosterone elimination as polar hydroxylated, nonpolar oxido-reduced, and glucose- and sulfate-conjugated metabolites was examined. The TBTCl differentially affected testosterone metabolism. The effect of TBTCl on phase I metabolism was unclear and has been shown to vary among species, likely depending on the inducibility or presence of certain P450 isozyme families. Reductase activity and metabolic androgenization were induced in the 10-ng/L treatment, whereas higher concentrations resulted in a reduction of sulfate conjugation. The exact mechanisms underlying TBT-induced imposex and alterations in the steroid metabolism need to be further elucidated.

  8. A Mixed Integer Programming for Port Anzali Development Plan

    OpenAIRE

    Mahdieh Allahviranloo

    2009-01-01

    This paper introduces a mixed integer programming model to find the optimum development plan for port Anzali. The model minimizes total system costs taking into account both port infrastructure costs and shipping costs. Due to the multipurpose function of the port, the model consists of 1020 decision variables and 2490 constraints. Results of the model determine the optimum number of berths that should be constructed in each period and for each type of cargo. In addition to, the results of se...

  9. Complex dynamics of the integer quantum Hall effect

    International Nuclear Information System (INIS)

    Trugman, S.A.; Nicopoulos, V.N.; Florida Univ., Gainesville, FL

    1991-01-01

    We investigate both classical and quantum potential scattering in two dimensions in a magnetic field, with applications to the integer quantum Hall effect. Classical scattering is complex, due in one case to the approach of scattering states to an infinite number of bound states. We show that bound states are generic, and occur for all but extremely smooth scattering potentials (|rvec ∇| → 0). Quantum scattering follows the classical behavior rather closely, exhibiting sharp resonances rather than classical bound states. Extended scatterers provide an explanation for the breakdown of the QHE at a comparatively small Hall voltage. 16 refs., 14 figs

  10. Positive integer solutions of the diophantine equation x2 −Lnxy +(−1 ...

    Indian Academy of Sciences (India)

    ny2 = ±5r when the equation has positive integer solutions. Keywords. Fibonacci numbers; Lucas numbers; diophantine equations. Mathematics Subject Classification. 11B37, 11B39. 1. Introduction. The Fibonacci sequence {Fn} is defined by F0 ...

  11. On Secure Two-Party Integer Division

    DEFF Research Database (Denmark)

    Dahl, Morten; Ning, Chao; Toft, Tomas

    2012-01-01

    {\\mathcal{O}}(\\ell)$ arithmetic operations on encrypted values (secure addition and multiplication) in $\\ensuremath{\\mathcal{O}}(1)$ rounds. This is the most efficient constant-rounds solution to date. The second protocol requires only $\\ensuremath{\\mathcal{O}} \\left( (\\log^2 \\ell)(\\kappa + \\operatorname{loglog} \\ell) \\right......We consider the problem of secure integer division: given two Paillier encryptions of ℓ-bit values n and d, determine an encryption of $\\lfloor \\frac{n}{d}\\rfloor$ without leaking any information about n or d. We propose two new protocols solving this problem. The first requires $\\ensuremath......)$ arithmetic operations in $\\ensuremath{\\mathcal{O}}(\\log^2 \\ell)$ rounds, where κ is a correctness parameter. Theoretically, this is the most efficient solution to date as all previous solutions have required Ω(ℓ) operations. Indeed, the fact that an o(ℓ) solution is possible at all is highly surprising....

  12. Estoniju reklamirujut uzhe dva brenda / Andrei Babin

    Index Scriptorium Estoniae

    Babin, Andrei

    2007-01-01

    Eestit tutvustava logo "Welcome to Estonia" kõrval on kasutusel alternatiivne bränd "Balti võti" (Baltic Key). Projekti arendab eraettevõtja Aleksandr Neson. Kaubamärgi visuaalsest lahendusest. Autor on disainer Arturas Kiselius

  13. Physical Applications of a Simple Approximation of Bessel Functions of Integer Order

    Science.gov (United States)

    Barsan, V.; Cojocaru, S.

    2007-01-01

    Applications of a simple approximation of Bessel functions of integer order, in terms of trigonometric functions, are discussed for several examples from electromagnetism and optics. The method may be applied in the intermediate regime, bridging the "small values regime" and the "asymptotic" one, and covering, in this way, an area of great…

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

    Science.gov (United States)

    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.

  15. TRACKING SIMULATIONS NEAR HALF-INTEGER RESONANCE AT PEP-II

    International Nuclear Information System (INIS)

    Nosochkov, Yuri

    2003-01-01

    Beam-beam simulations predict that PEP-II luminosity can be increased by operating the horizontal betatron tune near and above a half-integer resonance. However, effects of the resonance and its synchrotron sidebands significantly enhance betatron and chromatic perturbations which tend to reduce dynamic aperture. In the study, chromatic variation of horizontal tune near the resonance was minimized by optimizing local sextupoles in the Interaction Region. Dynamic aperture was calculated using tracking simulations in LEGO code. Dependence of dynamic aperture on the residual orbit, dispersion and β distortion after correction was investigated

  16. Integer channels in nonuniform non-equilibrium 2D systems

    Science.gov (United States)

    Shikin, V.

    2018-01-01

    We discuss the non-equilibrium properties of integer channels in nonuniform 2D electron (hole) systems in the presence of a strong magnetic field. The results are applied to a qualitative explanation of the Corbino disk current-voltage characteristics (IVC) in the quantum Hall effect (QHE) regime. Special consideration is paid to the so-called "QHE breakdown" effect, which is readily observed in both the Hall bar and Corbino geometries of the tested cells. The QHE breakdown is especially evident in the Corbino samples, allowing for a more in-depth study of these effects.

  17. Design of problem-specific evolutionary algorithm/mixed-integer programming hybrids: two-stage stochastic integer programming applied to chemical batch scheduling

    Science.gov (United States)

    Urselmann, Maren; Emmerich, Michael T. M.; Till, Jochen; Sand, Guido; Engell, Sebastian

    2007-07-01

    Engineering optimization often deals with large, mixed-integer search spaces with a rigid structure due to the presence of a large number of constraints. Metaheuristics, such as evolutionary algorithms (EAs), are frequently suggested as solution algorithms in such cases. In order to exploit the full potential of these algorithms, it is important to choose an adequate representation of the search space and to integrate expert-knowledge into the stochastic search operators, without adding unnecessary bias to the search. Moreover, hybridisation with mathematical programming techniques such as mixed-integer programming (MIP) based on a problem decomposition can be considered for improving algorithmic performance. In order to design problem-specific EAs it is desirable to have a set of design guidelines that specify properties of search operators and representations. Recently, a set of guidelines has been proposed that gives rise to so-called Metric-based EAs (MBEAs). Extended by the minimal moves mutation they allow for a generalization of EA with self-adaptive mutation strength in discrete search spaces. In this article, a problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation. On the background of the application, the usefulness of the design framework is discussed, and further extensions and corrections proposed. As a case-study, a two-stage stochastic programming problem in chemical batch process scheduling is considered. The algorithm design problem can be viewed as the choice of a hierarchical decision structure, where on different layers of the decision process symmetries and similarities can be exploited for the design of minimal moves. After a discussion of the design approach and its instantiation for the case-study, the resulting problem-specific EA/MIP is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm. In view of the

  18. Expansion around half-integer values, binomial sums, and inverse binomial sums

    International Nuclear Information System (INIS)

    Weinzierl, Stefan

    2004-01-01

    I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a symbolic computer algebra system. The method is an extension of the technique of nested sums. The algorithms allow in addition the evaluation of binomial sums, inverse binomial sums and generalizations thereof

  19. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domí nguez, Luis F.; Pistikopoulos, Efstratios N.

    2012-01-01

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear

  20. Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach

    Science.gov (United States)

    Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin

    2014-09-01

    Enhanced index tracking is a popular form of portfolio management in stock market investment. Enhanced index tracking aims to construct an optimal portfolio to generate excess return over the return achieved by the stock market index without purchasing all of the stocks that make up the index. The objective of this paper is to construct an optimal portfolio using mixed-integer programming model which adopts regression approach in order to generate higher portfolio mean return than stock market index return. In this study, the data consists of 24 component stocks in Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index from January 2010 until December 2012. The results of this study show that the optimal portfolio of mixed-integer programming model is able to generate higher mean return than FTSE Bursa Malaysia Kuala Lumpur Composite Index return with only selecting 30% out of the total stock market index components.

  1. Estimating Most Productive Scale Size in Data Envelopment Analysis with Integer Value Data

    Science.gov (United States)

    Dwi Sari, Yunita; Angria S, Layla; Efendi, Syahril; Zarlis, Muhammad

    2018-01-01

    The most productive scale size (MPSS) is a measurement that states how resources should be organized and utilized to achieve optimal results. The most productive scale size (MPSS) can be used as a benchmark for the success of an industry or company in producing goods or services. To estimate the most productive scale size (MPSS), each decision making unit (DMU) should pay attention the level of input-output efficiency, by data envelopment analysis (DEA) method decision making unit (DMU) can identify units used as references that can help to find the cause and solution from inefficiencies can optimize productivity that main advantage in managerial applications. Therefore, data envelopment analysis (DEA) is chosen to estimating most productive scale size (MPSS) that will focus on the input of integer value data with the CCR model and the BCC model. The purpose of this research is to find the best solution for estimating most productive scale size (MPSS) with input of integer value data in data envelopment analysis (DEA) method.

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

    Science.gov (United States)

    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

  3. Extension of the Poincaré group with half-integer spin generators: hypergravity and beyond

    Energy Technology Data Exchange (ETDEWEB)

    Fuentealba, Oscar [Centro de Estudios Científicos (CECs), Av. Arturo Prat 514, Valdivia (Chile); Departamento de Física, Universidad de Concepción, Casilla 160-C, Concepción (Chile); Matulich, Javier; Troncoso, Ricardo [Centro de Estudios Científicos (CECs), Av. Arturo Prat 514, Valdivia (Chile)

    2015-09-01

    An extension of the Poincaré group with half-integer spin generators is explicitly constructed. We start discussing the case of three spacetime dimensions, and as an application, it is shown that hypergravity can be formulated so as to incorporate this structure as its local gauge symmetry. Since the algebra admits a nontrivial Casimir operator, the theory can be described in terms of gauge fields associated to the extension of the Poincaré group with a Chern-Simons action. The algebra is also shown to admit an infinite-dimensional non-linear extension, that in the case of fermionic spin-3/2 generators, corresponds to a subset of a contraction of two copies of WB{sub 2}. Finally, we show how the Poincaré group can be extended with half-integer spin generators for d≥3 dimensions.

  4. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

    Full Text Available Reliability and safety in flight is extremely necessary and that depend on the adoption of proper maintenance system. Therefore, it is essential for aircraft maintenance companies to perform the manpower scheduling efficiently. One of the objectives of this paper is to provide an Integer Programming approach to determine the optimal solutions to aircraft maintenance planning and scheduling and hence the planning and scheduling processes can become more efficient and effective. Another objective is to develop a set of computational schedules for maintenance manpower to cover all scheduled flights. In this paper, a sequential methodology consisting of 3 stages is proposed. They are initial maintenance demand schedule, the maintenance pairing and the maintenance group(s assignment. Since scheduling would split up into different stages, different mathematical techniques have been adopted to cater for their own problem characteristics. Microsoft Excel would be used. Results from the first stage and second stage would be inputted into integer programming model using Microsoft Excel Solver to find the optimal solution. Also, Microsoft Excel VBA is used for devising a scheduling system in order to reduce the manual process and provide a user friendly interface. For the results, all can be obtained optimal solution and the computation time is reasonable and acceptable. Besides, the comparison of the peak time and non-peak time is discussed.

  5. Self-affine scaling from non-integer phase-space partition in $\\pi^{+}p$ and $K^{+}p$ collisions at 250 GeV/$c$

    CERN Document Server

    Agababian, N M

    1998-01-01

    A factorial-moment analysis with real (integer and non-integer) phase space partition is applied to $\\pi^+$p and K$^+$p collisions at 250 GeV/$c$. Clear evidence is shown for self-affine rather than self-similar power-law scaling in multiparticle production. The three-dimensional self-affine second-order scaling exponent is determined to be 0.061$\\pm$0.010.

  6. Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-partition Arrays

    DEFF Research Database (Denmark)

    Tanaka, Tsubasa; Bemman, Brian; Meredith, David

    2016-01-01

    Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. The problem of generating an all-partition array involves finding a rectangular array of pitch-class integers that can be partitioned into regions, each of which represents a distinct...

  7. A mixed integer program to model spatial wildfire behavior and suppression placement decisions

    Science.gov (United States)

    Erin J. Belval; Yu Wei; Michael. Bevers

    2015-01-01

    Wildfire suppression combines multiple objectives and dynamic fire behavior to form a complex problem for decision makers. This paper presents a mixed integer program designed to explore integrating spatial fire behavior and suppression placement decisions into a mathematical programming framework. Fire behavior and suppression placement decisions are modeled using...

  8. Equitably Distributing Quality of Marine Security Guards Using Integer Programming

    Science.gov (United States)

    2013-03-01

    ARB BALMOD COM DoD DoS E HAF HQ 10 IP IQ LP MOS MCESG MSG MSGAT NLP NMC OSAB PCS PP&O Q RSO SAl SD SE SNCO T-ODP LIST OF...and Eurasia 2 Abu Dhabi, United Arab Emirates India and the Middle East 3 Bangkok, Thailand East Asia and Pacific 4 Fort Lauderdale, Florida South...integer, goal, and quadratic programming. LP models and nonlinear programming ( NLP ) models are very similar in model development for both maximizing

  9. Statistical analysis of the limitation of half integer resonances on the available momentum acceptance of the High Energy Photon Source

    Energy Technology Data Exchange (ETDEWEB)

    Jiao, Yi, E-mail: jiaoyi@ihep.ac.cn; Duan, Zhe

    2017-01-01

    In a diffraction-limited storage ring, half integer resonances can have strong effects on the beam dynamics, associated with the large detuning terms from the strong focusing and strong sextupoles as required for an ultralow emittance. In this study, the limitation of half integer resonances on the available momentum acceptance (MA) was statistically analyzed based on one design of the High Energy Photon Source (HEPS). It was found that the probability of MA reduction due to crossing of half integer resonances is closely correlated with the level of beta beats at the nominal tunes, but independent of the error sources. The analysis indicated that for the presented HEPS lattice design, the rms amplitude of beta beats should be kept below 1.5% horizontally and 2.5% vertically to reach a small MA reduction probability of about 1%.

  10. Applications and algorithms for mixed integer nonlinear programming

    International Nuclear Information System (INIS)

    Leyffer, Sven; Munson, Todd; Linderoth, Jeff; Luedtke, James; Miller, Andrew

    2009-01-01

    The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete decision variables model dichotomies, discontinuities, and general logical relationships. Nonlinear functions are required to accurately represent physical properties such as pressure, stress, temperature, and equilibrium. Problems involving both discrete variables and nonlinear constraint functions are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems faced by researchers and practitioners. In this paper, we describe relevant scientific applications that are naturally modeled as MINLPs, we provide an overview of available algorithms and software, and we describe ongoing methodological advances for solving MINLPs. These algorithmic advances are making increasingly larger instances of this important family of problems tractable.

  11. Half-integer ghost states and simple BRST quantization

    International Nuclear Information System (INIS)

    Marnelius, R.

    1987-01-01

    Quantum mechanical BRST systems are considered. As is well known an odd number of ghost operators has a representation with respect to the ghost number operator consisting of states with half-integer ghost numbers. Here it is shown that an eigenstate representation of the ghost operators requires a particular mixed Grassmann character of the states. It is also shown that such states always may be avoided provided only one starts from a lagrangian where the fundamental constraints are generated by Lagrange multipliers. In the latter case there also exists an anti-BRST charge. Some relevant properties of the different BRST approaches are displayed. The existence of inequivalent physical representations is demonstrated. (orig.)

  12. Mixed-integer evolution strategies for parameter optimization and their applications to medical image analysis

    NARCIS (Netherlands)

    Li, Rui

    2009-01-01

    The target of this work is to extend the canonical Evolution Strategies (ES) from traditional real-valued parameter optimization domain to mixed-integer parameter optimization domain. This is necessary because there exist numerous practical optimization problems from industry in which the set of

  13. Landau level broadening without disorder, non-integer plateaus without interactions- an alternative model of the quantum Hall effect

    International Nuclear Information System (INIS)

    Kramer, T.

    2006-01-01

    I review some aspects of an alternative model of the quantum Hall effect, which is not based on the presence of disorder potentials. Instead, a quantization of the electronic drift current in the presence of crossed electric and magnetic fields is employed to construct a non-linear transport theory. Another important ingredient of the alternative theory is the coupling of the two-dimensional electron gas to the leads and the applied voltages. By working in a picture where the external voltages fix the chemical potential in the 2D subsystem, the experimentally observed linear relation between the voltage and the location of the quantum Hall plateaus finds an natural explanation. Also, the classical Hall effect emerges as a natural limit of the quantum Hall effect. For low temperatures (or high currents), a non-integer substructure splits higher Landau levels into sublevels. The appearance of substructure and non-integer plateaus in the resistivity is not linked to electron-electron interactions, but caused by the presence of a (linear) electric field. Some of the resulting fractions correspond exactly to half-integer plateaus. (Author)

  14. Identifying optimal regional solid waste management strategies through an inexact integer programming model containing infinite objectives and constraints.

    Science.gov (United States)

    He, Li; Huang, Guo-He; Zeng, Guang-Ming; Lu, Hong-Wei

    2009-01-01

    The previous inexact mixed-integer linear programming (IMILP) method can only tackle problems with coefficients of the objective function and constraints being crisp intervals, while the existing inexact mixed-integer semi-infinite programming (IMISIP) method can only deal with single-objective programming problems as it merely allows the number of constraints to be infinite. This study proposes, an inexact mixed-integer bi-infinite programming (IMIBIP) method by incorporating the concept of functional intervals into the programming framework. Different from the existing methods, the IMIBIP can tackle the inexact programming problems that contain both infinite objectives and constraints. The developed method is applied to capacity planning of waste management systems under a variety of uncertainties. Four scenarios are considered for comparing the solutions of IMIBIP with those of IMILP. The results indicate that reasonable solutions can be generated by the IMIBIP method. Compared with IMILP, the system cost from IMIBIP would be relatively high since the fluctuating market factors are considered; however, the IMILP solutions are associated with a raised system reliability level and a reduced constraint violation risk level.

  15. INTEG INSPEC, Accident Frequencies and Safety Analysis for Nuclear Power Plant

    International Nuclear Information System (INIS)

    Arnett, L.M.

    1976-01-01

    1 - Description of problem or function: These programs analyze the characteristics of a general model developed to represent the safety aspects of an operating nuclear reactor. These characteristics are the frequencies of incidents that are departures from the expected behavior of the reactor. Each incident is assumed to be preceded by a sequence of events starting at some initiating event. At each member in this sequence there may be functions such as safety circuits, and personnel operations that stop the sequence at that member. When mechanical devices fail they are assumed to remain inoperative until repaired. The model accounts for scheduled inspection and maintenance of all equipment in the system. 2 - Method of solution: In INTEG, the discontinuous density function is integrated by the trapezoidal rule from time equals zero to time equals t. INSPEC is based on the simulation of reactor operation as a Markov process. A vector of probabilities is successively multiplied by a transition matrix. 3 - Restrictions on the complexity of the problem: INSPEC is limited to subsystems with no more than 7 safety circuits. The transition matrix can be made up as desired so that any intercorrelations between failures of circuits can be accommodated. In INTEG, failure rates of safety circuits are restricted to independence

  16. Exact diagonalization study of domain structures in integer filling factor quantum Hall ferromagnets

    Czech Academy of Sciences Publication Activity Database

    Rezayi, E. H.; Jungwirth, Tomáš; MacDonald, A. H.; Haldane, F. D. M.

    2003-01-01

    Roč. 67, č. 20 (2003), s. 201305-1 - 201305-4 ISSN 0163-1829 R&D Projects: GA ČR GA202/01/0754 Institutional research plan: CEZ:AV0Z1010914 Keywords : domain structure * integer filling factor * quantum Hall ferromagnets Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 2.962, year: 2003

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

    Directory of Open Access Journals (Sweden)

    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.

  18. Mixed Integer Programming and Heuristic Scheduling for Space Communication

    Science.gov (United States)

    Lee, Charles H.; Cheung, Kar-Ming

    2013-01-01

    Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

  19. Zuokas accuses paper of journalistic blackmail / Steven Paulikas

    Index Scriptorium Estoniae

    Paulikas, Steven

    2004-01-01

    Vilniuse linnapea, Leedu Liberaaltsentristliku Liidu liider Arturas Zuokas süüdistab ajalehe Respublika peatoimetajat Vitas Tomkust väljapressimises. Ajaleht on avaldanud mitu Zuokase jaoks ebameeldivat artiklit, milles räägitakse tema väidetavatest sidemetest vastuolulise mainega ettevõtjatega

  20. Deviation of the Variances of Classical Estimators and Negative Integer Moment Estimator from Minimum Variance Bound with Reference to Maxwell Distribution

    Directory of Open Access Journals (Sweden)

    G. R. Pasha

    2006-07-01

    Full Text Available In this paper, we present that how much the variances of the classical estimators, namely, maximum likelihood estimator and moment estimator deviate from the minimum variance bound while estimating for the Maxwell distribution. We also sketch this difference for the negative integer moment estimator. We note the poor performance of the negative integer moment estimator in the said consideration while maximum likelihood estimator attains minimum variance bound and becomes an attractive choice.

  1. A Finer Classification of the Unit Sum Number of the Ring of Integers ...

    Indian Academy of Sciences (India)

    Here we introduce a finer classification for the unit sum number of a ring and in this new classification we completely determine the unit sum number of the ring of integers of a quadratic field. Further we obtain some results on cubic complex fields which one can decide whether the unit sum number is or ∞. Then we ...

  2. Distribution Locational Marginal Pricing for Optimal Electric Vehicle Charging through Chance Constrained Mixed-Integer Programming

    DEFF Research Database (Denmark)

    Liu, Zhaoxi; Wu, Qiuwei; Oren, Shmuel S.

    2017-01-01

    This paper presents a distribution locational marginal pricing (DLMP) method through chance constrained mixed-integer programming designed to alleviate the possible congestion in the future distribution network with high penetration of electric vehicles (EVs). In order to represent the stochastic...

  3. Mixed-Integer-Linear-Programming-Based Energy Management System for Hybrid PV-Wind-Battery Microgrids

    DEFF Research Database (Denmark)

    Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Graells, Moises

    2017-01-01

    -side strategy, defined as a general mixed-integer linear programming by taking into account two stages for proper charging of the storage units. This model is considered as a deterministic problem that aims to minimize operating costs and promote self-consumption based on 24-hour ahead forecast data...

  4. Imaging the Conductance of Integer and Fractional Quantum Hall Edge States

    Directory of Open Access Journals (Sweden)

    Nikola Pascher

    2014-01-01

    Full Text Available We measure the conductance of a quantum point contact while the biased tip of a scanning probe microscope induces a depleted region in the electron gas underneath. At a finite magnetic field, we find plateaus in the real-space maps of the conductance as a function of tip position at integer (ν=1, 2, 3, 4, 6, 8 and fractional (ν=1/3, 2/3, 5/3, 4/5 values of transmission. They resemble theoretically predicted compressible and incompressible stripes of quantum Hall edge states. The scanning tip allows us to shift the constriction limiting the conductance in real space over distances of many microns. The resulting stripes of integer and fractional filling factors are rugged on scales of a few hundred nanometers, i.e., on a scale much smaller than the zero-field elastic mean free path of the electrons. Our experiments demonstrate that microscopic inhomogeneities are relevant even in high-quality samples and lead to locally strongly fluctuating widths of incompressible regions even down to their complete suppression for certain tip positions. The macroscopic quantization of the Hall resistance measured experimentally in a nonlocal contact configuration survives in the presence of these inhomogeneities, and the relevant local energy scale for the ν=2 state turns out to be independent of tip position.

  5. COMPUTING VERTICES OF INTEGER PARTITION POLYTOPES

    Directory of Open Access Journals (Sweden)

    A. S. Vroublevski

    2015-01-01

    Full Text Available The paper describes a method of generating vertices of the polytopes of integer partitions that was used by the authors to calculate all vertices and support vertices of the partition polytopes for all n ≤ 105 and all knapsack partitions of n ≤ 165. The method avoids generating all partitions of n. The vertices are determined with the help of sufficient and necessary conditions; in the hard cases, the well-known program Polymake is used. Some computational aspects are exposed in more detail. These are the algorithm for checking the criterion that characterizes partitions that are convex combinations of two other partitions; the way of using two combinatorial operations that transform the known vertices to the new ones; and employing the Polymake to recognize a limited number (for small n of partitions that need three or more other partitions for being convexly expressed. We discuss the computational results on the numbers of vertices and support vertices of the partition polytopes and some appealing problems these results give rise to.

  6. VLSI Architectures for the Multiplication of Integers Modulo a Fermat Number

    Science.gov (United States)

    Chang, J. J.; Truong, T. K.; Reed, I. S.; Hsu, I. S.

    1984-01-01

    Multiplication is central in the implementation of Fermat number transforms and other residue number algorithms. There is need for a good multiplication algorithm that can be realized easily on a very large scale integration (VLSI) chip. The Leibowitz multiplier is modified to realize multiplication in the ring of integers modulo a Fermat number. This new algorithm requires only a sequence of cyclic shifts and additions. The designs developed for this new multiplier are regular, simple, expandable, and, therefore, suitable for VLSI implementation.

  7. Omas mahlas / Raineras Vilumaa

    Index Scriptorium Estoniae

    Vilumaa, Raineras

    2004-01-01

    Leedu kaasaegse kunsti näitus "Omas mahlas" Tallinna Kunstihoones kuni 11. VII ja Rotermanni soolalaos kuni 8. VIII. Kuraatorid Anders Härm, Eha Komissarov ja Hanno Soans. 26. VI esitlesid kunstnikud Arturas Bumshteinas, Laura Garbshtiene (G-Lab) ja helilooja Antanas Jasenka oma heliinstallatsioone

  8. Learning Bayesian network structure: towards the essential graph by integer linear programming tools

    Czech Academy of Sciences Publication Activity Database

    Studený, Milan; Haws, D.

    2014-01-01

    Roč. 55, č. 4 (2014), s. 1043-1071 ISSN 0888-613X R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : learning Bayesian network structure * integer linear programming * characteristic imset * essential graph Subject RIV: BA - General Mathematics Impact factor: 2.451, year: 2014 http://library.utia.cas.cz/separaty/2014/MTR/studeny-0427002.pdf

  9. STUDY OF SOLUTION REPRESENTATION LANGUAGE INFLUENCE ON EFFICIENCY OF INTEGER SEQUENCES PREDICTION

    Directory of Open Access Journals (Sweden)

    A. S. Potapov

    2015-01-01

    Full Text Available Methods based on genetic programming for the problem solution of integer sequences extrapolation are the subjects for study in the paper. In order to check the hypothesis about the influence of language expression of program representation on the prediction effectiveness, the genetic programming method based on several limited languages for recurrent sequences has been developed. On the single sequence sample the implemented method with the use of more complete language has shown results, significantly better than the results of one of the current methods represented in literature based on artificial neural networks. Analysis of experimental comparison results for the realized method with the usage of different languages has shown that language extension increases the difficulty of consistent patterns search in languages, available for prediction in a simpler language though it makes new sequence classes accessible for prediction. This effect can be reduced but not eliminated completely at language extension by the constructions, which make solutions more compact. Carried out researches have drawn to the conclusion that alone the choice of an adequate language for solution representation is not enough for the full problem solution of integer sequences prediction (and, all the more, universal prediction problem. However, practically applied methods can be received by the usage of genetic programming.

  10. Developing optimal nurses work schedule using integer programming

    Science.gov (United States)

    Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

    2017-08-01

    Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

  11. Parallel integer sorting with medium and fine-scale parallelism

    Science.gov (United States)

    Dagum, Leonardo

    1993-01-01

    Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

  12. A Mixed Integer Linear Programming Model for the North Atlantic Aircraft Trajectory Planning

    OpenAIRE

    Sbihi , Mohammed; Rodionova , Olga; Delahaye , Daniel; Mongeau , Marcel

    2015-01-01

    International audience; This paper discusses the trajectory planning problem for ights in the North Atlantic oceanic airspace (NAT). We develop a mathematical optimization framework in view of better utilizing available capacity by re-routing aircraft. The model is constructed by discretizing the problem parameters. A Mixed integer linear program (MILP) is proposed. Based on the MILP a heuristic to solve real-size instances is also introduced

  13. Zuokas suspends his duties as party chief / Milda Seputyte

    Index Scriptorium Estoniae

    Seputyte, Milda

    2005-01-01

    Vilniuse linnapea Arturas Zuokas astus skandaali tõttu partei esimehe kohalt tagasi. Majandusminister Viktor Uspaskihh peatas uurimise ajaks oma tegevuse erakonna esimehena. Samas teatas Uspaskihh, et on nõus tagasi astuma nii ministri kui ka erakonna juhi kohalt vaid siis, kui nii otsustavad erakonnakaaslased või parlamendikomisjonid

  14. Spherical Bessel functions jsub(n) and ysub(n) of integer order and real argument

    International Nuclear Information System (INIS)

    Ardill, R.W.B.; Moriarty, K.J.M.

    1978-01-01

    The spherical Bessel function appears in a variety of physical applications, and especially in phase shift analysis. The package SPHBES contains a subroutine to calculate jsub(n)(x) and ysub(n)(x) for any integer order n and real argument x. The functions jsub(n)(x) and ysub(n)(x) are produced simultaneously and efficiently. (Auth.)

  15. Scheduling of head-dependent cascaded hydro systems: Mixed-integer quadratic programming approach

    International Nuclear Information System (INIS)

    Catalao, J.P.S.; Pousinho, H.M.I.; Mendes, V.M.F.

    2010-01-01

    This paper is on the problem of short-term hydro scheduling, particularly concerning head-dependent cascaded hydro systems. We propose a novel mixed-integer quadratic programming approach, considering not only head-dependency, but also discontinuous operating regions and discharge ramping constraints. Thus, an enhanced short-term hydro scheduling is provided due to the more realistic modeling presented in this paper. Numerical results from two case studies, based on Portuguese cascaded hydro systems, illustrate the proficiency of the proposed approach.

  16. Modeling an integrated hospital management planning problem using integer optimization approach

    Science.gov (United States)

    Sitepu, Suryati; Mawengkang, Herman; Irvan

    2017-09-01

    Hospital is a very important institution to provide health care for people. It is not surprising that nowadays the people’s demands for hospital is increasing. However, due to the rising cost of healthcare services, hospitals need to consider efficiencies in order to overcome these two problems. This paper deals with an integrated strategy of staff capacity management and bed allocation planning to tackle these problems. Mathematically, the strategy can be modeled as an integer linear programming problem. We solve the model using a direct neighborhood search approach, based on the notion of superbasic variables.

  17. Adaptive generalized function matrix projective lag synchronization between fractional-order and integer-order complex networks with delayed coupling and different dimensions

    International Nuclear Information System (INIS)

    Dai, Hao; Si, Gangquan; Jia, Lixin; Zhang, Yanbin

    2013-01-01

    This paper investigates generalized function matrix projective lag synchronization between fractional-order and integer-order complex networks with delayed coupling, non-identical topological structures and different dimensions. Based on Lyapunov stability theory, generalized function matrix projective lag synchronization criteria are derived by using the adaptive control method. In addition, the three-dimensional fractional-order chaotic system and the four-dimensional integer-order hyperchaotic system as the nodes of the drive and the response networks, respectively, are analyzed in detail, and numerical simulation results are presented to illustrate the effectiveness of the theoretical results. (paper)

  18. A motion-based integer ambiguity resolution method for attitude determination using the global positioning system (GPS)

    International Nuclear Information System (INIS)

    Wang, Bo; Deng, Zhihong; Wang, Shunting; Fu, Mengyin

    2010-01-01

    Loss of the satellite signal and noise disturbance will cause cycle slips to occur in the carrier phase observation of the attitude determination system using the global positioning system (GPS), especially in the dynamic situation. Therefore, in order to reject the error by cycle slips, the integer ambiguity should be re-computed. A motion model-based Kalman predictor is used for the ambiguity re-computation in dynamic applications. This method utilizes the correct observation of the last step to predict the current ambiguities. With the baseline length as a constraint to reject invalid values, we can solve the current integer ambiguity and the attitude angles, by substituting the obtained ambiguities into the constrained LAMBDA method. Experimental results demonstrate that the proposed method is more efficient in the dynamic situation, which takes less time to obtain new fixed ambiguities with a higher mean success rate

  19. Gaussian free fields at the integer quantum Hall plateau transition

    Energy Technology Data Exchange (ETDEWEB)

    Bondesan, R., E-mail: roberto.bondesan@phys.ox.ac.uk [Rudolf Peierls Centre for Theoretical Physics, 1 Keble Road, Oxford OX1 3NP (United Kingdom); Wieczorek, D.; Zirnbauer, M.R. [Institut für Theoretische Physik, Universität zu Köln, Zülpicher Straße 77, 50937 Köln (Germany)

    2017-05-15

    In this work we put forward an effective Gaussian free field description of critical wavefunctions at the transition between plateaus of the integer quantum Hall effect. To this end, we expound our earlier proposal that powers of critical wave intensities prepared via point contacts behave as pure scaling fields obeying an Abelian operator product expansion. Our arguments employ the framework of conformal field theory and, in particular, lead to a multifractality spectrum which is parabolic. We also derive a number of old and new identities that hold exactly at the lattice level and hinge on the correspondence between the Chalker–Coddington network model and a supersymmetric vertex model.

  20. Eesti kasiinofirma sattus Leedus skandaali keskele / Toomas Sildam, Rasmus Kagge

    Index Scriptorium Estoniae

    Sildam, Toomas, 1961-

    2006-01-01

    Leedu julgeolekuamet konfiskeeris ajalehe Laisvas Laikrastise kogu 8.septembri tiraazhi, väidetavalt kirjutati ajalehes julgeolekuameti poolt pealtkuulatud telefonikõnedest, millest ühes olevat Eesti suurärimees, Olympic Casino omanik Armin Karu nõudnud oma Vilniuse esindajatelt kokkusaamist temalt raha saanud Leedu sotsiaaldemokraatliku partei liidri Arturas Paulauskasega

  1. Scheduling of head-dependent cascaded hydro systems: Mixed-integer quadratic programming approach

    Energy Technology Data Exchange (ETDEWEB)

    Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)

    2010-03-15

    This paper is on the problem of short-term hydro scheduling, particularly concerning head-dependent cascaded hydro systems. We propose a novel mixed-integer quadratic programming approach, considering not only head-dependency, but also discontinuous operating regions and discharge ramping constraints. Thus, an enhanced short-term hydro scheduling is provided due to the more realistic modeling presented in this paper. Numerical results from two case studies, based on Portuguese cascaded hydro systems, illustrate the proficiency of the proposed approach. (author)

  2. Discrete Ziggurat: A time-memory trade-off for sampling from a Gaussian distribution over the integers

    NARCIS (Netherlands)

    Buchmann, J.; Cabarcas, D.; Göpfert, F.; Hülsing, A.T.; Weiden, P.; Lange, T.; Lauter, K.; Lisonek, P.

    2014-01-01

    Several lattice-based cryptosystems require to sample from a discrete Gaussian distribution over the integers. Existing methods to sample from such a distribution either need large amounts of memory or they are very slow. In this paper we explore a different method that allows for a flexible

  3. Optimising the selection of food items for food frequency questionnaires using Mixed Integer Linear Programming

    NARCIS (Netherlands)

    Lemmen-Gerdessen, van J.C.; Souverein, O.W.; Veer, van 't P.; Vries, de J.H.M.

    2015-01-01

    Objective To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Design Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear

  4. Optimal placement of capacitors in a radial network using conic and mixed integer linear programming

    Energy Technology Data Exchange (ETDEWEB)

    Jabr, R.A. [Electrical, Computer and Communication Engineering Department, Notre Dame University, P.O. Box: 72, Zouk Mikhael, Zouk Mosbeh (Lebanon)

    2008-06-15

    This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, and energy losses whilst satisfying a pre-specified set of physical and technical constraints. The proposed solution is obtained using a two-phase approach. In phase-I, the problem is formulated as a conic program in which all nodes are candidates for placement of capacitor banks whose sizes are considered as continuous variables. A global solution of the phase-I problem is obtained using an interior-point based conic programming solver. Phase-II seeks a practical optimal solution by considering capacitor sizes as discrete variables. The problem in this phase is formulated as a mixed integer linear program based on minimizing the L1-norm of deviations from the phase-I state variable values. The solution to the phase-II problem is obtained using a mixed integer linear programming solver. The proposed method is validated via extensive comparisons with previously published results. (author)

  5. An Integer Programming Formulation of the Minimum Common String Partition Problem.

    Directory of Open Access Journals (Sweden)

    S M Ferdous

    Full Text Available We consider the problem of finding a minimum common string partition (MCSP of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology. In this paper, we map the MCSP problem into a graph applying a prior technique and using this graph, we develop an Integer Linear Programming (ILP formulation for the problem. We implement the ILP formulation and compare the results with the state-of-the-art algorithms from the literature. The experimental results are found to be promising.

  6. Penempatan Optimal Phasor Measurement Unit (PMU dengan Integer Programming

    Directory of Open Access Journals (Sweden)

    Yunan Helmy Amrulloh

    2013-09-01

    Full Text Available Phasor Measurement Unit (PMU merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik  dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP yang akan memberikan variabel dengan pilihan nilai (0,1 yang menunjukkan tempat yang harus dipasang PMU. Dalam tugas akhir ini, BIP diterapkan untuk menyelesaikan masalah penempatan PMU secara optimal pada sistem tenaga listrik  Jawa-Bali 500 KV yang selanjutnya diterapkan dengan penambahan konsep incomplete observability. Hasil simulasi menunjukkan bahwa penerapan BIP pada sistem dengan incomplete observability memberikan jumlah PMU yang lebih sedikit dibandingkan dengan sistem tanpa konsep incomplete observability.

  7. 2D massless QED Hall half-integer conductivity and graphene

    International Nuclear Information System (INIS)

    Martínez, A Pérez; Querts, E Rodriguez; Rojas, H Pérez; Gaitan, R; Rodriguez-Romo, S

    2011-01-01

    Starting from the photon self-energy tensor in a magnetized medium, the 3D complete antisymmetric form of the conductivity tensor is found in the static limit of a fermion system C-non-invariant under fermion–antifermion exchange. The massless relativistic 2D fermion limit in QED is derived by using the compactification along the dimension parallel to the magnetic field. In the static limit and at zero temperature, the main features of the quantum Hall effect (QHE) are obtained: the half-integer QHE and the minimum value proportional to e 2 /h for the Hall conductivity. For typical values of graphene the plateaus of the Hall conductivity are also reproduced. (paper)

  8. Integrative improvement method and mixed-integer programming in system planning

    International Nuclear Information System (INIS)

    Sadegheih, A.

    2002-01-01

    In this paper, system planning network is formulated for mixed-integer programming and a Ga. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The Dc load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions. and also provides information regarding the optimal generation at each generation point. This method of solutions is demonstrated on the expansion of a 5 bus -bar system to 6 bus-bars

  9. The integer quantum hall effect revisited

    Energy Technology Data Exchange (ETDEWEB)

    Michalakis, Spyridon [Los Alamos National Laboratory; Hastings, Matthew [Q STATION, CALIFORNIA

    2009-01-01

    For T - L x L a finite subset of Z{sup 2}, let H{sub o} denote a Hamiltonian on T with periodic boundary conditions and finite range, finite strength intetactions and a unique ground state with a nonvanishing spectral gap. For S {element_of} T, let q{sub s} denote the charge at site s and assume that the total charge Q = {Sigma}{sub s {element_of} T} q{sub s} is conserved. Using the local charge operators q{sub s}, we introduce a boundary magnetic flux in the horizontal and vertical direction and allow the ground state to evolve quasiadiabatically around a square of size one magnetic flux, in flux space. At the end of the evolution we obtain a trivial Berry phase, which we compare, via a method reminiscent of Stokes Theorem. to the Berry phase obtained from an evolution around an exponentially small loop near the origin. As a result, we show, without any averaging assumption, that the Hall conductance is quantized in integer multiples of e{sup 2}/h up to exponentially small corrections of order e{sup -L/{zeta}}, where {zeta}, is a correlation length that depends only on the gap and the range and strength of the interactions.

  10. A wavelet-based ECG delineation algorithm for 32-bit integer online processing.

    Science.gov (United States)

    Di Marco, Luigi Y; Chiari, Lorenzo

    2011-04-03

    Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra.

  11. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Fujisaki, Eiichiro

    2002-01-01

    We present a statistically-hiding commitment scheme allowing commitment to arbitrary size integers, based on any (Abelian) group with certain properties, most importantly, that it is hard for the committer to compute its order. We also give efficient zero-knowledge protocols for proving knowledge...... input is chosen by the (possibly cheating) prover. -  - Our results apply to any group with suitable properties. In particular, they apply to a much larger class of RSA moduli than the safe prime products proposed in [14] - Potential examples include RSA moduli, class groups and, with a slight...

  12. Genetic Algorithm for Mixed Integer Nonlinear Bilevel Programming and Applications in Product Family Design

    OpenAIRE

    Chenlu Miao; Gang Du; Yi Xia; Danping Wang

    2016-01-01

    Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP) to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP), which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard pr...

  13. Behavioral Heterogeneity Affects Individual Performances in Experimental and Computational Lowest Unique Integer Games

    Directory of Open Access Journals (Sweden)

    Takashi Yamada

    2017-12-01

    Full Text Available This study computationally examines (1 how the behaviors of subjects are represented, (2 whether the classification of subjects is related to the scale of the game, and (3 what kind of behavioral models are successful in small-sized lowest unique integer games (LUIGs. In a LUIG, N (≥ 3 players submit a positive integer up to M(> 1 and the player choosing the smallest number not chosen by anyone else wins. For this purpose, the author considers four LUIGs with N = {3, 4} and M = {3, 4} and uses the behavioral data obtained in the laboratory experiment by Yamada and Hanaki [1]. For computational experiments, the author calibrates the parameters of typical learning models for each subject and then pursues round robin competitions. The main findings are in the following: First, the subjects who played not differently from the mixed-strategy Nash equilibrium (MSE prediction tended to made use of not only their choices but also the game outcomes. Meanwhile those who deviated from the MSE prediction took care of only their choices as the complexity of the game increased. Second, the heterogeneity of player strategies depends on both the number of players (N and the upper limit (M. Third, when groups consist of different agents like in the earlier laboratory experiment, sticking behavior is quite effective to win.

  14. Behavioral heterogeneity affects individual performances in experimental and computational lowest unique integer games

    Science.gov (United States)

    Yamada, Takashi

    2017-12-01

    This study computationally examines (1) how the behaviors of subjects are represented, (2) whether the classification of subjects is related to the scale of the game, and (3) what kind of behavioral models are successful in small-sized lowest unique integer games (LUIGs). In a LUIG, N (>= 3) players submit a positive integer up to M(> 1) and the player choosing the smallest number not chosen by anyone else wins. For this purpose, the author considers four LUIGs with N = {3, 4} and M = {3, 4} and uses the behavioral data obtained in the laboratory experiment by Yamada and Hanaki (Physica A 463, pp. 88–102, 2016). For computational experiments, the author calibrates the parameters of typical learning models for each subject and then pursues round robin competitions. The main findings are in the following: First, the subjects who played not differently from the mixed-strategy Nash equilibrium (MSE) prediction tended to made use of not only their choices but also the game outcomes. Meanwhile those who deviated from the MSE prediction took care of only their choices as the complexity of the game increased. Second, the heterogeneity of player strategies depends on both the number of players (N) and the upper limit (M). Third, when groups consist of different agents like in the earlier laboratory experiment, sticking behavior is quite effective to win.

  15. FAST INTEGER AMBIGUITY RESOLUTION IN GPS KINEMATIC POSITIONING USING LEFT NULL SPACE AND MULTI-TIME (INVERSE PAIRED CHOLESKY DECORRELATION

    Directory of Open Access Journals (Sweden)

    Rong Duan

    Full Text Available Aiming at the problems that huge amount of computation in ambiguity resolution with multiple epochs and high-order matrix inversion occurred in the GPS kinematic relative positioning, a modified algorithm for fast integer ambiguity resolution is proposed. Firstly, Singular Value Decomposition (SVD is applied to construct the left null space matrix in order to eliminate the baselines components, which is able to separate ambiguity parameters from the position parameters efficiently. Kalman filter is applied only to estimate the ambiguity parameters so that the real-time ambiguity float solution is obtained. Then, sorting and multi-time (inverse paired Cholesky decomposition are adopted for decorrelation of ambiguity. After diagonal elements preprocessing and diagonal elements sorting according to the results of Cholesky decomposition, the efficiency of decomposition and decorrelation is improved. Lastly, the integer search algorithm implemented in LAMBDA method is used for searching the integer ambiguity. To verify the validity and efficacy of the proposed algorithm, static and kinematic tests are carried out. Experimental results show that this algorithm has good performance of decorrelation and precision of float solution, with computation speed also increased effectively. The final positioning accuracy result with static baseline error less than 1 cm and kinematic error less than 2 cm, which indicates that it can be used for fast kinematic positioning of high precision carrier.

  16. How to build institutionalization on students: a pilot experiment on a didactical design of addition and subtraction involving negative integers

    Science.gov (United States)

    Fuadiah, N. F.; Suryadi, D.; Turmudi

    2018-05-01

    This study focuses on the design of a didactical situation in addition and subtraction involving negative integers at the pilot experiment phase. As we know, negative numbers become an obstacle for students in solving problems related to them. This study aims to create a didactical design that can assist students in understanding the addition and subtraction. Another expected result in this way is that students are introduced to the characteristics of addition and subtraction of integers. The design was implemented on 32 seventh grade students in one of the classes in a junior secondary school as the pilot experiment. Learning activities were observed thoroughly including the students’ responses that emerged during the learning activities. The written documentation of the students was also used to support the analysis in the learning activities. The results of the analysis showed that this method could help the students perform a large number of integer operations that could not be done with a number line. The teacher’s support as a didactical potential contract was still needed to encourage institutionalization processes. The results of the design analysis used as the basis of the revision are expected to be implemented by the teacher in the teaching experiment.

  17. Two-Part Models for Fractional Responses Defined as Ratios of Integers

    Directory of Open Access Journals (Sweden)

    Harald Oberhofer

    2014-09-01

    Full Text Available This paper discusses two alternative two-part models for fractional response variables that are defined as ratios of integers. The first two-part model assumes a Binomial distribution and known group size. It nests the one-part fractional response model proposed by Papke and Wooldridge (1996 and, thus, allows one to apply Wald, LM and/or LR tests in order to discriminate between the two models. The second model extends the first one by allowing for overdispersion in the data. We demonstrate the usefulness of the proposed two-part models for data on the 401(k pension plan participation rates used in Papke and Wooldridge (1996.

  18. Optimal Allocation of Static Var Compensator via Mixed Integer Conic Programming

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Xiaohu [ORNL; Shi, Di [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Zhiwei [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Huang, Junhui [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Xu [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)

    2017-01-01

    Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus system demonstrate the effectiveness of the proposed planning model.

  19. The use of mixed-integer programming for inverse treatment planning with pre-defined field segments

    International Nuclear Information System (INIS)

    Bednarz, Greg; Michalski, Darek; Houser, Chris; Huq, M. Saiful; Xiao Ying; Rani, Pramila Anne; Galvin, James M.

    2002-01-01

    Complex intensity patterns generated by traditional beamlet-based inverse treatment plans are often very difficult to deliver. In the approach presented in this work the intensity maps are controlled by pre-defining field segments to be used for dose optimization. A set of simple rules was used to define a pool of allowable delivery segments and the mixed-integer programming (MIP) method was used to optimize segment weights. The optimization problem was formulated by combining real variables describing segment weights with a set of binary variables, used to enumerate voxels in targets and critical structures. The MIP method was compared to the previously used Cimmino projection algorithm. The field segmentation approach was compared to an inverse planning system with a traditional beamlet-based beam intensity optimization. In four complex cases of oropharyngeal cancer the segmental inverse planning produced treatment plans, which competed with traditional beamlet-based IMRT plans. The mixed-integer programming provided mechanism for imposition of dose-volume constraints and allowed for identification of the optimal solution for feasible problems. Additional advantages of the segmental technique presented here are: simplified dosimetry, quality assurance and treatment delivery. (author)

  20. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.

    2013-01-01

    Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill-Whitham- Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for some decision variable. We use this fact to pose the problem of detecting spoofing cyber-attacks in probe-based traffic flow information systems as mixed integer linear feasibility problem. The resulting framework can be used to detect spoofing attacks in real time, or to evaluate the worst-case effects of an attack offline. A numerical implementation is performed on a cyber-attack scenario involving experimental data from the Mobile Century experiment and the Mobile Millennium system currently operational in Northern California. © 2013 IEEE.

  1. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.

    2013-09-01

    Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill- Whitham-Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data generated by multiple sensors of different types, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for a specific decision variable. We use this fact to pose the problem of detecting spoofing cyber attacks in probe-based traffic flow information systems as mixed integer linear feasibility problem. The resulting framework can be used to detect spoofing attacks in real time, or to evaluate the worst-case effects of an attack offliine. A numerical implementation is performed on a cyber attack scenario involving experimental data from the Mobile Century experiment and the Mobile Millennium system currently operational in Northern California. © American Institute of Mathematical Sciences.

  2. Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations

    NARCIS (Netherlands)

    van der Laan, G.; Talman, A.J.J.; Yang, Z.F.

    2007-01-01

    Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set f§1;§2; ¢ ¢ ¢ ;§ng with the property that antipodal vertices on the boundary of

  3. A simple approximation of moments of the quasi-equilibrium distribution of an extended stochastic theta-logistic model with non-integer powers.

    Science.gov (United States)

    Bhowmick, Amiya Ranjan; Bandyopadhyay, Subhadip; Rana, Sourav; Bhattacharya, Sabyasachi

    2016-01-01

    The stochastic versions of the logistic and extended logistic growth models are applied successfully to explain many real-life population dynamics and share a central body of literature in stochastic modeling of ecological systems. To understand the randomness in the population dynamics of the underlying processes completely, it is important to have a clear idea about the quasi-equilibrium distribution and its moments. Bartlett et al. (1960) took a pioneering attempt for estimating the moments of the quasi-equilibrium distribution of the stochastic logistic model. Matis and Kiffe (1996) obtain a set of more accurate and elegant approximations for the mean, variance and skewness of the quasi-equilibrium distribution of the same model using cumulant truncation method. The method is extended for stochastic power law logistic family by the same and several other authors (Nasell, 2003; Singh and Hespanha, 2007). Cumulant truncation and some alternative methods e.g. saddle point approximation, derivative matching approach can be applied if the powers involved in the extended logistic set up are integers, although plenty of evidence is available for non-integer powers in many practical situations (Sibly et al., 2005). In this paper, we develop a set of new approximations for mean, variance and skewness of the quasi-equilibrium distribution under more general family of growth curves, which is applicable for both integer and non-integer powers. The deterministic counterpart of this family of models captures both monotonic and non-monotonic behavior of the per capita growth rate, of which theta-logistic is a special case. The approximations accurately estimate the first three order moments of the quasi-equilibrium distribution. The proposed method is illustrated with simulated data and real data from global population dynamics database. Copyright © 2015 Elsevier Inc. All rights reserved.

  4. Entanglement Properties of a Higher-Integer-Spin AKLT Model with Quantum Group Symmetry

    Directory of Open Access Journals (Sweden)

    Chikashi Arita

    2012-10-01

    Full Text Available We study the entanglement properties of a higher-integer-spin Affleck-Kennedy-Lieb-Tasaki model with quantum group symmetry in the periodic boundary condition. We exactly calculate the finite size correction terms of the entanglement entropies from the double scaling limit. We also evaluate the geometric entanglement, which serves as another measure for entanglement. We find the geometric entanglement reaches its maximum at the isotropic point, and decreases with the increase of the anisotropy. This behavior is similar to that of the entanglement entropies.

  5. Origin and diversity of an underutilized fruit tree crop, cempedak (Artocarpus integer, Moraceae).

    Science.gov (United States)

    Wang, Maria M H; Gardner, Elliot M; Chung, Richard C K; Chew, Ming Yee; Milan, Abd Rahman; Pereira, Joan T; Zerega, Nyree J C

    2018-06-06

    Underutilized crops and their wild relatives are important resources for crop improvement and food security. Cempedak [Artocarpus integer (Thunb). Merr.] is a significant crop in Malaysia but underutilized elsewhere. Here we performed molecular characterization of cempedak and its putative wild relative bangkong (Artocarpus integer (Thunb). Merr. var. silvestris Corner) to address questions regarding the origin and diversity of cempedak. Using data from 12 microsatellite loci, we assessed the genetic diversity and genetic/geographic structure for 353 cempedak and 175 bangkong accessions from Malaysia and neighboring countries and employed clonal analysis to characterize cempedak cultivars. We conducted haplotype network analyses on the trnH-psbA region in a subset of these samples. We also analyzed key vegetative characters that reportedly differentiate cempedak and bangkong. We show that cempedak and bangkong are sister taxa and distinct genetically and morphologically, but the directionality of domestication origin is unclear. Genetic diversity was generally higher in bangkong than in cempedak. We found a distinct genetic cluster for cempedak from Borneo as compared to cempedak from Peninsular Malaysia. Finally, cempedak cultivars with the same names did not always share the same genetic fingerprint. Cempedak origins are complex, with likely admixture and hybridization with bangkong, warranting further investigation. We provide a baseline of genetic diversity of cempedak and bangkong in Malaysia and found that germplasm collections in Malaysia represent diverse coverage of the four cempedak genetic clusters detected. © 2018 Botanical Society of America.

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

    Science.gov (United States)

    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.

  7. Advances in mixed-integer programming methods for chemical production scheduling.

    Science.gov (United States)

    Velez, Sara; Maravelias, Christos T

    2014-01-01

    The goal of this paper is to critically review advances in the area of chemical production scheduling over the past three decades and then present two recently proposed solution methods that have led to dramatic computational enhancements. First, we present a general framework and problem classification and discuss modeling and solution methods with an emphasis on mixed-integer programming (MIP) techniques. Second, we present two solution methods: (a) a constraint propagation algorithm that allows us to compute parameters that are then used to tighten MIP scheduling models and (b) a reformulation that introduces new variables, thus leading to effective branching. We also present computational results and an example illustrating how these methods are implemented, as well as the resulting enhancements. We close with a discussion of open research challenges and future research directions.

  8. Efficient numerical simulation of non-integer-order space-fractional reaction-diffusion equation via the Riemann-Liouville operator

    Science.gov (United States)

    Owolabi, Kolade M.

    2018-03-01

    In this work, we are concerned with the solution of non-integer space-fractional reaction-diffusion equations with the Riemann-Liouville space-fractional derivative in high dimensions. We approximate the Riemann-Liouville derivative with the Fourier transform method and advance the resulting system in time with any time-stepping solver. In the numerical experiments, we expect the travelling wave to arise from the given initial condition on the computational domain (-∞, ∞), which we terminate in the numerical experiments with a large but truncated value of L. It is necessary to choose L large enough to allow the waves to have enough space to distribute. Experimental results in high dimensions on the space-fractional reaction-diffusion models with applications to biological models (Fisher and Allen-Cahn equations) are considered. Simulation results reveal that fractional reaction-diffusion equations can give rise to a range of physical phenomena when compared to non-integer-order cases. As a result, most meaningful and practical situations are found to be modelled with the concept of fractional calculus.

  9. Universal conductance and conductivity at critical points in integer quantum Hall systems.

    Science.gov (United States)

    Schweitzer, L; Markos, P

    2005-12-16

    The sample averaged longitudinal two-terminal conductance and the respective Kubo conductivity are calculated at quantum critical points in the integer quantum Hall regime. In the limit of large system size, both transport quantities are found to be the same within numerical uncertainty in the lowest Landau band, and , respectively. In the second-lowest Landau band, a critical conductance is obtained which indeed supports the notion of universality. However, these numbers are significantly at variance with the hitherto commonly believed value . We argue that this difference is due to the multifractal structure of critical wave functions, a property that should generically show up in the conductance at quantum critical points.

  10. Comparison of Integer Programming (IP) Solvers for Automated Test Assembly (ATA). Research Report. ETS RR-15-05

    Science.gov (United States)

    Donoghue, John R.

    2015-01-01

    At the heart of van der Linden's approach to automated test assembly (ATA) is a linear programming/integer programming (LP/IP) problem. A variety of IP solvers are available, ranging in cost from free to hundreds of thousands of dollars. In this paper, I compare several approaches to solving the underlying IP problem. These approaches range from…

  11. Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

    Energy Technology Data Exchange (ETDEWEB)

    Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

    2017-03-27

    Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

  12. Extension of the direct statistical approach to a volume parameter model (non-integer splitting)

    International Nuclear Information System (INIS)

    Burn, K.W.

    1990-01-01

    The Direct Statistical Approach is a rigorous mathematical derivation of the second moment for surface splitting and Russian Roulette games attached to the Monte Carlo modelling of fixed source particle transport. It has been extended to a volume parameter model (involving non-integer ''expected value'' splitting), and then to a cell model. The cell model gives second moment and time functions that have a closed form. This suggests the possibility of two different methods of solution of the optimum splitting/Russian Roulette parameters. (author)

  13. Kuni 20. VIII on Tallinnas vastavatud kultuuritehases Polymer ennast sisse seadnud...Rael Artel Gallery

    Index Scriptorium Estoniae

    2004-01-01

    Näha saab G-Labi (Arturas Bumsteinas, Laura Garbstiene, Leedu) heliinstallatsiooni "Mirrors and Copulations", Kiwa heliteost "Hlör U Fang Axaxaxas mlö", Anu Allase kureeritud väljapanekut "Juhitud reisid/Guided Tours" (osalevad Liisi Peets, Katrin Tees, Piret Räni, Anu Vahtra, Daisy Lappard, rühmitus Tiit Sokk: Ulvi Tiit & Marili Sokk, Raivo Hool, Rataplan), Grace Schwindti (London) videot "Desire"

  14. Absence of even-integer ζ-function values in Euclidean physical quantities in QCD

    Science.gov (United States)

    Jamin, Matthias; Miravitllas, Ramon

    2018-04-01

    At order αs4 in perturbative quantum chromodynamics, even-integer ζ-function values are present in Euclidean physical correlation functions like the scalar quark correlation function or the scalar gluonium correlator. We demonstrate that these contributions cancel when the perturbative expansion is expressed in terms of the so-called C-scheme coupling αˆs which has recently been introduced in Ref. [1]. It is furthermore conjectured that a ζ4 term should arise in the Adler function at order αs5 in the MS ‾-scheme, and that this term is expected to disappear in the C-scheme as well.

  15. Edit distance for marked point processes revisited: An implementation by binary integer programming

    Energy Technology Data Exchange (ETDEWEB)

    Hirata, Yoshito; Aihara, Kazuyuki [Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan)

    2015-12-15

    We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process is large.

  16. The role of integer-mode rational surface on peaked profile formation in toroidal rotation velocity and ion temperature

    International Nuclear Information System (INIS)

    Koide, Yoshihiko; Ishida, Shin-ichi; Sakasai, Akira

    1991-03-01

    A particular role of integer-mode rational surfaces on the formation of peaked T i (r) and V t (r) is observed. In the case of JT-60 hot-ion regime, the plasma spontaneously changes its peaking region from the inside of q=2 surface to that of broader q=3 surface. (author)

  17. Topologically induced fractional Hall steps in the integer quantum Hall regime of MoS 2

    Science.gov (United States)

    Firoz Islam, SK; Benjamin, Colin

    2016-09-01

    The quantum magnetotransport properties of a monolayer of molybdenum disulfide are derived using linear response theory. In particular, the effect of topological terms on longitudinal and Hall conductivity is analyzed. The Hall conductivity exhibits fractional steps in the integer quantum Hall regime. Further complete spin and valley polarization of the longitudinal conductivitity is seen in presence of these topological terms. Finally, the Shubnikov-de Hass oscillations are suppressed or enhanced contingent on the sign of these topological terms.

  18. A mixed-integer nonlinear programming approach to the optimal design of heat network in a polygeneration energy system

    International Nuclear Information System (INIS)

    Zhang, Jianyun; Liu, Pei; Zhou, Zhe; Ma, Linwei; Li, Zheng; Ni, Weidou

    2014-01-01

    Highlights: • Integration of heat streams with HRSG in a polygeneration system is studied. • A mixed-integer nonlinear programming model is proposed to optimize heat network. • Operating parameters and heat network configuration are optimized simultaneously. • The optimized heat network highly depends on the HRSG type and model specification. - Abstract: A large number of heat flows at various temperature and pressure levels exist in a polygeneration plant which co-produces electricity and chemical products. Integration of these external heat flows in a heat recovery steam generator (HRSG) has great potential to further enhance energy efficiency of such a plant; however, it is a challenging problem arising from the large design space of heat exchanger network. In this paper, a mixed-integer nonlinear programming model is developed for the design optimization of a HRSG with consideration of all alternative matches between the HRSG and external heat flows. This model is applied to four polygeneration cases with different HRSG types, and results indicate that the optimized heat network mainly depends on the HRSG type and the model specification

  19. Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.

    Science.gov (United States)

    Legendre, Audrey; Angel, Eric; Tahi, Fariza

    2018-01-15

    RNA structure prediction is an important field in bioinformatics, and numerous methods and tools have been proposed. Pseudoknots are specific motifs of RNA secondary structures that are difficult to predict. Almost all existing methods are based on a single model and return one solution, often missing the real structure. An alternative approach would be to combine different models and return a (small) set of solutions, maximizing its quality and diversity in order to increase the probability that it contains the real structure. We propose here an original method for predicting RNA secondary structures with pseudoknots, based on integer programming. We developed a generic bi-objective integer programming algorithm allowing to return optimal and sub-optimal solutions optimizing simultaneously two models. This algorithm was then applied to the combination of two known models of RNA secondary structure prediction, namely MEA and MFE. The resulting tool, called BiokoP, is compared with the other methods in the literature. The results show that the best solution (structure with the highest F 1 -score) is, in most cases, given by BiokoP. Moreover, the results of BiokoP are homogeneous, regardless of the pseudoknot type or the presence or not of pseudoknots. Indeed, the F 1 -scores are always higher than 70% for any number of solutions returned. The results obtained by BiokoP show that combining the MEA and the MFE models, as well as returning several optimal and several sub-optimal solutions, allow to improve the prediction of secondary structures. One perspective of our work is to combine better mono-criterion models, in particular to combine a model based on the comparative approach with the MEA and the MFE models. This leads to develop in the future a new multi-objective algorithm to combine more than two models. BiokoP is available on the EvryRNA platform: https://EvryRNA.ibisc.univ-evry.fr .

  20. Mixed Integer Linear Programming model for Crude Palm Oil Supply Chain Planning

    Science.gov (United States)

    Sembiring, Pasukat; Mawengkang, Herman; Sadyadharma, Hendaru; Bu'ulolo, F.; Fajriana

    2018-01-01

    The production process of crude palm oil (CPO) can be defined as the milling process of raw materials, called fresh fruit bunch (FFB) into end products palm oil. The process usually through a series of steps producing and consuming intermediate products. The CPO milling industry considered in this paper does not have oil palm plantation, therefore the FFB are supplied by several public oil palm plantations. Due to the limited availability of FFB, then it is necessary to choose from which plantations would be appropriate. This paper proposes a mixed integer linear programming model the supply chain integrated problem, which include waste processing. The mathematical programming model is solved using neighborhood search approach.

  1. Mixed-integer representations in control design mathematical foundations and applications

    CERN Document Server

    Prodan, Ionela; Olaru, Sorin; Niculescu, Silviu-Iulian

    2016-01-01

    In this book, the authors propose efficient characterizations of the non-convex regions that appear in many control problems, such as those involving collision/obstacle avoidance and, in a broader sense, in the description of feasible sets for optimization-based control design involving contradictory objectives. The text deals with a large class of systems that require the solution of appropriate optimization problems over a feasible region, which is neither convex nor compact. The proposed approach uses the combinatorial notion of hyperplane arrangement, partitioning the space by a finite collection of hyperplanes, to describe non-convex regions efficiently. Mixed-integer programming techniques are then applied to propose acceptable formulations of the overall problem. Multiple constructions may arise from the same initial problem, and their complexity under various parameters - space dimension, number of binary variables, etc. - is also discussed. This book is a useful tool for academic researchers and grad...

  2. Print advertising in Lithuania / Arturas Olshauskas

    Index Scriptorium Estoniae

    Olshauskas, Arturas

    2006-01-01

    Leedu ajakirjanduse spetsialistid erinevate väljaannete juurest arutlevad sealse trükiajakirjanduse peamiste probleemide ja teemade üle. Tabelid: TOP 5 Lithuanian dailies; TOP 5 Lithuanian weeklies; TOP 5 Lithuanian monthlies

  3. Finance minister steps down / Arturas Racas

    Index Scriptorium Estoniae

    Racas, Arturas

    2007-01-01

    Leedu rahandusminister Zigmantas Balcytis teatas tagasiastumisest, et kaitsta oma poega spekulatsioonide eest. Balcytise poeg koordineerib Euroopa Liidu rahalise abi jagamist ning teda süüdistati ametiseisundi kuritarvitamises, kuid mõisteti hiljem õigeks

  4. Computation of a numerically satisfactory pair of solutions of the differential equation for conical functions of non-negative integer orders

    NARCIS (Netherlands)

    T.M. Dunster (Mark); A. Gil (Amparo); J. Segura (Javier); N.M. Temme (Nico)

    2014-01-01

    textabstractWe consider the problem of computing satisfactory pair of solutions of the differential equation for Legendre functions of non-negative integer order $\\mu$ and degree $-\\frac12+i\\tau$, where $\\tau$ is a non-negative real parameter. Solutions of this equation are the conical functions

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

    CERN Document Server

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

  6. Integer Representations towards Efficient Counting in the Bit Probe Model

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Greve, Mark; Pandey, Vineet

    2011-01-01

    Abstract We consider the problem of representing numbers in close to optimal space and supporting increment, decrement, addition and subtraction operations efficiently. We study the problem in the bit probe model and analyse the number of bits read and written to perform the operations, both...... in the worst-case and in the average-case. A counter is space-optimal if it represents any number in the range [0,...,2 n  − 1] using exactly n bits. We provide a space-optimal counter which supports increment and decrement operations by reading at most n − 1 bits and writing at most 3 bits in the worst......-case. To the best of our knowledge, this is the first such representation which supports these operations by always reading strictly less than n bits. For redundant counters where we only need to represent numbers in the range [0,...,L] for some integer L bits, we define the efficiency...

  7. An Integer Programming Approach to Solving Tantrix on Fixed Boards

    Directory of Open Access Journals (Sweden)

    Yushi Uno

    2012-03-01

    Full Text Available Tantrix (Tantrix R ⃝ is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M. McManaway, the inventor. is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we first give a problem setting of solving Tantrix as making a loop on a given fixed board. We then formulate it as an integer program by describing the rules of Tantrix as its constraints, and solve it by a mathematical programming solver to have a solution. As a result, we establish a formulation that can solve Tantrix of moderate size, and even when the solutions are invalid only by elementary constraints, we achieved it by introducing additional constraints and re-solve it. By this approach we succeeded to solve Tantrix of size up to 60.

  8. On the group of substitutions of formal power series with integer coefficients

    International Nuclear Information System (INIS)

    Babenko, I K; Bogatyi, S A

    2008-01-01

    We study certain properties of the group J(Z) of substitutions of formal power series in one variable with integer coefficients. We show that J(Z), regarded as a topological group, has four generators and cannot be generated by fewer elements. In particular, we show that the one-dimensional continuous homology of J(Z) is isomorphic to Z oplus Z oplus Z 2 oplus Z 2 . We study various topological and geometric properties of the coset space J(R)/J(Z). We compute the real cohomology H-tilde*(J(Z);R) with uniformly locally constant supports and show that it is naturally isomorphic to the cohomology of the nilpotent part of the Lie algebra of formal vector fields on the line

  9. Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming.

    Science.gov (United States)

    Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

    2017-08-01

    Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online. Published by Oxford University Press 2017. This work is written by US Government employees and are in the public domain in the US.

  10. Integer programming and combinatorial optimization : 15th international conference, IPCO 2011, New York NY, USA, June 15-17, 2011 : proceedings

    NARCIS (Netherlands)

    Günlük, O.; Woeginger, G.J.

    2011-01-01

    This volume contains the 33 papers presented at IPCO 2011, the 15th Conference on Integer Programming and Combinatorial Optimization, held during June 15–17, 2011 at the IBM T.J. Watson Research Center in New York, USA. IPCO conferences are sponsored by the Mathematical Optimization Society. The

  11. Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time

    Directory of Open Access Journals (Sweden)

    Rinto Yusriski

    2015-09-01

    Full Text Available This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1, this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

  12. A concrete approach to abstract algebra from the integers to the insolvability of the quintic

    CERN Document Server

    Bergen, Jeffrey

    2010-01-01

    A Concrete Approach to Abstract Algebra begins with a concrete and thorough examination of familiar objects like integers, rational numbers, real numbers, complex numbers, complex conjugation and polynomials, in this unique approach, the author builds upon these familar objects and then uses them to introduce and motivate advanced concepts in algebra in a manner that is easier to understand for most students. The text will be of particular interest to teachers and future teachers as it links abstract algebra to many topics wich arise in courses in algebra, geometry, trigonometry, preca

  13. Corestriction principle for non-Abelian cohomology of reductive group schemes over Dedekind rings of integers of local and global fields

    International Nuclear Information System (INIS)

    Nguyen Quoc Thang

    2006-12-01

    We prove some new results on Corestriction principle for non-abelian cohomology of group schemes over the rings of integers of local and global fields. Some connections with Grothendieck - Serre's conjecture are indicated, and applications to the study of class groups of algebraic groups over global fields are given. (author)

  14. Instantaneous and controllable integer ambiguity resolution: review and an alternative approach

    Science.gov (United States)

    Zhang, Jingyu; Wu, Meiping; Li, Tao; Zhang, Kaidong

    2015-11-01

    In the high-precision application of Global Navigation Satellite System (GNSS), integer ambiguity resolution is the key step to realize precise positioning and attitude determination. As the necessary part of quality control, integer aperture (IA) ambiguity resolution provides the theoretical and practical foundation for ambiguity validation. It is mainly realized by acceptance testing. Due to the constraint of correlation between ambiguities, it is impossible to realize the controlling of failure rate according to analytical formula. Hence, the fixed failure rate approach is implemented by Monte Carlo sampling. However, due to the characteristics of Monte Carlo sampling and look-up table, we have to face the problem of a large amount of time consumption if sufficient GNSS scenarios are included in the creation of look-up table. This restricts the fixed failure rate approach to be a post process approach if a look-up table is not available. Furthermore, if not enough GNSS scenarios are considered, the table may only be valid for a specific scenario or application. Besides this, the method of creating look-up table or look-up function still needs to be designed for each specific acceptance test. To overcome these problems in determination of critical values, this contribution will propose an instantaneous and CONtrollable (iCON) IA ambiguity resolution approach for the first time. The iCON approach has the following advantages: (a) critical value of acceptance test is independently determined based on the required failure rate and GNSS model without resorting to external information such as look-up table; (b) it can be realized instantaneously for most of IA estimators which have analytical probability formulas. The stronger GNSS model, the less time consumption; (c) it provides a new viewpoint to improve the research about IA estimation. To verify these conclusions, multi-frequency and multi-GNSS simulation experiments are implemented. Those results show that IA

  15. Comparison on Integer Wavelet Transforms in Spherical Wavelet Based Image Based Relighting

    Institute of Scientific and Technical Information of China (English)

    WANGZe; LEEYin; LEUNGChising; WONGTientsin; ZHUYisheng

    2003-01-01

    To provide a good quality rendering in the Image based relighting (IBL) system, tremendous reference images under various illumination conditions are needed. Therefore data compression is essential to enable interactive action. And the rendering speed is another crucial consideration for real applications. Based on Spherical wavelet transform (SWT), this paper presents a quick representation method with Integer wavelet transform (IWT) for the IBL system. It focuses on comparison on different IWTs with the Embedded zerotree wavelet (EZW) used in the IBL system. The whole compression procedure contains two major compression steps. Firstly, SWT is applied to consider the correlation among different reference images. Secondly, the SW transformed images are compressed with IWT based image compression approach. Two IWTs are used and good results are showed in the simulations.

  16. An integer programming model for gate assignment problem at airline terminals

    Science.gov (United States)

    Chun, Chong Kok; Nordin, Syarifah Zyurina

    2015-05-01

    In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.

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

    Directory of Open Access Journals (Sweden)

    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.

  18. Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

    Science.gov (United States)

    Karimzadehgan, Maryam; Zhai, ChengXiang

    2011-01-01

    Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970

  19. A Mixed-Integer Linear Programming approach to wind farm layout and inter-array cable routing

    DEFF Research Database (Denmark)

    Fischetti, Martina; Leth, John-Josef; Borchersen, Anders Bech

    2015-01-01

    A Mixed-Integer Linear Programming (MILP) approach is proposed to optimize the turbine allocation and inter-array offshore cable routing. The two problems are considered with a two steps strategy, solving the layout problem first and then the cable problem. We give an introduction to both problems...... and present the MILP models we developed to solve them. To deal with interference in the onshore cases, we propose an adaptation of the standard Jensen’s model, suitable for 3D cases. A simple Stochastic Programming variant of our model allows us to consider different wind scenarios in the optimization...

  20. Distributed mixed-integer fuzzy hierarchical programming for municipal solid waste management. Part I: System identification and methodology development.

    Science.gov (United States)

    Cheng, Guanhui; Huang, Guohe; Dong, Cong; Xu, Ye; Chen, Xiujuan; Chen, Jiapei

    2017-03-01

    Due to the existence of complexities of heterogeneities, hierarchy, discreteness, and interactions in municipal solid waste management (MSWM) systems such as Beijing, China, a series of socio-economic and eco-environmental problems may emerge or worsen and result in irredeemable damages in the following decades. Meanwhile, existing studies, especially ones focusing on MSWM in Beijing, could hardly reflect these complexities in system simulations and provide reliable decision support for management practices. Thus, a framework of distributed mixed-integer fuzzy hierarchical programming (DMIFHP) is developed in this study for MSWM under these complexities. Beijing is selected as a representative case. The Beijing MSWM system is comprehensively analyzed in many aspects such as socio-economic conditions, natural conditions, spatial heterogeneities, treatment facilities, and system complexities, building a solid foundation for system simulation and optimization. Correspondingly, the MSWM system in Beijing is discretized as 235 grids to reflect spatial heterogeneity. A DMIFHP model which is a nonlinear programming problem is constructed to parameterize the Beijing MSWM system. To enable scientific solving of it, a solution algorithm is proposed based on coupling of fuzzy programming and mixed-integer linear programming. Innovations and advantages of the DMIFHP framework are discussed. The optimal MSWM schemes and mechanism revelations will be discussed in another companion paper due to length limitation.

  1. Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

    Science.gov (United States)

    Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.

    2018-03-01

    Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.

  2. Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

    Science.gov (United States)

    Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

    2018-02-01

    In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

  3. 6th Conference on Non-integer Order Calculus and Its Applications

    CERN Document Server

    Łukaniszyn, Marian; Stanisławski, Rafał

    2015-01-01

    This volume presents selected aspects of non-integer, or fractional order systems, whose analysis, synthesis and applications have increasingly become a real challenge for various research communities, ranging from science to engineering. The spectrum of applications of the fractional order calculus has incredibly expanded, in fact it would be hard to find a science/engineering-related subject area where the fractional calculus had not been incorporated. The content of the fractional calculus is ranged from pure mathematics to engineering implementations and so is the content of this volume. The volume is subdivided into six parts, reflecting particular aspects of the fractional order calculus. The first part contains a single invited paper on a new formulation of fractional-order descriptor observers for fractional-order descriptor continous LTI systems. The second part provides new elements to the mathematical theory of fractional-order systems. In the third part of this volume, a bunch of new results in ap...

  4. Planning of fuel coal imports using a mixed integer programming method

    Energy Technology Data Exchange (ETDEWEB)

    Shih, L.H. [National Cheng Kung University, Tainan (Taiwan). Dept. of Mineral and Petroleum Engineering

    1997-12-31

    In the public utility and commercial fuel industries, commodities from multiple supply sources are sometimes blended before use to reduce costs and assure quality. A typical example of these commodities is the fuel coal used in coal fired power plants. The diversity of the supply sources for these plants makes the planning and scheduling of fuel coal logistics difficult, especially for a power company that has more than one power plant. This study proposes a mixed integer programming model that provides planning and scheduling of coal imports from multiple suppliers for the Taiwan Power Company. The objective is to minimize total inventory cost by minimizing procurement cost, transportation cost and holding cost. Constraints on the system include company procurement policy, power plant demand, harbor unloading capacity, inventory balance equations, blending requirements, and safety stock. An example problem is presented using the central coal logistics system of the Taiwan Power Company to demonstrate the validity of the proposed model.

  5. Planning of fuel coal imports using a mixed integer programming method

    International Nuclear Information System (INIS)

    Shih, L.H.

    1997-01-01

    In the public utility and commercial fuel industries, commodities from multiple supply sources are sometimes blended before use to reduce costs and assure quality. A typical example of these commodities is the fuel coal used in coal fired power plants. The diversity of the supply sources for these plants makes the planning and scheduling of fuel coal logistics difficult, especially for a power company that has more than one power plant. This study proposes a mixed integer programming model that provides planning and scheduling of coal imports from multiple suppliers for the Taiwan Power Company. The objective is to minimize total inventory cost by minimizing procurement cost, transportation cost and holding cost. Constraints on the system include company procurement policy, power plant demand, harbor unloading capacity, inventory balance equations, blending requirements, and safety stock. An example problem is presented using the central coal logistics system of the Taiwan Power Company to demonstrate the validity of the proposed model

  6. An integer programming model and benchmark suite for liner shipping network design

    DEFF Research Database (Denmark)

    Løfstedt, Berit; Alvarez, Jose Fernando; Plum, Christian Edinger Munk

    effective and energy efficient liner shipping networks using operations research is huge and neglected. The implementation of logistic planning tools based upon operations research has enhanced performance of both airlines, railways and general transportation companies, but within the field of liner......Maritime transportation is accountable for 2.7% of the worlds CO2 emissions and the liner shipping industry is committed to a slow steaming policy to provide low cost and environmentally conscious global transport of goods without compromising the level of service. The potential for making cost...... along with a rich integer programming model based on the services, that constitute the fixed schedule of a liner shipping company. The model may be relaxed as well as decomposed. The design of a benchmark suite of data instances to reflect the business structure of a global liner shipping network...

  7. A Mixed Integer Efficient Global Optimization Framework: Applied to the Simultaneous Aircraft Design, Airline Allocation and Revenue Management Problem

    Science.gov (United States)

    Roy, Satadru

    Traditional approaches to design and optimize a new system, often, use a system-centric objective and do not take into consideration how the operator will use this new system alongside of other existing systems. This "hand-off" between the design of the new system and how the new system operates alongside other systems might lead to a sub-optimal performance with respect to the operator-level objective. In other words, the system that is optimal for its system-level objective might not be best for the system-of-systems level objective of the operator. Among the few available references that describe attempts to address this hand-off, most follow an MDO-motivated subspace decomposition approach of first designing a very good system and then provide this system to the operator who decides the best way to use this new system along with the existing systems. The motivating example in this dissertation presents one such similar problem that includes aircraft design, airline operations and revenue management "subspaces". The research here develops an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem. The monolithic approach makes the problem a Mixed Integer/Discrete Non-Linear Programming (MINLP/MDNLP) problem, which are extremely difficult to solve. The presence of expensive, sophisticated engineering analyses further aggravate the problem. To tackle this challenge problem, the work here presents a new optimization framework that simultaneously solves the subspaces to capture the "synergism" in the problem that the previous decomposition approaches may not have exploited, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. The framework combines concepts from efficient global optimization, Kriging partial least squares, and gradient-based optimization. This approach then demonstrates its ability to solve an 11 route airline network

  8. Kohastumus eluks vee ääres / Laura Kuusk

    Index Scriptorium Estoniae

    Kuusk, Laura, 1982-

    2007-01-01

    4. "Ars Baltica" fototriennaal Kumu Kunstimuuseumis kuni 30. IX. Tellervo Kalleineni ja Oliver Kochta-Kalleineni, Alexander Vaindorfi, Coloneli (Thierry Geoffroy) ja Khaled D. Ramadani, Kaspars Goba, Tanja Nellemann Poulseni, Katrin Teesi, Anu Pennaneni, Petra Baueri, Talleiv Taro Manumi (sünd. 1968 Jaapanis, elab Norras), Olga Tshernõsheva, Kristina Inciuraite, Julita Wojciki, Sven Johne, Anna Baumgarti, Arturas Valiauga ja duo J&K (Janne Schäfer, Kristine Agergaard) töödest

  9. Integer programming formulation and variable neighborhood search metaheuristic for the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE); Lima, Leonardo [Centro Federal de Educacao Tecnologica Celso Sukow da Fonseca (CEFET-RJ), Rio de Janeiro, RJ (Brazil)

    2008-07-01

    Pipeline are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. In this work we address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. We propose an integer linear programming formulation and a variable neighborhood search meta-heuristic in order to compare the performances of the exact and heuristic approaches to the problem. Computational tests in C language and MOSEL/XPRESS-MP language are performed over a real Brazilian pipeline system. (author)

  10. Mixed integer linear programming for maximum-parsimony phylogeny inference.

    Science.gov (United States)

    Sridhar, Srinath; Lam, Fumei; Blelloch, Guy E; Ravi, R; Schwartz, Russell

    2008-01-01

    Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue to make effective use of the rapidly growing stores of variation data now being gathered. In this paper, we present two integer linear programming (ILP) formulations to find the most parsimonious phylogenetic tree from a set of binary variation data. One method uses a flow-based formulation that can produce exponential numbers of variables and constraints in the worst case. The method has, however, proven extremely efficient in practice on datasets that are well beyond the reach of the available provably efficient methods, solving several large mtDNA and Y-chromosome instances within a few seconds and giving provably optimal results in times competitive with fast heuristics than cannot guarantee optimality. An alternative formulation establishes that the problem can be solved with a polynomial-sized ILP. We further present a web server developed based on the exponential-sized ILP that performs fast maximum parsimony inferences and serves as a front end to a database of precomputed phylogenies spanning the human genome.

  11. Some operational tools for solving fractional and higher integer order differential equations: A survey on their mutual relations

    Science.gov (United States)

    Kiryakova, Virginia S.

    2012-11-01

    The Laplace Transform (LT) serves as a basis of the Operational Calculus (OC), widely explored by engineers and applied scientists in solving mathematical models for their practical needs. This transform is closely related to the exponential and trigonometric functions (exp, cos, sin) and to the classical differentiation and integration operators, reducing them to simple algebraic operations. Thus, the classical LT and the OC give useful tool to handle differential equations and systems with constant coefficients. Several generalizations of the LT have been introduced to allow solving, in a similar way, of differential equations with variable coefficients and of higher integer orders, as well as of fractional (arbitrary non-integer) orders. Note that fractional order mathematical models are recently widely used to describe better various systems and phenomena of the real world. This paper surveys briefly some of our results on classes of such integral transforms, that can be obtained from the LT by means of "transmutations" which are operators of the generalized fractional calculus (GFC). On the list of these Laplace-type integral transforms, we consider the Borel-Dzrbashjan, Meijer, Krätzel, Obrechkoff, generalized Obrechkoff (multi-index Borel-Dzrbashjan) transforms, etc. All of them are G- and H-integral transforms of convolutional type, having as kernels Meijer's G- or Fox's H-functions. Besides, some special functions (also being G- and H-functions), among them - the generalized Bessel-type and Mittag-Leffler (M-L) type functions, are generating Gel'fond-Leontiev (G-L) operators of generalized differentiation and integration, which happen to be also operators of GFC. Our integral transforms have operational properties analogous to those of the LT - they do algebrize the G-L generalized integrations and differentiations, and thus can serve for solving wide classes of differential equations with variable coefficients of arbitrary, including non-integer order

  12. COMPARISON BETWEEN MIXED INTEGER PROGRAMMING WITH HEURISTIC METHOD FOR JOB SHOP SCHEDULING WITH SEPARABLE SEQUENCE-DEPENDENT SETUPS

    Directory of Open Access Journals (Sweden)

    I Gede Agus Widyadana

    2001-01-01

    Full Text Available The decisions to choose appropriate tools for solving industrial problems are not just tools that achieve optimal solution only but it should consider computation time too. One of industrial problems that still difficult to achieve both criteria is scheduling problem. This paper discuss comparison between mixed integer programming which result optimal solution and heuristic method to solve job shop scheduling problem with separable sequence-dependent setup. The problems are generated and the result shows that the heuristic methods still cannot satisfy optimal solution.

  13. A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Alvarez, Fernando; Plum, Christian Edinger Munk

    2014-01-01

    . The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field......The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation...... sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design...

  14. Module detection in complex networks using integer optimisation

    Directory of Open Access Journals (Sweden)

    Tsoka Sophia

    2010-11-01

    Full Text Available Abstract Background The detection of modules or community structure is widely used to reveal the underlying properties of complex networks in biology, as well as physical and social sciences. Since the adoption of modularity as a measure of network topological properties, several methodologies for the discovery of community structure based on modularity maximisation have been developed. However, satisfactory partitions of large graphs with modest computational resources are particularly challenging due to the NP-hard nature of the related optimisation problem. Furthermore, it has been suggested that optimising the modularity metric can reach a resolution limit whereby the algorithm fails to detect smaller communities than a specific size in large networks. Results We present a novel solution approach to identify community structure in large complex networks and address resolution limitations in module detection. The proposed algorithm employs modularity to express network community structure and it is based on mixed integer optimisation models. The solution procedure is extended through an iterative procedure to diminish effects that tend to agglomerate smaller modules (resolution limitations. Conclusions A comprehensive comparative analysis of methodologies for module detection based on modularity maximisation shows that our approach outperforms previously reported methods. Furthermore, in contrast to previous reports, we propose a strategy to handle resolution limitations in modularity maximisation. Overall, we illustrate ways to improve existing methodologies for community structure identification so as to increase its efficiency and applicability.

  15. Load Frequency Control in Microgrids Based on a Stochastic Non-Integer Controller

    DEFF Research Database (Denmark)

    Khooban, Mohammad-Hassan; Niknam, Taher; Shasadeghi, Mokhtar

    2018-01-01

    of battery energy storage systems (BESS) can solve the unbalance effects between the load and supply of an isolated MG, their high cost and tendency toward degradation are restrictive factors, which call for the use of alternative power balancing options. In recent years, the concept of utilizing the BESSs...... of EVs, also known as vehicle-to-grid (V2G) concept, for frequency support of MGs has attracted a lot of attention. In order to allow the V2G controller operate optimally under a wide range of operation conditions caused by the intermittent behavior of renewable energy resources (RESs), a new multi...... hole optimization algorithm (MBHA) is utilized for the adaptive tuning of the non-integer fuzzy PID controller coefficients. The performance of the proposed LFC is evaluated by using real world wind and solar radiation data. Finally, the extensive studies and hardware-in-the-loop (HIL) simulations...

  16. Optimal Airport Surface Traffic Planning Using Mixed-Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    P. C. Roling

    2008-01-01

    Full Text Available We describe an ongoing research effort pertaining to the development of a surface traffic automation system that will help controllers to better coordinate surface traffic movements related to arrival and departure traffic. More specifically, we describe the concept for a taxi-planning support tool that aims to optimize the routing and scheduling of airport surface traffic in such a way as to deconflict the taxi plans while optimizing delay, total taxi-time, or some other airport efficiency metric. Certain input parameters related to resource demand, such as the expected landing times and the expected pushback times, are rather difficult to predict accurately. Due to uncertainty in the input data driving the taxi-planning process, the taxi-planning tool is designed such that it produces solutions that are robust to uncertainty. The taxi-planning concept presented herein, which is based on mixed-integer linear programming, is designed such that it is able to adapt to perturbations in these input conditions, as well as to account for failure in the actual execution of surface trajectories. The capabilities of the tool are illustrated in a simple hypothetical airport.

  17. Learning oncogenetic networks by reducing to mixed integer linear programming.

    Science.gov (United States)

    Shahrabi Farahani, Hossein; Lagergren, Jens

    2013-01-01

    Cancer can be a result of accumulation of different types of genetic mutations such as copy number aberrations. The data from tumors are cross-sectional and do not contain the temporal order of the genetic events. Finding the order in which the genetic events have occurred and progression pathways are of vital importance in understanding the disease. In order to model cancer progression, we propose Progression Networks, a special case of Bayesian networks, that are tailored to model disease progression. Progression networks have similarities with Conjunctive Bayesian Networks (CBNs) [1],a variation of Bayesian networks also proposed for modeling disease progression. We also describe a learning algorithm for learning Bayesian networks in general and progression networks in particular. We reduce the hard problem of learning the Bayesian and progression networks to Mixed Integer Linear Programming (MILP). MILP is a Non-deterministic Polynomial-time complete (NP-complete) problem for which very good heuristics exists. We tested our algorithm on synthetic and real cytogenetic data from renal cell carcinoma. We also compared our learned progression networks with the networks proposed in earlier publications. The software is available on the website https://bitbucket.org/farahani/diprog.

  18. Discovery of Boolean metabolic networks: integer linear programming based approach.

    Science.gov (United States)

    Qiu, Yushan; Jiang, Hao; Ching, Wai-Ki; Cheng, Xiaoqing

    2018-04-11

    Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects. In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature. Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at " http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip ".

  19. A CU-Level Rate and Distortion Estimation Scheme for RDO of Hardware-Friendly HEVC Encoders Using Low-Complexity Integer DCTs.

    Science.gov (United States)

    Lee, Bumshik; Kim, Munchurl

    2016-08-01

    In this paper, a low complexity coding unit (CU)-level rate and distortion estimation scheme is proposed for High Efficiency Video Coding (HEVC) hardware-friendly implementation where a Walsh-Hadamard transform (WHT)-based low-complexity integer discrete cosine transform (DCT) is employed for distortion estimation. Since HEVC adopts quadtree structures of coding blocks with hierarchical coding depths, it becomes more difficult to estimate accurate rate and distortion values without actually performing transform, quantization, inverse transform, de-quantization, and entropy coding. Furthermore, DCT for rate-distortion optimization (RDO) is computationally high, because it requires a number of multiplication and addition operations for various transform block sizes of 4-, 8-, 16-, and 32-orders and requires recursive computations to decide the optimal depths of CU or transform unit. Therefore, full RDO-based encoding is highly complex, especially for low-power implementation of HEVC encoders. In this paper, a rate and distortion estimation scheme is proposed in CU levels based on a low-complexity integer DCT that can be computed in terms of WHT whose coefficients are produced in prediction stages. For rate and distortion estimation in CU levels, two orthogonal matrices of 4×4 and 8×8 , which are applied to WHT that are newly designed in a butterfly structure only with addition and shift operations. By applying the integer DCT based on the WHT and newly designed transforms in each CU block, the texture rate can precisely be estimated after quantization using the number of non-zero quantized coefficients and the distortion can also be precisely estimated in transform domain without de-quantization and inverse transform required. In addition, a non-texture rate estimation is proposed by using a pseudoentropy code to obtain accurate total rate estimates. The proposed rate and the distortion estimation scheme can effectively be used for HW-friendly implementation of

  20. Half-integer flux quantum effect in tricrystal Bi2Sr2CaCu2O8+δ

    International Nuclear Information System (INIS)

    Kirtley, J.R.; Tsuei, C.C.; Raffy, H.; Sun, J.Z.; Megtert, S.

    1996-01-01

    We have used a scanning SQUID microscope to directly observe the half-integer flux quantum effect, in epitaxial films of Bi 2 Sr 2 CaCu 2 O 8+δ , at the meeting point of a tricrystal substrate of SrTiO 3 in a geometry chosen to show this effect for a d-wave superconductor. This observation, when considered along with recent photoemission results, proves that the in-plane order parameter for this high-T c cuprate superconductor closely follows d x 2 -y 2 symmetry. (orig.)

  1. Lutshi vrag Artura Konan Doila / Svetlana Haritonova

    Index Scriptorium Estoniae

    Haritonova, Svetlana

    2000-01-01

    Venemaa televisioonis tuli ekraanile sari "Mälestusi Sherlock Holmesist" ("Vospominanija o Sherloke Holmse") : režissöör Igor Maslennikov. Lugusid ühendavaks saab kirjaniku sir Anthon Conan Doyle'i kuju, keda mängib Aleksei Petrenko

  2. Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

    Science.gov (United States)

    Alvarado, Michelle; Ntaimo, Lewis

    2018-03-01

    Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

  3. Solid state NMR, basic theory and recent progress for quadrupole nuclei with half-integer spin

    International Nuclear Information System (INIS)

    Dieter, F.

    1998-01-01

    This review describes the basic theory and some recently developed techniques for the study of quadrupole nuclei with half integer spins in powder materials. The latter is connected to the introduction of the double rotation (DOR) by A. Samoson et al. (1) and to the introduction of the multiple quantum magic-angle spinning (MQ MAS) technique by L. Frydman et. al. (2). For integer spins, especially the solid-state deuterium magnetic resonance, we refer to the review of G.L. Hoatson and R.L. Vold: '' 2 H-NMR Spectroscopy of Solids and Liquid Crystals'' (3). For single crystals we refer to O. Kanert and M. Mehring: ''Static quadrupole effects in disordered cubic solids''(4) and we would like also to mention the ''classic'' review of M.H. Cohen and F. Reif: ''Quadrupole effects in NMR studies of solids'' (5). Some more recent reviews in the field under study are D. Freude and J. Haase ''Quadrupole effects in solid-state NMR'' (6). Ch. Jager: ''Satellite Transition Spectroscopy of Quadrupolar Nuclei'' (7) and B.F. Chmelka and J.W. Zwanziger: ''Solid State NMR Line Narrowing Methods for Quadrupolar Nuclei - Double Rotation and Dynamic-Angle Spinning'' (8). A survey of nuclear quadrupole frequency data published before the end of 1982 is given by H. Chihara and N. Nakamura in Landolt-Bornstein, Vol. 20 (9). Values of the chemical shift of quadrupole nuclei in solids can be found in books such as ''Multinuclear NMR'' edited by J. Mason (10). In section 9 of ref (6) some electric field gradient and chemical shift data published from 1983 to 1992 for the most studied quadrupole nuclei sup 27 Al, sup 23 Na, and sup 17 O are given

  4. A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm

    Directory of Open Access Journals (Sweden)

    Godfrey Chagwiza

    2016-01-01

    Full Text Available In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

  5. Maximum likelihood pedigree reconstruction using integer linear programming.

    Science.gov (United States)

    Cussens, James; Bartlett, Mark; Jones, Elinor M; Sheehan, Nuala A

    2013-01-01

    Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible. © 2012 Wiley Periodicals, Inc.

  6. A grey-forecasting interval-parameter mixed-integer programming approach for integrated electric-environmental management–A case study of Beijing

    International Nuclear Information System (INIS)

    Wang, Xingwei; Cai, Yanpeng; Chen, Jiajun; Dai, Chao

    2013-01-01

    In this study, a GFIPMIP (grey-forecasting interval-parameter mixed-integer programming) approach was developed for supporting IEEM (integrated electric-environmental management) in Beijing. It was an attempt to incorporate an energy-forecasting model within a general modeling framework at the municipal level. The developed GFIPMIP model can not only forecast electric demands, but also reflect dynamic, interactive, and uncertain characteristics of the IEEM system in Beijing. Moreover, it can address issues regarding power supply, and emission reduction of atmospheric pollutants and GHG (greenhouse gas). Optimal solutions were obtained related to power generation patterns and facility capacity expansion schemes under a series of system constraints. Two scenarios were analyzed based on multiple environmental policies. The results were useful for helping decision makers identify desired management strategies to guarantee the city's power supply and mitigate emissions of GHG and atmospheric pollutants. The results also suggested that the developed GFIPMIP model be applicable to similar engineering problems. - Highlights: • A grey-forecasting interval-parameter mixed integer programming (GFIPMIP) approach was developed. • It could reflect dynamic, interactive, and uncertain characteristics of an IEEM system. • The developed GFIPMIP approach was used for supporting IEEM system planning in Beijing. • Two scenarios were established based on different environmental policies and management targets. • Optimal schemes for power generation, energy supply, and environmental protection were identified

  7. An integer optimization algorithm for robust identification of non-linear gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Chemmangattuvalappil Nishanth

    2012-09-01

    Full Text Available Abstract Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters

  8. Application of integer programming on logistics solution for load transportation: the solver tool and its limitations in the search for the optimal solution

    Directory of Open Access Journals (Sweden)

    Ricardo França Santos

    2012-01-01

    Full Text Available This work tries to solve a typical logistics problem of Navy of Brazil regards the allocation, transportation and distribution of genera refrigerated for Military Organizations within Grande Rio (RJ. After a brief review of literature on Linear/Integer Programming and some of their applications, we proposed the use of Integer Programming, using the Excel’s Solver as a tool for obtaining the optimal load configuration for the fleet, obtaining the lower distribution costs in order to meet the demand schedule. The assumptions were met in a first attempt with a single spreadsheet, but it could not find a convergent solution, without degeneration problems and with a reasonable solution time. A second solution was proposed separating the problem into three phases, which allowed us to highlight the potential and limitations of the Solver tool. This study showed the importance of formulating a realistic model and of a detailed critical analysis, which could be seen through the lack of convergence of the first solution and the success achieved by the second one.

  9. Application of a Double-Sided Chance-Constrained Integer Linear Program for Optimization of the Incremental Value of Ecosystem Services in Jilin Province, China

    Directory of Open Access Journals (Sweden)

    Baofeng Cai

    2017-08-01

    Full Text Available The Interconnected River System Network Project (IRSNP is a significant water supply engineering project, which is capable of effectively utilizing flood resources to generate ecological value, by connecting 198 lakes and ponds in western Jilin, northeast China. In this article, an optimization research approach has been proposed to maximize the incremental value of IRSNP ecosystem services. A double-sided chance-constrained integer linear program (DCCILP method has been proposed to support the optimization, which can deal with uncertainties presented as integers or random parameters that appear on both sides of the decision variable at the same time. The optimal scheme indicates that after rational optimization, the total incremental value of ecosystem services from the interconnected river system network project increased 22.25%, providing an increase in benefits of 3.26 × 109 ¥ compared to the original scheme. Most of the functional area is swamp wetland, which provides the greatest ecological benefits. Adjustment services increased obviously, implying that the optimization scheme prioritizes ecological benefits rather than supply and production services.

  10. Preconditioning 2D Integer Data for Fast Convex Hull Computations.

    Science.gov (United States)

    Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L

    2016-01-01

    In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.

  11. Optimization of edge state velocity in the integer quantum Hall regime

    Science.gov (United States)

    Sahasrabudhe, H.; Novakovic, B.; Nakamura, J.; Fallahi, S.; Povolotskyi, M.; Klimeck, G.; Rahman, R.; Manfra, M. J.

    2018-02-01

    Observation of interference in the quantum Hall regime may be hampered by a small edge state velocity due to finite phase coherence time. Therefore designing two quantum point contact (QPCs) interferometers having a high edge state velocity is desirable. Here we present a new simulation method for designing heterostructures with high edge state velocity by realistically modeling edge states near QPCs in the integer quantum Hall effect (IQHE) regime. Using this simulation method, we also predict the filling factor at the center of QPCs and their conductance at different gate voltages. The 3D Schrödinger equation is split into 1D and 2D parts. Quasi-1D Schrödinger and Poisson equations are solved self-consistently in the IQHE regime to obtain the potential profile, and quantum transport is used to solve for the edge state wave functions. The velocity of edge states is found to be /B , where is the expectation value of the electric field for the edge state. Anisotropically etched trench gated heterostructures with double-sided delta doping have the highest edge state velocity among the structures considered.

  12. Application of mixed-integer linear programming in a car seats assembling process

    Directory of Open Access Journals (Sweden)

    Jorge Iván Perez Rave

    2011-12-01

    Full Text Available In this paper, a decision problem involving a car parts manufacturing company is modeled in order to prepare the company for an increase in demand. Mixed-integer linear programming was used with the following decision variables: creating a second shift, purchasing additional equipment, determining the required work force, and other alternatives involving new manners of work distribution that make it possible to separate certain operations from some workplaces and integrate them into others to minimize production costs. The model was solved using GAMS. The solution consisted of programming 19 workers under a configuration that merges two workplaces and separates some operations from some workplaces. The solution did not involve purchasing additional machinery or creating a second shift. As a result, the manufacturing paradigms that had been valid in the company for over 14 years were broken. This study allowed the company to increase its productivity and obtain significant savings. It also shows the benefits of joint work between academia and companies, and provides useful information for professors, students and engineers regarding production and continuous improvement.

  13. A Stochastic Integer Programming Model for Minimizing Cost in the Use of Rain Water Collectors for Firefighting

    Directory of Open Access Journals (Sweden)

    Luis A. Rivera-Morales

    2014-01-01

    Full Text Available In this paper we propose a stochastic integer programming optimization model to determine the optimal location and number of rain water collectors (RWCs for forest firefighting. The objective is to minimize expected total cost to control forest fires. The model is tested using a real case and several additional realistic scenarios. The impact on the solution of varying the limit on the number of RWCs, the RWC water capacity, the aircraft capacity, the water demands, and the aircraft operating cost is explored. Some observations are that the objective value improves with larger RWCs and with the use of aircraft with greater capacity.

  14. Comparison of linear, mixed integer and non-linear programming methods in energy system dispatch modelling

    DEFF Research Database (Denmark)

    Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian

    2014-01-01

    In the paper, three frequently used operation optimisation methods are examined with respect to their impact on operation management of the combined utility technologies for electric power and DH (district heating) of eastern Denmark. The investigation focusses on individual plant operation...... differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...... as a benchmark, as this type is frequently used, and has the lowest amount of constraints of the three. A comparison of the optimised operation of a number of units shows significant differences between the three methods. Compared to the reference, the use of binary integer variables, increases operation...

  15. Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels.

    Science.gov (United States)

    Kassa, Biniyam Asmare; Tizazu, Anteneh Eshetu

    2013-01-01

    In this paper, we report perhaps a first of its kind application of management science in the Ethiopian hotel industry. Avanti Blue Nile Hotels, a newly established five star hotel in Bahir Dar, is the company for which we developed an integer programming model that determines an optimal weekly shift schedule for the Hotel's engineering department personnel while satisfying several constraints including weekly rest requirements per employee, rest requirements between working shifts per employee, required number of personnel per shift, and other constraints. The model is implemented on an excel solver routine. The model enables the company's personnel department management to develop a fair personnel schedule as needed and to effectively utilize personnel resources while satisfying several technical, legal and economic requirements. These encouraging achievements make us optimistic about the gains other Ethiopian organizations can amass by introducing management science approaches in their management planning and decision making systems.

  16. WORKFORCE SIZING AND SCHEDULING FOR A SERVICE CONTRACTOR USING INTEGER PROGRAMMING

    Directory of Open Access Journals (Sweden)

    D.G. Conradie

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: Operations Research is perceived to be on the verge of demise as a decision support tool in industry. However, this is not true, since the relevancy and interdisciplinary nature of Operations Research makes it an indispensable part of operations management. What should rather be asked is how Operations Research is introduced to undergraduate industrial engineering students. This paper reports on one of the optimisation initiatives undertaken for a service contractor using integer programming as part of a semester project. Although the model addresses specific business issues related to the contractor, it can easily be generalised for other applications.

    AFRIKAANSE OPSOMMING: Operasionele Navorsing word geag as ’n kwynende besluitnemingsinstrument in die nywerheid. Dit is egter onwaar, aangesien die toepaslikheid en interdissiplinêre karakter van Operasionele Navorsing dit ‘n onmisbare rol laat speel in operasionele bestuur. Die vraag wat eerder gevra moet word is hoe Operasionele Navorsing aan voorgraadse bedryfsingenieurswesestudente aangebied word. Hierdie artikel doen verslag oor een van die optimerings-inisiatiewe wat as deel van ‘n semesterprojek vir ‘n diensverskaffer uitgevoer is, en maak van heeltal-programmering gebruik. Alhoewel die model kontrakteur-spesifieke besigheidsreëls aanspreek, kan dit maklik veralgemeen word vir wyer toepassing.

  17. Robust integer and fractional helical modes in the quantum Hall effect

    Science.gov (United States)

    Ronen, Yuval; Cohen, Yonatan; Banitt, Daniel; Heiblum, Moty; Umansky, Vladimir

    2018-04-01

    Electronic systems harboring one-dimensional helical modes, where spin and momentum are locked, have lately become an important field of their own. When coupled to a conventional superconductor, such systems are expected to manifest topological superconductivity; a unique phase hosting exotic Majorana zero modes. Even more interesting are fractional helical modes, yet to be observed, which open the route for realizing generalized parafermions. Possessing non-Abelian exchange statistics, these quasiparticles may serve as building blocks in topological quantum computing. Here, we present a new approach to form protected one-dimensional helical edge modes in the quantum Hall regime. The novel platform is based on a carefully designed double-quantum-well structure in a GaAs-based system hosting two electronic sub-bands; each tuned to the quantum Hall effect regime. By electrostatic gating of different areas of the structure, counter-propagating integer, as well as fractional, edge modes with opposite spins are formed. We demonstrate that, due to spin protection, these helical modes remain ballistic over large distances. In addition to the formation of helical modes, this platform can serve as a rich playground for artificial induction of compounded fractional edge modes, and for construction of edge-mode-based interferometers.

  18. SSP: an interval integer linear programming for de novo transcriptome assembly and isoform discovery of RNA-seq reads.

    Science.gov (United States)

    Safikhani, Zhaleh; Sadeghi, Mehdi; Pezeshk, Hamid; Eslahchi, Changiz

    2013-01-01

    Recent advances in the sequencing technologies have provided a handful of RNA-seq datasets for transcriptome analysis. However, reconstruction of full-length isoforms and estimation of the expression level of transcripts with a low cost are challenging tasks. We propose a novel de novo method named SSP that incorporates interval integer linear programming to resolve alternatively spliced isoforms and reconstruct the whole transcriptome from short reads. Experimental results show that SSP is fast and precise in determining different alternatively spliced isoforms along with the estimation of reconstructed transcript abundances. The SSP software package is available at http://www.bioinf.cs.ipm.ir/software/ssp. © 2013.

  19. Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming

    Science.gov (United States)

    Fujino, Yoju; Wadayama, Tadashi

    In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can be sequentially written in the WOM storage at least $t^*$-times. In this paper, a WOM storage is modeled by a state transition graph. The proposed construction has the following two features. First, it includes a systematic method to determine the encoding regions in the state transition graph. Second, the proposed construction includes a labeling method for states by using integer programming. Several novel WOM codes for $q$ level flash memories with 2 cells are constructed by the proposed construction. They achieve the worst numbers of writes $t^*$ that meet the known upper bound in many cases. In addition, we constructed fixed rate non-binary WOM codes with the capability to reduce ICI (inter cell interference) of flash cells. One of the advantages of the proposed construction is its flexibility. It can be applied to various storage devices, to various dimensions (i.e, number of cells), and various kind of additional constraints.

  20. A bi-objective integer programming model for partly-restricted flight departure scheduling.

    Science.gov (United States)

    Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

    2018-01-01

    The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

  1. Prenylated flavone from roots of a hybrid between Artocarpus heterophyllus and Artocarpus integer and its biological activities

    International Nuclear Information System (INIS)

    Panthong, Kanda; Tohdee, Kanogwan; Hutadilok-Towatana, Nongporn; Voravuthikunchai, Supayang P.; Chusri, Sasitorn

    2013-01-01

    One new prenylated flavone, 2,8-dihydroxy-3,10-dimethoxy-6-(2-methyl-1-propen-1-yl)- 6H,7H-[1]benzopyrano[4,3-b][1]-benzopyran-7-one, together with 24 known compounds were isolated from crude acetone extract from the roots of a hybrid between Artocarpus heterophyllus and Artocarpus integer. Their structures were determined by 1D and 2D nuclear magnetic resonance (NMR) spectroscopic data. The antioxidant and antibacterial activities of the isolated compounds were evaluated. The new compound showed potent antioxidant activity against DPPH• and superoxide with IC 50 values of 0.033 and 0.125 mg mL -1 , respectively. Significant antibacterial activity against Acinetobacter baumannii was observed with MIC value of 50 μg mL -1 . (author)

  2. Integer, fractional, and anomalous quantum Hall effects explained with Eyring's rate process theory and free volume concept.

    Science.gov (United States)

    Hao, Tian

    2017-02-22

    The Hall effects, especially the integer, fractional and anomalous quantum Hall effects, have been addressed using Eyring's rate process theory and free volume concept. The basic assumptions are that the conduction process is a common rate controlled "reaction" process that can be described with Eyring's absolute rate process theory; the mobility of electrons should be dependent on the free volume available for conduction electrons. The obtained Hall conductivity is clearly quantized as with prefactors related to both the magnetic flux quantum number and the magnetic quantum number via the azimuthal quantum number, with and without an externally applied magnetic field. This article focuses on two dimensional (2D) systems, but the approaches developed in this article can be extended to 3D systems.

  3. An integer programming formulation of the parsimonious loss of heterozygosity problem.

    Science.gov (United States)

    Catanzaro, Daniele; Labbé, Martine; Halldórsson, Bjarni V

    2013-01-01

    A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general $({\\cal NP})$-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches.

  4. A Mixed Integer Linear Programming Model for the Design of Remanufacturing Closed–loop Supply Chain Network

    Directory of Open Access Journals (Sweden)

    Mbarek Elbounjimi

    2015-11-01

    Full Text Available Closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. In this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. First, a mixed-integer linear programming formulation is developed to maximize the total profit. The main contribution of the proposed model is addressing two economic viability issues of closed-loop supply chain. The first issue is the collection of sufficient quantity of end-of-life products are assured by retailers against an acquisition price. The second issue is exploiting the benefits of colocation of forward facilities and reverse facilities. The presented model is solved by LINGO for some test problems. Computational results and sensitivity analysis are conducted to show the performance of the proposed model.

  5. Aspect-object alignment with Integer Linear Programming in opinion mining.

    Directory of Open Access Journals (Sweden)

    Yanyan Zhao

    Full Text Available Target extraction is an important task in opinion mining. In this task, a complete target consists of an aspect and its corresponding object. However, previous work has always simply regarded the aspect as the target itself and has ignored the important "object" element. Thus, these studies have addressed incomplete targets, which are of limited use for practical applications. This paper proposes a novel and important sentiment analysis task, termed aspect-object alignment, to solve the "object neglect" problem. The objective of this task is to obtain the correct corresponding object for each aspect. We design a two-step framework for this task. We first provide an aspect-object alignment classifier that incorporates three sets of features, namely, the basic, relational, and special target features. However, the objects that are assigned to aspects in a sentence often contradict each other and possess many complicated features that are difficult to incorporate into a classifier. To resolve these conflicts, we impose two types of constraints in the second step: intra-sentence constraints and inter-sentence constraints. These constraints are encoded as linear formulations, and Integer Linear Programming (ILP is used as an inference procedure to obtain a final global decision that is consistent with the constraints. Experiments on a corpus in the camera domain demonstrate that the three feature sets used in the aspect-object alignment classifier are effective in improving its performance. Moreover, the classifier with ILP inference performs better than the classifier without it, thereby illustrating that the two types of constraints that we impose are beneficial.

  6. Aspect-object alignment with Integer Linear Programming in opinion mining.

    Science.gov (United States)

    Zhao, Yanyan; Qin, Bing; Liu, Ting; Yang, Wei

    2015-01-01

    Target extraction is an important task in opinion mining. In this task, a complete target consists of an aspect and its corresponding object. However, previous work has always simply regarded the aspect as the target itself and has ignored the important "object" element. Thus, these studies have addressed incomplete targets, which are of limited use for practical applications. This paper proposes a novel and important sentiment analysis task, termed aspect-object alignment, to solve the "object neglect" problem. The objective of this task is to obtain the correct corresponding object for each aspect. We design a two-step framework for this task. We first provide an aspect-object alignment classifier that incorporates three sets of features, namely, the basic, relational, and special target features. However, the objects that are assigned to aspects in a sentence often contradict each other and possess many complicated features that are difficult to incorporate into a classifier. To resolve these conflicts, we impose two types of constraints in the second step: intra-sentence constraints and inter-sentence constraints. These constraints are encoded as linear formulations, and Integer Linear Programming (ILP) is used as an inference procedure to obtain a final global decision that is consistent with the constraints. Experiments on a corpus in the camera domain demonstrate that the three feature sets used in the aspect-object alignment classifier are effective in improving its performance. Moreover, the classifier with ILP inference performs better than the classifier without it, thereby illustrating that the two types of constraints that we impose are beneficial.

  7. Mixed-integer programming methods for transportation and power generation problems

    Science.gov (United States)

    Damci Kurt, Pelin

    This dissertation conducts theoretical and computational research to solve challenging problems in application areas such as supply chain and power systems. The first part of the dissertation studies a transportation problem with market choice (TPMC) which is a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We show that TPMC is strongly NP-complete. We consider a version of the problem with a service level constraint on the maximum number of markets that can be rejected and show that if the original problem is polynomial, its cardinality-constrained version is also polynomial. We propose valid inequalities for mixed-integer cover and knapsack sets with variable upper bound constraints, which appear as substructures of TPMC and use them in a branch-and-cut algorithm to solve this problem. The second part of this dissertation studies a unit commitment (UC) problem in which the goal is to minimize the operational cost of power generators over a time period subject to physical constraints while satisfying demand. We provide several exponential classes of multi-period ramping and multi-period variable upper bound inequalities. We prove the strength of these inequalities and describe polynomial-time separation algorithms. Computational results show the effectiveness of the proposed inequalities when used as cuts in a branch-and-cut algorithm to solve the UC problem. The last part of this dissertation investigates the effects of uncertain wind power on the UC problem. A two-stage robust model and a three-stage stochastic program are compared.

  8. Remembering the hindu festivities mathematically by the balinese using integer operations and least common multiple

    Science.gov (United States)

    Budi Darmayasa, Jero; Wahyudin; Mulyana, Tatang; Subali Noto, Muchamad

    2018-04-01

    Ethnomathematicsis considered as a new study in mathematic education. As a study, numerous regions in this world starts to explore through ethnomathematics, including Indonesia. As the intersection between mathematics and mathematical modelling and culture, ethnomathematics exists in various society’s cultural elements, including in the Balinese Hindus’ festivities. To find the mathematical concept used in determining the festivity days, the researcher(s) conducted ethnographic research in Bali Mula society in Kintamani District, Bali. Participation observation, in-depth interview, and literature and documentation were used in collecting the data. As the result, the researcher(s) revealed that the mathematical concept used is integer operations, least common multiple, mixed fraction, and number sequences. Since it contains mathematical concept used in junior high, thus ethnomathematics of “4-hindu’s festivities” may be used as context in mathematics learning. By using ethnomathematics as the context, the researcher(s) expect that it will help teachers in motivation their students to learn mathematics.

  9. Optimising the selection of food items for FFQs using Mixed Integer Linear Programming.

    Science.gov (United States)

    Gerdessen, Johanna C; Souverein, Olga W; van 't Veer, Pieter; de Vries, Jeanne Hm

    2015-01-01

    To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear Programming (MILP) model. The methodology was demonstrated for an FFQ with interest in energy, total protein, total fat, saturated fat, monounsaturated fat, polyunsaturated fat, total carbohydrates, mono- and disaccharides, dietary fibre and potassium. The food lists generated by the MILP model have good performance in terms of length, coverage and R 2 (explained variance) of all nutrients. MILP-generated food lists were 32-40 % shorter than a benchmark food list, whereas their quality in terms of R 2 was similar to that of the benchmark. The results suggest that the MILP model makes the selection process faster, more standardised and transparent, and is especially helpful in coping with multiple nutrients. The complexity of the method does not increase with increasing number of nutrients. The generated food lists appear either shorter or provide more information than a food list generated without the MILP model.

  10. Quantum simulation of the integer factorization problem: Bell states in a Penning trap

    Science.gov (United States)

    Rosales, Jose Luis; Martin, Vicente

    2018-03-01

    The arithmetic problem of factoring an integer N can be translated into the physics of a quantum device, a result that supports Pólya's and Hilbert's conjecture to demonstrate Riemann's hypothesis. The energies of this system, being univocally related to the factors of N , are the eigenvalues of a bounded Hamiltonian. Here we solve the quantum conditions and show that the histogram of the discrete energies, provided by the spectrum of the system, should be interpreted in number theory as the relative probability for a prime to be a factor candidate of N . This is equivalent to a quantum sieve that is shown to require only o (ln√{N}) 3 energy measurements to solve the problem, recovering Shor's complexity result. Hence the outcome can be seen as a probability map that a pair of primes solve the given factorization problem. Furthermore, we show that a possible embodiment of this quantum simulator corresponds to two entangled particles in a Penning trap. The possibility to build the simulator experimentally is studied in detail. The results show that factoring numbers, many orders of magnitude larger than those computed with experimentally available quantum computers, is achievable using typical parameters in Penning traps.

  11. Prenylated flavone from roots of a hybrid between Artocarpus heterophyllus and Artocarpus integer and its biological activities

    Energy Technology Data Exchange (ETDEWEB)

    Panthong, Kanda [Prince of Songkla University (Thailand). Natural Product Research Center of Excellence; Tohdee, Kanogwan [Prince of Songkla University (Thailand). Faculty of Science. Department of Chemistry; Hutadilok-Towatana, Nongporn [Prince of Songkla University (Thailand). Dept. of Biochemistry; Voravuthikunchai, Supayang P. [Prince of Songkla University (Thailand). Faculty of Science. Department of Microbiology; Chusri, Sasitorn [Prince of Songkla University (Thailand). Faculty of Traditional Thai Medicine

    2013-10-15

    One new prenylated flavone, 2,8-dihydroxy-3,10-dimethoxy-6-(2-methyl-1-propen-1-yl)- 6H,7H-[1]benzopyrano[4,3-b][1]-benzopyran-7-one, together with 24 known compounds were isolated from crude acetone extract from the roots of a hybrid between Artocarpus heterophyllus and Artocarpus integer. Their structures were determined by 1D and 2D nuclear magnetic resonance (NMR) spectroscopic data. The antioxidant and antibacterial activities of the isolated compounds were evaluated. The new compound showed potent antioxidant activity against DPPH Bullet and superoxide with IC{sub 50} values of 0.033 and 0.125 mg mL{sup -1}, respectively. Significant antibacterial activity against Acinetobacter baumannii was observed with MIC value of 50 {mu}g mL{sup -1}. (author)

  12. Genetic Algorithm for Mixed Integer Nonlinear Bilevel Programming and Applications in Product Family Design

    Directory of Open Access Journals (Sweden)

    Chenlu Miao

    2016-01-01

    Full Text Available Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP, which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard problem. Consequently, using traditional methods to solve such problems is difficult. Genetic algorithms (GAs have great value in solving BLP problems, and many studies have designed GAs to solve BLP problems; however, such GAs are typically designed for special cases that do not involve MINLBLP with one or multiple followers. Therefore, we propose a bilevel GA to solve these particular MINLBLP problems, which are widely used in product family problems. We give numerical examples to demonstrate the effectiveness of the proposed algorithm. In addition, a reducer family case study is examined to demonstrate practical applications of the proposed BLGA.

  13. A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty

    Science.gov (United States)

    Yin, Sisi; Nishi, Tatsushi

    2014-11-01

    Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.

  14. Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming

    Science.gov (United States)

    Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias

    2012-01-01

    Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits. PMID:22536398

  15. A multiple objective mixed integer linear programming model for power generation expansion planning

    Energy Technology Data Exchange (ETDEWEB)

    Antunes, C. Henggeler; Martins, A. Gomes [INESC-Coimbra, Coimbra (Portugal); Universidade de Coimbra, Dept. de Engenharia Electrotecnica, Coimbra (Portugal); Brito, Isabel Sofia [Instituto Politecnico de Beja, Escola Superior de Tecnologia e Gestao, Beja (Portugal)

    2004-03-01

    Power generation expansion planning inherently involves multiple, conflicting and incommensurate objectives. Therefore, mathematical models become more realistic if distinct evaluation aspects, such as cost and environmental concerns, are explicitly considered as objective functions rather than being encompassed by a single economic indicator. With the aid of multiple objective models, decision makers may grasp the conflicting nature and the trade-offs among the different objectives in order to select satisfactory compromise solutions. This paper presents a multiple objective mixed integer linear programming model for power generation expansion planning that allows the consideration of modular expansion capacity values of supply-side options. This characteristic of the model avoids the well-known problem associated with continuous capacity values that usually have to be discretized in a post-processing phase without feedback on the nature and importance of the changes in the attributes of the obtained solutions. Demand-side management (DSM) is also considered an option in the planning process, assuming there is a sufficiently large portion of the market under franchise conditions. As DSM full costs are accounted in the model, including lost revenues, it is possible to perform an evaluation of the rate impact in order to further inform the decision process (Author)

  16. EU commissioner advises introducing euro "when ready" / Arturas Racas

    Index Scriptorium Estoniae

    Racas, Arturas

    2006-01-01

    Euroopa Liidu rahandusasjade volinik Joaquin Almunia teatas, et Leedu ei peaks lootma kriteeriumite muutmisele eurole üleminekul. Leedu rahandusminister pakub eurotsooniga liitumise tähtajaks aastat 2010

  17. Improving an Integer Linear Programming Model of an Ecovat Buffer by Adding Long-Term Planning

    Directory of Open Access Journals (Sweden)

    Gijs J. H. de Goeijen

    2017-12-01

    Full Text Available The Ecovat is a seasonal thermal storage solution consisting of a large underground water tank divided into a number of virtual segments that can be individually charged and discharged. The goal of the Ecovat is to supply heat demand to a neighborhood throughout the entire year. In this work, we extend an integer linear programming model to describe the charging and discharging of such an Ecovat buffer by adding a long-term (yearly planning step to the model. We compare the results from the model using this extension to previously obtained results and show significant improvements when looking at the combination of costs and the energy content of the buffer at the end of the optimization. Furthermore, we show that the model is very robust against prediction errors. For this, we compare two different cases: one case in which we assume perfect predictions are available and one case in which we assume no predictions are available. The largest observed difference in costs between these two cases is less than 2%.

  18. An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications

    International Nuclear Information System (INIS)

    Santos Coelho, Leandro dos

    2009-01-01

    The reliability-redundancy optimization problems can involve the selection of components with multiple choices and redundancy levels that produce maximum benefits, and are subject to the cost, weight, and volume constraints. Many classical mathematical methods have failed in handling nonconvexities and nonsmoothness in reliability-redundancy optimization problems. As an alternative to the classical optimization approaches, the meta-heuristics have been given much attention by many researchers due to their ability to find an almost global optimal solutions. One of these meta-heuristics is the particle swarm optimization (PSO). PSO is a population-based heuristic optimization technique inspired by social behavior of bird flocking and fish schooling. This paper presents an efficient PSO algorithm based on Gaussian distribution and chaotic sequence (PSO-GC) to solve the reliability-redundancy optimization problems. In this context, two examples in reliability-redundancy design problems are evaluated. Simulation results demonstrate that the proposed PSO-GC is a promising optimization technique. PSO-GC performs well for the two examples of mixed-integer programming in reliability-redundancy applications considered in this paper. The solutions obtained by the PSO-GC are better than the previously best-known solutions available in the recent literature

  19. An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications

    Energy Technology Data Exchange (ETDEWEB)

    Santos Coelho, Leandro dos [Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Pontifical Catholic University of Parana, PUCPR, Imaculada Conceicao, 1155, 80215-901 Curitiba, Parana (Brazil)], E-mail: leandro.coelho@pucpr.br

    2009-04-15

    The reliability-redundancy optimization problems can involve the selection of components with multiple choices and redundancy levels that produce maximum benefits, and are subject to the cost, weight, and volume constraints. Many classical mathematical methods have failed in handling nonconvexities and nonsmoothness in reliability-redundancy optimization problems. As an alternative to the classical optimization approaches, the meta-heuristics have been given much attention by many researchers due to their ability to find an almost global optimal solutions. One of these meta-heuristics is the particle swarm optimization (PSO). PSO is a population-based heuristic optimization technique inspired by social behavior of bird flocking and fish schooling. This paper presents an efficient PSO algorithm based on Gaussian distribution and chaotic sequence (PSO-GC) to solve the reliability-redundancy optimization problems. In this context, two examples in reliability-redundancy design problems are evaluated. Simulation results demonstrate that the proposed PSO-GC is a promising optimization technique. PSO-GC performs well for the two examples of mixed-integer programming in reliability-redundancy applications considered in this paper. The solutions obtained by the PSO-GC are better than the previously best-known solutions available in the recent literature.

  20. Mixed Integer Linear Programming based machine learning approach identifies regulators of telomerase in yeast.

    Science.gov (United States)

    Poos, Alexandra M; Maicher, André; Dieckmann, Anna K; Oswald, Marcus; Eils, Roland; Kupiec, Martin; Luke, Brian; König, Rainer

    2016-06-02

    Understanding telomere length maintenance mechanisms is central in cancer biology as their dysregulation is one of the hallmarks for immortalization of cancer cells. Important for this well-balanced control is the transcriptional regulation of the telomerase genes. We integrated Mixed Integer Linear Programming models into a comparative machine learning based approach to identify regulatory interactions that best explain the discrepancy of telomerase transcript levels in yeast mutants with deleted regulators showing aberrant telomere length, when compared to mutants with normal telomere length. We uncover novel regulators of telomerase expression, several of which affect histone levels or modifications. In particular, our results point to the transcription factors Sum1, Hst1 and Srb2 as being important for the regulation of EST1 transcription, and we validated the effect of Sum1 experimentally. We compiled our machine learning method leading to a user friendly package for R which can straightforwardly be applied to similar problems integrating gene regulator binding information and expression profiles of samples of e.g. different phenotypes, diseases or treatments. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

  1. A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

    Science.gov (United States)

    Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

    A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

  2. Extraction and characterization of artocarpus integer gum as pharmaceutical excipient.

    Science.gov (United States)

    Farooq, Uzma; Malviya, Rishabha; Sharma, Pramod Kumar

    2014-01-01

    Natural polymers are widely used as excipients in pharmaceutical formulations. They are easily available, cheap and less toxic as compared to synthetic polymers. This study involves the extraction and characterization of kathal (Artocarpus integer) gum as a pharmaceutical excipient. Water was used as a solvent for extraction of the natural polymer. Yield was calculated with an aim to evaluate the efficacy of the process. The product was screened for the presence of Micrometric properties, and swelling index, flow behavior, surface tension, and viscosity of natural polymers were calculated. Using a water based extraction method, the yield of gum was found to be 2.85%. Various parameters such as flow behavior, organoleptic properties, surface tension, viscosity, loss on drying, ash value and swelling index together with microscopic studies of particles were done to characterize the extracted gum. The result showed that extracted kathal gum exhibited excellent flow properties. The gum was investigated for purity by carrying out chemical tests for different phytochemical constituents and only carbohydrates were found to be present. It had a good swelling index (13 ± 1). The pH and surface tension of the 1% gum solution were found to be 6 ± 0.5 and 0.0627 J/m2, respectively. The ash values such as total ash, acid insoluble ash, and water soluble ash were found to be 18.9%, 0.67% and 4% respectively. Loss on drying was 6.61%. The extracted gum was soluble in warm water and insoluble in organic solvents. The scanning electron micrograph (SEM) revealed rough and irregular particles of the isolated polymer. The results of the evaluated properties showed that kathal-derived gum has acceptable pH and organoleptic properties and can be used as a pharmaceutical excipient to formulate solid oral dosage forms.

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

    Directory of Open Access Journals (Sweden)

    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.

  4. Tables of the 3-j, 6-j, Fsub(k)-, Asub(k)-, Rsub(k)-, and Asub(kk)-coefficients for angular correlation measurements involving half integer spins up to 15/2 and transitions up to L = 3

    International Nuclear Information System (INIS)

    Gueven, H.H.; Kardon, B.; Seyfarth, H.

    1975-07-01

    Theoretical directional correlation coefficiencts are given as 3-j, 6-j, Fsub(k), Asub(k), Rsub(k) and Asub(kk) coefficients for half integer spins up to 15/2 and for transitions up to L = 3. (WL) [de

  5. Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization

    Directory of Open Access Journals (Sweden)

    Viska Dewi Fawzy

    2017-12-01

    Full Text Available The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research is Pandanarang Rusunawa. Rusunawa Pandanarang is one of the vertical housing in Cilacap that is facing deterioration issue and needs good maintenance management. This study aims at insetting priority and optimizing maintenance plan due to limited funds (limited budget and the amount of damage that must be repaired.This study uses one of the optimization methods of Dynamic Programing on the application of Integer 1/0 Knapsack Problem, to determine an schedule the maintenance activities. The Criteria that are used such as: the level of building components damage and the level of occupants participation. In the first criterion, the benefit (p is the percentage of damage that is fixed with the cost (w. While on the second criterion, the benefit (p is the percentage of occupant participation rate on the maintenance activities with the cost (w. For the budget of Rp 125.000.000, 00, it was obtained from the simulation that the value of the optimum solution on the first criterion at the 7th stage of 71.88% with total cost Rp 106.000.000, 00. At the second criterion, the value of the optimum solution at the 7th stage of 89.29% with total cost Rp 124.000.000, 00.

  6. Influence of non-integer-order derivatives on unsteady unidirectional motions of an Oldroyd-B fluid with generalized boundary conditions

    Science.gov (United States)

    Zafar, A. A.; Riaz, M. B.; Shah, N. A.; Imran, M. A.

    2018-03-01

    The objective of this article is to study some unsteady Couette flows of an Oldroyd-B fluid with non-integer derivatives. The fluid fills an annular region of two infinite co-axial circular cylinders. Flows are due to the motion of the outer cylinder, that rotates about its axis with an arbitrary time-dependent velocity while the inner cylinder is held fixed. Closed form solutions of dimensionless velocity field and tangential tension are obtained by means of the finite Hankel transform and the theory of Laplace transform for fractional calculus. Several results in the literature including the rotational flows through an infinite cylinder can be obtained as limiting cases of our general solutions. Finally, the control of the fractional framework on the dynamics of fluid is analyzed by numerical simulations and graphical illustrations.

  7. Low Cost Design of a Hybrid Architecture of Integer Inverse DCT for H.264, VC-1, AVS, and HEVC

    Directory of Open Access Journals (Sweden)

    Muhammad Martuza

    2012-01-01

    Full Text Available The paper presents a unified hybrid architecture to compute the 8×8 integer inverse discrete cosine transform (IDCT of multiple modern video codecs—AVS, H.264/AVC, VC-1, and HEVC (under development. Based on the symmetric structure of the matrices and the similarity in matrix operation, we develop a generalized “decompose and share” algorithm to compute the 8×8 IDCT. The algorithm is later applied to four video standards. The hardware-share approach ensures the maximum circuit reuse during the computation. The architecture is designed with only adders and shifters to reduce the hardware cost significantly. The design is implemented on FPGA and later synthesized in CMOS 0.18 um technology. The results meet the requirements of advanced video coding applications.

  8. A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: I. Robust Linear Optimization and Robust Mixed Integer Linear Optimization

    Science.gov (United States)

    Li, Zukui; Ding, Ran; Floudas, Christodoulos A.

    2011-01-01

    Robust counterpart optimization techniques for linear optimization and mixed integer linear optimization problems are studied in this paper. Different uncertainty sets, including those studied in literature (i.e., interval set; combined interval and ellipsoidal set; combined interval and polyhedral set) and new ones (i.e., adjustable box; pure ellipsoidal; pure polyhedral; combined interval, ellipsoidal, and polyhedral set) are studied in this work and their geometric relationship is discussed. For uncertainty in the left hand side, right hand side, and objective function of the optimization problems, robust counterpart optimization formulations induced by those different uncertainty sets are derived. Numerical studies are performed to compare the solutions of the robust counterpart optimization models and applications in refinery production planning and batch process scheduling problem are presented. PMID:21935263

  9. Superluminal tunneling of a relativistic half-integer spin particle through a potential barrier

    Directory of Open Access Journals (Sweden)

    Nanni Luca

    2017-11-01

    Full Text Available This paper investigates the problem of a relativistic Dirac half-integer spin free particle tunneling through a rectangular quantum-mechanical barrier. If the energy difference between the barrier and the particle is positive, and the barrier width is large enough, there is proof that the tunneling may be superluminal. For first spinor components of particle and antiparticle states, the tunneling is always superluminal regardless the barrier width. Conversely, the second spinor components of particle and antiparticle states may be either subluminal or superluminal depending on the barrier width. These results derive from studying the tunneling time in terms of phase time. For the first spinor components of particle and antiparticle states, it is always negative while for the second spinor components of particle and antiparticle states, it is always positive, whatever the height and width of the barrier. In total, the tunneling time always remains positive for particle states while it becomes negative for antiparticle ones. Furthermore, the phase time tends to zero, increasing the potential barrier both for particle and antiparticle states. This agrees with the interpretation of quantum tunneling that the Heisenberg uncertainty principle provides. This study’s results are innovative with respect to those available in the literature. Moreover, they show that the superluminal behaviour of particles occurs in those processes with high-energy confinement.

  10. Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Renata Melo e Silva de Oliveira

    2015-03-01

    Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests.  With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs.  The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.

  11. Integer-linear-programing optimization in scalable video multicast with adaptive modulation and coding in wireless networks.

    Science.gov (United States)

    Lee, Dongyul; Lee, Chaewoo

    2014-01-01

    The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm.

  12. Integer-Linear-Programing Optimization in Scalable Video Multicast with Adaptive Modulation and Coding in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Dongyul Lee

    2014-01-01

    Full Text Available The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC with adaptive modulation and coding (AMC provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm.

  13. Minimising negative externalities cost using 0-1 mixed integer linear programming model in e-commerce environment

    Directory of Open Access Journals (Sweden)

    Akyene Tetteh

    2017-04-01

    Full Text Available Background: Although the Internet boosts business profitability, without certain activities like efficient transportation, scheduling, products ordered via the Internet may reach their destination very late. The environmental problems (vehicle part disposal, carbon monoxide [CO], nitrogen oxide [NOx] and hydrocarbons [HC] associated with transportation are mostly not accounted for by industries. Objectives: The main objective of this article is to minimising negative externalities cost in e-commerce environments. Method: The 0-1 mixed integer linear programming (0-1 MILP model was used to model the problem statement. The result was further analysed using the externality percentage impact factor (EPIF. Results: The simulation results suggest that (1 The mode of ordering refined petroleum products does not impact on the cost of distribution, (2 an increase in private cost is directly proportional to the externality cost, (3 externality cost is largely controlled by the government and number of vehicles used in the distribution and this is in no way influenced by the mode of request (i.e. Internet or otherwise and (4 externality cost may be reduce by using more ecofriendly fuel system.

  14. Modeling Polio Data Using the First Order Non-Negative Integer-Valued Autoregressive, INAR(1), Model

    Science.gov (United States)

    Vazifedan, Turaj; Shitan, Mahendran

    Time series data may consists of counts, such as the number of road accidents, the number of patients in a certain hospital, the number of customers waiting for service at a certain time and etc. When the value of the observations are large it is usual to use Gaussian Autoregressive Moving Average (ARMA) process to model the time series. However if the observed counts are small, it is not appropriate to use ARMA process to model the observed phenomenon. In such cases we need to model the time series data by using Non-Negative Integer valued Autoregressive (INAR) process. The modeling of counts data is based on the binomial thinning operator. In this paper we illustrate the modeling of counts data using the monthly number of Poliomyelitis data in United States between January 1970 until December 1983. We applied the AR(1), Poisson regression model and INAR(1) model and the suitability of these models were assessed by using the Index of Agreement(I.A.). We found that INAR(1) model is more appropriate in the sense it had a better I.A. and it is natural since the data are counts.

  15. A mixed integer linear programming model applied in barge planning for Omya

    Directory of Open Access Journals (Sweden)

    David Bredström

    2015-12-01

    Full Text Available This article presents a mathematical model for barge transport planning on the river Rhine, which is part of a decision support system (DSS recently taken into use by the Swiss company Omya. The system is operated by Omya’s regional office in Cologne, Germany, responsible for distribution planning at the regional distribution center (RDC in Moerdijk, the Netherlands. The distribution planning is a vital part of supply chain management of Omya’s production of Norwegian high quality calcium carbonate slurry, supplied to European paper manufacturers. The DSS operates within a vendor managed inventory (VMI setting, where the customer inventories are monitored by Omya, who decides upon the refilling days and quantities delivered by barges. The barge planning problem falls into the category of inventory routing problems (IRP and is further characterized with multiple products, heterogeneous fleet with availability restrictions (the fleet is owned by third party, vehicle compartments, dependency of barge capacity on water-level, multiple customer visits, bounded customer inventories and rolling planning horizon. There are additional modelling details which had to be considered to make it possible to employ the model in practice at a sufficient level of detail. To the best of our knowledge, we have not been able to find similar models covering all these aspects in barge planning. This article presents the developed mixed-integer programming model and discusses practical experience with its solution. Briefly, it also puts the model into the context of the entire business case of value chain optimization in Omya.

  16. Obstacle avoidance handling and mixed integer predictive control for space robots

    Science.gov (United States)

    Zong, Lijun; Luo, Jianjun; Wang, Mingming; Yuan, Jianping

    2018-04-01

    This paper presents a novel obstacle avoidance constraint and a mixed integer predictive control (MIPC) method for space robots avoiding obstacles and satisfying physical limits during performing tasks. Firstly, a novel kind of obstacle avoidance constraint of space robots, which needs the assumption that the manipulator links and the obstacles can be represented by convex bodies, is proposed by limiting the relative velocity between two closest points which are on the manipulator and the obstacle, respectively. Furthermore, the logical variables are introduced into the obstacle avoidance constraint, which have realized the constraint form is automatically changed to satisfy different obstacle avoidance requirements in different distance intervals between the space robot and the obstacle. Afterwards, the obstacle avoidance constraint and other system physical limits, such as joint angle ranges, the amplitude boundaries of joint velocities and joint torques, are described as inequality constraints of a quadratic programming (QP) problem by using the model predictive control (MPC) method. To guarantee the feasibility of the obtained multi-constraint QP problem, the constraints are treated as soft constraints and assigned levels of priority based on the propositional logic theory, which can realize that the constraints with lower priorities are always firstly violated to recover the feasibility of the QP problem. Since the logical variables have been introduced, the optimization problem including obstacle avoidance and system physical limits as prioritized inequality constraints is termed as MIPC method of space robots, and its computational complexity as well as possible strategies for reducing calculation amount are analyzed. Simulations of the space robot unfolding its manipulator and tracking the end-effector's desired trajectories with the existence of obstacles and physical limits are presented to demonstrate the effectiveness of the proposed obstacle avoidance

  17. Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study.

    Science.gov (United States)

    Catanzaro, Daniele; Shackney, Stanley E; Schaffer, Alejandro A; Schwartz, Russell

    2016-01-01

    Ductal Carcinoma In Situ (DCIS) is a precursor lesion of Invasive Ductal Carcinoma (IDC) of the breast. Investigating its temporal progression could provide fundamental new insights for the development of better diagnostic tools to predict which cases of DCIS will progress to IDC. We investigate the problem of reconstructing a plausible progression from single-cell sampled data of an individual with synchronous DCIS and IDC. Specifically, by using a number of assumptions derived from the observation of cellular atypia occurring in IDC, we design a possible predictive model using integer linear programming (ILP). Computational experiments carried out on a preexisting data set of 13 patients with simultaneous DCIS and IDC show that the corresponding predicted progression models are classifiable into categories having specific evolutionary characteristics. The approach provides new insights into mechanisms of clonal progression in breast cancers and helps illustrate the power of the ILP approach for similar problems in reconstructing tumor evolution scenarios under complex sets of constraints.

  18. Industrial waste recycling strategies optimization problem: mixed integer programming model and heuristics

    Science.gov (United States)

    Tang, Jiafu; Liu, Yang; Fung, Richard; Luo, Xinggang

    2008-12-01

    Manufacturers have a legal accountability to deal with industrial waste generated from their production processes in order to avoid pollution. Along with advances in waste recovery techniques, manufacturers may adopt various recycling strategies in dealing with industrial waste. With reuse strategies and technologies, byproducts or wastes will be returned to production processes in the iron and steel industry, and some waste can be recycled back to base material for reuse in other industries. This article focuses on a recovery strategies optimization problem for a typical class of industrial waste recycling process in order to maximize profit. There are multiple strategies for waste recycling available to generate multiple byproducts; these byproducts are then further transformed into several types of chemical products via different production patterns. A mixed integer programming model is developed to determine which recycling strategy and which production pattern should be selected with what quantity of chemical products corresponding to this strategy and pattern in order to yield maximum marginal profits. The sales profits of chemical products and the set-up costs of these strategies, patterns and operation costs of production are considered. A simulated annealing (SA) based heuristic algorithm is developed to solve the problem. Finally, an experiment is designed to verify the effectiveness and feasibility of the proposed method. By comparing a single strategy to multiple strategies in an example, it is shown that the total sales profit of chemical products can be increased by around 25% through the simultaneous use of multiple strategies. This illustrates the superiority of combinatorial multiple strategies. Furthermore, the effects of the model parameters on profit are discussed to help manufacturers organize their waste recycling network.

  19. Copenhagen's single system premise prevents a unified view of integer and fractional quantum hall effect

    Science.gov (United States)

    Post, Evert Jan

    1999-05-01

    This essay presents conclusive evidence of the impermissibility of Copenhagen's single system interpretation of the Schroedinger process. The latter needs to be viewed as a tool exclusively describing phase and orientation randomized ensembles and is not be used for isolated single systems. Asymptotic closeness of single system and ensemble behavior and the rare nature of true single system manifestations have prevented a definitive identification of this Copenhagen deficiency over the past three quarter century. Quantum uncertainty so becomes a basic trade mark of phase and orientation disordered ensembles. The ensuing void of usable single system tools opens a new inquiry for tools without statistical connotations. Three, in part already known, period integrals here identified as flux, charge and action counters emerge as diffeo-4 invariant tools fully compatible with the demands of the general theory of relativity. The discovery of the quantum Hall effect has been instrumental in forcing a distinction between ensemble disorder as in the normal Hall effect versus ensemble order in the plateau states. Since the order of the latter permits a view of the plateau states as a macro- or meso-scopic single system, the period integral description applies, yielding a straightforward unified description of integer and fractional quantum Hall effects.

  20. Electrostatic and Quantum Transport Simulations of Quantum Point Contacts in the Integer Quantum Hall Regime

    Science.gov (United States)

    Sahasrabudhe, Harshad; Fallahi, Saeed; Nakamura, James; Povolotskyi, Michael; Novakovic, Bozidar; Rahman, Rajib; Manfra, Michael; Klimeck, Gerhard

    Quantum Point Contacts (QPCs) are extensively used in semiconductor devices for charge sensing, tunneling and interference experiments. Fabry-Pérot interferometers containing 2 QPCs have applications in quantum computing, in which electrons/quasi-particles undergo interference due to back-scattering from the QPCs. Such experiments have turned out to be difficult because of the complex structure of edge states near the QPC boundary. We present realistic simulations of the edge states in QPCs based on GaAs/AlGaAs heterostructures, which can be used to predict conductance and edge state velocities. Conduction band profile is obtained by solving decoupled effective mass Schrödinger and Poisson equations self-consistently on a finite element mesh of a realistic geometry. In the integer quantum Hall regime, we obtain compressible and in-compressible regions near the edges. We then use the recursive Green`s function algorithm to solve Schrödinger equation with open boundary conditions for calculating transmission and local current density in the QPCs. Impurities are treated by inserting bumps in the potential with a Gaussian distribution. We compare observables with experiments for fitting some adjustable parameters. The authors would like to thank Purdue Research Foundation and Purdue Center for Topological Materials for their support.

  1. Spillways Scheduling for Flood Control of Three Gorges Reservoir Using Mixed Integer Linear Programming Model

    Directory of Open Access Journals (Sweden)

    Maoyuan Feng

    2014-01-01

    Full Text Available This study proposes a mixed integer linear programming (MILP model to optimize the spillways scheduling for reservoir flood control. Unlike the conventional reservoir operation model, the proposed MILP model specifies the spillways status (including the number of spillways to be open and the degree of the spillway opened instead of reservoir release, since the release is actually controlled by using the spillway. The piecewise linear approximation is used to formulate the relationship between the reservoir storage and water release for a spillway, which should be open/closed with a status depicted by a binary variable. The control order and symmetry rules of spillways are described and incorporated into the constraints for meeting the practical demand. Thus, a MILP model is set up to minimize the maximum reservoir storage. The General Algebraic Modeling System (GAMS and IBM ILOG CPLEX Optimization Studio (CPLEX software are used to find the optimal solution for the proposed MILP model. The China’s Three Gorges Reservoir, whose spillways are of five types with the total number of 80, is selected as the case study. It is shown that the proposed model decreases the flood risk compared with the conventional operation and makes the operation more practical by specifying the spillways status directly.

  2. Mixed integer nonlinear programming model of wireless pricing scheme with QoS attribute of bandwidth and end-to-end delay

    Science.gov (United States)

    Irmeilyana, Puspita, Fitri Maya; Indrawati

    2016-02-01

    The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.

  3. Poland wants more EU cooperation with Baltic States / Arturas Racas

    Index Scriptorium Estoniae

    Racas, Arturas

    2006-01-01

    Balti riikide ja Poola presidendid kohtusid Vilniuses. Teemadeks olid: NATO, Euroopa Liidu, Gruusia küsimused, koostöö tuumaelektrijaama rajamisel, vastastikuste suhete tihendamine. Vt. samas lk. 12: Presidents bond over ambitious communique. Läti, Leedu, Eesti ja Poola presidendid kirjutasid alla kommunikeele regionaalse koostöö tugevdamiseks, rõhuga infrastruktuuri ja energia küsimustel. Vabariigi President töövisiidil Leedu Vabariiki 6.10.2006

  4. Poland wants more EU cooperation with Baltic States / Arturas Racas

    Index Scriptorium Estoniae

    Racas, Arturas

    2006-01-01

    Balti riikide ja Poola presidendid kohtusid Vilniuses. Teemadeks oli: NATO, EL, Gruusia küsimused, koostöö tuumaelektrijaama rajamisel, vastastikuste suhete tihendamine. Vt. samas lk. 12: Presidents bond over ambitious communique. Läti, Leedu, Eesti ja Poola presidendid kirjutasid alla kommunikeele regionaalse koostöö tugevdamiseks, rõhuga infrastruktuuri ja energia küsimustel

  5. An integer batch scheduling model considering learning, forgetting, and deterioration effects for a single machine to minimize total inventory holding cost

    Science.gov (United States)

    Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

    2018-03-01

    This research deals with a single machine batch scheduling model considering the influenced of learning, forgetting, and machine deterioration effects. The objective of the model is to minimize total inventory holding cost, and the decision variables are the number of batches (N), batch sizes (Q[i], i = 1, 2, .., N) and the sequence of processing the resulting batches. The parts to be processed are received at the right time and the right quantities, and all completed parts must be delivered at a common due date. We propose a heuristic procedure based on the Lagrange method to solve the problem. The effectiveness of the procedure is evaluated by comparing the resulting solution to the optimal solution obtained from the enumeration procedure using the integer composition technique and shows that the average effectiveness is 94%.

  6. Optical spectroscopy of GaAs in the extreme quantum limit: Integer and fractional quantum Hall effect, and onset of the electron solid

    Energy Technology Data Exchange (ETDEWEB)

    Clark, R.G.; Ford, R.A.; Haynes, S.R.; Ryan, J.F.; Turberfield, A.J.; Wright, P.A. (Clarendon Lab., Univ. of Oxford (UK)); Williams, F.I.B.; Deville, G.; Glattli, D.C. (CEN de Saclay, 91 - Gif-sur-Yvette (France)); Mallett, J.R.; Oswald, P.M.W. (Clarendon Lab., Univ. of Oxford (UK) Katholieke Univ. Leuven (Belgium)); Burgt, M. van der; Herlach, F. (Katholieke Univ. Leuven (Belgium)); Foxon, C.T.; Harris, J.J. (Philips Research Labs., Redhill (UK))

    1991-02-01

    Our recent optical detection of the integer and fractional quantum Hall effects in GaAs, by intrinsic band-gap photoluminescence at dilution refrigerator temperatures, is reviewed. This work has been extended to the extreme quantum limit where a photoluminescence peak develops close to Landau level filling factor {nu}=1/5 which correlates both with the onset of threshold behaviour in current-voltage characteristics of the two-dimensional electron system and a resonant radio-frequency absorption; the latter are quantitatively accounted for by a model of crystalline electronic structure broken up into domains. Preliminary mK transport experiments in intense, pulsed magnetic fields are also described, which establish a basis to access the electron solid phase transition in a hitherto unattainable region of the (B,T) plane. (orig.).

  7. Non extensive statistics and entropic gravity in a non-integer dimensional space

    International Nuclear Information System (INIS)

    Abreu, Everton M.C.; Ananias Neto, Jorge; Godinho, Cresus F.L.

    2013-01-01

    Full text: The idea that gravity can be originated from thermodynamics features has begun with the discovering that black hole physics is connected to the thermodynamics laws. These concepts were strongly boosted after Jacobson's work, where the Einstein equations were obtained from general thermodynamics approaches. In a recent work, Padmanabhan obtained an interpretation of gravity as an equipartition law. In Verlinde's thermo gravitational formalism, the temperature and the acceleration are connected via Unruh effect. At the same time, he combined the holographic principle with an equipartition law, where the number of bits is proportional to the area of the holographic surface. Bits were used to define the microscopic degrees of freedom. With these ingredients, the entropic force combined with the holographic principle and the equipartition law originated the Newton's law of gravitation. The possible interpretation of Verlinde's result is that gravity is not an underlying concept, but an emergent one. It originates from the statistical behavior of the holographic screen microscopic degrees of freedom. Following these ideas, the current literature has grown in an accelerated production from Coulomb force and symmetry considerations of entropic force to cosmology and loop quantum. In this work we introduced the Newton's constant in a fractal space as a function of the non extensive one. With this result we established a relation between the Tsallis non extensive parameter and the dimension of this fractal space. Using Verlinde's formalism we used these fractal ideas combined with the concept of entropic gravity to calculate the number of bits of an holographic surface in this non-integer dimensional space, a fractal holographic screen. We introduced a fundamental length, a Planck-like length, into this space as a function of this fractal holographic screen radius. Finally, we consider superior dimensions in this analysis. (author)

  8. The Capability Portfolio Analysis Tool (CPAT): A Mixed Integer Linear Programming Formulation for Fleet Modernization Analysis (Version 2.0.2).

    Energy Technology Data Exchange (ETDEWEB)

    Waddell, Lucas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Muldoon, Frank [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Henry, Stephen Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Hoffman, Matthew John [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zwerneman, April Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Backlund, Peter [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Melander, Darryl J. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lawton, Craig R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rice, Roy Eugene [Teledyne Brown Engineering, Huntsville, AL (United States)

    2017-09-01

    In order to effectively plan the management and modernization of their large and diverse fleets of vehicles, Program Executive Office Ground Combat Systems (PEO GCS) and Program Executive Office Combat Support and Combat Service Support (PEO CS&CSS) commis- sioned the development of a large-scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This paper contains a thor- ough documentation of the terminology, parameters, variables, and constraints that comprise the fleet management mixed integer linear programming (MILP) mathematical formulation. This paper, which is an update to the original CPAT formulation document published in 2015 (SAND2015-3487), covers the formulation of important new CPAT features.

  9. A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

    Science.gov (United States)

    Röhl, Annika; Bockmayr, Alexander

    2017-01-03

    Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

  10. Robust automated mass spectra interpretation and chemical formula calculation using mixed integer linear programming.

    Science.gov (United States)

    Baran, Richard; Northen, Trent R

    2013-10-15

    Untargeted metabolite profiling using liquid chromatography and mass spectrometry coupled via electrospray ionization is a powerful tool for the discovery of novel natural products, metabolic capabilities, and biomarkers. However, the elucidation of the identities of uncharacterized metabolites from spectral features remains challenging. A critical step in the metabolite identification workflow is the assignment of redundant spectral features (adducts, fragments, multimers) and calculation of the underlying chemical formula. Inspection of the data by experts using computational tools solving partial problems (e.g., chemical formula calculation for individual ions) can be performed to disambiguate alternative solutions and provide reliable results. However, manual curation is tedious and not readily scalable or standardized. Here we describe an automated procedure for the robust automated mass spectra interpretation and chemical formula calculation using mixed integer linear programming optimization (RAMSI). Chemical rules among related ions are expressed as linear constraints and both the spectra interpretation and chemical formula calculation are performed in a single optimization step. This approach is unbiased in that it does not require predefined sets of neutral losses and positive and negative polarity spectra can be combined in a single optimization. The procedure was evaluated with 30 experimental mass spectra and was found to effectively identify the protonated or deprotonated molecule ([M + H](+) or [M - H](-)) while being robust to the presence of background ions. RAMSI provides a much-needed standardized tool for interpreting ions for subsequent identification in untargeted metabolomics workflows.

  11. Proposing a New Approach for Supplier Selection Based on Kraljic’s Model Using FMEA and Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    S. Mohammad Arabzad

    2012-06-01

    Full Text Available In recent years, numerous methods have been proposed to deal with supplier evaluation and selection problem, but a point which has been usually neglected by researchers is the role of purchasing items. The aim of this paper is to propose an integrated approach to select suppliers and allocate orders on the basis of the nature of the purchasing items which means that this issue plays an important role in supplier selection and order allocation. Therefore, items are first categorized according to the Kraljic’s model by the use of FMEA technique. Then, suppliers are categorized and evaluated in four phases with respect to different types of purchasing items (Strategic, Bottleneck, Leverage and Routine. Finally, an integer linear programming is utilized to allocate purchasing orders to suppliers. Furthermore, an empirical example is conducted to illustrate the stage of proposed approach. Results imply that ranking of suppliers and allocation of purchasing items based on the nature of purchasing items will create more capabilities in managing purchasing items and suppliers .

  12. Reverse engineering of logic-based differential equation models using a mixed-integer dynamic optimization approach.

    Science.gov (United States)

    Henriques, David; Rocha, Miguel; Saez-Rodriguez, Julio; Banga, Julio R

    2015-09-15

    Systems biology models can be used to test new hypotheses formulated on the basis of previous knowledge or new experimental data, contradictory with a previously existing model. New hypotheses often come in the shape of a set of possible regulatory mechanisms. This search is usually not limited to finding a single regulation link, but rather a combination of links subject to great uncertainty or no information about the kinetic parameters. In this work, we combine a logic-based formalism, to describe all the possible regulatory structures for a given dynamic model of a pathway, with mixed-integer dynamic optimization (MIDO). This framework aims to simultaneously identify the regulatory structure (represented by binary parameters) and the real-valued parameters that are consistent with the available experimental data, resulting in a logic-based differential equation model. The alternative to this would be to perform real-valued parameter estimation for each possible model structure, which is not tractable for models of the size presented in this work. The performance of the method presented here is illustrated with several case studies: a synthetic pathway problem of signaling regulation, a two-component signal transduction pathway in bacterial homeostasis, and a signaling network in liver cancer cells. Supplementary data are available at Bioinformatics online. julio@iim.csic.es or saezrodriguez@ebi.ac.uk. © The Author 2015. Published by Oxford University Press.

  13. Uses and updating of the Benders method in the integer-mixed programming in the planning of the electric power systems expansion; Usos y actualizacion del metodo de Benders en la programacion entera-mixta y en la planeacion de la expansion de los sistemas electricos de potencia

    Energy Technology Data Exchange (ETDEWEB)

    De la Torre Vega, Eli

    1997-04-01

    In the first chapter the deduction of the Benders cuts are presented, departing from the properties of duality. Also the properties of the Benders cuts are presented, as well as the initial algorithm of Benders to solve any problem of lineal integer-mixed programming are presented. In the second chapter, of the planning of the expansion of means of generation and transmission in an electric power system is presented and the different structures of the mathematical programming it gives rise to and how the method of Benders can be adapted to these. In the third chapter the theoretical contributions of this work are presented: a) How to initialize the master problem to take advantage of the acquired experience after having solved a similar problem, so that it can be solved more efficiently, the succession of integer-mixed problems of linear programming that arise when solving the problem of the planning of the expansion of generation and transmission means in an electric power system. b) How to generate a master problem whose continuous optimal solution corresponds to the optimal continuous one of the integer-mixed problem, so that the search of integer solutions is made in the vicinity of the optimum continuous. c) How to generate an integer solution, close to the optimum continuous of the integer-mixed problem, that has high probability of being feasible, and that is perhaps the optimal integer solution, in a smaller time than that required to solve it in exact form. In addition, other ideas are presented that can be incorporated to the Benders method. In order to show the effectiveness of the proposed ideas, in chapter 4 the results obtained when solving several problems are presented using: 1. The updated Benders method, 2. The branch and bound method, 3. The update of Benders when adding restrictions and 4. The update of Benders when considered as integer each time to more variables. Finally a summary is made of the achievements, of the conclusions obtained and

  14. A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm.

    Science.gov (United States)

    El-Qulity, Said Ali; Mohamed, Ali Wagdy

    2016-01-01

    This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.

  15. About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography

    Science.gov (United States)

    Ogorodnikov, Yuri; Khachay, Michael; Pljonkin, Anton

    2018-04-01

    We describe the possibility of employing the special case of the 3-SAT problem stemming from the well known integer factorization problem for the quantum cryptography. It is known, that for every instance of our 3-SAT setting the given 3-CNF is satisfiable by a unique truth assignment, and the goal is to find this assignment. Since the complexity status of the factorization problem is still undefined, development of approximation algorithms and heuristics adopts interest of numerous researchers. One of promising approaches to construction of approximation techniques is based on real-valued relaxation of the given 3-CNF followed by minimizing of the appropriate differentiable loss function, and subsequent rounding of the fractional minimizer obtained. Actually, algorithms developed this way differ by the rounding scheme applied on their final stage. We propose a new rounding scheme based on Bayesian learning. The article shows that the proposed method can be used to determine the security in quantum key distribution systems. In the quantum distribution the Shannon rules is applied and the factorization problem is paramount when decrypting secret keys.

  16. An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

    Science.gov (United States)

    Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

    2016-02-01

    In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.

  17. An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

    International Nuclear Information System (INIS)

    Yusriski, R; Sukoyo; Samadhi, T M A A; Halim, A H

    2016-01-01

    In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%. (paper)

  18. MTV wins first hearing against Catholic Church over "Popetown" / Arturas Racas

    Index Scriptorium Estoniae

    Racas, Arturas

    2007-01-01

    Vilniuse Ringkonnakohtu lahendist Leedu Katoliku Kiriku ja MTV Leedu vahel. Põhjuseks skandaalse multifilmi "Popetown'i" näitamine Leedu televisioonis, milles kujutati solvavalt katoliku kiriku telgitaguseid

  19. A 65nm CMOS low-power MedRadio-band integer-N cascaded phase-locked loop for implantable medical systems.

    Science.gov (United States)

    Wang, Yi-Xiao; Chen, Wei-Ming; Wu, Chung-Yu

    2014-01-01

    This paper presents a low-power MedRadio-band integer-N phase-locked Loop (PLL) system which is composed of two charge-pump PLLs cascade connected. The PLL provides the operation clock and local carrier signals for an implantable medical electronic system. In addition, to avoid the off-chip crystal oscillator, the 13.56 MHz Industrial, Scientific and Medical (ISM) band signal from the wireless power transmission system is adopted as the input reference signal for the PLL. Ring-based voltage controlled oscillators (VCOs) with current control units are adopted to reduce chip area and power dissipation. The proposed cascaded PLL system is designed and implemented in TSMC 65-nm CMOS technology. The measured jitter for 216.96 MHz signal is 12.23 ps and the phase noise is -65.9 dBc/Hz at 100 kHz frequency offset under 402.926 MHz carrier frequency. The measured power dissipations are 66 μW in the first PLL and 195 μW in the whole system under 1-V supply voltage. The chip area is 0.1088 mm(2) and no off-chip component is required which is suitable for the integration of the implantable medical electronic system.

  20. Greenhouse gas emissions control in integrated municipal solid waste management through mixed integer bilevel decision-making

    Energy Technology Data Exchange (ETDEWEB)

    He, Li, E-mail: li.he@iseis.org [MOE Key Laboratory of Regional Energy Systems Optimization, S and C Academy of Energy and Environmental Research, North China Electric Power University, Beijing 102206 (China); Huang, G.H.; Lu, Hongwei [MOE Key Laboratory of Regional Energy Systems Optimization, S and C Academy of Energy and Environmental Research, North China Electric Power University, Beijing 102206 (China)

    2011-10-15

    Highlights: {yields} We used bilevel analysis to treat two objectives at different levels. {yields} The model can identify allocation schemes for waste flows. {yields} The model can support waste timing, sizing, and siting for facility expansions. {yields} The model can estimate minimized total management cost and GHG emissions. - Abstract: Recent studies indicated that municipal solid waste (MSW) is a major contributor to global warming due to extensive emissions of greenhouse gases (GHGs). However, most of them focused on investigating impacts of MSW on GHG emission amounts. This study presents two mixed integer bilevel decision-making models for integrated municipal solid waste management and GHG emissions control: MGU-MCL and MCU-MGL. The MGU-MCL model represents a top-down decision process, with the environmental sectors at the national level dominating the upper-level objective and the waste management sectors at the municipal level providing the lower-level objective. The MCU-MGL model implies a bottom-up decision process where municipality plays a leading role. Results from the models indicate that: the top-down decisions would reduce metric tonne carbon emissions (MTCEs) by about 59% yet increase about 8% of the total management cost; the bottom-up decisions would reduce MTCE emissions by about 13% but increase the total management cost very slightly; on-site monitoring and downscaled laboratory experiments are still required for reducing uncertainty in GHG emission rate from the landfill facility.

  1. Sixth-grade students' reasoning on the order relation of integers as influenced by prior experience: an inferentialist analysis

    Science.gov (United States)

    Schindler, Maike; Hußmann, Stephan; Nilsson, Per; Bakker, Arthur

    2017-12-01

    Negative numbers are among the first formalizations students encounter in their mathematics learning that clearly differ from out-of-school experiences. What has not sufficiently been addressed in previous research is the question of how students draw on their prior experiences when reasoning on negative numbers and how they infer from these experiences. This article presents results from an empirical study investigating sixth-grade students' reasoning and inferring from school-based and out-of-school experiences. In particular, it addresses the order relation, which deals with students' very first encounters with negative numbers. Here, students can reason in different ways, depending on the experiences they draw on. We study how students reason before a lesson series and how their reasoning is influenced through this lesson series where the number line and the context debts-and-assets are predominant. For grasping the reasoning's inferential and social nature and conducting in-depth analyses of two students' reasoning, we use an epistemological framework that is based on the philosophical theory of inferentialism. The results illustrate how the students infer their reasoning from out-of-school and from school-based experiences both before and after the lesson series. They reveal interesting phenomena not previously analyzed in the research on the order relation for integers.

  2. Energy-Efficient Wide Datapath Integer Arithmetic Logic Units Using Superconductor Logic

    Science.gov (United States)

    Ayala, Christopher Lawrence

    Complementary Metal-Oxide-Semiconductor (CMOS) technology is currently the most widely used integrated circuit technology today. As CMOS approaches the physical limitations of scaling, it is unclear whether or not it can provide long-term support for niche areas such as high-performance computing and telecommunication infrastructure, particularly with the emergence of cloud computing. Alternatively, superconductor technologies based on Josephson junction (JJ) switching elements such as Rapid Single Flux Quantum (RSFQ) logic and especially its new variant, Energy-Efficient Rapid Single Flux Quantum (ERSFQ) logic have the capability to provide an ultra-high-speed, low power platform for digital systems. The objective of this research is to design and evaluate energy-efficient, high-speed 32-bit integer Arithmetic Logic Units (ALUs) implemented using RSFQ and ERSFQ logic as the first steps towards achieving practical Very-Large-Scale-Integration (VLSI) complexity in digital superconductor electronics. First, a tunable VHDL superconductor cell library is created to provide a mechanism to conduct design exploration and evaluation of superconductor digital circuits from the perspectives of functionality, complexity, performance, and energy-efficiency. Second, hybrid wave-pipelining techniques developed earlier for wide datapath RSFQ designs have been used for efficient arithmetic and logic circuit implementations. To develop the core foundation of the ALU, the ripple-carry adder and the Kogge-Stone parallel prefix carry look-ahead adder are studied as representative candidates on opposite ends of the design spectrum. By combining the high-performance features of the Kogge-Stone structure and the low complexity of the ripple-carry adder, a 32-bit asynchronous wave-pipelined hybrid sparse-tree ALU has been designed and evaluated using the VHDL cell library tuned to HYPRES' gate-level characteristics. The designs and techniques from this research have been implemented using

  3. OPTIMASI CUTTING STOCK PADA INDUSTRI PEMOTONGAN KERTAS DENGAN MENGGUNAKAN METODE INTEGER LINEAR PROGRAMMING (Studi Kasus di Bhinneka – Semarang

    Directory of Open Access Journals (Sweden)

    Denny Nurkertamanda

    2012-02-01

    Full Text Available In paper cutting industry, cutting stock problem (CSP is a problem about how to cutting paper depends on quantity and specify of the demand. CSP related with dimension of pieces and rectangle which is use. In this research, we use one type dimension of rectangle and six type dimension of pieces and cutting all paper by two stage guillotine pattern. The major focus of this research is to formulate the paper cutting problem using integer linear programming. Cutting large objects into small pieces can be found in many industries. Inevitably, the cutting processes produce trim loss. On the rectangle we can put some different dimension of pieces then we can make certain pattern. The modification pattern have to produce minimum trim loss. Thus to develop optimal cutting pattern to reduce trim loss is the main purpose of this research. To reach that, we use branch and bound algorithm then continued with sensitivity analysis.  From the research, we get optimum patten of paper cutting and quantity production for that pattern. Decision for quantity production depends on average demand every day. Beside that, we also give some alternative rules of production system which can take by the company.   Keywords :   Cutting stock problem, two stage guillotine pattern, branch and bound algorithm

  4. Comparing the performance of expert user heuristics and an integer linear program in aircraft carrier deck operations.

    Science.gov (United States)

    Ryan, Jason C; Banerjee, Ashis Gopal; Cummings, Mary L; Roy, Nicholas

    2014-06-01

    Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience-based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human-automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative.

  5. Modulated Structures of Homologous Compounds In MO 3(ZnO) m( M=In, Ga; m=Integer) Described by Four-Dimensional Superspace Group

    Science.gov (United States)

    Li, Chunfei; Bando, Yoshio; Nakamura, Masaki; Onoda, Mitsuko; Kimizuka, Noboru

    1998-09-01

    The modulated structures appearing in the homologous compounds InMO3(ZnO)m(M=In, Ga;m=integer) were observed by using a high-resoultion transmission electron microscope and are described based on a four-dimensional superspace group. The electron diffraction patterns for compounds withmlarger than 6 reveal extra spots, indicating the formation of a modulated structure. The subcell structures form=odd and even numbers are assigned to be either monoclinic or orthorhombic, respectively. On the other hand, extra spots can be indexed by one-dimensional modulated structure. The possible space groups for the subcell structure areCm,C2, andC2/mform=odd numbers, while those form=even numbers areCcm21andCcmm, respectively. Then, corresponding possible superspace groups are assigned to bePC2s,PCmoverline1, andPC2/msoverline1for oddmnumbers andPCcm211overline1overline1andPCcmm1overline11for evenmnumbers. Based on the superspace group determination, a structure model for a one-dimensional modulated structure is proposed.

  6. "Good PR is like air - you don't feel it" / Arturas Jonkus

    Index Scriptorium Estoniae

    Jonkus, Arturas

    2004-01-01

    Avalike suhete spetsialist suhtekorraldusturu olukorrast Leedus, suhtekorralduse edukuse ja efektiivsuse näitajatest, kahe konkureeriva päevalehe - Respublika ning Lietuvos Rytas - vahelisest konfliktist

  7. Screening synteny blocks in pairwise genome comparisons through integer programming.

    Science.gov (United States)

    Tang, Haibao; Lyons, Eric; Pedersen, Brent; Schnable, James C; Paterson, Andrew H; Freeling, Michael

    2011-04-18

    It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor. Analyses are particularly problematic among lineages that have repeatedly experienced whole genome duplication (WGD) events. To compare multiple "subgenomes" derived from genome duplications, we need to relax the traditional requirements of "one-to-one" syntenic matchings of genomic regions in order to reflect "one-to-many" or more generally "many-to-many" matchings. However this relaxation may result in the identification of synteny blocks that are derived from ancient shared WGDs that are not of interest. For many downstream analyses, we need to eliminate weak, low scoring alignments from pairwise genome comparisons. Our goal is to objectively select subset of synteny blocks whose total scores are maximized while respecting the duplication history of the genomes in comparison. We call this "quota-based" screening of synteny blocks in order to appropriately fill a quota of syntenic relationships within one genome or between two genomes having WGD events. We have formulated the synteny block screening as an optimization problem known as "Binary Integer Programming" (BIP), which is solved using existing linear programming solvers. The computer program QUOTA-ALIGN performs this task by creating a clear objective function that maximizes the compatible set of synteny blocks under given constraints on overlaps and depths (corresponding to the duplication history in respective genomes). Such a procedure is useful for any pairwise synteny alignments, but is most useful in lineages affected by multiple WGDs, like plants or fish lineages. For example, there should be a 1:2 ploidy relationship between genome A and B if genome B had an independent WGD subsequent to the divergence of the two genomes. We show through simulations and real examples using plant genomes in the rosid superorder that the quota

  8. Mixed integer programming model for optimizing the layout of an ICU vehicle

    Directory of Open Access Journals (Sweden)

    García-Sánchez Álvaro

    2009-12-01

    Full Text Available Abstract Background This paper presents a Mixed Integer Programming (MIP model for designing the layout of the Intensive Care Units' (ICUs patient care space. In particular, this MIP model was developed for optimizing the layout for materials to be used in interventions. This work was developed within the framework of a joint project between the Madrid Technical Unverstity and the Medical Emergency Services of the Madrid Regional Government (SUMMA 112. Methods The first task was to identify the relevant information to define the characteristics of the new vehicles and, in particular, to obtain a satisfactory interior layout to locate all the necessary materials. This information was gathered from health workers related to ICUs. With that information an optimization model was developed in order to obtain a solution. From the MIP model, a first solution was obtained, consisting of a grid to locate the different materials needed for the ICUs. The outcome from the MIP model was discussed with health workers to tune the solution, and after slightly altering that solution to meet some requirements that had not been included in the mathematical model, the eventual solution was approved by the persons responsible for specifying the characteristics of the new vehicles. According to the opinion stated by the SUMMA 112's medical group responsible for improving the ambulances (the so-called "coaching group", the outcome was highly satisfactory. Indeed, the final design served as a basis to draw up the requirements of a public tender. Results As a result from solving the Optimization model, a grid was obtained to locate the different necessary materials for the ICUs. This grid had to be slightly altered to meet some requirements that had not been included in the mathematical model. The results were discussed with the persons responsible for specifying the characteristics of the new vehicles. Conclusion The outcome was highly satisfactory. Indeed, the final

  9. An integer programming model for a forest harvest problem in Pinus pinaster stands

    Energy Technology Data Exchange (ETDEWEB)

    Fonseca, T. F.; Cerveira, A.; Mota, A.

    2012-11-01

    The study addresses the special case of a management plan for maritime pine (Pinus pinaster Ait.) in common lands. The study area refers to 4,432 ha of maritime pine stands in North Portugal (Perimetro Florestal do Barroso in the county of Ribeira de Pena), distributed among five common lands called baldio areas. Those lands are co-managed by the Official Forest Services and the local communities, essentially for timber production, using empirical guidance. As the current procedure does not guarantee the best thinning and clear-cutting scheduling, it was considered important to develop easy-to-use models, supported by optimization techniques, to be employed by the forest managers in the harvest planning of these communitarian forests. Planning of the thinning and clear-cutting operations involved certain conditions, such as: (1) the optimal age for harvesting; (2) the maximum stand density permitted; (3) the minimum volume to be cut; (4) the guarantee of incomes for each of the five baldios in at least a two year period; (5) balanced incomes during the length of the projection period. In order to evaluate the sustainability of the wood resources, a set of constraints lower bounding the average ending age was additionally tested. The problem was formulated as an integer linear programming model where the incomes from thinning and clear-cutting are maximized while considering the constraints mentioned above. Five major scenarios were simulated. The simplest one allows for silvicultural constraints only, whereas the other four consider these constraints besides different management options. Two of them introduce joint management of all common areas with or without constraints addressing balanced distribution of incomes during the plan horizon, whilst the other two consider the same options but for individual management of the baldios. The proposed model is easy to apply, providing immediate advantages for short and mid-term planning periods compared to the empirical

  10. From the Kohn-Sham band gap to the fundamental gap in solids. An integer electron approach.

    Science.gov (United States)

    Baerends, E J

    2017-06-21

    It is often stated that the Kohn-Sham occupied-unoccupied gap in both molecules and solids is "wrong". We argue that this is not a correct statement. The KS theory does not allow to interpret the exact KS HOMO-LUMO gap as the fundamental gap (difference (I - A) of electron affinity (A) and ionization energy (I), twice the chemical hardness), from which it indeed differs, strongly in molecules and moderately in solids. The exact Kohn-Sham HOMO-LUMO gap in molecules is much below the fundamental gap and very close to the much smaller optical gap (first excitation energy), and LDA/GGA yield very similar gaps. In solids the situation is different: the excitation energy to delocalized excited states and the fundamental gap (I - A) are very similar, not so disparate as in molecules. Again the Kohn-Sham and LDA/GGA band gaps do not represent (I - A) but are significantly smaller. However, the special properties of an extended system like a solid make it very easy to calculate the fundamental gap from the ground state (neutral system) band structure calculations entirely within a density functional framework. The correction Δ from the KS gap to the fundamental gap originates from the response part v resp of the exchange-correlation potential and can be calculated very simply using an approximation to v resp . This affords a calculation of the fundamental gap at the same level of accuracy as other properties of crystals at little extra cost beyond the ground state bandstructure calculation. The method is based on integer electron systems, fractional electron systems (an ensemble of N- and (N + 1)-electron systems) and the derivative discontinuity are not invoked.

  11. A mixed integer linear programming approach for optimal DER portfolio, sizing, and placement in multi-energy microgrids

    International Nuclear Information System (INIS)

    Mashayekh, Salman; Stadler, Michael; Cardoso, Gonçalo; Heleno, Miguel

    2017-01-01

    Highlights: • This paper presents a MILP model for optimal design of multi-energy microgrids. • Our microgrid design includes optimal technology portfolio, placement, and operation. • Our model includes microgrid electrical power flow and heat transfer equations. • The case study shows advantages of our model over aggregate single-node approaches. • The case study shows the accuracy of the integrated linearized power flow model. - Abstract: Optimal microgrid design is a challenging problem, especially for multi-energy microgrids with electricity, heating, and cooling loads as well as sources, and multiple energy carriers. To address this problem, this paper presents an optimization model formulated as a mixed-integer linear program, which determines the optimal technology portfolio, the optimal technology placement, and the associated optimal dispatch, in a microgrid with multiple energy types. The developed model uses a multi-node modeling approach (as opposed to an aggregate single-node approach) that includes electrical power flow and heat flow equations, and hence, offers the ability to perform optimal siting considering physical and operational constraints of electrical and heating/cooling networks. The new model is founded on the existing optimization model DER-CAM, a state-of-the-art decision support tool for microgrid planning and design. The results of a case study that compares single-node vs. multi-node optimal design for an example microgrid show the importance of multi-node modeling. It has been shown that single-node approaches are not only incapable of optimal DER placement, but may also result in sub-optimal DER portfolio, as well as underestimation of investment costs.

  12. Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

    Directory of Open Access Journals (Sweden)

    Phil Diamond

    2003-01-01

    Full Text Available Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

  13. COMSAT: Residue contact prediction of transmembrane proteins based on support vector machines and mixed integer linear programming.

    Science.gov (United States)

    Zhang, Huiling; Huang, Qingsheng; Bei, Zhendong; Wei, Yanjie; Floudas, Christodoulos A

    2016-03-01

    In this article, we present COMSAT, a hybrid framework for residue contact prediction of transmembrane (TM) proteins, integrating a support vector machine (SVM) method and a mixed integer linear programming (MILP) method. COMSAT consists of two modules: COMSAT_SVM which is trained mainly on position-specific scoring matrix features, and COMSAT_MILP which is an ab initio method based on optimization models. Contacts predicted by the SVM model are ranked by SVM confidence scores, and a threshold is trained to improve the reliability of the predicted contacts. For TM proteins with no contacts above the threshold, COMSAT_MILP is used. The proposed hybrid contact prediction scheme was tested on two independent TM protein sets based on the contact definition of 14 Å between Cα-Cα atoms. First, using a rigorous leave-one-protein-out cross validation on the training set of 90 TM proteins, an accuracy of 66.8%, a coverage of 12.3%, a specificity of 99.3% and a Matthews' correlation coefficient (MCC) of 0.184 were obtained for residue pairs that are at least six amino acids apart. Second, when tested on a test set of 87 TM proteins, the proposed method showed a prediction accuracy of 64.5%, a coverage of 5.3%, a specificity of 99.4% and a MCC of 0.106. COMSAT shows satisfactory results when compared with 12 other state-of-the-art predictors, and is more robust in terms of prediction accuracy as the length and complexity of TM protein increase. COMSAT is freely accessible at http://hpcc.siat.ac.cn/COMSAT/. © 2016 Wiley Periodicals, Inc.

  14. Calculating the Mean Amplitude of Glycemic Excursions from Continuous Glucose Data Using an Open-Code Programmable Algorithm Based on the Integer Nonlinear Method.

    Science.gov (United States)

    Yu, Xuefei; Lin, Liangzhuo; Shen, Jie; Chen, Zhi; Jian, Jun; Li, Bin; Xin, Sherman Xuegang

    2018-01-01

    The mean amplitude of glycemic excursions (MAGE) is an essential index for glycemic variability assessment, which is treated as a key reference for blood glucose controlling at clinic. However, the traditional "ruler and pencil" manual method for the calculation of MAGE is time-consuming and prone to error due to the huge data size, making the development of robust computer-aided program an urgent requirement. Although several software products are available instead of manual calculation, poor agreement among them is reported. Therefore, more studies are required in this field. In this paper, we developed a mathematical algorithm based on integer nonlinear programming. Following the proposed mathematical method, an open-code computer program named MAGECAA v1.0 was developed and validated. The results of the statistical analysis indicated that the developed program was robust compared to the manual method. The agreement among the developed program and currently available popular software is satisfied, indicating that the worry about the disagreement among different software products is not necessary. The open-code programmable algorithm is an extra resource for those peers who are interested in the related study on methodology in the future.

  15. Integer programming

    CERN Document Server

    Greenberg, Harold

    1971-01-01

    In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat

  16. Selecting university undergraduate student activities via compromised-analytical hierarchy process and 0-1 integer programming to maximize SETARA points

    Science.gov (United States)

    Nazri, Engku Muhammad; Yusof, Nur Ai'Syah; Ahmad, Norazura; Shariffuddin, Mohd Dino Khairri; Khan, Shazida Jan Mohd

    2017-11-01

    Prioritizing and making decisions on what student activities to be selected and conducted to fulfill the aspiration of a university as translated in its strategic plan must be executed with transparency and accountability. It is becoming even more crucial, particularly for universities in Malaysia with the recent budget cut imposed by the Malaysian government. In this paper, we illustrated how 0-1 integer programming (0-1 IP) model was implemented to select which activities among the forty activities proposed by the student body of Universiti Utara Malaysia (UUM) to be implemented for the 2017/2018 academic year. Two different models were constructed. The first model was developed to determine the minimum total budget that should be given to the student body by the UUM management to conduct all the activities that can fulfill the minimum targeted number of activities as stated in its strategic plan. On the other hand, the second model was developed to determine which activities to be selected based on the total budget already allocated beforehand by the UUM management towards fulfilling the requirements as set in its strategic plan. The selection of activities for the second model, was also based on the preference of the members of the student body whereby the preference value for each activity was determined using Compromised-Analytical Hierarchy Process. The outputs from both models were compared and discussed. The technique used in this study will be useful and suitable to be implemented by organizations with key performance indicator-oriented programs and having limited budget allocation issues.

  17. Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016).

    Science.gov (United States)

    Chen, Pei-Hua

    2017-05-01

    This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.

  18. Distributed mixed-integer fuzzy hierarchical programming for municipal solid waste management. Part II: scheme analysis and mechanism revelation.

    Science.gov (United States)

    Cheng, Guanhui; Huang, Guohe; Dong, Cong; Xu, Ye; Chen, Jiapei; Chen, Xiujuan; Li, Kailong

    2017-03-01

    As presented in the first companion paper, distributed mixed-integer fuzzy hierarchical programming (DMIFHP) was developed for municipal solid waste management (MSWM) under complexities of heterogeneities, hierarchy, discreteness, and interactions. Beijing was selected as a representative case. This paper focuses on presenting the obtained schemes and the revealed mechanisms of the Beijing MSWM system. The optimal MSWM schemes for Beijing under various solid waste treatment policies and their differences are deliberated. The impacts of facility expansion, hierarchy, and spatial heterogeneities and potential extensions of DMIFHP are also discussed. A few of findings are revealed from the results and a series of comparisons and analyses. For instance, DMIFHP is capable of robustly reflecting these complexities in MSWM systems, especially for Beijing. The optimal MSWM schemes are of fragmented patterns due to the dominant role of the proximity principle in allocating solid waste treatment resources, and they are closely related to regulated ratios of landfilling, incineration, and composting. Communities without significant differences among distances to different types of treatment facilities are more sensitive to these ratios than others. The complexities of hierarchy and heterogeneities pose significant impacts on MSWM practices. Spatial dislocation of MSW generation rates and facility capacities caused by unreasonable planning in the past may result in insufficient utilization of treatment capacities under substantial influences of transportation costs. The problems of unreasonable MSWM planning, e.g., severe imbalance among different technologies and complete vacancy of ten facilities, should be gained deliberation of the public and the municipal or local governments in Beijing. These findings are helpful for gaining insights into MSWM systems under these complexities, mitigating key challenges in the planning of these systems, improving the related management

  19. Magnetic quantum oscillations of diagonal conductivity in a two-dimensional conductor with a weak square superlattice modulation under conditions of the integer quantum Hall effect

    International Nuclear Information System (INIS)

    Gvozdikov, V M; Taut, M

    2009-01-01

    We report on analytical and numerical studies of the magnetic quantum oscillations of the diagonal conductivity σ xx in a two-dimensional conductor with a weak square superlattice modulation under conditions of the integer quantum Hall (IQHE) effect. The quantum Hall effect in such a system differs from the conventional IQHE, in which the finite width of the Landau bands is due to disorder only. The superlattice modulation potential yields a fractal splitting of the Landau levels into Hofstadter minibands. For rational flux through a unit cell, the minibands have a finite width and intrinsic dispersion relations. We consider a regime, now accessible experimentally, in which disorder does not wash out the fractal internal gap structure of the Landau bands completely. We found the following distinctions from the conventional IQHE produced by the superlattice: (i) the peaks in diagonal conductivity are split due to the Hofstadter miniband structure of Landau bands; (ii) the number of split peaks in the bunch, their positions and heights depend irregularly on the magnetic field and the Fermi energy; (iii) the gaps between the split Landau bands (and related quantum Hall plateaus) become narrower with the superlattice modulation than without it.

  20. Optimal planning of co-firing alternative fuels with coal in a power plant by grey nonlinear mixed integer programming model

    Energy Technology Data Exchange (ETDEWEB)

    Koa, A.S.; Chang, N.B. [University of Central Florida, Orlando, FL (United States). Dept. for Civil & Environmental Engineering

    2008-07-15

    Energy supply and use is of fundamental importance to society. Although the interactions between energy and environment were originally local in character, they have now widened to cover regional and global issues, such as acid rain and the greenhouse effect. It is for this reason that there is a need for covering the direct and indirect economic and environmental impacts of energy acquisition, transport, production and use. In this paper, particular attention is directed to ways of resolving conflict between economic and environmental goals by encouraging a power plant to consider co-firing biomass and refuse-derived fuel (RDF) with coal simultaneously. It aims at reducing the emission level of sulfur dioxide (SO{sub 2}) in an uncertain environment, using the power plant in Michigan City, Indiana as an example. To assess the uncertainty by a comparative way both deterministic and grey nonlinear mixed integer programming (MIP) models were developed to minimize the net operating cost with respect to possible fuel combinations. It aims at generating the optimal portfolio of alternative fuels while maintaining the same electricity generation simultaneously. To case the solution procedure stepwise relaxation algorithm was developed for solving the grey nonlinear MIP model. Breakeven alternative fuel value can be identified in the post-optimization stage for decision-making. Research findings show that the inclusion of RDF does not exhibit comparative advantage in terms of the net cost, albeit relatively lower air pollution impact. Yet it can be sustained by a charge system, subsidy program, or emission credit as the price of coal increases over time.

  1. Optimal planning of co-firing alternative fuels with coal in a power plant by grey nonlinear mixed integer programming model.

    Science.gov (United States)

    Ko, Andi Setiady; Chang, Ni-Bin

    2008-07-01

    Energy supply and use is of fundamental importance to society. Although the interactions between energy and environment were originally local in character, they have now widened to cover regional and global issues, such as acid rain and the greenhouse effect. It is for this reason that there is a need for covering the direct and indirect economic and environmental impacts of energy acquisition, transport, production and use. In this paper, particular attention is directed to ways of resolving conflict between economic and environmental goals by encouraging a power plant to consider co-firing biomass and refuse-derived fuel (RDF) with coal simultaneously. It aims at reducing the emission level of sulfur dioxide (SO(2)) in an uncertain environment, using the power plant in Michigan City, Indiana as an example. To assess the uncertainty by a comparative way both deterministic and grey nonlinear mixed integer programming (MIP) models were developed to minimize the net operating cost with respect to possible fuel combinations. It aims at generating the optimal portfolio of alternative fuels while maintaining the same electricity generation simultaneously. To ease the solution procedure stepwise relaxation algorithm was developed for solving the grey nonlinear MIP model. Breakeven alternative fuel value can be identified in the post-optimization stage for decision-making. Research findings show that the inclusion of RDF does not exhibit comparative advantage in terms of the net cost, albeit relatively lower air pollution impact. Yet it can be sustained by a charge system, subsidy program, or emission credit as the price of coal increases over time.

  2. A novel measuring method for arbitrary optical vortex by three spiral spectra

    Energy Technology Data Exchange (ETDEWEB)

    Ni, Bo [School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006 (China); Guo, Lana [School of Electronics and Information, Guangdong Polytechnic Normal University, Guangzhou 510665 (China); Yue, Chengfeng [School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006 (China); Tang, Zhilie, E-mail: tangzhl@scnu.edu.cn [School of Physics and Telecommunication Engineering, South China Normal University, Guangzhou 510006 (China)

    2017-02-26

    In this letter, the topological charge of non-integer vortices determined by three arbitrary spiral spectra is theoretically demonstrated for the first time. Based on the conclusion, a novel method to measure non-integer vortices is presented. This method is applicable not only to arbitrary non-integer vortex but also to arbitrary integer vortex. - Highlights: • Different non-integer vortices cannot have three spiral spectra is demonstrated. • Relationship between the non-integer topological charge and the spiral spectra is presented. • Topological charge of non-integer vortices can be determined by three arbitrary spiral spectra.

  3. An energy integrated, multi-microgrid, MILP (mixed-integer linear programming) approach for residential distributed energy system planning – A South Australian case-study

    International Nuclear Information System (INIS)

    Wouters, Carmen; Fraga, Eric S.; James, Adrian M.

    2015-01-01

    The integration of distributed generation units and microgrids in the current grid infrastructure requires an efficient and cost effective local energy system design. A mixed-integer linear programming model is presented to identify such optimal design. The electricity as well as the space heating and cooling demands of a small residential neighbourhood are satisfied through the consideration and combined use of distributed generation technologies, thermal units and energy storage with an optional interconnection with the central grid. Moreover, energy integration is allowed in the form of both optimised pipeline networks and microgrid operation. The objective is to minimise the total annualised cost of the system to meet its yearly energy demand. The model integrates the operational characteristics and constraints of the different technologies for several scenarios in a South Australian setting and is implemented in GAMS. The impact of energy integration is analysed, leading to the identification of key components for residential energy systems. Additionally, a multi-microgrid concept is introduced to allow for local clustering of households within neighbourhoods. The robustness of the model is shown through sensitivity analysis, up-scaling and an effort to address the variability of solar irradiation. - Highlights: • Distributed energy system planning is employed on a small residential scale. • Full energy integration is employed based on microgrid operation and tri-generation. • An MILP for local clustering of households in multi-microgrids is developed. • Micro combined heat and power units are key components for residential microgrids

  4. Accurate Bessel functions Jsub(n)(z), Ysub(n)(z), Hsub(n)sup((1))(z) and Hsub(n)sup((2))(z) of integer order and complex argument

    International Nuclear Information System (INIS)

    Ardill, R.W.B.; Moriarty, K.J.M.

    1979-01-01

    The Bessel function appears in a wide range of physical applications, and in particular where there is axial symmetry. The package contains complex function routines to calculate Jsub(n)(z), Ysub(n)(z), Hsub(n)sup((1))(z) and Hsub(n)sup((2))(z) for integer n and complex z. The method of solution is based on the ascending series representations and asymptotic forms of the Bessel functions Jsub(n)(z) and Ysub(n)(z) and asymptotic forms of the modified Bessel functions Isub(n)(z) and Ksub(n)(z). The program will return results for all values of mod(z) up to machine overflows in the Bessel functions. The size of the order should not be too large (say, mod(n) -11 . For the asymptotic region, the accuracy EPS may not always be achieved (since the asymptotic series may have to be truncated at their lower terms), in which case the output parameter ISET will indicate this and an estimation of the relative error is also produced. The functions Ysub(n)(z), Hsub(n)sup((1))(z) and Hsub(n)sup((2))(z) have a branch point at the origin, together with a cut along the negative real axis. (Auth.)

  5. A mixed integer linear programming model for operational planning of a biodiesel supply chain network from used cooking oil

    Science.gov (United States)

    Jonrinaldi, Hadiguna, Rika Ampuh; Salastino, Rades

    2017-11-01

    Environmental consciousness has paid many attention nowadays. It is not only about how to recycle, remanufacture or reuse used end products but it is also how to optimize the operations of the reverse system. A previous research has proposed a design of reverse supply chain of biodiesel network from used cooking oil. However, the research focused on the design of the supply chain strategy not the operations of the supply chain. It only decided how to design the structure of the supply chain in the next few years, and the process of each stage will be conducted in the supply chain system in general. The supply chain system has not considered operational policies to be conducted by the companies in the supply chain. Companies need a policy for each stage of the supply chain operations to be conducted so as to produce the optimal supply chain system, including how to use all the resources that have been designed in order to achieve the objectives of the supply chain system. Therefore, this paper proposes a model to optimize the operational planning of a biodiesel supply chain network from used cooking oil. A mixed integer linear programming is developed to model the operational planning of biodiesel supply chain in order to minimize the total operational cost of the supply chain. Based on the implementation of the model developed, the total operational cost of the biodiesel supply chain incurred by the system is less than the total operational cost of supply chain based on the previous research during seven days of operational planning about amount of 2,743,470.00 or 0.186%. Production costs contributed to 74.6 % of total operational cost and the cost of purchasing the used cooking oil contributed to 24.1 % of total operational cost. So, the system should pay more attention to these two aspects as changes in the value of these aspects will cause significant effects to the change in the total operational cost of the supply chain.

  6. Counting Triangles to Sum Squares

    Science.gov (United States)

    DeMaio, Joe

    2012-01-01

    Counting complete subgraphs of three vertices in complete graphs, yields combinatorial arguments for identities for sums of squares of integers, odd integers, even integers and sums of the triangular numbers.

  7. Counting rises and levels in r-color compositions

    Indian Academy of Sciences (India)

    TOUFIK MANSOUR

    An r-color composition of a positive integer n is a sequence of positive integers, called parts, summing ... A non-increasing sequence of positive integers, called parts, whose sum is a given positive integer is called a ..... of d-ary r-color words according to the number of rises and the value of the statistic σ. (here, the variable y ...

  8. Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systems

    Science.gov (United States)

    Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.

    1986-01-01

    The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

  9. The Binomial Coefficient for Negative Arguments

    OpenAIRE

    Kronenburg, M. J.

    2011-01-01

    The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a symmetry formula for the gamma function, this definition is extended to negative integer arguments, making the symmetry identity for binomial coefficients valid for all integer arguments. The agreement of this definition with some other identities and with the bin...

  10. On the Lorentz invariance of bit-string geometry

    International Nuclear Information System (INIS)

    Noyes, H.P.

    1995-09-01

    We construct the class of integer-sided triangles and tetrahedra that respectively correspond to two or three discriminately independent bit-strings. In order to specify integer coordinates in this space, we take one vertex of a regular tetrahedron whose common edge length is an even integer as the origin of a line of integer length to the open-quotes pointclose quotes and three integer distances to this open-quotes pointclose quotes from the three remaining vertices of the reference tetrahedron. This - usually chiral - integer coordinate description of bit-string geometry is possible because three discriminately independent bit-strings generate four more; the Hamming measures of these seven strings always allow this geometrical interpretation. On another occasion we intend to prove the rotational invariance of this coordinate description. By identifying the corners of these figures with the positions of recording counters whose clocks are synchronized using the Einstein convention, we define velocities in this space. This suggests that it may be possible to define boosts and discrete Lorentz transformations in a space of integer coordinates. We relate this description to our previous work on measurement accuracy and the discrete ordered calculus of Etter and Kauffman (DOC)

  11. First Responder Immersive Training Simulation Environment (FRITSE): Downwind Hazard Modeling of Scenarios

    Science.gov (United States)

    2014-07-31

    MODULE datatype !>>TYPE TYPE OUTPUT_TYPE INTEGER :: MX INTEGER :: IL, JL, KL INTEGER :: IG, JG, KG END TYPE...PARAMETER :: C_cutoff = 1.E-20 END MODULE datatype 21 in which (IL,JL,KL) and (IG,JG,KG) represent (I,J,K) indices in the local and

  12. Orbit and optics distortion in fixed field alternating gradient muon accelerators

    Directory of Open Access Journals (Sweden)

    Shinji Machida

    2007-11-01

    Full Text Available In a linear nonscaling fixed field alternating gradient (FFAG accelerator, betatron tunes vary over a wide range and a beam has to cross integer and half-integer tunes several times. Although it is plausible to say that integer and half-integer resonances are not harmful if the crossing speed is fast, no quantitative argument exists. With tracking simulation, we studied orbit and optics distortion due to alignment and magnet errors. It was found that the concept of integer and half-integer resonance crossing is irrelevant to explain beam behavior in a nonscaling FFAG when acceleration is fast and betatron tunes change quickly. In a muon FFAG accelerator, it takes 17 turns for acceleration and the betatron tunes change more than 10, for example. Instead, the orbit and optics distortion is excited by random dipole and quadrupole kicks. The latter causes beam size growth because the beam starts tumbling in phase space, but not necessarily with emittance growth.

  13. About an even as the sum or the difference of two primes

    OpenAIRE

    Ghannouchi , Jamel

    2013-01-01

    13 pages; International audience; The present algebraic development begins by an exposition of the data of the problem. The definition of the primal radius is : For all positive integer exists a finite number of integers called the primal radius , for which and are prime numbers. The corollary is that is always the sum of a finite number of primes. Also, for all positive integer , exists an infinity of integers , for which and are prime numbers. The conclusion is that is always an infinity of...

  14. "Tuumajaam on nagu beebi, keda tuleb üheksa kuud kanda" / Arturas Jonkus ; interv. Toivo Tänavsuu

    Index Scriptorium Estoniae

    Jonkus, Arturas

    2008-01-01

    Leedu rahvusliku energiafirma LEO LT avalike suhete juhi väitel edeneb uue tuumaelektrijaama projekt kenasti, valminud on tasuvusuuring, veebruaris lõpetatakse keskkonnamõjude analüüs, alustatud on logistika analüüsi

  15. Flow Formulations for Curriculum-based Course Timetabling

    DEFF Research Database (Denmark)

    Bagger, Niels-Christian Fink; Kristiansen, Simon; Sørensen, Matias

    2017-01-01

    lower bound on one data instance in the benchmark data set from the second international timetabling competition. Regarding upper bounds, the formulation based on the minimum cost flow problem performs better on average than other mixed integer programming approaches for the CTT.......In this paper we present two mixed-integer programming formulations for the Curriculum based Course Timetabling Problem (CTT). We show that the formulations contain underlying network structures by dividing the CTT into two separate models and then connect the two models using flow formulation...... techniques. The first mixed-integer programming formulation is based on an underlying minimum cost flow problem, which decreases the number of integer variables significantly and improves the performance compared to an intuitive mixed-integer programming formulation. The second formulation is based...

  16. Fulltext PDF

    Indian Academy of Sciences (India)

    vertices have integer co-ordinates. (b) Show that there exist infinitely many equilateral triangles in. 3D-space whose vertices have integer co-ordinates. (c) Characterize all equilateral triangles in 3D-space whose ver- tices have integer co-ordinates. Question 2. (a) As n varies over natural numbers, consider the sequence.

  17. Equilibrium beam distribution in an electron storage ring near linear synchrobetatron coupling resonances

    Directory of Open Access Journals (Sweden)

    Boaz Nash

    2006-03-01

    Full Text Available Linear dynamics in a storage ring can be described by the one-turn map matrix. In the case of a resonance where two of the eigenvalues of this matrix are degenerate, a coupling perturbation causes a mixing of the uncoupled eigenvectors. A perturbation formalism is developed to find eigenvalues and eigenvectors of the one-turn map near such a linear resonance. Damping and diffusion due to synchrotron radiation can be obtained by integrating their effects over one turn, and the coupled eigenvectors can be used to find the coupled damping and diffusion coefficients. Expressions for the coupled equilibrium emittances and beam distribution moments are then derived. In addition to the conventional instabilities at the sum, integer, and half-integer resonances, it is found that the coupling can cause an instability through antidamping near a sum resonance even when the symplectic dynamics are stable. As one application of this formalism, the case of linear synchrobetatron coupling is analyzed where the coupling is caused by dispersion in the rf cavity, or by a crab cavity. Explicit closed-form expressions for the sum/difference resonances are given along with the integer/half-integer resonances. The integer and half-integer resonances caused by coupling require particular care. We find an example of this with the case of a crab cavity for the integer resonance of the synchrotron tune. Whether or not there is an instability is determined by the value of the horizontal betatron tune, a unique feature of these coupling-caused integer or half-integer resonances. Finally, the coupled damping and diffusion coefficients along with the equilibrium invariants and projected emittances are plotted as a function of the betatron and synchrotron tunes for an example storage ring based on PEP-II.

  18. Diophantine Optics

    Science.gov (United States)

    Rouan, D.

    2016-09-01

    What I call Diophantine optics is the exploitation in optics of some remarkable algebraic relations between powers of integers. The name comes from Diophantus of Alexandria, a greek mathematician, known as the father of algebra. He studied polynomial equations with integer coefficients and integer solutions, called diophantine equations. Since constructive or destructive interferences are playing with optical path differences which are multiple integer (odd or even) of λ/2 and that the complex amplitude is a highly non-linear function of the optical path difference (or equivalently of the phase), one can understand that any Taylor development of this amplitude implies powers of integers. This is the link with Diophantine equations. We show how, especially in the field of interferometry, remarkable relations between powers of integers can help to solve several problems, such as achromatization of a phase shifter or deep nulling efficiency. It appears that all the research that was conducted in this frame of thinking, relates to the field of detection of exoplanets, a very active domain of astrophysics today.

  19. Synchro-Betatron Stop-Bands Due to a Single Crab Cavity

    Energy Technology Data Exchange (ETDEWEB)

    Chao, A

    2004-06-17

    We analyze the stop-band due to crab cavities for horizontal tunes that are either close to integers or close to half integers. The latter case is relevant for today's electron/positron colliders. We compare this stop-band to that created by dispersion in an accelerating cavity and show that a single typical crab cavity creates larger stop-bands than a typical dispersion at an accelerating cavity. We furthermore analyze whether it is beneficial to place the crab cavity at a position where the dispersion and its slope vanish. We find that this choice is worth while if the horizontal tune is close to a half integer, but not if it is close to an integer. Furthermore we find that stop-bands can be avoided when the horizontal tune is located at a favorable side of the integer or the half integer. While we are here concerned with the installation of a single crab cavity in a storage ring, we show that the stop-bands can be weakened, although not eliminated, significantly when two crab cavities per ring are chosen suitably.

  20. THE PROPOSAL MODEL OF RATIONAL WORKFORCE ASSIGNMENT IN DOKUZ EYLUL UNIVERSITY BY ANALYTIC HIERARCHY PROCESS BASED 0-1 INTEGER PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Yılmaz GÖKŞEN

    2016-11-01

    to the personnel, a person’s contribution coefficients have been calculated. These values are used in the assignment model. This model has been solved and evaluated as 0-1 integer programming. Model outputs that have been solved again by using additional constraints like task type and disability conditions and these are compared with the previous figures.

  1. Random crystal field effects on the integer and half-integer mixed-spin system

    Science.gov (United States)

    Yigit, Ali; Albayrak, Erhan

    2018-05-01

    In this work, we have focused on the random crystal field effects on the phase diagrams of the mixed spin-1 and spin-5/2 Ising system obtained by utilizing the exact recursion relations (ERR) on the Bethe lattice (BL). The distribution function P(Di) = pδ [Di - D(1 + α) ] +(1 - p) δ [Di - D(1 - α) ] is used to randomize the crystal field.The phase diagrams are found to exhibit second- and first-order phase transitions depending on the values of α, D and p. It is also observed that the model displays tricritical point, isolated point, critical end point and three compensation temperatures for suitable values of the system parameters.

  2. The model of the relativistic particle with torsion

    International Nuclear Information System (INIS)

    Plyushchay, M.S.

    1991-01-01

    The model of the relativistic particle with torsion, whose action appears in the Bose-Fermi transmutation mechanism, is canonically quantized in the Minkowski and euclidean spaces. In the Minkowski space there are massive, massless and tachyonic states in the spectrum of the model. In the massive sector the spectrum contains an infinite number of states, whose spin can take integer, half-integer, or fractional values. In the euclidean space, the spectrum is finite and the spin can only be integer, or half-integer. The reasons for the differences of the quantum theory of the model in the two spaces are elucidated. (orig.)

  3. Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

    Energy Technology Data Exchange (ETDEWEB)

    Jeff Linderoth

    2011-11-06

    the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

  4. On $ \\phi $ -amicable pairs (with appendix)

    NARCIS (Netherlands)

    G.L. Cohen; H.J.J. te Riele (Herman)

    1995-01-01

    textabstractLet $\\phi(n)$ denote Euler's totient function, i.e., the number of positive integers~$integers $(a_0,a_1)$ with $a_0\\le a_1$ such that $\\phi(a_0)=\\phi(a_1)=(a_0+a_1)/k$ for some integer $k\\ge1$. We call these numbers $\\phi$--{\\it

  5. Elliptic Curve Integral Points on y2 = x3 + 3x ‑ 14

    Science.gov (United States)

    Zhao, Jianhong

    2018-03-01

    The positive integer points and integral points of elliptic curves are very important in the theory of number and arithmetic algebra, it has a wide range of applications in cryptography and other fields. There are some results of positive integer points of elliptic curve y 2 = x 3 + ax + b, a, b ∈ Z In 1987, D. Zagier submit the question of the integer points on y 2 = x 3 ‑ 27x + 62, it count a great deal to the study of the arithmetic properties of elliptic curves. In 2009, Zhu H L and Chen J H solved the problem of the integer points on y 2 = x 3 ‑ 27x + 62 by using algebraic number theory and P-adic analysis method. In 2010, By using the elementary method, Wu H M obtain all the integral points of elliptic curves y 2 = x 3 ‑ 27x ‑ 62. In 2015, Li Y Z and Cui B J solved the problem of the integer points on y 2 = x 3 ‑ 21x ‑ 90 By using the elementary method. In 2016, Guo J solved the problem of the integer points on y 2 = x 3 + 27x + 62 by using the elementary method. In 2017, Guo J proved that y 2 = x 3 ‑ 21x + 90 has no integer points by using the elementary method. Up to now, there is no relevant conclusions on the integral points of elliptic curves y 2 = x 3 + 3x ‑ 14, which is the subject of this paper. By using congruence and Legendre Symbol, it can be proved that elliptic curve y 2 = x 3 + 3x ‑ 14 has only one integer point: (x, y) = (2, 0).

  6. Elementary theory of numbers

    CERN Document Server

    LeVeque, William J

    1990-01-01

    Superb introduction to Euclidean algorithm and its consequences, congruences, continued fractions, powers of an integer modulo m, Gaussian integers, Diophantine equations, more. Problems, with answers. Bibliography.

  7. Asymptotic behavior of observables in the asymmetric quantum Rabi model

    Science.gov (United States)

    Semple, J.; Kollar, M.

    2018-01-01

    The asymmetric quantum Rabi model with broken parity invariance shows spectral degeneracies in the integer case, that is when the asymmetry parameter equals an integer multiple of half the oscillator frequency, thus hinting at a hidden symmetry and accompanying integrability of the model. We study the expectation values of spin observables for each eigenstate and observe characteristic differences between the integer and noninteger cases for the asymptotics in the deep strong coupling regime, which can be understood from a perturbative expansion in the qubit splitting. We also construct a parent Hamiltonian whose exact eigenstates possess the same symmetries as the perturbative eigenstates of the asymmetric quantum Rabi model in the integer case.

  8. Interger multiplication with overflow detection or saturation

    Energy Technology Data Exchange (ETDEWEB)

    Schulte, M.J.; Balzola, P.I.; Akkas, A.; Brocato, R.W.

    2000-01-11

    High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative representable number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection and saturation.

  9. Information quantity in a pixel of digital image

    OpenAIRE

    Kharinov, M.

    2014-01-01

    The paper is devoted to the problem of integer-valued estimating of information quantity in a pixel of digital image. The definition of an integer estimation of information quantity based on constructing of the certain binary hierarchy of pixel clusters is proposed. The methods for constructing hierarchies of clusters and generating of hierarchical sequences of image approximations that minimally differ from the image by a standard deviation are developed. Experimental results on integer-valu...

  10. Extension of P-adic Exact Scientific Computational Library (ESCL) to Compute the Exponential of Rational Matrix

    National Research Council Canada - National Science Library

    Lu, Chao

    2008-01-01

    ...) using p-adic arithmetic. New algorithms have been designed and implemented for matrix operations with rational numbers by representing numerator and denominator with arbitrary length integers, all integers and fractional...

  11. Construction of Nodal Bubbling Solutions for the Weighted Sinh-Poisson Equation

    Directory of Open Access Journals (Sweden)

    Yibin Zhang

    2013-01-01

    Full Text Available We consider the weighted sinh-Poisson equation in , on , where is a small parameter, , and is a unit ball in . By a constructive way, we prove that for any positive integer , there exists a nodal bubbling solution which concentrates at the origin and the other -points , , such that as , , where and is an odd integer with , or is an even integer. The same techniques lead also to a more general result on general domains.

  12. Using Integer Manipulatives: Representational Determinism

    Science.gov (United States)

    Bossé, Michael J.; Lynch-Davis, Kathleen; Adu-Gyamfi, Kwaku; Chandler, Kayla

    2016-01-01

    Teachers and students commonly use various concrete representations during mathematical instruction. These representations can be utilized to help students understand mathematical concepts and processes, increase flexibility of thinking, facilitate problem solving, and reduce anxiety while doing mathematics. Unfortunately, the manner in which some…

  13. Integer Solutions of Binomial Coefficients

    Science.gov (United States)

    Gilbertson, Nicholas J.

    2016-01-01

    A good formula is like a good story, rich in description, powerful in communication, and eye-opening to readers. The formula presented in this article for determining the coefficients of the binomial expansion of (x + y)n is one such "good read." The beauty of this formula is in its simplicity--both describing a quantitative situation…

  14. Which Positive Integers are Interesting?

    Indian Academy of Sciences (India)

    IAS Admin

    when we learn Euclid's proof of the infinitude of primes. Recall that the argument .... For n < 104, we can use a better upper bound for the number of divisors of n to ..... A video summary of the article created by the author can be accessed at.

  15. Sums of squares of integers

    CERN Document Server

    Moreno, Carlos J

    2005-01-01

    Introduction Prerequisites Outline of Chapters 2 - 8 Elementary Methods Introduction Some Lemmas Two Fundamental Identities Euler's Recurrence for Sigma(n)More Identities Sums of Two Squares Sums of Four Squares Still More Identities Sums of Three Squares An Alternate Method Sums of Polygonal Numbers Exercises Bernoulli Numbers Overview Definition of the Bernoulli Numbers The Euler-MacLaurin Sum Formula The Riemann Zeta Function Signs of Bernoulli Numbers Alternate The von Staudt-Clausen Theorem Congruences of Voronoi and Kummer Irregular Primes Fractional Parts of Bernoulli Numbers Exercises Examples of Modular Forms Introduction An Example of Jacobi and Smith An Example of Ramanujan and Mordell An Example of Wilton: t (n) Modulo 23 An Example of Hamburger Exercises Hecke's Theory of Modular FormsIntroduction Modular Group ? and its Subgroup ? 0 (N) Fundamental Domains For ? and ? 0 (N) Integral Modular Forms Modular Forms of Type Mk(? 0(N);chi) and Euler-Poincare series Hecke Operators Dirichlet Series and ...

  16. Topological setting of Bessel functions

    International Nuclear Information System (INIS)

    Mekhfi, M.

    1995-11-01

    We start from the topology of the punctured plane encoded within its homotopy group which is isomorphic to the set of integers Z. We then realize group elements Π(n), n is an element of Z as differential operators on the space of analytic functions. Using plausible physical arguments we select a subset of functions which we identify with integer orders reduced Bessel functions. On the other hand we propose a unifying new formula of topological origin, generating real orders Bessel functions out of integers orders ones, the generator being an operator built entirely out of the Π s . We thus have shown that the topology (of the puntured plane) is underlying the inner structure of Bessel functions, in addition it unifies them independently of the orders being integers or reals. (author). 4 refs

  17. Magnetic impurity effect on charge and magnetic order in doped La1.5Ca0.5CoO4

    Science.gov (United States)

    Horigane, K.; Hiraka, H.; Tomiyasu, K.; Ohoyama, K.; Louca, D.; Yamada, K.

    2012-02-01

    Neutron scattering experiments were performed on single crystals of magnetic impurity doped cobalt oxides La1.5Ca0.5CoO4 to characterize the charge and spin orders. We newly found contrasting impurity effects. Two types of magnetic peaks are observed at q = (0.5,0,L) with L = half-integer and integer in La1.5Ca0.5CoO4, while magnetic peak at L = half-integer (integer) was only observed in Mn (Fe)-substituted sample. Although Mn and Fe impurities degrade charge and magnetic order, Cr impurity stabilizes the ordering at x = 0.5. Based on the crystal structural analysis of Cr doped sample, we found that the excess oxygen and change of octahedron around Co3+ were realized in Cr doped sample.

  18. The Inverted-Triangle Technique Of Converting The Computer ...

    African Journals Online (AJOL)

    Binary, Octal And Hexadecimal) To Decimal. ... Two models have been presented: one to handle Integer number conversions and the other handles the non-integer conversions. Demonstrations of the models are presented for clarity of ...

  19. Unsharp spin observables, non-locality and Fry, Walther and Li ...

    Indian Academy of Sciences (India)

    The spin values of particles continue to have the normal integer or half integer values in operational quantum physics. .... The net effect of unsharp observables is twofold. The use of .... terms of physically realizable experiment. Essentially, the ...

  20. Symmetric group representations and Z

    OpenAIRE

    Adve, Anshul; Yong, Alexander

    2017-01-01

    We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as a Littlewood-Richardson coefficient and as a Kronecker coefficient.

  1. A formalization of the Berlekamp-Zassenhaus factorization algorithm

    NARCIS (Netherlands)

    Divasón, Jose; Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa

    2017-01-01

    We formalize the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt an existing formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide an efficient and certified factorization algorithm for

  2. A simplified approach for the generation of projection data for cone ...

    Indian Academy of Sciences (India)

    phantom for cone beam geometry in transmission and emission modes is to calculate the effective .... may no longer be integers and so they are rounded off to the nearest integer under the restriction ..... Z-slice number as shown in figure 10d.

  3. Chaotic behaviour from smooth and non-smooth optical solitons ...

    Indian Academy of Sciences (India)

    2016-07-14

    Jul 14, 2016 ... In particular, solitons in optical fibre models are rarely researched. ... where m is an integer, n is a positive integer, d is the amplitude, w ... transmission system. .... will intersect an infinite number of times, thus forming a type of ...

  4. Extending the Finite Domain Solver of GNU Prolog

    NARCIS (Netherlands)

    Bloemen, Vincent; Diaz, Daniel; van der Bijl, Machiel; Abreu, Salvador; Ströder, Thomas; Swift, Terrance

    This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, the internal representation of sparse domains has been redesigned to

  5. Fermat's Last Theorem for Factional and Irrational Exponents

    Science.gov (United States)

    Morgan, Frank

    2010-01-01

    Fermat's Last Theorem says that for integers n greater than 2, there are no solutions to x[superscript n] + y[superscript n] = z[superscript n] among positive integers. What about rational exponents? Irrational n? Negative n? See what an undergraduate senior seminar discovered.

  6. Recurrence of the excited states of nuclei and time coherency of the de Broglie wave in 16O+n resonances

    International Nuclear Information System (INIS)

    Ohkubo, Makio

    2003-01-01

    From the requirement of the time periodicity of a (quasi) stable state, frequencies of the normal modes, which compose the state, are commensurable (integer ratios) with each other, and the excitation energies E x are written as a sum of inverse integers. We propose an expression: E x = GΣ1/n, where n = integers and G = 34.5 MeV. Recurrence time is defined as LCM(n j ) x τ o , where τ 0 = 2πℎ/G = 1.20 x 10 -22 s. LCM vs. E x are illustrated for all possible n j of 2 and 3 normal modes. In 16 O +n resonances, integer ratios are found between the recurrence frequencies of 17 O and the de Broglie wave frequencies of incident neutron, meaning time coherency between them. A simple branch pattern is found in 16 O +n resonance levels. (author)

  7. Proximity search heuristics for wind farm optimal layout

    DEFF Research Database (Denmark)

    Fischetti, Martina; Monaci, Michele

    2016-01-01

    A heuristic framework for turbine layout optimization in a wind farm is proposed that combines ad-hoc heuristics and mixed-integer linear programming. In our framework, large-scale mixed-integer programming models are used to iteratively refine the current best solution according to the recently...

  8. Detecting perfect powers by factoring into coprimes

    NARCIS (Netherlands)

    Bernstein, D.J.; Lenstra, H.W.; Pila, J.

    2007-01-01

    This paper presents an algorithm that, given an integer , finds the largest integer such that is a th power. A previous algorithm by the first author took time where ; more precisely, time ; conjecturally, time . The new algorithm takes time . It relies on relatively complicated

  9. Paged GIRS (Graph Information Retrieval System) Users Manual.

    Science.gov (United States)

    1981-05-01

    list: G NODEl LINK1 valuei 2) Add integer I to the end of the list G NODE1 LINKI "I" 3) Place valuei in the third location from the bottom of the list...G NODEI LINK1 .-3 valuei 4) Replace the second integer value from the top of the list with the integer 10. G NODE1 LINKI -..2 ൒" 35 5) Assign a...random number to valuei (for the current page) and place the triple on page 5, continuant 0. NODEI - 5 LVREQP(2) = 0 VALUEI - 0 G NODE1 LINKI VALUEI PRINT

  10. Combinatorial interpretations of binomial coefficient analogues related to Lucas sequences

    OpenAIRE

    Sagan, Bruce; Savage, Carla

    2009-01-01

    Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial coefficients by C{n,k}={n}!/({k}!{n-k}!) where {n}!={1}{2}...{n}. It is easy to see that C{n,k} is a polynomial in s and t. The purpose of this note is to give two combinatorial interpretations for this polynomial in terms of statistics on integer partitions in...

  11. Chern-Simons induced spin factors in noncovariant gauges

    International Nuclear Information System (INIS)

    Tanaka, I.

    1993-01-01

    We study Chern-Simons induced spin factors in noncovariant metric-independent gauges, such as the axial gauge and the Coulomb gauge. These spin factors are defined without loop splitting. We find that they are equal to integers and have particular geometrical meanings. In the axial gauge, this integer is the writhe number of a link diagram defined by the projection of a loop to the time direction. In the Coulomb gauge, it is suggested that this integer is also the writhe number of a link diagram, defined by the projection of a loop to a spatial plane

  12. Efficient density matrix renormalization group algorithm to study Y junctions with integer and half-integer spin

    KAUST Repository

    Kumar, Manoranjan

    2016-02-03

    An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y junctions, systems with three arms of n sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new sites are always bonded to the most recently added sites and the superblock Hamiltonian contains only new or once renormalized operators. Junctions of up to N=3n+1≈500 sites are studied with antiferromagnetic (AF) Heisenberg exchange J between nearest-neighbor spins S or electron transfer t between nearest neighbors in half-filled Hubbard models. Exchange or electron transfer is exclusively between sites in two sublattices with NA≠NB. The ground state (GS) and spin densities ρr=⟨Szr⟩ at site r are quite different for junctions with S=1/2, 1, 3/2, and 2. The GS has finite total spin SG=2S(S) for even (odd) N and for MG=SG in the SG spin manifold, ρr>0(<0) at sites of the larger (smaller) sublattice. S=1/2 junctions have delocalized states and decreasing spin densities with increasing N. S=1 junctions have four localized Sz=1/2 states at the end of each arm and centered on the junction, consistent with localized states in S=1 chains with finite Haldane gap. The GS of S=3/2 or 2 junctions of up to 500 spins is a spin density wave with increased amplitude at the ends of arms or near the junction. Quantum fluctuations completely suppress AF order in S=1/2 or 1 junctions, as well as in half-filled Hubbard junctions, but reduce rather than suppress AF order in S=3/2 or 2 junctions.

  13. Efficient density matrix renormalization group algorithm to study Y junctions with integer and half-integer spin

    KAUST Repository

    Kumar, Manoranjan; Parvej, Aslam; Thomas, Simil; Ramasesha, S.; Soos, Z. G.

    2016-01-01

    An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y junctions, systems with three arms of n sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new sites are always bonded to the most recently added sites and the superblock Hamiltonian contains only new or once renormalized operators. Junctions of up to N=3n+1≈500 sites are studied with antiferromagnetic (AF) Heisenberg exchange J between nearest-neighbor spins S or electron transfer t between nearest neighbors in half-filled Hubbard models. Exchange or electron transfer is exclusively between sites in two sublattices with NA≠NB. The ground state (GS) and spin densities ρr=⟨Szr⟩ at site r are quite different for junctions with S=1/2, 1, 3/2, and 2. The GS has finite total spin SG=2S(S) for even (odd) N and for MG=SG in the SG spin manifold, ρr>0(<0) at sites of the larger (smaller) sublattice. S=1/2 junctions have delocalized states and decreasing spin densities with increasing N. S=1 junctions have four localized Sz=1/2 states at the end of each arm and centered on the junction, consistent with localized states in S=1 chains with finite Haldane gap. The GS of S=3/2 or 2 junctions of up to 500 spins is a spin density wave with increased amplitude at the ends of arms or near the junction. Quantum fluctuations completely suppress AF order in S=1/2 or 1 junctions, as well as in half-filled Hubbard junctions, but reduce rather than suppress AF order in S=3/2 or 2 junctions.

  14. Why the Faulhaber Polynomials Are Sums of Even or Odd Powers of (n + 1/2)

    Science.gov (United States)

    Hersh, Reuben

    2012-01-01

    By extending Faulhaber's polynomial to negative values of n, the sum of the p'th powers of the first n integers is seen to be an even or odd polynomial in (n + 1/2) and therefore expressible in terms of the sum of the first n integers.

  15. A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

    Science.gov (United States)

    1993-09-01

    goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

  16. A new fractional nonlocal model and its application in free vibration of Timoshenko and Euler-Bernoulli beams

    Science.gov (United States)

    Rahimi, Zaher; Sumelka, Wojciech; Yang, Xiao-Jun

    2017-11-01

    The application of fractional calculus in fractional models (FMs) makes them more flexible than integer models inasmuch they can conclude all of integer and non-integer operators. In other words FMs let us use more potential of mathematics to modeling physical phenomena due to the use of both integer and fractional operators to present a better modeling of problems, which makes them more flexible and powerful. In the present work, a new fractional nonlocal model has been proposed, which has a simple form and can be used in different problems due to the simple form of numerical solutions. Then the model has been used to govern equations of the motion of the Timoshenko beam theory (TBT) and Euler-Bernoulli beam theory (EBT). Next, free vibration of the Timoshenko and Euler-Bernoulli simply-supported (S-S) beam has been investigated. The Galerkin weighted residual method has been used to solve the non-linear governing equations.

  17. Superfluid and insulating phases in an interacting-boson model: mean-field theory and the RPA

    International Nuclear Information System (INIS)

    Sheshadri, K.; Pandit, R.; Krishnamurthy, H.R.; Ramakrishnan, T.V.

    1993-01-01

    The bosonic Hubbard model is studied via a simple mean-field theory. At zero temperature, in addition to yielding a phase diagram that is qualitatively correct, namely a superfluid phase for non-integer fillings and a Mott transition from a superfluid to an insulating phase for integer fillings, this theory gives results that are in good agreement with Monte Carlo simulations. In particular, the superfluid fraction obtained as a function of the interaction strength U for both integer and non-integer fillings is close to the simulation results. In all phases the excitation spectra are obtained by using the random phase approximation (RPA): the spectrum has a gap in the insulating phase and is gapless (and linear at small wave vectors) in the superfluid phase. Analytic results are presented in the limits of large U and small superfluid density. Finite-temperature phase diagrams and the Mott-insulator-normal-phase crossover are also described. (orig.)

  18. On the Sum of Gamma Random Variates With Application to the Performance of Maximal Ratio Combining over Nakagami-m Fading Channels

    KAUST Repository

    Ansari, Imran Shafique

    2012-09-08

    The probability distribution function (PDF) and cumulative density function of the sum of L independent but not necessarily identically distributed gamma variates, applicable to maximal ratio combining receiver outputs or in other words applicable to the performance analysis of diversity combining receivers operating over Nakagami-m fading channels, is presented in closed form in terms of Meijer G-function and Fox H-bar-function for integer valued fading parameters and non-integer valued fading parameters, respectively. Further analysis, particularly on bit error rate via PDF-based approach, too is represented in closed form in terms of Meijer G-function and Fox H-bar-function for integer-order fading parameters, and extended Fox H-bar-function (H-hat) for non-integer-order fading parameters. The proposed results complement previous results that are either evolved in closed-form, or expressed in terms of infinite sums or higher order derivatives of the fading parameter m.

  19. Fractional-order devices

    CERN Document Server

    Biswas, Karabi; Caponetto, Riccardo; Mendes Lopes, António; Tenreiro Machado, José António

    2017-01-01

    This book focuses on two specific areas related to fractional order systems – the realization of physical devices characterized by non-integer order impedance, usually called fractional-order elements (FOEs); and the characterization of vegetable tissues via electrical impedance spectroscopy (EIS) – and provides readers with new tools for designing new types of integrated circuits. The majority of the book addresses FOEs. The interest in these topics is related to the need to produce “analogue” electronic devices characterized by non-integer order impedance, and to the characterization of natural phenomena, which are systems with memory or aftereffects and for which the fractional-order calculus tool is the ideal choice for analysis. FOEs represent the building blocks for designing and realizing analogue integrated electronic circuits, which the authors believe hold the potential for a wealth of mass-market applications. The freedom to choose either an integer- or non-integer-order analogue integrator...

  20. Addition and multiplication of beta-expansions in generalized Tribonacci base

    Directory of Open Access Journals (Sweden)

    Petr Ambrož

    2007-05-01

    Full Text Available We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x 3  - mx 2  - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in base β has no fractional part. We show that the number of fractional digits arising under addition of β-integers is at most 5 for m ≥ 3 and 6 for m = 2, whereas under multiplication it is at most 6 for all m ≥ 2. We thus generalize the results known for Tribonacci numeration system, i.e., for m = 1. We summarize the combinatorial properties of infinite words naturally defined by β-integers. We point out the differences between the structure of β-integers in cases m = 1 and m ≥ 2.

  1. Foundations of arithmetic differential geometry

    CERN Document Server

    Buium, Alexandru

    2017-01-01

    The aim of this book is to introduce and develop an arithmetic analogue of classical differential geometry. In this new geometry the ring of integers plays the role of a ring of functions on an infinite dimensional manifold. The role of coordinate functions on this manifold is played by the prime numbers. The role of partial derivatives of functions with respect to the coordinates is played by the Fermat quotients of integers with respect to the primes. The role of metrics is played by symmetric matrices with integer coefficients. The role of connections (respectively curvature) attached to metrics is played by certain adelic (respectively global) objects attached to the corresponding matrices. One of the main conclusions of the theory is that the spectrum of the integers is "intrinsically curved"; the study of this curvature is then the main task of the theory. The book follows, and builds upon, a series of recent research papers. A significant part of the material has never been published before.

  2. On the Sum of Gamma Random Variates With Application to the Performance of Maximal Ratio Combining over Nakagami-m Fading Channels

    KAUST Repository

    Ansari, Imran Shafique; Yilmaz, Ferkan; Alouini, Mohamed-Slim; Kucur, Oguz

    2012-01-01

    The probability distribution function (PDF) and cumulative density function of the sum of L independent but not necessarily identically distributed gamma variates, applicable to maximal ratio combining receiver outputs or in other words applicable to the performance analysis of diversity combining receivers operating over Nakagami-m fading channels, is presented in closed form in terms of Meijer G-function and Fox H-bar-function for integer valued fading parameters and non-integer valued fading parameters, respectively. Further analysis, particularly on bit error rate via PDF-based approach, too is represented in closed form in terms of Meijer G-function and Fox H-bar-function for integer-order fading parameters, and extended Fox H-bar-function (H-hat) for non-integer-order fading parameters. The proposed results complement previous results that are either evolved in closed-form, or expressed in terms of infinite sums or higher order derivatives of the fading parameter m.

  3. Negative dimensional integrals. Pt. 1

    International Nuclear Information System (INIS)

    Halliday, I.G.; Ricotta, R.M.

    1987-01-01

    We propose a new method of evaluating integrals based on negative dimensional integration. We compute Feynman graphs by considering analytic extensions. Propagators are raised to negative integer powers and integrated over negative integer dimensions. We are left with the problem of computing polynomial integrals and summing finite series. (orig.)

  4. Diophantine exponents for mildly restricted approximation

    DEFF Research Database (Denmark)

    Bugeaud, Yann; Kristensen, Simon

    We are studying the Diophantine exponent defined for integers and a vector by letting , where is the scalar product and denotes the distance to the nearest integer and is the generalised cone consisting of all vectors with the height attained among the first coordinates. We show that the exponent...

  5. Arithmetically Related Ideal Topologies and the Infinitude of Primes ...

    African Journals Online (AJOL)

    algebra. Mathematics Subject Classification (1991): 11N80, 11N25, 11A41, 11T99, 13A15, 20M25 Keywords: x-ideal, topological semigroup, ideal topology, infinitude of primes, generalized primes and integers, distribution, integers, specified multiplicative constraints, primes, ideals, multiplicative ideal theory, semigroup

  6. On the Local Minima of the Order of Appearance Function

    Directory of Open Access Journals (Sweden)

    Florian Luca

    2015-01-01

    Full Text Available The order of appearance z(n of the positive integer n is the smallest positive integer k such that n divides Fk, the kth member of the Fibonacci sequence. In this paper, we improve upon some results from (Marques, 2011 concerning local minima of z(n.

  7. There are many ways to spin a photon: Half-quantization of a total optical angular momentum.

    Science.gov (United States)

    Ballantine, Kyle E; Donegan, John F; Eastham, Paul R

    2016-04-01

    The angular momentum of light plays an important role in many areas, from optical trapping to quantum information. In the usual three-dimensional setting, the angular momentum quantum numbers of the photon are integers, in units of the Planck constant ħ . We show that, in reduced dimensions, photons can have a half-integer total angular momentum. We identify a new form of total angular momentum, carried by beams of light, comprising an unequal mixture of spin and orbital contributions. We demonstrate the half-integer quantization of this total angular momentum using noise measurements. We conclude that for light, as is known for electrons, reduced dimensionality allows new forms of quantization.

  8. Applications of Fast Truncated Multiplication in Cryptography

    Directory of Open Access Journals (Sweden)

    Laszlo Hars

    2006-12-01

    Full Text Available Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nα, with 1<α≤2, there is a truncated multiplication algorithm, which is constant times faster when computing a short enough truncated product. Applying these fast truncated multiplications, several cryptographic long integer arithmetic algorithms are improved, including integer reciprocals, divisions, Barrett and Montgomery multiplications, 2n-digit modular multiplication on hardware for n-digit half products. For example, Montgomery multiplication is performed in 2.6 Karatsuba multiplication time.

  9. Flow Formulation-based Model for the Curriculum-based Course Timetabling Problem

    DEFF Research Database (Denmark)

    Bagger, Niels-Christian Fink; Kristiansen, Simon; Sørensen, Matias

    2015-01-01

    problem. This decreases the number of integer variables signicantly and improves the performance compared to the basic formulation. It also shows competitiveness with other approaches based on mixed integer programming from the literature and improves the currently best known lower bound on one data...... instance in the benchmark data set from the second international timetabling competition.......In this work we will present a new mixed integer programming formulation for the curriculum-based course timetabling problem. We show that the model contains an underlying network model by dividing the problem into two models and then connecting the two models back into one model using a maximum ow...

  10. Binary GCD like Algorithms for Some Complex Quadratic Rings

    DEFF Research Database (Denmark)

    Agarwal, Saurabh; Frandsen, Gudmund Skovbjerg

    2004-01-01

    On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in where . Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case d=-19). Together with the earlier known b...

  11. Mathematical analysis of the global dynamics of a power law model ...

    African Journals Online (AJOL)

    We analyze a mathematical power law model that describes HIV infection of CD4+ T cells. We report that the number of critical points depends on , where is a positive integer. We show that for any positive integer the infection – free equilibrium is asymptotically stable if the reproduction number R0 1.

  12. Optimal Facility Location Tool for Logistics Battle Command (LBC)

    Science.gov (United States)

    2015-08-01

    64 Appendix B. VBA Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix C. Story...should city planners have located emergency service facilities so that all households (the demand) had equal access to coverage?” The critical...programming language called Visual Basic for Applications ( VBA ). CPLEX is a commercial solver for linear, integer, and mixed integer linear programming problems

  13. Stochastic massless fields I: Integer spin

    International Nuclear Information System (INIS)

    Lim, S.C.

    1981-04-01

    Nelson's stochastic quantization scheme is applied to classical massless tensor potential in ''Coulomb'' gauge. The relationship between stochastic potential field in various gauges is discussed using the case of vector potential as an illustration. It is possible to identify the Euclidean tensor potential with the corresponding stochastic field in physical Minkowski space-time. Stochastic quantization of massless fields can also be carried out in terms of field strength tensors. An example of linearized stochastic gravitational field in vacuum is given. (author)

  14. Investigating Integer Restrictions in Linear Programming

    Science.gov (United States)

    Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.

    2015-01-01

    Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…

  15. Parallel Integer Factorization Using Quadratic Forms

    National Research Council Canada - National Science Library

    McMath, Stephen S

    2005-01-01

    .... In 1975, Daniel Shanks used class group infrastructure to modify the Morrison-Brillhart algorithm and develop Square Forms Factorization, but he never published his work on this algorithm or provided...

  16. Discovering Binomial Identities with PascGaloisJE

    Science.gov (United States)

    Evans, Tyler J.

    2008-01-01

    We describe exercises in which students use PascGaloisJE to formulate conjectures about certain binomial identities which hold when the binomial coefficients are interpreted as elements in the cyclic group Z[subscript p] of integers modulo a prime integer "p". In addition to having an appealing visual component, these exercises are open-ended and…

  17. Coverage of space by random sets

    Indian Academy of Sciences (India)

    Consider the non-negative integer line. For each integer point we toss a coin. If the toss at location i is a. Heads we place an interval (of random length) there and move to location i + 1,. Tails we move to location i + 1. Coverage of space by random sets – p. 2/29 ...

  18. Bilevel programming problems theory, algorithms and applications to energy networks

    CERN Document Server

    Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya

    2015-01-01

    This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.

  19. Maybe it's not Python that sucks, maybe it's my code

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Did you know that in Python integers from -5 to 257 are preallocated? Reusing them 1000 times, instead of allocating memory for a bigger integer, saves a whopping 1 millisecond of code's execution time! Isn't that thrilling? Well, before you get that crazy, learn some basic performance tricks that you can start using today.

  20. Generalized Fermat equations: A miscellany

    NARCIS (Netherlands)

    Bennett, M.A.; Chen, I.; Dahmen, S.R.; Yazdani, S.

    2015-01-01

    This paper is devoted to the generalized Fermat equation xp + yq = zr, where p, q and r are integers, and x, y and z are nonzero coprime integers. We begin by surveying the exponent triples (p, q, r), including a number of infinite families, for which the equation has been solved to date, detailing