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.
Credit Documentation and the Mark 15 Subroutine
Energy Technology Data Exchange (ETDEWEB)
McAllister, J.E.
2001-08-16
This report documents the rewrite of the heat transfer subroutine. Part of the process of preparing the Mark 15 assembly for production operation is the development of thermal-hydraulic limits for the assembly. These limits require, among other items, the development of a Mark 15 assembly subroutine for the CREDIT code.
FORTRAN callable CAMAC standard subroutines. [Macro-11
Energy Technology Data Exchange (ETDEWEB)
Daniels, D.W.; Harrison, J.F.; Kozlowski, T.; Oothoudt, M.A.; Perry, D.G.
1979-01-01
An implementation of the COMPUTER AUTOMATED MEASUREMENTS AND CONTROL (CAMAC) Standard Subroutines is presented. CAMAC is a hardware protocol for designing devices in a standard format and lay-out. The standard subroutines represent an effort to carry the standardization of CAMAC over to the programming to facilitate the generation of unambiguous and portable programs. The routines are written in Macro-11 and are designed to be callable from the FORTRAN languages supported on the RSX systems, that is, 11/M and 11/D. Four levels of subroutines are defined--Levels A, B, C, and system dependent. Level A, the simplist, consists of the primary subroutines. They provide the ability to define the CAMAC address of a CAMAC entity and the desired access to it. Level B provide single-action routines. Level C allows block transfers, multiple actions, and inverse declarations. The system dependent routines allow the programmer the flexibility to take advantage of the particular computer system that is being used. Segregating the computer specific routines allows the programmer, when necessary, to write truly portable programs that will be usable on any computer system that adheres to the standard.
Robust C subroutines for non-linear optimization
DEFF Research Database (Denmark)
Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun
2004-01-01
This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems. The intention is that the routines should use the currently best algorithms available. All routines have standardized calls, and the user does not have...... by changing 1 to 0. The present report is a new and updated version of a previous report NI-91-03 with the same title, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated from Fortran to C. The reason for writing the present report is that some...... of the C subroutines have been replaced by more effective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modi ed to some extent. For a description of the original Fortran subroutines see the report [17]. The software...
A SINDA '85 nodal heat transfer rate calculation user subroutine
Cheston, Derrick J.
1992-01-01
This paper describes a subroutine, GETQ, which was developed to compute the heat transfer rates through all conductors attached to a node within a SINDA '85 thermal submodel. The subroutine was written for version 2.3 of SINDA '85. Upon calling GETQ, the user supplies the submodel name and node number which the heat transfer rate computation is desired. The returned heat transfer rate values are broken down into linear, nonlinear, source and combined heat loads.
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.
Symbolic Arithmetic and Integer Factorization
Lomonaco, Samuel J.
2013-01-01
In this paper, we create a systematic and automatic procedure for transforming the integer factorization problem into the problem of solving a system of Boolean equations. Surprisingly, the resulting system of Boolean equations takes on a "life of its own" and becomes a new type of integer, which we call a generic integer. We then proceed to use the newly found algebraic structure of the ring of generic integers to create two new integer factoring algorithms, called respectively the Boolean f...
Integer and combinatorial optimization
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
DYNSTALL: Subroutine package with a dynamic stall model
Energy Technology Data Exchange (ETDEWEB)
Bjoerck, Anders [Aeronautical Research Inst. of Sweden, Bromma (Sweden)
2001-03-01
A subroutine package, called DYNSTALL, for the calculation of 2D unsteady airfoil aerodynamics is described. The subroutines are written in FORTRAN. DYNSTALL is basically an implementation of the Beddoes-Leishman dynamic stall model. This model is a semi-empirical model for dynamic stall. It includes, however, also models for attached flow unsteady aerodynamics. It is complete in the sense that it treats attached flow as well as separated flow. Semi-empirical means that the model relies on empirically determined constants. Semi because the constants are constants in equations with some physical interpretation. It requires the input of 2D airfoil aerodynamic data via tables as function of angle of attack. The method is intended for use in an aeroelastic code with the aerodynamics solved by blade/element method. DYNSTALL was written to work for any 2D angles of attack relative to the airfoil, e.g. flow from the rear of an airfoil.
Quantum computing with black-box quantum subroutines
Energy Technology Data Exchange (ETDEWEB)
Thompson, Jayne [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Gu, Mile [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing (China); Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Modi, Kavan [School of Physics, Monash University, Clayton, Victoria 3800 (Australia); Vedral, Vlatko [Department of Physics, University of Oxford, Clarendon Laboratory, Oxford, OX1 3PU (United Kingdom); Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117543 Singapore (Singapore); Department of Physics, National University of Singapore, 2 Science Drive 3, 117551 Singapore (Singapore)
2014-07-01
In classical computation a subroutine is treated as a black box and we do not need to know its exact physical implementation to use it. A complex problem can be decomposed into smaller problems using such modularity. We show that quantum mechanically applying an unknown quantum process as a subroutine is impossible, and this restricts computation models such as DQC1 from operating on unknown inputs. We present a method to avoid this situation for certain computational problems and apply to a modular version of Shor's factoring algorithm. We examine how quantum entanglement and discord fare in this implementation. In this way we are able to study the role of discord in Shor's factoring algorithm.
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
BLAS (Basic Linear Algebra Subroutines), Linear Algebra Modules and Supercomputers.
1984-12-31
Linear Algebra Subroutines (BLAS) and linear algebra software modules in general. The need for these extensions and new sets of modules is largely due...potential computin .p"er. The participants represented most active groups in ilecar algebral , ware an were about equally divided among industry...discussions. Section 2 describes seven proposals for linear algebra software modules and Sec- tion 3 describes four presentations on the use of such
Which Positive Integers are Interesting?
Indian Academy of Sciences (India)
Keywords. Interesting positive integers; idoneal numbers; Carmichael numbers; Wieferich primes; Mersenne primes; Fermat primes; Bernoulli numbers; Kaprekar constant; Skewes constants; look-and-say sequence; Graham's constant.
Radiology PRICER 2. 0 subroutines for RADMAIN and RADPRICE. Software
Energy Technology Data Exchange (ETDEWEB)
Kowaleski, R.
1989-04-01
RADMAIN is a driver program provided for installation testing of PRICER 2.0. The format of the tape accompanying the form is 6250-BPI, 9-track, standard-label multifile tape. The six files contained on the tape are: RADMAIN - Driver program - COBOL vs source code; RADPRICE - Radiology Pricing subroutine; RADPROV - COBOL vs source code - Providers with carriers and localities; RADHCPCS - Radiology HCPCS codes; RADPREV - Prevailing charges and Fee Schedule amounts for Radiology; BILL - Radiology Bill Test File. Software Description: The software is written in the COBOL language for use on IBM 3090-500E using XA operating system.
Robust non-gradient C subroutines for non-linear optimization
DEFF Research Database (Denmark)
Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun
2004-01-01
This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems, where gradient information is not required. The intention is that the routines should use the currently best algorithms available. All routines have...... subroutines are obtained by changing 0 to 1. The present report is a new and updated version of a previous report NI-91-04 with the title Non-gradient c Subroutines for Non- Linear Optimization, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated...... from Fortran to C. The reason for writing the present report is that some of the C subroutines have been replaced by more e ective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modified to some extent...
Frahm, K. M.; Chepelianskii, A. D.; Shepelyansky, D. L.
2012-10-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.
Airport Landside. Volume V. Appendix B. ALSIM Subroutines.
1982-06-01
curbside facility number J is assigned to L. Facility number ITEMPI is calculated from INDEXF(8)+L. The storage number M is calculated from EPOCS +L-I. The...custom, B-2-22 ... . ... .. .I - [ . ... d .. GROUND TRANSPORT MODE S.t TV2 to IV UE(21i .. rt..r of pax b. Ing mt lor random $at 4 toIVX- 41 PW...RCARO.BAGCO.OPLCO,CHEK2,CHEK3,CGTRO.ERROR.SECUO.TRX99 00C23C00 IN7EGFR CTQL0.CTRLI 00024000 INTEC.EA.4 DPDPS.DPQCS.EPDPS, EPOCS C00250OO INTEGER-2 IDI’AI
Tree morphisms, transducers, and integer sequences
Sunic, Zoran
2006-01-01
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms (length and prefix preserving transformations of words). Transducer integer sequences are related to the notion of self-similar groups and semigroups, as well as to the notion of automatic sequences.
Automated Reuse of Scientific Subroutine Libraries through Deductive Synthesis
Lowry, Michael R.; Pressburger, Thomas; VanBaalen, Jeffrey; Roach, Steven
1997-01-01
Systematic software construction offers the potential of elevating software engineering from an art-form to an engineering discipline. The desired result is more predictable software development leading to better quality and more maintainable software. However, the overhead costs associated with the formalisms, mathematics, and methods of systematic software construction have largely precluded their adoption in real-world software development. In fact, many mainstream software development organizations, such as Microsoft, still maintain a predominantly oral culture for software development projects; which is far removed from a formalism-based culture for software development. An exception is the limited domain of safety-critical software, where the high-assuiance inherent in systematic software construction justifies the additional cost. We believe that systematic software construction will only be adopted by mainstream software development organization when the overhead costs have been greatly reduced. Two approaches to cost mitigation are reuse (amortizing costs over many applications) and automation. For the last four years, NASA Ames has funded the Amphion project, whose objective is to automate software reuse through techniques from systematic software construction. In particular, deductive program synthesis (i.e., program extraction from proofs) is used to derive a composition of software components (e.g., subroutines) that correctly implements a specification. The construction of reuse libraries of software components is the standard software engineering solution for improving software development productivity and quality.
Integer-valued trawl processes
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole E.; Lunde, Asger; Shephard, Neil
2014-01-01
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...... 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...
A Euclidean algorithm for integer matrices
DEFF Research Database (Denmark)
Lauritzen, Niels; Thomsen, Jesper Funch
2015-01-01
We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers.......We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers....
Computer subroutines for estimation of human exposure to radiation in low Earth orbit
Cucinotta, F. A.; Wilson, J. W.
1985-01-01
Computer subroutines to calculate human exposure to trapped radiations in low Earth orbit (LEO) on the basis of a simple approximation of the human geometry by spherical shell shields of varying thickness are presented and detailed. The subroutines calculate the dose to critical body organs and the fraction of exposure limit reached as a function of altitude of orbit, degree of inclination, shield thickness, and days in mission. Exposure rates are compared with current exposure limits.
Computer subroutine for estimating aerodynamic blade loads on Darrieus vertical axis wind turbines
Sullivan, W. N.; Leonard, T. M.
1980-11-01
An important aspect of structural design of the Darrieus rotor is the determination of aerodynamic blade loads. A load generator was used for quasi-static and dynamic rotor analyses. The generator is based on the single streamtube aerodynamic flow model and is constructed as a FORTRAN IV subroutine to facilitate its use in finite element structural models. Input and output characteristics of the subroutine are described and a complete listing is attached as an appendix.
Integer programming theory, applications, and computations
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
Fast resolution of integer Vandermonde systems
Directory of Open Access Journals (Sweden)
Rosa di Salvo
2014-10-01
Full Text Available The resolution of polynomial interpolation problems with integer coefficients directly involves the open issue of the integer inversion of a general Vandermonde matrix defined over the field Z/pZ, for p prime number. The purpose of this paper is to demonstrate the possibility to invert a Vandermonde matrix with integer mod p coefficients and exactly compute the integer inverse matrix in the ring Mat(Z/pZ of square matrices over Z/pZ through the new fast algorithm InVanderMOD. The explicit formula derived for the integer inversion of Vandermonde matrices entirely develops inside the field of the integers mod p, with due consideration to the operation of integer division. The inversion procedure InVanderMOD is valid for any prime number p and competitive in terms of computational effort, since its computational cost is less than O(n^3.
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...... linear span. The result shows that there are no conditional quasi-greedy basis of integer translates in a finitely generated shift invariant space....
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...... linear span. The result shows that there are no conditional quasi-greedy bases of integer translates in a finitely generated shift-invariant space....
Applied Integer Programming Modeling and Solution
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
Integer computation of lossy JPEG2000 compression.
Balster, Eric J; Fortener, Benjamin T; Turri, William F
2011-08-01
In this paper, an integer-based Cohen-Daubechies-Feauvea (CDF) 9/7 wavelet transform as well as an integer quantization method used in a lossy JPEG2000 compression engine is presented. The conjunction of both an integer transform and quantization step allows for a complete integer computation of lossy JPEG2000 compression. The lossy method of compression utilizes the CDF 9/7 wavelet filter, which transforms integer input pixel values into floating-point wavelet coefficients that are then quantized back into integers and finally compressed by the embedded block coding with optimal truncation tier-1 encoder. Integer computation of JPEG2000 allows a reduction in computational complexity of the wavelet transform as well as ease of implementation in embedded systems for higher computational performance. The results of the integer computation show an equivalent rate/distortion curve to the JasPer JPEG2000 compression engine, as well as a 30% reduction in computation time of the wavelet transform and a 56% reduction in computation time of the quantization processing on an average.
Positive Integer Solutions of Certain Diophantine Equations
Indian Academy of Sciences (India)
29
An important area of number theory is devoted to finding solutions of equations where the solutions are restricted to the set of integers. Diophantine equations get their name from Diophantus of. Alexandria and they are algebraic equations for which rational or integer solutions are sought. Many researchers considered the ...
7 CRITERIA FOR INTEGER SEQUENCES BEING GRAPHIC
SIERKSMA, G
Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as degree sequence. One of the criteria leads to a new and constructive proof of the well-known criterion of Erdos-Gallai.
On a correlational clustering of integers
Aszalós, László; Hajdu, Lajos; Pethő, Attila
2016-01-01
Correlation clustering is a concept of machine learning. The ultimate goal of such a clustering is to find a partition with minimal conflicts. In this paper we investigate a correlation clustering of integers, based upon the greatest common divisor.
Examples of non integer dimensional geometries
Trinchero, R.
2008-01-01
Two examples of spectral triples with non-integer dimension spectrum are considered. These triples involve commutative C*-algebras. The first example has complex dimension spectrum and trivial differential algebra. The other is a parameter dependent deformation of the canonical spectral triple over S1. Its dimension spectrum includes real non-integer values. It has a non-trivial differential algebra and in contrast with the one dimensional case there are no junk forms for a non-vanishing defo...
Advanced finite element simulation with MSC Marc application of user subroutines
Javanbakht, Zia
2017-01-01
This book offers an in-depth insight into the general-purpose finite element program MSC Marc, which is distributed by MSC Software Corporation. It is a specialized program for nonlinear problems (implicit solver) which is common in academia and industry. The primary goal of this book is to provide a comprehensive introduction to a special feature of this software: the user can write user-subroutines in the programming language Fortran, which is the language of all classical finite element packages. This subroutine feature allows the user to replace certain modules of the core code and to implement new features such as constitutive laws or new elements. Thus, the functionality of commercial codes (‘black box’) can easily be extended by linking user written code to the main core of the program. This feature allows to take advantage of a commercial software package with the flexibility of a ‘semi-open’ code. .
Fitting: Subroutine to fit four-moment probability distributions to data
Energy Technology Data Exchange (ETDEWEB)
Winterstein, S.R.; Lange, C.H.; Kumar, S. [Stanford Univ., CA (United States)
1995-01-01
FITTING is a Fortran subroutine that constructs a smooth, generalized four-parameter probability distribution model. It is fit to the first four statistical moments of the random variable X (i.e., average values of X, X{sup 2}, X{sup 3}, and X{sup 4}) which can be calculated from data using the associated subroutine CALMOM. The generalized model is produced from a cubic distortion of the parent model, calibrated to match the first four moments of the data. This four-moment matching is intended to provide models that are more faithful to the data in the upper tail of the distribution. Examples are shown for two specific cases.
Asymptotic prime partitions of integers
Bartel, Johann; Bhaduri, R. K.; Brack, Matthias; Murthy, M. V. N.
2017-05-01
In this paper, we discuss P (n ) , the number of ways a given integer n may be written as a sum of primes. In particular, an asymptotic form Pas(n ) valid for n →∞ is obtained analytically using standard techniques of quantum statistical mechanics. First, the bosonic partition function of primes, or the generating function of unrestricted prime partitions in number theory, is constructed. Next, the density of states is obtained using the saddle-point method for Laplace inversion of the partition function in the limit of large n . This gives directly the asymptotic number of prime partitions Pas(n ) . The leading term in the asymptotic expression grows exponentially as √{n /ln(n ) } and agrees with previous estimates. We calculate the next-to-leading-order term in the exponent, proportional to ln[ln(n )]/ln(n ) , and we show that an earlier result in the literature for its coefficient is incorrect. Furthermore, we also calculate the next higher-order correction, proportional to 1 /ln(n ) and given in Eq. (43), which so far has not been available in the literature. Finally, we compare our analytical results with the exact numerical values of P (n ) up to n ˜8 ×106 . For the highest values, the remaining error between the exact P (n ) and our Pas(n ) is only about half of that obtained with the leading-order approximation. But we also show that, unlike for other types of partitions, the asymptotic limit for the prime partitions is still quite far from being reached even for n ˜107 .
Development of a CMAQ Subroutine for Wind-blown Dust Emission Calculation
Park, S.
2011-12-01
A subroutine for calculating the wind-blown dust emission in the framework of the Community Multiscale Air Quality Modeling System (CMAQ) has been developed. This new subroutine, called WDEMIS, is analogous in its use to the recently added sea-salt emission subroutine SSEMIS. To make use of WDEMIS, the subroutine AERO_EMIS has to be modified so that WDEMIS (just like SSEMIS) is called by AERO_EMIS. The threshold friction velocity for smooth dry surface, the drag partitioning effect by non-erodible surface roughness elements, the soil moisture effect, the positive feedback of the saltating soil particles to the friction velocity, the saltation scheme calculating the horizontal soil flux, and the sandblasting scheme calculating the vertical dust emission flux are accounted for in WDEMIS. In order to supply soil characteristics required for wind-blown dust emission calculation, i.e., soil moisture content, land use fraction, and soil texture, the Pleim-Xiu land-surface model [Xiu and Pleim, 2001] is used by the Fifth-Generation NCAR/Penn State Mesoscale Model (MM5) combined with MCIP version 3.6. CMAQ modelling using WDEMIS was performed to simulate an Asian dust storm episode that occurred in April 2006 to evaluate the wind-blown dust emission prediction by WDEMIS. Sensitivity analysis showed that the accuracy of land use data and soil property supplied to WDEMIS is critical to performance of WDEMIS. Appropriate size fractioning is considered one of the most important improvement required in the future. Xiu, A., and J.E. Pleim, Development of a land surface model. Part I: Application in a mesoscale meteorology model, Journal of Applied Meteorology, 40, 192-209, 2001.
Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers
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…
Linear and integer programming made easy
Hu, T C
2016-01-01
Linear and integer programming are fundamental toolkits for data and information science and technology, particularly in the context of today’s megatrends toward statistical optimization, machine learning, and big data analytics. Drawn from over 30 years of classroom teaching and applied research experience, this textbook provides a crisp and practical introduction to the basics of linear and integer programming. The authors’ approach is accessible to students from all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification, and computer vision. Readers will learn to cast hard combinatorial problems as mathematical programming optimizations, understand how to achieve formulations where the objective and constraints are linear, choose appropriate solution methods, and interpret results appropriately. •Provides a concise introduction to linear and integer programming, appropriate for undergraduates, graduates, a short cours...
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.
Integer Set Compression and Statistical Modeling
DEFF Research Database (Denmark)
Larsson, N. Jesper
2014-01-01
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......, and discuss general properties and possibilities for this class of compression problem....
Integer representations of convex polygon intersection graphs
Müller, T.; van Leeuwen, E.J.; van Leeuwen, J.
2013-01-01
We determine tight bounds on the smallest-size integer grid needed to represent the n-node intersection graphs of a convex polygon P with P given in rational coordinates. The intersection graphs use only polygons that are geometrically similar to P (translates or homothets) and must be represented
Fourth Power Diophantine Equations in Gaussian Integers
Indian Academy of Sciences (India)
25
Fourth Power Diophantine Equations in Gaussian. Integers. Farzali Izadi · Rasool Naghdali. Forooshani · Amaneh Amiryousefi. Varnousfaderani . Received: date / Accepted: date. Abstract In this paper we examine a class of fourth power Diophantine equa- tions of the form x4 + kx2y2 + y4 = z2 and ax4 + by4 = cz2, in the ...
Indian Academy of Sciences (India)
Shailesh A Shirali. Keywords. Bernoulli numbers, Bernoulli polynomials, power sums, tele- scoping. For non-negative integers k, n, let P k. (n) denote the sum. 1k + 2k + . ..... 1) C om pute the integral R n. 0k ¢P k ¡1. (x )dx . ..... [6] B Sury, Bernoulli Numbers and the Riemann Zeta Function, Resonance, July 2003; available at:.
Encrypted integer division and secure comparison
Veugen, P.J.M.
2014-01-01
When processing data in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol between the client and the server and will be relatively expensive. We present new solutions for
Division Unit for Binary Integer Decimals
DEFF Research Database (Denmark)
Lang, Tomas; Nannarelli, Alberto
2009-01-01
In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm and implements binary encodings (binary integer decimal or BID) for significands. Recent decimal division designs are all based on the binary coded decimal (BCD) encoding. We adapt the radix-10 digit...
How to Differentiate an Integer Modulo n
Emmons, Caleb; Krebs, Mike; Shaheen, Anthony
2009-01-01
A number derivative is a numerical mapping that satisfies the product rule. In this paper, we determine all number derivatives on the set of integers modulo n. We also give a list of undergraduate research projects to pursue using these maps as a starting point.
XSNQ-U: a non-LTE emission and absorption coefficient subroutine
Energy Technology Data Exchange (ETDEWEB)
Lokke, W.A.; Grasberger, W.H.
1977-01-06
This report describes the non-LTE atomic-state computer program, XSNQ-U. The original classified report was issued in 1971. Since then, important changes and improvements have been included. XSNQ-U provides frequency-dependent emission and absorption coefficients for a material not in LTE (local thermodynamic equilibrium). As in XSNB, an LTE opacity subroutine, a compromise was sought between accuracy and computer speed. The result, XSNQ-U, is intended for use as a subroutine in any transport code. This report surveys the basic non-LTE equations for the average ion model, as pioneered by Grasberger (UCRL-12408 and -5135), and gives details for the approximations and technique used in XSNQ-U. Also included are some illustrative numerical examples. Since the writing of the classified report, the code has been modified to handle the case of multiple elements. The extension is straight forward; the notation of this report would only be more cumbersome if the single-element notation were replaced by the multiple-element notation. Also, the method of solving the rate equations by using analytical differentials as discussed in the classified report was replaced by a more direct incremental differences scheme, which is discussed in the present version. 12 figures, 2 tables.
Integer programming, lattices, and results in fixed dimension
K. Aardal (Karen); F. Eisenbrand
2004-01-01
textabstractWe review and describe several results regarding integer programming problems in fixed dimension. First, we describe various lattice basis reduction algorithms that are used as auxiliary algorithms when solving integer feasibility and optimization problems. Next, we review three
Integer least-squares theory for the GNSS compass
Teunissen, P.J.G.
2010-01-01
Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to highprecision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) theory for the GNSS compass model, together with efficient integer search
Radiology PRICER 2. 0 subroutine installation guide, Volume 1 and Volume 2
Energy Technology Data Exchange (ETDEWEB)
Kowaleski, R.
1989-04-01
Radiology pricing subroutine (PRICER 2.0) is furnished by the Health Care Financing Administration to process the payment of Outpatient Medicare claims with discharges on or after April 1, 1989. Volumes 1 and 2 contain the installation and operation guidelines necessary to install PRICER 2.0 in an IBM 3090 environment. The installation requires that the receiver be familiar with COBOL/VS, OS JCL, and that an interface module has been previously installed. The installation tape contains the program source code and data files necessary to completely install Radiology PRICER 2.0. Volume 2 contains Appendix A through G: Appendix A - RADMAIN (driver) source listing; Appendix B - RADPRICE source listing; Appendix C - listing of the Provider File; Appendix D - listing of the HCPCS Code File; Appendix E - listing of the Prevailing Charge/Fee Schedule File; Appendix F - listing of the bill test file; Appendix G - listing of the expected test results.
Comparison of DT neutron production codes MCUNED, ENEA-JSI source subroutine and DDT
Energy Technology Data Exchange (ETDEWEB)
Čufar, Aljaž, E-mail: aljaz.cufar@ijs.si [Reactor Physics Department, Jožef Stefan Institute, Jamova cesta 39, SI-1000 Ljubljana (Slovenia); Lengar, Igor; Kodeli, Ivan [Reactor Physics Department, Jožef Stefan Institute, Jamova cesta 39, SI-1000 Ljubljana (Slovenia); Milocco, Alberto [Culham Centre for Fusion Energy, Culham Science Centre, Abingdon, OX14 3DB (United Kingdom); Sauvan, Patrick [Departamento de Ingeniería Energética, E.T.S. Ingenieros Industriales, UNED, C/Juan del Rosal 12, 28040 Madrid (Spain); Conroy, Sean [VR Association, Uppsala University, Department of Physics and Astronomy, PO Box 516, SE-75120 Uppsala (Sweden); Snoj, Luka [Reactor Physics Department, Jožef Stefan Institute, Jamova cesta 39, SI-1000 Ljubljana (Slovenia)
2016-11-01
Highlights: • Results of three codes capable of simulating the accelerator based DT neutron generators were compared on a simple model where only a thin target made of mixture of titanium and tritium is present. Two typical deuteron beam energies, 100 keV and 250 keV, were used in the comparison. • Comparisons of the angular dependence of the total neutron flux and spectrum as well as the neutron spectrum of all the neutrons emitted from the target show general agreement of the results but also some noticeable differences. • A comparison of figures of merit of the calculations using different codes showed that the computational time necessary to achieve the same statistical uncertainty can vary for more than 30× when different codes for the simulation of the DT neutron generator are used. - Abstract: As the DT fusion reaction produces neutrons with energies significantly higher than in fission reactors, special fusion-relevant benchmark experiments are often performed using DT neutron generators. However, commonly used Monte Carlo particle transport codes such as MCNP or TRIPOLI cannot be directly used to analyze these experiments since they do not have the capabilities to model the production of DT neutrons. Three of the available approaches to model the DT neutron generator source are the MCUNED code, the ENEA-JSI DT source subroutine and the DDT code. The MCUNED code is an extension of the well-established and validated MCNPX Monte Carlo code. The ENEA-JSI source subroutine was originally prepared for the modelling of the FNG experiments using different versions of the MCNP code (−4, −5, −X) and was later extended to allow the modelling of both DT and DD neutron sources. The DDT code prepares the DT source definition file (SDEF card in MCNP) which can then be used in different versions of the MCNP code. In the paper the methods for the simulation of the DT neutron production used in the codes are briefly described and compared for the case of a
Bivium as a Mixed Integer Programming Problem
DEFF Research Database (Denmark)
Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias
2009-01-01
Trivium is a stream cipher proposed for the eSTREAM project. Raddum introduced some reduced versions of Trivium, named Bivium A and Bivium B. In this article we present a numerical attack on the Biviums. The main idea is to transform the problem of solving a sparse system of quadratic equations...... 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...
Garbageless reversible implementation of integer linear transformations
DEFF Research Database (Denmark)
Burignat, Stéphane; Vermeirsch, Kenneth; De Vos, Alexis
2013-01-01
Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible digital implementations of different integer transformations on four...... inputs. The resulting reversible circuit is able to perform both the forward transform and the inverse transform. Which of the two computations that actually is performed, simply depends on the orientation of the circuit when it is inserted in a computer board (if one takes care to provide...
How Powerful Are Integer-Valued Martingales?
Bienvenu, Laurent; Stephan, Frank; Teutsch, Jason
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale (strategy) can win an infinite amount of money by betting on the values of the bits of X. In the classical model, the martingales considered are real-valued, that is, the bets made by the martingale can be arbitrary real numbers. In this paper, we investigate a more restricted model, where only integer-valued martingales are considered, and we study the class of random sequences induced by this model.
Multiplicity of summands in the random partitions of an integer
Indian Academy of Sciences (India)
Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, ... probability that there is a summand of multiplicity j in any randomly chosen partition or ... Introduction. 1.1 Integer partitions. Let n ≥ 1 be any integer and let n = a1 +a2 +···+am for some m ≥ 1 and some positive integers {ai }m i=1. We define the set {a1 ...
Validation of the AeroDyn subroutines using NREL unsteady aerodynamics experimental data
Energy Technology Data Exchange (ETDEWEB)
Laino, D.J.; Hansen, A.C.; Minnema, J.E. [Windward Engineering, Salt Lake City, UT (United States)
2002-07-01
Completion of the full-scale wind tunnel tests of the NREL Unsteady Aerodynamics Experiment (UAE) phase VI allowed validation of the AeroDyn wind turbine aerodynamics software to commence. Detailed knowledge of the inflow to the UAE was the bane of prior attempts to accomplish any in-depth validation in the past. The wind tunnel tests permitted unprecedented control and measurement of inflow to the UAE rotor. The data collected from these UAE tests are currently under investigation as part of an effort to better understand wind turbine rotor aerodynamics in order to improve aeroelastic modelling techniques. Preliminary results from this study using the AeroDyn subroutines are presented, pointing to several avenues towards improvement. Test data indicate that rotational effects cause more static stall delay over a larger portion of the blades than predicted by current methods. Despite the relatively stiff properties of the UAE, vibration modes appear to influence the aerodynamic forces and system loads. AeroDyn adequately predicts dynamic stall hysteresis loops when appropriate steady, 2D aerofoil tables are used. Problems encountered include uncertainties in converting measured inflow angle to angle of attack for the UAE phase VI. Future work is proposed to address this angle-of-attack problem and to analyse a slightly more complex dynamics model that incorporates some of the structural vibration modes evident in the test data. (author)
FPSPACK: a package of FORTRAN subroutines to manage earthquake focal mechanism data
Gasperini, Paolo; Vannucci, Gianfranco
2003-08-01
Earthquakes fault plane solutions (FPSs) are routinely computed on the basis of various techniques and are reported in the literature with a wide range of formats and conventions. Although the equations relating the various parameters are well known and relatively simple, their practical application often arise to numerical singularities and indeterminations that sometimes are not well known by the authors and thus may result in wrong or inaccurate reporting of parameters. Such inaccuracies and mistakes affect about 40% of the published data we have examined to test our programs. Moreover the current use, in the seismological community, of at least two different coordinate systems to represent the Cartesian components of vectorial and tensorial quantities is a further cause of confusion. In order to simplify the management of such data, we have prepared a structured package of FORTRAN 77 subroutines performing almost all of the possible computations and conversions among different parameters and coordinate systems. The package has been extensively tested with the data of a revised database of FPS of Italy and surrounding regions (presented in a companion paper) as well as of CMT solutions included in the Harvard catalog.
Network interdiction and stochastic integer programming
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....
Stability in random Boolean cellular automata on the integer lattice
A.C. Fey (Anne); L. van Driel; F.M. Dekking
2010-01-01
htmlabstractWe consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one of the sixteen possible Boolean rules,
Multi-start approach for an integer determinant maximization problem
Sotirov, R.; Terlaky, T.
2013-01-01
In this article, we present a multi-start approach to solve a determinant maximization problem of an integer matrix variable that has a constant trace. In order to enforce that elements of the matrix variable are integer, we add a nonlinear repeller term to the objective function. To solve this
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 ...
A fixed recourse integer programming approach towards a ...
African Journals Online (AJOL)
Abstract. 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 cer- tainty assumptions of an integer linear program application ...
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...
Anyons in Integer Quantum Hall Magnets
Directory of Open Access Journals (Sweden)
Armin Rahmani
2013-08-01
Full Text Available Strongly correlated fractional quantum Hall liquids support fractional excitations, which can be understood in terms of adiabatic flux insertion arguments. A second route to fractionalization is through the coupling of weakly interacting electrons to topologically nontrivial backgrounds such as in polyacetylene. Here, we demonstrate that electronic fractionalization combining features of both these mechanisms occurs in noncoplanar itinerant magnetic systems, where integer quantum Hall physics arises from the coupling of electrons to the magnetic background. The topologically stable magnetic vortices in such systems carry fractional (in general, irrational electronic quantum numbers and exhibit Abelian anyonic statistics. We analyze the properties of these topological defects by mapping the distortions of the magnetic texture onto effective non-Abelian vector potentials. We support our analytical results with extensive numerical calculations.
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-04-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.
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.
Discrete Dirac equation on a finite half-integer lattice
Smalley, L. L.
1986-01-01
The formulation of the Dirac equation on a discrete lattice with half-integer spacing and periodic boundary conditions is investigated analytically. The importance of lattice formulations for problems in field theory and quantum mechanics is explained; the concept of half-integer Fourier representation is introduced; the discrete Dirac equation for the two-dimensional case is derived; dispersion relations for the four-dimensional case are developed; and the spinor formulation for the Dirac fields on the half-integer lattice and the discrete time variable for the four-dimensional time-dependent Dirac equation are obtained. It is argued that the half-integer lattice, because it takes the Dirac Lagrangian into account, is more than a mere relabeling of the integer lattice and may have fundamental physical meaning (e.g., for the statistics of fermions). It is noted that the present formulation does not lead to species doubling, except in the continuum limit.
Real Time Speed Control of a DC Motor Based on its Integer and Non-Integer Models Using PWM Signal
Directory of Open Access Journals (Sweden)
A. W. Nasir
2017-10-01
Full Text Available This paper exploits the advantage of non-integer order modeling of a process over integer order, in those cases where the process model is required for control purpose. The present case deals with speed control of a DC motor. Based on the real time open loop response, DC motor is being modeled as integer and non-integer order first order plus delay system. Both these models are then separately used for determining two sets of Proportional-Integral-Derivative (PID controller parameters through Ziegler Nichols (ZN closed loop tuning method. In addition to this, a model based control technique i.e. Internal Model Control (IMC is also implemented using both integer and non-integer model respectively. For carrying out the real time speed control of DC motor, LabVIEW platform has been used. After going through the results, it is observed that the controller performance considerably improves, if non-integer order model is used for controller design rather than integer order model.
Mixed-Integer Constrained Optimization Based on Memetic Algorithm
Directory of Open Access Journals (Sweden)
Y. C. Lin
2013-03-01
Full Text Available Evolutionary algorithms (EAs are population-based global search methods. They have been successfully applied tomany complex optimization problems. However, EAs are frequently incapable of finding a convergence solution indefault of local search mechanisms. Memetic Algorithms (MAs are hybrid EAs that combine genetic operators withlocal search methods. With global exploration and local exploitation in search space, MAs are capable of obtainingmore high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE, as an EA-basedsearch algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, amemetic algorithm based on MIHDE is developed for solving mixed-integer optimization problems. However, most ofreal-world mixed-integer optimization problems frequently consist of equality and/or inequality constraints. In order toeffectively handle constraints, an evolutionary Lagrange method based on memetic algorithm is developed to solvethe mixed-integer constrained optimization problems. The proposed algorithm is implemented and tested on twobenchmark mixed-integer constrained optimization problems. Experimental results show that the proposed algorithmcan find better optimal solutions compared with some other search algorithms. Therefore, it implies that the proposedmemetic algorithm is a good approach to mixed-integer optimization problems.
Mixed-Integer Constrained Optimization Based on Memetic Algorithm
Directory of Open Access Journals (Sweden)
Y.C. Lin
2013-04-01
Full Text Available Evolutionary algorithms (EAs are population-based global search methods. They have been successfully applied to many complex optimization problems. However, EAs are frequently incapable of finding a convergence solution in default of local search mechanisms. Memetic Algorithms (MAs are hybrid EAs that combine genetic operators with local search methods. With global exploration and local exploitation in search space, MAs are capable of obtaining more high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE, as an EA-based search algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, a memetic algorithm based on MIHDE is developed for solving mixed-integer optimization problems. However, most of real-world mixed-integer optimization problems frequently consist of equality and/or inequality constraints. In order to effectively handle constraints, an evolutionary Lagrange method based on memetic algorithm is developed to solve the mixed-integer constrained optimization problems. The proposed algorithm is implemented and tested on two benchmark mixed-integer constrained optimization problems. Experimental results show that the proposed algorithm can find better optimal solutions compared with some other search algorithms. Therefore, it implies that the proposed memetic algorithm is a good approach to mixed-integer optimization problems.
Diversity and non-integer differentiation for system dynamics
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
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.
Integer lattice dynamics for Vlasov-Poisson
Mocz, Philip; Succi, Sauro
2017-03-01
We revisit the integer lattice (IL) method to numerically solve the Vlasov-Poisson equations, and show that a slight variant of the method is a very easy, viable, and efficient numerical approach to study the dynamics of self-gravitating, collisionless systems. The distribution function lives in a discretized lattice phase-space, and each time-step in the simulation corresponds to a simple permutation of the lattice sites. Hence, the method is Lagrangian, conservative, and fully time-reversible. IL complements other existing methods, such as N-body/particle mesh (computationally efficient, but affected by Monte Carlo sampling noise and two-body relaxation) and finite volume (FV) direct integration schemes (expensive, accurate but diffusive). We also present improvements to the FV scheme, using a moving-mesh approach inspired by IL, to reduce numerical diffusion and the time-step criterion. Being a direct integration scheme like FV, IL is memory limited (memory requirement for a full 3D problem scales as N6, where N is the resolution per linear phase-space dimension). However, we describe a new technique for achieving N4 scaling. The method offers promise for investigating the full 6D phase-space of collisionless systems of stars and dark matter.
Fractal electrodynamics via non-integer dimensional space approach
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.
Asymptotic approximations for non-integer order derivatives of monomials
Aşiru, Muniru A.
2015-02-01
In this note, we develop new, simple and very accurate asymptotic approximations for non-integer order derivatives of monomial functions by using the more accurate asymptotic approximations for large factorials that have recently appeared in the literature.
Compiler for Fast, Accurate Mathematical Computing on Integer Processors Project
National Aeronautics and Space Administration — The proposers will develop a computer language compiler to enable inexpensive, low-power, integer-only processors to carry our mathematically-intensive comptutations...
Fractal electrodynamics via non-integer dimensional space approach
Energy Technology Data Exchange (ETDEWEB)
Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru
2015-09-25
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. - Highlights: • Electrodynamics of fractal media is described by non-integer dimensional spaces. • Applications of the fractal Gauss's and Ampere's laws are suggested. • Fractal Poisson equation, equation for fractal stream of charges are considered.
Algorithms and Data Structures for Strings, Points and Integers
DEFF Research Database (Denmark)
Vind, Søren Juhl
. The problem of extracting important patterns from text has many diverse applications such as data mining, intrusion detection and genomic analysis. Consequently, there are many variations of the pattern extraction problem with different notions of patterns and importance measures. We study a natural variation...... the points and be able to count the number of points within a query range with a weight exceeding some threshold. This query appears naturally in a software system built by Milestone Systems, and allows detecting motion in video from surveillance cameras. We implement a prototype of an index for 3...... is implemented in the latest version of the Milestone Systems software system. Finger Predecessor. The predecessor problem is to store a set of n integers from a universe of size N to support predecessor queries, returning the largest integer in the set smaller than a given integer q. We study a variation where...
Efficiently representing the integer factorization problem using binary decision diagrams
Skidmore, David
2017-01-01
Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log2(α)3 + 16.5log2(α...
Computing all integer solutions of a genus 1 equation
R.J. Stroeker (Roel); N. Tzanakis (Nikos)
2001-01-01
textabstractThe Elliptic Logarithm Method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 defining elliptic curves. We extend this method to include any equation f(u,v)=0 that defines a curve of genus 1. Here f is a polynomial with
Integer Valued Autoregressive Models for Tipping Bucket Rainfall Measurements
DEFF Research Database (Denmark)
Thyregod, Peter; Carstensen, Niels Jacob; Madsen, Henrik
1999-01-01
A new method for modelling the dynamics of rain sampled by a tipping bucket rain gauge is proposed. The considered models belong to the class of integer valued autoregressive processes. The models take the autocorelation and discrete nature of the data into account. A first order, a second order...
Selecting a limited overs cricket squad using an integer ...
African Journals Online (AJOL)
An integer programming model was developed to select an one day international (ODI) cricket squad of 15 players. To develop the method, batting, bowling and fielding ability, which are measured differently, had to be placed onto the same scale, so an ability-indexing technique was used. This paper describes the ...
A mixed integer linear program for an integrated fishery | Hasan ...
African Journals Online (AJOL)
We develop a mixed integer linear programming (MILP) model to co-ordinate trawler scheduling, fishing, processing, 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 ...
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)
Leveraging Structure: Logical Necessity in the Context of Integer Arithmetic
Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.
2016-01-01
Looking for, recognizing, and using underlying mathematical structure is an important aspect of mathematical reasoning. We explore the use of mathematical structure in children's integer strategies by developing and exemplifying the construct of logical necessity. Students in our study used logical necessity to approach and use numbers in a…
Triangular Numbers, Gaussian Integers, and KenKen
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…
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.
Negative Integer Understanding: Characterizing First Graders' Mental Models
Bofferding, Laura
2014-01-01
This article presents results of a research study. Sixty-one first graders' responses to interview questions about negative integer values and order and directed magnitudes were examined to characterize the students' mental models. The models reveal that initially, students overrelied on various combinations of whole-number principles as…
Unique Factorization in Cyclotomic Integers of Degree Seven
Duckworth, W. Ethan
2008-01-01
This article provides a survey of some basic results in algebraic number theory and applies this material to prove that the cyclotomic integers generated by a seventh root of unity are a unique factorization domain. Part of the proof uses the computer algebra system Maple to find and verify factorizations. The proofs use a combination of historic…
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 ...
Selecting Tools to Model Integer and Binomial Multiplication
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…
Bolyard, Johnna; Moyer-Packenham, Patricia
2012-01-01
This study investigated how the use of virtual manipulatives in integer instruction impacts student achievement for integer addition and subtraction. Of particular interest was the influence of using virtual manipulatives on students' ability to create and translate among representations for integer computation. The research employed a…
A Secret Image Sharing Method Using Integer Wavelet Transform
Directory of Open Access Journals (Sweden)
Li Ching-Chung
2007-01-01
Full Text Available A new image sharing method, based on the reversible integer-to-integer (ITI wavelet transform and Shamir's threshold scheme is presented, that provides highly compact shadows for real-time progressive transmission. This method, working in the wavelet domain, processes the transform coefficients in each subband, divides each of the resulting combination coefficients into shadows, and allows recovery of the complete secret image by using any or more shadows . We take advantages of properties of the wavelet transform multiresolution representation, such as coefficient magnitude decay and excellent energy compaction, to design combination procedures for the transform coefficients and processing sequences in wavelet subbands such that small shadows for real-time progressive transmission are obtained. Experimental results demonstrate that the proposed method yields small shadow images and has the capabilities of real-time progressive transmission and perfect reconstruction of secret images.
Two dimensional convolute integers for machine vision and image recognition
Edwards, Thomas R.
1988-01-01
Machine vision and image recognition require sophisticated image processing prior to the application of Artificial Intelligence. Two Dimensional Convolute Integer Technology is an innovative mathematical approach for addressing machine vision and image recognition. This new technology generates a family of digital operators for addressing optical images and related two dimensional data sets. The operators are regression generated, integer valued, zero phase shifting, convoluting, frequency sensitive, two dimensional low pass, high pass and band pass filters that are mathematically equivalent to surface fitted partial derivatives. These operators are applied non-recursively either as classical convolutions (replacement point values), interstitial point generators (bandwidth broadening or resolution enhancement), or as missing value calculators (compensation for dead array element values). These operators show frequency sensitive feature selection scale invariant properties. Such tasks as boundary/edge enhancement and noise or small size pixel disturbance removal can readily be accomplished. For feature selection tight band pass operators are essential. Results from test cases are given.
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.
Relaxation and decomposition methods for mixed integer nonlinear programming
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.
Penempatan Optimal Phasor Measurement Unit (PMU) dengan Integer Programming
Yunan Helmy Amrulloh
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...
Optics measurement and correction close to the half integer resonance
Calaga, R; Maclean, E; Persson, T; Pojer, M; Skowronski, P; Steinhagen, R; Tomas, R; Vanbavinckhove, G; White, S
2011-01-01
This paper reports on the first successful attempt to measure and correct the on-momentum optics close to the half integer resonance in LHC at injection energy. This tune working point is traditionally preferred by colliders for providing the largest resonance-free space in the tune diagram [1, 2]. It is also considered as an option for the HL-LHC upgrade [3].
On Integer-Sequence-Based Constructions of Generalized Pascal Triangles
Barry, Paul
2006-05-01
We introduce an integer sequence based construction of invertible centrally symmetric number triangles, which generalize Pascal's triangle. We characterize the row sums and central coefficients of these triangles, and examine other properties. Links to the Narayana numbers are explored. Use is made of the Riordan group to elucidate properties of a special one-parameter subfamily. An alternative exponential approach to constructing generalized Pascal triangles is briefly explored.
Index sort algorithm for positive integers | Adewumi | Science World ...
African Journals Online (AJOL)
Index sort algorithm for positive integers. S.E Adewumi. Abstract. No Abstract. Full Text: EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT · http://dx.doi.org/10.4314/swj.v3i3.51816 · AJOL African Journals Online. HOW TO USE AJOL... for Researchers · for Librarians · for ...
On Integers, Primes and UniqueFactorization in Quadratic Fields
Hedenlund, Alice
2013-01-01
Abstract. This thesis will deal with quadratic elds. The prob- lem is to study such elds and their properties including, but not limited to, determining integers, nding primes and deciding which quadratic elds have unique factorization. The goal is to get famil- iar with these concepts and to provide a starting point for students with an interest in algebra to explore eld extensions and inte- gral closures in relation to elementary number theory. The reader will be assumed to have a basic kn...
Computing the Line Index of Balance Using Integer Programming Optimisation
Aref, Samin; Andrew J. Mason; Wilson, Mark C.
2017-01-01
An important measure of a signed graph is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line index of balance exactly. Using the Gurobi integer programming optimisation solver, we evaluate the line...
Multi-Target Tracking via Mixed Integer Optimization
2016-05-13
trajectory estimation; mixed integer optimization I. INTRODUCTION MULTI-target tracking is the problem of estimation thestate of multiple dynamic...target tracking are the the Multiple Hypothesis Tracker (MHT) and the Joint Probability Data Association Filter (JPDAF) and their numerous variants and...posterior PDF , which again requires heavy assumptions on object dy- namics and the detection process. In similar fashion, a Joint PDA (JPDA) assigns
Non-convex mixed-integer nonlinear programming: a survey
Burer, S; Letchford, Adam
2012-01-01
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are available. When nonconvexities are present, however, things become much more difficult, since then even the continuous relaxation is a global optimisation problem. We survey the literature on non-convex MINLP, discussing applications, algorithms...
New Approaches for Very Large-Scale Integer Programming
2016-06-24
existing algorithms. This research has been presented at several conferences and has and will appear in archival journals . 15. SUBJECT TERMS integer...Enter information not included elsewhere such as: prepared in cooperation with; translation of; report supersedes; old edition number, etc. 14...In the context of a single branch-and-bound search, in a first phase, we observe the decisions made by SB, and collect: features that characterize
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...... and derived Jacobi symbol algorithms. Our algorithms take time O(n 2) for n bit input. This is an improvement from the known results based on the Euclidean algorithm, and taking time O(n M(n)), where M(n) denotes the complexity of multiplying n bit integers. The new algorithms have applications in practical...
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Directory of Open Access Journals (Sweden)
Shahram Jahani
2014-01-01
Full Text Available Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In this paper, we introduce new symbols extracted from binary representation of integers called Big-ones. We present a modified version of the classical multiplication and squaring algorithms based on the Big-ones to improve the efficiency of big integer multiplication and squaring in number theory based cryptosystems. Compared to the adopted classical and Karatsuba multiplication algorithms for squaring, the proposed squaring algorithm is 2 to 3.7 and 7.9 to 2.5 times faster for squaring 32-bit and 8-Kbit numbers, respectively. The proposed multiplication algorithm is also 2.3 to 3.9 and 7 to 2.4 times faster for multiplying 32-bit and 8-Kbit numbers, respectively. The number theory based cryptosystems, which are operating in the range of 1-Kbit to 4-Kbit integers, are directly benefited from the proposed method since multiplication and squaring are the main operations in most of these systems.
Energy Technology Data Exchange (ETDEWEB)
Chauvet, I.
1995-11-01
The VEDA program allows the transformation of raw data, obtained during the GANIL experiments, into analyzable physical data for the physicists that participate to the INDRA project. This program allows a precise determination of nuclear reaction products and the identification of defective INDRA detectors. This document gives a general presentation of the INDRA detectors and VEDA Fortran program with details about the control subroutines. (J.S.). 5 refs., 14 figs., 1 tab., 2 appends.
A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization.
1980-01-01
ifferent alg~ Ir th 9’he generalizec reI.Ze gradie nt, ro nding and neig orho searc57 Dr’. ( RG/R/I ; the integer gradient, steepest escent wih penalty...Real Analysis, John Wiley and Sons , 1964 [3) Beightler, C. S. and Philips, D. T., Applied Geometric Programming, John Wiley and Sons , 1976 [41...Soosaar, K., "Discrete Variables in Structural Optimization", in Optimum Structural Design, ed. Gallagher, R. H. and Zienkiewicz, 0. C., John Wiley and Sons
Formulating Linear and Integer Linear Programs: A Rogues' Gallery
Brown, Gerald; Robert F.
2007-01-01
INFORMS Transactions on Education, 7, 2007, pp. 153-159. The article of record as published may be located at http://dx.doi.org/10.1287/ited.7.2.153 The art of formulating linear and integer linear programs is, well, an art: It is hard to teach, and even harder to learn. To help demystify this art, we present a set of modeling building blocks that we call “formulettes.” Each formulette consists of a short verbal description that must be expressed in terms of variables and const...
Algoritma Penentuan Ukuran Batch Integer pada Penjadwalan Flowshop Satu Mesin
Directory of Open Access Journals (Sweden)
Hadigufri Triha
2016-03-01
Full Text Available Scheduling is an important area of production planning and control. Scheduling is required to produce an existing job by allocating existing resources in the proper execution order. Production schedules arranged effectively and efficiently to maximize resources utility, minimize waiting and idle time and increase productivity. The flowshop batch scheduling model for one machine that takes inventory and quality cost into account has been developed by Indrapriyatna et al (2007a. However, the model yet effective in converting the results of batch size into integers. This study tried to resolve this problem by using a modification of Branch and Bound Algorithm approach.
Using Set Model for Learning Addition of Integers
Directory of Open Access Journals (Sweden)
Umi Puji Lestari
2015-07-01
Full Text Available This study aims to investigate how set model can help students' understanding of addition of integers in fourth grade. The study has been carried out to 23 students and a teacher of IVC SD Iba Palembang in January 2015. This study is a design research that also promotes PMRI as the underlying design context and activity. Results showed that the use of set models that is packaged in activity of recording of financial transactions in two color chips and card game can help students to understand the concept of zero pair, addition with the same colored chips, and cancellation strategy.
Integer Programming Approach For Optimization Of Library Loan Policy
Directory of Open Access Journals (Sweden)
Hafeezullah Abdulrehman
2017-04-01
Full Text Available In the Library system main objective is to provide the best services to the users. The purpose of this research is to develop a library system that house implementing integrated procurement flow return and borrowing books so that the inter-library loan dealing can be done in an integrated manner with the hope to facilitate members to borrow variety of books thereby increasing library transactions. Interlibrary management system library loan policy have been formed by using integer programming technique. This paper is prepared with a view to facilitate to users with loan period and maximum number of books can be borrowed.
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.
Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.
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.
Direct comparison of fractional and integer quantized Hall resistance
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.
Split diversity in constrained conservation prioritization using integer linear programming.
Chernomor, Olga; Minh, Bui Quang; Forest, Félix; Klaere, Steffen; Ingram, Travis; Henzinger, Monika; von Haeseler, Arndt
2015-01-01
Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.
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.
Determining on-fault earthquake magnitude distributions from integer programming
Geist, Eric L.; Parsons, Tom
2018-02-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.
Energy Technology Data Exchange (ETDEWEB)
Guasp, J.
1981-07-01
A library for graphic representation, named ELBERETH, has been built, all the subroutines have been written in FORTRAN-V for the UN IVAC-1100/80 computers from JEN and are able to produce drawing on the CALCOMP-936 plotter, as well as with the printers and on the UTS-400 terminal screen. The library can yield two or three-dimensional plots as rail as level lines, all of them under free format or in several standard ones either. It allows to be used on a simplified way by direct reading from a file. It has been constructed too with a flexible structure to allow forth coming extensions. (Author) 4 refs.
Mixed integer (0-1) fractional programming for decision support in paper production industry
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
Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic
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
Integral representations of equally positive integer-indexed harmonic sums at infinity
Jiu, Lin
2016-01-01
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special cases coincide with zeta values at positive integer arguments.
Efficient mixed integer programming models for family scheduling problems
Directory of Open Access Journals (Sweden)
Meng-Ye Lin
Full Text Available This paper proposes several mixed integer programming models which incorporate optimal sequence properties into the models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum lateness, respectively. Experiment results indicate that there are remarkable improvements in computational efficiency when optimal sequence properties are included in the models. For the total weighted completion time problems, the best model solves all of the problems up to 30-jobs within 5 s, all 50-job problems within 4 min and about 1/3 of the 75-job to 100-job problems within 1 h. For maximum lateness problems, the best model solves almost all the problems up to 30-jobs within 11 min and around half of the 50-job to 100-job problems within 1 h. Keywords: Family scheduling, Sequence independent setup, Total weighted completion time, Maximum lateness
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.
Parallel integer sorting with medium and fine-scale parallelism
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.
Modeling Road Vulnerability to Snow Using Mixed Integer Optimization
Energy Technology Data Exchange (ETDEWEB)
Rodriguez, Tony K [ORNL; Omitaomu, Olufemi A [ORNL; Ostrowski, James A [ORNL; Bhaduri, Budhendra L [ORNL
2017-01-01
As the number and severity of snowfall events continue to grow, the need to intelligently direct road maintenance during these snowfall events will also grow. In several locations, local governments lack the resources to completely treat all roadways during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming formulation to optimally allocate resources to manage snowfall on roads using meteorological, geographical, and environmental parameters. Additionally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.
An integer linear programming for a comprehensive reverse supply chain
Directory of Open Access Journals (Sweden)
Hoda Mahmoudi
2014-12-01
Full Text Available Reverse supply chain is a cycle of recovery for the products and materials used by the customers but can be returned to the chain performing some operations. Due to significance of reverse supply chain in the content of environmental and economical aspects, we formulate a mathematical model of reverse multi-layer multi-product supply chain for minimizing the total costs including returning, disassembly, processing, recycling, remanufacturing, and distribution centers. The presented model is an integer linear programming model being solved using Lingo 9 software. Numerical experiments are conducted to gain insight into the proposed model. The solutions provide a decision aid stream strengthening the concept of reverse supply network design and analysis for profit-making organization.
Analytical estimation of the correlation dimension of integer lattices.
Lacasa, Lucas; Gómez-Gardeñes, Jesús
2014-12-01
Recently [L. Lacasa and J. Gómez-Gardeñes, Phys. Rev. Lett. 110, 168703 (2013)], a fractal dimension has been proposed to characterize the geometric structure of networks. This measure is an extension to graphs of the so called correlation dimension, originally proposed by Grassberger and Procaccia to describe the geometry of strange attractors in dissipative chaotic systems. The calculation of the correlation dimension of a graph is based on the local information retrieved from a random walker navigating the network. In this contribution, we study such quantity for some limiting synthetic spatial networks and obtain analytical results on agreement with the previously reported numerics. In particular, we show that up to first order, the correlation dimension β of integer lattices ℤ(d) coincides with the Haussdorf dimension of their coarsely equivalent Euclidean spaces, β = d.
Developing optimal nurses work schedule using integer programming
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.
Integer programming model for optimizing bus timetable using genetic algorithm
Wihartiko, F. D.; Buono, A.; Silalahi, B. P.
2017-01-01
Bus timetable gave an information for passengers to ensure the availability of bus services. Timetable optimal condition happened when bus trips frequency could adapt and suit with passenger demand. In the peak time, the number of bus trips would be larger than the off-peak time. If the number of bus trips were more frequent than the optimal condition, it would make a high operating cost for bus operator. Conversely, if the number of trip was less than optimal condition, it would make a bad quality service for passengers. In this paper, the bus timetabling problem would be solved by integer programming model with modified genetic algorithm. Modification was placed in the chromosomes design, initial population recovery technique, chromosomes reconstruction and chromosomes extermination on specific generation. The result of this model gave the optimal solution with accuracy 99.1%.
Mixed Integer Programming and Heuristic Scheduling for Space Communication
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.
Distributing Earthquakes Among California's Faults: A Binary Integer Programming Approach
Geist, E. L.; Parsons, T.
2016-12-01
Statement of the problem is simple: given regional seismicity specified by a Gutenber-Richter (G-R) relation, how are earthquakes distributed to match observed fault-slip rates? The objective is to determine the magnitude-frequency relation on individual faults. The California statewide G-R b-value and a-value are estimated from historical seismicity, with the a-value accounting for off-fault seismicity. UCERF3 consensus slip rates are used, based on geologic and geodetic data and include estimates of coupling coefficients. The binary integer programming (BIP) problem is set up such that each earthquake from a synthetic catalog spanning millennia can occur at any location along any fault. The decision vector, therefore, consists of binary variables, with values equal to one indicating the location of each earthquake that results in an optimal match of slip rates, in an L1-norm sense. Rupture area and slip associated with each earthquake are determined from a magnitude-area scaling relation. Uncertainty bounds on the UCERF3 slip rates provide explicit minimum and maximum constraints to the BIP model, with the former more important to feasibility of the problem. There is a maximum magnitude limit associated with each fault, based on fault length, providing an implicit constraint. Solution of integer programming problems with a large number of variables (>105 in this study) has been possible only since the late 1990s. In addition to the classic branch-and-bound technique used for these problems, several other algorithms have been recently developed, including pre-solving, sifting, cutting planes, heuristics, and parallelization. An optimal solution is obtained using a state-of-the-art BIP solver for M≥6 earthquakes and California's faults with slip-rates > 1 mm/yr. Preliminary results indicate a surprising diversity of on-fault magnitude-frequency relations throughout the state.
Experimental study of a half-integer resonance with space-charge effects in a synchrotron
Directory of Open Access Journals (Sweden)
Tomonori Uesugi
2002-04-01
Full Text Available Beam losses due to half-integer resonance have been observed in the Heavy Ion Medical Accelerator in Chiba synchrotron, along with exciting the harmonic component of gradient field errors. During operation, while varying the defocusing quadrupole to cross a half-integer tune in the vertical space, the region of bare tunes which causes the half-integer resonance was evaluated. When the initial beam intensity was high, the bare tune where the beam loss occurred became higher. The beam loss occurred rapidly when the half-integer tune was crossed upward, but gradually when it was crossed downward. Those results mean that the half-integer resonance is affected by space-charge-induced tune shifts. This fact was verified experimentally for the first time. The results from a one-dimensional multiparticle simulation agreed with those characteristics. Finally, the beam-size growth and the change in distribution were studied by a simulation.
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.
Anisotropic fractal media by vector calculus in non-integer dimensional space
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.
IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS
Fogle, F. R.
1994-01-01
IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.
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...
Investigating Triangular Numbers with greatest integer function, Sequences and Double Factorial
Directory of Open Access Journals (Sweden)
Tilahun A Muche
2016-11-01
Full Text Available The Triangular number denoted by is defined as the sum of the first consecutive positive integers. A positive integer is a Triangular Number if and only if [1]. We stated and proved a sequence of positive integers is consecutive triangular numbers if and only if √ − √ =1 and √ . We consider a ceiling function ⌈ ⌉ to state and prove a necessary and sufficient condition for a number ⌈ ⌉ ⌈ ⌉ to be a triangular number for each . A formula to find and of any two consecutive triangular numbers and a double factorial is introduced to find products of triangular numbers.
Directory of Open Access Journals (Sweden)
Yan-Ping Wu
2013-01-01
Full Text Available The synchronization between fractional-order hyperchaotic systems and integer-order hyperchaotic systems via sliding mode controller is investigated. By designing an active sliding mode controller and choosing proper control parameters, the drive and response systems are synchronized. Synchronization between the fractional-order Chen chaotic system and the integer-order Chen chaotic system and between integer-order hyperchaotic Chen system and fractional-order hyperchaotic Rössler system is used to illustrate the effectiveness of the proposed synchronization approach. Numerical simulations coincide with the theoretical analysis.
Fish Processed Production Planning Using Integer Stochastic Programming Model
Firmansyah, Mawengkang, Herman
2011-06-01
Fish and its processed products are the most affordable source of animal protein in the diet of most people in Indonesia. The goal in production planning is to meet customer demand over a fixed time horizon divided into planning periods by optimizing the trade-off between economic objectives such as production cost and customer satisfaction level. The major decisions are production and inventory levels for each product and the number of workforce in each planning period. In this paper we consider the management of small scale traditional business at North Sumatera Province which performs processing fish into several local seafood products. The inherent uncertainty of data (e.g. demand, fish availability), together with the sequential evolution of data over time leads the production planning problem to a nonlinear mixed-integer stochastic programming model. We use scenario generation based approach and feasible neighborhood search for solving the model. The results which show the amount of each fish processed product and the number of workforce needed in each horizon planning are presented.
AN EFFICIENT HILBERT AND INTEGER WAVELET TRANSFORM BASED VIDEO WATERMARKING
Directory of Open Access Journals (Sweden)
AGILANDEESWARI L.
2016-03-01
Full Text Available In this paper, an efficient, highly imperceptible, robust, and secure digital video watermarking technique for content authentication based on Hilbert transform in the Integer Wavelet Transform (IWT domain has been introduced. The Hilbert coefficients of gray watermark image are embedded into the cover video frames Hilbert coefficients on the 2-level IWT decomposed selected block on sub-bands using Principal Component Analysis (PCA technique. The authentication is achieved by using the digital signature mechanism. This mechanism is used to generate and embed a digital signature after embedding the watermarks. Since, the embedding process is done in Hilbert transform domain, the imperceptibility and the robustness of the watermark is greatly improved. At the receiver end, prior to the extraction of watermark, the originality of the content is verified through the authentication test. If the generated and received signature matches, it proves that the received content is original and performs the extraction process, otherwise deny the extraction process due to unauthenticated received content. The proposed method avoids typical degradations in the imperceptibility level of watermarked video in terms of Average Peak Signal – to – Noise Ratio (PSNR value of about 48db, while it is still providing better robustness against common video distortions such as frame dropping, averaging, and various image processing attacks such as noise addition, median filtering, contrast adjustment, and geometrical attacks such as, rotation and cropping in terms of Normalized Correlation Coefficient (NCC value of about nearly 1.
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.
Learning oncogenetic networks by reducing to mixed integer linear programming.
Shahrabi Farahani, Hossein; Lagergren, Jens
2013-01-01
Cancer can be a result of accumulation of different types of genetic mutations such as copy number aberrations. The data from tumors are cross-sectional and do not contain the temporal order of the genetic events. Finding the order in which the genetic events have occurred and progression pathways are of vital importance in understanding the disease. In order to model cancer progression, we propose Progression Networks, a special case of Bayesian networks, that are tailored to model disease progression. Progression networks have similarities with Conjunctive Bayesian Networks (CBNs) [1],a variation of Bayesian networks also proposed for modeling disease progression. We also describe a learning algorithm for learning Bayesian networks in general and progression networks in particular. We reduce the hard problem of learning the Bayesian and progression networks to Mixed Integer Linear Programming (MILP). MILP is a Non-deterministic Polynomial-time complete (NP-complete) problem for which very good heuristics exists. We tested our algorithm on synthetic and real cytogenetic data from renal cell carcinoma. We also compared our learned progression networks with the networks proposed in earlier publications. The software is available on the website https://bitbucket.org/farahani/diprog.
Belokurov-Usyukina loop reduction in non-integer dimension
Gonzalez, Ivan; Kondrashuk, Igor
2013-03-01
Belokurov-Usyukina loop reduction method has been proposed in 1983 to reduce a number of rungs in triangle ladder-like diagram by one. The disadvantage of the method is that it works in d = 4 dimensions only and it cannot be used for calculation of amplitudes in field theory in which we are required to put all the incoming and outgoing momenta on shell. We generalize the Belokurov-Usyukina loop reduction technique to non-integer d = 4 - 2ɛ dimensions. In this paper we show how a two-loop triangle diagram with particular values of indices of scalar propagators in the position space can be reduced to a combination of three one-loop scalar diagrams. It is known that any one-loop massless momentum integral can be presented in terms of Appell's function F 4. This means that particular diagram considered in the present paper can be represented in terms of Appell's function F 4 too. Such a generalization of Belokurov-Usyukina loop reduction technique allows us to calculate that diagram by this method exactly without decomposition in terms of the parameter ɛ.
Indonesian Maritime Logistics Network Optimization Using Mixed Integer Programming
Directory of Open Access Journals (Sweden)
Arry Rahmawan Komarudin
2017-01-01
Full Text Available Some causes of the high logistic costs and significant disparity in Indonesia’s commodity price is the imbalanced distribution of the flow of goods between west and east regional of Indonesia and the slow development infrastructure. This issue can be happened because maritime transport infrastructure in Indonesia have not served effectively yet,. Therefore, the provider of shipping services should be able to design the Indonesian maritime logistics network that best suits with the current maritime conditions and provide the greatest benefits. This study aims to obtain a model of decision-making at all levels (strategic, tactical, operational to determine the type of vessel, the shipping routes, and cargo allocation that gives the maximum profit. Main purpose from this study is to develop decision-making model for maritime logistics network design at all levels (strategic, tactical, operational by using Mixed Integer Programming which can solve the combination of fleet-design, ship-scheduling, and cargo routing problems simultaneously.
Module detection in complex networks using integer optimisation
2010-01-01
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. PMID:21073720
Robust electron pairing in the integer quantum hall effect regime
Choi, H. K.; Sivan, I.; Rosenblatt, A.; Heiblum, M.; Umansky, V.; Mahalu, D.
2015-06-01
Electron pairing is a rare phenomenon appearing only in a few unique physical systems; for example, superconductors and Kondo-correlated quantum dots. Here, we report on an unexpected electron pairing in the integer quantum Hall effect regime. The pairing takes place within an interfering edge channel in an electronic Fabry-Perot interferometer at a wide range of bulk filling factors, between 2 and 5. We report on three main observations: high-visibility Aharonov-Bohm conductance oscillations with magnetic flux periodicity equal to half the magnetic flux quantum; an interfering quasiparticle charge equal to twice the elementary electron charge as revealed by quantum shot noise measurements, and full dephasing of the pairs' interference by induced dephasing of the adjacent inner edge channel--a manifestation of inter-channel entanglement. Although this pairing phenomenon clearly results from inter-channel interaction, the exact mechanism that leads to electron-electron attraction within a single edge channel is not clear. We believe that substantial efforts are needed in order to clarify these intriguing and unexpected findings.
Maximum likelihood pedigree reconstruction using integer linear programming.
Cussens, James; Bartlett, Mark; Jones, Elinor M; Sheehan, Nuala A
2013-01-01
Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible. © 2012 Wiley Periodicals, Inc.
The semigroup of nonempty finite subsets of integers
Directory of Open Access Journals (Sweden)
Reuben Spake
1986-01-01
Full Text Available Let Z be the additive group of integers and g the semigroup consisting of all nonempty finite subsets of Z with respect to the operation defined byA+B={a+b:a∈A, b∈B}, A,B∈g.For X∈g, define AX to be the basis of 〈X−min(X〉 and BX the basis of 〈max(X−X〉. In the greatest semilattice decomposition of g, let α(X denote the archimedean component containing X and define α0(X={Y∈α(X:min(Y=0}. In this paper we examine the structure of g and determine its greatest semilattice decomposition. In particular, we show that for X,Y∈g, α(X=α(Y if and only if AX=AY and BX=BY. Furthermore, if X∈g is a non-singleton, then the idempotent-free α(X is isomorphic to the direct product of the (idempotent-free power joined subsemigroup α0(X and the group Z.
Efficient Embedding of Integer Programming Problems on Quantum Annealers
Venturelli, Davide; Trummer, Immanuel
Quantum Annealers are being considered as a possible platform to solve challenging Integer Optimization Problems (IOP). Hard-coding an IOP as an Ising model onto an annealer is however no easy task due to the severe restrictions imposed mostly by the connectivity of the graph implemented by the hardware architecture, as it has widely discussed for the D-Wave machines. The current approaches employ graph minor embedding algorithms that require a significant overhead of resources (number of qubits, computing power) with respect to the number of logical variables in the IOP. This overhead is arguably the primary problems for practitioners of quantum annealing. We present a new method to deterministically embed an arbitrary IOP in a generic class of annealing chip layouts such that the asymptotic scaling beats all the current methods. It is shown on the latest D-Wave chips to allow programming of problems, relevant for database and space sciences, with approximately 5-10x more variables with respect to the published approaches. The method is efficient in the sense that a valid embedding can be computed at run-time in polynomial time. The discussed methods can inform the design of next-generation of quantum annealers.
7th Conference on Non-Integer Order Calculus and Its Applications
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...
5th Conference on Non-integer Order Calculus and Its Applications
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 ...
Directory of Open Access Journals (Sweden)
Balasubramanian Ram
1988-01-01
Full Text Available This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.
Iuga, Dinu
2003-01-01
Exploiting adiabatic passages of the spin transitions, this thesis reports sensitivity enhancements of the MAS and MQMAS experiments on half-integer quadrupolar nuclei. The processes governing frequency sweeping are described. During such experiments the irradiation frequency sweeps through the
Vector calculus in non-integer dimensional space and its applications to fractal media
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.
Positive integer solutions of the diophantine equation x2− Lnxy+(− 1 ...
Indian Academy of Sciences (India)
... solutions and . Moreover, we give all positive integer solutions of the equation x 2 − L n x y + ( − 1 ) n y 2 = ± 5 r when the equation has positive integer solutions. Author Affiliations. Refik Keskin1 Zafer Şiar2. Sakarya University, Merkezi, 54180 Sakarya, Turkey; Bingöl University, Rektörlüğü, 12000 Bingöl, Turkey ...
Functional It\\^o calculus and martingale representation formula for integer-valued measures
Blacque-Florentin, Pierre M.; Cont, Rama
2015-01-01
We develop a calculus for functionals of integer-valued measures, which extends the Functional It\\^o calculus to functionals of Poisson random measures in a pathwise sense. We show that smooth functionals in the sense of this pathwise calculus are dense in the space of square-integrable (compensated) integrals with respect to a large class of integer-valued random measures. As a consequence, we obtain an explicit martingale representation formula for all square-integrable martingales with res...
Multi-task feature selection in microarray data by binary integer programming
Lan, Liang; Vucetic, Slobodan
2013-01-01
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 ...
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
2009-03-01
Fibonacci search, but any efficient discrete search is sufficient. An efficient limiting form of the Fibonacci search is the Golden Section Method (Snyman...embedded in the Microsoft Office 2007® suite . In VBA®, a statement preceded by a ‘ indicates a comment. The subroutines below create instances of...Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302
Directory of Open Access Journals (Sweden)
Adel Ouannas
2017-01-01
Full Text Available We present new approaches to synchronize different dimensional master and slave systems described by integer order and fractional order differential equations. Based on fractional order Lyapunov approach and integer order Lyapunov stability method, effective control schemes to rigorously study the coexistence of some synchronization types between integer order and fractional order chaotic systems with different dimensions are introduced. Numerical examples are used to validate the theoretical results and to verify the effectiveness of the proposed schemes.
Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol
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
A time series model: First-order integer-valued autoregressive (INAR(1))
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.
Si, Gang-Quan; Sun, Zhi-Yong; Zhang, Yan-Bin
2011-08-01
This paper investigates the synchronization between integer-order and fractional-order chaotic systems. By introducing fractional-order operators into the controllers, the addressed problem is transformed into a synchronization one among integer-order systems. A novel general method is presented in the paper with rigorous proof. Based on this method, effective controllers are designed for the synchronization between Lorenz systems with an integer order and a fractional order, and for the synchronization between an integer-order Chen system and a fractional-order Liu system. Numerical results, which agree well with the theoretical analyses, are also given to show the effectiveness of this method.
50 Years of Integer Programming 1958-2008 From the Early Years to the State-of-the-Art
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
Harwell Subroutine Library. A Catalogue of Subroutines (1973),
1973-07-01
The user must supply upper and lower bounds on the dependent variables for scaling purposes. Versions: OCOlA ; no double precision version. Language...simulation OBOIA4 I time ON02A on line printer OCOlA Forsythe.G.E. VCO1A on teletype OCOlA FORTRAN compilers CUM-I print text OBOlA1 FORTRAN I/O
Optimal Biocompatible Solvent Design by Mixed-integer Hybrid Differential Evolution
Directory of Open Access Journals (Sweden)
Hou-Chieh Cheng
2008-04-01
Full Text Available In this study, a flexible optimization approach is introduced to design an optimal biocompatible solvent for an extractive fermentation process with cell-recycling. The optimal process/solvent design problem is formulated as a mixed-integer nonlinear programming model in which performance requirements of the compounds are reflected in the objectives and the constraints. A flexible or fuzzy optimization approach is applied to soften the rigid requirement for maximization of the production rate, extraction efficiency and to consider the solvent utilization rate as the softened inequality constraint to the process/solvent design problem. Such a trade-off problem is then converted to the goal attainment problem, which is described as the constrained mixed-integer nonlinear programming (MINLP problem. Mixed-integer hybrid differential evolution with multiplier updating method is introduced to solve the constrained MINLP problem. The adaptive penalty updating scheme is more efficient to achieve a global design.
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.
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.
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.
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.
Sabihi, Ahmad
2016-01-01
We approach a new proof of the strong Goldbach's conjecture for sufficiently large even integers by applying the Dirichlet's series. Using the Perron formula and the Residue Theorem in complex variable integration, one could show that any large even integer is demonstrated as a sum of two primes. In this paper,the Riemann Hypothesis is assumed to be true in throughout the paper. A novel function is defined on the natural numbers set.This function is a typical sieve function.Then based on this...
Stationary amplitudes of quantum walks on the higher-dimensional integer lattice
Komatsu, Takashi; Konno, Norio
2017-12-01
Stationary measures of quantum walks on the one-dimensional integer lattice are well studied. However, the stationary measure for the higher-dimensional case has not been clarified. In this paper, we give the stationary amplitude for quantum walks on the d-dimensional integer lattice with a finite support by solving the corresponding eigenvalue problem. As a corollary, we can obtain the stationary measures of the Grover walks. In fact, the amplitude for the stationary measure is an eigenfunction with eigenvalue 1.
Compound synchronization for four chaotic systems of integer order and fractional order
Sun, Junwei; Yin, Quan; Shen, Yi
2014-05-01
By combining the tracking control and the stability theory of nonlinear fractional-order systems, a novel kind of compound synchronization among four chaotic systems of integer order and fractional order has been investigated, where the drive systems have been conceptually divided into two categories: the scaling drive system and the base drive system. A fractional-order chaotic system can realize compound synchronization with the novel system, which is a combination system among two integer-order chaotic systems and one different fractional-order chaotic system. Numerical simulation results are presented to demonstrate the effectiveness and correctness of the compound synchronization.
Designing garbage-free reversible implementations of the integer cosine transform
DEFF Research Database (Denmark)
De Vos, Alexis; Burignat, Stephane; Gluck, Robert
2014-01-01
Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible integer cosine transformations on n input integers. The resulting...... reversible circuit is able to perform both the forward transform and the inverse transform. The detailed structure of such a reversible design strongly depends on the odd prime factors of the determinant of the transform: whether those are of the form 2k ± 1 or of the form 2k ± 2l ± 1 or neither...
NSWC Library of Mathematics Subroutines
1993-01-01
eliminated. The major issues concerning reliability are accuracy, the stability and robustness of the algorithm being used, and tihe overall quality of the...I ... 543 DDOT j BSLV1 285 CKPP(O 211 CURVD ... 479 DDSORT 8 BSPP 495 CLE ... 253 CURVI ... 479 DEI 66 BSSLI ... 95 CLI 7:1 CURVI ... 475 DFIG
McConnel, M B; Galligan, D T
2004-10-01
Optimization programs are currently used to aid in the selection of bulls to be used in herd breeding programs. While these programs offer a systematic approach to the problem of semen selection, they ignore the impact of volume discounts. Volume discounts are discounts that vary depending on the number of straws purchased. The dynamic nature of volume discounts means that, in order to be adequately accounted for, they must be considered in the optimization routine. Failing to do this creates a missed economic opportunity because the potential benefits of optimally selecting and combining breeding company discount opportunities are not captured. To address these issues, an integer program was created which used binary decision variables to incorporate the effects of quantity discounts into the optimization program. A consistent set of trait criteria was used to select a group of bulls from 3 sample breeding companies. Three different selection programs were used to select the bulls, 2 traditional methods and the integer method. After the discounts were applied using each method, the integer program resulted in the lowest cost portfolio of bulls. A sensitivity analysis showed that the integer program also resulted in a low cost portfolio when the genetic trait goals were changed to be more or less stringent. In the sample application, a net benefit of the new approach over the traditional approaches was a 12.3 to 20.0% savings in semen cost.
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
Hardware realizations of arithmetic with complex integer numbers on PLD-base
Directory of Open Access Journals (Sweden)
Opanasenko V. N.
2008-10-01
Full Text Available Hardware realizations of arithmetic with complex integer numbers were proposed. The generators of sine and cosine with different frequency were used to make behavior stand. Real verification was made by block Spartan–3–400 Evaluation Kit, which connect up PCI of personal computer.
An integer programming model to optimize resource allocation for wildfire containment.
Geoffrey H. Donovan; Douglas B. Rideout
2003-01-01
Determining the specific mix of fire-fighting resources for a given fire is a necessary condition for identifying the minimum of the Cost Plus Net Value Change (C+NVC) function. Current wildland fire management models may not reliably do so. The problem of identifying the most efficient wildland fire organization is characterized mathematically using integer-...
A mixed integer program to model spatial wildfire behavior and suppression placement decisions
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...
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...
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
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...
Real-time PPP with undifferenced integer ambiguity resolution, experimental results
Laurichesse, Denis; Mercier, Flavien
2010-05-01
A method to solve the GPS zero-difference measurement equations with integer ambiguities has been recently introduced at CNES. When the method is applied to data from a global network of GPS receivers it provides a consistent set of satellite orbits and clocks, which have an ‘integer' property: phase residuals for any receiver computed using these orbits and clocks easily reveal integer ambiguities. The presentation focuses on the application of this novel approach to the computation of real-time orbits and clocks for the GPS constellation, and the benefit of using these products for real-time Precise Point Positioning (PPP) with integer ambiguity fixing of user receivers. In this method, real-time corrections to extrapolated IGS IGU orbits are estimated at the same time as all other relevant parameters by a Kalman filter which processes measurements from a world-wide stations network. The filter performs zero-difference ambiguity fixing in real-time. Two results are presented; the first with one month of raw data taken from the IGS, the second with raw data taken from the Internet in real-time using the NTRIP protocol. Relative to IGS final orbits, the 3-D precision of the real-time orbits is about 3 cm RMS. When these constellation orbits and clocks are used to perform real-time PPP for receivers outside of the reference network, the horizontal precision obtained using zero-difference integer ambiguity fixing is close to 1 cm RMS. This is about one order of magnitude better than standard solutions, which rely upon floating ambiguity fixing, close to the precision of RTK. We present several ‘site survey' type real-time experiments conducted at CNES that confirm these results. Advantages and drawbacks of this new integer-PPP method with respect to RTK are outlined. These topics include mainly the time to convergence, the baselines size and the associated precision. Some specific applications of this new method, especially those that cannot be obtained using a
Langel, Steven E.; Khanafseh, Samer M.; Pervan, Boris
2016-11-01
Differential carrier phase applications that utilize cycle resolution need the probability density function of the baseline estimate to quantify its region of concentration. For the integer bootstrap estimator, the density function has an analytical definition that enables probability calculations given perfect statistical knowledge of measurement and process noise. This paper derives a method to upper bound the tail probability of the integer bootstrapped GNSS baseline when the measurement and process noise correlation functions are unknown, but can be upper and lower bounded. The tail probability is shown to be a non-convex function of a vector of conditional variances, whose feasible region is a convex polytope. We show how to solve the non-convex optimization problem globally by discretizing the polytope into small hyper-rectangular elements, and demonstrate the method for a static baseline estimation problem.
Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach
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.
Geng, Lingling; Yu, Yongguang; Zhang, Shuo
2016-09-01
In this paper, the function projective synchronization between integer-order and stochastic fractional-order nonlinear systems is investigated. Firstly, according to the stability theory of fractional-order systems and tracking control, a controller is designed. At the same time, based on the orthogonal polynomial approximation, the method of transforming stochastic error system into an equivalent deterministic system is given. Thus, the stability of the stochastic error system can be analyzed through its equivalent deterministic one. Finally, to demonstrate the effectiveness of the proposed scheme, the function projective synchronization between integer-order Lorenz system and stochastic fractional-order Chen system is studied. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
IMC-PID-fractional-order-filter controllers design for integer order systems.
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.
Directory of Open Access Journals (Sweden)
Maneesha Gupta
2013-01-01
Full Text Available Second and third order digital integrators (DIs have been optimized first using Particle Swarm Optimization (PSO with minimized error fitness function obtained by registering mean, median, and standard deviation values in different random iterations. Later indirect discretization using Continued Fraction Expansion (CFE has been used to ascertain a better fitting of proposed integer order optimized DIs into their corresponding fractional counterparts by utilizing their refined properties, now restored in them due to PSO algorithm. Simulation results for the comparisons of the frequency responses of proposed 2nd and 3rd order optimized DIs and proposed discretized mathematical models of half integrators based on them, with their respective existing operators, have been presented. Proposed integer order PSO optimized integrators as well as fractional order integrators (FOIs have been observed to outperform the existing recently published operators in their respective domains reasonably well in complete range of Nyquist frequency.
Li, Yongping; Huang, Guohe
2009-03-01
In this study, a dynamic analysis approach based on an inexact multistage integer programming (IMIP) model is developed for supporting municipal solid waste (MSW) management under uncertainty. Techniques of interval-parameter programming and multistage stochastic programming are incorporated within an integer-programming framework. The developed IMIP can deal with uncertainties expressed as probability distributions and interval numbers, and can reflect the dynamics in terms of decisions for waste-flow allocation and facility-capacity expansion over a multistage context. Moreover, the IMIP can be used for analyzing various policy scenarios that are associated with different levels of economic consequences. The developed method is applied to a case study of long-term waste-management planning. The results indicate that reasonable solutions have been generated for binary and continuous variables. They can help generate desired decisions of system-capacity expansion and waste-flow allocation with a minimized system cost and maximized system reliability.
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.
8th Conference on Non-integer Order Calculus and Its Applications
Czornik, Adam; Klamka, Jerzy; Niezabitowski, Michał
2017-01-01
This book collects papers from the 8th Conference on Non-Integer Order Calculus and Its Applications that have been held on September 20-21, 2016 in Zakopane, Poland. The preceding two conferences were held in Szczecin, Poland in 2015, and in Opole, Poland, in 2014. This conference provides a platform for academic exchange on the theory and application of fractional calculus between domestic and international universities, research institutes, corporate experts and scholars. The Proceedings of the 8th Conference on Non-Integer Order Calculus and Its Applications 2016 brings together rigorously reviewed contributions from leading international experts. The included papers cover novel various important aspects of mathematical foundations of fractional calculus, modeling and control of fractional systems as well as controllability, detectability, observability and stability problems for this systems.
Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.
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.
Integer Charge Transfer and Hybridization at an Organic Semiconductor/Conductive Oxide Interface
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.
Non-Porod scattering and non-integer scaling of resistance in rough films
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.
Mixed-Integer Linear Programming Models for Teaching Assistant Assignment and Extensions
Qu, Xiaobo; Yi, Wen; Wang, Tingsong; Wang, Shuaian; Xiao, Lin; Liu, Zhiyuan
2017-01-01
In this paper, we develop mixed-integer linear programming models for assigning the most appropriate teaching assistants to the tutorials in a department. The objective is to maximize the number of tutorials that are taught by the most suitable teaching assistants, accounting for the fact that different teaching assistants have different capabilities and each teaching assistant’s teaching load cannot exceed a maximum value. Moreover, with optimization models, the teaching load allocation, a t...
Rossana Patrón
2008-01-01
Are early leavers from the education system irrational or ill informed? They might be, but this approach shows that with underperforming education sectors – typical in developing countries – early dropout may be perfectly rational and well informed, even in the absence of liquidity constraints. This paper provides an integer approach to guide intervention in developing countries, though there are no clear-cut policies. Long-term measures should be aimed at improving the productivity of the ac...
0-1 Integer Linear Programming with a Linear Number of Constraints
Impagliazzo, R; Lovett, S; Paturi, R.; Schneider, S.
2017-01-01
We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1-\\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem.
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...... for the instances available online. Since current file formats were found incapable, we embrace the new Conic Benchmark Format as standard for conic optimization. Tools are provided to aid integration of this format with other software packages....
Operational Solution of Non-Integer Ordinary and Evolution-Type Partial Differential Equations
Directory of Open Access Journals (Sweden)
Konstantin V. Zhukovsky
2016-12-01
Full Text Available A method for the solution of linear differential equations (DE of non-integer order and of partial differential equations (PDE by means of inverse differential operators is proposed. The solutions of non-integer order ordinary differential equations are obtained with recourse to the integral transforms and the exponent operators. The generalized forms of Laguerre and Hermite orthogonal polynomials as members of more general Appèl polynomial family are used to find the solutions. Operational definitions of these polynomials are used in the context of the operational approach. Special functions are employed to write solutions of DE in convolution form. Some linear partial differential equations (PDE are also explored by the operational method. The Schrödinger and the Black–Scholes-like evolution equations and solved with the help of the operational technique. Examples of the solution of DE of non-integer order and of PDE are considered with various initial functions, such as polynomial, exponential, and their combinations.
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.
Chen, Diyi; Zhang, Runfan; Sprott, J C; Chen, Haitao; Ma, Xiaoyi
2012-06-01
In this paper, we focus on the synchronization between integer-order chaotic systems and a class of fractional-order chaotic system using the stability theory of fractional-order systems. A new sliding mode method is proposed to accomplish this end for different initial conditions and number of dimensions. More importantly, the vector controller is one-dimensional less than the system. Furthermore, three examples are presented to illustrate the effectiveness of the proposed scheme, which are the synchronization between a fractional-order Chen chaotic system and an integer-order T chaotic system, the synchronization between a fractional-order hyperchaotic system based on Chen's system and an integer-order hyperchaotic system, and the synchronization between a fractional-order hyperchaotic system based on Chen's system and an integer-order Lorenz chaotic system. Finally, numerical results are presented and are in agreement with theoretical analysis.
Chen, Di-Yi; Zhang, Run-Fan; Ma, Xiao-Yi; Wang, Juan
2012-12-01
In order to figure out the dynamical behaviour of a fractional-order chaotic system and its relation to an integer-order chaotic system, in this paper we investigate the synchronization between a class of fractional-order chaotic systems and integer-order chaotic systems via sliding mode control method. Stability analysis is performed for the proposed method based on stability theorems in the fractional calculus. Moreover, three typical examples are carried out to show that the synchronization between fractional-order chaotic systems and integer-orders chaotic systems can be achieved. Our theoretical findings are supported by numerical simulation results. Finally, results from numerical computations and theoretical analysis are demonstrated to be a perfect bridge between fractional-order chaotic systems and integer-order chaotic systems.
Chen, Diyi; Zhang, Runfan; Sprott, J. C.; Chen, Haitao; Ma, Xiaoyi
2012-06-01
In this paper, we focus on the synchronization between integer-order chaotic systems and a class of fractional-order chaotic system using the stability theory of fractional-order systems. A new sliding mode method is proposed to accomplish this end for different initial conditions and number of dimensions. More importantly, the vector controller is one-dimensional less than the system. Furthermore, three examples are presented to illustrate the effectiveness of the proposed scheme, which are the synchronization between a fractional-order Chen chaotic system and an integer-order T chaotic system, the synchronization between a fractional-order hyperchaotic system based on Chen's system and an integer-order hyperchaotic system, and the synchronization between a fractional-order hyperchaotic system based on Chen's system and an integer-order Lorenz chaotic system. Finally, numerical results are presented and are in agreement with theoretical analysis.
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.
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).
Integer Ratio Priors on Musical Rhythm Revealed Cross-culturally by Iterated Reproduction.
Jacoby, Nori; McDermott, Josh H
2017-02-06
Probability distributions over external states (priors) are essential to the interpretation of sensory signals. Priors for cultural artifacts such as music and language remain largely uncharacterized, but likely constrain cultural transmission, because only those signals with high probability under the prior can be reliably reproduced and communicated. We developed a method to estimate priors for simple rhythms via iterated reproduction of random temporal sequences. Listeners were asked to reproduce random "seed" rhythms; their reproductions were fed back as the stimulus and over time became dominated by internal biases, such that the prior could be estimated by applying the procedure multiple times. We validated that the measured prior was consistent across the modality of reproduction and that it correctly predicted perceptual discrimination. We then measured listeners' priors over the entire space of two- and three-interval rhythms. Priors in US participants showed peaks at rhythms with simple integer ratios and were similar for musicians and non-musicians. An analogous procedure produced qualitatively different results for spoken phrases, indicating some specificity to music. Priors measured in members of a native Amazonian society were distinct from those in US participants but also featured integer ratio peaks. The results do not preclude biological constraints favoring integer ratios, but they suggest that priors on musical rhythm are substantially modulated by experience and may simply reflect the empirical distribution of rhythm that listeners encounter. The proposed method can efficiently map out a high-resolution view of biases that shape transmission and stability of simple reproducible patterns within a culture. Copyright © 2017 Elsevier Ltd. All rights reserved.
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.
Automatic air cargo selection and weight balancing: A mixed integer programming approach
Vancroonenburg, Wim; Verstichel, Jannes; Tavernier, Karel; Vanden Berghe, Greet
2014-01-01
The present contribution introduces a mixed integer linear programming model as a decision support tool for air cargo load planning. The main objective for the model is to find the most profitable selection from a set of cargo to be loaded on an aircraft. The secondary objective is to minimize the deviation between the aircraft’s centre of gravity, and a known target value so as to reduce fuel consumption and improve stability. The model is subject to a large number of constraints that ensure...
Positive integer solutions of the diophantine equation x2 −Lnxy +(−1 ...
Indian Academy of Sciences (India)
Therefore by Theorem 2.11, we obtain |2x − Lny| = 5kL2m+1 and Fny = 5kF2m+1 with m ≥ 0. If d = (n, 2m + 1), then (Fn,F2m+1) = Fd by (2.14). It follows that. Fn = Fda and F2m+1 = Fdb for some positive integers a and b, with (a,b) = 1. Then, from equality Fny = 5kF2m+1, we obtain ay = 5kb. Since (a,b) = 1, it follows that.
A concrete approach to abstract algebra from the integers to the insolvability of the quintic
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
Modeling an integrated hospital management planning problem using integer optimization approach
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.
Entanglement in the quantum one-dimensional integer spin S Heisenberg antiferromagnet
Lima, L. S.
2017-10-01
We use the modified spin wave theory of Takahashi to study the entanglement entropy in the quantum one-dimensional integer spin Heisenberg antiferromagnet. We calculate the entanglement entropy of this spin system that is well known to be a quantum wire, in the classical limit (N → ∞). We obtain a decreasing the entanglement entropy with the temperature and we obtain none change in the entanglement in the point Δ = 1 at T = 0 where the system presents a quantum phase transition from a gapless phase in the spectrum Δ < 1 to a gapped phase Δ ≥ 1.
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.
A Hybrid Approach of Bundle and Benders Applied Large Mixed Linear Integer Problem
Directory of Open Access Journals (Sweden)
Placido Rogerio Pinheiro
2013-01-01
Full Text Available Consider a large mixed integer linear problem where structure of the constraint matrix is sparse, with independent blocks, and coupling constraints and variables. There is one of the groups of constraints to make difficult the application of Benders scheme decomposition. In this work, we propose the following algorithm; a Lagrangian relaxation is made on the mentioned set of constraints; we presented a process heuristic for the calculation of the multiplier through the resolution of the dual problem, structured starting from the bundle methods. According to the methodology proposed, for each iteration of the algorithm, we propose Benders decomposition where quotas are provided for the value function and ε-subgradient.
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 proﬁt. In particular, carcasses must be sorted in order to produce the “right” ﬁnal 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....
Verslycke, T.; De Wasch, K.; De Brabander, H.F.; Janssen, C.R.
2002-01-01
Testosterone metabolism by Neomysis integer (Crustacea; Mysidacea) was assessed to obtain initial data on its metabolic capacity. N. integer were exposed to both testosterone and [14]testosterone. Identification of testosterone metabolites and endogenous steroids was performed using thin-layer chromatography and liquid chromatography with multiple mass spectrometry. Endogenous production of testosterone in mysids was detected for the first time. N. integer were exposed to testosterone and met...
Deniz, Furkan Nur; Alagoz, Baris Baykant; Tan, Nusret; Atherton, Derek P
2016-05-01
This paper introduces an integer order approximation method for numerical implementation of fractional order derivative/integrator operators in control systems. The proposed method is based on fitting the stability boundary locus (SBL) of fractional order derivative/integrator operators and SBL of integer order transfer functions. SBL defines a boundary in the parametric design plane of controller, which separates stable and unstable regions of a feedback control system and SBL analysis is mainly employed to graphically indicate the choice of controller parameters which result in stable operation of the feedback systems. This study reveals that the SBL curves of fractional order operators can be matched with integer order models in a limited frequency range. SBL fitting method provides straightforward solutions to obtain an integer order model approximation of fractional order operators and systems according to matching points from SBL of fractional order systems in desired frequency ranges. Thus, the proposed method can effectively deal with stability preservation problems of approximate models. Illustrative examples are given to show performance of the proposed method and results are compared with the well-known approximation methods developed for fractional order systems. The integer-order approximate modeling of fractional order PID controllers is also illustrated for control applications. Copyright © 2016 ISA. All rights reserved.
Vilas, César; Drake, Pilar; Fockedey, Nancy
2008-04-01
Mysid shrimps are an important component of estuarine food webs because they play a key role in energy transfer as intermediate prey. We investigated the seasonal, tidal and depth specific variation in the diet of the estuarine mysids Neomysis integer and Rhopalophthalmus tartessicus and explored its implications for the planktonic community structure of a temperate estuary (Guadalquivir Estuary, SW Spain). Neomysis integer is an opportunistic omnivore feeding mainly on mesozooplankton and on members of the detrital-microbial loop, shifting prey seasonally according to availability. In contrast, R. tartessicus showed a more carnivorous diet and shifted its target prey during seasons of low resource availability. Despite statistically significant differences in diet composition, both species shared prey of similar size, particularly juvenile Mesopodopsis slabberi, the most abundant mysid species in this estuary, and copepods. Although these similarities imply inter-specific resource competition, their co-existence is achieved by niche partitioning and spatial segregation: the higher osmoregulatory capacity and foraging plasticity of N. integer confers a broader niche breadth for this species allowing N. integer to inhabit the more stressful oligohaline region of the estuary where R. tartessicus cannot survive. We propose that this mechanism relaxes the potential for competition between N. integer and R. tartessicus.
Haldane, F. D. M.
2016-01-01
A continuum limit treatment of planar spin chains with arbitrary S is presented. The difference between integer and half-integer spins is emphasised. While isotropic half-integer spin chains are gapless,and have power-law decay of correlations at T = 0 with exponent eta = 1, integer spin systems have a singlet ground state with a gap for S=1 excitations and exponential decay of correlations. The easy-plane to easy-axis transition is described. Note: this is a verbatim transcription of ILL pre...
Conference on Commutative rings, integer-valued polynomials and polynomial functions
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...
The computational complexity of elliptic curve integer sub-decomposition (ISD) method
Ajeena, Ruma Kareem K.; Kamarulhaili, Hailiza
2014-07-01
The idea of the GLV method of Gallant, Lambert and Vanstone (Crypto 2001) is considered a foundation stone to build a new procedure to compute the elliptic curve scalar multiplication. This procedure, that is integer sub-decomposition (ISD), will compute any multiple kP of elliptic curve point P which has a large prime order n with two low-degrees endomorphisms ψ1 and ψ2 of elliptic curve E over prime field Fp. The sub-decomposition of values k1 and k2, not bounded by ±C√n , gives us new integers k11, k12, k21 and k22 which are bounded by ±C√n and can be computed through solving the closest vector problem in lattice. The percentage of a successful computation for the scalar multiplication increases by ISD method, which improved the computational efficiency in comparison with the general method for computing scalar multiplication in elliptic curves over the prime fields. This paper will present the mechanism of ISD method and will shed light mainly on the computation complexity of the ISD approach that will be determined by computing the cost of operations. These operations include elliptic curve operations and finite field operations.
Generating subtour elimination constraints for the TSP from pure integer solutions.
Pferschy, Ulrich; Staněk, Rostislav
2017-01-01
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph [Formula: see text] and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice for solving the TSP to optimality is a branch and cut approach. Usually the integrality constraints are relaxed first and all separation processes to identify violated inequalities are done on fractional solutions. In our approach we try to exploit the impressive performance of current ILP-solvers and work only with integer solutions without ever interfering with fractional solutions. We stick to a very simple ILP-model and relax the subtour elimination constraints only. The resulting problem is solved to integer optimality, violated constraints (which are trivial to find) are added and the process is repeated until a feasible solution is found. In order to speed up the algorithm we pursue several attempts to find as many relevant subtours as possible. These attempts are based on the clustering of vertices with additional insights gained from empirical observations and random graph theory. Computational results are performed on test instances taken from the TSPLIB95 and on random Euclidean graphs.
An improved exploratory search technique for pure integer linear programming problems
Fogle, F. R.
1990-01-01
The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.
Design of real-time video watermarking based on Integer DCT for H.264 encoder
Joshi, Amit M.; Mishra, Vivekanand; Patrikar, R. M.
2015-01-01
With the advent of technology, video has become a prominent entity that is shared over networks. With easy availability of various editing tools, data integrity and ownership issues have caused great concern worldwide. Video watermarking is an evolving field that may be used to address such issues. Till date, most of the algorithms have been developed for uncompressed domain watermarking and implemented on software platforms. They provide flexibility and simplicity, but at the same time, they are not suited for real-time applications. They work offline where videos are captured and then watermark is embedded in the video. In the present work, a hardware-based implementation of video watermarking is proposed that overcomes the limitation of software watermarking methods and can be readily adapted to the H.264 standard. This paper focuses on an invisible and robust video watermarking scheme, which can be easily implemented as an integral part of the standard H.264 encoder. The proposed watermarking algorithm involves Integer DCT-based watermark embedding method, wherein Integer DCT is calculated with a fully parallel approach resulting in better speed. The proposed video watermarking is designed with pipelining and parallel architecture for real-time implementation. Here, scene change detection technique is used to improve the performance. Different planes of the watermark are embedded in different frames of a particular scene in order to achieve robustness against various temporal attacks.
A Generalized Fuzzy Integer Programming Approach for Environmental Management under Uncertainty
Directory of Open Access Journals (Sweden)
Y. R. Fan
2014-01-01
Full Text Available In this study, a generalized fuzzy integer programming (GFIP method is developed for planning waste allocation and facility expansion under uncertainty. The developed method can (i deal with uncertainties expressed as fuzzy sets with known membership functions regardless of the shapes (linear or nonlinear of these membership functions, (ii allow uncertainties to be directly communicated into the optimization process and the resulting solutions, and (iii reflect dynamics in terms of waste-flow allocation and facility-capacity expansion. A stepwise interactive algorithm (SIA is proposed to solve the GFIP problem and generate solutions expressed as fuzzy sets. The procedures of the SIA method include (i discretizing the membership function grade of fuzzy parameters into a set of α-cut levels; (ii converting the GFIP problem into an inexact mixed-integer linear programming (IMILP problem under each α-cut level; (iii solving the IMILP problem through an interactive algorithm; and (iv approximating the membership function for decision variables through statistical regression methods. The developed GFIP method is applied to a municipal solid waste (MSW management problem to facilitate decision making on waste flow allocation and waste-treatment facilities expansion. The results, which are expressed as discrete or continuous fuzzy sets, can help identify desired alternatives for managing MSW under uncertainty.
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.
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.
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.
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.
Vilas, Cesar; Drake, Pilar; Pascual, Emilio
2006-01-01
Results of field surveys and laboratory measurements of oxygen consumption and body fluid osmolality at different salinities in the mysids Neomysis integer, Mesopodopsis slabberi, and Rhopalophthalmus mediterraneus from the Guadalquivir estuary (southwest Spain) were used to test the hypothesis that osmotic stress (oxygen consumption vs. isosmotic points) was lowest at salinities that field distributions suggest are optimal. The three species showed overlapping spatial distributions within the estuary but clear segregation along the salinity gradient: N. integer, M. slabberi, and R. mediterraneus displayed maximal densities at lower, intermediate, and higher salinities, respectively. Adults of N. integer were extremely efficient hyperregulators (isosmotic point 30 per thousand) over the full salinity range tested (3 per thousand-32 per thousand), and their oxygen consumption rates were independent of salinity; adults of M. slabberi were strong hyper- and hyporegulators at salinities between 7 per thousand and 29 per thousand (isosmotic point, 21 per thousand) and showed higher oxygen consumptions at the lowest salinity (6 per thousand); adults of R. mediterraneus hyperregulated at salinities between 19 per thousand and seawater (isosmotic point, 36 per thousand), with the lowest oxygen consumption at salinity around their isosmotic point (35 per thousand). Thus, the osmoregulation capabilities of M. slabberi and R. mediterraneus seem to determine the salinity ranges in which most of their adults live, but this is not so for adults of N. integer. Moreover, maximal field densities of M. slabberi (males and females) and R. mediterraneus (males) occur at the same salinities as the lowest oxygen consumption. In contrast, field distribution of N. integer was clearly biased toward the lower end of the salinity ranges within which it osmoregulated. We hypothesize that the greater euryhalinity of N. integer makes it possible for this species to avoid competition with R
Zhou, Ping; Cheng, Yuan-Ming; Kuang, Fei
2010-09-01
Based on the idea of tracking control and stability theory of fractional-order systems, a controller is designed to synchronize the fractional-order chaotic system with chaotic systems of integer orders, and synchronize the different fractional-order chaotic systems. The proposed synchronization approach in this paper shows that the synchronization between fractional-order chaotic systems and chaotic systems of integer orders can be achieved, and the synchronization between different fractional-order chaotic systems can also be realized. Numerical experiments show that the present method works very well.
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.
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.
Mixed-integer representations in control design mathematical foundations and applications
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...
Energy Technology Data Exchange (ETDEWEB)
Tan, R.R.; Ng, D.K.S.; Foo, D.C.Y.; Aviso, K.B. [De La Salle University, Manila (Philippines)
2010-12-15
Carbon capture and storage (CCS) is one of the interim technologies to mitigate greenhouse gas emissions from stationary sources such as power plant and large industrial facilities. CCS allows for continued utilization of fossil fuels (e.g. coal, natural gas and oil), which are still relatively inexpensive and reliable in comparison to inherently low-carbon renewable resources (e.g. wind, solar etc.). On the other hand, retrofitting power plants for carbon capture (CC) entails major capital costs as well as reduction of thermal efficiency and power output. This paper presents integer programming optimization models for planning the retrofit of power plants at the regional, sectoral or national level. In addition to the base case (i.e., non-fuzzy or crisp) formulation, two fuzzy extensions are given to account for the inherent conflict between environmental and economic goals, as well as parametric uncertainties pertaining to the emerging CC technologies. Case studies are shown to illustrate the modeling approach.
Double stop-band structure near half-integer tunes in high-intensity rings
Directory of Open Access Journals (Sweden)
K. Moriya
2016-11-01
Full Text Available This paper addresses a detailed experimental study of collective instability bands generated near every half-integer tune per lattice period by coherent dipole and quadrupole resonances. Both instabilities appear side by side or overlap each other but are mostly separable because the dipole resonance often creates a narrower stop band accompanied by more severe particle losses. The separation of these low-order resonance bands becomes greater as the beam intensity increases. In principle, the double stop-band structure can be formed even without machine imperfections when the beam’s initial phase-space profile is deviated from the ideal stationary distribution. The tabletop ion-trap system called “S-POD” is employed to experimentally demonstrate the parameter dependence of the double stop-band structure. Numerical simulations are also performed for comparison with experimental observations.
Non-linear time series extreme events and integer value problems
Turkman, Kamil Feridun; Zea Bermudez, Patrícia
2014-01-01
This book offers a useful combination of probabilistic and statistical tools for analyzing nonlinear time series. Key features of the book include a study of the extremal behavior of nonlinear time series and a comprehensive list of nonlinear models that address different aspects of nonlinearity. Several inferential methods, including quasi likelihood methods, sequential Markov Chain Monte Carlo Methods and particle filters, are also included so as to provide an overall view of the available tools for parameter estimation for nonlinear models. A chapter on integer time series models based on several thinning operations, which brings together all recent advances made in this area, is also included. Readers should have attended a prior course on linear time series, and a good grasp of simulation-based inferential methods is recommended. This book offers a valuable resource for second-year graduate students and researchers in statistics and other scientific areas who need a basic understanding of nonlinear time ...
6th Conference on Non-integer Order Calculus and Its Applications
Ł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...
He, Yin-Chen; Grusdt, Fabian; Kaufman, Adam; Greiner, Markus; Vishwanath, Ashvin
2017-11-01
We study the ground states of two-dimensional lattice bosons in an artificial gauge field. Using state-of-the-art density matrix renormalization group (DMRG) simulations we obtain the zero-temperature phase diagram for hard-core bosons at densities nb with flux nϕ per unit cell, which determines a filling ν =nb/nϕ . We find the bosonic Jain sequence [ν =p /(p +1 )] states, in particular, a bosonic integer quantum Hall phase at ν =2 , are fairly robust in the hard-core boson limit, In addition to identifying Hamiltonians whose ground states realize these phases, we discuss their preparation, beginning from independent chains, and ramping up interchain couplings. Using time-dependent DMRG simulations, these are shown to reliably produce states close to the ground state for experimentally relevant system sizes. Our proposal only utilizes existing experimental capabilities.
Directory of Open Access Journals (Sweden)
Christian John Etwire
2015-03-01
Full Text Available Abstract This paper examines further a Mixed Integer Linear Programming model constructed for optimal hydrothermal energy generation for Ghana as in 1. Post Optimal Analysis is carried out on the model in order to assess its stability to slight variations of some input parameters such as minimum level running costs extra hourly running costs above minimum level and start up costs of each generator on one hand and load demands and reserve margins on the other. The results show that the firm could minimize its cost of power generation if its input parameters were comparable to those lying between the 10 percent and -10 percent range.The10 percent and -10 percent range yielded a range of investment plans for the firmand also provided a basis for the selection of the best optimal solution.
Mixed-Integer Linear Programming Models for Teaching Assistant Assignment and Extensions
Directory of Open Access Journals (Sweden)
Xiaobo Qu
2017-01-01
Full Text Available In this paper, we develop mixed-integer linear programming models for assigning the most appropriate teaching assistants to the tutorials in a department. The objective is to maximize the number of tutorials that are taught by the most suitable teaching assistants, accounting for the fact that different teaching assistants have different capabilities and each teaching assistant’s teaching load cannot exceed a maximum value. Moreover, with optimization models, the teaching load allocation, a time-consuming process, does not need to be carried out in a manual manner. We have further presented a number of extensions that capture more practical considerations. Extensive numerical experiments show that the optimization models can be solved by an off-the-shelf solver and used by departments in universities.
An efficient FPGA architecture for integer ƞth root computation
Rangel-Valdez, Nelson; Barron-Zambrano, Jose Hugo; Torres-Huitzil, Cesar; Torres-Jimenez, Jose
2015-10-01
In embedded computing, it is common to find applications such as signal processing, image processing, computer graphics or data compression that might benefit from hardware implementation for the computation of integer roots of order ?. However, the scientific literature lacks architectural designs that implement such operations for different values of N, using a low amount of resources. This article presents a parameterisable field programmable gate array (FPGA) architecture for an efficient Nth root calculator that uses only adders/subtractors and ? location memory elements. The architecture was tested for different values of ?, using 64-bit number representation. The results show a consumption up to 10% of the logical resources of a Xilinx XC6SLX45-CSG324C device, depending on the value of N. The hardware implementation improved the performance of its corresponding software implementations in one order of magnitude. The architecture performance varies from several thousands to seven millions of root operations per second.
Directory of Open Access Journals (Sweden)
Y. Lee
2014-12-01
Full Text Available In orthogonal frequency division multiplexing (OFDM systems, an integer part of a frequency offset (IFO that causes ambiguity in data demodulation is estimated generally by comparing correlations between the received and local signals for IFO candidates. In this paper, we propose an IFO estimation scheme that provides a tradeoff between the estimation performance and the computational complexity including a conventional scheme as a special case. In the proposed scheme, template signals are formed by combining frequency-shifted training symbols, allowing the receiver to reduce the number of IFO candidates in the estimation process. Numerical results illustrate the tradeoff of the proposed scheme: The proposed scheme exhibits a tradeoff between the correct estimation probability and the computational complexity taking the number of the training symbols used to construct the template signal as a parameter.
Upper Bounds on the Number of Solutions of Binary Integer Programs
Jain, Siddhartha; Kadioglu, Serdar; Sellmann, Meinolf
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for a redundant knapsack constraint which is obtained by surrogate relaxation. We then consider a Lagrangian relaxation of the original problem to obtain an initial weight bound on the knapsack. This bound is then refined through subgradient optimization. The latter provides a variety of Lagrange multipliers which allow us to filter infeasible edges in the DP table. The number of paths in the final table then provides an upper bound on the number of solutions. Numerical results show the effectiveness of our counting framework on automatic recording and market split problems.
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.
Superintegrable models on Riemannian surfaces of revolution with integrals of any integer degree (I)
Valent, Galliano
2017-07-01
We present a family of superintegrable (SI) systems which live on a Riemannian surface of revolution and which exhibit one linear integral and two integrals of any integer degree larger or equal to 2 in the momenta. When this degree is 2, one recovers a metric due to Koenigs. The local structure of these systems is under control of a linear ordinary differential equation of order n which is homogeneous for even integrals and weakly inhomogeneous for odd integrals. The form of the integrals is explicitly given in the so-called "simple" case (see Definition 2). Some globally defined examples are worked out which live either in H2 or in R2.
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)
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
Most real-world optimization problems are multiobjective by nature, involving noncomparable objectives. Many of these problems can be formulated in terms of a set of linear objective functions that should be simultaneously optimized over a class of linear constraints. Often there is the complicat......Most real-world optimization problems are multiobjective by nature, involving noncomparable objectives. Many of these problems can be formulated in terms of a set of linear objective functions that should be simultaneously optimized over a class of linear constraints. Often...... 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...
On a thin set of integers involving the largest prime factor function
Directory of Open Access Journals (Sweden)
Jean-Marie De Koninck
2003-01-01
Full Text Available For each integer n≥2, let P(n denote its largest prime factor. Let S:={n≥2:n does not divide P(n!} and S(x:=#{n≤x:n∈S}. Erdős (1991 conjectured that S is a set of zero density. This was proved by Kastanas (1994 who established that S(x=O(x/logx. Recently, Akbik (1999 proved that S(x=O(x exp{−(1/4logx}. In this paper, we show that S(x=x exp{−(2+o(1×log x log log x}. We also investigate small and large gaps among the elements of S and state some conjectures.
Interactions, disorder and spin waves in quantum Hall ferromagnets near integer filling
Rapsch, S
2001-01-01
dynamics is discussed in chapter 5 and employed to study spin waves in a domain wall structure. A hydrodynamic theory of spin waves is used to treat long-wavelength excitations of randomly disordered quantum Hall ferromagnets. Finally, the contribution of spin waves to the optical conductivity is studied in chapter 6. Predictions are made for the experimental signatures of spin waves in disordered quantum Hall systems. The observability of these signatures is discussed both for transport measurements and NMR experiments. The interplay between exchange interactions and disorder is studied in quantum Hall ferromagnets near integer filling. Both analytical and numerical methods are used to investigate a non-linear sigma model of these systems in the limit of vanishing Zeeman coupling and at zero temperature. Chapter 1 gives an introduction to the quantum Hall effect and to quantum Hall ferromagnets in particular. A brief review of existing work on disordered quantum Hall systems is included. In chapters 2-4, the...
Gorissen, Bram L; Hoffmann, Aswin L
2014-01-01
Current inverse treatment planning methods that optimize both catheter positions and dwell times in prostate HDR brachytherapy use surrogate linear or quadratic objective functions that have no direct interpretation in terms of dose-volume histogram (DVH) criteria, do not result in an optimum or have long solution times. We decrease the solution time of existing linear and quadratic dose-based programming models (LP and QP, respectively) to allow optimizing over potential catheter positions using mixed integer programming. An additional average speed-up of 75% can be obtained by stopping the solver at an early stage, without deterioration of the plan quality. For a fixed catheter configuration, the dwell time optimization model LP solves to optimality in less than 15 seconds, which confirms earlier results. We propose an iterative procedure for QP that allows to prescribe the target dose as an interval, while retaining independence between the solution time and the number of dose calculation points. This iter...
Energy Technology Data Exchange (ETDEWEB)
Linderoth, Jeff T. [University of Wisconsin-Madison; Luedtke, James R. [University of Wisconsin-Madison
2013-05-30
The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Problems involving both discrete and nonlinear components are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems. This research project added to the understanding of this area by making a number of fundamental advances. First, the work demonstrated many novel, strong, tractable relaxations designed to deal with non-convexities arising in mathematical formulation. Second, the research implemented the ideas in software that is available to the public. Finally, the work demonstrated the importance of these ideas on practical applications and disseminated the work through scholarly journals, survey publications, and conference presentations.
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
of the contents of commitments and for verifying multiplicative relations over the integers on committed values. The scheme can be seen as a generalization, with a slight modification, of the earlier scheme of Fujisaki and Okamoto [14]. The reasons we revisit the earlier scheme and give some modification...... 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...... modification, even non-Abelian groups. Our scheme can replace the earlier one in various other constructions, such as the efficient interval proofs of Boudot [4] and the efficient proofs for the product of two safe primes proposed by Camenisch and Michels [9]....
Service Class Mapping based on Integer Programming Algorithm in the Third Party Agent
Directory of Open Access Journals (Sweden)
B. J. Mali
2015-06-01
Full Text Available In this paper, we propose a novel algorithm for mapping of service classes among multiple Internet providers on an end-to-end (E2E path. The third-party (3P approach is assumed for E2E service negotiation, whereas the foundation for class mapping is laid on the integer programming mathematical model. The algorithm selects service classes in domains on the path so that requirements for E2E quality of service (QoS are fulfilled. This selection is based on multiple constraints, referring to performance fulfillment and at the same time aiming to achieve minimal E2E interconnection cost through definition of a single objective function. Performance evaluation has clearly indicated benefits of the proposed algorithm in terms of QoS achievement and decreasing costs, as well as its suitability for services that require stringent QoS guarantees.
Dual amplitudes constructed on J>0 integer point SU$_{1,1}$ representations
Lebrun, J P
1973-01-01
One studies the possibility of constructing factorizable dual amplitudes based on positive integer point SU/sub 1,1/ representations. The (2J+1) invariant subspace in D/sup (x)/ leads in this case to a (2J+1)-dimensional generalized zero mode that can be interpreted in terms of an internal spin of the ground state. Typically, Born-term amplitudes constructed in this manner will exhibit multipole ghosts on nonleading levels. A divergence is also present at the Born-term level. It is suggested that these models can also be formulated as Lagrangian field theories on a two-dimensional manifold. This may yield a way of formulating auxiliary conditions and investigating whether the state vector space can be divided in physical and nonphysical sectors. (9 refs).
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
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......In this paper, an adaptive multi-objective Fractional-Order Fuzzy proportional-integral-derivative (MOFOFPID) controller is proposed for the load frequency control (LFC) of islanded Microgrids (MGs), while benefiting from the assets of electric vehicles (EVs) in this respect. Although the use...... 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...
New Approaches to Minimum-Energy Design of Integer- and Fractional-Order Perfect Control Algorithms
Hunek, Wojciech P.; Wach, Łukasz
2017-10-01
In this paper the new methods concerning the energy-based minimization of the perfect control inputs is presented. For that reason the multivariable integer- and fractional-order models are applied which can be used for describing a various real world processes. Up to now, the classical approaches have been used in forms of minimum-norm/least squares inverses. Notwithstanding, the above-mentioned tool do not guarantee the optimal control corresponding to optimal input energy. Therefore the new class of inversebased methods has been introduced, in particular the new σ- and H-inverse of nonsquare parameter and polynomial matrices. Thus a proposed solution remarkably outperforms the typical ones in systems where the control runs can be understood in terms of different physical quantities, for example heat and mass transfer, electricity etc. A simulation study performed in Matlab/Simulink environment confirms the big potential of the new energy-based approaches.
Synchronic interval Gaussian mixed-integer programming for air quality management.
Cheng, Guanhui; Huang, Guohe Gordon; Dong, Cong
2015-12-15
To reveal the synchronism of interval uncertainties, the tradeoff between system optimality and security, the discreteness of facility-expansion options, the uncertainty of pollutant dispersion processes, and the seasonality of wind features in air quality management (AQM) systems, a synchronic interval Gaussian mixed-integer programming (SIGMIP) approach is proposed in this study. A robust interval Gaussian dispersion model is developed for approaching the pollutant dispersion process under interval uncertainties and seasonal variations. The reflection of synchronic effects of interval uncertainties in the programming objective is enabled through introducing interval functions. The proposition of constraint violation degrees helps quantify the tradeoff between system optimality and constraint violation under interval uncertainties. The overall optimality of system profits of an SIGMIP model is achieved based on the definition of an integrally optimal solution. Integer variables in the SIGMIP model are resolved by the existing cutting-plane method. Combining these efforts leads to an effective algorithm for the SIGMIP model. An application to an AQM problem in a region in Shandong Province, China, reveals that the proposed SIGMIP model can facilitate identifying the desired scheme for AQM. The enhancement of the robustness of optimization exercises may be helpful for increasing the reliability of suggested schemes for AQM under these complexities. The interrelated tradeoffs among control measures, emission sources, flow processes, receptors, influencing factors, and economic and environmental goals are effectively balanced. Interests of many stakeholders are reasonably coordinated. The harmony between economic development and air quality control is enabled. Results also indicate that the constraint violation degree is effective at reflecting the compromise relationship between constraint-violation risks and system optimality under interval uncertainties. This can
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 pra...
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…
2014-03-27
Partitions via Integer Programming”. Universidade Estadual de Campinas, Instituto de Computação, Campinas/SP, Brazil, 1998. [33] Nigam, Nikhil... Mexico . September 25–28, 2007. [39] Rader, David. Deterministic Operations Research. Wiley, New Jersey, 2010. [40] Stone, Andrea. “Drone Program Aims To
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
Penas, David R; Henriques, David; González, Patricia; Doallo, Ramón; Saez-Rodriguez, Julio; Banga, Julio R
2017-01-01
We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested in applying this framework to the reverse engineering problem in computational systems biology, which yields very large mixed-integer dynamic optimization (MIDO) problems. In particular, we consider the framework of logic-based ordinary differential equations (ODEs). We present saCeSS2, a parallel method for the solution of this class of problems. This method is based on an parallel cooperative scatter search metaheuristic, with new mechanisms of self-adaptation and specific extensions to handle large mixed-integer problems. We have paid special attention to the avoidance of convergence stagnation using adaptive cooperation strategies tailored to this class of problems. We illustrate its performance with a set of three very challenging case studies from the domain of dynamic modelling of cell signaling. The simpler case study considers a synthetic signaling pathway and has 84 continuous and 34 binary decision variables. A second case study considers the dynamic modeling of signaling in liver cancer using high-throughput data, and has 135 continuous and 109 binaries decision variables. The third case study is an extremely difficult problem related with breast cancer, involving 690 continuous and 138 binary decision variables. We report computational results obtained in different infrastructures, including a local cluster, a large supercomputer and a public cloud platform. Interestingly, the results show how the cooperation of individual parallel searches modifies the systemic properties of the sequential algorithm, achieving superlinear speedups compared to an individual search (e.g. speedups of 15 with 10 cores), and significantly improving (above a 60%) the performance with respect to a non-cooperative parallel scheme. The scalability of the method is also good (tests
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
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.
Designing A Nonlinear Integer Programming Model For A Cross-Dock By A Genetic Algorithm
Directory of Open Access Journals (Sweden)
Bahareh Vaisi
2015-03-01
Full Text Available Abstract This paper presents a non-linear integer programming model for a cross-dock problem that considers the total transportation cost of inbound and outbound trucks from an origin to a destination and the total cost of assigning strip and stack doors to trucks based on their number of trips and the distance between doors in cross-dock. In previous studies these two cost-based problems are modeled separately however it is more realistic and practical to use both of them as an integrated cross-docking model. Additionally this model is solved for a randomly generated numerical example with three suppliers and two customers by the use of a genetic algorithm. By comparing two different parameter levels i.e. low and high numbers of populations the optimum solution is obtained considering a high level population size. A number of strip and stack doors are equal to a number of inbound and outbound trucks in the same sequence as 4 and 6 respectively. Finally the conclusion is presented.
Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment
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
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.
Optimising the selection of food items for FFQs using Mixed Integer Linear Programming.
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.
A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.
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.
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.
Directory of Open Access Journals (Sweden)
Vahid Reza Ghezavati
2011-01-01
Full Text Available This research defines a new application of mathematical modeling to design a cellular manufacturing system integrated with group scheduling and layout aspects in an uncertain decision space under a supply chain characteristics. The aim is to present a mixed integer programming (MIP which optimizes cell formation, scheduling and layout decisions, concurrently where the suppliers are required to operate exceptional products. For this purpose, the time in which parts need to be operated on machines and also products' demand are uncertain and explained by set of scenarios. This model tries to optimize expected holding cost and the costs regarded to the suppliers network in a supply chain in order to outsource exceptional operations. Scheduling decisions in a cellular manufacturing framework is treated as group scheduling problem, which assumes that all parts in a part group are operated in the same cell and no inter-cellular transfer is required. An efficient hybrid method made of genetic algorithm (GA and simulated annealing (SA will be proposed to solve such a complex problem under an optimization rule as a sub-ordinate section. This integrative combination algorithm is compared with global solutions and also, a benchmark heuristic algorithm introduced in the literature. Finally, performance of the algorithm will be verified through some test problems.
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling
Directory of Open Access Journals (Sweden)
Jan-Henrik Haunert
2017-11-01
Full Text Available Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in a map and for each feature a set of label candidates, a common problem is to select an independent set of labels (that is, a labeling without label–label intersections that contains as many labels as possible and at most one label for each feature. To obtain solutions of high cartographic quality, the labels can be weighted and one can maximize the total weight (rather than the number of the selected labels. We argue, however, that when maximizing the weight of the labeling, the influences of labels on other labels are insufficiently addressed. Furthermore, in a maximum-weight labeling, the labels tend to be densely packed and thus the map background can be occluded too much. We propose extensions of an existing model to overcome these limitations. Since even without our extensions the problem is NP-hard, we cannot hope for an efficient exact algorithm for the problem. Therefore, we present a formalization of our model as an integer linear program (ILP. This allows us to compute optimal solutions in reasonable time, which we demonstrate both for randomly generated point sets and an existing data set of cities. Moreover, a relaxation of our ILP allows for a simple and efficient heuristic, which yielded near-optimal solutions for our instances.
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.
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%.
Real-Time Hybrid In-Station Bus Dispatching Strategy Based on Mixed Integer Programming
Directory of Open Access Journals (Sweden)
Shi An
2016-07-01
Full Text Available The actual bus headway often deviates from the planned departure frequency because of external factors, such as traffic conditions and public transport demand, leading to transit resource waste and reducing the quality of service. In view of the existing shortcomings of the current dispatching strategy, a mixed integer programming model, integrating a bus-holding and stop-skipping strategy, is constructed to improve transit service with a minimum cost. The real-time optimal holding and stop-skipping strategies can be obtained by solving the proposed model using the Lagrangian relaxation algorithm. A numerical example is conducted using real transit GPS (Global Position System and IC (Intelligent Card data in Harbin. The results show that compared to a single control strategy, the proposed hybrid model is a better trade-off between the quality of the transit service and the operation cost. Notably, such a strategy would produce a minimal passengers’ average travel time coefficient. It is a great help for promoting the transit service level and increasing competitiveness.
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.
Gu, J J; Huang, G H; Guo, P; Shen, N
2013-10-15
In this study, an interval multistage joint-probabilistic integer programming method was developed to address certain problems in water resource regulation. This method effectively deals with data in the form of intervals and probability distribution. It can also process uncertain data in the form of joint probabilities. The proposed method can also reflect the linkage and dynamic variability between particular stages in multi-stage planning. Sensitivity analysis on moderate violations and security constraints showed that the degree of constraint violation was closely linked to the final benefits of the system. The developed method was applied in the case study of the joint-operation of the Tianzhuang and Bashan Reservoirs in Huaihe River, China. In this case study, the proposed method can deal with the water shortage problems downstream and the distribution problems caused by excess water in the reservoir. It can also guarantee the optimization of long-term water usage of both Reservoirs and the river downstream. Copyright © 2013 Elsevier Ltd. All rights reserved.
A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach
Shafiee, Morteza; Lotfi, Farhad Hosseinzadeh; Saleh, Hilda; Ghaderi, Mehdi
2016-11-01
One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856-864, 2010) proposed a bi-level structure for cost efficiency at the first time. In this model, multi-level programming and cost efficiency were used. He used a nonlinear programming to solve the model. In this paper, we have focused on multi-level structure and proposed a bi-level DEA model. We then used a liner programming to solve our model. In other hand, we significantly improved the way to achieve the optimum solution in comparison with the work by Wu (2010) by converting the NP-hard nonlinear programing into a mixed integer linear programming. This study uses a bi-level programming data envelopment analysis model that embodies internal structure with Stackelberg-game relationships to evaluate the performance of banking chain. The perspective of decentralized decisions is taken in this paper to cope with complex interactions in banking chain. The results derived from bi-level programming DEA can provide valuable insights and detailed information for managers to help them evaluate the performance of the banking chain as a whole using Stackelberg-game relationships. Finally, this model was applied in the Iranian bank to evaluate cost efficiency.
An integer programming for airplane rounting in the U.S. Center-TRACON
Directory of Open Access Journals (Sweden)
Srisawat Supsomboon
2015-06-01
Full Text Available Air travel has been a major transportation for commerce and tour in many countries. As the demand of air traffic has been increasing, air traffic management has confronted with poverty of handling the increase of the demand of runway facilities where congestion often takes place. In order to cope with such problems, runway efficiency enhancement or capacity increasing are taken into account. In air traffic management, the effective air space utilization and air control workload management can be improved by the use of many up-to-date technologies in forms of decision support tools. This study developed a computer-aided decision support model in the form of integer programming. The purpose of the model was to allocate airplanes arrival at U.S. Center-TRACON airspace to enter feeder gates and to design optimal routes along the track to runway. Results of optimal path of the airplanes throughout the TRACON air space system which yield a minimum delay were presented.
Realization of a Quantum Integer-Spin Chain with Controllable Interactions
Directory of Open Access Journals (Sweden)
C. Senko
2015-06-01
Full Text Available The physics of interacting integer-spin chains has been a topic of intense theoretical interest, particularly in the context of symmetry-protected topological phases. However, there has not been a controllable model system to study this physics experimentally. We demonstrate how spin-dependent forces on trapped ions can be used to engineer an effective system of interacting spin-1 particles. Our system evolves coherently under an applied spin-1 XY Hamiltonian with tunable, long-range couplings, and all three quantum levels at each site participate in the dynamics. We observe the time evolution of the system and verify its coherence by entangling a pair of effective three-level particles (“qutrits” with 86% fidelity. By adiabatically ramping a global field, we produce ground states of the XY model, and we demonstrate an instance where the ground state cannot be created without breaking the same symmetries that protect the topological Haldane phase. This experimental platform enables future studies of symmetry-protected order in spin-1 systems and their use in quantum applications.
Manifestation of many-body interactions in the integer quantum Hall effect regime
Oswald, Josef; Römer, Rudolf A.
2017-09-01
We use the self-consistent Hartree-Fock approximation for numerically addressing the integer quantum Hall (IQH) regime in terms of many-body physics at higher Landau levels (LL). The results exhibit a strong tendency to avoid the simultaneous existence of partly filled spin-up and spin-down LLs. Partly filled LLs appear as a mixture of coexisting regions of full and empty LLs. We obtain edge stripes with approximately constant filling factor ν close to half-odd filling at the boundaries between the regions of full and empty LLs, which we explain in terms of the g -factor enhancement as a function of a locally varying ν across the compressible stripes. The many-particle interactions follow a behavior as it would result from applying Hund's rule for the occupation of the spin split LLs. The screening of the disorder and edge potential appears significantly reduced as compared to screening based on a Thomas-Fermi approximation. For addressing carrier transport, we use a nonequilibrium network model (NNM) that handles the lateral distribution of the experimentally injected nonequilibrium chemical potentials μ .
A 0-1 Integer Programming Model for the Course Scheduling Problem and A Case Study
Directory of Open Access Journals (Sweden)
Hakan ALTUNAY
2016-01-01
Full Text Available The course scheduling problem is one of the most common timetabling problems which are frequently encountered in all educational institutions, especially universities. This problem which is getting harder to solve day by day, means the assignment of the lessons and lecturers into the most suitable timeslots and classrooms, provided that various constraints are taken into account. These constraints peculiar to the problem are consisted due to various factors such as the characteristics and the rules of the educational institutions, preferences of lecturers, students’ requests and suggestions. In this study, a novel 0-1 integer programming model that considers preferences of lecturers is proposed for the course scheduling problem. The proposed mathematical model is also tested with a case study from Uludag University. Thus, the performance of the mathematical model can be tested and the results can be analyzed. The results of the carried out application show efficient results in preparing a course schedule that meets the preferences of the lecturers and complies with the rules of the institutions.
Cipriani, Mattia; Nitta, Muneto
2013-10-01
We study the effects of the internal coherent (Rabi) coupling in vortex lattices in two-component BECs under rotation. We find how the vortex lattices without the Rabi coupling known before are connected to the Abrikosov lattice of integer vortices with increasing the Rabi coupling. We find that (1) for small Rabi couplings, fractional vortices in a triangular or square lattice for small or large intercomponent coupling constitute hexamers or tetramers, namely multidimer bound states made of six or four vortices, respectively, (2) these bound states are broken into a set of dimers at intermediate Rabi couplings, and (3) vortices change their partners in various ways depending on the intercomponent coupling, to organize themselves for constituting the Abrikosov lattice of integer vortices at strong Rabi couplings.
Cipriani, Mattia; Nitta, Muneto
2013-10-25
We study the effects of the internal coherent (Rabi) coupling in vortex lattices in two-component BECs under rotation. We find how the vortex lattices without the Rabi coupling known before are connected to the Abrikosov lattice of integer vortices with increasing the Rabi coupling. We find that (1) for small Rabi couplings, fractional vortices in a triangular or square lattice for small or large intercomponent coupling constitute hexamers or tetramers, namely multidimer bound states made of six or four vortices, respectively, (2) these bound states are broken into a set of dimers at intermediate Rabi couplings, and (3) vortices change their partners in various ways depending on the intercomponent coupling, to organize themselves for constituting the Abrikosov lattice of integer vortices at strong Rabi couplings.
Cipriani, Mattia; Nitta, Muneto
2013-01-01
We study effects of the internal coherent (Rabi) coupling in vortex lattices in two-component BECs under rotation. We find how the vortex lattices without the Rabi coupling known before are connected to the Abrikosov lattice of integer vortices with increasing the Rabi coupling. We find that 1) for small Rabi couplings, fractional vortices in triangular or square lattice for small or large inter-component coupling constitute hexamers or tetramers, namely multi-dimer bound states made of six o...
A MIXED-INTEGER PROGRAMMING ANALYSIS OF THE STRUCTURE OF A FLORIDA-BASED CATTLE FEEDING INDUSTRY
Spreen, Thomas H.; Moseley, Anne E.; Pheasant, Jim W.
1986-01-01
Florida is typical of many southeastern states in that it exports feeder cattle and imports carcass and boxed beef. The objective of this paper is to estimate the cost of retaining feeder cattle in Florida, feeding these cattle to slaughter weights, slaughtering them, and distributing the meat to retail outlets. A mixed integer programming model is developed. The optimal number and location of feedlots and slaughter plants are determined. The results indicate that at production levels exceedi...
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.
Shoemaker, Christine; Wan, Ying
2016-04-01
Optimization of nonlinear water resources management issues which have a mixture of fixed (e.g. construction cost for a well) and variable (e.g. cost per gallon of water pumped) costs has been not well addressed because prior algorithms for the resulting nonlinear mixed integer problems have required many groundwater simulations (with different configurations of decision variable), especially when the solution space is multimodal. In particular heuristic methods like genetic algorithms have often been used in the water resources area, but they require so many groundwater simulations that only small systems have been solved. Hence there is a need to have a method that reduces the number of expensive groundwater simulations. A recently published algorithm for nonlinear mixed integer programming using surrogates was shown in this study to greatly reduce the computational effort for obtaining accurate answers to problems involving fixed costs for well construction as well as variable costs for pumping because of a substantial reduction in the number of groundwater simulations required to obtain an accurate answer. Results are presented for a US EPA hazardous waste site. The nonlinear mixed integer surrogate algorithm is general and can be used on other problems arising in hydrology with open source codes in Matlab and python ("pySOT" in Bitbucket).
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.
Directory of Open Access Journals (Sweden)
Adel Ouannas
2015-01-01
Full Text Available A robust control approach is presented to study the problem of Q-S synchronization between Integer-order and fractional-order chaotic systems with different dimensions. Based on Laplace transformation and stability theory of linear integer-order dynamical systems, a new control law is proposed to guarantee the Q-S synchronization between n-dimensional integer-order master system and m-dimensional fractional-order slave system. This paper provides further contribution to the topic of Q-S chaos synchronization between integer-order and fractional-order systems and introduces a general control scheme that can be applied to wide classes of chaotic and hyperchaotic systems. Illustrative example and numerical simulations are used to show the effectiveness of the proposed method.
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.
Lapa, Matthew F.; Hughes, Taylor L.
2017-09-01
We study perturbative and global anomalies at the boundaries of bosonic analogs of integer quantum Hall (BIQH) and topological insulator (BTI) phases using a description of the boundaries of these phases in terms of a nonlinear sigma model (NLSM) with Wess-Zumino term. One of the main results of the paper is that these anomalies are robust against arbitrary smooth deformations of the target space of the NLSM which describes the phase, provided that the deformations also respect the symmetry of the phase. In the first part of the paper, we discuss the perturbative U(1 ) anomaly at the boundary of BIQH states in all odd (space-time) dimensions. In the second part, we study global anomalies at the boundary of BTI states in even dimensions. In a previous work [Lapa et al., Phys. Rev. B 95, 035149 (2017), 10.1103/PhysRevB.95.035149] we argued that the boundary of the BTI phase exhibits a global anomaly which is an analog of the parity anomaly of Dirac fermions in three dimensions. Here, we elevate this argument to a proof for the boundary of the two-dimensional BTI state by explicitly computing the partition function of the gauged NLSM describing the boundary. We then use the powerful equivariant localization technique to show that this global anomaly is robust against all smooth deformations of the target space of the NLSM which preserve the U(1 ) ⋊Z2 symmetry of the BTI state. We also comment on the difficulties of generalizing this latter proof to higher dimensions. Finally, we discuss the expected low-energy behavior of the boundary theories studied in this paper when the coupling constants are allowed to flow under the renormalization group.
Large-Scale Bi-Level Strain Design Approaches and Mixed-Integer Programming Solution Techniques
Kim, Joonhoon; Reed, Jennifer L.; Maravelias, Christos T.
2011-01-01
The use of computational models in metabolic engineering has been increasing as more genome-scale metabolic models and computational approaches become available. Various computational approaches have been developed to predict how genetic perturbations affect metabolic behavior at a systems level, and have been successfully used to engineer microbial strains with improved primary or secondary metabolite production. However, identification of metabolic engineering strategies involving a large number of perturbations is currently limited by computational resources due to the size of genome-scale models and the combinatorial nature of the problem. In this study, we present (i) two new bi-level strain design approaches using mixed-integer programming (MIP), and (ii) general solution techniques that improve the performance of MIP-based bi-level approaches. The first approach (SimOptStrain) simultaneously considers gene deletion and non-native reaction addition, while the second approach (BiMOMA) uses minimization of metabolic adjustment to predict knockout behavior in a MIP-based bi-level problem for the first time. Our general MIP solution techniques significantly reduced the CPU times needed to find optimal strategies when applied to an existing strain design approach (OptORF) (e.g., from ∼10 days to ∼5 minutes for metabolic engineering strategies with 4 gene deletions), and identified strategies for producing compounds where previous studies could not (e.g., malate and serine). Additionally, we found novel strategies using SimOptStrain with higher predicted production levels (for succinate and glycerol) than could have been found using an existing approach that considers network additions and deletions in sequential steps rather than simultaneously. Finally, using BiMOMA we found novel strategies involving large numbers of modifications (for pyruvate and glutamate), which sequential search and genetic algorithms were unable to find. The approaches and solution
Aspect-object alignment with Integer Linear Programming in opinion mining.
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.
Exponential decay characteristics of the stochastic integer multiple neural firing patterns.
Gu, Huaguang; Jia, Bing; Lu, Qishao
2011-03-01
Integer multiple neural firing patterns exhibit multi-peaks in inter-spike interval (ISI) histogram (ISIH) and exponential decay in amplitude of peaks, which results from their stochastic mechanisms. But in previous experimental observation that the decay in ISIH frequently shows obvious bias from exponential law. This paper studied three typical cases of the decay, by transforming ISI series of the firing to discrete binary chain and calculating the probabilities or frequencies of symbols over the whole chain. The first case is the exponential decay without bias. An example of this case was discovered on hippocampal CA1 pyramidal neuron stimulated by external signal. Probability calculation shows that this decay without bias results from a stochastic renewal process, in which the successive spikes are independent. The second case is the exponential decay with a higher first peak, while the third case is that with a lower first peak. An example of the second case was discovered in experiment on a neural pacemaker. Simulation and calculation of the second and third cases indicate that the dependency in successive spikes of the firing leads to the bias seen in decay of ISIH peaks. The quantitative expression of the decay slope of three cases of firing patterns, as well as the excitatory effect in the second case of firing pattern and the inhibitory effect in the third case of firing pattern are identified. The results clearly reveal the mechanism of the exponential decay in ISIH peaks of a number of important neural firing patterns and provide new understanding for typical bias from the exponential decay law.
Mixed-integer programming methods for transportation and power generation problems
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.
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.
Large-scale bi-level strain design approaches and mixed-integer programming solution techniques.
Kim, Joonhoon; Reed, Jennifer L; Maravelias, Christos T
2011-01-01
The use of computational models in metabolic engineering has been increasing as more genome-scale metabolic models and computational approaches become available. Various computational approaches have been developed to predict how genetic perturbations affect metabolic behavior at a systems level, and have been successfully used to engineer microbial strains with improved primary or secondary metabolite production. However, identification of metabolic engineering strategies involving a large number of perturbations is currently limited by computational resources due to the size of genome-scale models and the combinatorial nature of the problem. In this study, we present (i) two new bi-level strain design approaches using mixed-integer programming (MIP), and (ii) general solution techniques that improve the performance of MIP-based bi-level approaches. The first approach (SimOptStrain) simultaneously considers gene deletion and non-native reaction addition, while the second approach (BiMOMA) uses minimization of metabolic adjustment to predict knockout behavior in a MIP-based bi-level problem for the first time. Our general MIP solution techniques significantly reduced the CPU times needed to find optimal strategies when applied to an existing strain design approach (OptORF) (e.g., from ∼10 days to ∼5 minutes for metabolic engineering strategies with 4 gene deletions), and identified strategies for producing compounds where previous studies could not (e.g., malate and serine). Additionally, we found novel strategies using SimOptStrain with higher predicted production levels (for succinate and glycerol) than could have been found using an existing approach that considers network additions and deletions in sequential steps rather than simultaneously. Finally, using BiMOMA we found novel strategies involving large numbers of modifications (for pyruvate and glutamate), which sequential search and genetic algorithms were unable to find. The approaches and solution
Large-scale bi-level strain design approaches and mixed-integer programming solution techniques.
Directory of Open Access Journals (Sweden)
Joonhoon Kim
Full Text Available The use of computational models in metabolic engineering has been increasing as more genome-scale metabolic models and computational approaches become available. Various computational approaches have been developed to predict how genetic perturbations affect metabolic behavior at a systems level, and have been successfully used to engineer microbial strains with improved primary or secondary metabolite production. However, identification of metabolic engineering strategies involving a large number of perturbations is currently limited by computational resources due to the size of genome-scale models and the combinatorial nature of the problem. In this study, we present (i two new bi-level strain design approaches using mixed-integer programming (MIP, and (ii general solution techniques that improve the performance of MIP-based bi-level approaches. The first approach (SimOptStrain simultaneously considers gene deletion and non-native reaction addition, while the second approach (BiMOMA uses minimization of metabolic adjustment to predict knockout behavior in a MIP-based bi-level problem for the first time. Our general MIP solution techniques significantly reduced the CPU times needed to find optimal strategies when applied to an existing strain design approach (OptORF (e.g., from ∼10 days to ∼5 minutes for metabolic engineering strategies with 4 gene deletions, and identified strategies for producing compounds where previous studies could not (e.g., malate and serine. Additionally, we found novel strategies using SimOptStrain with higher predicted production levels (for succinate and glycerol than could have been found using an existing approach that considers network additions and deletions in sequential steps rather than simultaneously. Finally, using BiMOMA we found novel strategies involving large numbers of modifications (for pyruvate and glutamate, which sequential search and genetic algorithms were unable to find. The approaches and
Finding an Optimal Location of Line Facility using Evolutionary Algorithm and Integer Program
Taji, Takenao; Tanigawa, Shin-Ichi; Kamiyama, Naoyuki; Katoh, Naoki; Takizawa, Atsushi
In this paper, we consider the problem for determining an optimal location of a line facility in a city such as railway system. A line facility is modeled as a spanning tree embedded on the plane whose vertices represent stations and edges represent the rails connecting two stations, and people can travel not only by walk but also by using the line facility quickly. Suppose there are a finite number of towns in a city, only in which people lives. Then, our problem is to find a location of the stations as well as a connection of the stations such that the sum of travel time between all pairs of towns is minimum. Tsukamoto, Katoh and Takizawa proposed a heuristic algorithm for the problem which consists of two phases as follows. In the first phase, fixing the position of stations, it determines the topology of the line facility. The second phase optimizes the position of stations while the topology is fixed. The algorithm alternately executes these two phases until a converged solution is obtained. Tsukamoto et al. determined the topology of the line facility by solving minimum spanning tree (MST) in the first phase. In this paper, we propose two methods for determining the topology of the line facility so that the sum of travel time is minimized hoping to improving the previous algorithm. The first proposed method heuristically determine the topology by using evolutionary algorithm (EA). In the second method, we reduce our problem to minimum communication spanning tree (MCST) problem by making a further assumption, and solve it by formulating the problem as an integer program. We show the effectiveness of our proposed algorithm through the numerical experiments.
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
Real-Space Renormalization-Group Approach to the Integer Quantum Hall Effect
Cain, Philipp; Römer, Rudolf A.
We review recent results based on an application of the real-space renormalization group (RG) approach to a network model for the integer quantum Hall (QH) transition. We demonstrate that this RG approach reproduces the critical distribution of the power transmission coefficients, i.e., two-terminal conductances, Pc(G), with very high accuracy. The RG flow of P(G) at energies away from the transition yields a value of the critical exponent ν that agrees with most accurate large-size lattice simulations. A description of how to obtain other relevant transport coefficients such as RL and RH is given. From the non-trivial fixed point of the RG flow we extract the critical level-spacing distribution (LSD). This distribution is close, but distinctively different from the earlier large-scale simulations. We find that the LSD obeys scaling behavior around the QH transition with ν = 2.37±0.02. Away from the transition it crosses over towards the Poisson distribution. We next investigate the plateau-to-insulator transition at strong magnetic fields. For a fully quantum coherent situation, we find a quantized Hall insulator with RH≈h/e2 up to RL 20h/e2 when interpreting the results in terms of most probable value of the distribution function P(RH). Upon further increasing RL→∞, the Hall insulator with diverging Hall resistance R H∝ R Lκ is seen. The crossover between these two regimes depends on the precise nature of the averaging procedure for the distributions P(RL) and P(RH). We also study the effect of long-ranged inhomogeneities on the critical properties of the QH transition. Inhomogeneities are modeled by a smooth random potential with a correlator which falls off with distance as a power law r-α. Similar to the classical percolation, we observe an enhancement of ν with decreasing α. These results exemplify the surprising fact that a small RG unit, containing only five nodes, accurately captures most of the correlations responsible for the localization
Mixed integer programming with dose-volume constraints in intensity-modulated proton therapy.
Zhang, Pengfei; Fan, Neng; Shan, Jie; Schild, Steven E; Bues, Martin; Liu, Wei
2017-09-01
In treatment planning for intensity-modulated proton therapy (IMPT), we aim to deliver the prescribed dose to the target yet minimize the dose to adjacent healthy tissue. Mixed-integer programming (MIP) has been applied in radiation therapy to generate treatment plans. However, MIP has not been used effectively for IMPT treatment planning with dose-volume constraints. In this study, we incorporated dose-volume constraints in an MIP model to generate treatment plans for IMPT. We created a new MIP model for IMPT with dose volume constraints. Two groups of IMPT treatment plans were generated for each of three patients by using MIP models for a total of six plans: one plan was derived with the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method while the other plan was derived with our MIP model with dose-volume constraints. We then compared these two plans by dose-volume histogram (DVH) indices to evaluate the performance of the new MIP model with dose-volume constraints. In addition, we developed a model to more efficiently find the best balance between tumor coverage and normal tissue protection. The MIP model with dose-volume constraints generates IMPT treatment plans with comparable target dose coverage, target dose homogeneity, and the maximum dose to organs at risk (OARs) compared to treatment plans from the conventional quadratic programming method without any tedious trial-and-error process. Some notable reduction in the mean doses of OARs is observed. The treatment plans from our MIP model with dose-volume constraints can meet all dose-volume constraints for OARs and targets without any tedious trial-and-error process. This model has the potential to automatically generate IMPT plans with consistent plan quality among different treatment planners and across institutions and better protection for important parallel OARs in an effective way. © 2017 The Authors. Journal of Applied Clinical Medical Physics published by Wiley Periodicals, Inc. on
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.
Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya
2014-01-01
In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."
Goldbourt, A
2002-01-01
Experimental and theoretical aspects of the multiple-quantum magic-angle spinning experiment (MQMAS) are discussed in this review. The significance of this experiment, introduced by Frydman and Harwood, is in its ability to provide high-resolution NMR spectra of half-integer quadrupolar nuclei (I /geq 3/2). This technique has proved to be useful in various systems ranging from inorganic materials to biological samples. This review addresses the development of various pulse schemes aimed at improving the signal-to-noise ratio and anisotropic lineshapes. Representative spectra are shown to underscore the importance and applications of the MQMAS experiment. Refs. 97 (author)
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.
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...
On the Inferior and Superior k-th Power Part 0f a Positive Integer and Divisor Function
Jianfeng, Zheng
2004-01-01
For any positive integer n, let a(n) and b(n) denote the inferior and superior k-th power part of n respectively. That is, a(n) denotes the largest k-th power less than or equal to n, and b(n) denotes the smallest k-th power greater than or equal to n. In this paper, we study the properties of the sequences{a(n)} and {b(n)}, and give two interesting asymptotic formulas.
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.
Directory of Open Access Journals (Sweden)
Suhyun Kim
2014-10-01
Full Text Available Scanning moiré fringe (SMF imaging by high-angle annular dark field scanning transmission electron microscopy was used to measure the strain field in the channel of a transistor with a CoSi2 source and drain. Nanometer-scale SMFs were formed with a scanning grating size of ds at integer multiples of the Si crystal lattice spacing dl (ds ∼ ndl, n = 2, 3, 4, 5. The moiré fringe formula was modified to establish a method for quantifying strain measurement. We showed that strain fields in a transistor measured by SMF images were reproducible with an accuracy of 0.02%.
Skulovich, Olya; Bent, Russell; Judi, David; Perelman, Lina Sela; Ostfeld, Avi
2015-06-01
Despite their potential catastrophic impact, transients are often ignored or presented ad hoc when designing water distribution systems. To address this problem, we introduce a new piece-wise function fitting model that is integrated with mixed integer programming to optimally place and size surge tanks for transient control. The key features of the algorithm are a model-driven discretization of the search space, a linear approximation nonsmooth system response surface to transients, and a mixed integer linear programming optimization. Results indicate that high quality solutions can be obtained within a reasonable number of function evaluations and demonstrate the computational effectiveness of the approach through two case studies. The work investigates one type of surge control devices (closed surge tank) for a specified set of transient events. The performance of the algorithm relies on the assumption that there exists a smooth relationship between the objective function and tank size. Results indicate the potential of the approach for the optimal surge control design in water systems.
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.
Dai, Hao; Si, Gangquan; Jia, Lixin; Zhang, Yanbin
2013-11-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.
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.
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.
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.
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.
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.
Energy Technology Data Exchange (ETDEWEB)
Panthong, Kanda, E-mail: kanda.p@psu.ac.th [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)
Energy Technology Data Exchange (ETDEWEB)
Morais, Hugo; Faria, Pedro; Vale, Zita A.; Khodr, H.M. [GECAD - Knowledge Engineering and Decision-Support, Research Center of the Electrical Engineering, Polytechnic Institute of Porto (ISEP/IPP) (Portugal); Kadar, Peter [Budapest University of Technology and Economics, Muegyetem rkp. 3-9, H-1111 Budapest (Hungary)
2010-01-15
In the energy management of the isolated operation of small power system, the economic scheduling of the generation units is a crucial problem. Applying right timing can maximize the performance of the supply. The optimal operation of a wind turbine, a solar unit, a fuel cell and a storage battery is searched by a mixed-integer linear programming implemented in General Algebraic Modeling Systems (GAMS). A Virtual Power Producer (VPP) can optimal operate the generation units, assured the good functioning of equipment, including the maintenance, operation cost and the generation measurement and control. A central control at system allows a VPP to manage the optimal generation and their load control. The application of methodology to a real case study in Budapest Tech, demonstrates the effectiveness of this method to solve the optimal isolated dispatch of the DC micro-grid renewable energy park. The problem has been converged in 0.09 s and 30 iterations. (author)
Directory of Open Access Journals (Sweden)
Alberto Dolara
2017-02-01
Full Text Available This paper presents a comparison of optimization methods applied to islanded micro-grids including renewable energy sources, diesel generators and battery energy storage systems. In particular, a comparative analysis between an optimization model based on linear programming and a model based on mixed integer programming has been carried out. The general formulation of these models has been presented and applied to a real case study micro-grid installed in Somalia. The case study is an islanded micro-grid supplying the city of Garowe by means of a hybrid power plant, consisting of diesel generators, photovoltaic systems and batteries. In both models the optimization is based on load demand and renewable energy production forecast. The optimized control of the battery state of charge, of the spinning reserve and diesel generators allows harvesting as much renewable power as possible or to minimize the use of fossil fuels in energy production.
Energy Technology Data Exchange (ETDEWEB)
Pearce, Paul A., E-mail: p.pearce@ms.unimelb.edu.au [Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3010 (Australia); Rasmussen, Jørgen, E-mail: j.rasmussen@uq.edu.au [School of Mathematics and Physics, University of Queensland, St Lucia, Brisbane, Queensland 4072 (Australia); Tipunin, Ilya Yu., E-mail: tipunin@gmail.com [TAMM Theory Division, Lebedev Physics Institute, Leninski Pr., 53, Moscow 119991 (Russian Federation)
2014-12-15
For general Temperley–Lieb loop models, including the logarithmic minimal models LM(p,p{sup ′}) with p,p{sup ′} coprime integers, we construct an infinite family of Robin boundary conditions on the strip as linear combinations of Neumann and Dirichlet boundary conditions. These boundary conditions are Yang–Baxter integrable and allow loop segments to terminate on the boundary. Algebraically, the Robin boundary conditions are described by the one-boundary Temperley–Lieb algebra. Solvable critical dense polymers is the first member LM(1,2) of the family of logarithmic minimal models and has loop fugacity β=0 and central charge c=−2. Specialising to LM(1,2) with our Robin boundary conditions, we solve the model exactly on strips of arbitrary finite size N and extract the finite-size conformal corrections using an Euler–Maclaurin formula. The key to the solution is an inversion identity satisfied by the commuting double row transfer matrices. This inversion identity is established directly in the Temperley–Lieb algebra. We classify the eigenvalues of the double row transfer matrices using the physical combinatorics of the patterns of zeros in the complex spectral parameter plane and obtain finitised characters related to spaces of coinvariants of Z{sub 4} fermions. In the continuum scaling limit, the Robin boundary conditions are associated with irreducible Virasoro Verma modules with conformal weights Δ{sub r,s−1/2} =1/(32) (L{sup 2}−4) where L=2s−1−4r, r∈Z, s∈N. These conformal weights populate a Kac table with half-integer Kac labels. Fusion of the corresponding modules with the generators of the Kac fusion algebra is examined and general fusion rules are proposed.
Tong, Pan; Coombes, Kevin R
2012-11-15
Identifying genes altered in cancer plays a crucial role in both understanding the mechanism of carcinogenesis and developing novel therapeutics. It is known that there are various mechanisms of regulation that can lead to gene dysfunction, including copy number change, methylation, abnormal expression, mutation and so on. Nowadays, all these types of alterations can be simultaneously interrogated by different types of assays. Although many methods have been proposed to identify altered genes from a single assay, there is no method that can deal with multiple assays accounting for different alteration types systematically. In this article, we propose a novel method, integration using item response theory (integIRTy), to identify altered genes by using item response theory that allows integrated analysis of multiple high-throughput assays. When applied to a single assay, the proposed method is more robust and reliable than conventional methods such as Student's t-test or the Wilcoxon rank-sum test. When used to integrate multiple assays, integIRTy can identify novel-altered genes that cannot be found by looking at individual assay separately. We applied integIRTy to three public cancer datasets (ovarian carcinoma, breast cancer, glioblastoma) for cross-assay type integration which all show encouraging results. The R package integIRTy is available at the web site http://bioinformatics.mdanderson.org/main/OOMPA:Overview. kcoombes@mdanderson.org. Supplementary data are available at Bioinformatics online.
Zhang, Guang-Ming
Applying a symmetric bulk bipartition to the one-dimensional Affleck-Kennedy-Lieb-Tasaki valence bond solid (VBS) states for the integer spin-S Haldane gapped phase, we can create an array of fractionalized spin-S/2 edge states with the super unit cell l in the reduced bulk system, and the topological properties encoded in the VBS wave functions can be revealed. The entanglement Hamiltonian (EH) with l = even corresponds to the quantum antiferromagnetic Heisenberg spin-S/2 model. For the even integer spins, the EH still describes the Haldane gapped phase. For the odd integer spins, however, the EH just corresponds to the quantum antiferromagnetic Heisenberg half-odd integer spin model with spinon excitations, characterizing the critical point separating the topological Haldane phase from the trivial gapped phase. Our results thus demonstrate that the topological bulk property not only determines its fractionalized edge states, but also the quantum criticality associated with the topological phase, where the elementary excitations are precisely those fractionalized edge degrees of freedom confined in the bulk of the topological phase.
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.
A Classroom Note on: Bounds on Integer Solutions of xy = k(x + y) and xyz = k(xy + xz + yz)
Umar, Abdullahi; Alassar, Rajai
2011-01-01
Diophantine equations constitute a rich mathematical field. This article may be useful as a basis for a student math club project. There are several situations in which one needs to find a solution of indeterminate polynomial equations that allow the variables to be integers only. These indeterminate equations are fewer than the involved unknown…
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.
Directory of Open Access Journals (Sweden)
Esten I. Grøtli
2016-04-01
Full Text Available Large amounts of data are typically generated in applications such as surveillance of power lines and railways, inspection of gas pipes, and security surveillance. In the latter application it is a necessity that the data is transmitted to the control centre ``on-the-fly'' for analysis. Also missions related to other applications would greatly benefit from near real-time analysis and operator interaction based on captured data. This is the motivation behind this paper on coarse offline motion- and communication-planning for cooperating Unmanned Aerial Vehicles (UAVs. A Mixed-Integer Linear Programming (MILP problem is defined in order to solve the surveillance mission. To efficiently transmit the data back to the base station the vehicles are allowed to store data for later transmission and transmit via other vehicles, in addition to direct transmission. The paths obtained by solving the optimization problem are analyzed using a realistic radio propagation path loss simulator. If the radio propagation path loss exceeds the maximum design criterion the optimization problem is solved again with a stricter communication constraint, and the procedure is continued in an iterative manner until the criterion is met. The proposed algorithm is supported by simulations showing the resulting paths and communication topologies for different choices of delay tolerance.
Geiselbrecht, Hannes; Melzer, Roland R
2014-05-01
The external and internal structures of adult Neomysis integer mandibles were studied using light and electron microscopy with special reference to the lacinia mobilis, a highly specialized appendage on the gnathal edge of many crustaceans. The right and left lacinia mobilis are equipped with ciliary primary sensory cells revealing that both laciniae are also mechanosensory organs in addition to their mechanical function during mastication. A detailed character analyses indicated that the right lacinia is probably a highly derived sensory seta, whereas two alternative interpretations are considered for the left lacinia; it could be a sensillar appendage equipped with two mechanosensory units, or it could be a movable appendage of the incisor process containing two sensilla deprived of external appendages. The ecdysis of the lacinia mobilis corresponds very well to type I sensillar ecdysis, suggesting classification as a sensillar appendage. These features support a possible homology of the right lacinia mobilis in Peracarida and Decapoda, tracing them to an origin as a member of the setal row. Whether the left lacinia mobilis is a sensillum or an appendage with sensilla cannot be resolved presently. Copyright © 2014 Elsevier Ltd. All rights reserved.
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 .
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.
Schindler, Maike; Hußmann, Stephan; Nilsson, Per; Bakker, Arthur
2017-03-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.
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.
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.
Directory of Open Access Journals (Sweden)
Glyn Elwyn
2015-03-01
Full Text Available Background: Efforts have been made to measure integration in health care delivery, but few existing instruments have adopted a patient perspective, and none is sufficiently generic and brief for administration at scale. We sought to develop a brief and generic patient-reported measure of integration in health care delivery.Methods: Drawing on both existing conceptualisations of integrated care and research on patients’ perspectives, we chose to focus on four distinct domains of integration: information sharing,consistent advice, mutual respect and role clarity. We formulated candidate items and conducted cognitive interviews with end users to further develop and refine the items. We then pilot-tested the measure.Results: Four rounds of cognitive interviews were conducted (n = 14 and resulted in a four-item measure that was both relevant and understandable to end users. The pilot administration of the measure (n = 15 further confirmed the relevance and interpretability of items and demonstrated that the measure could be completed in less than one minute.Conclusions: This new measure, IntegRATE, represents a patient-reported measure of integration in health care delivery that is conducive to use in both routine performance monitoring and research. The psychometric properties of the measure will be assessed in the next stage of development.
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.
Tracking Simulation of Third-Integer Resonant Extraction for Fermilab's Mu2e Experiment
Energy Technology Data Exchange (ETDEWEB)
Park, Chong Shik [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Amundson, James [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Michelotti, Leo [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)
2015-02-13
The Mu2e experiment at Fermilab requires acceleration and transport of intense proton beams in order to deliver stable, uniform particle spills to the production target. To meet the experimental requirement, particles will be extracted slowly from the Delivery Ring to the external beamline. Using Synergia2, we have performed multi-particle tracking simulations of third-integer resonant extraction in the Delivery Ring, including space charge effects, physical beamline elements, and apertures. A piecewise linear ramp profile of tune quadrupoles was used to maintain a constant averaged spill rate throughout extraction. To study and minimize beam losses, we implemented and introduced a number of features, beamline element apertures, and septum plane alignments. Additionally, the RF Knockout (RFKO) technique, which excites particles transversely, is employed for spill regulation. Combined with a feedback system, it assists in fine-tuning spill uniformity. Simulation studies were carried out to optimize the RFKO feedback scheme, which will be helpful in designing the final spill regulation system.
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.
Rinto Yusriski; Sukoyo Sukoyo; T.M.A Ari Samadhi; Abdul Hakim Halim
2015-01-01
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 algorithm...
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.
Armutlu, Pelin; Ozdemir, Muhittin E; Uney-Yuksektepe, Fadime; Kavakli, I Halil; Turkay, Metin
2008-10-03
A priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental tests. Currently, there are a large number of computational methods that predict the activity of drugs on proteins. In this study, we approach the activity prediction problem as a classification problem and, we aim to improve the classification accuracy by introducing an algorithm that combines partial least squares regression with mixed-integer programming based hyper-boxes classification method, where drug molecules are classified as low active or high active regarding their binding activity (IC50 values) on target proteins. We also aim to determine the most significant molecular descriptors for the drug molecules. We first apply our approach by analyzing the activities of widely known inhibitor datasets including Acetylcholinesterase (ACHE), Benzodiazepine Receptor (BZR), Dihydrofolate Reductase (DHFR), Cyclooxygenase-2 (COX-2) with known IC50 values. The results at this stage proved that our approach consistently gives better classification accuracies compared to 63 other reported classification methods such as SVM, Naïve Bayes, where we were able to predict the experimentally determined IC50 values with a worst case accuracy of 96%. To further test applicability of this approach we first created dataset for Cytochrome P450 C17 inhibitors and then predicted their activities with 100% accuracy. Our results indicate that this approach can be utilized to predict the inhibitory effects of inhibitors based on their molecular descriptors. This approach will not only enhance drug discovery process, but also save time and resources committed.
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.
From the Kohn-Sham band gap to the fundamental gap in solids. An integer electron approach.
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 vresp of the exchange-correlation potential and can be calculated very simply using an approximation to vresp. 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.
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
Directory of Open Access Journals (Sweden)
Sebastián Enrique Ortiz Gaitán
2017-07-01
Full Text Available Introduction: Job Shop (JS production systems are characterized by different route process of the Jobs to be processed. A generalization of this type of systems is the Flexible Job Shop (FJS, in which there is more than one machine per station to perform some of the operations. Objective: The objective of this project was to propose a mixed integer linear programming model to program FJS systems in order to minimize the number of tardy jobs. Methodology: The model was developed using an approach based on sequence-position variables. This approach uses binary variables to decide whether a given operation is assigned to a position in the processing sequence of the assigned machine. To validate the performance of the model data from a small company with an FJS type production system, that develops its operations in an environment to order (MTO, was used. For this reason, the most important performance indicators for the company are those associated with the service level. Results: The results show a reasonable performance in terms of the objective pursued. The optimal production schedule was found in less than 3600 seconds in instances of less than 14 production orders. In larger instances, it obtained feasible solutions within the defined time limit. Conclusions: The model allows defining production schedules in systems in which the fulfillment of due dates is of vital importance. The results have allowed the company to improve its performance and reduce the costs associated with non-compliance of customer’s due dates. Future research can be developed to find more efficient solution methods in terms of computational times to obtain solutions of larger instances.
Triangles with Integer Dimensions
Gilbertson, Nicholas J.; Rogers, Kimberly Cervello
2016-01-01
Interesting and engaging mathematics problems can come from anywhere. Sometimes great problems arise from interesting contexts. At other times, interesting problems arise from asking "what if" questions while appreciating the structure and beauty of mathematics. The intriguing problem described in this article resulted from the second…
Boghosian, B M; Alexander, F J; Margolus, N H; Boghosian, Bruce M.; Yepez, Jeffrey; Alexander, Francis J.; Margolus, Norman H.
1996-01-01
We generalize the hydrodynamic lattice gas model to include arbitrary numbers of particles moving in each lattice direction. For this generalization we derive the equilibrium distribution function and the hydrodynamic equations, including the equation of state and the prefactor of the inertial term that arises from the breaking of galilean invariance in these models. We show that this prefactor can be set to unity in the generalized model, therby effectively restoring galilean invariance. Moreover, we derive an expression for the kinematic viscosity, and show that it tends to decrease with the maximum number of particles allowed in each direction, so that higher Reynolds numbers may be achieved. Finally, we derive expressions for the statistical noise and the Boltzmann entropy of these models.
Xu, Peiliang
2013-12-01
Reduction can be important to aid quickly attaining the integer least squares (ILS) estimate from noisy data. We present an improved LLL algorithm with fixed complexity by extending a parallel reduction method for positive definite quadratic forms to lattice vectors. We propose the minimum angle of a reduced basis as an alternative quality measure of orthogonality, which is intuitively more appealing to measure the extent of orthogonality of a reduced basis. Although the LLL algorithm and its variants have been widely used in practice, experimental simulations were only carried out recently and limited to the quality measures of the Hermite factor, practical running behaviors and reduced Gram-Schmidt coefficients. We conduct a large scale of experiments to comprehensively evaluate and compare five reduction methods for decorrelating ILS problems, including the LLL algorithm, its variant with deep insertions and our improved LLL algorithm with fixed complexity, based on six quality measures of reduction. We use the results of the experiments to investigate the mean running behaviors of the LLL algorithm and its variants with deep insertions and the sorted QR ordering, respectively. The improved LLL algorithm with fixed complexity is shown to perform as well as the LLL algorithm with deep insertions with respect to the quality measures on length reduction but significantly better than this LLL variant with respect to the other quality measures. In particular, our algorithm is of fixed complexity, but the LLL algorithm with deep insertions could seemingly not be terminated in polynomial time of the dimension of an ILS problem. It is shown to perform much better than the other three reduction methods with respect to all the six quality measures. More than six millions of the reduced Gram-Schmidt coefficients from each of the five reduction methods clearly show that they are not uniformly distributed but depend on the reduction algorithms used. The simulation results of
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.
Guo, P; Huang, G H
2010-03-01
In this study, an interval-parameter semi-infinite fuzzy-chance-constrained mixed-integer linear programming (ISIFCIP) approach is developed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing interval-parameter semi-infinite programming (ISIP) and fuzzy-chance-constrained programming (FCCP) by incorporating uncertainties expressed as dual uncertainties of functional intervals and multiple uncertainties of distributions with fuzzy-interval admissible probability of violating constraint within a general optimization framework. The binary-variable solutions represent the decisions of waste-management-facility expansion, and the continuous ones are related to decisions of waste-flow allocation. The interval solutions can help decision-makers to obtain multiple decision alternatives, as well as provide bases for further analyses of tradeoffs between waste-management cost and system-failure risk. In the application to the City of Regina, Canada, two scenarios are considered. In Scenario 1, the City's waste-management practices would be based on the existing policy over the next 25 years. The total diversion rate for the residential waste would be approximately 14%. Scenario 2 is associated with a policy for waste minimization and diversion, where 35% diversion of residential waste should be achieved within 15 years, and 50% diversion over 25 years. In this scenario, not only landfill would be expanded, but also CF and MRF would be expanded. Through the scenario analyses, useful decision support for the City's solid-waste managers and decision-makers has been generated. Three special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it is useful for tackling multiple uncertainties expressed as intervals, functional intervals, probability distributions, fuzzy sets, and their
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.
Albuquerque, Fabio; Beier, Paul
2015-01-01
Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts.
Pashitskii, E. A.
2001-09-01
It is shown that in two-dimensional (2D) electron systems in a quantizing magnetic field, in addition to electron-hole (excitonic) pairing through the Coulomb interaction it is also possible to have Cooper pairing of the 2D electrons due to their interaction with 2D phonons and 2D plasmons localized at the interface of the crystals in semiconductor heterostructures. By summing the divergent (as T→0) ladder diagrams in the zero-sound and Cooper channels, the critical temperatures of the transition to the excitonic and Cooper phases are found. It is shown that the excitonic phase can exist only in comparatively narrow regions near half-integer values of the filling factor ν=(2n-1)/2 (n=1,2,3,…), a finding which is in qualitative agreement with the experimentally observed anisotropic features in the transport resistance of 2D systems in the integer quantum Hall effect regime. By taking into account a superposition of states of bound electron pairs and unpaired 2D electrons in the Cooper phase, one can describe practically all of the experimentally observed quantum features in the fractional quantum Hall effect regime, including at values of ν that are not described by the composite fermion model. At the same time, the interelectron attraction can promote triplet Cooper pairing of composite fermions, which is accompanied by the appearance of an "exotic" quantum feature at ν=5/2. Arguments supporting the possibility of experimental observation of the Cooper phase are presented.
Wang, S; Huang, G H
2013-03-15
Flood disasters have been extremely severe in recent decades, and they account for about one third of all natural catastrophes throughout the world. In this study, a two-stage mixed-integer fuzzy programming with interval-valued membership functions (TMFP-IMF) approach is developed for flood-diversion planning under uncertainty. TMFP-IMF integrates the fuzzy flexible programming, two-stage stochastic programming, and integer programming within a general framework. A concept of interval-valued fuzzy membership function is introduced to address complexities of system uncertainties. TMFP-IMF can not only deal with uncertainties expressed as fuzzy sets and probability distributions, but also incorporate pre-regulated water-diversion policies directly into its optimization process. TMFP-IMF is applied to a hypothetical case study of flood-diversion planning for demonstrating its applicability. Results indicate that reasonable solutions can be generated for binary and continuous variables. A variety of flood-diversion and capacity-expansion schemes can be obtained under four scenarios, which enable decision makers (DMs) to identify the most desired one based on their perceptions and attitudes towards the objective-function value and constraints. Copyright © 2013 Elsevier Ltd. All rights reserved.
Tutorial on state variable based plasticity: an Abaqus UHARD subroutine
CSIR Research Space (South Africa)
Jansen van Rensburg, GJ
2012-12-01
Full Text Available Since plasticity is path dependent, it is necessary to properly take into account the deformation, strain rate and temperature history in applications such as crash worthiness and ballistics simulations. To accurately model the evolution...
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%.
Liou, Shiuan-Fan; Hu, Zi-Xiang; Yang, Kun
2017-06-01
We use exact diagonalization to study the quantum phases and phase transitions when a single species of fermionic atoms at a Landau level filling factor νf=1 in a rotating trap interact through a p -wave Feshbach resonance. We show that under a weak pairing interaction, the system undergoes a second-order quantum phase transition from a νf=1 fermionic integer quantum Hall (FIQH) state at positive detuning, to a νb=1/4 bosonic fractional quantum Hall (BFQH) state at negative detuning. However, when the pairing interaction increases, a new phase between them emerges, corresponding to a fraction of fermionic atoms staying in a coherent superposition of a bosonic molecule state and an unbound pair. The phase transition from the FIQH phase to the new phase is of second order and that from the new phase to BFQH phase is of first order.
DEFF Research Database (Denmark)
Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Jørgensen, John Bagterp
2012-01-01
from the wind farm model, enabling us to use a very simple linear relationship for describing the turbine interactions. In addition, we allow individual turbines to be turned on or off introducing integer variables into the optimization problem. We solve this within the same framework of iterative......We consider the optimization of power set-points to a large number of wind turbines arranged within close vicinity of each other in a wind farm. The goal is to maximize the total electric power extracted from the wind, taking the wake effects that couple the individual turbines in the farm...... into account. For any mean wind speed, turbulence intensity, and direction we find the optimal static operating points for the wind farm. We propose an iterative optimization scheme to achieve this goal. When the complicated, nonlinear, dynamics of the aerodynamics in the turbines and of the fluid dynamics...
Energy Technology Data Exchange (ETDEWEB)
Vlasblom, A.G.; Elgershuizen, J.H.B.W.
1977-01-01
Communications of various authors have shown that in natural circumstances Neomysis integer lives in chlorinities ranging between almost 0 to 20% Cl and Praunus flexuosus in the range 2 to 23% Cl. In the Netherlands Neomysis is found in chlorinities of 0.1 to 16.5% Cl and Praunus in chlorinities of 6 to 19% Cl. It is possible that Neomysis inhabits environments of a lower chlorinity range than the related Praunus because of differences in tolerance to temperature and chlorinity. Therefore, experiments have been carried out in search of differences in the survival and oxygen consumption of the adults of both species in different temperature-chlorinity combinations. For Neomysis also the rate of development of the embryos and the numbers hatching were investigated under different conditions.
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.
Directory of Open Access Journals (Sweden)
Hamidreza Karkehabadi
2012-08-01
Full Text Available Balanced scorecard is a performance appraisal method planned for measuring the organizational efficiency to develop their strategies. Organization’s strategies in a specified period are the main inputs in this model. Furthermore, due to nature, experts' opinions play the vital role in determining the strategies. In this research, the proposed algorithm is designed by using fuzzy set covering problem and non-linear multiple objective integer programming (zero and one variables, so that it can be useful to choose the best combination of strategies for specified period of time with the least deviation in experts` opinions. The presented model is carried out in Islamic Azad University, Semnan Branch. The results indicate that the designed model can provide the best combination of strategies for entering into the balanced scorecard system.
Horitani, Masaki; Yashiro, Haruhiko; Hagiwara, Masayuki; Hori, Hiroshi
2008-04-01
We investigate the electronic state of Mn(III) center with an integer electron spin S=2 in the manganese(III) protoporphyrin IX reconstituted myoglobin, Mn(III)Mb, by means of multi-frequency electron paramagnetic resonance (MFEPR) spectroscopy. Using a bimodal cavity resonator, X-band EPR signal from Mn(III) center in the Mn(III)Mb was observed near zero-field region. The temperature dependence of this signal indicates a negative axial zero-field splitting value, DEPR analysis shows that this signal is attributed to the transition between the closely spaced M(s)=+/-2 energy levels for the z-axis, corresponding to the heme normal. To determine the zero-field splitting (ZFS) parameters, EPR experiments on the Mn(III)Mb were performed at various temperatures for some frequencies between 30GHz and 130GHz and magnetic fields up to 14T. We observed several EPR spectra which are analyzed with a spin Hamiltonian for S=2, yielding highly accurate ZFS parameters; D=-3.79cm(-1) and |E|=0.08cm(-1) for an isotropic g=2.0. These ZFS parameters are compared with those in some Mn(III) complexes and Mn(III) superoxide dismutase (SOD), and effects on these parameters by the coordination and the symmetry of the ligands are discussed. To the best of our knowledge, these EPR spectra in the Mn(III)Mb are the very first MFEPR spectra at frequencies higher than Q-band in a metalloprotein with an integer spin.
Wang, Jie; Tian, Yan; Meng, Xiangsheng; Liu, Tong
2017-02-01
The image obtained from space-based vision system has increasingly high frame frequency and resolution, and field of view is also growing. Due to the dramatic increase of data scale and the restriction of channel bandwidth between satellite and ground, on-orbit data compression becomes the core of on-satellite data processing. The paper analyzes the new generation static image compression standard JPEG2000 and the key two-dimensional (2D) discrete wavelet transform (DWT) technology. Then an FPGA (Field Programmable Gate Array)implement method for 2D integer wavelet transform is designed. It adopts the spatial combinative lifting algorithm (SCLA), which realizes the simultaneous transformation on rows and columns. On this basis, the paper realizes wavelet decomposition for images with a resolution of 6576*4384 (which is divided into 1024*1024) on the FPGA platform. In particular, the test platform is built in ISE14.7 simulation software, and the device model is xc5vfx100t. The design has passed the FPGA verification. In order to verify the correctness of the algorithm, the results are compared with that obtained by running matlab code. The experimental results show that the design is correct and the resource occupancy rate is low.
Rajgaria, R; Wei, Y; Floudas, C A
2010-06-01
An integer linear optimization model is presented to predict residue contacts in beta, alpha + beta, and alpha/beta proteins. The total energy of a protein is expressed as sum of a C(alpha)-C(alpha) distance dependent contact energy contribution and a hydrophobic contribution. The model selects contact that assign lowest energy to the protein structure as satisfying a set of constraints that are included to enforce certain physically observed topological information. A new method based on hydrophobicity is proposed to find the beta-sheet alignments. These beta-sheet alignments are used as constraints for contacts between residues of beta-sheets. This model was tested on three independent protein test sets and CASP8 test proteins consisting of beta, alpha + beta, alpha/beta proteins and it was found to perform very well. The average accuracy of the predictions (separated by at least six residues) was approximately 61%. The average true positive and false positive distances were also calculated for each of the test sets and they are 7.58 A and 15.88 A, respectively. Residue contact prediction can be directly used to facilitate the protein tertiary structure prediction. This proposed residue contact prediction model is incorporated into the first principles protein tertiary structure prediction approach, ASTRO-FOLD. The effectiveness of the contact prediction model was further demonstrated by the improvement in the quality of the protein structure ensemble generated using the predicted residue contacts for a test set of 10 proteins.
Rajgaria, R.; Wei, Y.; Floudas, C. A.
2010-01-01
An integer linear optimization model is presented to predict residue contacts in β, α + β, and α/β proteins. The total energy of a protein is expressed as sum of a Cα – Cα distance dependent contact energy contribution and a hydrophobic contribution. The model selects contacts that assign lowest energy to the protein structure while satisfying a set of constraints that are included to enforce certain physically observed topological information. A new method based on hydrophobicity is proposed to find the β-sheet alignments. These β-sheet alignments are used as constraints for contacts between residues of β-sheets. This model was tested on three independent protein test sets and CASP8 test proteins consisting of β, α + β, α/β proteins and was found to perform very well. The average accuracy of the predictions (separated by at least six residues) was approximately 61%. The average true positive and false positive distances were also calculated for each of the test sets and they are 7.58 Å and 15.88 Å, respectively. Residue contact prediction can be directly used to facilitate the protein tertiary structure prediction. This proposed residue contact prediction model is incorporated into the first principles protein tertiary structure prediction approach, ASTRO-FOLD. The effectiveness of the contact prediction model was further demonstrated by the improvement in the quality of the protein structure ensemble generated using the predicted residue contacts for a test set of 10 proteins. PMID:20225257
Merrikh-Bayat, Farshad
2017-05-01
In this paper first the Multi-term Fractional-Order PID (MFOPID) whose transfer function is equal to [Formula: see text] , where kj and αj are unknown and known real parameters respectively, is introduced. Without any loss of generality, a special form of MFOPID with transfer function kp+ki/s+kd1s+kd2sμ where kp, ki, kd1, and kd2 are unknown real and μ is a known positive real parameter, is considered. Similar to PID and TID, MFOPID is also linear in its parameters which makes it possible to study all of them in a same framework. Tuning the parameters of PID, TID, and MFOPID based on loop shaping using Linear Matrix Inequalities (LMIs) is discussed. For this purpose separate LMIs for closed-loop stability (of sufficient type) and adjusting different aspects of the open-loop frequency response are developed. The proposed LMIs for stability are obtained based on the Nyquist stability theorem and can be applied to both integer and fractional-order (not necessarily commensurate) processes which are either stable or have one unstable pole. Numerical simulations show that the performance of the four-variable MFOPID can compete the trivial five-variable FOPID and often excels PID and TID. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Guillermo Cabrera G.
2012-01-01
Full Text Available We present a hybridization of two different approaches applied to the well-known Capacitated Facility Location Problem (CFLP. The Artificial Bee algorithm (BA is used to select a promising subset of locations (warehouses which are solely included in the Mixed Integer Programming (MIP model. Next, the algorithm solves the subproblem by considering the entire set of customers. The hybrid implementation allows us to bypass certain inherited weaknesses of each algorithm, which means that we are able to find an optimal solution in an acceptable computational time. In this paper we demonstrate that BA can be significantly improved by use of the MIP algorithm. At the same time, our hybrid implementation allows the MIP algorithm to reach the optimal solution in a considerably shorter time than is needed to solve the model using the entire dataset directly within the model. Our hybrid approach outperforms the results obtained by each technique separately. It is able to find the optimal solution in a shorter time than each technique on its own, and the results are highly competitive with the state-of-the-art in large-scale optimization. Furthermore, according to our results, combining the BA with a mathematical programming approach appears to be an interesting research area in combinatorial optimization.
Purnomo, Muhammad Ridwan Andi; Satrio Wiwoho, Yoga
2016-01-01
Facility layout becomes one of production system factor that should be managed well, as it is designated for the location of production. In managing the layout, designing the layout by considering the optimal layout condition that supports the work condition is essential. One of the method for facility layout optimization is Mixed Integer Programming (MIP). In this study, the MIP is solved using Lingo 9.0 software and considering quantitative and qualitative objectives to be achieved simultaneously: minimizing material handling cost, maximizing closeness rating, and minimizing re-layout cost. The research took place in Rekayasa Wangdi as a make to order company, focusing on the making of concrete brick dough stirring machine with 10 departments involved. The result shows an improvement in the new layout for 333,72 points of objective value compared with the initial layout. As the conclusion, the proposed MIP is proven to be used to model facility layout problem under multi objective consideration for a more realistic look.
Morrison, Robert C
2015-01-07
Accurate densities were determined from configuration interaction wave functions for atoms and ions of Li, Be, and B with up to four electrons. Exchange-correlation potentials, Vxc(r), and functional derivatives of the noninteracting kinetic energy, δK[ρ]/δρ(r), obtained from these densities were used to examine their discontinuities as the number of electrons N increases across integer boundaries for N = 1, N = 2, and N = 3. These numerical results are consistent with conclusions that the discontinuities are characterized by a jump in the chemical potential while the shape of Vxc(r) varies continuously as an integer boundary is crossed. The discontinuity of the Vxc(r) is positive, depends on the ionization potential, electron affinity, and orbital energy differences, and the discontinuity in δK[ρ]/δρ(r) depends on the difference between the energies of the highest occupied and lowest unoccupied orbitals. The noninteracting kinetic energy and the exchange correlation energy have been computed for integer and noninteger values of N between 1 and 4.
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.
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.
Using Integer Manipulatives: Representational Determinism
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…
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 ...
Which Positive Integers are Interesting?
Indian Academy of Sciences (India)
IAS Admin
Recall that the argument proceeds by observing that once we have gotten hold of the first few prime numbers, the number obtained by adding 1 to their product must have a prime factor which is necessarily larger than the previous ones. As this large number leaves remainder 1 on division by any of these primes, any of its ...
Moreira, D. M.; Calmant, S.; Perosanz, F.; Santos, A.; Santos Da Silva, J.; Seyler, F.; Ramillien, G. L.; Monteiro, A.; Rotunno, O.; Shum, C.
2011-12-01
Applications of GNSS data is constantly being used in hydrology. One of the key applications is the characterization of river's longitudinal profiles, an information required to develop hydrological and hydrodynamic studies and to evaluate the quality of data obtained through space altimetry techniques. Some factors illustrate the challenge of establishing quality altimetry data from a GNSS receivers to obtain rivers profiles in Amazon Basin. GNSS reference network is sparse, the distance between survey points and reference stations is large, rivers have an extension of several thousands of kilometers. All these factors contribute in limiting the efficiency of classical techniques of GNSS data processing like double difference. In the present work we use the Gins-PC software developed at CNES / GRGS. We discuss the capability of the PPP kinematic with integer ambiguities fixing strategy implemented in GINS-PC in processing GPS data to calculate river's longitudinal profiles in the Amazon Basin. The profiles will be processed using data obtained from GPS receivers on boarding boats along the rivers of Amazon Basin such as Negro river, Madeira river and Amazon/Solimões river. For this purpose, field campaings were conducted between 2005 and 2010 by ANA ( Brazilian National Water Agency), CPRM (Brazilian Geologic Survey), IRD (French Institute of Research by Development), Hybam ( Hydrology of Amazon Basin), PROSUL (Research project by CNPQ/UFRJ) and FOAM (From Ocean to inland waters Altimetry Monitoring) river section project. Under the proposed framework, these profiles will be then compared with profiles obtained by water level variation data using altimetry data from tracks of the Jason-2 and ENVISAT missions. The profiles will be also used to levelling some gauge stations in Amazon Basin and gauge data will be used to obtain a temporal variation of these profiles. However some gauges are strongly affected by charge effects, mainly caused by the hydrological cycle
Directory of Open Access Journals (Sweden)
Andrés Saldaña Crovo
2007-12-01
Full Text Available En esta investigación se formulan dos modelos de Programación Lineal Entera para un problema de Programación de Horarios para Universidades y se presentan dos estrategias de solución para cada uno de ellos. El problema consiste en programar las asignaturas a ser dictadas, considerando los profesores, días, horarios, aulas y la necesidad de dictar las asignaturas en periodos consecutivos determinados. El objetivo es minimizar la asignación en periodos no deseados, balanceando la carga de trabajo diaria para cada grupo de alumnos. Las estrategias de solución combinan modelos de asignación directa a aulas o asignación a tipos de aulas. Las estrategias de solución que consideran relajación de restricciones, permiten resolver problemas de gran tamaño, a niveles de calidad razonables y utilizando pequeños tiempos computacionales. Los enfoques fueron aplicados a instancias de la Facultad de Ingeniería de la Universidad de Concepción, Chile. Los modelos utilizados en esta investigación pueden ser aplicados a una gran cantidad de problemas de Programación de Horarios en Universidades , proporcionando una gran flexibilidad de resolución.In this research, two models of Integer Programming for a University Timetabling Problem are formulated and two solution strategies for each model are presented. The problem consists of programming the courses to be taught, considering teaching faculty, days, periods, classrooms and requirements for courses that are taught in consecutive periods. The objective is to minimize the allocation of undesired time slots as well as balancing the daily workload for each group of students. The solution strategies are based on either combining models of direct allocation to classrooms or types of classrooms. The solution strategies that include reducing constraints, allow solving big problems with reasonable levels of efficiency, using the computer system for a short time. The approaches were used with real data
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.
Energy Technology Data Exchange (ETDEWEB)
Shimizu, Yoshiaki
1999-02-05
This paper was concerned to rationally solve problems based on the various complicated global social environment as representative of location and arrangement problems in the wide area network, and shown to classify many of these problems into a multi-objective mixed integer planning problem. However, since the solution-obtained work was extremely large to obtain a sole exact optimum solution due to significantly increasing the solution-obtained work with a large scale of these problems, development of the solution method to emphasize a practical standpoint that an approximate solution was hopefully obtained with less effort have been paid attention. Therefore, concerning the genetic algorithm regarded as a hopeful method in recent years, problems on a usual solution-obtaining process that real variables were coded and restriction conditions were treated as a penalty function were firstly pointed out. Based on this work as a practical solution method, the combination of a problem range and the characteristics of solution methods were considered into a step construction, and a hybrid genetic algorithm using mathematical programming was proposed. As an introduction method to a parade optimum solution in a multi-objective mixed integer planning problem, this solution method was mentioned to be a practical solution method. As concrete examples, a harmful waste disposal location plan problem was given; the effectiveness was examined by numerical experiments. (translated by NEDO)
Directory of Open Access Journals (Sweden)
N. K. Sudev
2014-04-01
Full Text Available In the recently published article titled {\\em A Characterisation of Weak Integer Additive Set-Indexers of Graphs} (article id:jfsva-00189 an inadvertent error in the final simplification has been occured. Theorem $2.5$ is staed in the article as The complete graph $K_n$ admits a weak IASI if and only if the minimum number of mono-indexed edges of $K_n$ is $\\frac{1}{2}(n-1^2$ . That is, the sparing number of a complete graph $K_n$ is $\\frac{1}{2}(n-1^2$. The same expression is written in the proof of Theorem $2.5$ in Page $4$ (lines $7,8,9$. The correct expression in all the above lines is $\\frac{1}{2}(n-1(n-2$ instead of $\\frac{1}{2}(n-1^2$. Hence, the corrected statement and proof of Theorem $2.5$ is {\\bf Theorem 2.5} The complete graph $K_n$ admits a weak IASI if and only if the minimum number of mono-indexed edges of $K_n$ is $\\frac{1}{2}(n-1(n-2$ . That is, the sparing number of a complete graph $K_n$ is $\\frac{1}{2}(n-1(n-2$. {\\em Proof.} If $K_n$ is 1-uniform, then the result is trivial. Hence, we consider the IASI graphs that are not 1-uniform. Assume that $K_n$ admits a weak IASI. Then, every edge of $K_n$ must have at least one end vertex of set-indexing number 1. Without loss of generality, label the vertex $v_1$ by a singleton set. Since $v_2$ is adjacent to $v_1$, label $v_2$ by a non-singleton set. Since all other vertices $v_3, v_4, \\cdots, v_n$ are adjacent to $v_2$ in $K_n$ and $K_n$ admits a weak IASI, none of these vertices can be labeled by a non-singleton set. Therefore, only the edges incident on $v_2$ can have a set-indexing number greater than 1. That is, only $(n-1$ edges in $K_n$ have a set indexing number greater than 1. Hence, the number of mono-indexed edges of $K_n$ is $\\frac{1}{2}n(n-1-(n-1=\\frac{1}{2}(n-1(n-2$. Conversely, assume that the number mono-indexed edges of $G$ is $\\frac{1}{2}(n-1(n-2$. Therefore, the number edges of $G$ having set-indexing numbers greater than 1 is $\\frac{1}{2}n(n-1-\\frac
Geraedts, Scott; Motrunich, Olexei I.
2017-09-01
We provide an explicit lattice model of bosons with two separately conserved boson species [U (1 )×U (1 ) global symmetry] realizing a direct transition between an integer quantum Hall effect of bosons and a trivial phase, where any intermediate phase is avoided by an additional symmetry interchanging the two species. If the latter symmetry is absent, we find intermediate superfluid phases where one or the other boson species condenses. We know the precise location of the transition since at this point our model has an exact nonlocal antiunitary particle-hole-like symmetry that resembles particle-hole symmetry in the lowest Landau level of electrons. We exactly map the direct transition to our earlier study of the self-dual line of the easy-plane NCCP1 model, in the mathematically equivalent reformulation in terms of two (new) particles with π statistics and identical energetics. While the transition in our model is first order, we hope that our mappings and recent renewed interest in such self-dual models will stimulate more searches for models with a continuous transition.
Design and Implementation of Modular Subroutines for Simulation of LNG Plants
Vikse, Matias
2016-01-01
A nonsmooth equation-oriented multistream heat exchanger (MHEX) model has been developed by the Process Systems Engineering Laboratory at Massachusetts Institute of Technology that is intended to be a part of a rigorous optimization and simulation tool for liquefied natural gas (LNG) processes. The model was successfully used to simulate the poly refrigerant integrated cycle operations (PRICO) process for LNG production, though it suffered from convergence difficulties in more complex single ...
Multiple IMU system test plan, volume 4. [subroutines for space shuttle requirements
Landey, M.; Vincent, K. T., Jr.; Whittredge, R. S.
1974-01-01
Operating procedures for this redundant system are described. A test plan is developed with two objectives. First, performance of the hardware and software delivered is demonstrated. Second, applicability of multiple IMU systems to the space shuttle mission is shown through detailed experiments with FDI algorithms and other multiple IMU software: gyrocompassing, calibration, and navigation. Gimbal flip is examined in light of its possible detrimental effects on FDI and navigation. For Vol. 3, see N74-10296.
SPACAR : A software subroutine package for simulation of the behavior of biomechanical systems
van Soest, Arthur J.; Schwab, Arend L.; Bobbert, Maarten F.; van Ingen Schenau, Gerrit Jan
1992-01-01
Direct dynamics computer simulation is gaining importance as a research tool in the biomechanical study of complex human movements. Therefore, the need for general-purpose software packages with which the equations of motion can be derived automatically and solved numerically is growing. In this
Thirty-Two Nodes Hexahedronal Element Subroutine for Multi-Purpose Program MEF.
1986-09-01
diciplines . A cubic, thirty-two node, three dimensional * isoiparametric element was developed. With such an element very complex structures could be solved...library of one, two, and three-dimensional elements for the solution of problems from a wide variety of diciplines . A cubic, thirty-two node, three...Problem Definition (data base): ............................ 8 2. Element Computations: ................................... 8 3. Assem bly Operations
Kalman Filter Real Time Tracking Using Microprocessors and a New Language for Military Software.
1986-03-27
return new values from functions. There are automatic, local, global and external variables. There are character, integer, long integer, string...ine MACROS /* define macros */ *include FILE.H /* include header file ~ double xkkE2003; /* declare global variables * main() /* main prog. declaration...Fortran Scientific Subroutine Library, John Wiley & Sons,Inc, 1984. 11. CIE Systems, Regulus Reference Manual, Bussiness Computer Operating Systems
Investigating Integer Restrictions in Linear Programming
Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.
2015-01-01
Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…
integ - nonintg lang teaching journal - revised ii
African Journals Online (AJOL)
User
vocabulary teaching/learning. Therefore, vocabulary teaching/learning needs to be developed in an integrated approach whereby the four primary skills of listening, reading, speaking and writing are interwoven during instruction. This approach leads to optimal language learning. If this weaving together does not occur, the ...
AN INTEGER PROGRAMMING MODEL FOR HIERARCHICAL WORKFORCE
Directory of Open Access Journals (Sweden)
BANU SUNGUR
2013-06-01
Full Text Available The model presented in this paper is based on the model developed by Billionnet for the hierarchical workforce problem. In Billionnet’s Model, while determining the workers’ weekly costs, weekly working hours of workers are not taken into consideration. In our model, the weekly costs per worker are reduced in proportion to the working hours per week. Our model is illustrated on the Billionnet’s Example. The models in question are compared and evaluated on the basis of the results obtained from the example problem. A reduction is achieved in the total cost by the proposed model.
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Marc A. Armand
2008-07-01
Full Text Available This paper presents a new class of low-density parity-check (LDPC codes over Ã¢Â„Â¤2a represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
Structured LDPC Codes over Integer Residue Rings
Directory of Open Access Journals (Sweden)
Mo Elisa
2008-01-01
Full Text Available Abstract This paper presents a new class of low-density parity-check (LDPC codes over represented by regular, structured Tanner graphs. These graphs are constructed using Latin squares defined over a multiplicative group of a Galois ring, rather than a finite field. Our approach yields codes for a wide range of code rates and more importantly, codes whose minimum pseudocodeword weights equal their minimum Hamming distances. Simulation studies show that these structured codes, when transmitted using matched signal sets over an additive-white-Gaussian-noise channel, can outperform their random counterparts of similar length and rate.
Shor's Algorithm for Factoring Large Integers
Lavor, C; Manssur, L. R. U.; Portugal, R.
2003-01-01
This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on undergraduate Linear Algebra.
Integer programming techniques for educational timetabling
DEFF Research Database (Denmark)
Fonseca, George H.G.; Santos, Haroldo G.; Carrano, Eduardo G.
2017-01-01
Educational timetabling problems require the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The XHSTT format was adopted in this work because it models the main features of educational timetabling and it is the most used format...
Playing Your Cards Right: Integers for Algebra
Tillema, Erik; Gatza, Andrew; Ulrich, Catherine
2017-01-01
The number and algebra strand of the "Australian Curriculum: Mathematics" (2015) advocates for holding together the study of number and algebra across years K-8--a position that mathematics educators have endorsed in many countries. This recommendation along with the report "Shape of the Australian Curriculum: Mathematics"…
INTEGER PERCENTAGES AS ELECTORAL FALSIFICATION FINGERPRINTS
Kobak, Dmitry; Shpilkin, Sergey; Pshenichnikov, Maxim S.
We hypothesize that if election results are manipulated or forged, then, due to the well-known human attraction to round numbers, the frequency of reported round percentages can be increased. To test this hypothesis, we analyzed raw data from seven federal elections held in the Russian Federation
Valid Inequalities for Mixed Integer Linear Programs
2006-07-01
solved. Valid Inequalities for MILPs 19 Note that, given u, u0, v, v0, the optimal values of αk and β in (5) are: αk = { max(uak, vak ) for k = j max...uak u0+v0 , αk = { min(uak + u0mk, vak − v0mk) for k = 1, . . . , n max(uak, vak ) for k = n+ 1, . . . , n+ p and β = min(ub, vb+ u0). Then the...optimal solution of the original cut generating LP (5). This implies that, for k = 1, . . . , n, we can choose αk = max(uak + u0πk, vak − v0πk). Smaller
Directory of Open Access Journals (Sweden)
Reyes Zotelo, Yunuem
2017-12-01
Full Text Available En este trabajo se propone un modelo de programación lineal entera para planificar la producción de un conjunto de artículos finales con demanda independiente. El modelo para la planificación maestra de producción (PMP está diseñado considerando los costes de producción e inventario, así como las restricciones definidas por el mismo proceso productivo en cuanto a instalaciones y tiempos de producción. El objetivo del modelo propuesto es la minimización de los costes implicados; concretamente, el tiempo ocioso y extra de los recursos, así como la consideración de un nivel mínimo de servicio ligado a la demanda diferida. La validación del modelo considera datos pertenecientes a la demanda de cada producto en un horizonte de 12 semanas y compara cinco escenarios en los que se modifican algunos aspectos del sistema y diferentes niveles de servicio. Por último, los resultados obtenidos para cada uno de los escenarios exponen la mejora obtenida por el modelo propuesto respecto al procedimiento actual en la empresa objeto de estudio. || In this work, we propose an integer linear programming model for production scheduling of a group of finished products with independent demand. The model for the master production scheduling (MPS is designed by considering production and inventory costs, as well as the productive process constraints regarding installations and production times. The aim of the proposed model is the minimization of the costs involved; specifically, undertime and overtime costs of resources, as well as the consideration of a minimum service level related to the deferred demand. The validation of the model considers data belonging to the demand of each product in a 12-week planning horizon and compares five scenarios in which some characteristics of the system and different service levels are modified. Finally, the results obtained for each one of the scenarios expose the improvement obtained by the proposed model with
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
Directory of Open Access Journals (Sweden)
Flávio Lopes Rodrigues
2004-04-01
Full Text Available Os objetivos deste trabalho foram desenvolver e testar a metaheurística SA para solução de problemas de gerenciamento florestal com restrições de integridade. O algoritmo SA desenvolvido foi testado em quatro problemas, contendo entre 93 e 423 variáveis de decisão, sujeitos às restrições de singularidade, produção mínima e produção máxima, periodicamente. Todos os problemas tiveram como objetivo a maximização do valor presente líquido. O algoritmo SA foi codificado em liguagem delphi 5.0 e os testes foram efetuados em um microcomputador AMD K6II 500 MHZ, com memória RAM de 64 MB e disco rígido de 15GB. O desempenho da SA foi avaliado de acordo com as medidas de eficácia e eficiência. Os diferentes valores ou categorias dos parâmetros da SA foram testados e comparados quanto aos seus efeitos na eficácia do algoritmo. A seleção da melhor configuração de parâmetros foi feita com o teste L&O, a 1% de probabilidade, e as análises foram realizadas através de estatísticas descritivas. A melhor configuração de parâmetros propiciou à SA eficácia média de 95,36%, valor mínimo de 83,66%, valor máximo de 100% e coeficiente de variação igual a 3,18% do ótimo matemático obtido pelo algoritmo exato branch and bound. Para o problema de maior porte, a eficiência da SA foi dez vezes superior à eficiência do algoritmo exato branch and bound. O bom desempenho desta heurística reforçou as conclusões, tiradas em outros trabalhos, do seu enorme potencial para resolver importantes problemas de gerenciamento florestal de difícil solução pelos instrumentos computacionais da atualidade.The objectives of this work was to develop and test an algorithm based on Simulated Annealing (SA metaheuristic to solve problems of forest management with integer constraints. The algorithm SA developed was tested in five problems containing between 93 and 423 decision variables, periodically subject to singularity constraints, minimum
Directory of Open Access Journals (Sweden)
Veli ULUÇAM
2010-07-01
Full Text Available Abstract:This work presents a mixed integer linearprogramming method developed by using 0-1 variables forsolving aggregate production planning problem with thefollowing performance criteria: (1 maximize profit, (2minimize costs. The production planning activities are calledas aggregate production planning when both it is producedmore than one goods and the demand changes period byperiod. The purpose of aggregate production planning is not toprepare detailed plans for each goods, it is to do plans forwhole goods produced in the firm together to take in hand.Aggregate production planning is probably one of the mostimportant, yet least understood, jobs that a manager performs.However, all parts of the organization, operations, marketing,finance, and so on, must work together in the planning processto ensure that they are moving in harmony with one another.Aggregate production planning is such a method that canmove all parts of the organizations in same harmony.Özet:Bu çalışmada; kazançların maksimize edilirkenmaliyetlerin minimize edilebileceği bir bütünleşik üretimplanlama probleminin, 0–1 değişkenleri kullanılarakgeliştirilmiş karma tamsayılı doğrusal programlama tekniği ileçözümü anlatılmaktadır. Birden fazla çeşitte ürünün bir aradaüretildiği ve talebin dönemlere göre değişiklik gösterdiğidurumlarda üretim planlama faaliyetleri bütünleşik üretimplanlama olarak tanımlanır. Planlama çalışmalarınınbütünleşik olma niteliği, bu yöntemin tek tek ürünlerin detaylıplanlarının hazırlanması amacıyla değil, işletme tarafındanüretilen tüm ürünlerin bir arada ele alınarak planlamaçalışmalarının yapılmasıdır. Son yıllarda daha iyi anlaşıldığıüzere, bütünleşik üretim planlaması bir yöneticininperformansını etkileyen en önemli kriterdir. Bununla beraberbir işletmenin tüm bölümleri, üretim, pazarlama, finans vediğerleri aynı ahenk içersinde ve uyumlu olarak
Directory of Open Access Journals (Sweden)
Flávio Lopes Rodrigues
2003-10-01
Full Text Available Este trabalho teve como objetivos desenvolver e testar um algoritmo com base na metaheurística busca tabu (BT, para a solução de problemas de gerenciamento florestal com restrições de inteireza. Os problemas avaliados tinham entre 93 e 423 variáveis de decisão, sujeitos às restrições de singularidade, produção mínima e produção máxima periódicas. Todos os problemas tiveram como objetivo a maximização do valor presente líquido. O algoritmo para implementação da BT foi codificado em ambiente delphi 5.0 e os testes foram efetuados em um microcomputador AMD K6II 500 MHZ, com memória RAM de 64 MB e disco rígido de 15GB. O desempenho da BT foi avaliado de acordo com as medidas de eficácia e eficiência. Os diferentes valores ou categorias dos parâmetros da BT foram testados e comparados quanto aos seus efeitos na eficácia do algoritmo. A seleção da melhor configuração de parâmetros foi feita com o teste L&O, a 1% de probabilidade, e as análises através de estatísticas descritivas. A melhor configuração de parâmetros propiciou à BT eficácia média de 95,97%, valor mínimo igual a 90,39% e valor máximo igual a 98,84%, com um coeficiente de variação de 2,48% do ótimo matemático. Para o problema de maior porte, a eficiência da BT foi duas vezes superior à eficiência do algoritmo exato branch and bound, apresentando-se como uma abordagem muito atrativa para solução de importantes problemas de gerenciamento florestal.This work aimed to develop and test an algorithm based on Tabu Search (TS metaheuristics; to solve problems of forest management with integer constraints. TS was tested in five problems containing between 12 and 423 decision variables subjected to singularity constraints, minimum and maximum periodic productions. All the problems aimed at maximizing the net present value. TS was codified into delphi 5.0 language and the tests were performed in a microcomputer AMD K6II 500 MHZ, RAM memory 64 MB
Directory of Open Access Journals (Sweden)
Flávio Lopes Rodrigues
2004-04-01
Full Text Available Os objetivos deste trabalho foram desenvolver e testar um algoritmo genético (AG para a solução de problemas de gerenciamento florestal com restrições de integridade. O AG foi testado em quatro problemas, contendo entre 93 e 423 variáveis de decisão, sujeitos às restrições de singularidade, produção mínima e produção máxima, periodicamente. Todos os problemas tiveram como objetivo a maximização do valor presente líquido. O AG foi codificado em ambiente delphi 5.0 e os testes foram realizados em um microcomputador AMD K6II 500 MHZ, com memória RAM de 64 MB e disco rígido de 15GB. O desempenho do AG foi avaliado de acordo com as medidas de eficácia e eficiência. Os valores ou categorias dos parâmetros do AG foram testados e comparados quanto aos seus efeitos na eficácia do algoritmo. A seleção da melhor configuração de parâmetros foi feita com o teste L&O, a 1% de probabilidade, e as análises foram realizadas através de estatísticas descritivas. A melhor configuração de parâmetros propiciou ao AG eficácia média de 94,28%, valor mínimo de 90,01%, valor máximo de 98,48%, com coeficiente de variação de 2,08% do ótimo matemático, obtido pelo algoritmo exato branch and bound. Para o problema de maior porte, a eficiência do AG foi cinco vezes superior à eficiência do algoritmo exato branch and bound. O AG apresentou-se como uma abordagem bastante atrativa para solução de importantes problemas de gerenciamento florestal.The objectives of this work was to develop and test a Genetic Algorithm (GA to solve problems of forest management with integer constraints. GA was tested in five problems containing 93 - 423 decision variables, periodically subject to singularity constraints, minimum and maximum production. The problems had the objective of maximizing the net present value. GA was codified into delphi 5.0 language and the tests were performed in a microcomputer AMD K6II 500 MHZ, with RAM memory of 64 MB
Directory of Open Access Journals (Sweden)
Veli ULUÇAM
2012-11-01
Full Text Available Abstract:This work presents a mixed integer linearprogramming method developed by using 0-1 variables forsolving aggregate production planning problem with thefollowing performance criteria: (1 maximize profit, (2minimize costs. The production planning activities are calledas aggregate production planning when both it is producedmore than one goods and the demand changes period byperiod. The purpose of aggregate production planning is not toprepare detailed plans for each goods, it is to do plans forwhole goods produced in the firm together to take in hand.Aggregate production planning is probably one of the mostimportant, yet least understood, jobs that a manager performs.However, all parts of the organization, operations, marketing,finance, and so on, must work together in the planning processto ensure that they are moving in harmony with one another.Aggregate production planning is such a method that canmove all parts of the organizations in same harmony.Özet:Bu çalışmada; kazançların maksimize edilirkenmaliyetlerin minimize edilebileceği bir bütünleşik üretimplanlama probleminin, 0–1 değişkenleri kullanılarakgeliştirilmiş karma tamsayılı doğrusal programlama tekniği ileçözümü anlatılmaktadır. Birden fazla çeşitte ürünün bir aradaüretildiği ve talebin dönemlere göre değişiklik gösterdiğidurumlarda üretim planlama faaliyetleri bütünleşik üretimplanlama olarak tanımlanır. Planlama çalışmalarınınbütünleşik olma niteliği, bu yöntemin tek tek ürünlerin detaylıplanlarının hazırlanması amacıyla değil, işletme tarafındanüretilen tüm ürünlerin bir arada ele alınarak planlamaçalışmalarının yapılmasıdır. Son yıllarda daha iyi anlaşıldığıüzere, bütünleşik üretim planlaması bir yöneticininperformansını etkileyen en önemli kriterdir. Bununla beraberbir işletmenin tüm bölümleri, üretim, pazarlama, finans vediğerleri aynı ahenk içersinde ve uyumlu olarak
Directory of Open Access Journals (Sweden)
Horacio Hideki Yanasse
2013-01-01
Full Text Available Neste trabalho revemos alguns modelos lineares e não lineares inteiros para gerar padrões de corte bidimensionais guilhotinados de 2 estágios, incluindo os casos exato e não exato e restrito e irrestrito. Esses problemas são casos particulares do problema da mochila bidimensional. Apresentamos também novos modelos para gerar esses padrões de corte, baseados em adaptações ou extensões de modelos para gerar padrões de corte bidimensionais restritos 1-grupo. Padrões 2 estágios aparecem em diferentes processos de corte, como, por exemplo, em indústrias de móveis e de chapas de madeira. Os modelos são úteis para a pesquisa e o desenvolvimento de métodos de solução mais eficientes, explorando estruturas particulares, a decomposição do modelo, relaxações do modelo etc. Eles também são úteis para a avaliação do desempenho de heurísticas, já que permitem (pelo menos para problemas de tamanho moderado uma estimativa do gap de otimalidade de soluções obtidas por heurísticas. Para ilustrar a aplicação dos modelos, analisamos os resultados de alguns experimentos computacionais com exemplos da literatura e outros gerados aleatoriamente. Os resultados foram produzidos usando um software comercial conhecido e mostram que o esforço computacional necessário para resolver os modelos pode ser bastante diferente.In this work we review some linear and nonlinear integer models to generate two stage two-dimensional guillotine cutting patterns, including the constrained, non constrained, exact and non exact cases. These problems are particular cases of the two dimensional knapsack problems. We also present new models to generate these cutting patterns, based on adaptations and extensions of models that generate one-group constrained two dimensional cutting patterns. Two stage patterns arise in different cutting processes like, for instance, in the furniture industry and wooden hardboards. The models are useful for the research and
Schneider, Steven J.
2015-01-01
Heat transfer correlations of data on flat plates are used to explore the parameters in the Coolit program used for calculating the quantity of cooling air for controlling turbine blade temperature. Correlations for both convection and film cooling are explored for their relevance to predicting blade temperature as a function of a total cooling flow which is split between external film and internal convection flows. Similar trends to those in Coolit are predicted as a function of the percent of the total cooling flow that is in the film. The exceptions are that no film or 100 percent convection is predicted to not be able to control blade temperature, while leaving less than 25 percent of the cooling flow in the convection path results in nearing a limit on convection cooling as predicted by a thermal effectiveness parameter not presently used in Coolit.
Improving Classification Efficiency by Restructuring Army Job Families
1992-03-01
GENERATOR INTERNAL DATA STRUCTURES CALL RANDINrT C *CREATE OUTPUT FILE OPEN(7ILE-XX.DAT) C *GENERATEX MATRIXOF 17BY NN CALL GENX STOP END REAL FUNCTION...SUBROUTINE GENX INTEGER IJ,NN REAL XSAMPLE(30,600) REAL NORMAL EXTERNAL NORMAL SIN CLUDE: TRANDOM.INC’ WRrTE(e,’C’ ENTER SAMPLE SIZE: ř)’) READ(5,’)NN DO 2 I
Directory of Open Access Journals (Sweden)
Deisemara Ferreira
2008-01-01
Full Text Available Neste artigo propomos um modelo de otimização inteira mista para o problema de dimensionamento e seqüenciamento dos lotes de produção em fábricas de refrigerantes de pequeno porte, com tempos e custos de set up de produção dependentes do seqüenciamento dos lotes. O modelo considera o estágio de envase como sendo o gargalo da produção da planta, o que é comum em fábricas de pequeno porte com uma única linha de envase, e restrições de lote mínimo do estágio de xaroparia. Variações da heurística relax and fix são propostas e comparadas na solução de exemplares do modelo, gerados com dados reais de uma fábrica localizada no interior do Estado de São Paulo. Os resultados mostram que as abordagens são capazes de gerar soluções melhores do que as utilizadas pela empresa.In this paper we propose a mixed integer programming model to the lot sizing and sequencing problem of a soft drink plant with sequence-dependent set up costs and times. The model considers that the bottling stage is the production bottleneck, which is common in small plants with only one production line, and minimum lot size constrains of the syrup stage. Variations of the relax and fix heuristic are proposed and compared. A computational study with instances generated based on real data from a plant situated in the State of São Paulo-Brazil is also presented. The results show that the approaches are capable to produce better solutions than the ones from the company.
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
user
International Journal of Engineering, Science and Technology. Vol. 3, No. ... The use of goal programming allows considering multiple criteria to achieve the goals and satisfy the constraints and ... The selective maintenance operation is an optimal decision-making activity for systems consisting of several components under.
Vertical partitioning of relational OLTP databases using integer programming
DEFF Research Database (Denmark)
Amossen, Rasmus Resen
2010-01-01
for relational row- store OLTP databases with an H-store-like architecture, meaning that we would like to maximize the number of single-sited transactions. We present a model for the vertical partitioning problem that, given a schema together with a vertical partitioning and a workload, estimates the costs......A way to optimize performance of relational row store databases is to reduce the row widths by vertically partition- ing tables into table fractions in order to minimize the number of irrelevant columns/attributes read by each transaction. This pa- per considers vertical partitioning algorithms...
Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis
2015-09-14
approaches are considered: one is based on convex semidefinite relaxation ( SDR ), while the other is based on quasi- convex relaxations. For SDR , a new... receive SNR. 2 Statement of the problem studied This project considers a class of nonconvex quadratic optimization problems involving both in- teger and...problem, two relaxation approaches are considered: one is based on convex semidefinite relaxation ( SDR ), while the other is based on quasi-convex
A Multi-Stage Integer Programming Approach to Fantasy Team ...
African Journals Online (AJOL)
Team selection is a controversial topic, even more so when a team performs poorly. Many sport fans believe they can perform the selection process better than those tasked with the responsibility. With the developments of fantasy sport games, fans now have a platform to test their claims, albeit in a purely recreational ...
Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks
Lee, Charles H.; Cheung, Kar-Ming
2012-01-01
In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.
The mental representation of numerical fractions : real or integer?
Bonato, Mario; Fabbri, Sara; Umiltà, Carlo; Zorzi, Marco
2007-01-01
Numerical fractions are commonly used to express ratios and proportions (i.e., real numbers), but little is known about how they are mentally represented and processed by skilled adults. Four experiments employed comparison tasks to investigate the distance effect and the effect of the spatial
Systems with the integer rounding property in normal monomial subrings
Directory of Open Access Journals (Sweden)
Luis A. Dupont
2010-12-01
Full Text Available Let C be a clutter and let A be its incidence matrix. If the linear system x > 0; x A Seja C uma desordem (família de Sperner e seja A sua matriz de incidência. Se o sistema linear x > 0; x A < 1 tem a propriedade do arredondamento inteiro, fornecemos a descrição do módulo canônico e do a-invariante de certos subaneis monomiais associados a C. Se a desordem é um grafo conexo, descreve-se quando o supra-mencionado sistema linear tem a propriedade do arredondamento inteiro em termos combinatórios e algébricos, usando a teoria dos grafos e a teoria das álgebras de Rees. Como consequência, mostra-se que a álgebra de Rees estendida do ideal de arestas de um grafo bipartido é um anel de Gorenstein se e somente se o grafo é de altura pura.
Fitting boxes to Manhattan scenes using linear integer programming
Li, Minglei
2016-02-19
We propose an approach for automatic generation of building models by assembling a set of boxes using a Manhattan-world assumption. The method first aligns the point cloud with a per-building local coordinate system, and then fits axis-aligned planes to the point cloud through an iterative regularization process. The refined planes partition the space of the data into a series of compact cubic cells (candidate boxes) spanning the entire 3D space of the input data. We then choose to approximate the target building by the assembly of a subset of these candidate boxes using a binary linear programming formulation. The objective function is designed to maximize the point cloud coverage and the compactness of the final model. Finally, all selected boxes are merged into a lightweight polygonal mesh model, which is suitable for interactive visualization of large scale urban scenes. Experimental results and a comparison with state-of-the-art methods demonstrate the effectiveness of the proposed framework.
Designing fractional factorial split-plot experiments using integer programming
DEFF Research Database (Denmark)
Capehart, Shay R.; Keha, Ahmet; Kulahci, Murat
2011-01-01
Split-plot designs are commonly used in industrial experiments when there are hard-to-change and easy-to-change factors. Due to the number of factors and resource limitations, it is more practical to run a fractional factorial split-plot (FFSP) design. These designs are variations of the fraction...
Combinatorial therapy discovery using mixed integer linear programming.
Pang, Kaifang; Wan, Ying-Wooi; Choi, William T; Donehower, Lawrence A; Sun, Jingchun; Pant, Dhruv; Liu, Zhandong
2014-05-15
Combinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction. Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set. Our tool is freely available for noncommercial use at http://www.drug.liuzlab.org/. zhandong.liu@bcm.edu Supplementary data are available at Bioinformatics online.
Index sort algorithm for positive integers | Adewumi | Science World ...
African Journals Online (AJOL)
Science World Journal. Journal Home · ABOUT · Advanced Search · Current Issue · Archives · Journal Home > Vol 3, No 3 (2008) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register · Download this PDF file. The PDF file you selected should load here if your Web ...
Improved Sorting-Based Procedure for Integer Programming
DEFF Research Database (Denmark)
Dantchev, Stefan
2002-01-01
Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the running time and the space requirements...... of this algorithm. The drastic reduction of space needed allows us to solve much larger instances than was possible before using this technique....
Prime factorization of arbitrary integers with a logarithmic energy spectrum
Gleisberg, F.; Di Pumpo, F.; Wolff, G.; Schleich, W. P.
2018-02-01
We propose an iterative scheme to factor numbers based on the quantum dynamics of an ensemble of interacting bosonic atoms stored in a trap where the single-particle energy spectrum depends logarithmically on the quantum number. When excited by a time-dependent interaction these atoms perform Rabi oscillations between the ground state and an energy state characteristic of the factors. The number to be factored is encoded into the frequency of the sinusoidally modulated interaction. We show that a measurement of the energy of the atoms at a time chosen at random yields the factors with probability one half. We conclude by discussing a protocol to obtain the desired prime factors employing a logarithmic energy spectrum which consists of prime numbers only.
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
In the first model, the reliability of subsystems are considered as different objectives. In second model the cost and time spent on repairing the components are considered as two different objectives. Selective maintenance operation is used to select the repairable components and a multi-objective goal programming ...
Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis
2016-10-11
column generation, subgradient method, and pattern search. Column generation adds the most beneficial stations sequentially until the plan quality...beneficial. For each update resulted from column generation, the subgradient method improves the selected stations locally by reshaping the apertures and...updating the beam angles toward a descent subgradient direction. The algorithm continues to improve the selected stations locally DISTRIBUTION A
Stochastic Dynamic Mixed-Integer Programming (SD-MIP)
2015-05-05
et al (2009), there is continuing interest in using SA methods for SP problems. This genre of methods creates a sequence of sampled subgradients ...an SA algorithm to be a sampled version of the deterministic subgradient method, just as two-stage SD is a sampled version of Benders’ decomposition...advantage of not having to calculate a subgradient using every potential outcome of the random variable. The main point here is that SA and SD are both
Anti-levitation in integer quantum Hall systems
Wang, C.; Avishai, Y.; Meir, Yigal; Wang, X. R.
2014-01-01
The evolution of extended states of two-dimensional electron gas with white-noise randomness and field is numerically investigated by using the Anderson model on square lattices. Focusing on the lowest Landau band we establish an anti-levitation scenario of the extended states: As either the disorder strength W increases or the magnetic field strength B decreases, the energies of the extended states move below the Landau energies pertaining to a clean system. Moreover, for strong enough disorder, there is a disorder-dependent critical magnetic field Bc(W) below which there are no extended states at all. A general phase diagram in the W-1/B plane is suggested with a line separating domains of localized and delocalized states.
Polynomial Formula for Sums of Powers of Integers
Indian Academy of Sciences (India)
IAS Admin
jk. A well-known story in the history of mathematics is that the great German mathematician Carl Friedrich Gauss, while in elementary school, noted that for k = 1, S1,n ≡. 1+2+...+n is, when written in reverse order, equal to n+(n−1)+ ...+1. And when they are added one gets. 2S1,n = (1+n)+(2+(n−1))+(3+(n−2))+...+(n+1) =.
RLC electrical circuit of non-integer order
Gómez, Francisco; Rosales, Juan; Guía, Manuel
2013-10-01
In this work a fractional differential equation for the electrical RLC circuit is studied. The order of the derivative being considered is 0 Mittag-Leffler function depending on the order of the fractional differential equation.
Optimizing electricity distribution using two-stage integer recourse models
Klein Haneveld, W.K.; van der Vlerk, M.H.; Uryasev, SP; Pardalos, PM
2001-01-01
We consider two planning problems faced by an electricity distributor. Electricity can be obtained both from power plants and small generators such as hospitals and greenhouses, whereas the future demand for electricity is uncertain. The price of electricity obtained from the power plants depends on
An Additive Algorithm for the Multiple Choice Integer Program.
1980-10-01
of this algorithm. SExtensions It is not difficult to extend this formulation in several directions. For instance, it may be desirable to allow...Lieberman, 1980-1]. It involves distributing five crates of strawberries amongst three stores to maximize profit. For ease in reading the positions in...but in larger problems this same sort of exclusivity occurs and is much more difficult to uncover. This weakness in the tests exists because the tests
Integers without large prime factors in short intervals: Conditional ...
Indian Academy of Sciences (India)
This article is about distribution of smooth numbers in short intervals, namely intervals of type (X, X + ... Then an application of the Stirling asymptotic formula for the gamma function yields (see. Chapter 15 of [Da00]) the .... later. Theorem 3. For any sequence {bn} of complex numbers and any positive real number R, we have.
Techniques for Performance Improvement of Integer Multiplication in Cryptographic Applications
Directory of Open Access Journals (Sweden)
Robert Brumnik
2014-01-01
Full Text Available The problem of arithmetic operations performance in number fields is actively researched by many scientists, as evidenced by significant publications in this field. In this work, we offer some techniques to increase performance of software implementation of finite field multiplication algorithm, for both 32-bit and 64-bit platforms. The developed technique, called “delayed carry mechanism,” allows to preventing necessity to consider a significant bit carry at each iteration of the sum accumulation loop. This mechanism enables reducing the total number of additions and applies the modern parallelization technologies effectively.
God created the integers the mathematical breakthroughs that changed history
2007-01-01
Bestselling author and physicist Stephen Hawking explores the "masterpieces" of mathematics, 25 landmarks spanning 2,500 years and representing the work of 15 mathematicians, including Augustin Cauchy, Bernard Riemann, and Alan Turing. This extensive anthology allows readers to peer into the mind of genius by providing them with excerpts from the original mathematical proofs and results. It also helps them understand the progression of mathematical thought, and the very foundations of our present-day technologies. Each chapter begins with a biography of the featured mathematician, clearly explaining the significance of the result, followed by the full proof of the work, reproduced from the original publication.
Integer programming for the generalized high school timetabling problem
DEFF Research Database (Denmark)
Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis
2015-01-01
Recently, the XHSTT format for high school timetabling was introduced. It provides a uniform way of modeling problem instances and corresponding solutions. The format supports a wide variety of constraints, and currently 38 real-life instances from 11 different countries are available. Thereby...... general-purpose MIP solver. Computational results show that our approach is able to find previously unknown optimal solutions for 2 instances of XHSTT and proves optimality of 4 known solutions. For the instances not solved to optimality, new non-trivial lower bounds were found in 11 cases, and new best...
Polynomial Formula for Sums of Powers of Integers
Indian Academy of Sciences (India)
K B Athreya1 S Kothari2. Department of Mathematics & Statistics, Iowa State University, Ames, Iowa 50011, USA; Electrical Engineering Department, Iowa State University, Ames, Iowa 50011, USA. Resonance – Journal of Science Education. Current Issue : Vol. 23, Issue 2 · Current Issue Volume 23 | Issue 2. February 2018.
The Prouhet-Tarry-Escott problem for Gaussian integers
Caley, Timothy
2010-01-01
Given natural numbers $n$ and $k$, with $n>k$, the Prouhet-Tarry-Escott (PTE) problem asks for distinct subsets of $\\Z$, say $X=\\{x_1,...,x_n\\}$ and $Y=\\{y_1,...,y_n\\}$, such that \\[x_1^i+...+x_n^i=y_1^i+...+y_n^i\\] for $i=1,...,k$. Many partial solutions to this problem were found in the late 19th century and early 20th century. When $n=k-1$, we call a solution $X=_{n-1}Y$ ideal. This is considered to be the most interesting case. Ideal solutions have been found using elementary methods, ell...
Estimation of Spatial Influence Models Using Mixed-Integer Programming
Billionnet, A.
Estimation of ecosystem models is an important task and many studies have been carried out on the problem. However, estimating some models may be difficult. Here, we want to estimate two nonlinear spatial influence models by using the classical least-squares method, and that requires the solution of
A novel progressively swarmed mixed integer genetic algorithm for ...
African Journals Online (AJOL)
MIGA) which inherits the advantages of binary and real coded Genetic Algorithm approach. The proposed algorithm is applied for the conventional generation cost minimization Optimal Power Flow (OPF) problem and for the Security ...
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......] that supports efficient addition and subtraction operations, improving the space complexity of an earlier representation by Munro and Rahman...
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
user
International Journal of Engineering, Science and Technology, Vol. 3, No. 6, 2011, pp. 184-195. 187. 3. Multi-Objective Optimal Maintenance Problem on Parallel-Series System. Model 1: The reliability of the system can be maximized if we maximize the reliability of each individual subsystem. This is a logical approach as ...
One power sums of natural integers at arbitrary intervals
DRUSHININ VICTOR VLADIMIROVICH; LAZAREV ALEXEY ALEXANDROVICH
2016-01-01
The formulas for calculating of sums of the arbitrary powers of natural numbers with different intervals and the initial number are received. Results for powers from «1» to «4» and intervals from «3» to «4» are given. Applications of the results are reviewed.
Directory of Open Access Journals (Sweden)
Sílvia Maria Santana Mapa
2012-01-01
Full Text Available O objetivo do trabalho é avaliar a qualidade das soluções para o problema de localização-alocação de instalações geradas por um SIG-T (Sistema de Informação Geográfica para Transportes, obtidas após a utilização combinada das rotinas Localização de Facilidades e Problema do Transporte, quando comparadas com as soluções ótimas obtidas a partir de modelo matemático exato baseado em Programação Linear Inteira Mista (PLIM, desenvolvido externamente ao SIG. Os modelos foram aplicados a três simulações: a primeira propõe a abertura de fábricas e alocação de clientes no Estado de São Paulo; a segunda envolve um atacadista e um estudo de localização de centros de distribuição e alocação dos clientes varejistas; a terceira localiza creches em um contexto urbano, alocando a demanda. Os resultados mostraram que, quando se considera a capacidade das instalações, o modelo otimizante PLIM chegou a apresentar, em um dos cenários simulados, resultados até 37% melhores do que o SIG, além de propor locais diferentes para abertura de novas instalações. Quando não se considera a capacidade, o modelo SIG se mostrou tão eficiente quanto o modelo exato PLIM, chegando exatamente às mesmas soluções.This study aims to evaluate the quality of the solutions for facility location-allocation problems generated by a GIS-T (Geographic Information System for Transportation software. These solutions were obtained from combining the Facility Location and Transportation Problem routines, when compared with the optimal solutions, which were obtained using the exact mathematical model based on the Mixed Integer Linear Programming (MILP developed externally to the GIS. The models were applied to three simulations: the first one proposes set up businesses and customers' allocation in the state of São Paulo; the second involves a wholesaler and an investigation of distribution center location and retailers' allocation; and the third one
Alheadary, Wael G.
2016-10-13
In this paper, we derive the performances of optical wireless communication system utilizing adaptive subcarrier intensity modulation over the Malaga turbulent channel. More specifically, analytical closed-form solutions and asymptotic results are derived for average bit error rate, achievable spectral efficiency, outage probability, and ergodic capacity by utilizing series expansion identity of modified Bessel function. Our asymptotic and analytical results based on series solutions with finite numbers highly matched to the numerical results. By exploiting the inherent nature of fading channel, the proposed adaptive scheme enhances the spectral efficiency without additional transmit power while satisfying the required bit error rate criterion. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.
Lascu, Dan
2014-01-01
We consider a family {τ m : m ≥ 2} of interval maps which are generalizations of the Gauss transformation. For the continued fraction expansion arising from τ m , we solve a Gauss-Kuzmin-type problem.
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.
Orzechowski, J. A.
1982-01-01
The CMC fluid mechanics program system was developed to transmit the theoretical evolution of finite element numerical solution methodology, applied to nonlinear field problems into a versatile computer code for comprehensive flow field analysis. A detailed view of the code from the standpoint of a computer programmer's use is presented. A system macroflow chart and detailed flow charts of several routines necessary to interact with a theoretican/user to modify the operation of this program are presented. All subroutines and details of usage, primarily for input and output routines are described. Integer and real scalars and a cross reference list denoting subroutine usage for these scalars are outlined. Entry points in dynamic storage vector IZ; the lengths of each vector accompanying the scalar definitions are described. A listing of the routines peculiar to the standard test case and a listing of the input deck and printout for this case are included.
Fourier-transforming with quantum annealers
Directory of Open Access Journals (Sweden)
Itay eHen
2014-07-01
Full Text Available We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the onstruction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT with the same complexity and resources as its gate-model counterpart. One implication of the above construction is the theoretical feasibility of implementing Shor's algorithm for integer factorization in an optimal manner, and any other algorithm that makes use of QFT, on quantum annealing devices. We discuss the possible advantages, as well as the limitations, of the proposed approach as well as its relation to traditional adiabatic quantum computation.
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort
DEFF Research Database (Denmark)
Aumüller, Martin; Dietzfelbinger, Martin; Heuberger, Clemens
2016-01-01
We present an average case analysis of two variants of dual-pivot quicksort, one with a non-algorithmic comparison-optimal partitioning strategy, the other with a closely related algorithmic strategy. For both we calculate the expected number of comparisons exactly as well as asymptotically......, in particular, we provide exact expressions for the linear, logarithmic, and constant terms. An essential step is the analysis of zeros of lattice paths in a certain probability model. Along the way a combinatorial identity is proven....
Operational method of solution of linear non-integer ordinary and partial differential equations.
Zhukovsky, K V
2016-01-01
We propose operational method with recourse to generalized forms of orthogonal polynomials for solution of a variety of differential equations of mathematical physics. Operational definitions of generalized families of orthogonal polynomials are used in this context. Integral transforms and the operational exponent together with some special functions are also employed in the solutions. The examples of solution of physical problems, related to such problems as the heat propagation in various models, evolutional processes, Black-Scholes-like equations etc. are demonstrated by the operational technique.
GNSS Carrier Phase Integer Ambiguity Resolution with Camera and Satellite images
Henkel, Patrick
2015-04-01
Ambiguity Resolution is the key to high precision position and attitude determination with GNSS. However, ambiguity resolution of kinematic receivers becomes challenging in environments with substantial multipath, limited satellite availability and erroneous cycle slip corrections. There is a need for other sensors, e.g. inertial sensors that allow an independent prediction of the position. The change of the predicted position over time can then be used for cycle slip detection and correction. In this paper, we provide a method to improve the initial ambiguity resolution for RTK and PPP with vision-based position information. Camera images are correlated with geo-referenced aerial/ satellite images to obtain an independent absolute position information. This absolute position information is then coupled with the GNSS and INS measurements in an extended Kalman filter to estimate the position, velocity, acceleration, attitude, angular rates, code multipath and biases of the accelerometers and gyroscopes. The camera and satellite images are matched based on some characteristic image points (e.g. corners of street markers). We extract these characteristic image points from the camera images by performing the following steps: An inverse mapping (homogenous projection) is applied to transform the camera images from the driver's perspective to bird view. Subsequently, we detect the street markers by performing (a) a color transformation and reduction with adaptive brightness correction to focus on relevant features, (b) a subsequent morphological operation to enhance the structure recognition, (c) an edge and corner detection to extract feature points, and (d) a point matching of the corner points with a template to recognize the street markers. We verified the proposed method with two low-cost u-blox LEA 6T GPS receivers, the MPU9150 from Invensense, the ASCOS RTK corrections and a PointGrey camera. The results show very precise and seamless position and attitude estimates in an urban environment with substantial multipath.
Quantum Oscillations at Integer and Fractional Landau Level Indices in ZrTe5
Yu, Wenlong; Jiang, Yuxuan; Yang, Jeremy; Dun, Zhiling; Zhou, Haidong; Jiang, Zhigang; Lu, Ping; Pan, Wei
A three-dimensional (3D) Dirac semimetal (DS) is an analogue of graphene, but with linear energy dispersion in all (three) momentum directions. We report here the results in exfoliated ZrTe5 thin flakes from the studies of scanning transmission electron microscopy and low temperature magneto-transport measurements. Several unique results were observed. First, a π Berry phase was obtained from the Landau fan diagram. Second, the longitudinal resistivity shows linear magnetic field dependence. Most surprisingly, quantum oscillations were also observed at fractional Landau level indices N = 5/3 and 7/5, demonstrating strong electron-electron interaction effects in ZrTe5. This work was supported by the U.S. Department of Energy, Office of Science, Basic Energy Sciences, Materials Sciences and Engineering Division. Contract DE-AC04-94AL85000. Grant No. DE-FG02-07ER46451. Grant No. DMR-1350002.
Palchaudhuri, Ayan
2016-01-01
This book describes the optimized implementations of several arithmetic datapath, controlpath and pseudorandom sequence generator circuits for realization of high performance arithmetic circuits targeted towards a specific family of the high-end Field Programmable Gate Arrays (FPGAs). It explores regular, modular, cascadable, and bit-sliced architectures of these circuits, by directly instantiating the target FPGA-specific primitives in the HDL. Every proposed architecture is justified with detailed mathematical analyses. Simultaneously, constrained placement of the circuit building blocks is performed, by placing the logically related hardware primitives in close proximity to one another by supplying relevant placement constraints in the Xilinx proprietary “User Constraints File”. The book covers the implementation of a GUI-based CAD tool named FlexiCore integrated with the Xilinx Integrated Software Environment (ISE) for design automation of platform-specific high-performance arithmetic circuits from us...
SOLUTION TO A PIPELINE SCHEDULING PROBLEM BY USING A MIXED INTEGER LINEAR PROGRAMMING MODEL
Baysal, Mehmet Emin; UÇAKTÜRK, Esra
2016-01-01
Pipelines are efficient ways of conveying huge amounts of refined petroluem products to distant points. Different products are pumped successively, in the pipelines without a need of a separator between them. Pipelines should be chosen very carefully based on the pumping sequences, volumes to be conveyed, covering the constraints involved by cutting operational costs and focusing on market demands. The real life problem considered in this study consists of a unidirectional pipe distribution s...
Directory of Open Access Journals (Sweden)
J. Fabian Lopez
2010-01-01
Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.
Seth, Anupam
2009-01-01
Production planning and scheduling for printed circuit, board assembly has so far defied standard operations research approaches due to the size and complexity of the underlying problems, resulting in unexploited automation flexibility. In this thesis, the increasingly popular collect-and-place machine configuration is studied and the assembly…
Directory of Open Access Journals (Sweden)
Toru Tomimatsu
2015-08-01
Full Text Available Electric-field-induced nuclear resonance (NER: nuclear electric resonance involving quantum Hall states (QHSs was studied at various filling factors by exploiting changes in nuclear spins polarized at quantum Hall breakdown. Distinct from the magnetic dipole interaction in nuclear magnetic resonance, the interaction of the electric-field gradient with the electric quadrupole moment plays the dominant role in the NER mechanism. The magnitude of the NER signal strongly depends on whether electronic states are localized or extended. This indicates that NER is sensitive to the screening capability of the electric field associated with QHSs.
Integer valued autoregressive processes with generalized discrete Mittag-Leffler marginals
Directory of Open Access Journals (Sweden)
Kanichukattu K. Jose
2013-05-01
Full Text Available In this paper we consider a generalization of discrete Mittag-Leffler distributions. We introduce and study the properties of a new distribution called geometric generalized discrete Mittag-Leffler distribution. Autoregressive processes with geometric generalized discrete Mittag-Leffler distributions are developed and studied. The distributions are further extended to develop a more general class of geometric generalized discrete semi-Mittag-Leffler distributions. The processes are extended to higher orders also. An application with respect to an empirical data on customer arrivals in a bank counter is also given. Various areas of potential applications like human resource development, insect growth, epidemic modeling, industrial risk modeling, insurance and actuaries, town planning etc are also discussed.
Li, Yanning
2013-10-01
This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.
Energy Technology Data Exchange (ETDEWEB)
Brown, K. A. [Brookhaven National Lab. (BNL), Upton, NY (United States); Schoefer, V. [Brookhaven National Lab. (BNL), Upton, NY (United States); Tomizawa, M. [High Energy Accelerator Research Organization (KEK), Tsukuba (Japan)
2017-03-09
The new accelerator complex at J-PARC will operate with both high energy and very high intensity proton beams. With a design slow extraction efficiency of greater than 99% this facility will still be depositing significant beam power onto accelerator components [2]. To achieve even higher efficiencies requires some new ideas. The design of the extraction system and the accelerator lattice structure leaves little room for improvement using conventional techniques. In this report we will present one method for improving the slow extraction efficiency at J-PARC by adding duodecapoles or octupoles to the slow extraction system. We will review the theory of resonant extraction, describe simulation methods, and present the results of detailed simulations. From our investigations we find that we can improve extraction efficiency and thereby reduce the level of residual activation in the accelerator components and surrounding shielding.
The affine constrained GNSS attitude model and its multivariate integer least-squares solution
Teunissen, P.J.G.
2012-01-01
A new global navigation satellite system (GNSS) carrier-phase attitude model and its solution are introduced in this contribution. This affine-constrained GNSS attitude model has the advantage that it avoids the computational complexity of the orthonormality-constrained GNSS attitude model, while it
The JOVIAL (J73) Workbook. Volume I. Integer and Floating Point Item-Declarations.
1981-11-01
7V( SPANIEL ), 3V(COLLIE)); How many bits will be needed to represent the status-constants in: COLOR 2 NAME 4 DOGS 6 What is the representation of: V...RED) 0 V(FRANK) 4 V( SPANIEL ) 7 V(SUE) 0 1081-1 2:4-8 STATUS TYPE EQUIVALENCE AND IMPLICIT CONVERSION For an assignment-statement to be legal, the type
Post, E J
1999-01-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 betw...
Discrete cosine and sine transforms general properties, fast algorithms and integer approximations
Britanak, Vladimir; Rao, K R; Rao, K R
2006-01-01
The Discrete Cosine Transform (DCT) is used in many applications by the scientific, engineering and research communities and in data compression in particular. Fast algorithms and applications of the DCT Type II (DCT-II) have become the heart of many established international image/video coding standards. Since then other forms of the DCT and Discrete Sine Transform (DST) have been investigated in detail. This new edition presents the complete set of DCT and DST discrete trigonometric transforms, including their definitions, general mathematical properties, and relations to the optimal Karhune
Footstep Planning on Uneven Terrain with Mixed-Integer Convex Optimization
2014-08-01
of the scene using the perception tools developed by Team MIT for the DRC [13]. A Sobel filter was used to classify areas of the terrain which were...Generalized and separable sobel op- erators,” in Machine vision for three-dimensional scenes, H. Freeman, Ed. Sand Diego, CA: Academic Press, Inc., 1990.
CSIR Research Space (South Africa)
Mahlathi, Christopher
2016-10-01
Full Text Available Instream water quality management encompasses field monitoring and utilisation of mathematical models. These models can be coupled with optimisation techniques to determine more efficient water quality management alternatives. Among these activities...
Realization of a Quantum Integer-Spin Chain with Controllable Interactions
2015-06-17
protocols or for simulating lattice spin models. In this paper, we use trapped atomic ions to simulate a chain of spin-1 particles with tunable, long- range...polarized to drive stimulated Raman transitions between the j0i and j−i states and between the j0i and jþi states with equal Rabi frequencies Ωi on ion i...resemble Rabi flopping between the state j00i and the symmetric superposition ðj þ −i þ j −þiÞ= ffiffiffi2p . Solid lines represent theoretical predic
Spin-spin correlation functions of the q-VBS state of an integer spin model
Arita, Chikashi; Motegi, Kohei
2010-01-01
We consider the valence-bond-solid ground state of the q-deformed higher-spin AKLT model (q-VBS state). We investigate the eigenvalues and eigenvectors of a matrix (G matrix), which is constructed from the matrix product representation of the q-VBS state. We compute the longitudinal and transverse spin-spin correlation functions, and determine the correlation amplitudes and correlation lengths for real q.
Identification and non-integer order modelling of synchronous machines operating as generator
Directory of Open Access Journals (Sweden)
Szymon Racewicz
2012-09-01
Full Text Available This paper presents an original mathematical model of a synchronous generator using derivatives of fractional order. In contrast to classical models composed of a large number of R-L ladders, it comprises half-order impedances, which enable the accurate description of the electromagnetic induction phenomena in a wide frequency range, while minimizing the order and number of model parameters. The proposed model takes into account the skin eff ect in damper cage bars, the eff ects of eddy currents in rotor solid parts, and the saturation of the machine magnetic circuit. The half-order transfer functions used for modelling these phenomena were verifi ed by simulation of ferromagnetic sheet impedance using the fi nite elements method. The analysed machine’s parameters were identified on the basis of SSFR (StandStill Frequency Response characteristics measured on a gradually magnetised synchronous machine.
Large-Scale Multiobjective Static Test Generation for Web-Based Testing with Integer Programming
Nguyen, M. L.; Hui, Siu Cheung; Fong, A. C. M.
2013-01-01
Web-based testing has become a ubiquitous self-assessment method for online learning. One useful feature that is missing from today's web-based testing systems is the reliable capability to fulfill different assessment requirements of students based on a large-scale question data set. A promising approach for supporting large-scale web-based…
Integer-valued Lévy processes and low latency financial econometrics
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole; Pollard, David G.; Shephard, Neil
Motivated by features of low latency data in financial econometrics we study in detail integervalued Lévy processes as the basis of price processes for high frequency econometrics. We propose using models built out of the difference of two subordinators. We apply these models in practice to low...... latency data for a variety of different types of futures contracts.futures markets, high frequency econometrics, low latency data, negative binomial, Skellam, tempered stable...
A finer classification of the unit sum number of the ring of integers of ...
Indian Academy of Sciences (India)
Abstract. The unit sum number, u(R), of a ring R is the least k such that every element is the sum of k units; if there is no such k then u(R) is ω or ∞ depending on whether the units generate R additively or not. Here we introduce a finer classification for the unit sum number of a ring and in this new classification we completely ...
Integer and Fractional General T-System and Its Application to Control Chaos and Synchronization
National Research Council Canada - National Science Library
Mihaela Neamtu; Anamaria Litoiu; Petru C. Strain
2015-01-01
.... Also, the fractional order general T-system is proposed and analyzed. We provide some numerical simulations, where the chaos attractor and the dynamics of the Lyapunov coefficients are taken into consideration...
Presolving and regularization in mixed-integer second-order cone optimization
DEFF Research Database (Denmark)
Friberg, Henrik Alsing
of this is proven not only by first-class citizenship in the modeling language PICOS [87], but also by The Conic Benchmark Library (CBLIB) where the conversion tools have been used to test its more than a thousand instances with MOSEK and CPLEX. This benchmark library was compiled as part of this thesis in support...
Wu, C. Z.; Huang, G. H.; Yan, X. P.; Cai, Y. P.; Li, Y. P.
2010-05-01
Large crowds are increasingly common at political, social, economic, cultural and sports events in urban areas. This has led to attention on the management of evacuations under such situations. In this study, we optimise an approximation method for vehicle allocation and route planning in case of an evacuation. This method, based on an interval-parameter multi-objective optimisation model, has potential for use in a flexible decision support system for evacuation management. The modeling solutions are obtained by sequentially solving two sub-models corresponding to lower- and upper-bounds for the desired objective function value. The interval solutions are feasible and stable in the given decision space, and this may reduce the negative effects of uncertainty, thereby improving decision makers' estimates under different conditions. The resulting model can be used for a systematic analysis of the complex relationships among evacuation time, cost and environmental considerations. The results of a case study used to validate the proposed model show that the model does generate useful solutions for planning evacuation management and practices. Furthermore, these results are useful for evacuation planners, not only in making vehicle allocation decisions but also for providing insight into the tradeoffs among evacuation time, environmental considerations and economic objectives.
DEFF Research Database (Denmark)
Baran, Ismet; Tutum, Cem Celal; Hattel, Jesper Henri
2013-01-01
In this paper thermo-chemical simulation of the pultrusion process of a composite rod is first used as a validation case to ensure that the utilized numerical scheme is stable and converges to results given in literature. Following this validation case, a cylindrical die block with heaters is added...... to the pultrusion domain of a composite part and thermal contact resistance (TCR) regions at the die-part interface are defined. Two optimization case studies are performed on this new configuration. In the first one, optimal die radius and TCR values are found by using a hybrid genetic algorithm based...
Integer charge transfer at the tetrakis(dimethylamino)ethylene/Au interface
DEFF Research Database (Denmark)
Lindell, L.; Unge, Mikael; Osikowicz, W.
2008-01-01
In organic-based electronics, interfacial properties have a profound impact on device performance. The lineup of energy levels is usually dependent on interface dipoles, which may arise from charge transfer reactions. In many applications, metal-organic junctions are prepared under ambient condit...
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
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...... 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...
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...... problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real......-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search...
Gorissen, B.L.; den Hertog, D.; Hoffmann, A.L.
2013-01-01
Current inverse treatment planning methods that optimize both catheter positions and dwell times in prostate HDR brachytherapy use surrogate linear or quadratic objective functions that have no direct interpretation in terms of dose-volume histogram (DVH) criteria, do not result in an optimum or
DEFF Research Database (Denmark)
Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian
2014-01-01
differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...
Fast parallel molecular algorithms for DNA-based computation: factoring integers.
Chang, Weng-Long; Guo, Minyi; Ho, Michael Shan-Hui
2005-06-01
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form. The security of the RSA public-key cryptosystem is based on the difficulty of factoring the product of two large prime numbers. This paper demonstrates to factor the product of two large prime numbers, and is a breakthrough in basic biological operations using a molecular computer. In order to achieve this, we propose three DNA-based algorithms for parallel subtractor, parallel comparator, and parallel modular arithmetic that formally verify our designed molecular solutions for factoring the product of two large prime numbers. Furthermore, this work indicates that the cryptosystems using public-key are perhaps insecure and also presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.
DEFF Research Database (Denmark)
Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Graells, Moises
2017-01-01
. The operation of the microgrid is complemented with a supervisory control stage that compensates any mismatch between the offline scheduling process and the real time microgrid operation. The proposal has been tested experimentally in a hybrid microgrid at the Microgrid Research Laboratory in Aalborg University....
Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container
Directory of Open Access Journals (Sweden)
Igor Litvinchev
2014-01-01
Full Text Available A problem of packing a limited number of unequal circles in a fixed size rectangular container is considered. The aim is to maximize the (weighted number of circles placed into the container or minimize the waste. This problem has numerous applications in logistics, including production and packing for the textile, apparel, naval, automobile, aerospace, and food industries. Frequently the problem is formulated as a nonconvex continuous optimization problem which is solved by heuristic techniques combined with local search procedures. New formulations are proposed for approximate solution of packing problem. The container is approximated by a regular grid and the nodes of the grid are considered as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0-1 optimization problem. The binary variables represent the assignment of centers to the nodes of the grid. Nesting circles inside one another is also considered. The resulting binary problem is then solved by commercial software. Numerical results are presented to demonstrate the efficiency of the proposed approach and compared with known results.
Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming
2016-01-01
PANAMA CITY DIVISION PANAMA CITY, FLORIDA 32407-7001 5(3257...task. This paper is outlined as follows: in Section 2, we discuss the general setup of the the MCM scheduling problem, including the definition of the...Suite 1425 Arlington, VA 22203-1995 Naval Surface Warfare Center, Panama City Division 1 ATTN: Technical Library 110 Vernon Avenue Panama City, FL 32407 27
Integer valued autoregressive processes with generalized discrete Mittag-Leffler marginals
Kanichukattu K. Jose; K. D. Mariyamma
2013-01-01
In this paper we consider a generalization of discrete Mittag-Leffler distributions. We introduce and study the properties of a new distribution called geometric generalized discrete Mittag-Leffler distribution. Autoregressive processes with geometric generalized discrete Mittag-Leffler distributions are developed and studied. The distributions are further extended to develop a more general class of geometric generalized discrete semi-Mittag-Leffler distributions. The processes are extended t...
Baran, Ismet; Tutum, Cem C.; Hattel, Jesper H.
2013-01-01
In this paper thermo-chemical simulation of the pultrusion process of a composite rod is first used as a validation case to ensure that the utilized numerical scheme is stable and converges to results given in literature. Following this validation case, a cylindrical die block with heaters is added
An Integer Optimization Approch To A Probabilistic Reserve Site Selection Problem
Robert G. Haight; Charles S. Revelle; Stephanie A. Snyder
2000-01-01
Human economic and agricultural activities contribute to the endangerment of over 900 species that are currently listed or proposed for listing under the federal Endangered Species Act in the United States (Dobson et al. 1997). One approach to conserving the elements of biological diversity--including plants, animals, and ecological communities--is to establish and...
A Mixed Integer Programming Model for Improving Theater Distribution Force Flow Analysis
2013-03-01
the introduction to LINGO in OPER 510. Next, I wish to thank LINDO Systems, particularly Kevin Cunningham, for software assistance with LINGO . I...viii Appendix A. LINGO 13 Settings File Contents .............................................................. 79 Appendix B. Additional Model...optimization software LINGO 13 (Lindo Systems Inc, 2012). A Decision Support System was built in the Excel environment where the user uploads a
Optimal Selection of Conservation Lands at Fort Stewart Using Integer Programming
2011-10-01
research was supported in part by Cooperative State Research, Education, and Extension Service ( CREES ) Project No. ILLU 05-0361. COL Kevin J. Wilson was...sites to both ponds and nearest GT habitat sites need to be considered when determining the best GT sites. In light of the above, specifying the most
On the Impact of using Mixed Integer Programming Techniques on Real-world Offshore Wind Parks
DEFF Research Database (Denmark)
Fischetti, Martina; Pisinger, David
2017-01-01
Wind power is a leading technology in the transition to sustainable energy. Being a new and still more competitive field, it is of major interest to investigate new techniques to solve the design challenges involved. In this paper, we consider optimization of the inter-array cable routing...... for offshore wind farms, taking power losses into account. Since energy losses in a cable depend on the load (i.e. wind), cable losses are estimated by considering a possibly large number wind scenarios. In order to deal with different wind scenarios efficiently we used a precomputing strategy. The resulting...... with a leading energy company, we have been able to report results on a set of real-world instances, based on six existing wind parks, studying the economical impact of considering power losses in the cable routing design phase....
van Rossum GJ; Erbrink JJ; de Leeuw FAAM
1993-01-01
The contribution of a 250 MWe co-generation plant assumed to be located in an urban area with about 300,000 inhabitants, to the photochemical ozone formation on the local scale is estimated by means of the flue gas dispersion model STACKS. In this study a limited number of photochemical reactions
Energy Technology Data Exchange (ETDEWEB)
Jmal, Hamdi; Ju, Ming Lei; Dupuis, Raphael; Aubry, Evelyne [Universit de Haute Alsace, Mulhouse (France)
2014-11-15
Polyurethane foam is a cellular material characterized by an interesting mechanical spectrum of properties: low density, capacity to absorb the deformation energy and low stiffness. This spectrum of properties makes polyurethane foam commonly used in many thermal, acoustic and comfort applications. Several models, such as memory, hyper-elastic and pseudo-elastic models have been developed in the literature to describe the mechanical response of polyurethane foam under quasi-static and dynamic test conditions. The main disadvantage of these models is the dependence of their parameters against the test conditions (strain rate, maximum compression level, etc). This affects the general character of their representativeness to the quasi-static and dynamic behaviours of polyurethane foam. The main goal of this article is to implement reliable mechanical model which is able to provide the quasi-static response of the polyurethane foam under different strain rates and large compressive deformation. The dimensional parameters of our model can be expressed by the product of two independent parts; the first contain only the test conditions and the second define the dimensionless and invariant parameters that characterize the foam material. The developed model has been proposed after several experimental studies allowing the apprehension of the quasi-static behaviour (through unidirectional compression tests). The polyurethane foam, under large deformations, exhibits a nonlinear elastic behaviour and viscoelastic behaviour. To assess the ability of our model to be a general representation, three industrial polyurethane foams have been considered.
Energy Technology Data Exchange (ETDEWEB)
Guillen, Donna Post [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2017-06-01
Manure management is a major concern for dairy farms, as manure emits significant quantities of greenhouse gases and contains concentrated nutrients, especially nitrogen and phosphorus. Current manure management practices consist of spreading minimally processed manure on agricultural fields, which releases greenhouse gases directly to the atmosphere and often leads to nutrient overloading on fields and runoff to surface and groundwater. A novel manure treatment system has been proposed that mitigates many of the current environmental concerns and creates value added products from the manure including bioplastics, electricity, fertilizer, and animal bedding. DAIRIEES, an Excel based model, allows users to enter characteristics about a dairy farm’s manure, manure management plan, and regional market. Based on these inputs, the five main processes of the integrated system—fermenter, anaerobic digester, bioplastics reactor, algae cultivation, and hydrothermal liquefaction or fast pyrolysis system—are analyzed in detail using data from laboratory scale experiments supplemented by information on full-scale processes from the literature. The model can be used to estimate performance of the integrated manure treatment system, including: 1) carbon and nutrient sequestration, 2) quantities and market value of end products, and 3) the system’s overall economic viability. The DAIRIEES model outlines the major economic considerations for construction and operation of a full scale integrated treatment system. This information can be used to inform a more detailed pro forma analysis of the deployed system.
Cho, Herman
2016-09-01
Allowed transition energies and eigenstate expansions have been calculated and tabulated in numerical form as functions of the electric field gradient asymmetry parameter for the zero field Hamiltonian of quadrupolar nuclides with I = 3 / 2 , 5 / 2 , 7 / 2, and 9 / 2. These results are essential to interpret nuclear quadrupole resonance (NQR) spectra and extract accurate values of the electric field gradient tensors. Applications of NQR methods to studies of electronic structure in heavy element systems are proposed.
Energy Technology Data Exchange (ETDEWEB)
Cho, Herman
2016-09-01
Allowed transition energies and eigenstate expansions have been calculated and tabulated in numerical form as functions of the electric field gradient asymmetry parameter for the zero field Hamiltonian of quadrupolar nuclides with I = 3/2, 5/2, 7/2, and 9/2. These results may be used to interpret nuclear quadrupole resonance (NQR) spectra and extract accurate values of the electric field gradient tensors. Applications of NQR methods to studies of electronic structure in heavy element systems are proposed. This material is based upon work supported by the U.S. Department of Energy Office of Science, Office of Basic Energy Sciences, Heavy Element Chemistry program.
Makowski, D.; Hendrix, E.M.T.; Ittersum, van M.K.; Rossing, W.A.H.
2001-01-01
In complex decision problems, some objectives are not well quantified or are not introduced explicitly in optimization models. In view of this inherent limitation of models, solutions that are nearly optimal, i.e. deviating less than a predefined percentage from the optimal value of the quantified
2013-01-01
Background Phylogeny estimation from aligned haplotype sequences has attracted more and more attention in the recent years due to its importance in analysis of many fine-scale genetic data. Its application fields range from medical research, to drug discovery, to epidemiology, to population dynamics. The literature on molecular phylogenetics proposes a number of criteria for selecting a phylogeny from among plausible alternatives. Usually, such criteria can be expressed by means of objective functions, and the phylogenies that optimize them are referred to as optimal. One of the most important estimation criteria is the parsimony which states that the optimal phylogeny T∗for a set H of n haplotype sequences over a common set of variable loci is the one that satisfies the following requirements: (i) it has the shortest length and (ii) it is such that, for each pair of distinct haplotypes hi,hj∈H, the sum of the edge weights belonging to the path from hi to hj in T∗ is not smaller than the observed number of changes between hi and hj. Finding the most parsimonious phylogeny for H involves solving an optimization problem, called the Most Parsimonious Phylogeny Estimation Problem (MPPEP), which is NP-hard in many of its versions. Results In this article we investigate a recent version of the MPPEP that arises when input data consist of single nucleotide polymorphism haplotypes extracted from a population of individuals on a common genomic region. Specifically, we explore the prospects for improving on the implicit enumeration strategy of implicit enumeration strategy used in previous work using a novel problem formulation and a series of strengthening valid inequalities and preliminary symmetry breaking constraints to more precisely bound the solution space and accelerate implicit enumeration of possible optimal phylogenies. We present the basic formulation and then introduce a series of provable valid constraints to reduce the solution space. We then prove that these constraints can often lead to significant reductions in the gap between the optimal solution and its non-integral linear programming bound relative to the prior art as well as often substantially faster processing of moderately hard problem instances. Conclusion We provide an indication of the conditions under which such an optimal enumeration approach is likely to be feasible, suggesting that these strategies are usable for relatively large numbers of taxa, although with stricter limits on numbers of variable sites. The work thus provides methodology suitable for provably optimal solution of some harder instances that resist all prior approaches. PMID:23343437