Algorithms for Symmetric Linear and Integer Programs
Bödi, Richard; Joswig, Michael
2010-01-01T23:59:59.000Z
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.
Linear Programming Environmental
Nagurney, Anna
Linear Program to control air pollution was developed in 1968 by Teller, which minimized cost Fall 2006 #12;Topics · Introduction · Background · Air · Land · Water #12;Introduction · "The United States spends more than 2% of its gross domestic product on pollution control, and this is more than any
Linear Programming and Kantorovich Spaces
S. Kutateladze
2009-05-08T23:59:59.000Z
This is a brief overview of the life of Leonid Kantorovich (1912--1986) and his contribution to the fields of linear programming and ordered vector spaces.
A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear ...
Stochastic linear programming games with concave preferences
2014-12-04T23:59:59.000Z
We study stochastic linear programming games: a class of stochastic ... be seen as linear programming games; examples include assignment games (Shapley ...
Termination of Linear Programs Ashish Tiwari
Tiwari, Ashish
Termination of Linear Programs Ashish Tiwari SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A tiwari@csl.sri.com Abstract. We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination
Termination of Linear Programs Ashish Tiwari #
Tiwari, Ashish
Termination of Linear Programs Ashish Tiwari # SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A tiwari@csl.sri.com Abstract. We show that termination of a class of linear loop programs is decidable. Linear loop programs are discreteÂtime linear systems with a loop condition governing termination
Linear optimization Linear programming using the Simplex method
McCready, Mark J.
Linear optimization Linear programming using the Simplex method Maximize M = 40 x1 + 60 x2 subject, that increasing x2 is the way to get the biggest impact. The idea of the simplex method is to move only
Duality for Mixed-Integer Linear Programs
2007-04-05T23:59:59.000Z
The theory of duality for linear programs is well-developed and has been successful ... methods for determining the effect of modifications to the input data on the ..... and the primal problem is bounded, since linear programming duality tells us ...
Optimization Online - Linear, Cone and Semidefinite Programming ...
Strong duality in conic linear programming: facial reduction and extended duals ... A new semide nite programming relaxation for the quadratic assignment ...
Linear Programming Lower Bounds for Minimum Converter ...
generation algorithm for solving the linear relaxation of the most promising ... Keywords: Optical Networks, Wavelength Assignment, Integer Programming.
Symmetries in Linear and Integer Programs
Bödi, R
2009-01-01T23:59:59.000Z
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show that for any linear program there exists an optimal solution in the fixed point set of its symmetry group. Using this result, we develop an algorithm that allows for reducing the dimension of any linear program having a non-trivial group of symmetries.
On linear programing approach to inventory control
Mayfield, John
On linear programing approach to inventory control problems Zhu received his PhD from Wayne State imbeds the inventory control problem into an infinite-dimensional linear program over a space of measures restricted classes of control policies. Additional auxiliary and dual linear programs are introduced
The Equivalence of Linear Programs and Zero-Sum Games
2012-01-15T23:59:59.000Z
In 1951, Dantzig showed the equivalence of linear programming problems and ... This note concerns the equivalence between linear programming (LP) ...
Blood Management Using Approximate Linear Programming
Shenoy, Prashant
Blood Management Using Approximate Linear Programming Marek Petrik and Shlomo Zilberstein January 13th, 2009 Marek Petrik and Shlomo Zilberstein () Blood Management Using Approximate Linear ProgrammingJanuary 13th, 2009 1 / 36 #12;Blood Inventory Management Problem Regional blood banks: Aggregate
Preservice teachers' knowledge of linear functions within multiple representation modes
You, Zhixia
2009-05-15T23:59:59.000Z
is examined by looking at their ability to adapt to different representation modes. The framework for subject matter content knowledge consists of five components: (1) flexibility across formal mathematical symbolisms; (2) flexibility between visual...
SEMANTICS OF PROGRAM REPRESENTATION GRAPHS G. RAMALINGAM and THOMAS REPS
Reps, Thomas W.
dependence graphs (PDGs) [Kuck81, Ferr87, Horw89]. They have also been used in a new algorithm for merging representation in various appli cations such as vectorization, parallelization [Kuck81], and merging program
A New Algorithm for Linear Programming
Dhananjay P. Mehendale
2015-03-28T23:59:59.000Z
In this paper we propose two types of new algorithms for linear programming. The first type of these new algorithms uses algebraic methods while the second type of these new algorithms uses geometric methods. The first type of algorithms is based on treating the objective function as a parameter. In this method, we form a matrix using coefficients in the system of equations consisting objective equation and equations obtained from inequalities defining constraint by introducing slack/surplus variables. We obtain reduced row echelon form for this matrix containing only one variable, namely, the objective function itself as an unknown parameter. We analyse this matrix in the reduced row echelon form and develop a clear cut method to find the optimal solution for the problem at hand, if and when it exists. We see that the entire optimization process can be developed through the proper analysis of the said matrix in the reduced row echelon form. The second type of algorithms that we propose for linear programming are inspired by geometrical considerations. All these algorithms pursue common aim of approaching closer and closer to centroid or some centrally located interior point for speeding up the process of reaching an optimal solution! We then proceed to show that the algebraic method developed above for linear programming naturally extends to non-linear and integer programming problems. For non-linear and integer programming problems we use the technique of Grobner bases and the methods of solving linear Diophantine equations respectively.
Good, Judith
This thesis describes research into the role of various factors in novice program comprehension, including the underlying programming paradigm, the representational features of the programming language, and the various types of information which can...
Alternative mixed-integer linear programming models of a maritime inventory routing problem
Grossmann, Ignacio E.
Alternative mixed-integer linear programming models of a maritime inventory routing problem Jiang is enhanced by reformulating the time assignment constraints. Next, we present a model based on event points. Sherali et al (1999) formulated a mixed-integer programming model based on a discrete time representation
A Linear Programming based Satisfiability solver using a new
Rossi, Francesca
is unsatisfiable or has a satisfying assignment, we solve a linear program. The solution of the linear program a satisfying assignment or a contradiction we solve a linear program. By the above men- tioned lemmaA Linear Programming based Satisfiability solver using a new Horn-driven search tree design Hans
Preservice teachers' knowledge of linear functions within multiple representation modes
You, Zhixia
2009-05-15T23:59:59.000Z
This study examines preservice teachers’ knowledge in the case of linear functions. Teachers’ knowledge in general consists of their subject matter knowledge and their pedagogical content knowledge. In this study, teachers’ subject matter knowledge...
Trajectory Optimization using Mixed-Integer Linear Programming
Trajectory Optimization using Mixed-Integer Linear Programming by Arthur George Richards Master Optimization using Mixed-Integer Linear Programming by Arthur George Richards Submitted to the Department subjected to avoidance and assignment requirements. The former include avoidance of collisions
Noncommercial Software for Mixed-Integer Linear Programming
2004-12-23T23:59:59.000Z
Dec 23, 2004 ... A mixed-integer linear program (MILP) is a mathematical program with linear ...... In addition to defining new template classes of constraints and .... This management must be performed by all MILP solvers, but it can be ...
A Dynamic Near-Optimal Algorithm for Online Linear Programming
Ye, Yinyu
-time forward dynamic pricing for PEVs charging/discharging on smart-grid; Yinyu Ye Online Linear Program 2009
Sergey A. Podoshvedov
2015-07-23T23:59:59.000Z
We develop a new method of representation of quantum states in terms of the displaced number states. We call it representation, where is an amplitude of the base displaced states. In particular, representation was obtained for set of the displaced number states with different amplitude of the displacement, two-mode squeezed vacuum (TMSV) and superposition of vacuum and single photon. The treatment is employed for building of elementary linear operators, in particular, two-qubit control-sign gate, Hadamard matrix between two two-dimensional Hilbert spaces. Main idea underlying the method is extraction of the displaced number state from initial state. Coherent qubit with large amplitude taken simultaneously two modes shifts two-mode target qubit on phase plane and constructive interference appears after measurement of single photon. The results are exact, any approximations are not exploited. We show implementation of the gates with almost unity fidelity of the output states is possible in realistic scenario.
Transient Analysis of Linear Circuits using Constraint Logic Programming
Gilbert, David
Transient Analysis of Linear Circuits using Constraint Logic Programming Archana Shankar, David London EC1V 0HB, UK Abstract This paper describes the design of a transient analysis program for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R). The transient analysis
Recent Progresses on Linear Programming and the Simplex Method
Ye, Yinyu
Recent Progresses on Linear Programming and the Simplex Method Yinyu Ye www.stanford.edu/~yyye K Programming started... #12;May 1, 2013 CMS Montreal ... with the simplex method #12;May 1, 2013 CMS Montreal Outline Â· Counterexamples to the Hirsch conjecture Â· Linear Programming (LP) and the simplex method
Optimization Online - Large-Scale Linear Programming Techniques ...
Michael Wagner
2002-02-12T23:59:59.000Z
Feb 12, 2002 ... Large-Scale Linear Programming Techniques for the Design of Protein Folding Potentials. Michael Wagner (mwagner ***at*** odu.edu)
PuLP: A Linear Programming Toolkit for Python
2011-09-05T23:59:59.000Z
Sep 5, 2011 ... Many mixed-integer linear programming (MILP) solvers are .... tions, to place facilities and assigns the production of n products to these ...
A several new mixed integer linear programming formulations for ...
2014-05-31T23:59:59.000Z
May 31, 2014 ... linear programming formulations for exploration of information flow within ... potential locations are established, and each user is assigned to ...
A new mixed integer linear programming formulation for one ...
2014-05-31T23:59:59.000Z
new mixed integer linear programming formulations for first and second prob- ... the best formulation was based on WF closest assignment constraints proposed.
Calmness of linear programs under perturbations of all data
M.J. CĂˇnovas
2014-05-26T23:59:59.000Z
May 26, 2014 ... Calmness of linear programs under perturbations of all data: ... for the optimal set mapping, as well as an operative upper bound for the ...
Classical Simplex Methods for Linear Programming and Their ...
This paper presents a new primal dual simplex method and investigates the ... The classical simplex algorithm is the most popularly used for linear programming ...
The Next Linear Collider Klystron Development Program*
E. Jongewaard; G. Caryotakis; C. Pearson; R. M. Phillips; D. Sprehn; A. Vlieks
2000-08-19T23:59:59.000Z
Klystrons capable of 75 MW output power at 11.4 GHz have been under development at SLAC for the last decade. The work has been part of the program to realize all the components necessary for the construction of the Next Linear Collider (NLC). The effort has produced a family of solenoid-focused 50 MW klystrons, which are currently powering a 0.5 GeV test accelerator at SLAC and several test stands, where high power components are evaluated and fundamental research is performed studying rf breakdown and dark current production. Continuing development has resulted in a Periodic Permanent Magnet (PPM) focused 50 MW klystron, tested at SLAC and subsequently contracted for manufacture by industry in England and Japan. A 75 MW version of that PPM klystron was built at SLAC and reached 75 MW, with 2.8 microsecond pulses. Based on this design, a prototype 75 MW klystron, designed for low-cost manufacture, is currently under development at SLAC, and will eventually be procured from industry in modest quantities for advanced NLC tests. Beyond these developments, the design of Multiple Beam Klystrons (MBKs) is under study at SLAC. MBKs offer the possibility of considerably lower modulator costs by producing comparable power to the klystrons now available, at much lower voltages. * This work supported by the Department of Energy under contract DE-AC03-76SF00515
Control structures in linear and stack-based Genetic Programming
Fernandez, Thomas
Control structures in linear and stack-based Genetic Programming Elko B. Tchernev and Dhananjay S condition, the if and else sections, etc.) are all subtrees of the flow- control node. Linear and stack implementation issues in linear and stack-based GP. A set of flow- control nodes is presented, and examples given
IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming
Waterloo, University of
IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming Babak Alipanahi1 automatically picked peaks. IPASS is proposed as a novel integer linear programming (ILP) based assignment assignment method. Although a variety of assignment approaches have been developed, none works well on noisy
Comparison of open-source linear programming solvers.
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin D.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01T23:59:59.000Z
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
Linear Programming Uses for Recycling and Product Reuse
Nagurney, Anna
Linear Programming Uses for Recycling and Product Reuse Tara Demeyer Management Science I #12;Outline Introduction Construction Waste Recycling Paper Waste Recycling Printer Component Reuse #12;Reverse Logistics Returns/ Damaged Product Recycling of waste materials Reuse of product components #12
Designing AC Power Grids using Integer Linear Programming
2011-02-18T23:59:59.000Z
view of recent developments in integer linear programming, we revisit a less known .... optimal solution of the DC model was the minimum cost circuit of the network. ... Andersson, G.: Modelling and Analysis of Electric Power Systems (
Linear programming model for optimum resource allocation in rural systems
Devadas, V. [Indian Inst. of Tech., Kharagpur (India)
1997-07-01T23:59:59.000Z
The article presents a model for optimum resource allocation in a rural system. Making use of linear programming, the objective function of the linear programming model is to maximize the revenue of the rural system, and optimum resource allocation is made subject to a number of energy- and nonenergy-related constraints relevant to the rural system. The model also quantifies the major yields as well as the by-products of different sectors of the rural economic system.
CS 521: LINEAR PROGRAMMING Fall 2009, 3 Credits INSTRUCTOR: Bahman Kalantari (kalantar (Elements of Linear Algebra, Calculus and Multivariable Calculus). GRADING: Homework assignments (written OUTLINE: Linear inequalities and the feasibility problem. The linear programming prob- lem (LP). Related
Generative Story Worlds Linear Logic Programs
Goldstein, Seth Copen
with standard logical implication: buy_soda : has(Alice, $1) ^ wants(Alice, soda) has(Alice, soda) #12;LINEAR LOGIC 13 A -o B #12;14 buy_soda : has(Alice, $1) * wants(Alice, soda) -o has(Alice, soda) #12;15 A * B/murder : anger C C' * anger C C' * anger C C' * anger C C' * at C L * at C' L * has C weapon -o {at C L * !dead C
Alexander G. Kyriakos
2004-07-09T23:59:59.000Z
The present paper is the continuity of the previous papers "Non-linear field theory" I and II. Here on the basis of the electromagnetic representation of Dirac's electron theory we consider the geometrical distribution of the electromagnetic fields of the electron-positron. This gives the posibility to obtain the explanation and solution of many fundamental problems of the QED.
Truthful and Near-Optimal Mechanism Design via Linear Programming
Sandholm, Tuomas W.
Truthful and Near-Optimal Mechanism Design via Linear ProgrammingÂŁ Ron LaviĂť ronlavi mechanisms that are truthful in expectation. We show that for packing domains, any Â«-approximation algorithm an Â«-approximation mechanism that is truthful in expectation. This immediately yields a variety of new
Integer linear programming models for a cement delivery problem
Hertz, Alain
Integer linear programming models for a cement delivery problem Alain Hertz D´epartement de math.uldry@unifr.ch and marino.widmer@unifr.ch April 4, 2011 Abstract We consider a cement delivery problem with an heterogeneous in [14], [15] and [16] and are reviewed in [4]. In this paper, we study a cement delivery problem which
Multi-stage Stochastic Linear Programming: Scenarios Versus Events
2010-05-17T23:59:59.000Z
To solve the multi-stage linear programming problem, one may use a deterministic or a sto- ... Of course, other approaches can be used, as for example to infer statistical ...... [4] A. Berkelaar, J. A. S. Gromicho, R. Kouwenberg, and S. Zhang.
Interior-point methods for linear programming: a guided tour
Glineur, FranĂ§ois
linear programming1. The simplex algorithm, first developed by* * Dantzig in 1947, is a very.). However, an article by Karmarkar [Kar84] introduced in 1984 a new clas* *s of meth- ods: the so optimization problems. The purpose of this article is to give an overview of this rather new
Interior-point methods for linear programming: a guided tour
Glineur, FranĂ§ois
talk about linear programming 1 . The simplex algorithm, #12;rst developed by Dantzig in 1947 variety of problems (production planning, transportation, scheduling, etc.). However, an article be generalized to other types of convex optimization problems. The purpose of this article is to give an overview
No-signaling Quantum Key Distribution: Solution by Linear Programming
Won-Young Hwang; Joonwoo Bae; Nathan Killoran
2013-01-15T23:59:59.000Z
We outline a straightforward approach for obtaining a secret key rate using only no-signaling constraints and linear programming. Assuming an individual attack, we consider all possible joint probabilities. Initially, we study only the case where Eve has binary outcomes, and we impose constraints due to the no-signaling principle and given measurement outcomes. Within the remaining space of joint probabilities, by using linear programming, we get bound on the probability of Eve correctly guessing Bob's bit. We then make use of an inequality that relates this guessing probability to the mutual information between Bob and a more general Eve, who is not binary-restricted. Putting our computed bound together with the Csisz\\'ar-K\\"orner formula, we obtain a positive key generation rate. The optimal value of this rate agrees with known results, but was calculated in a more straightforward way, offering the potential of generalization to different scenarios.
Planning under uncertainty solving large-scale stochastic linear programs
Infanger, G. (Stanford Univ., CA (United States). Dept. of Operations Research Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft)
1992-12-01T23:59:59.000Z
For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.
Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution
Hamadameen, Abdulqader Othman [Optimization, Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia); Zainuddin, Zaitul Marlizawati [Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia)
2014-06-19T23:59:59.000Z
This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when ?{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.
Miller, William H.
Semiclassical theory of electronically nonadiabatic dynamics: Results of a linearized approximation, California 94720 Received 6 May 1998; accepted 31 July 1998 A linearized approximation to the semiclassical easier to apply than the full SC-IVR because it linearizes the phase difference between interfering
Lyapunov Function Synthesis using Handelman Representations.
Sankaranarayanan, Sriram
Lyapunov Function Synthesis using Handelman Representations. Sriram Sankaranarayanan Xin Chen investigate linear programming relaxations to synthesize Lyapunov functions that es- tablish the stability approach searches for a Lyapunov function, given a parametric form with unknown coefficients
Reducing the Linear Perception of Nonlinearity: Use of a Physical Representation
Spirtes, Peter
representation; correlation heuristic Consider the story of an ancient king and the inventor of chess. When the inventor presented the chess game to the king, the king was so impressed that he offered him a reward. The inventor asked for rice grains for each square of the chess board, such that he would get one grain
A Distributed Simplex Algorithm for Degenerate Linear Programs and Multi-Agent Assignments
Bullo, Francesco
A Distributed Simplex Algorithm for Degenerate Linear Programs and Multi-Agent Assignments Mathias: Distributed Simplex, Distributed Linear Programming, Asynchronous Algorithm, Multi-Agent Task Assignment. M we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer
Non-Linear Continuum Regression Using Genetic Programming Ben.McKay@ncl.ac.uk
Fernandez, Thomas
Non-Linear Continuum Regression Using Genetic Programming Ben McKay Ben.McKay@ncl.ac.uk Mark Willis In this contribution, genetic programming is combined with continuum regression to produce two novel non-linear-based' strategy. Having discussed continuum regression, the modifications required to extend the algorithm for non-linear
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo; Stadler, Michael; Siddiqui, Afzal; Marnay, Chris; DeForest, Nicholas; Barbosa-Povoa, Ana; Ferrao, Paulo
2013-05-23T23:59:59.000Z
This paper describes the introduction of stochastic linear programming into Operations DER-CAM, a tool used to obtain optimal operating schedules for a given microgrid under local economic and environmental conditions. This application follows previous work on optimal scheduling of a lithium-iron-phosphate battery given the output uncertainty of a 1 MW molten carbonate fuel cell. Both are in the Santa Rita Jail microgrid, located in Dublin, California. This fuel cell has proven unreliable, partially justifying the consideration of storage options. Several stochastic DER-CAM runs are executed to compare different scenarios to values obtained by a deterministic approach. Results indicate that using a stochastic approach provides a conservative yet more lucrative battery schedule. Lower expected energy bills result, given fuel cell outages, in potential savings exceeding 6percent.
Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming
Gilbert, David
Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming Archana for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R). The transient analysis program parses the input circuit description into a network graph, analyses its semantic
On the Equivalence of Linear Programming Problems and Zero-Sum ...
Ilan Adler
2010-06-18T23:59:59.000Z
Jun 18, 2010 ... Abstract: In 1951, Dantzig showed the equivalence of linear programming and two-person zero-sum games. However, in the description of his ...
Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic
Bertsimas, Dimitris J.
We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ...
Tian, Zhen; Folkerts, Michael; Shi, Feng; Jiang, Steve B; Jia, Xun
2015-01-01T23:59:59.000Z
Monte Carlo (MC) simulation is considered as the most accurate method for radiation dose calculations. Accuracy of a source model for a linear accelerator is critical for the overall dose calculation accuracy. In this paper, we presented an analytical source model that we recently developed for GPU-based MC dose calculations. A key concept called phase-space-ring (PSR) was proposed. It contained a group of particles that are of the same type and close in energy and radial distance to the center of the phase-space plane. The model parameterized probability densities of particle location, direction and energy for each primary photon PSR, scattered photon PSR and electron PSR. For a primary photon PSRs, the particle direction is assumed to be from the beam spot. A finite spot size is modeled with a 2D Gaussian distribution. For a scattered photon PSR, multiple Gaussian components were used to model the particle direction. The direction distribution of an electron PSRs was also modeled as a 2D Gaussian distributi...
Beltran-Royo, Cesar
integer linear programming. 1. Introduction In 1957, the Quadratic Assignment Problem (QAP) was introducedSolving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers Huizhen Zhang Cesar Beltran-Royo Liang Ma 19/04/2010 Abstract The Quadratic Assignment
Deriving Unit Cost Coefficients for Linear Programming-Driven Priority-Based Simulations
Lund, Jay R.
Deriving Unit Cost Coefficients for Linear Programming-Driven Priority-Based Simulations By INES-by-step procedure to generate priority preserving weights for linear programming driven simulations models. Many-priority deliveries, the assignment of unit weights in the objective function can be a matter of some art
Scalable massively parallel simplex algorithms for block-structured linear programs
Hall, Julian
Scalable massively parallel simplex algorithms for block-structured linear programs Ilkay Boduro of Mathematics, University of Edinburgh September 14th 2007 Scalable massively parallel simplex algorithms for block-structured linear programs #12;Simplex methods for LP problems minimize f = cT x subject to Ax = b
New Semidefinite Programming Relaxations for the Linear Ordering ...
2015-01-15T23:59:59.000Z
Her model is based on the observation that linear orderings can be fully described by a series of cuts. .... [48] and input-output analysis [39]), sociology (
THE CENTRAL CURVE IN LINEAR PROGRAMMING 1. Introduction ...
2010-12-17T23:59:59.000Z
Section 2 offers an analysis of central curves in the plane, with emphasis on the dual ...... path is generated by the circuit polynomials (21) and the d linear ...
A Note on the Implementation and Applications of Linear Logic Programming Languages
Harland, James
A Note on the Implementation and Applications of Linear Logic Programming Languages J.A. Harland D programming languages, such as Prolog, have their origins in classical logic. Recently it has been shown how logic programming languages can be based on lin ear logic, a logic designed with bounded re sources
Chance Constrained Mixed Integer Program: Bilinear and Linear ...
Assumption: In this paper, to help us focus on typical problems, we make an assumption ...... equivalents: an approach to stochastic programming of heating oil, ...
Analysis of Linear Programming Relaxations for a Class of Connectivity Problems
Goemans, Michel X.
We consider the analysis of linear programming (LP) relaxations for a class of connectivity problems. The central problem in the class is the survivable network design problem - the problem of designing a minimum cost ...
Advances in Interior Point Methods for Large-Scale Linear Programming
Colombo, Marco
2007-01-01T23:59:59.000Z
This research studies two computational techniques that improve the practical performance of existing implementations of interior point methods for linear programming. Both are based on the concept of symmetric neighbourhood ...
Linear Program to Select Energy Conservation Projects in an Existing Facility
Mak, J. Y.
1983-01-01T23:59:59.000Z
and petrJchemical industries for scheduling, product planning and utility system optimization. In an energy audit of a refinery or chemical plant, linear programming is a very useful technique in the screening of potential energy conservation projects...
Linear Dynamic Programs for Resource Management Marek Petrik
Massachusetts at Amherst, University of
dynamic programming, a method used to optimize hydroelectric systems. 1 Introduction Sequential decision a river reservoir to produce hydroelectric power. Among renewable sources, hydroelectricity has the lowest management can therefore significantly reduce carbon emissions. Hydroelectric power is usually produced
A linear programming problem Math 10120, Spring 2014
Galvin, David
programming April 7, 2014 1 / 2 #12;A diet - of bananas -- and beer I need at least 2000 calories a day of carbohydrates, .45mg of Vitamin B-6, and cost 90 cents each. A bottle of beer gives me 180 calories, 13g of carbohydrates, .2mg of Vitamin B-6, and costs 70 cents. If I want to have a healthy diet of bananas and beer
for MSIS 26:711:651 Linear Programming Last updatedon 1/28/13 at 08:37 PM
and References: 1. (Required)Bazaraa, Jarvis and Sherali "Linear Programming and network flows", fourth edition for Mathematical Programming" 2nd edition , Boyd & Fraser Publishing Company, 2002 The first book is our main textSyllabus for MSIS 26:711:651 Linear Programming Last updatedon 1/28/13 at 08:37 PM Texts
Optimization of HDR brachytherapy dose distributions using linear programming with penalty costs
Alterovitz, Ron
Optimization of HDR brachytherapy dose distributions using linear programming with penalty costs-dose-rate HDR brachytherapy, a type of radio- therapy in which a radioactive source is guided through catheters each year,1 is increasingly treated with high-dose-rate HDR brachytherapy, a medical procedure in which
AUTOMATIC LOOP-SHAPING OF QFT CONTROLLERS VIA LINEAR PROGRAMMING1
Massachusetts at Amherst, University of
AUTOMATIC LOOP-SHAPING OF QFT CONTROLLERS VIA LINEAR PROGRAMMING1 Yossi Chait2 Qian Chen3 and C-time QFT users, there is a genuine need for an automatic loop-shaping tool to generate a first-cut solution. Clearly, such an automatic process must involve some sort of optimization, and, while recent results
Truthful and NearOptimal Mechanism Design via Linear Programming ronlavi@ist.caltech.edu
Truthful and NearÂOptimal Mechanism Design via Linear Programming #3; Ron Lavi y ronlavi mechanisms that are truthful in expectation. We show that for packing domains, any #11;Âapproximation to construct an #11;Âapproximation mechanism that is truthful in expectation. This immediately yields a variety
Job Scheduling Using successive Linear Programming Approximations of a Sparse Model
Paris-Sud XI, Université de
Job Scheduling Using successive Linear Programming Approximations of a Sparse Model Stephane of parallel jobs on a set of processors either in a cluster or in a multiprocessor computer. For the makespan objective, i.e., the comple- tion time of the last job, this problem has been shown to be NP
LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP
Scott, Alexander Alexander
LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP ALEXANDER D. SCOTT AND GREGORY B. SORKIN Abstract. The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint(G) (13/75 + o(1))m, which gives a faster Max 2-CSP algorithm that uses exponential space: running in time
Linear programming applied to the ower sector: a Gladiolus bulb production case study
Dragoti-Çela, Eranda
Linear programming applied to the Żower sector: a Gladiolus bulb production case study Jose representative Brazilian bulb growing and trading company's decision making process, during the Gladiolus production planning activity. The pertinent LP model was focused on client's bulb requests to be attended
Antsaklis, Panos
A Linear Programming Approach to Time Optimal Control of Integrator Switched Systems with State, USA Abstract-- In this paper, time optimal control problems of a class of integrator switched systems Recently, optimal control problems of switched and hybrid systems have attracted many researchers from
STABLE REDUCTION TO KKT SYSTEMS IN BARRIER METHODS FOR LINEAR AND QUADRATIC PROGRAMMING
Stanford University
-dual barrier methods for linear and quadratic programming. Following Freund and Jarre, we explore methods, y, z. Most authors eliminate z and/or x without further ado. Freund and Jarre [FJ95] first showed scaling into a KKT system involving a symmetric matrix K. We generalize Freund and Jarre's approach
Ordóńez, Fernando
ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy Lecturer: Fernando Ord#19;o~nez 1 Full simplex algorithm To solve min c t x : Ax = b; x #21; 0 = b; x #21; 0 from (0; b) as the initial BFS using Simplex. #15; If u #3; > 0 original problem
Ordóńez, Fernando
ISE 536Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy Lecturer: Fernando Ord´o~nez 1 Full simplex algorithm To solve min ctx : Ax = b, x 0. To start Solve the problem u = min m k=1 yk : Ax + Iy = b, x 0 from (0, b) as the initial BFS using Simplex
Solving Linear Programs #2 1.0 Manipulations of the simplex method
McCalley, James D.
1 Solving Linear Programs #2 1.0 Manipulations of the simplex method In setting up the simplex to do now is illustrate the manipulations taken by the simplex method in solving this problem. #12;2 The material of this section is adapted from [1]. Fig. 1: Illustration of feasible region 2.0 Simplex
Application of linear programming methods to determine the best location of concrete dispatch plants
Yong, Alexander
plants Carlos Horacio Gómez Junghye Moon University of Illinois Urbana-Champaign Introduction: I just costs, our plants (factories) should be as close as possible to our actual and potential clients, so of linear programming can be extremely helpful to determine the ideal location of concrete dispatch plants
Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda
Zhang, Yin
Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda Zhijun Wu y and Yin Zhang z August, 2001 Abstract. The double digestion problem for DNA restriction mapping is knownscale double digestion problems. Key Words. DNA sequencing, restriction mapping, double digestion, NP
Grossmann, Ignacio E.
1 A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank, Midland, MI 48674, USA Abstract This paper presents a novel mixed-integer linear programming (MILP multi-product processing lines and the assignment of dedicated storage tanks to finished products
Polymer representations and geometric quantization
Miguel Campiglia
2011-11-02T23:59:59.000Z
Polymer representations of the Weyl algebra of linear systems provide the simplest analogues of the representation used in loop quantum gravity. The construction of these representations is algebraic, based on the Gelfand-Naimark-Segal construction. Is it possible to understand these representations from a Geometric Quantization point of view? We address this question for the case of a two dimensional phase space.
Estimation of the regional demand for hired farm labor: a parametric linear programming approach
Cox, Thomas Lee
1980-01-01T23:59:59.000Z
86 86 89 93 101 TABLE OF CONTENTS (continued) Chapter Page The Linear Programming Framework Introduction Assumptions Similarities and Contrasts of Marginal and LP Analysis The Mathematical LP Model The Duality Context Derived Factor... migratory labor tha it implies. The style and f?zmat of this thesis follows that of the Amer-ican- gournN1 of Agricultural gconomj, cs. At the national level there 's growing concern over the "leakaqa" of Mexican Nationals from Southves. secondary...
Sun Wei [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Huang, Guo H., E-mail: huang@iseis.org [Institute for Energy, Environment and Sustainability Research, UR-NCEPU, North China Electric Power University, Beijing 102206 (China); Institute for Energy, Environment and Sustainable Communities, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Lv Ying; Li Gongchen [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada)
2012-06-15T23:59:59.000Z
Highlights: Black-Right-Pointing-Pointer Inexact piecewise-linearization-based fuzzy flexible programming is proposed. Black-Right-Pointing-Pointer It's the first application to waste management under multiple complexities. Black-Right-Pointing-Pointer It tackles nonlinear economies-of-scale effects in interval-parameter constraints. Black-Right-Pointing-Pointer It estimates costs more accurately than the linear-regression-based model. Black-Right-Pointing-Pointer Uncertainties are decreased and more satisfactory interval solutions are obtained. - Abstract: To tackle nonlinear economies-of-scale (EOS) effects in interval-parameter constraints for a representative waste management problem, an inexact piecewise-linearization-based fuzzy flexible programming (IPFP) model is developed. In IPFP, interval parameters for waste amounts and transportation/operation costs can be quantified; aspiration levels for net system costs, as well as tolerance intervals for both capacities of waste treatment facilities and waste generation rates can be reflected; and the nonlinear EOS effects transformed from objective function to constraints can be approximated. An interactive algorithm is proposed for solving the IPFP model, which in nature is an interval-parameter mixed-integer quadratically constrained programming model. To demonstrate the IPFP's advantages, two alternative models are developed to compare their performances. One is a conventional linear-regression-based inexact fuzzy programming model (IPFP2) and the other is an IPFP model with all right-hand-sides of fussy constraints being the corresponding interval numbers (IPFP3). The comparison results between IPFP and IPFP2 indicate that the optimized waste amounts would have the similar patterns in both models. However, when dealing with EOS effects in constraints, the IPFP2 may underestimate the net system costs while the IPFP can estimate the costs more accurately. The comparison results between IPFP and IPFP3 indicate that their solutions would be significantly different. The decreased system uncertainties in IPFP's solutions demonstrate its effectiveness for providing more satisfactory interval solutions than IPFP3. Following its first application to waste management, the IPFP can be potentially applied to other environmental problems under multiple complexities.
Yoshio Uwano; Hiromi Yuya
2008-07-25T23:59:59.000Z
In the paper of Uwano [Czech. J. of Phys., vol.56, pp.1311-1316 (2006)], a gradient system is found on the space of density matrices endowed with the quantum SLD Fisher metric (to be referred to as the quantum information space) that realizes a generalization of a gradient system on the space of multinomial distributions studied by Nakamura [Japan J. Indust. Appl. Math., vol.10, pp.179-189 (1993)]. On motived by those papers, the present paper aims to construct a gradient system on the quantum information space that realizes the Karmarkar flow, the continuous limit of the Karmarkar projective scaling algorithm for linear programming.
Evaluating the impact of AND/OR search on 0-1 integer linear programming
Marinescu, Radu; Dechter, Rina
2010-01-01T23:59:59.000Z
Wolsey, J. (1998). Integer programming. New York: Wiley. 48.and practice of constraint programming (CP) (pp. 660–705).in mixed-integer programming. Mathematical Programming, 1(
Hafstein, Sigurđur Freyr
Introduction Relationship between ISS and Robust Lyapunov Functions Computing Local Robust Lyapunov Functions by Linear Programming Computing Lo Computation of Local ISS Lyapunov Function Via Linear;Introduction Relationship between ISS and Robust Lyapunov Functions Computing Local Robust Lyapunov Functions
Street, Nick
Breast Cancer Diagnosis and Prognosis via Linear Programming \\Lambda Olvi L. Mangasarian, W. Nick cancer diagnosis and prognosis. The first application to breast cancer diagnosis utilizes characteristics breast cancer is likely to recur in patients that have had their cancers excised. This gives
A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem
Diaby, Moustapha
2008-01-01T23:59:59.000Z
In this paper, we propose a linear programming (LP) formulation of the Quadratic Assignment Problem (QAP) with O(n^8) variables and O(n^7) constraints, where n is the number of assignments. A small experimentation that was undertaken in order to gain some rough indications about the computational performance of the model is discussed.
Ordóńez, Fernando
ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 8: Simplex Method look for the BFS associated to x 2 ; x 4 ; x 5 ? Let us run the algorithm What did simplex do; 2.2 Outline of the Simplex Algorithm Let u ij be the elements of the tableau, i = 0; : : : ; m and j
Ordóńez, Fernando
ISE 536{Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma Lecturer: Fernando Ord#19;o~nez 1 Dual Simplex #15; Usual Simplex Maintain a BFS and aim maintain all #22; c j #21; 0, but potentially some b i Simplex Algorithm 1. Select row r
Ordóńez, Fernando
ISE 536Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma Lecturer: Fernando Ord´o~nez 1 Dual Simplex · Usual Simplex Maintain a BFS and aim for optimality, but potentially some bi Simplex Algorithm 1. Select row r such that (xB)r = ur0
Clement, Prabhakar
2001-01-01T23:59:59.000Z
of this present study was to introduce a simple, easily understood method for carrying out non-linear regression: Microsoft Excel; Non-linear regression; Least squares; Iteration; Goodness of fit; Curve fit wwwComputer Methods and Programs in Biomedicine 65 (2001) 191200 A step-by-step guide to non-linear
Gugat, Martin
consisting of two linear mappings, an allocation and a timing function. In this paper, we address the problem allocation function, a continuous relaxation of this problem is studied by passing from linear to quasi of the null space of the allocation function. Therefore, a branching approach is proposed for finding quasi
A Current-Voltage Successive Linear Programming Approach to Solving the ACOPF
Oren, Shmuel S.
, DC, USA richard.oneill@ferc.gov Variables: pg n Total linearized real power generation at bus n pg n,l Linear segment l of generation at bus n qg n Reactive power generation at bus n vn Voltage magnitude Maximum real power generation at bus n Qmin n Minimum reactive power generation at bus n Qmax n Maximum
Optimization Online - PuLP: A Linear Programming Toolkit for Python
Stuart Mitchell
2011-09-22T23:59:59.000Z
Sep 22, 2011 ... PuLP is a high-level modelling library that leverages the power of the ... Keywords: mathematical programming; Python; modelling language.
B. Bruegmann
1993-12-02T23:59:59.000Z
The loop representation plays an important role in canonical quantum gravity because loop variables allow a natural treatment of the constraints. In these lectures we give an elementary introduction to (i) the relevant history of loops in knot theory and gauge theory, (ii) the loop representation of Maxwell theory, and (iii) the loop representation of canonical quantum gravity. (Based on lectures given at the 117. Heraeus Seminar, Bad Honnef, Sept. 1993)
Antsaklis, Panos
No. 80/17, Dept. of Electrical Engineering, Imperial College, June 1980. #12;P. J. Antsaklis, "Notes of Linear Control Systems," Publication No. 80/17, Dept. of Electrical Engineering, Imperial College, June," Publication No. 80/17, Dept. of Electrical Engineering, Imperial College, June 1980. #12;P. J. Antsaklis
Practical Guidelines for Solving Difficult Linear Programs1 Ed Klotz Alexandra M. Newman
, algorithmic tuning, numerical stability,11 memory use, run time, tutorials12 1 Introduction13 Operations. Furthermore, improvements in computing power and linear pro-18 gramming solvers have often prompted tuning. We assume basic familiarity with fundamental27 1 #12;mathematics, such as matrix algebra
Application of a dynamic linear programming model for optimum use of range resources over time
Sharp, Wayne Winston
1964-01-01T23:59:59.000Z
~ . ~ ~ ~ ~ ? ~ ~ ~ ~ ~ ~ ~ ~ Scope and Importance of Range Resource Use . . . . . . . . e. . . ? " . . Present Status of the Problem, Objectives of the Study 1 2 4 6 11 II. DESCRIPTION OF THE STUDY AREA, Size and Location of the Area, Major Soils and Types of Enterprises... ~ Cattle Transfer Equations , ee ~ ~ ~ ~ ~ ~ 46 46 48 52 54 55 58 6'I 62 66 66 68 7'1 75 75 76 76 77 77 The Function to be Maximized The Role of Management. Program I Program II Program III 80 80 82 82 83 V. RESULTS. Optimal...
Leung, L.C. [Chinese Univ. of Hong Kong, Shatin (Hong Kong). Decision Science and Managerial Economics] [Chinese Univ. of Hong Kong, Shatin (Hong Kong). Decision Science and Managerial Economics; Khator, S.K. [Univ. of South Florida, Tampa, FL (United States). Industrial and Management Systems Engineering] [Univ. of South Florida, Tampa, FL (United States). Industrial and Management Systems Engineering
1995-05-01T23:59:59.000Z
The Power Delivery Substation Division at Florida Power and Light (FPL) must plan and provide logistical support for about 2,000 transformers located at roughly 400 substations. Each year, to meet new transformer requirements, the Division must make the decision of procuring and/or relocating transformers. Due to the large number of transformers and substations involved, there is a strong need for a systematic approach to determine optimally the decisions for transformer procurement and relocation, as well as their schedules. In this paper, a mixed 0-1 linear programming model is developed for that purpose.
Advances in Normal Conducting Accelerator Technology from the X-Band Linear Collider Program
Adolphsen, Chris
2005-01-01T23:59:59.000Z
In the early 1990's, groups at SLAC and KEK began dedicated development of X-band (11.4 GHz) rf technology for a next generation, TeV-scale linear collider. The choice of a relatively high frequency, four times that of the SLAC 50 GeV Linac, was motivated by the cost benefits of having lower rf energy per pulse (hence fewer rf components) and reasonable efficiencies at high gradients (hence shorter linacs). However, to realize such savings requires operation at gradients and peak powers much higher than that hitherto achieved. During the past 15 years, these challenges were met through innovations on several fronts, and resulted in a viable rf system design for a linear collider. This paper reviews these achievements, which include developments in the generation and transport of high power rf, and new insights into high gradient limitations.
Robertson, D.; Uschold, M.; Bundy, Alan; Muetzelfeldt, R.
There is a growing interest in programs which help users with little experience of computing to construct simulation models. Much recent development work on such systems has utilized comparatively simple mathematical methods (such as system Dynamics...
Solutions of ordinary and partial differential equations by a linear programming technique
Ormand, James Franklin
1966-01-01T23:59:59.000Z
for programming techniques and topics for investigation were invaluable in the results of this research. Next, I would like to extend my appreciation to these members of the graduate faculty who served on my committee: Dr. H. A. Luther, Professor... (boundary) conditions, y(0. 0) = 0 and y(1. 5) . 557936, and with step length (H) . 5. We have the following situation: y(0) 0 y(1. 5) ~ . 557936 0 . 5 1. 0 1. 5 To find: y(x), y'(x) and y''(x) at each of the above 4 points. The output from the dual...
Current Status of the Next Linear Collider X-Band Klystron Development Program
Caryotakis, G.; Haase, A.A.; Jongewaard, E.N.; Pearson, C.; Sprehn, D.W.; /SLAC
2005-05-09T23:59:59.000Z
Klystrons capable of driving accelerator sections in the Next Linear Collider (NLC) have been developed at SLAC during the last decade. In addition to fourteen 50 MW solenoid-focused devices and a 50 MW Periodic Permanent Magnet focused (PPM) klystron, a 500 kV 75 MW PPM klystron was tested in 1999 to 80 MW with 3 {micro}s pulses, but very low duty. Subsequent 75 MW prototypes aimed for low-cost manufacture by employing reusable focusing structures external to the vacuum, similar to a solenoid electromagnet. During the PPM klystron development, several partners (CPI, EEV and Toshiba) have participated by constructing partial or complete PPM klystrons. After early failures during testing of the first two devices, SLAC has recently tested this design (XP3-3) to the full NLC specifications of 75 MW, 1.6 {micro}s pulse length, and 120 Hz. This 14.4 kW average power operation came with an efficiency of 50%. The XP3-3 average and peak output power, together with the focusing method, arguably makes it the most advanced high power klystron ever built anywhere in the world. Design considerations and test results for these latest prototypes will be presented.
Aleks Kleyn
2015-05-08T23:59:59.000Z
Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more general point of view I started the book from consideration of Cartesian product of representations. Polymorphism of representations is a map of Cartesian product of representations which is a morphism of representations with respect to each separate independent variable. Reduced morphism of representations allows us to simplify the study of morphisms of representations. However a representation has to satisfy specific requirements for existence of reduced polymomorphism of representations. It is possible that Abelian group is only $\\Omega$-algebra, such that representation in this algebra admits polymorphism of representations. However, today, this statement has not been proved. Multiplicative $\\Omega$-group is $\\Omega$-algebra in which product is defined. The definition of tensor product of representations of Abelian multiplicative $\\Omega$-group is based on properties of reduced polymorphism of representations of Abelian multiplicative $\\Omega$-group. Since an algebra is a module in which the product is defined, then we can use this theory to study linear map of algebra. For instance, we can study the set of linear transformations of $D$-algebra $A$ as representation of algebra $A\\otimes A$ in algebra $A$.
transformations: representations
Nguyen, Dat H.
Overview 1. Number transformations: from one base to another 2. Integer representations 3. Real rate, caches... #12; ECS 50, Discussion on 4/25 2 Integer Transformation: From Decimal to Binary Let, Discussion on 4/25 3 Integer Transformation: From Binary to Decimal Compute the weight of each digit position
Inverse Stochastic Linear Programming
2007-01-05T23:59:59.000Z
Pittsburgh, PA USA 15261. Lewis Ntaimo ... College Station, TX USA 77843. Abstract. Inverse ..... investments in the electricity generation industry. The instances ...
Linear Programming brewer's problem
Sedgewick, Robert
: Brewer's problem Small brewery produces ale and beer. · Production limited by scarce resources: corn, hops, barley malt. · Recipes for ale and beer require different proportions of resources. Brewer 160 1190 ale (1 barrel) 5 4 35 13 beer (1 barrel) 15 4 20 23 all ale (34 barrels) 179 136 1190 442 all
Representation of Universal Algebra
Aleks Kleyn
2015-02-07T23:59:59.000Z
Theory of representations of universal algebra is a natural development of the theory of universal algebra. Morphism of the representation is the map that conserve the structure of the representation. Exploring of morphisms of the representation leads to the concepts of generating set and basis of representation. In the book I considered the notion of tower of representations of $F_i$-algebras, i=1 ..., n, as the set of coordinated representations of $F_i$-algebras.
Robust Linearization of RF Amplifiers Using NonLinear Internal Model Control Method
Paris-Sud XI, Université de
Robust Linearization of RF Amplifiers Using NonLinear Internal Model Control Method Smail Bachir #1, the nonlinear Internal Model Control (IMC) method is introduced and applied to linearize high frequency Power to be controlled [8]. If the model is a perfect representation of the non linear system, the controller can
A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN ...
2011-11-24T23:59:59.000Z
said to be linearizable if there exists an instance of the linear assignment problem (LAP) .... quadratic programming formulation to a integer linear programming ...
Quantum Control and Representation Theory
A. Ibort; J. M. Pérez-Pardo
2012-03-11T23:59:59.000Z
A new notion of controllability for quantum systems that takes advantage of the linear superposition of quantum states is introduced. We call such notion von Neumann controllabilty and it is shown that it is strictly weaker than the usual notion of pure state and operator controlability. We provide a simple and effective characterization of it by using tools from the theory of unitary representations of Lie groups. In this sense we are able to approach the problem of control of quantum states from a new perspective, that of the theory of unitary representations of Lie groups. A few examples of physical interest and the particular instances of compact and nilpotent dynamical Lie groups are discussed.
Using Compact Data Representations for Languages Based on Catamorphisms
Fegaras, Leonidas
Using Compact Data Representations for Languages Based on Catamorphisms OGI, Techreport #95 on using a compact vector representation for the recursive structure over which the catamorphism operates program performance, in particular by performing program fusion [13, 3, 7, 1]. In this paper, we explore
Jr, Peter Chien; Rosenman, Karla; Cheung, Wang; Wang, Nadia; Sanchez, Miguel
2009-01-01T23:59:59.000Z
type 1/type 2 mosaic of psoriasis? Dermatology 2006; 212:Magalhaes RF, et al. Linear psoriasis in Brazilian childrensuffering from linear psoriasis along lines of Blaschko. Br
On the Adequacy of Program Dependence Graphs for Representing Programs
Reps, Thomas W.
introduced by Kuck as an intermediate program representation well suited for performing optimizations are strongly equivalent. 1. Introduction Program dependence graphs were introduced by Kuck as an intermediate
The International Linear Collider
Jim Brau; Paul Grannis; Mike Harrison; Michael Peskin; Marc Ross; Harry Weerts
2013-04-09T23:59:59.000Z
We present a brief summary of the International Linear Collider as documented in the 2013 Technical Design Report. The Technical Design Report has detailed descriptions of the accelerator baseline design for a 500 GeV e+e- linear collider, the R&D program that has demonstrated its feasibility, the physics goals and expected sensitivities, and the description of the ILD and SiD detectors and their capabilities.
Linear Dependence and Linear Independence
PRETEX (Halifax NS) #1 1054 1999 Mar 05 10:59:16
2010-02-12T23:59:59.000Z
Feb 16, 2007 ... Observe that the vector (1, 2) is already a linear combination of (1, 0) and (0, 1), and therefore it does not add any new vectors to the linear span ...
Optimization Online - Integer Programming Submissions - 2013
Integer Programming Submissions - 2013. January 2013. (Mixed) Integer Linear Programming On the Augmented Lagrangian Dual for Integer Programming
Parallel solution of linear programs
Smith, Edmund
2013-11-28T23:59:59.000Z
The factors limiting the performance of computer software periodically undergo sudden shifts, resulting from technological progress, and these shifts can have profound implications for the design of high performance codes. ...
MIXED INTEGER LINEAR PROGRAMMING FORMULATION ...
2014-07-22T23:59:59.000Z
Jul 22, 2014 ... to Sommer. [148]. The following proposition from [74, 6] shows how to use (9.3) to construct formu- lations for simple disjunctive constraints.
Stripping Coupons with Linear Programming
Allen, David E; Thomas, Lyn C; Zheng, Harry
2000-01-01T23:59:59.000Z
When using market prices to fit the parameters of models for the price of bonds, the first step is to strip the market bonds of their coupons. The standard bootstrapping technique of stripping coupons can cause mispricing ...
EXTENSIONS OF GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS
Katz, Richard
weather) -- Software R open source statistical programming language: Function glm "Family;(2) Generalized Linear Models Statistical Framework -- Multiple Regression Analysis (Linear model or LM) Response
A polynomial algorithm for linear optimization which is strongly ...
2015-01-31T23:59:59.000Z
In this paper we present a new polynomial algorithm for linear programming. ... linear optimization problems having 0-1 optimal solutions (e.g., the assignment.
Dantzig, G.B.
1992-10-01T23:59:59.000Z
Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b{sup 0}. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides {cflx b}{sup i}, then redirected in turn to the next {cflx b}{sup i}. Once within the neighborhood of each {cflx b}{sup i}, a weighted sum of the approximate solutions. {bar x}{sup i} yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance {parallel}b - b{sup 0}{parallel}{sub 2} {le} r. The feasible solution is found in less than 4(m+ 1){sup 3}/r{sup 2} iterations. The work per iteration is {delta}mn + 2m + n + 9 multiplications plus {delta}mn + m + n + 9 additions or comparisons where {delta} is the density of nonzero coeffients in the matrix.
Dantzig, G.B.
1992-10-01T23:59:59.000Z
Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b[sup 0]. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides [cflx b][sup i], then redirected in turn to the next [cflx b][sup i]. Once within the neighborhood of each [cflx b][sup i], a weighted sum of the approximate solutions. [bar x][sup i] yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance [parallel]b - b[sup 0][parallel][sub 2] [le] r. The feasible solution is found in less than 4(m+ 1)[sup 3]/r[sup 2] iterations. The work per iteration is [delta]mn + 2m + n + 9 multiplications plus [delta]mn + m + n + 9 additions or comparisons where [delta] is the density of nonzero coeffients in the matrix.
GENERALIZED DUAL FACE ALGORITHM FOR LINEAR ...
2014-10-02T23:59:59.000Z
1991 Mathematics Subject Classification. Primary 90C05; Secondary 65K05. Key words and phrases. linear programming, dual level face, dual optimal face .
Optimization Online - Equivalence of an Approximate Linear ...
Alejandro Toriello
2013-02-07T23:59:59.000Z
Feb 7, 2013 ... Equivalence of an Approximate Linear Programming Bound with the Held-Karp Bound for the Traveling Salesman Problem. Alejandro Toriello ...
A note on Burer's copositive representation of mixed-binary QPs
2009-09-27T23:59:59.000Z
into copositive programs where a linear functional is minimized over a linearly constrained subset of the cone of completely positive ma- trices. In this note we ...
Davis, Ernest
Problem 3 This problem has to do with the programming assignment on Electric Charges in this repository think through this programming assignment before doing this problem, and since thinking through the programming assignment is practically equivalent to doing it, it is prob- ably a good idea to complete
Gajic, Zoran
students interested in linear dynamic systems and signals---especially biomedical, aerospace, mechanical processing courses. In addition, many problems in wireless communications, networking, signal processing senior level courses in wireless communications, networking, photonics, and signal processing, some
Gajic, Zoran
students interested in linear dynamic systems and signals--especially biomedical, aerospace, mechanical processing courses. In addition, many problems in wireless communications, networking, signal processing senior level courses in wireless communications, networking, photonics, and signal processing, some
Optimization Online - Efficient First-Order Methods for Linear ...
James Renegar
2014-09-27T23:59:59.000Z
Sep 27, 2014 ... Efficient First-Order Methods for Linear Programming and Semidefinite Programming. James Renegar (renegar ***at*** cornell.edu). Abstract: ...
Lectures on Linear Algebra over Division Ring
Aleks Kleyn
2014-10-11T23:59:59.000Z
In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a new picture. Matrices allow two products linked by transpose. Biring is algebra which defines on the set two correlated structures of the ring. As in the commutative case, solutions of a system of linear equations build up right or left vector space depending on type of system. We study vector spaces together with the system of linear equations because their properties have a close relationship. As in a commutative case, the group of automorphisms of a vector space has a single transitive representation on a frame manifold. This gives us an opportunity to introduce passive and active representations. Studying a vector space over a division ring uncovers new details in the relationship between passive and active transformations, makes this picture clearer. Considering of twin representations of division ring in Abelian group leads to the concept of D vector space and their linear map. Based on polyadditive map I considered definition of tensor product of rings and tensor product of D vector spaces.
Geometry, noncommutative algebra and representations
Gordon, Iain
and Deformations 4 Representation Theory 2 Iain Gordon Geometry, noncommutative algebra and representations: analysis, algebra, geometry, number theory (to name four!) 4 Iain Gordon Geometry, noncommutative algebra is a finite field. 6 Iain Gordon Geometry, noncommutative algebra and representations Geometry and Commutative
Optimization Online - Integer Programming Submissions - 2011
Integer Programming Submissions - 2011. January 2011. (Mixed) Integer Linear Programming A Computational Study of Finitely Convergent Polyhedral ...
Exploiting group symmetry in semidefinite programming relaxations ...
Etienne De Klerk
2007-06-13T23:59:59.000Z
Jun 13, 2007 ... QAPLIB - a quadratic assignment problem library. ... Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming ).
Optimization Online - Improved semidefinite programming bounds ...
Etienne de Klerk
2009-09-17T23:59:59.000Z
Sep 17, 2009 ... ... programming bounds for quadratic assignment problems with suitable symmetry ... Category 1: Linear, Cone and Semidefinite Programming.
Miller, Naomi J.; Perrin, Tess E.; Royer, Michael P.; Wilkerson, Andrea M.; Beeson, Tracy A.
2014-05-20T23:59:59.000Z
Although lensed troffers are numerous, there are many other types of optical systems as well. This report looked at the performance of three linear (T8) LED lamps chosen primarily based on their luminous intensity distributions (narrow, medium, and wide beam angles) as well as a benchmark fluorescent lamp in five different troffer types. Also included are the results of a subjective evaluation. Results show that linear (T8) LED lamps can improve luminaire efficiency in K12-lensed and parabolic-louvered troffers, effect little change in volumetric and high-performance diffuse-lensed type luminaires, but reduce efficiency in recessed indirect troffers. These changes can be accompanied by visual appearance and visual comfort consequences, especially when LED lamps with clear lenses and narrow distributions are installed. Linear (T8) LED lamps with diffuse apertures exhibited wider beam angles, performed more similarly to fluorescent lamps, and received better ratings from observers. Guidance is provided on which luminaires are the best candidates for retrofitting with linear (T8) LED lamps.
The International Linear Collider
Marco Battaglia
2007-05-28T23:59:59.000Z
The International Linear Collider (ILC) is the next large scale project in accelerator particle physics. Colliding electrons with positrons at energies from 0.3 TeV up to about 1 TeV, the ILC is expected to provide the accuracy needed to complement the LHC data and extend the sensitivity to new phenomena at the high energy frontier and answer some of the fundamental questions in particle physics and in its relation to Cosmology. This paper reviews some highlights of the ILC physics program and some of the major challenges for the accelerator and detector design.
Active-set methods for quadratic programming
Wong, Elizabeth Lai Sum
2011-01-01T23:59:59.000Z
Quadratic Programming . . . . . . . . . . . . . . . . . . .QP Dual Quadratic Programming . . . . . . . . 4.14.2.1 Dual linear programming . . . 4.2.2 Degeneracy of the
Positrons for linear colliders
Ecklund, S.
1987-11-01T23:59:59.000Z
The requirements of a positron source for a linear collider are briefly reviewed, followed by methods of positron production and production of photons by electromagnetic cascade showers. Cross sections for the electromagnetic cascade shower processes of positron-electron pair production and Compton scattering are compared. A program used for Monte Carlo analysis of electromagnetic cascades is briefly discussed, and positron distributions obtained from several runs of the program are discussed. Photons from synchrotron radiation and from channeling are also mentioned briefly, as well as positron collection, transverse focusing techniques, and longitudinal capture. Computer ray tracing is then briefly discussed, followed by space-charge effects and thermal heating and stress due to showers. (LEW)
STANFORD LINEAR ACCELERATOR CENTER DIRECTOR'S OFFICE
Wechsler, Risa H.
of these offices not listed here. PART 1: RESEARCH & DEVELOPMENT PROGRAM MANAGEMENT RECORDS R&D Program Management records document the basis for research and development program management decisions, direction, policiesSTANFORD LINEAR ACCELERATOR CENTER DIRECTOR'S OFFICE RECORDS CONTROL SCHEDULE SCOPE: This schedule
Jacques Carolan; Chris Harrold; Chris Sparrow; Enrique Martín-López; Nicholas J. Russell; Joshua W. Silverstone; Peter J. Shadbolt; Nobuyuki Matsuda; Manabu Oguma; Mikitaka Itoh; Graham D. Marshall; Mark G. Thompson; Jonathan C. F. Matthews; Toshikazu Hashimoto; Jeremy L. O'Brien; Anthony Laing
2015-05-05T23:59:59.000Z
Linear optics underpins tests of fundamental quantum mechanics and computer science, as well as quantum technologies. Here we experimentally demonstrate the longstanding goal of a single reprogrammable optical circuit that is sufficient to implement all possible linear optical protocols up to the size of that circuit. Our six-mode universal system consists of a cascade of 15 Mach-Zehnder interferometers with 30 thermo-optic phase shifters integrated into a single photonic chip that is electrically and optically interfaced for arbitrary setting of all phase shifters, input of up to six photons and their measurement with a 12 single-photon detector system. We programmed this system to implement heralded quantum logic and entangling gates, boson sampling with verification tests, and six-dimensional complex Hadamards. We implemented 100 Haar random unitaries with average fidelity 0.999 $\\pm$ 0.001. Our system is capable of switching between these and any other linear optical protocol in seconds. These results point the way to applications across fundamental science and quantum technologies.
Symbolic Representation of Neural Networks
Liu, Huan
Draft Symbolic Representation of Neural Networks Rudy Setiono and Huan Liu Department,liuhg@iscs.nus.sg Abstract Although backpropagation neural networks generally predict better than decision trees do is needed by human experts. This work drives a sym bolic representation for neural networks to make
Equivalence in Knowledge Representation: Automata, Recurrent Neural Networks,
Giles, C. Lee
Equivalence in Knowledge Representation: Automata, Recurrent Neural Networks, and Dynamical Fuzzy finite state automata (DFA) can be synthesized by or mapped into recurrent neural networks by directly programming the DFA structure into the weights of the neural network. Based on those results, a synthesis
Panigrahi, Swapnesh; Alouini, Mehdi
2015-01-01T23:59:59.000Z
We present a contrast-maximizing optimal linear representation of polarimetric images obtained from a snapshot polarimetric camera for enhanced vision of a polarized light source in obscured weather conditions (fog, haze, cloud) over long distances (above 1 km). We quantitatively compare the gain in contrast obtained by different linear representations of the experimental polarimetric images taken during rapidly varying foggy conditions. It is shown that the adaptive image representation that depends on the correlation in background noise fluctuations in the two polarimetric images provides an optimal contrast enhancement over all weather conditions as opposed to a simple difference image which underperforms during low visibility conditions. Finally, we derive the analytic expression of the gain in contrast obtained with this optimal representation and show that the experimental results are in agreement with the assumed correlated Gaussian noise model.
on an efficient implementation of the face algorithm for linear ...
Ping-Qi Pan
2015-04-27T23:59:59.000Z
Apr 27, 2015 ... ``ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING''. Ping-Qi Pan(panpq ***at*** seu.edu.cn).
Generating All Efficient Extreme Points in Multiple Objective Linear ...
2007-06-21T23:59:59.000Z
for generating all efficient extreme points and all efficient extreme rays of a multiple objective linear programming problem (V P). As an application we solve the ...
Outcome-Space Outer Approximation Algorithm for Linear ...
2007-07-20T23:59:59.000Z
Jul 20, 2007 ... Primary: 90 C29; Secondary: 90 C26. Key words. Linear multiplicative programming, global optimization problem, efficient point, outcome set.
Quantum Field Theory and Representation Theory
Woit, Peter
Quantum Field Theory and Representation Theory Peter Woit woit@math.columbia.edu Department of Mathematics Columbia University Quantum Field Theory and Representation Theory p.1 #12;Outline of the talk · Quantum Mechanics and Representation Theory: Some History Quantum Field Theory and Representation Theory
T. T. Moh
2015-01-20T23:59:59.000Z
goal of this course is to enable you to recognize linear algebra problems ... descriptions of other people's solutions to problems that use linear algebra and to
Young's natural representation of the symmetric groups of degree less than six
Swardstrom, Paul David
1967-01-01T23:59:59.000Z
matrices corresponding to the linear transformations in the image of D. It follows that T is a matrix representation of G called the matrix representation afforded by D. Definition 1. 2, The degree of a representation is the dimen- sion n...', . . . , n'] if n, &n', for the first distinct pair l. 1. (n&, ni) of elements from the two partitions. ~3*125. 7h f pl g'gt thd't' tp t of 3 are: EP Definition 2. 6. A Young tableau is a frame which has been filled in with the integers from 1 up to n...
Symmetries in Integer Programs
Bödi, R
2009-01-01T23:59:59.000Z
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show that any integer program on n variables having an alternating group A_n as a group of symmetries can be solved in linear time in the number of variables.
Evolution Operators for Linearly Polarized Two-Killing Cosmological Models
J. Fernando Barbero G.; Daniel Gómez Vergel; Eduardo J. S. Villaseńor
2006-06-15T23:59:59.000Z
We give a general procedure to obtain non perturbative evolution operators in closed form for quantized linearly polarized two Killing vector reductions of general relativity with a cosmological interpretation. We study the representation of these operators in Fock spaces and discuss in detail the conditions leading to unitary evolutions.
A computer program for linear models
Zerbe, Manfred Rudolf
1966-01-01T23:59:59.000Z
M tel II} UJ ct 4 I-X ZORIL 0 0 Z 0 8o II UJ 2 OI 0 U. 0 X Z 4} Il } UI } X 4 X 2 IA III 0 ~ X I 4} c CLI UJ ct 0 X I-0 ttSON N 4. \\9 ~ IA 0 0 2 J J + N U 0 N 0 0 I- UJ UJ 0 D N 4 Z U. 0 U K Z Y 8 UJ X 0& ct r... 9 18 3 19 12 3 12 21 -4 -13. 3 -133. 0 albi aib2 a2bi -4 14 9 14 96. 0 35. 5 99. 7 a2b2 8 15 91. 6 73 IG IO M ID 'll 'P M f33 M LI3 M N M M ft3 tt3 N N ? N Yl N CII 0 I Iff N I33 0 Q ICI 0 0 Lt3 0 O 0 0 0 0 0 0 ICI 0 O M 0 M 0 0 0...
Iterative Estimation Maximization for Stochastic Linear Programs ...
2009-03-26T23:59:59.000Z
Pu Huang. IBM T.J.Watson Research Center ... samples, which makes it extreme efficient for real-world, large-scale problems. ... problem using an S&P 500 data set. ..... 1 Consumer Discretionary. 80. 2 Consumer Staples. 41. 3 Energy. 39.
Limitations of Linear and Semidefinite Programs
Schoenebeck, Grant Robert
2010-01-01T23:59:59.000Z
2006. [29] Madhur Tulsiani. CSP gaps and reductions in thecannot prove that a random k-CSP over any predicate impliedi j ? } k }) The language k-CSP-P consists of satis?able k-
SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...
2012-08-20T23:59:59.000Z
stochastic uncertainty in engineering, transportation, finance and energy. ...... Energy. Springer, New York, 2011. [4] J. Cotter and K. Dowd. Extreme spectral risk ...
Optimization Online - Decomposition theorems for linear programs
Jean-Bertrand Gauthier
2014-10-08T23:59:59.000Z
Oct 8, 2014 ... While it is the crucial component of the analysis, the heart of the algorithm is the residual network upon which are derived two theorems that ...
SA305: Linear Programming Spring 2013
Phillips, David
to Optimization Modeling Example 1. (Example 1.1 on page 5 in the book) Farmer Jones decides to supplement his income by baking and selling two types of cakes, chocolate and vanilla. Each chocolate cake sold gives to maximize Farmer Jones' profit? Problem definition and Data Gathering What are we trying to solve? Creating
Optimal portfolios using Linear Programming models
Cpu
2002-10-17T23:59:59.000Z
Feb 12, 2003 ... The problem. The portfolio manager Sigma wants to construct an optimal portfolio for a customer. .... It is easy to show that it is also possible ...
Polynomial Approximations for Continuous Linear Programs
2012-04-05T23:59:59.000Z
Imperial College of Science, Technology, and Medicine. 180 Queen's Gate, London SW7 2BZ, UK ...... for the air cargo industry. Working paper, Carnegie Mellon ...
A computer program for linear models
Zerbe, Manfred Rudolf
1966-01-01T23:59:59.000Z
whe re: (X'X) ! s the sum of squares and crossproducts ~atrix of the X matrix. (X'Y);s the sum of crossprcducts matrix of the x's with Y. I2 C is (X'X) It should be noted that (X'X), hence (X'X) , is a symmetric matrix and is in many practical.... Courant, Differential and Inte ral Calculus &New York: Interscience Publishers, Inc. , I%61) p. 2 18 12 2 22 3 13 4 n(n+I} n(n+I) nn It is possible to obtain the subscript of an element in the X array given the subscripts of the element of the A...
Terminologies Trivial extensions and representations
Iyama, Osamu
. For an artin algebra A over a commutative artinian ring C, D := HomC (-, E0 C (top C)), A = DTrA, -1 A = Tr of Algebra at University of Tsukuba The view from the old seminar at Univesity of Tsukuba Jun-ichi Miyachi November 14, 2013, Nagoya Jun-ichi Miyachi Researches on the Representation Theory of Algebra at Univers
On semidefinite programming bounds for graph bandwidth
Etienne De Klerk
2011-06-06T23:59:59.000Z
Jun 6, 2011 ... Keywords: Graph bandwidth, cyclic bandwidth, semidefinite programming, quadratic assignment problem. Category 1: Linear, Cone and ...
Representation of Limited Rights Data and Restricted Computer...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Representation of Limited Rights Data and Restricted Computer Software Representation of Limited Rights Data and Restricted Computer Software Representation of Limited Rights Data...
Using Enhanced Spherical Images for Object Representation
Smith, David A.
1979-05-01T23:59:59.000Z
The processes involved in vision, manipulation, and spatial reasoning depend greatly on the particular representation of three-dimensional objects used. A novel representation, based on concepts of differential geometry, ...
The Microscopic Linear Dynamics
Penny, Will
The Microscopic Brain Will Penny Linear Dynamics Exponentials Matrix Exponential Eigendecomposition Dynamical Modes Nodes State Space Saddles Oscillations Spirals Centres Offsets Retinal Circuit Nullclines Stability Spiking Neurons Fitzhugh-Nagumo Nonlinear Dynamics Linearization Nonlinear Oscillation Excitable
Zeghib, Abdelghani
Introduction Results Linear Dynamics Lorentz Dynamics Actions of discrete groups on stationary Piccione) Geodeycos Meeting, Lyon, 28-30 April 2010 Abdelghani Zeghib Dynamics on Lorentz manifolds #12;Introduction Results Linear Dynamics Lorentz Dynamics Motivations and questions Examples 1 Introduction
Generalized Linear Quadratic Control
Gattami, Ather Said
We consider the problem of stochastic finite- and infinite-horizon linear quadratic control under power constraints. The calculations of the optimal control law can be done off-line as in the classical linear quadratic ...
Mixtures of Predictive Linear Gaussian Models for Nonlinear Stochastic Dynamical Systems
Baveja, Satinder Singh
Mixtures of Predictive Linear Gaussian Models for Nonlinear Stochastic Dynamical Systems David dynamical systems. The primary contribution of this work is to extend the PLG to nonlinear, stochastic- proves upon traditional linear dynamical system mod- els by using a predictive representation of state
Introduction to Linear Relaxations
Introduction to Linear Relaxations by R. Baker Kearfott Department of Mathematics University relaxations; . discuss validation of linear relaxations. Intro. Linear Relaxations December, 2003 Taylor, . . . , m 2 , where # : R n # R and c i , g i : R n # R are guaranteed to be within one of the x # that has
Atomic Representations of Rank 2 Graph Algebras
Davidson, Ken
Atomic Representations of Rank 2 Graph Algebras Kenneth R. Davidson a , Stephen C. Power b , Dilian University, Lancaster LA1 4YF, U.K. Abstract We provide a detailed analysis of atomic -representations- posed into a direct sum or direct integral of irreducible atomic representations. The building blocks
IAI : Knowledge Representation John A. Bullinaria, 2005
Bullinaria, John
is a Knowledge Representation? 3. Requirements of a Knowledge Representation 4. Practical Aspects of Good5-5 Practical Aspects of Good Representations In practice, the theoretical requirements for good Dictionary provides as good a definition as any: knowledge, nolij, n. assured belief; that which is known
Context Representation for Web Search Results
Baeza-Yates, Ricardo
Context Representation for Web Search Results Jesús Vegas Department of Computer Science U. Valladolid Context Representation for Web Search Results 2 Outline Intro Web search results in the web site and Future work #12;Context Representation for Web Search Results 3 Introduction Searching the web is one
Photon Linear Collider Gamma-Gamma Summary
Gronberg, J
2012-02-27T23:59:59.000Z
High energy photon - photon collisions can be achieved by adding high average power short-pulse lasers to the Linear Collider, enabling an expanded physics program for the facility. The technology required to realize a photon linear collider continues to mature. Compton back-scattering technology is being developed around the world for low energy light source applications and high average power lasers are being developed for Inertial Confinement Fusion.
Beer powered bicycle: narrative ethnography and print representations of punk/hardcore culture
Stanbro, Stephanie M
2013-02-22T23:59:59.000Z
BEER POWERED BICYCLE: NARRATIVE ETHNOGRAPHY AND PRINT REPRESENTATIONS OF PUNK/HARDCORE CULTURE A Senior Honors Thesis By Stephanie M, Stanbro Submitted to the Office of Honors Programs & Academic Scholarships Texas ARM University In partial... fulfillment of the requirements of the UNIVERSITY UNDERGRADUATE RESEARCH FELLOWS April 2000 Group: Cultural Studies BEER POWERED BICYCLE: NARRATIVE ETHNOGRAPHY AND PRINT REPRESENTATIONS OF PUNK/HARDCORE CULTURE A Senior Honors Thesis By Stephanie M...
Linear accelerator for radioisotope production
Hansborough, L.D.; Hamm, R.W.; Stovall, J.E.
1982-02-01T23:59:59.000Z
A 200- to 500-..mu..A source of 70- to 90-MeV protons would be a valuable asset to the nuclear medicine program. A linear accelerator (linac) can achieve this performance, and it can be extended to even higher energies and currents. Variable energy and current options are available. A 70-MeV linac is described, based on recent innovations in linear accelerator technology; it would be 27.3 m long and cost approx. $6 million. By operating the radio-frequency (rf) power system at a level necessary to produce a 500-..mu..A beam current, the cost of power deposited in the radioisotope-production target is comparable with existing cyclotrons. If the rf-power system is operated at full power, the same accelerator is capable of producing an 1140-..mu..A beam, and the cost per beam watt on the target is less than half that of comparable cyclotrons.
LED Linear Lamps and Troffer Lighting
Broader source: Energy.gov [DOE]
The CALiPER program performed a series of investigations on linear LED lamps. Each report in the series covers the performance of up to 31 linear LED lamps, which were purchased in late 2012 or 2013. The first report focuses on bare lamp performance of LED T8 replacement lamps and subsequent reports examine performance in various troffers, as well as cost-effectiveness. There is also a concise guidance document that describes the findings of the Series 21 studies and provides practical advice to manufacturers, specifiers, and consumers (Report 21.4: Summary of Linear (T8) LED Lamp Testing , 5 pages, June 2014).
PRODUCT REPRESENTATION IN LIGHTWEIGHT FORMATS FOR PRODUCT LIFECYCLE MANAGEMENT (PLM)
Rzepa, Henry S.
PRODUCT REPRESENTATION IN LIGHTWEIGHT FORMATS FOR PRODUCT LIFECYCLE MANAGEMENT (PLM) Lian Ding representation, markup method, Representation Information Registry/Repository, PLM, CAD model 1. INTRODUCTION. This paper gives a survey of the lightweight representations employed in product lifecycle management (PLM
Temporal Representation in Semantic Graphs
Levandoski, J J; Abdulla, G M
2007-08-07T23:59:59.000Z
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Zornberg, Jorge G.
1391 1 INTRODUCTION An application of the finite element method (FEM) for non-linear elastoplastic, 2003; Oliveira, 2006). 2 FINITE ELEMENT REPRESENTATION OF REINFORCED SOIL A discrete representation, the reinforcement and the soil-reinforcement interface-- can be represented using a specific finite element with its
Infinite-Dimensional Representations of 2-Groups
John C. Baez; Aristide Baratin; Laurent Freidel; Derek K. Wise
2011-02-09T23:59:59.000Z
A "2-group" is a category equipped with a multiplication satisfying laws like those of a group. Just as groups have representations on vector spaces, 2-groups have representations on "2-vector spaces", which are categories analogous to vector spaces. Unfortunately, Lie 2-groups typically have few representations on the finite-dimensional 2-vector spaces introduced by Kapranov and Voevodsky. For this reason, Crane, Sheppeard and Yetter introduced certain infinite-dimensional 2-vector spaces called "measurable categories" (since they are closely related to measurable fields of Hilbert spaces), and used these to study infinite-dimensional representations of certain Lie 2-groups. Here we continue this work. We begin with a detailed study of measurable categories. Then we give a geometrical description of the measurable representations, intertwiners and 2-intertwiners for any skeletal measurable 2-group. We study tensor products and direct sums for representations, and various concepts of subrepresentation. We describe direct sums of intertwiners, and sub-intertwiners - features not seen in ordinary group representation theory. We study irreducible and indecomposable representations and intertwiners. We also study "irretractable" representations - another feature not seen in ordinary group representation theory. Finally, we argue that measurable categories equipped with some extra structure deserve to be considered "separable 2-Hilbert spaces", and compare this idea to a tentative definition of 2-Hilbert spaces as representation categories of commutative von Neumann algebras.
Demmel, James; Holtz, Olga; Dumitriu, Ioana
2007-01-01T23:59:59.000Z
than other basic linear algebra subroutines. AcknowledgmentsApplied Numerical Linear Algebra. SIAM, 1997. [23] J.algorithms in numerical linear algebra. SIAM Review, 20:740–
Fault tolerant linear actuator
Tesar, Delbert
2004-09-14T23:59:59.000Z
In varying embodiments, the fault tolerant linear actuator of the present invention is a new and improved linear actuator with fault tolerance and positional control that may incorporate velocity summing, force summing, or a combination of the two. In one embodiment, the invention offers a velocity summing arrangement with a differential gear between two prime movers driving a cage, which then drives a linear spindle screw transmission. Other embodiments feature two prime movers driving separate linear spindle screw transmissions, one internal and one external, in a totally concentric and compact integrated module.
Solving Real-World Linear Ordering Problems Using a Primal-Dual Interior Point Cutting Plane Method
Borchers, Brian
Solving Real-World Linear Ordering Problems Using a Primal-Dual Interior Point Cutting Plane Method to the next. A cutting plane algorithm for solving the linear ordering problem is described. This algorithm problems with linear programming methodology use the simplex method to solve the linear programs
Using Linearity Web Copyright 2007
Rodriguez, Carlos
Using Linearity Web Rev. 2.0 May 2007 Copyright © 2007 #12;Using Linearity Web i Contents Introduction to Linearity Web.............................................................................1 Features, Benefits, and Value of Linearity Web..............................................1 Before You
W. B. Vasantha Kandasamy; Florentin Smarandache
2008-07-18T23:59:59.000Z
In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). This book expects the readers to be well-versed in linear algebra. Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The authors feel that such a paradigm shift is essential in this computerized world. Some other structures ought to replace linear algebras which are over a century old. Super linear algebras that use super matrices can store data not only in a block but in multiple blocks so it is certainly more powerful than the usual matrices. This book has 3 chapters. Chapter one introduces the notion of super vector spaces and enumerates a number of properties. Chapter two defines the notion of super linear algebra, super inner product spaces and super bilinear forms. Several interesting properties are derived. The main application of these new structures in Markov chains and Leontief economic models are also given in this chapter. The final chapter suggests 161 problems mainly to make the reader understand this new concept and apply them.
MATHEMATICAL PROGRAMMING MODELS FOR ENVIRONMENTAL QUALITY CONTROL
Greenberg, Harvey J.
was a linear programming model for wastewater treatment plant design. Mathematical pro- gramming models an equivalent mathematical program or use mathematical programming to compute a fixed point. A primary goal
KNOWMESH --Meshless geometry with knowledge representation
Franklin, W. Randolph
(aka path, motion) planning · Drainage analysis Commercial product's inconsistent layer representation setup Closeup of tank Dense grid of scanner points · model with homogeneous lifts
ON AUTOMORPHY OF CERTAIN GALOIS REPRESENTATIONS OF ...
2015-02-09T23:59:59.000Z
22. 1991 Mathematics Subject Classification. Primary 14F30,14L05. Key words and phrases. Galois representations, automorphy. This materials is based upon ...
Knowledge and Skill Representations for Robotized Production
Malec, Jacek
: Model-based control, Knowledge representation, System architectures, Autonomous control, Industrial robots 1. INTRODUCTION Model-based systems in control are a means to utilize effi- ciently human
dos Santos, Pedro G.
2012-12-31T23:59:59.000Z
This dissertation provides insights on what influences women's descriptive representation in state legislatures in Brazil. The study of female representation in Brazil provides for a good case study as the country uses a gender quota system...
E-model for Transportation Problem of Linear Stochastic Fractional ...
Dr.V.Charles
2007-03-07T23:59:59.000Z
Abstract: This paper deals with the so-called transportation problem of linear stochastic fractional programming, and ... sophisticated analysis. Stochastic ... circuit board of multi-objective LSFP, algorithm to identify redundant fractional objective ...
Linearly parameterized bandits
Tsitsiklis, John N.
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vector Z ? ?(superscript r), where r ? 2. The ...
Linear Motor Powered Transportation
Thornton, Richard D.
This special issue on linear-motor powered transportation covers both supporting technologies and innovative transport systems in various parts of the World, as this technology moves from the lab to commercial operations. ...
Topics in Representation Theory: The Heisenberg Algebra
Woit, Peter
Topics in Representation Theory: The Heisenberg Algebra We'll now turn to a topic which is a precise analog of the previous discussion of the Clifford algebra and spinor representations. By replacing a new algebra, the Heisenberg algebra. The group of automor- phism of this algebra is now a symplectic
Representations of Petri net interactions Pawel Sobocinski
Sobocinski, Pawel
Representations of Petri net interactions Pawel SobociÂ´nski ECS, University of Southampton, UK Abstract. We introduce a novel compositional algebra of Petri nets, as well as a stateful extension In part owing to their intuitive graphical representation, Petri nets [28] are of- ten used both
N-representability is QMA-complete
Y. -K. Liu; M. Christandl; F. Verstraete
2006-09-17T23:59:59.000Z
We study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is QMA-complete, which is the quantum generalization of NP-complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N-representability.
Knowledge representation in process engineering Ulrike Sattler
Baader, Franz
Knowledge representation in process engineering Ulrike Sattler RWTH Aachen, uli, the tasks we are concerned with in process engineering are described as well as how knowledge representation@cantor.informatik.rwthaachen.de Abstract Process engineering is surely no pure con figuration application, but modeling the structure
Rational Univariate Representation 1 Stickelberger's Theorem
Verschelde, Jan
(RUR) 2 The Elbow Manipulator a spatial robot arm with three links 3 Application of the Newton a rational univariate representation (RUR) 2 The Elbow Manipulator a spatial robot arm with three links 3 a rational univariate representation (RUR) 2 The Elbow Manipulator a spatial robot arm with three links 3
Free Oscillations of a Linear Oscillator Eugene Butikov
Butikov, Eugene
of a Linear Torsion Oscillator The linear oscillator simulated in this computer program is a balanced flywheel whose center of mass lies on the axis of rotation. Such a flywheel may consist, for example, of a rod that passes through its center. A spiral spring with one end fixed and the other attached to the flywheel
Optimization Online - A novel integer programming formulation for ...
Elder M. Macambira
2005-10-28T23:59:59.000Z
Oct 28, 2005 ... ... programming formulation for the K-SONET ring assignment problem ... a novel and compact 0-1 integer linear programming formulation for ...
Optimization Online - Linear-quadratic control problem with a linear ...
L Faybusovich
2003-12-19T23:59:59.000Z
Dec 19, 2003 ... Abstract: We describe a complete solution of the linear-quaratic control problem with the linear term in the objective function on a semiinfinite ...
Gentner, Timothy
auditory forebrain neurons Daniel P. Knudsen1 and Timothy Q. Gentner1,2,3 1 Neurosciences Graduate Program enhances the representation of behaviorally relevant information in single auditory forebrain neurons. J Neurophysiol 109: 16901703, 2013. First pub- lished January 9, 2013; doi:10.1152/jn.00461.2012.--Sensory sys
August 2000 ((Mixed) Integer Nonlinear Programming ) Sven Leyffer ...
((Mixed) Integer Linear Programming ) ... Facets of The Cardinality Constrained Circuit Polytope ..... Analysis of MILP Techniques for the Pooling Problem
6, 74277469, 2006 Linear ozone
Boyer, Edmond
ACPD 6, 74277469, 2006 Linear ozone photochemistry parametrizations A. J. Geer et al. Title Page Chemistry and Physics Discussions Evaluation of linear ozone photochemistry parametrizations Linear ozone photochemistry parametrizations A. J. Geer et al. Title Page Abstract Introduction
4Q CY2001 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from October to December 2001. Data for these indicators are gathered by the Field...
3Q CY2001 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from July to September 2001. Data for these indicators are gathered by the Field...
2Q CY2002 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from April to June 2002. Data for these indicators are gathered by the Field...
3Q CY2002 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from July to September 2002. Data for these indicators are gathered by the Field...
1Q CY2001 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from January to March 2001. Data for these indicators are gathered by the Field...
Linear Algebra: Ideas and Applications
Linear Algebra: Ideas and Applications. [photo]. Welcome to the web page for Linear Algebra: Idaes and Applications by Richard Penney. This web site is ...
Non-smooth brownian martingales and stochastic integral representations
Wroblewski, David M.
2007-01-01T23:59:59.000Z
and M. Yor. On stochastic integral representations ofmotion by stochas- tic integrals. Ann. Math. Statist. , 41:Martingales and Stochastic Integral Representations A
Notes on the Self-Reducibility of the Weil Representation and Higher-Dimensional Quantum Chaos
Shamgar Gurevich; Ronny Hadani
2009-04-24T23:59:59.000Z
In these notes we discuss the "self-reducibility property" of the Weil representation. We explain how to use this property to obtain sharp estimates of certain higher-dimensional exponential sums which originate from the theory of quantum chaos. As a result, we obtain the Hecke quantum unique ergodicity theorem for generic linear symplectomorphism $A$ of the torus $T^{2N}=R^{2N}/Z^{2N}.
Spectral learning of linear dynamics from generalised-linear observations
a non-linear and non-Gaussian observation process. We use this approach to obtain estimates to the generalised-linear regression model [8]), where the expected value of an observation is given by a monotonicSpectral learning of linear dynamics from generalised-linear observations with application
QPL 2005 Preliminary Version De-linearizing linearity: projective quantum
Selinger, Peter
QPL 2005 Preliminary Version De-linearizing linearity: projective quantum axiomatics from strong the linear structure of Hilbert spaces into several constituents which play different roles in quantum)famous Birkhoff- von Neumann paper [7]. The bulk of the linear structure required to reason about quantum
Application of separable programming to optimization by geometric programming
Humber, Joseph Barker
1971-01-01T23:59:59.000Z
Mathematical Programming System/ 360 computer program (MPS/360) [3]. The program uses the method described in the previous chapter; i. e. , the "Delta Method" described by Hadley [2), The user must provide the following data: (i. ) The partition of each x... applied it to engineering design problems. Chapter II contains a detailed presentation of the theory of this technique. Once a pro'olem has been formulated as a geometric programming problem, its solution can then be approximated by linear programming...
Towards OWL-based Knowledge Representation in Petrology
Shkotin, Alex; Kudryavtsev, Dmitry
2011-01-01T23:59:59.000Z
This paper presents our work on development of OWL-driven systems for formal representation and reasoning about terminological knowledge and facts in petrology. The long-term aim of our project is to provide solid foundations for a large-scale integration of various kinds of knowledge, including basic terms, rock classification algorithms, findings and reports. We describe three steps we have taken towards that goal here. First, we develop a semi-automated procedure for transforming a database of igneous rock samples to texts in a controlled natural language (CNL), and then a collection of OWL ontologies. Second, we create an OWL ontology of important petrology terms currently described in natural language thesauri. We describe a prototype of a tool for collecting definitions from domain experts. Third, we present an approach to formalization of current industrial standards for classification of rock samples, which requires linear equations in OWL 2. In conclusion, we discuss a range of opportunities arising ...
Representation, Organization, Classification, and Meaning-Making
Toronto, University of
1 Representation, Organization, Classification, and Meaning-Making Description Fundamental epistemological and ontological issues in the use of knowledge and information in human activities. Analysis, department store, grocery store, children's library, a menu, a store catalogue) and analyze that organization
Mental Representations Formed From Educational Website Formats
Elizabeth T. Cady; Kimberly R. Raddatz; Tuan Q. Tran; Bernardo de la Garza; Peter D. Elgin
2006-10-01T23:59:59.000Z
The increasing popularity of web-based distance education places high demand on distance educators to format web pages to facilitate learning. However, limited guidelines exist regarding appropriate writing styles for web-based distance education. This study investigated the effect of four different writing styles on reader’s mental representation of hypertext. Participants studied hypertext written in one of four web-writing styles (e.g., concise, scannable, objective, and combined) and were then administered a cued association task intended to measure their mental representations of the hypertext. It is hypothesized that the scannable and combined styles will bias readers to scan rather than elaborately read, which may result in less dense mental representations (as identified through Pathfinder analysis) relative to the objective and concise writing styles. Further, the use of more descriptors in the objective writing style will lead to better integration of ideas and more dense mental representations than the concise writing style.
Towards improving phenotype representation in OWL
Loebe, Frank; Stumpf, Frank; Hoehndorf, Robert; Herre, Heinrich
2012-09-21T23:59:59.000Z
PROCEEDINGS Open Access Towards improving phenotype representation in OWL Frank Loebe1*, Frank Stumpf1, Robert Hoehndorf2, Heinrich Herre3 From Ontologies in Biomedicine and Life Sciences (OBML 2011) Berlin, Germany. 6-7 October 2011...
Text representations in digital hypermedia library systems
Lokken, Sveinung Taraldsrud
1993-01-01T23:59:59.000Z
The advent of the digital library poses a great number of challenging research questions in the areas of hypermedia, computer-human interaction, information retrieval, and information science. Choosing a representation for text converted from...
W. B. Vasantha Kandasamy; Florentin Smarandache
2010-12-08T23:59:59.000Z
In this book we use only special types of intervals and introduce the notion of different types of interval linear algebras and interval vector spaces using the intervals of the form [0, a] where the intervals are from Zn or Z+ \\cup {0} or Q+ \\cup {0} or R+ \\cup {0}. A systematic development is made starting from set interval vector spaces to group interval vector spaces. Vector spaces are taken as interval polynomials or interval matrices or just intervals over suitable sets or semigroups or groups. Main feature of this book is the authors have given over 350 examples. This book has six chapters. Chapter one is introductory in nature. Chapter two introduces the notion of set interval linear algebras of type one and two. Set fuzzy interval linear algebras and their algebras and their properties are discussed in chapter three. Chapter four introduces several types of interval linear bialgebras and bivector spaces and studies them. The possible applications are given in chapter five. Chapter six suggests nearly 110 problems of all levels.
Shaon Sahoo; Soumya Kanti Ganguly
2015-02-01T23:59:59.000Z
Contrary to the actual nonlinear Glauber model (NLGM), the linear Glauber model (LGM) is exactly solvable, although the detailed balance condition is not generally satisfied. This motivates us to address the issue of writing the transition rate ($w_j$) in a best possible linear form such that the mean squared error in satisfying the detailed balance condition is least. The advantage of this work is that, by studying the LGM analytically, we will be able to anticipate how the kinetic properties of an arbitrary Ising system depend on the temperature and the coupling constants. The analytical expressions for the optimal values of the parameters involved in the linear $w_j$ are obtained using a simple Moore-Penrose pseudoinverse matrix. This approach is quite general, in principle applicable to any system and can reproduce the exact results for one dimensional Ising system. In the continuum limit, we get a linear time-dependent Ginzburg-Landau (TDGL) equation from the Glauber's microscopic model of non-conservative dynamics. We analyze the critical and dynamic properties of the model, and show that most of the important results obtained in different studies can be reproduced by our new mathematical approach. We will also show in this paper that the effect of magnetic field can easily be studied within our approach; in particular, we show that the inverse of relaxation time changes quadratically with (weak) magnetic field and that the fluctuation-dissipation theorem is valid for our model.
Automatic Linear Orders (Revised Version)
Stephan, Frank
CDMTCS Research Report Series Automatic Linear Orders and Trees (Revised Version) Bakhadyr; Automatic Linear Orders and Trees Bakhadyr Khoussainov, Sasha Rubin and Frank Stephan November 13, 2003 emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees
Becker, Jörg D
2015-01-01T23:59:59.000Z
In many European countries the growth of the real GDP per capita has been linear since 1950. An explanation for this linearity is still missing. We propose that in artificial intelligence we may find models for a linear growth of performance. We also discuss possible consequences of the fact that in systems with linear growth the percentage growth goes to zero.
Representations up to homotopy of Lie algebroids
Abad, Camilo Arias
2009-01-01T23:59:59.000Z
This is the first in a series of papers devoted to the study of the cohomology of classifying spaces. The aim of this paper is to introduce and study the notion of representation up to homotopy and to make sense of the adjoint representation of a Lie algebroid. Our construction is inspired by Quillen's notion of superconnection and fits into the general theory of structures up to homotopy. The advantage of considering such representations is that they are flexible and general enough to contain interesting examples which are the correct generalization of the corresponding notions for Lie algebras. They also allow one to identify seemingly ad-hoc constructions and cohomology theories as instances of the cohomology with coefficients in representations (up to homotopy). In particular, we show that the adjoint representation of a Lie algebroid makes sense as a representation up to homotopy and that, similar to the case of Lie algebras, the resulting cohomology controls the deformations of the Lie algebroid (i.e. i...
ON SEMIDEFINITE PROGRAMMING RELAXATIONS OF THE ...
2009-02-08T23:59:59.000Z
To see this, note that every Hamiltonian circuit in a complete graph. ?Department of ...... Heuristic analysis, linear programming, and branch and bound.
Analysis of Stochastic Dual Dynamic Programming Method
2010-05-29T23:59:59.000Z
Abstract. In this paper we discuss statistical properties and convergence of the .... For a ? R, [a]+ := max{0,a}. ... Problem (2.2) is a linear programming problem.
Optimization Online - Integer Programming Submissions - 2013
January 2013. (Mixed) Integer Linear Programming ... Memory-Aware Parallelized RLT3 for Solving Quadratic Assignment Problems Peter Hahn, Amir Roth, ...
Improved semidefinite programming bounds for quadratic ...
2009-09-15T23:59:59.000Z
Sep 15, 2009 ... nite programming relaxations of the quadratic assignment problem, Math- ematical ... linear term since it arises when doing branch and bound.
Comparing Single and Multiple Turbine Representations in a Wind Farm Simulation: Preprint
Muljadi, E.; Parsons, B.
2006-03-01T23:59:59.000Z
This paper compares single turbine representation versus multiple turbine representation in a wind farm simulation.
Complete Representations in Algebraic Logic Robin Hirsch & Ian Hodkinson \\Lambda
Hodkinson, Ian
Complete Representations in Algebraic Logic Robin Hirsch & Ian Hodkinson \\Lambda Abstract A boolean algebra is shown to be completely representable if and only if it is atomic, whereas it is shown that neither the class of completely representable relation algebras nor the class of completely representable
357 09/2010 Assessing Representations for Moving Object
Güting, Ralf Hartmut
INFORMATIK BERICHTE 357 09/2010 Assessing Representations for Moving Object Histories Christian Hagen #12;1 Assessing Representations for Moving Object Histories Christian D¨untgen, Thomas Behr of the histories of moving objects in databases: the Compact Representation, the Unit Representation and the Hybrid
Pressure vs. decibel modulation in spectrotemporal representations
Simon, Jonathan Z.
by the inverse-repeat method) relative to the that of the linearized response. Nominal Stimulus Modulation-Inverted
Banks, R.M.
1986-01-14T23:59:59.000Z
This patent describes a linear output nitinol engine consisting of a number of integrated communicating parts. The engine has an external support framework which is described in detail. The patent further describes a wire transport mechanism, a pair of linkage levers with a loom secured to them, a number of nitinol wires strung between the looms, and a power takeoff block secured to the linkage levers. A pulley positioned in a flip-flop supporting bracket and a power takeoff modality including a tension member connected to a power output cable in order to provide linear power output transmission is described. A method for biasing the timing and the mechanism for timing the synchronization of the throw over arms and the flip-flop of the pulley are also described.
Buttram, M.T.; Ginn, J.W.
1988-06-21T23:59:59.000Z
A linear induction accelerator includes a plurality of adder cavities arranged in a series and provided in a structure which is evacuated so that a vacuum inductance is provided between each adder cavity and the structure. An energy storage system for the adder cavities includes a pulsed current source and a respective plurality of bipolar converting networks connected thereto. The bipolar high-voltage, high-repetition-rate square pulse train sets and resets the cavities. 4 figs.
Combustion powered linear actuator
Fischer, Gary J. (Albuquerque, NM)
2007-09-04T23:59:59.000Z
The present invention provides robotic vehicles having wheeled and hopping mobilities that are capable of traversing (e.g. by hopping over) obstacles that are large in size relative to the robot and, are capable of operation in unpredictable terrain over long range. The present invention further provides combustion powered linear actuators, which can include latching mechanisms to facilitate pressurized fueling of the actuators, as can be used to provide wheeled vehicles with a hopping mobility.
The International Linear Collider
Barish, Barry
2013-01-01T23:59:59.000Z
In this article, we describe the key features of the recently completed technical design for the International Linear Collider (ILC), a 200-500 GeV linear electron-positron collider (expandable to 1 TeV) that is based on 1.3 GHz superconducting radio-frequency (SCRF) technology. The machine parameters and detector characteristics have been chosen to complement the Large Hadron Collider physics, including the discovery of the Higgs boson, and to further exploit this new particle physics energy frontier with a precision instrument. The linear collider design is the result of nearly twenty years of R&D, resulting in a mature conceptual design for the ILC project that reflects an international consensus. We summarize the physics goals and capability of the ILC, the enabling R&D and resulting accelerator design, as well as the concepts for two complementary detectors. The ILC is technically ready to be proposed and built as a next generation lepton collider, perhaps to be built in stages beginning as a Hig...
Control of linear systems subject to input constraints: a polynomial approach. \\Lambda
Henrion, Didier
rely on the extended Farkas lemma [14], linear programming [32, 9], eigenstructure assignment [8, 9Control of linear systems subject to input constraints: a polynomial approach. \\Lambda Didier Republic Abstract A polynomial approach is pursued for locally stabilizing discretetime linear systems
Bistructures, Bidomains and Linear Logic
Curien, Pierre-Louis; Plotkin, Gordon; Winskel, Glynn
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an order-extensional setting. The partial order of causal dependency is replaced by two orders, ...
Algorithms for Solving Linear Congruences and Systems of Linear Congruences
Florentin Smarandache
2007-02-16T23:59:59.000Z
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
Java Programming Certificate Program
Loudon, Catherine
Java Programming Certificate Program COMPUTER PROGRAMMING The Java programming language lies that fuel the Internet economy. In addition, the portability inherent in Java is useful for programming languages are likely to encounter projects in the near future that require knowledge of Java. Who Should
Java Programming Certificate Program
Loudon, Catherine
Java Programming Certificate Program COMPUTER PROGRAMMING The Java programming language lies that fuel the Internet economy. In addition, the portability inherent in Java is useful for programming are likely to encounter projects in the near future that require knowledge of Java. Who Should Enroll
Unifying Geometrical Representations of Gauge Theory
Scott T Alsid; Mario A Serna
2014-10-28T23:59:59.000Z
We unify three approaches within the vast body of gauge-theory research that have independently developed distinct representations of a geometrical surface-like structure underlying the vector-potential. The three approaches that we unify are: those who use the compactified dimensions of Kaluza-Klein theory, those who use Grassmannian models (also called gauge theory embedding or $CP^{N-1}$ models) to represent gauge fields, and those who use a hidden spatial metric to replace the gauge fields. In this paper we identify a correspondence between the geometrical representations of the three schools.Each school was mostly independently developed, does not compete with other schools, and attempts to isolate the gauge-invariant geometrical surface-like structures that are responsible for the resulting physics. By providing a mapping between geometrical representations, we hope physicists can now isolate representation-dependent physics from gauge-invariant physical results and share results between each school. We provide visual examples of the geometrical relationships between each school for $U(1)$ electric and magnetic fields. We highlight a first new result: in all three representations a static electric field (electric field from a fixed ring of charge or a sphere of charge) has a hidden gauge-invariant time dependent surface that is underlying the vector potential.
Park, Joung Won
2010-10-12T23:59:59.000Z
, and Temperature (PVT) variations and increase high power input capability. After analyzing and designing a resistive feedback LNA, novel linearization methods were applied. A highly linear broadband LNA is designed and simulated in 65nm CMOS technology. Simulation...
Park, Joung Won
2010-10-12T23:59:59.000Z
In this work, a highly linear broadband Low Noise Amplifier (LNA) is presented. The linearity issue in broadband Radio Frequency (RF) front-end is introduced, followed by an analysis of the specifications and requirements of a broadband LNA through...
Linear Collider Physics Resource Book Snowmass 2001
Ronan (Editor), M.T.
2001-06-01T23:59:59.000Z
The American particle physics community can look forward to a well-conceived and vital program of experimentation for the next ten years, using both colliders and fixed target beams to study a wide variety of pressing questions. Beyond 2010, these programs will be reaching the end of their expected lives. The CERN LHC will provide an experimental program of the first importance. But beyond the LHC, the American community needs a coherent plan. The Snowmass 2001 Workshop and the deliberations of the HEPAP subpanel offer a rare opportunity to engage the full community in planning our future for the next decade or more. A major accelerator project requires a decade from the beginning of an engineering design to the receipt of the first data. So it is now time to decide whether to begin a new accelerator project that will operate in the years soon after 2010. We believe that the world high-energy physics community needs such a project. With the great promise of discovery in physics at the next energy scale, and with the opportunity for the uncovering of profound insights, we cannot allow our field to contract to a single experimental program at a single laboratory in the world. We believe that an e{sup +}e{sup -} linear collider is an excellent choice for the next major project in high-energy physics. Applying experimental techniques very different from those used at hadron colliders, an e{sup +}e{sup -} linear collider will allow us to build on the discoveries made at the Tevatron and the LHC, and to add a level of precision and clarity that will be necessary to understand the physics of the next energy scale. It is not necessary to anticipate specific results from the hadron collider programs to argue for constructing an e{sup +}e{sup -} linear collider; in any scenario that is now discussed, physics will benefit from the new information that e{sup +}e{sup -} experiments can provide. This last point merits further emphasis. If a new accelerator could be designed and built in a few years, it would make sense to wait for the results of each accelerator before planning the next one. Thus, we would wait for the results from the Tevatron before planning the LHC experiments, and wait for the LHC before planning any later stage. In reality accelerators require a long time to construct, and they require such specialized resources and human talent that delay can cripple what would be promising opportunities. In any event, we believe that the case for the linear collider is so compelling and robust that we can justify this facility on the basis of our current knowledge, even before the Tevatron and LHC experiments are done. The physics prospects for the linear collider have been studied intensively for more than a decade, and arguments for the importance of its experimental program have been developed from many different points of view. This book provides an introduction and a guide to this literature. We hope that it will allow physicists new to the consideration of linear collider physics to start from their own personal perspectives and develop their own assessments of the opportunities afforded by a linear collider.
Functional Answer Set Programming
Cabalar, Pedro
2010-01-01T23:59:59.000Z
In this paper we propose an extension of Answer Set Programming (ASP), and in particular, of its most general logical counterpart, Quantified Equilibrium Logic (QEL), to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature. We argue that this choice yields some counterintuitive effects from a logic programming and knowledge representation point of view. We then propose a variant called QELF where the set of functions is partitioned into partial and Herbrand functions (we also call constructors). In the rest of the paper, we show a direct connection to Scott's Logic of Existence and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets...
Path Integral Representations on the Complex Sphere
Christian Grosche
2007-10-23T23:59:59.000Z
In this paper we discuss the path integral representations for the coordinate systems on the complex sphere S3C. The Schroedinger equation, respectively the path integral, separates in exactly 21 orthogonal coordinate systems. We enumerate these coordinate systems and we are able to present the path integral representations explicitly in the majority of the cases. In each solution the expansion into the wave-functions is stated. Also, the kernel and the corresponding Green function can be stated in closed form in terms of the invariant distance on the sphere, respectively on the hyperboloid.
Linear Solvers 1.Introduction [1
McCalley, James D.
linear algebra packages including LAPACK, ScaLAPACK and PETSc, are built on top of BLAS. Most of standard, portable solver libraries available, including: BLAS (Basic linear algebra subprograms): Many (Automatically Tuned Linear Algebra Software package) is a version of BLAS that, upon installation, tests
Wave functions of linear systems
Tomasz Sowinski
2007-06-05T23:59:59.000Z
Complete analysis of quantum wave functions of linear systems in an arbitrary number of dimensions is given. It is shown how one can construct a complete set of stationary quantum states of an arbitrary linear system from purely classical arguments. This construction is possible because for linear systems classical dynamics carries the whole information about quantum dynamics.
Simple Linear Regression Basic Ideas
Simple Linear Regression Basic Ideas Some Examples Least Squares Statistical View of Least Squares of Least Squares #12;Simple Linear Regression Basic Ideas Some Examples Least Squares Basic Ideas Suppose #12;Simple Linear Regression Basic Ideas Some Examples Least Squares Basic Ideas Suppose we have two
Special set linear algebra and special set fuzzy linear algebra
W. B. Vasantha Kandasamy; Florentin Smarandache; K. Ilanthenral
2009-12-30T23:59:59.000Z
The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the application of multi expert models and cryptology. This book has five chapters. In chapter one the basic concepts about set linear algebra is given in order to make this book a self contained one. The notion of special set linear algebra and their fuzzy analogue is introduced in chapter two. In chapter three the notion of special set semigroup linear algebra is introduced. The concept of special set n-vector spaces, n greater than or equal to three is defined and their fuzzy analogue is their fuzzy analogue is given in chapter four. The probable applications are also mentioned. The final chapter suggests 66 problems.
Pattern separation via ellipsoids and conic programming
Glineur, François
' & $ % Pattern separation via ellipsoids and conic programming Fran¸cois Glineur 1 of 1 05 ellipsoids and conic programming ' & $ % \\Upsilon \\Sigma \\Xi \\Pi Objective Machine learning ffl Separation problem ffl Classification Mathematical programming ffl Linear programming ffl Interiorpoint methods ffl
An Investigation of Supervised Learning in Genetic Programming
Gathercole, Christopher
This thesis is an investigation into Supervised Learning (SL) in Genetic Programming (GP). With its flexible tree-structured representation, GP is a type of Genetic Algorithm, using the Darwinian idea of natural selection and genetic recombination...
Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation
Jia, Jun [ORNL; Harrison, Robert J [ORNL; Fann, George I [ORNL
2010-01-01T23:59:59.000Z
We present a fast algorithm to compute the partial transformation of a function represented in an adaptive pseudo-spectral multi-wavelet representation to a partial Fourier representation. Such fast transformations are useful in many contexts in physics and engineering, where changes of representation from a piece wise polynomial basis to a Fourier basis. The algorithm is demonstrated for a Gaussian in one and in three dimensions. For 2D, we apply this approach to a Gaussian in a periodic domain. The accuracy and the performance of this method is compared with direct summation.
FROM NORLUND MATRICES TO LAPLACE REPRESENTATIONS
Sinnamon, Gordon J.
(and not too large) on the line Re z = 0, the Laplace transform LF is just the (Poisson extension of the) Fourier transform of F. It is therefore appropriate to view the power series representation¨orlund matrices and corresponding convolution operators on the line. Analogous inequalities are proved for power
THE BREUILMEZARD CONJECTURE FOR POTENTIALLY BARSOTTITATE REPRESENTATIONS.
Kisin, Mark
THE BREUILM´EZARD CONJECTURE FOR POTENTIALLY BARSOTTITATE REPRESENTATIONS. TOBY GEE AND MARK, proving a variety of results including the BuzzardDiamondJarvis conjecture. Contents Overview. 2.3. Patching 14 3.4. Potential diagonalizability 18 3.5. Local results 20 4. The BuzzardDiamondJarvis
Galois representations with quaternion multiplication associated to ...
A.O.L. Atkin; Wen-Ching Winnie Li; Tong Liu; Ling Long
2013-09-18T23:59:59.000Z
Aug 19, 2013 ... Modularity of Scholl representations when d = 1. 6228. 4.2. ... 1. Introduction. To a d-dimensional space S?(?) of cusp forms of weight ? > 2 for a noncongru- ence subgroup ? ...... MR2038777 (2004m:11089). [BLTDR10] T.
Radon Transform Inversion using the Shearlet Representation
Labate, Demetrio
Radon Transform Inversion using the Shearlet Representation Flavia Colonna Department The inversion of the Radon transform is a classical ill-posed inverse problem where some method-optimal rate of convergence in estimating a large class of images from noisy Radon data. This is achieved
ACQUIRED EQUIVALENCE CHANGES STIMULUS REPRESENTATIONS , D. SHOHAMY
Shohamy, Daphna
ACQUIRED EQUIVALENCE CHANGES STIMULUS REPRESENTATIONS M. MEETER 1 , D. SHOHAMY 2 , AND C.E. MYERS 3 UNIVERSITY 3 DEPT. OF PSYCHOLOGY, RUTGERS UNIVERSITY Acquired equivalence is a paradigm in which of feature salience. A different way of conceptualizing acquired equivalence is in terms of strategic
Shape Recipes: Scene Representations that Refer
Freeman, William T.
Shape Recipes: Scene Representations that Refer to the Image William T. Freeman and Antonio to estimate and store. We propose a low-dimensional rep- resentation, called a scene recipe, that relies on the image itself to de- scribe the complex scene configurations. Shape recipes are an example
Adaptive Representation of Specular Light Flux
Montréal, Université de
Adaptive Representation of Specular Light Flux Normand Bri`ere Pierre Poulin D´epartement d in all but the simplest con- figurations. To capture their appearance, we present an adaptive approach based upon light beams. The coher- ence between light rays forming a light beam greatly re- duces
Memory Space Representation Heterogeneous Network Process Migration
Sun, Xian-He
Memory Space Representation for Heterogeneous Network Process Migration Kasidit Chanchio Xian@bit.csc.lsu.edu http://www.csc.lsu.edu/~scs/ Abstract A major difficulty of heterogeneous process migration is how and effective for heterogeneous network process migration. 1. Introduction As network computing becomes
Bayes Nets Representation: joint distribution and conditional
Mitchell, Tom
Bayes Nets Representation: joint distribution and conditional independence Yi Zhang 10-701, Machine joint distribution of BNs Infer C. I. from factored joint distributions D-separation (motivation) 2 structure All about the joint distribution of variables ! Conditional independence assumptions are useful
Taylor Expansion Diagrams: A Canonical Representation for
Kalla, Priyank
Taylor series expansion that allows one to model word-level signals as algebraic symbols. This power systems has made it essential to address verification issues at early stages of the design cycle representations. TEDs are applicable to modeling, symbolic simulation, and equivalence verification of dataflow
The International Linear Collider
Karsten Buesser
2013-06-13T23:59:59.000Z
The International Linear Collider (ILC) is a proposed electron-positron collider for the centre-of-mass energy range of 200 to 500 GeV and with upgrade options towards 1 TeV. The ILC would be the ideal tool to explore with high precision the properties of the new Higgs-like particle that has recently been discovered at the LHC with a mass of around 125 GeV. The ILC accelerator design is based on the mature superconducting technology that has been developed in the TESLA collaboration and that is currently being used for the European XFEL. The exploitation of the huge physics potential of the ILC is a challenge for the design of the ILC detectors.
Visualization of Program-Execution Data for Deployed
Orso, Alessandro "Alex"
Â· Color used to represent characteristics of code and its executions Â· Mapping of data to color dependent Collection Daemon Database Customer 1 Customer 2 Customer N program instrumented program execution data data Â· Maps field data to program representations using color Â· Provides multiple levels of abstraction
An assessment of natural history representation in Texas state parks and natural areas
Bishop, Glen Robert
1985-01-01T23:59:59.000Z
, and inspiration of present and future generations. This study examines the representation of natural heritage in Texas state parks. A system of natural history themes developed by the National Park Service is modified to be more applicable to Texas. Texas state... The National Natural Landmarks Program State Studies Texas Studies 13 15 17 23 24 I I I METHODOLOGY Development of Texas Natural History Themes Park Descriptions System Description 26 28 29 IV RESULTS: TEXAS NATURAL HISTORY THEMES 32 Landforms...
Zander, Jessica Selene
2012-01-01T23:59:59.000Z
Narratives of Contamination: Representations of Race,Fall 2012 Narratives of Contamination: Representations ofAbstract Narratives of Contamination: Representations of
Asymptotic wave-splitting in anisotropic linear acoustics
B. L. G. Jonsson; M. Norgren
2009-08-11T23:59:59.000Z
Linear acoustic wave-splitting is an often used tool in describing sound-wave propagation through earth's subsurface. Earth's subsurface is in general anisotropic due to the presence of water-filled porous rocks. Due to the complexity and the implicitness of the wave-splitting solutions in anisotropic media, wave-splitting in seismic experiments is often modeled as isotropic. With the present paper, we have derived a simple wave-splitting procedure for an instantaneously reacting anisotropic media that includes spatial variation in depth, yielding both a traditional (approximate) and a `true amplitude' wave-field decomposition. One of the main advantages of the method presented here is that it gives an explicit asymptotic representation of the linear acoustic-admittance operator to all orders of smoothness for the smooth, positive definite anisotropic material parameters considered here. Once the admittance operator is known we obtain an explicit asymptotic wave-splitting solution.
Linear Algebraic Method for Non-Linear Map Analysis
Yu,L.; Nash, B.
2009-05-04T23:59:59.000Z
We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.
Representation of Energy Use in the Food Products Industry
Elliott, N. R.
2007-01-01T23:59:59.000Z
Traditional representations of energy in the manufacturing sector have tended to represent energy end-uses rather than actual energy service demands. While this representation if quite adequate for understanding how energy is used today...
Representation of Energy Use in the Food Products Industry
Elliott, N. R.
2007-01-01T23:59:59.000Z
Traditional representations of energy in the manufacturing sector have tended to represent energy end-uses rather than actual energy service demands. While this representation if quite adequate for understanding how energy is used today...
Lexical semantics and knowledge representation in multilingual sentence generation
Toronto, University of
Lexical semantics and knowledge representation in multilingual sentence generation by Manfred Stede semantics and knowledge representation in multilingual sentence generation Manfred Stede Doctor approach to automatic language generation that focuses on the need to produce a range of di erent
International linear collider reference design report
Aarons, G.
2008-01-01T23:59:59.000Z
A. Loew, et al. , “International Linear Collider Technologyfor the International Linear Collider”, in preparation [37]for the International Linear Collider,” in PAC05,http://
Anomaly-free representations of the holonomy-flux algebra
SangChul Yoon
2008-09-07T23:59:59.000Z
We work on the uniqueness, gr-qc/0504147, of representations of the holonomy-flux algebra in loop quantum gravity. We argue that for analytic diffeomorphisms, the flux operators can be only constants as functions on the configuration space in representations with no anomaly, which are zero in the standard representation.
Representation Theory, Geometry & Combinatorics Organizer: M. Haiman and N. Reshetikhin
Haiman, Mark D.
Representation Theory, Geometry & Combinatorics Seminar Organizer: M. Haiman and N. Reshetikhin course: Representation theory and the X-ray transform The X-ray transform (also called the Funk transform tools from complex analysis and the representation theory of Lie groups. Lecture 1: Differential
Kliman, G.B.; Brynsvold, G.V.; Jahns, T.M.
1989-08-22T23:59:59.000Z
A winding and method of winding for a submersible linear pump for pumping liquid sodium are disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet. 4 figs.
Kliman, Gerald B. (Schenectady, NY); Brynsvold, Glen V. (San Jose, CA); Jahns, Thomas M. (Schenectady, NY)
1989-01-01T23:59:59.000Z
A winding and method of winding for a submersible linear pump for pumping liquid sodium is disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet.
6, 66276694, 2006 linearized ozone
Boyer, Edmond
ACPD 6, 66276694, 2006 CHEM2D-OPP linearized ozone photochemistry J. P. McCormack et al. Title Chemistry and Physics Discussions CHEM2D-OPP: A new linearized gas-phase ozone photochemistry.mccormack@nrl.navy.mil) 6627 #12;ACPD 6, 66276694, 2006 CHEM2D-OPP linearized ozone photochemistry J. P. McCormack et al
Linear Algebra 1: Computing canonical forms in exact linear
Pernet, Clément
Linear Algebra 1: Computing canonical forms in exact linear algebra Clément PERNET, LIG, where U is invertible Reduced echelon form: E = 1 0 0 1 0 1 Gauss-Jordan elimination #12 a field: B = U-1 AU Frobenius normal form (or canonical rational form): F = CP0 CP1 ... CPk
Identifying Redundant Linear Constraints in Systems of Linear ...
2006-06-22T23:59:59.000Z
Jun 22, 2006 ... redundant linear constraints from the system (2.1) and (2.2). ... It is informative to note that in the above theorem, the optimal ..... S. Boyd and L. El Ghaoui, “Linear Matrix Inequalities in System and Control Theory”, SIAM, vol.
Huang, Yi-Zhi
Quantum Hall systems Representation theory of vertex operator algebras Applications The end Quantum;Quantum Hall systems Representation theory of vertex operator algebras Applications The end Outline 1 An approach to a fundamental conjecture #12;Quantum Hall systems Representation theory of vertex operator
Huang, Yi-Zhi
Quantum Hall systems Representation theory of vertex operator algebras Applications The end Quantum Science, CAS #12;Quantum Hall systems Representation theory of vertex operator algebras Applications to a fundamental conjecture #12;Quantum Hall systems Representation theory of vertex operator algebras Applications
Animal representations and animal remains at Çatalhöyük
Russell, Nerissa; Meece, Stephanie
2006-01-01T23:59:59.000Z
(Level VII). Volcano above town plan, leopard skin above geometric design, or other representations? Level VI paintings lack fully convinc ing animal depictions. A patch of painting on the east wall of building VIA.66 includes a number of geomet ric... the centrepieces of the north walls of two rather similar buildings. In a sense they parallel the situation in the faunal assemblage, where cattle are not terribly common, but figure prominently in cer emonial consumption (see Russell & Martin, Volume 4...
Virasoro Representations on (Diff S1)/S1 Coadjoint Orbits
Washington Taylor IV
1992-04-28T23:59:59.000Z
A new set of realizations of the Virasoro algebra on a bosonic Fock space are found by explicitly computing the Virasoro representations associated with coadjoint orbits of the form (Diff S1) / S1. Some progress is made in understanding the unitary structure of these representations. The characters of these representations are exactly the bosonic partition functions calculated previously by Witten using perturbative and fixed-point methods. The representations corresponding to the discrete series of unitary Virasoro representations with c <= 1 are found to be reducible in this formulation, confirming a conjecture by Aldaya and Navarro-Salas.
Reformulations, Relaxations and Cutting Planes for Linear Generalized Disjunctive
Grossmann, Ignacio E.
model allows for a combination of algebraic and logical equations through disjunctions and logic by Raman and Grossmann [1994], is an extension of the well-known disjunctive programming paradigm developed the underlying logical structure of the problem, in both the linear [Raman & Grossmann, 1994] and nonlinear cases
GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS
Katz, Richard
) Multisites (Spatial dependence of daily weather) -- Software R open source statistical programming language (Capable of "reproducing" any desired statistic) -- Disadvantages Synthetic weather looks too much like") Not amenable to uncertainty analysis #12;#12;#12;(2) Generalized Linear Models · Statistical Framework
Decomposition and Dynamic Cut Generation in Integer Linear ...
2004-08-18T23:59:59.000Z
tion procedures or by rewriting it as the equivalent linear program. zLD. = max ...... of a “class” of inequalities comes from the well-known template paradigm for separation, so named by ...... for Management of Operations and Logistics, 1995. 27.
Miller, Damon A.
. To experimentally measure and use an equivalent circuit representation for circuit analysis. 8. To improve circuit of Figure 1 to represent the small signal operation (i.e. in the LINEAR region) of the amplifier© 2012 Damon A. Miller Page 1 of 4 4: Transfer Functions, Parameters, and Equivalent Circuits
Frank Masci (1)MIPS D/L Review (S5), February 28, 2001 24m SUR-mode Linearization
Masci, Frank
Frank Masci (1)MIPS D/L Review (S5), February 28, 2001 24µm SUR-mode Linearization: SLOPECORR Frank Masci February 28, 2001 #12;Frank Masci (2)MIPS D/L Review (S5), February 28, 2001 Aim SLOPECORR Masci (3)MIPS D/L Review (S5), February 28, 2001 Pictorial Representation t DNobs Quadratic model fit
Sontag, Eduardo
Infinite Time Optimal Control of Hybrid Systems with a Linear Performance Index Mato BaotiÂ´c, Frank the constrained infinite time optimal control problem for the class of discrete time linear hybrid systems. When time, optimal control, discrete time, linear hybrid systems, dynamic program- ming, multi
Ensure Program Correctness Programming Languages
Chen, Sheng-Wei
Ensure Program Correctness Programming Languages and Formal Methods Research Group Lab Coordinator Bow-Yaw Wang The Programming Languages and Formal Methods Research Group develops techniques to help ensure program correctness. Our research in programming languages focuses on syntactic, semantic
Lexicographic products and the power of non-linear network coding
Blasiak, Anna; Lubetzky, Eyal
2011-01-01T23:59:59.000Z
We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that they are a valid dual of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for constructing hard instances in which the gap between combinatorial or coding-theoretic parameters is polynomially large. We find polynomial gaps in cases in which the largest previously known gaps were only small constant factors or entirely unknown. Most notably, we show a polynomial separation between linear and non-linear network coding rates. This involves exploiting a connection between matroids and index coding to establish...
A NOVEL INTEGER PROGRAMMING FORMULATION FOR THE K ...
2005-10-28T23:59:59.000Z
Oct 28, 2005 ... This problem is called k-SONET Ring Assignment Problem, or ... In Section 4, the novel integer linear programming formulation is presented.
Code verification by static analysis: a mathematical programming ...
2009-09-24T23:59:59.000Z
(for example the assignment of convex over-approximations X ? ? to x). ... This yields a Mixed-Integer Linear Program for code based on integer arithmetic,.
Representations of groups of order 16
McCarthy, Edmond Robert
1966-01-01T23:59:59.000Z
, 16) K - {10, 14) The analysis al. so shows that G contains three subgroups H. of order 2; only one of which is normal. This is the i subgroup consisting of the elements (1, 5}. The factor group G/H is isomorphic to C 4 C2. Since the Cayley table..., 13 10, 14 11, 15 37 With this correspondence established we need only refer back to Table II, the character table of C 4 C2, to begin writing out representations of Group Six. For example, in Table II we find D&(3) = -1. If TK...
Representations of the groups of order 24
Strange, John Billy
1967-01-01T23:59:59.000Z
: MATHEMATICS REPRESENTATIONS OF THE GROUPS OF ORDER 24 A Thesis By JOHN BILLY STRANGE Approved as to style and content by: I tl ~Chairman of Commrtteeg YMe ber C o QH d I D p ~t'Dt May l967 ACKNOWLEDGMENT During the past eighteen months it has been... cyclic group of order i. 1 The remaining groups with symbols are listed below. 10. 12 (Dihedral of order 24) 11. 12. Q] 2 13. (4, 2 l 2, 2) (Symmetric of order 24) (Quaternion of order 24) 14. &-2, 2, 3& 15. &2, 3, 3& 10 A recent discovery by D...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Programming Programming Compiling and linking programs on Euclid. Compiling Codes How to compile and link MPI codes on Euclid. Read More Using the ACML Math Library How to...
Acoustic emission linear pulse holography
Collins, H.D.; Busse, L.J.; Lemon, D.K.
1983-10-25T23:59:59.000Z
This device relates to the concept of and means for performing Acoustic Emission Linear Pulse Holography, which combines the advantages of linear holographic imaging and Acoustic Emission into a single non-destructive inspection system. This unique system produces a chronological, linear holographic image of a flaw by utilizing the acoustic energy emitted during crack growth. The innovation is the concept of utilizing the crack-generated acoustic emission energy to generate a chronological series of images of a growing crack by applying linear, pulse holographic processing to the acoustic emission data. The process is implemented by placing on a structure an array of piezoelectric sensors (typically 16 or 32 of them) near the defect location. A reference sensor is placed between the defect and the array.
DOE Publishes CALiPER Report on Linear (T8) LED Lamps in Recessed Troffers
Broader source: Energy.gov [DOE]
The U.S. Department of Energy's CALiPER program has released Report 21.2, which is part of a series of investigations on linear LED lamps. Report 21.2 focuses on the performance of three linear (T8...
An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints
Wang, Jia
An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints, Chicago, IL 60616, USA ABSTRACT Vectorless power grid verification makes it possible to eval- uate worst, the vectorless power grid verification problem can be formulated and solved as a linear programming (LP) problem
Linear Consistency Testing Yonatan Aumann
Sudan, Madhu
of Blum, Luby and Rubinfeld [?] to check the linear-consistency of three functions f1, f2, f3 mapping and check if f1(x) + f2(y) = f3(x + y). We analyze this test for two cases: (1) G and H are arbitrary the consistency of multiple functions. Given a triple of functions f1, f2, f3 : G H, we say that they are "linear
A linear induction motor conveyer
Solinsky, Kenneth Sheldon
1973-01-01T23:59:59.000Z
A LINEAR INCUCTION MOTOR CONVEYER A Thesis Kenneth Sheldon. Solinsky Submitted to the Graduate College of Texas AkM University in partial fulfillment of the requirement for the degree of MASTER 07 SCIENCE May 1973 Major Subject: Industrial.... Howie, USAMC-ITC-P/P, Red River Army Depot, Texarkana, Texas 75501. Approved owxe, xe , ro uc o uction Engineering For the Commander ne , grec or, I A LINEAR INDUCTION MOTOR CONVEYER A Thesis by Kenneth Sheldon Solinsky App ved as to style...
BASHIR et al.: GAIT REPRESENTATION USING FLOW FIELDS 1 Gait Representation Using Flow Fields
Gong, Shaogang
the human body configuration (e.g. 2D/3D skeletons) and the model parameters estimated over time encode approaches such as Gait Energy Image (GEI) and Motion Silhouettes Image (MSI) capture only the motion inten unchanged freely in print or electronic forms. #12;2 BASHIR et al.: GAIT REPRESENTATION USING FLOW FIELDS
Reisslein, Martin
Teaching With Concrete and Abstract Visual Representations: Effects on Students' Problem Solving/or abstract visual problem representa- tions during instruction on students' problem-solving practice, near outperformed Groups A and C on problem-solving practice in Experiments 1 and 2 and outperformed Group C
Representations of spectral coordinates in FITS
E. W. Greisen; M. R. Calabretta; F. G. Valdes; S. L. Allen
2005-10-07T23:59:59.000Z
Greisen & Calabretta describe a generalized method for specifying the coordinates of FITS data samples. Following that general method, Calabretta & Greisen describe detailed conventions for defining celestial coordinates as they are projected onto a two-dimensional plane. The present paper extends the discussion to the spectral coordinates of wavelength, frequency, and velocity. World coordinate functions are defined for spectral axes sampled linearly in wavelength, frequency, or velocity, linearly in the logarithm of wavelength or frequency, as projected by ideal dispersing elements, and as specified by a lookup table.
Looking for strong polynomiality in Linear Programming : Arguments ...
peter bruijs
2015-01-06T23:59:59.000Z
sequence has an exponential length measured in terms of m and n, thereby refuting strong ..... room for one new single variable to enter the basis, while in the gradient concept presented .... the new search space locally left for improvement.
Tools for primal degenerate linear programs: IPS, DCA, and PE
2014-10-01T23:59:59.000Z
the selection of a compatible variable to enter the basis ensures a nondegenerate pivot, PE .... At the heart of this framework lies the search for so-
Non-Linear Stochastic Fractional Programming Model of Financial ...
2005-04-19T23:59:59.000Z
of financial derivatives- II, Proceedings of International Conference on Business ... optimum allocation of recruitment in manpower planning, International Journal
Sequential Linear Programming Coordination Strategy for Deterministic and Probabilistic
Papalambros, Panos
electric fuel cell vehicle design model, including enterprise, powertrain, fuel cell and battery models using an L norm to measure deviations between targets and responses. A subproblem suspension strategy on trust region and target value step size. A global convergence proof of the SLP-based coordination
Short Communication: A Linear Programming Approach for the ...
2008-09-19T23:59:59.000Z
Baker, D., Sali, A.: Protein structure prediction and structural genomics. Sci- ence 294(5540), 93–96 (2001). 2. Bennett, C.H.: Efficient estimation of free energy ...
Transient Analysis of Linear Circuits using Constraint Logic Programming
Shankar, A.; Gilbert, D.
Shankar,A. Gilbert,D. Jampel,M. Proceedings of PACT96: Practical Application of Constraint Technology, The Practical Applications Company Ltd pp 221-247 Academic Press
mixed zero-one linear programs under objective uncertainty
2010-10-28T23:59:59.000Z
In the shortest path context, this is a lower bound along the lines of the Lyons et al. .... and the entire feasible region as L?{0,1}B. The problem of interest is. (P).
A new method for solving linear fractional programming problems By ...
Administrator
2007-03-27T23:59:59.000Z
financial and corporate planning, health care and hospital planning. Several methods to solve this problem are proposed in (1962), Charnes and Kooper have
How bad is a gradient algorithm for linear programming?
peter
2011-04-20T23:59:59.000Z
Apr 20, 2011 ... Page 1 ... Don't simplex and interior point methods too follow a path of ... The question now is: what can be derived from the characteristics ...
A strong polynomial gradient algorithm in Linear Programming
peter bruijs
2015-03-31T23:59:59.000Z
Page 1 ... Karmarkar don't have the strong characteristic. ... Probably he had no notion of the concept of a convex space, so that is what will have to be .... For the best direction that is left now, one has to exclude from the gradient c exactly and.
Large-Scale Linear Programming Techniques for the Design of ...
2002-02-05T23:59:59.000Z
Feb 5, 2002 ... Page 1 ... We present large-scale optimization techniques to model the energy function that underlies the folding process of ..... which we will refer to from now on, we get a system. AT y ? b, ... Although we don't want to rule out that a so- ..... What we believe is interesting in this context is that the results from.
Linear Dynamic Programs for Resource Management Marek Petrik
Zilberstein, Shlomo
observable MDPs (POMDPs). We show that the LDP framework makes it possible to adapt point-based methods a river reservoir to produce hydroelectric power. Among renewable sources, hydroelectricity has the lowest carbon footprint per MWh and is the most signifi- cant source of renewable energy, supplying about 20
Scheduling Smart Home Appliances Using Mixed Integer Linear Programming
Johansson, Karl Henrik
incentives such as time-varying electricity tariff (e.g. spot pricing [1]), or CO2 footprint Research (SSF) and the Knut and Alice Wallenberg Foundation. project [2]). An illustration of spot price. Electricity tariff (spot price) for New York City on February 15th, 2011. Data taken from NYISO. The web
A Pivoting Algorithm for Linear Programs with Complementarity ...
2009-10-27T23:59:59.000Z
Oct 27, 2009 ... rithm always finds a minimizer or an unbounded descent search direction in a .... Remark 2.1 An equivalent statement in terms of multipliers is that for all P?D(x) .... The index r indicates the constraint to enter the working set.
Protein Helical Topology Prediction Using Mixed-Integer Linear Programming
Singh, Jaswinder Pal
Allister Department of Chemical Engineering Princeton University The protein folding problem represents one enhances the ASTRO-FOLD protein folding approach of Klepeis and Floudas (2003), which finds the structure
Exercise 1. Let (P) be the following linear program
Rapaport, Iván
of G such that eM c(e) is minimum.Fr A company of petrol wishes to explore oil reservoirs. Once petrol. At this point individual oil traps (target) can be specified more precisely. In most situations
An elementary proof of optimality conditions for linear programming
Anders Forsgren
2008-06-30T23:59:59.000Z
Jun 30, 2008 ... ... Report TRITA-MAT-2008-OS6, Department of Mathematics, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden, June 2008.
Chance Constrained Mixed Integer Program: Bilinear and Linear ...
2014-05-31T23:59:59.000Z
Dept. of Industrial and Management Systems Engineering. University of South Florida. Tampa ...... records the computational time in seconds. If the algorithm is.
Linear Programming Uses for Recycling and Product Reuse
Nagurney, Anna
;Reverse Logistics Returns/ Damaged Product Recycling of waste materials Reuse of product components #12
Linear programming optimization for aquifer influence functions on microcomputers
Brown, Don L
1989-01-01T23:59:59.000Z
al. 's LP matrices were large and sparse (only 34 of the elements were non-zero) and were solved on main frame computers with use of a modified simplex LP method. The purpose of this work is to investigate the use of different LP methods... for increasing operating speed and efficient computer storage with the AIF p~ on micraccmputers. Three LP methods were investigated on microoczrputers using the AIF p~: (I) the simplex method, (2) the revised simplex methcd, and (3) the symmetric msthcd. Each...
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo
2014-01-01T23:59:59.000Z
of a 1 MW molten carbonate fuel cell. Both are in the Santaand a 1 MW molten carbonate fuel cell (MCFC) operating as a
A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 1 ...
2007-10-15T23:59:59.000Z
Project 10371017 supported by National Natural Science Foundation of China. 1 .... 1http://www-fp.mcs.anl.gov/otc/Guide/TestProblems/LPtest/.
a nonstandard simplex algorithm for linear programming 1.
2008-12-29T23:59:59.000Z
Project 10871043 supported by National Natural Science Foundation of China. 1 ..... 1http://www-fp.mcs.anl.gov/otc/Guide/TestProblems/LPtest/.
Calmness of linear programs under perturbations of all data ...
2014-06-18T23:59:59.000Z
mapping, as well as an operative upper bound for the corresponding calmness ... son [20], since the Karush#Kunh#Tucker conditions allow us to express the.
Objective space for multiple objectives linear fractional programming ...
Administrator
2007-04-12T23:59:59.000Z
May 2, 2007 ... considered this problem and presented a simplex –based solution procedure to find all ... Geoffrion in his article introduced the notion of proper.
Toward portable programming of numerical linear algebra on manycore nodes.
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,SeparationConnect1.08]Te[subscriptM-PACEResponses to a WarmingtopologicalConference: Toward(Conference) |
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo
2014-01-01T23:59:59.000Z
significant impact on both energy and demand costs, althoughtariffs for both energy and power demand incurs significant0) = 4 Total energy costs TOU charges Demand charges Average
Robust Distributed Control of Networked Systems with Linear Programming Objectives /
Richert, Dean, M.
2014-01-01T23:59:59.000Z
Assistive Robotics and Mechatronics, [52] B. Johansson, T.Advanced Intelligent Mechatronics, Montr´eal, Canada, 2010,
Constraint Reduction for Linear Programs with Many Inequality ...
2005-11-07T23:59:59.000Z
each iteration, rather than being updated in a build-up/build-down fashion. ...... convex or quasiconvex feasibility problems, Large Scale Optimization: State of ...
Higher-order Linear Logic Programming of Categorial Deduction
Morrill, Glyn
Llenguatges i Sistemes Inform`atics Universitat Polit`ecnica de Catalunya for multimodal hybrid formulations; unification must be carried out accord- ing to the structural axioms
Student Internship Programs Program Description
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Student Internship Programs Program Description The objective of the Laboratory's student internship programs is to provide students with opportunities for meaningful hands- on...
Optimal Unravellings for Feedback Control in Linear Quantum Systems
H. M . Wiseman; A. C. Doherty
2005-02-26T23:59:59.000Z
For quantum systems with linear dynamics in phase space much of classical feedback control theory applies. However, there are some questions that are sensible only for the quantum case, such as: given a fixed interaction between the system and the environment what is the optimal measurement on the environment for a particular control problem? We show that for a broad class of optimal (state-based) control problems (the stationary Linear-Quadratic-Gaussian class), this question is a semi-definite program. Moreover, the answer also applies to Markovian (current-based) feedback.
EMERGENT PHENOMENA IN GENETIC PROGRAMMING1 LEE ALTENBERG
Altenberg, Lee
EMERGENT PHENOMENA IN GENETIC PROGRAMMING1 LEE ALTENBERG Institute of Statistics and Decision various emergent phenomena, primary of which is adaptation. In genetic programming, because and representations can emerge from the population dynamics. A review of ideas on these phenomena is presented
Typing Illegal Information Flows as Program Effects Draft
Typing Illegal Information Flows as Program Effects Draft Ana Almeida Matos Instituto de. To this end, sets of illegal information flows are represented as downward closure operators (here referred representations of flexible information flow policies. Illegal information flows can then be seen as program
Improving Static Analysis Accuracy on Concurrent Ada Programs
Massachusetts at Amherst, University of
Improving Static Analysis Accuracy on Concurrent Ada Programs: Complexity Results and Empirical presents several techniques for improving the accuracy of static analysis of concurrent Ada programs. We the complexity of performing analysis on those representations. Inaccuracies in the static analysis are reflected
Burdik, Cestmir
2011-01-01T23:59:59.000Z
We derive non-linear commutator HS symmetry algebra, which encode unitary irreducible representations of AdS group subject to Young tableaux $Y(s_1,...,s_k)$ with $k\\geq 2$ rows on $d$-dimensional anti-de-Sitter space. Auxiliary representations for specially deformed non-linear HS symmetry algebra in terms of generalized Verma module in order to additively convert a subsystem of second-class constraints in the HS symmetry algebra into one with first-class constraints are found explicitly for the case of HS fields for $k=2$ Young tableaux. The oscillator realization over Heisenberg algebra for obtained Verma module is constructed. The results generalize the method of auxiliary representations construction for symplectic $sp(2k)$ algebra used for mixed-symmetry HS fields on a flat spaces and can be extended on a case of arbitrary HS fields in AdS-space. Gauge-invariant unconstrained reducible Lagrangian formulation for free bosonic HS fields with generalized spin $(s_1,s_2)$ is derived.
Linear conic optimization for nonlinear optimal control
Didier Henrion
2014-07-07T23:59:59.000Z
Jul 7, 2014 ... Abstract: Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists ...
Nonserial dynamic programming and local decomposition ...
2006-03-23T23:59:59.000Z
every assignment to x2 and x3, compute the value of x1 for which: h1(x2,x3) .... Consider the integer linear programming problem Z with binary variables: z = cT x ...
Bilevel Programming and the Separation Problem
2013-01-23T23:59:59.000Z
Mar 26, 2012 ... Department of Industrial and Systems Engineering, Lehigh University, USA ... Department of Mathematics and Computer Science, TU Eindhoven, The ... tive method for solving generic mixed integer linear programs (MILPs).
Reality - an emerging representation of the world
Martin A. Green
2009-03-11T23:59:59.000Z
Some unique source -- the world, W -- must underlie all the information realized in the universe throughout time. Perceived reality, R, is a progressively emerging representation of W in the form of the geometrical universe. Time corresponds to the process of emergence. When first represented in R, information about W is expressed in a non-localized, quantum manner. As the emergence proceeds, most information becomes inaccessible (entropy), supporting the robust, redundant encoding of accessible records. The past is encoded in and inferred from present records; the anticipated future will preserve present information and reveal unpredictable new information about W. Emergence of the future demands non-unitary reduction of quantum states and increased Kolmogorov complexity of the quasi-classical records in terms of which the quantum states are known. Given the limited information content of records, the quasi-classical universe lacks fine details; whereas the future must be uncertain to admit new information.
A representation formula for maps on supermanifolds
Helein, Frederic [Institut de Mathematiques de Jussieu, UMR 7586, Universite Denis Diderot-Paris 7, Case 7012, 2 place Jussieu, 75251 Paris Cedex 5 (France)
2008-02-15T23:59:59.000Z
We analyze the notion of morphisms of rings of superfunctions which is the basic concept underlying the definition of supermanifolds as ringed spaces (i.e., following Berezin, Leites, Manin, etc.). We establish a representation formula for all (pull-back) morphisms from the algebra of functions on an ordinary manifolds to the superalgebra of functions on an open subset of a superspace. We then derive two consequences of this result. The first one is that we can integrate the data associated with a morphism in order to get a (nonunique) map defined on an ordinary space (and uniqueness can be achieved by restriction to a scheme). The second one is a simple and intuitive recipe to compute pull-back images of a function on a manifold M by a map from a superspace to M.
Augustine, C.
2011-10-01T23:59:59.000Z
The U.S. Department of Energy (DOE) Geothermal Technologies Program (GTP) tasked the National Renewable Energy Laboratory (NREL) with conducting the annual geothermal supply curve update. This report documents the approach taken to identify geothermal resources, determine the electrical producing potential of these resources, and estimate the levelized cost of electricity (LCOE), capital costs, and operating and maintenance costs from these geothermal resources at present and future timeframes under various GTP funding levels. Finally, this report discusses the resulting supply curve representation and how improvements can be made to future supply curve updates.
High dimensional linear inverse modelling
Cooper, Fenwick C
2015-01-01T23:59:59.000Z
We introduce and demonstrate two linear inverse modelling methods for systems of stochastic ODE's with accuracy that is independent of the dimensionality (number of elements) of the state vector representing the system in question. Truncation of the state space is not required. Instead we rely on the principle that perturbations decay with distance or the fact that for many systems, the state of each data point is only determined at an instant by itself and its neighbours. We further show that all necessary calculations, as well as numerical integration of the resulting linear stochastic system, require computational time and memory proportional to the dimensionality of the state vector.
Highly linear low noise amplifier
Ganesan, Sivakumar
2007-09-17T23:59:59.000Z
VgVgVgi (4) Where gm1 is its transconductance, gm2 represents its second order non-linearity obtained by the second order derivative of FET transfer characteristics (Id-Vgs) and gm3 is its third order non-linearity obtained by the third order... for the above mentioned currents are given below. 3 3213 2 21211 3 3 3 3 2 21 *),,(*),(*)( xxxBAout BbB AaAaAaA VsssCVssCVsCiii Vgi VgVgVgi ++=+= = ++= (14) Where g1a represents the transconductance of the main amplifier and g2a and g3a represent the second...
Program School/ Career: Descripton ISIS Program Codes
Wisconsin at Madison, University of
Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School;Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School/ College 1
PURE MATHEMATICS Representation theory(Baranov, Pirashvili, Snashall)
and theoretical physics. Much of the development of modern representation theory was motivated by representations'. A surprising amount of classical ge- ometric techniques and concepts (such as smoothness, homo- geneous spaces mathematical notion has its roots in mathematical physics, in particular exactly soluble models of statistical
2004-09-16 | Greg Jane 1 Semantic representation
Janée, Greg
2004-09-16 | Greg Janée 1 Semantic representation · Semantic definitions explicit representations property rights programmatic interpretation would be beneficial · Here's a common framework for both #12;2004-09-16 | Greg Janée 2 Archival item facets · (Identifier) · Metadata · Data · Intellectual property rights #12;2004
Document Representation and Query Expansion Models for Blog Recommendation
Callan, Jamie
Document Representation and Query Expansion Models for Blog Recommendation Jaime Arguello document representation models and two query expansion models for the task of recommend- ing blogs to a user in response to a query. Blog relevance ranking differs from traditional document ranking in ad
Deep Learning Representation using Autoencoder for 3D Shape Retrieval
benchmarks. I. INTRODUCTION With the fast development of 3D printer, Microsoft Kinect sensor and laserDeep Learning Representation using Autoencoder for 3D Shape Retrieval Zhuotun Zhu, Xinggang Wang@hust.edu.cn Abstract--We study the problem of how to build a deep learning representation for 3D shape. Deep learning
Closing the Learning-Planning Loop with Predictive State Representations
Guestrin, Carlos
Closing the Learning-Planning Loop with Predictive State Representations Byron Boots Machine and sta- tistically consistent spectral algorithm for learning the pa- rameters of a Predictive State the essential features of the environment. This representation allows accurate prediction with a small number
SEMANTIC DATA INTEGRATION IN A MULTIPLE REPRESENTATION ENVIRONMENT
KĂ¶bben, Barend
SEMANTIC DATA INTEGRATION IN A MULTIPLE REPRESENTATION ENVIRONMENT J.E. Stotera , R.L.G. Lemmensa: Semantic data integration, Multi Representation Database, Generalisation, ontologies, machine ontology at the different scales are semantically integrated, 2) objects in the different scales representing the same real
Bringing Together Human and Robotic Environment Representations A Pilot Study
Bringing Together Human and Robotic Environment Representations A Pilot Study Elin A. Topp, Helge and Communication (CSC) Royal Institute of Technology (KTH) 10044 Stockholm, Sweden Email: {topp,hehu,hic,kse}@csc.kth.se Abstract-- Human interaction with a service robot requires a shared representation of the environment
Fast Multipole Representation of Diffusion Curves and Points Timothy Sun
Grinspun, Eitan
Fast Multipole Representation of Diffusion Curves and Points Timothy Sun Papoj Thamjaroenporn performed on the fast multipole representation. Abstract We propose a new algorithm for random-access evaluation of diffu- sion curve images (DCIs) using the fast multipole method. Unlike all previous methods
Using Graphical Representations to Support the Calculation of Infusion Parameters
Subramanian, Sriram
Using Graphical Representations to Support the Calculation of Infusion Parameters Sandy J. J. Gould in which participants were asked to solve a num- ber of infusion parameter problems that were represented representations transfer to actual workplace settings. Keywords: Graphical reasoning, infusion pumps, re
Systematic Approach to the Design of RepresentationChanging Algorithms
Fink, Eugene
The performance of all problemsolving sys tems depends crucially on problem representa tion. The same problem representation in an AI problemsolving system is the input to the system. In most problem solving systems problemsolving systems de pends crucially on problem representation. The same problem may be easy or di
STUDENT LEARNING ASSESSMENT PROGRAM ARCHITECTURE: POST-PROFESSIONAL MASTER OF ARCHITECTURE
Walter, M.Todd
1 STUDENT LEARNING ASSESSMENT PROGRAM ARCHITECTURE: POST-PROFESSIONAL MASTER OF ARCHITECTURE M technological, social and economic forces are influencing architectural design, research, practice and pedagogy and/or advanced representational and/or fabrication techniques used in architectural design
PhD Program in Bioengineering and Curriculum Cognitive Robotics, Interaction and
Robbiano, Lorenzo
1 PhD Program in Bioengineering and Robotics Curriculum Cognitive Robotics, Interaction. MUTUAL UNDERSTANDING IN HUMAN ROBOT INTERACTION .................................................11 9 ................................................................................................................12 10. THE CONTROL AND REPRESENTATION OF ARTICULATED OBJECTS: INSIGHTS FROM ROBOTS
PhD Program in Bioengineering and Curriculum Robotics and Autonomous Systems
Robbiano, Lorenzo
1 PhD Program in Bioengineering and Robotics Curriculum Robotics and Autonomous Systems Research. BIOLOGICALLY INSPIRED APPROACHES TO PERCEPTION, KNOWLEDGE REPRESENTATION AND ACTION IN ROBOTICS .............................................................................................................................3 3. HETEROGENEOUS ROBOTS CAPABLE OF AUTONOMOUS BEHAVIOR IN COMPLEX, UNSTRUCTURED ENVIRONMENTS
2Q CY2001 (PDF), Facility Representative Program Performance Indicators Quarterly Report
Broader source: Energy.gov [DOE]
The Facility Representive Program Performance Indicators (PIs) Quarterly Report is attached covering the period from April to June 2001. Data for these indicators are gathered by the Field elements...
On the representation of many-body interactions in water
Medders, Gregory R; Morales, Miguel A; Paesani, Francesco
2015-01-01T23:59:59.000Z
Recent work has shown that the many-body expansion of the interaction energy can effectively be used to develop analytical representations of global potential energy surfaces (PESs) for water. In this study, the role of short- and long-range contri- butions at different orders is investigated by analyzing water potentials that treat the leading terms of the many-body expansion through implicit (i.e., TTM3-F and TTM4-F PESs) and explicit (i.e., WHBB and MB-pol PESs) representations. It is found that explicit short-range representations of 2-body and 3-body interactions along with a physically correct integration of short- and long-range contributions are necessary for an accurate representation of the water interactions from the gas to the condensed phase. Similarly, a complete many-body representation of the dipole moment surface is found to be crucial to reproducing the correct intensities of the infrared spectrum of liquid water.
Linear electric field mass spectrometry
McComas, D.J.; Nordholt, J.E.
1992-12-01T23:59:59.000Z
A mass spectrometer and methods for mass spectrometry are described. The apparatus is compact and of low weight and has a low power requirement, making it suitable for use on a space satellite and as a portable detector for the presence of substances. High mass resolution measurements are made by timing ions moving through a gridless cylindrically symmetric linear electric field. 8 figs.
Linear regression issues in astronomy
Babu, G. Jogesh
Linear regression issues in astronomy Eric Feigelson Summer School in astrostatistics References regression Seeking the intrinsic relationship between two properties without specifying `dependent' and `independent' variables OLS(Y|X) OLS(X|Y) (inverse regr) Four symmetrical regression lines #12;Analytical
Design and performance of the Stanford Linear Collider Control System
Melen, R.E.
1984-10-01T23:59:59.000Z
The success of the Stanford Linear Collider (SLC) will be dependent upon the implementation of a very large advanced computer-based instrumentation and control system. This paper describes the architectural design of this system as well as a critique of its performance. This critique is based on experience obtained from its use in the control and monitoring of 1/3 of the SLAC linac and in support of an expensive experimental machine physics experimental program. 11 references, 3 figures.
Sikes, Derek S.
MATH F314-F71 Linear Algebra Summer 2014 Instructor: Dr. Dana E. Madison, demadison2@alaska is by email. Class Dates and Times: July 7 August 14, 12:00pm 1:50pm Textbook: Linear Algebra and its: This is a first course in linear algebra that starts with the basic objects vectors, matrices, systems of linear
Fast exact linear algebra, LinBox
Pernet, Clément
Fast exact linear algebra, LinBox Clément Pernet Introduction LinBox: an overview Principles-place eliminations Fast matrix multiplication Linear algebra over big integers Fast exact linear algebra: LinBox Clément PERNET SAGE Days 6, November 11, 2007 #12;Fast exact linear algebra, LinBox Clément Pernet
PROCESS CONTROLLABILITY ANALYSIS USING LINEAR AND NONLINEAR
Skogestad, Sigurd
PROCESS CONTROLLABILITY ANALYSIS USING LINEAR AND NONLINEAR OPTIMISATION Samara D. Chenery October linear and nonlinear dynamic optimisation techniques. For the linear case an optimal control problem is formulated to assess the best achievable performance for the set of linear time invariant (LTI) controllers
Why quantum dynamics is linear
Thomas F. Jordan
2007-02-16T23:59:59.000Z
Quantum dynamics is linear. How do we know? From theory or experiment? The history of this question is reviewed. Nonlinear generalizations of quantum mechanics have been proposed. They predict small but clear nonlinear effects, which very accurate experiments have not seen. Is there a reason in principle why nonlinearity is not found? Is it impossible? Does quantum dynamics have to be linear? Attempts to prove this have not been decisive, because either their assumptions are not compelling or their arguments are not conclusive. The question has been left unsettled. There is a simple answer, based on a simple assumption. It was found in two steps separated by 44 years. They are steps back to simpler and more compelling assumptions. A proof of the assumptions of the Wigner-Bargmann proof has been known since 1962. It assumes that the maps of density matrices in time are linear. For this step, it is also assumed that density matrices are mapped one-to-one onto density matrices. An alternative is to assume that pure states are mapped one-to-one onto pure states and that entropy does not decrease. In a step taken in 2006, it is proved that the maps of density matrices in time are linear. It is assumed, as in the earlier step, that at each time the physical quantities and states are described by the usual linear structures of quantum mechanics, so the question is only about how things change in time. Beyond that, the proof assumes only that the dynamics does not depend on anything outside the system, but must allow the system to be described as part of a larger system.
Operator algebras and conformal eld theory III. Fusion of positive energy representations
Proudfoot, Nicholas
Operator algebras and conformal ®eld theory III. Fusion of positive energy representations of LSU ........................................................................ 513 V. Connes fusion of positive energy representations. (4) A computable and manifestly unitary de®nition of fusion for positive energy representations
An introduction to GUGA in the COLUMBUS Program System
Shepard, R.
1992-12-31T23:59:59.000Z
The COLUMBUS Program System is a collection of Fortran programs for performing general multiconfiguration self-consistent-field (MCSCF) and multireference single- and doubele-exicitation configuration interaction (MRSDCI) wave function optimization based on the graphical unitary group approach (GUGA). This paper describes at an introductory level how wave functions are specified and characterized in the COLUMBUS Program System in terms of the unitary group, and in particular, using the graphical representation proposed by Shavitt.
Set Linear Algebra and Set Fuzzy Linear Algebra
W. B. Vasantha Kandasamy; Florentin Smarandache; K. Ilanthenral
2008-06-17T23:59:59.000Z
In this book, the authors define the new notion of set vector spaces which is the most generalized form of vector spaces. Set vector spaces make use of the least number of algebraic operations, therefore, even a non-mathematician is comfortable working with it. It is with the passage of time, that we can think of set linear algebras as a paradigm shift from linear algebras. Here, the authors have also given the fuzzy parallels of these new classes of set linear algebras. This book is divided into seven chapters. The first chapter briefly recalls some of the basic concepts in order to make this book self-contained. Chapter two introduces the notion of set vector spaces which is the most generalized concept of vector spaces. Set vector spaces lends itself to define new classes of vector spaces like semigroup vector spaces and group vector spaces. These are also generalization of vector spaces. The fuzzy analogue of these concepts are given in Chapter three. In Chapter four, set vector spaces are generalized to biset bivector spaces and not set vector spaces. This is done taking into account the advanced information technology age in which we live. As mathematicians, we have to realize that our computer-dominated world needs special types of sets and algebraic structures. Set n-vector spaces and their generalizations are carried out in Chapter five. Fuzzy n-set vector spaces are introduced in the sixth chapter. The seventh chapter suggests more than three hundred problems.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1997-08-21T23:59:59.000Z
This volume describes program administration that establishes and maintains effective organizational management and control of the emergency management program. Canceled by DOE G 151.1-3.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Experience, is a unique educational program designed to introduce students in geophysics and related fields to "hands on" geophysical exploration and research. The program...
Graph representation of protein free energy landscape
Li, Minghai; Duan, Mojie; Fan, Jue; Huo, Shuanghong, E-mail: shuo@clarku.edu [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Gustaf H. Carlson School of Chemistry and Biochemistry, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States); Han, Li [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)] [Department of Mathematics and Computer Science, Clark University, 950 Main Street, Worcester, Massachusetts 01610 (United States)
2013-11-14T23:59:59.000Z
The thermodynamics and kinetics of protein folding and protein conformational changes are governed by the underlying free energy landscape. However, the multidimensional nature of the free energy landscape makes it difficult to describe. We propose to use a weighted-graph approach to depict the free energy landscape with the nodes on the graph representing the conformational states and the edge weights reflecting the free energy barriers between the states. Our graph is constructed from a molecular dynamics trajectory and does not involve projecting the multi-dimensional free energy landscape onto a low-dimensional space defined by a few order parameters. The calculation of free energy barriers was based on transition-path theory using the MSMBuilder2 package. We compare our graph with the widely used transition disconnectivity graph (TRDG) which is constructed from the same trajectory and show that our approach gives more accurate description of the free energy landscape than the TRDG approach even though the latter can be organized into a simple tree representation. The weighted-graph is a general approach and can be used on any complex system.
The momentum map representation of images
M. Bruveris; F. Gay-Balmaz; D. D. Holm; T. S. Ratiu
2015-04-08T23:59:59.000Z
This paper discusses the mathematical framework for designing methods of large deformation matching (LDM) for image registration in computational anatomy. After reviewing the geometrical framework of LDM image registration methods, a theorem is proved showing that these methods may be designed by using the actions of diffeomorphisms on the image data structure to define their associated momentum representations as (cotangent lift) momentum maps. To illustrate its use, the momentum map theorem is shown to recover the known algorithms for matching landmarks, scalar images and vector fields. After briefly discussing the use of this approach for Diffusion Tensor (DT) images, we explain how to use momentum maps in the design of registration algorithms for more general data structures. For example, we extend our methods to determine the corresponding momentum map for registration using semidirect product groups, for the purpose of matching images at two different length scales. Finally, we discuss the use of momentum maps in the design of image registration algorithms when the image data is defined on manifolds instead of vector spaces.
Gheorghe Mihai
2010-02-12T23:59:59.000Z
In this paper, a new mathematical method of electrical circuits calculus is proposed based on the theory of the complex linear operators in matrix form. The newly proposed method generalizes the theory of complex representation of electrical quantities in sinusoidal periodic regime to the non-sinusoidal periodic regime.
Linearized supergravity from Matrix theory
D. Kabat; W. Taylor
1998-03-10T23:59:59.000Z
We show that the linearized supergravity potential between two objects arising from the exchange of quanta with zero longitudinal momentum is reproduced to all orders in 1/r by terms in the one-loop Matrix theory potential. The essential ingredient in the proof is the identification of the Matrix theory quantities corresponding to moments of the stress tensor and membrane current. We also point out that finite-N Matrix theory violates the equivalence principle.
Precision linear ramp function generator
Jatko, W. Bruce (Knoxville, TN); McNeilly, David R. (Maryville, TN); Thacker, Louis H. (Knoxville, TN)
1986-01-01T23:59:59.000Z
A ramp function generator is provided which produces a precise linear ramp unction which is repeatable and highly stable. A derivative feedback loop is used to stabilize the output of an integrator in the forward loop and control the ramp rate. The ramp may be started from a selected baseline voltage level and the desired ramp rate is selected by applying an appropriate constant voltage to the input of the integrator.
Precision linear ramp function generator
Jatko, W.B.; McNeilly, D.R.; Thacker, L.H.
1984-08-01T23:59:59.000Z
A ramp function generator is provided which produces a precise linear ramp function which is repeatable and highly stable. A derivative feedback loop is used to stabilize the output of an integrator in the forward loop and control the ramp rate. The ramp may be started from a selected baseline voltage level and the desired ramp rate is selected by applying an appropriate constant voltage to the input of the integrator.
Segmented rail linear induction motor
Cowan, M. Jr.; Marder, B.M.
1996-09-03T23:59:59.000Z
A segmented rail linear induction motor has a segmented rail consisting of a plurality of nonferrous electrically conductive segments aligned along a guideway. The motor further includes a carriage including at least one pair of opposed coils fastened to the carriage for moving the carriage. A power source applies an electric current to the coils to induce currents in the conductive surfaces to repel the coils from adjacent edges of the conductive surfaces. 6 figs.
Cast dielectric composite linear accelerator
Sanders, David M. (Livermore, CA); Sampayan, Stephen (Manteca, CA); Slenes, Kirk (Albuquerque, NM); Stoller, H. M. (Albuquerque, NM)
2009-11-10T23:59:59.000Z
A linear accelerator having cast dielectric composite layers integrally formed with conductor electrodes in a solventless fabrication process, with the cast dielectric composite preferably having a nanoparticle filler in an organic polymer such as a thermosetting resin. By incorporating this cast dielectric composite the dielectric constant of critical insulating layers of the transmission lines of the accelerator are increased while simultaneously maintaining high dielectric strengths for the accelerator.
Accessible programming using program synthesis
Singh, Rishabh
2014-01-01T23:59:59.000Z
New computing platforms have greatly increased the demand for programmers, but learning to program remains a big challenge. Program synthesis techniques have the potential to revolutionize programming by making it more ...
Optimal Constructions of Fault Tolerant Optical Linear Compressors and Linear Decompressors
Chang, Cheng-Shang
1 Optimal Constructions of Fault Tolerant Optical Linear Compressors and Linear Decompressors Cheng linear compressors and linear decompressors. The basic network element for our constructions is scaled first obtain a fundamental result on the minimum con- struction complexity of a linear compressor
International linear collider reference design report
Aarons, G.
2007-06-22T23:59:59.000Z
The International Linear Collider will give physicists a new cosmic doorway to explore energy regimes beyond the reach of today's accelerators. A proposed electron-positron collider, the ILC will complement the Large Hadron Collider, a proton-proton collider at the European Center for Nuclear Research (CERN) in Geneva, Switzerland, together unlocking some of the deepest mysteries in the universe. With LHC discoveries pointing the way, the ILC -- a true precision machine -- will provide the missing pieces of the puzzle. Consisting of two linear accelerators that face each other, the ILC will hurl some 10 billion electrons and their anti-particles, positrons, toward each other at nearly the speed of light. Superconducting accelerator cavities operating at temperatures near absolute zero give the particles more and more energy until they smash in a blazing crossfire at the centre of the machine. Stretching approximately 35 kilometres in length, the beams collide 14,000 times every second at extremely high energies -- 500 billion-electron-volts (GeV). Each spectacular collision creates an array of new particles that could answer some of the most fundamental questions of all time. The current baseline design allows for an upgrade to a 50-kilometre, 1 trillion-electron-volt (TeV) machine during the second stage of the project. This reference design provides the first detailed technical snapshot of the proposed future electron-positron collider, defining in detail the technical parameters and components that make up each section of the 31-kilometer long accelerator. The report will guide the development of the worldwide R&D program, motivate international industrial studies and serve as the basis for the final engineering design needed to make an official project proposal later this decade.
Validi, AbdoulAhad, E-mail: validiab@msu.edu
2014-03-01T23:59:59.000Z
This study introduces a non-intrusive approach in the context of low-rank separated representation to construct a surrogate of high-dimensional stochastic functions, e.g., PDEs/ODEs, in order to decrease the computational cost of Markov Chain Monte Carlo simulations in Bayesian inference. The surrogate model is constructed via a regularized alternative least-square regression with Tikhonov regularization using a roughening matrix computing the gradient of the solution, in conjunction with a perturbation-based error indicator to detect optimal model complexities. The model approximates a vector of a continuous solution at discrete values of a physical variable. The required number of random realizations to achieve a successful approximation linearly depends on the function dimensionality. The computational cost of the model construction is quadratic in the number of random inputs, which potentially tackles the curse of dimensionality in high-dimensional stochastic functions. Furthermore, this vector-valued separated representation-based model, in comparison to the available scalar-valued case, leads to a significant reduction in the cost of approximation by an order of magnitude equal to the vector size. The performance of the method is studied through its application to three numerical examples including a 41-dimensional elliptic PDE and a 21-dimensional cavity flow.
Generating Tensor Representation from Concept Tree in Meaning Based Search
Panigrahy, Jagannath
2011-08-08T23:59:59.000Z
to a representation that can be stored and compared efficiently on computers. Meaning of objects can be adequately captured in terms of a hierarchical composition structure called concept tree. This thesis describes the design and development...
Ground state and functional integral representations of the CCR algebra
o#11;elholz, Berufsakademie, Leipzig G. Morchio, Dipartimento di Fisica, Universita' di Pisa and INFN, Pisa F. Strocchi Scuola Normale Superiore and INFN, Pisa Abstract The ground state representations
Variational sequences, representation sequences and applications in physics
M. Palese; O. Rossi; E. Winterroth; J. Musilova
2015-08-07T23:59:59.000Z
This paper is a review containing new original results on the finite order variational sequence and its different representations with emphasis on applications in the theory of variational symmetries and conservation laws in physics.
Containing the opposition : selective representation in Jordan and Turkey
Wakeman, Raffaela Lisette
2009-01-01T23:59:59.000Z
How does elite manipulation of election mechanisms affect the representation of political regime opponents? While the spread of elections has reached all the continents, the number of actual democracies has not increased ...
Generating Tensor Representation from Concept Tree in Meaning Based Search
Panigrahy, Jagannath
2011-08-08T23:59:59.000Z
to a representation that can be stored and compared efficiently on computers. Meaning of objects can be adequately captured in terms of a hierarchical composition structure called concept tree. This thesis describes the design and development...
An Executable Representation of Distance and Direction Richard Johnson
Pingali, Keshav K.
that permits imperative updates to memory. The dependence ow graph sub- sumes other representations between statements that 1This research was supported by an NSF Presidential Young Investigator award (NSF
Crystal Structure Representations for Machine Learning Models of Formation Energies
Faber, Felix; von Lilienfeld, O Anatole; Armiento, Rickard
2015-01-01T23:59:59.000Z
We introduce and evaluate a set of feature vector representations of crystal structures for machine learning (ML) models of formation energies of solids. ML models of atomization energies of organic molecules have been successful using a Coulomb matrix representation of the molecule. We consider three ways to generalize such representations to periodic systems: (i) a matrix where each element is related to the Ewald sum of the electrostatic interaction between two different atoms in the unit cell repeated over the lattice; (ii) an extended Coulomb-like matrix that takes into account a number of neighboring unit cells; and (iii) an Ansatz that mimics the periodicity and the basic features of the elements in the Ewald sum matrix by using a sine function of the crystal coordinates of the atoms. The representations are compared for a Laplacian kernel with Manhattan norm, trained to reproduce formation energies using a data set of 3938 crystal structures obtained from the Materials Project. For training sets consi...
Beyond pixels : exploring new representations and applications for motion analysis
Liu, Ce, Ph. D. Massachusetts Institute of Technology
2009-01-01T23:59:59.000Z
The focus of motion analysis has been on estimating a flow vector for every pixel by matching intensities. In my thesis, I will explore motion representations beyond the pixel level and new applications to which these ...
Karhunen-Loeve representation of stochastic ocean waves
Sclavounos, Paul D.
A new stochastic representation of a seastate is developed based on the Karhunen–Loeve spectral decomposition of stochastic signals and the use of Slepian prolate spheroidal wave functions with a tunable bandwidth parameter. ...
The Role of Knowledge in Visual Shape Representation
Saund, Eric
1988-10-01T23:59:59.000Z
This report shows how knowledge about the visual world can be built into a shape representation in the form of a descriptive vocabulary making explicit the important geometrical relationships comprising objects' shapes. ...
Data Representation for Efficient and Reliable Storage in Flash Memories
Wang, Yue
2013-05-02T23:59:59.000Z
. Solutions to these problems can significantly improve the longevity and performance of the storage systems based on flash memories. In this work, we explore several new data representation techniques for efficient and reliable data storage in flash memories...
Exploring an Unstructured Lattice Representation for Carbonate Reservoir Characterization
Pasumarti, Lakshmi
2014-05-19T23:59:59.000Z
Carbonates for flow simulation purposes are typically characterized as grid-blocks of varying permeability, with a finer grid employed where heterogeneity is greatest. However, this manner of representation is more suited to sandstone reservoirs...
LATINO DESCRIPTIVE REPRESENTATION IN LOCAL PUBLIC OFFICE IN TEXAS
Holstein, Carlos 1983-
2012-05-03T23:59:59.000Z
This purpose of this study is to document and evaluate descriptive Latino representation at the local level, over time, and as it relates to characteristics of the Latino population. This study has important implications, particularly within...
Stochastic Roadmap Simulation: Efficient Representation and Algorithms for
Brutlag, Doug
Stochastic Roadmap Simulation: Efficient Representation and Algorithms for the Analysis Roadmap Simulation (SRS) #12;Stochastic Roadmap Simulation (SRS) Multiple paths at once; #12;Stochastic Roadmap Simulation (SRS) Multiple paths at once; No local minimum problem; #12;Stochastic Roadmap
Inference in Probabilistic Logic Programs with Continuous Random Variables
Islam, Muhammad Asiful; Ramakrishnan, I V
2011-01-01T23:59:59.000Z
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al's ProbLog and Vennekens et al's LPAD, is aimed at combining statistical and logical knowledge representation and inference. A key characteristic of PLP frameworks is that they are conservative extensions to non-probabilistic logic programs which have been widely used for knowledge representation. PLP frameworks extend traditional logic programming semantics to a distribution semantics, where the semantics of a probabilistic logic program is given in terms of a distribution over possible models of the program. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use of random variables with continuous distributions. In this paper, we present a symbolic inference procedure that uses constraints and represents sets of explanations without enumeration. This permits us to reason over PLPs with Gaussian...
The Electronic Journal of Linear Algebra. A publication of the International Linear Algebra Society.
Grudsky, Sergei
The Electronic Journal of Linear Algebra. A publication of the International Linear Algebra Society. Introduction and main results. Let lp n 1 p 1 be the linear space C n with the lp norm, kxkp = X j jxjjp 1=p
Considering representational choices of fourth graders when solving division problems
Gilbert, Mary Chiles
2007-09-17T23:59:59.000Z
CONSIDERING REPRESENTATIONAL CHOICES OF FOURTH GRADERS WHEN SOLVING DIVISION PROBLEMS A Thesis by MARY CHILES GILBERT Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree... of MASTER OF SCIENCE May 2006 Major Subject: Curriculum & Instruction CONSIDERING REPRESENTATIONAL CHOICES OF FOURTH GRADERS WHEN SOLVING DIVISION PROBLEMS A Thesis by MARY CHILES GILBERT Submitted to the Office of Graduate...
Concise representation of the saturation properties for pure compounds
Borrelli, Leslie Kieffer
1982-01-01T23:59:59.000Z
CONCISE REPRESENTATION QF THE SATURATIQN PROPERTIES FQR PURE CQHPQUN DS A Thesis by LESLIE KIEFFER BQRRELLI Submitted to the Graduate College of Texas A&M University in partial fulfillment of the r equirement for the degree of NASTER... of Depa ent) May 1982 ABSTRACT CONCISE REPRESENTATION QF THE SATURATION PROPERTIES FOR PURE COMPOUNDS (May 1982) Leslie Kieffer Borrelli, B. S. , Texas ARM University Chair man of Advisor y Committee: Dr . Kenneth R. Hall Vapor pr essure...
Linear-quadratic control problem with a linear term on semiinfinite ...
2003-12-18T23:59:59.000Z
Dec 15, 2003 ... We describe a complete solution of the linear-quadratic control prob- lem on a semiinfinite interval with the linear term in the objective func-.
Proceedings of the International Linear Collider Workshop
Proceedings of the International Linear Collider Workshop LCWS 2007 ILC 2007 Volume 1 Edited by Ariane Frey Sabine Riemann #12;Impressum Proceedings of the International Linear Collider Workshop LCWS
Ultrashort Pulse Propagation in the Linear Regime
Wang, Jieyu
2010-07-14T23:59:59.000Z
First, we investigate the Bouguer-Lambert-Beer (BLB) law as applied to the transmission of ultrashort pulses through water in the linear absorption regime. We present a linear theory for propagation of ultrashort laser ...
MANEUVER REGULATION, TRANSVERSE FEEDBACK LINEARIZATION, AND ZERO
Maggiore, Manfredi
MANEUVER REGULATION, TRANSVERSE FEEDBACK LINEARIZATION, AND ZERO DYNAMICS Chris Nielsen,1 Manfredi focus is on output maneuver regulation where stabilizing transverse dynamics is a key requirement. Keywords: Maneuver regulation, path following, feedback linearization, zero dynamics, non-square systems
High speed linear induction motor efficiency optimization
Johnson, Andrew P. (Andrew Peter)
2005-01-01T23:59:59.000Z
One of the reasons linear motors, a technology nearly a century old, have not been adopted for a large number of linear motion applications is that they have historically had poor efficiencies. This has restricted the ...
Linear Regression and Support Vector Regression
Shi, Qinfeng "Javen"
Linear Regression and Support Vector Regression Paul Paisitkriangkrai paulp@cs.adelaide.edu.au The University of Adelaide 18 August 2014 #12;Outlines · Regression overview · Linear regression · Support vector regression · Machine learning tools available #12;Regression Overview CLUSTERING CLASSIFICATION REGRESSION
Linear Accelerator | Advanced Photon Source
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville PowerTariff Pages default Sign InCenter (LMI-EFRC) Hotel & TravelLimiting FactorsProjectsLinear
Seismic response of linear accelerators
Collette, C; Guinchard, M; Hauviller, C
2010-01-01T23:59:59.000Z
This paper is divided into two parts. The first part presents recent measurements of ground motion in the LHC tunnel at CERN. From these measurements, an update of the ground motion model currently used in accelerator simulations is presented. It contains new features like a model of the lateral motion and the technical noise. In the second part, it is shown how this model can be used to evaluate the seismic response of a linear accelerator in the frequency domain. Then, the approach is validated numerically on a regular lattice, taking the dynamic behavior of the machine alignment stage and the mechanical stabilization of the quadrupoles into account.
Stochastic bridges of linear systems
Yongxin Chen; Tryphon Georgiou
2014-07-12T23:59:59.000Z
We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed to have known states at the boundary. Thus, the movement of the particles can be modeled as an Ornstein-Uhlenbeck process conditioned on position and velocity measurements at the two end-points. It is shown that optimal stochastic control provides a stochastic differential equation (SDE) that generates such a bridge as a degenerate diffusion process. Generalizations to higher order linear diffusions are considered.
Barnett, Walter Joseph
1996-01-01T23:59:59.000Z
can be tailored independently for each degree-of-freedom. Circular cam shapes were seen to produce linear responses while other shapes produce non-linear restoring forces. The design of a program to predict a cam shape for a desired response...
Varying-Coefficient Functional Linear Regression Models
Cardot, Hervé
Varying-Coefficient Functional Linear Regression Models Herv´e Cardot1 and Pascal Sarda2 1, the ability of such non linear functional approaches to produce competitive estimations. Short title : Varying monograph. We propose here another generalization of the functional linear regression model in which
Computational Reality XIII Non-linear regression
Berlin,Technische Universität
Computational Reality XIII Non-linear regression Inverse analysis II B. Emek Abali @ LKM - TU Berlin Abstract Linear regression to fit and determine parameters, shown in the last tutorial, is quite useful and widely implemented, however, there are material models where parameters are coupled non-linearly
Depolarization of backscattered linearly polarized light
Lacoste, David
Depolarization of backscattered linearly polarized light Luis Fernando Rojas-Ochoa Department of backscattered linearly polarized light with an extended photon dif- fusion formalism taking explicitly, the characteristic depolarization length for linearly polarized light, lp , is deduced. We investigate the dependence
MINIMIZING COMMUNICATION IN NUMERICAL LINEAR ALGEBRA*
California at Berkeley, University of
MINIMIZING COMMUNICATION IN NUMERICAL LINEAR ALGEBRA* GREY BALLARD , JAMES DEMMEL , OLGA HOLTZ, i.e., essentially all direct methods of linear al- gebra. The proof works for dense or sparse our lower bound technique to compositions of linear algebra operations (like computing powers
Batch-mode Supervised Learning Linear regression
Wehenkel, Louis
Batch-mode Supervised Learning Linear regression Applied inductive learning - Lecture 3 Louis (& Pierre Geurts)AIA... (1/19) #12;Batch-mode Supervised Learning Linear regression Batch-mode Supervised Learning Linear regression Least mean square error solution Regularization and algorithmics Residual
Liu, Jian; Miller, William H.
2008-01-01T23:59:59.000Z
in a single phase space integral—beyond the linearizedreplace the phase space integral in Eq. (2.1) by a timeclassical dynamics of the path integral beads of the quantum
Separable nonlinear programming
Bunton, Wiley Ray
1963-01-01T23:59:59.000Z
and motor fuel 8 at $2. 85 per bbl. All raw stocks not blended into motor fuel with an octane number of 90 or more are sold for use in aviation gaso- lines at $2. 75 per bbl, and those of octane number 85 or less are sold at $1. 25 per bbl for use in fuel... it is desirable to get a basic understanding of a linear program- ming problem; hence?an example is given below. A small Gulf Coast refinery blends five raw stocks to produce two grades of motor fuel, . A and 8. The number of barrels per day of each raw stock...
Memory with memory: Soft assignment in Genetic Programming
Poli, Riccardo
Keywords Genetic Programming, Linear GP, Soft assignment, Memory with memory, Symbolic regressionMemory with memory: Soft assignment in Genetic Programming Nicholas Freitag McPhee Division was carried over to most versions of genetic programming (GP) that had state and assignments. This includes
Memory with Memory: Soft Assignment in Genetic Programming
Fernandez, Thomas
Keywords Genetic Programming, Linear GP, Soft assignment, Memory with memory, Symbolic regressionMemory with Memory: Soft Assignment in Genetic Programming Nicholas Freitag McPhee Division was carried over to most versions of genetic programming (GP) that had state and assignments. This includes
Finite element analyses of a linear-accelerator electron gun
Iqbal, M., E-mail: muniqbal.chep@pu.edu.pk, E-mail: muniqbal@ihep.ac.cn [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan); Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China); Wasy, A. [Department of Mechanical Engineering, Changwon National University, Changwon 641773 (Korea, Republic of)] [Department of Mechanical Engineering, Changwon National University, Changwon 641773 (Korea, Republic of); Islam, G. U. [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan)] [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan); Zhou, Z. [Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China)] [Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China)
2014-02-15T23:59:59.000Z
Thermo-structural analyses of the Beijing Electron-Positron Collider (BEPCII) linear-accelerator, electron gun, were performed for the gun operating with the cathode at 1000?°C. The gun was modeled in computer aided three-dimensional interactive application for finite element analyses through ANSYS workbench. This was followed by simulations using the SLAC electron beam trajectory program EGUN for beam optics analyses. The simulations were compared with experimental results of the assembly to verify its beam parameters under the same boundary conditions. Simulation and test results were found to be in good agreement and hence confirmed the design parameters under the defined operating temperature. The gun is operating continuously since commissioning without any thermal induced failures for the BEPCII linear accelerator.
Research and Development towards a Detector for a High Energy Electron-Positron Linear Collider
Bruce A. Schumm
2001-11-01T23:59:59.000Z
This exposition provides a detailed picture of ongoing and planned activities towards the development of a detector for a high-energy Linear Collider. Cases for which research and development activity does not exist, or needs to be bolstered, are identified for the various subsystems. The case is made that the full exploitation of the potential of a high-energy Linear Collider will require the augmentation of existing detector technology and simulation capability, and that this program should become a major focus of the worldwide particle physics community should the construction of a Linear Collider become likely.
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2005; 12:683
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2005; 12:683 Published Numerical Linear Algebra and its Applications The fourth workshop of the ERCIM Working Group on `Matrix Computations and Statistics' and the First International workshop on `Numerical Linear Algebra and its
ENGI 3423 Simple Linear Regression Page 12-01 Simple Linear Regression
George, Glyn
for dealing with non-linear regression are available in the course text, but are beyond the scopeENGI 3423 Simple Linear Regression Page 12-01 Simple Linear Regression Sometimes an experiment predict the value of Y for that value of x . The simple linear regression model is that the predicted
Optimal Linear Quadratic Regulator for Markovian Jump Linear Systems, in the
Baras, John S.
, in the last fifteen, the classical paradigms of optimal control for Markovian jump linear systems (see CostaOptimal Linear Quadratic Regulator for Markovian Jump Linear Systems, in the presence of one time] and in the design of controllers Chizeck [1986] of controllers for Markovian jump linear systems. More specifically
Kunkel, Peter
The linear quadratic optimal control problem for linear descriptor systems with variable coefficients Peter Kunkel 3 Volker Mehrmann y 17.01.97 Abstract We study linear quadratic optimal control, 93B11, 93B40 1 Introduction In this paper we study the linearÂquadratic optimal control problem
Reticle stage based linear dosimeter
Berger, Kurt W.
2005-06-14T23:59:59.000Z
A detector to measure EUV intensity employs a linear array of photodiodes. The detector is particularly suited for photolithography systems that includes: (i) a ringfield camera; (ii) a source of radiation; (iii) a condenser for processing radiation from the source of radiation to produce a ringfield illumination field for illuminating a mask; (iv) a reticle that is positioned at the ringfield camera's object plane and from which a reticle image in the form of an intensity profile is reflected into the entrance pupil of the ringfield camera, wherein the reticle moves in a direction that is transverse to the length of the ringfield illumination field that illuminates the reticle; (v) detector for measuring the entire intensity along the length of the ringfield illumination field that is projected onto the reticle; and (vi) a wafer onto which the reticle imaged is projected from the ringfield camera.
Reticle stage based linear dosimeter
Berger, Kurt W. (Livermore, CA)
2007-03-27T23:59:59.000Z
A detector to measure EUV intensity employs a linear array of photodiodes. The detector is particularly suited for photolithography systems that includes: (i) a ringfield camera; (ii) a source of radiation; (iii) a condenser for processing radiation from the source of radiation to produce a ringfield illumination field for illuminating a mask; (iv) a reticle that is positioned at the ringfield camera's object plane and from which a reticle image in the form of an intensity profile is reflected into the entrance pupil of the ringfield camera, wherein the reticle moves in a direction that is transverse to the length of the ringfield illumination field that illuminates the reticle; (v) detector for measuring the entire intensity along the length of the ringfield illumination field that is projected onto the reticle; and (vi) a wafer onto which the reticle imaged is projected from the ringfield camera.
A Graphic Representation of States for Quantum Copying Machines
Sara Felloni; Giuliano Strini
2006-09-29T23:59:59.000Z
The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear and detailed visualization of quantum information's flow during the unitary evolution of not too complex systems. The diagrams of states are exponentially more complex in respect to the standard representation and this clearly illustrates the discrepancy of computational power between quantum and classical systems. After a brief introductive exposure of the general theory, we present a constructive procedure to illustrate the new representation by means of concrete examples. Elementary diagrams of states for single-qubit and two-qubit systems and a simple scheme to represent entangled states are presented. Quantum copying machines as imperfect cloners of quantum states are introduced and the quantum copying machines of Griffiths and Niu and of Buzek and Hillery are analyzed, determining quantum circuits of easier interpretation. The method has indeed shown itself to be extremely successful for the representation of the involved quantum operations and it has allowed to point out the characteristic aspects of the quantum computations examined.
A study of linear programming and methods for programming the simplex method
Watson, Warren Wallace
1960-01-01T23:59:59.000Z
can express it ss a convex combination of the extreme points, i. e. X =p, X +p, X +. . . +p. X (2. 4) where 16 Let L (X) designate the objective function. L(X)=L(p. X tp. X k. . . f)t X) =N1L(X)t&2L(X 2)'4. . . tN L(X)? (2. 5) where m denotes... to m) i, n-m+1; iL a. = 0; (i = 1 to xn+ I) i, n-m+ 2 a 1 k n-m+2 kj a', = ?; (j = 1 to n-mkZ) kj a Kount = Kount + 1 a' . = a . - a. a' xj xj iL kj i = I to mal, (j = 1 to n-m+2) Punch: Kount, IB L JB a. =a. ; (x= 1 tom%i) iL i, n-m+2' IB...
Attendees by Program Program Total
Attendees by Program Program Total Unknown 167 Accountancy 1 Aerospace Engineering 31 Aerospace Engineering (Aeronautics) 60 Aerospace Engineering (Astronautics) 31 Aerospace Engineering (Autonomous Vehicle Systems) 1 Applied Mathematics for the Life and Social Sciences 1 Biochemistry 1 Biological Design 3
14Building a Runnable Program 14.2 Intermediate Forms
Weimer, Westley
. It is a medium-levelpseudo-assemblylanguage,andwasthebasisof almostalllanguage- independent code improvement can automatically construct routines to translate concrete instances of an abstract data type to and 1 as the standard representation of fragments of Ada code in a wider program development environment. Diana
Multi-Stage Bunch Compressors for the International Linear Collider
Tenenbaum, Peter G.; Raubenheimer, Tor O.; Wolski, Andrzej
2005-01-01T23:59:59.000Z
FOR THE INTERNATIONAL LINEAR COLLIDER ? P. Tenenbaum † ,goals, the International Linear Collider (ILC) requires acompressors for the International Linear Collider. Each of
Non-Linear Seismic Soil Structure Interaction (SSI) Method for...
Office of Environmental Management (EM)
Non-Linear Seismic Soil Structure Interaction (SSI) Method for Developing Non-Linear Seismic SSI Analysis Techniques Non-Linear Seismic Soil Structure Interaction (SSI) Method for...
Automating approximate Bayesian computation by local linear regression
Thornton, Kevin R
2009-01-01T23:59:59.000Z
computation by local linear regression Kevin R Thorntonof ABC based on using a linear regression to approximate theimplements the local linear-regression approach to ABC. The
Recursive Programming Model for Crop Production on the Texas High Plains
Reneau, D. R.; Lacewell, R. D.; Ellis, J. R.
1984-01-01T23:59:59.000Z
A flexible, recursive programming model of crop production on the Texas High Plains was developed. Besides the linear programming (LP) Optimization routine and recursive feedback section, the model also includes a matrix generator and report writer...
Some unitary representations of Thompson's groups F and T
Vaughan F. R. Jones
2014-12-24T23:59:59.000Z
In a "naive" attempt to create algebraic quantum field theories on the circle, we obtain a family of unitary representations of Thompson's groups T and F for any subfactor. The Thompson group elements are the "local scale transformations" of the theory. In a simple case the coefficients of the representations are polynomial invariants of links. We show that all links arise and introduce new "oriented" subgroups $\\overrightarrow F
Calibrating Bayesian Network Representations of Social-Behavioral Models
Whitney, Paul D.; Walsh, Stephen J.
2010-04-08T23:59:59.000Z
While human behavior has long been studied, recent and ongoing advances in computational modeling present opportunities for recasting research outcomes in human behavior. In this paper we describe how Bayesian networks can represent outcomes of human behavior research. We demonstrate a Bayesian network that represents political radicalization research – and show a corresponding visual representation of aspects of this research outcome. Since Bayesian networks can be quantitatively compared with external observations, the representation can also be used for empirical assessments of the research which the network summarizes. For a political radicalization model based on published research, we show this empirical comparison with data taken from the Minorities at Risk Organizational Behaviors database.
Clifford, Dirac, and Majorana algebras, and their representations
Salingaros, N.
1981-04-01T23:59:59.000Z
We show that the Dirac algebra is an algebra in five dimensions. It has traditionally been confused with the two distinct algebras in four dimensions, which we have identified as the Majorana algebra and the Clifford algebra in Minkowski space-time. A careful discussion of the subtle inter-relationship between these three algebras is achieved by employing a basis of differential forms. In addition, we provide for the first time a 4 x 4 complex matrix representation of the Clifford algebra in Minkowski spacetime, and compare it to the matrix representations of the Dirac and Majorana algebras. A remark on Eddington's E-numbers is included.
Representations of the LL BFKL Kernel and the Bootstrap
G. P. Vacca
2005-09-20T23:59:59.000Z
Different forms of the BFKL kernel both in coordinate and momentum representations may appear as a result of different gauge choices and/or inner scalar products of the color singlet states. We study a spectral representation of the BFKL kernel not defined on the Moebius space of functions but on a deformation of it, which provides the usual bootstrap property due to gluon reggeization. In this space the corresponding symmetry is made explicit introducing a deformed realization of the sl(2,C) algebra.
Brau, James E [Univ. of Oregon] [Univ. of Oregon
2013-04-22T23:59:59.000Z
The U.S Linear Collider Detector R&D program, supported by the DOE and NSF umbrella grants to the University of Oregon, made significant advances on many critical aspects of the ILC detector program. Progress advanced on vertex detector sensor development, silicon and TPC tracking, calorimetry on candidate technologies, and muon detection, as well as on beamline measurements of luminosity, energy, and polarization.
International Workshop on Linear Colliders 2010
None
2011-10-06T23:59:59.000Z
IWLC2010 International Workshop on Linear Colliders 2010ECFA-CLIC-ILC joint meeting: Monday 18 October - Friday 22 October 2010Venue: CERN and CICG (International Conference Centre Geneva, Switzerland) This year, the International Workshop on Linear Colliders organized by the European Committee for Future Accelerators (ECFA) will study the physics, detectors and accelerator complex of a linear collider covering both CLIC and ILC options.Contact Workshop Secretariat IWLC2010 is hosted by CERN
LINEAR COLLIDER PHYSICS RESOURCE BOOK FOR SNOWMASS 2001.
ABE,T.; DAWSON,S.; HEINEMEYER,S.; MARCIANO,W.; PAIGE,F.; TURCOT,A.S.; ET AL
2001-05-03T23:59:59.000Z
The American particle physics community can look forward to a well-conceived and vital program of experimentation for the next ten years, using both colliders and fixed target beams to study a wide variety of pressing questions. Beyond 2010, these programs will be reaching the end of their expected lives. The CERN LHC will provide an experimental program of the first importance. But beyond the LHC, the American community needs a coherent plan. The Snowmass 2001 Workshop and the deliberations of the HEPAP subpanel offer a rare opportunity to engage the full community in planning our future for the next decade or more. A major accelerator project requires a decade from the beginning of an engineering design to the receipt of the first data. So it is now time to decide whether to begin a new accelerator project that will operate in the years soon after 2010. We believe that the world high-energy physics community needs such a project. With the great promise of discovery in physics at the next energy scale, and with the opportunity for the uncovering of profound insights, we cannot allow our field to contract to a single experimental program at a single laboratory in the world. We believe that an e{sup +}e{sup {minus}} linear collider is an excellent choice for the next major project in high-energy physics. Applying experimental techniques very different from those used at hadron colliders, an e{sup +}e{sup {minus}} linear collider will allow us to build on the discoveries made at the Tevatron and the LHC, and to add a level of precision and clarity that will be necessary to understand the physics of the next energy scale. It is not necessary to anticipate specific results from the hadron collider programs to argue for constructing an e{sup +}e{sup {minus}} linear collider; in any scenario that is now discussed, physics will benefit from the new information that e{sup +}e{sup {minus}} experiments can provide.
JLab Supports International Linear Collider Cavity Development...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Supports International Linear Collider Cavity Development Work NEWPORT NEWS, Va. Feb. 12, 2008 - It's not often that major-league baseball and nuclear physics get to share the...
LED Replacements for Linear Fluorescent Lamps Webcast
Broader source: Energy.gov [DOE]
In this June 20, 2011 webcast on LED products marketed as replacements for linear fluorescent lamps, Jason Tuenge of the Pacific Northwest National Laboratory (PNNL) discussed current Lighting...
Linear conic optimization for nonlinear optimal control
2014-07-07T23:59:59.000Z
Jul 7, 2014 ... This linear transport equation is classical in fluid mechanics, statistical ... define a relaxed optimal control problem as an LP in the cone of non-.
Ultra-high vacuum photoelectron linear accelerator
Yu, David U.L.; Luo, Yan
2013-07-16T23:59:59.000Z
An rf linear accelerator for producing an electron beam. The outer wall of the rf cavity of said linear accelerator being perforated to allow gas inside said rf cavity to flow to a pressure chamber surrounding said rf cavity and having means of ultra high vacuum pumping of the cathode of said rf linear accelerator. Said rf linear accelerator is used to accelerate polarized or unpolarized electrons produced by a photocathode, or to accelerate thermally heated electrons produced by a thermionic cathode, or to accelerate rf heated field emission electrons produced by a field emission cathode.
Siting the International Linear Collider at Hanford
Kouzes, Richard T.; Asner, David M.; Brodzinski, Ronald L.; Fast, James E.; Miley, Harry S.
2012-03-15T23:59:59.000Z
Review of the proposed International Linear Collider, applications in high energy physics, and evaluation of the Hanford Site as a possible location for siting the facilityl.
Siting the International Linear Collider at Hanford
Kouzes, Richard T.; Asner, David M.; Brodzinski, Ronald L.; Fast, James E.; Miley, Harry S.
2012-05-01T23:59:59.000Z
Review of the proposed International Linear Collider, applications in high energy physics, and evaluation of the Hanford Site as a possible location for siting the facility.
Coherent Feedback Control of Linear Quantum Optical Systems via Squeezing and Phase Shift
Guofeng Zhang; Heung Wing Joseph Lee; Bo Huang; Hu Zhang
2012-06-16T23:59:59.000Z
The purpose of this paper is to present a theoretic and numerical study of utilizing squeezing and phase shift in coherent feedback control of linear quantum optical systems. A quadrature representation with built-in phase shifters is proposed for such systems. Fundamental structural characterizations of linear quantum optical systems are derived in terms of the new quadrature representation. These results reveal considerable insights of issue of physical realizability of such quantum systems. The problem of coherent quantum LQG feedback control studied in [35,50] is re-investigated in depth. Firstly, the optimization methods in [35,50] are extended to a multi-step optimization algorithm which utilizes ideal squeezers. Secondly, a two-stage optimization approach is proposed on the basis of controller parametrization. Numerical studies show that closed-loop systems designed via the second approach may offer LQG control performance even better than that when the closed-loop systems are in the vacuum state. When ideal squeezers in a close-loop system are replaced by (more realistic) degenerate parametric amplifiers, a sufficient condition is derived for the asymptotic stability of the resultant new closed-loop system; the issue of performance convergence is also discussed in the LQG control setting.
A functional quantum programming language
Thorsten Altenkirch; Jonathan Grattage
2005-04-19T23:59:59.000Z
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive semantics of irreversible quantum computations realisable as quantum gates. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings explicit. Strict programs are free from decoherence and hence preserve superpositions and entanglement - which is essential for quantum parallelism.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2004-12-10T23:59:59.000Z
The Order establishes Counterintelligence Program requirements and responsibilities for the Department of Energy, including the National Nuclear Security Administration. Cancels: DOE 5670.3.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1997-05-21T23:59:59.000Z
This chapter addresses plans for the acquisition and installation of operating environment hardware and software and design of a training program.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
MATHCOUNTS is a national enrichment, coaching and competition program that promotes middle school mathematic achievement. The mission of MATHCOUNTS is to increase enthusiasm for...
Broader source: Energy.gov [DOE]
Headquarters Human Resources Operations promotes a variety of hiring flexibilities for managers to attract a diverse workforce, from Student Internship Program opportunities (Pathways), Veteran...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1992-09-04T23:59:59.000Z
To establish the policies, procedures, and specific responsibilities for the Department of Energy (DOE) Counterintelligence (CI) Program. This directive does not cancel any other directive.
Office of Science (SC) Website
Program Summaries Basic Energy Sciences (BES) BES Home About Research Facilities Science Highlights Benefits of BES Funding Opportunities Basic Energy Sciences Advisory Committee...
Biological Engineering 2014-2015 BIOLOGICAL ENGINEERING PROGRAM PROGRESS FORM
Walter, M.Todd
Biological Engineering 2014-2015 8 BIOLOGICAL ENGINEERING PROGRAM PROGRESS FORM Applies to students Calculus for Engineers I* MATH 1910 (4) ______ _____ _____ Calculus for Engineers II* MATH 1920 (4) ______ _____ _____ Engineering Math* (Differential Equations) MATH 2930 (4) ______ _____ _____ Engineering Math* (Linear Algebra
6.231 Dynamic Programming and Stochastic Control, Fall 2002
Bertsekas, Dimitri P.
Sequential decision-making via dynamic programming. Unified approach to optimal control of stochastic dynamic systems and Markovian decision problems. Applications in linear-quadratic control, inventory control, and resource ...
Network sampling and classification: An investigation of network model representations
Needleman, Daniel
only one or two connectivity patterns of an observed network--such as degree distribution, or diameterNetwork sampling and classification: An investigation of network model representations Edoardo M: Connectivity pattern Network type Network metrics Network sampling Network classification Methods
Path-transformations in probability and representation theory
Jordan, Jonathan
Path-transformations in probability and representation theory Neil O'Connell University of Warwick Biane and Philippe Bougerol Neil O'Connell Path-transforms in probability and rep. theory #12;Pitman is a three-dimensional Bessel process. Neil O'Connell Path-transforms in probability and rep. theory #12;The
FROM NO"RLUND MATRICES TO LAPLACE REPRESENTATIONS
Sinnamon, Gordon J.
(and not * *too large) on the line Re z = 0, the Laplace transform LF is just the (Poisson exte* *nsion of the) Fourier transform of F . It is therefore appropriate to view the power * *series. Analogous inequalities are proved for power series representations * *of functions in weighted Hardy
On the Representation of Physical Quantities in Natural Language Text
Forbus, Kenneth D.
On the Representation of Physical Quantities in Natural Language Text Sven E. Kuehne (skuehne Abstract In this paper we investigate the forms in which quantity information can appear in written natural information extracted from natural language text corresponds to the five constituents of physical quantities
Learning DFA representations of HTTP for protecting web applications
New Mexico, University of
Learning DFA representations of HTTP for protecting web applications Kenneth L. Ingham a,*, Anil by secu- rity threats. Protecting web server-based applications using intrusion detection is challenging). Web applications are difficult to protect because they are large, complex, highly customized
COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
Antaki, James F.
representation requires about a factor of #12;ve less memory than the most eĆcient standard represen- tations in memory can be the limiting factor in the size of a mesh used in various applications. Standard rep of the Al- addin Center (www.aladdin.cmu.edu) and Sangria Project (www.cs.cmu.edu/~sangria) under grants ACI
Reasoning and Representation: the Sketching of Organic Chemical Reaction Mechanisms
Marchese, Francis
Reasoning and Representation: the Sketching of Organic Chemical Reaction Mechanisms Position paper of sketching chemical reaction mechanisms in order to reason-out the structural transformations that convert. The general chemical reaction patterns of oxidation-reduction, functional group transfer, hydrolysis
Products and symmetrised powers of irreducible representations of SO \\Lambda
Toumazet, FrĂ©dĂ©ric
Products and symmetrised powers of irreducible representations of SO \\Lambda (2n) R C Kingyx F'n, Poland 31 March 1998 Abstract. The calculation of branching rules, tensor products and plethysms products is derived and a complete analysis of the terms in both Hm \\Theta Hm 0 and H \\Theta H is given
Knowledge representation in process engineering Franz Baader and Ulrike Sattler
Baader, Franz
Knowledge representation in process engineering Franz Baader and Ulrike Sattler RWTH Aachen to represent the relevant process engi neering knowledge. The application domain Process engineering knowledge engineer), and not automatically in ferred from the definition of the class. As the complexity
BACK TO OFFICE REPORT Enhancing the Representation of Environment and
BACK TO OFFICE REPORT Enhancing the Representation of Environment and Natural Resources in Poverty be established when PRSPs are combined with Sector-Wide Approaches to funding development through Medium-Term Expenditure Frameworks (MTEF). Environment and Natural Resources (ENR) are recognised by the international
Representations and Properties of Generalized $A_r$ Statistics
Mohammed Daoud
2006-06-20T23:59:59.000Z
A generalization of $A_r$ statistics is proposed and developed. The generalized $A_r$ quantum statistics is completely specified by a set of Jacobson generators satisfying a set of triple algebraic relations. Fock-Hilbert representations and Bargmann-Fock realizations are derived.
A Simple Representation Technique to Improve GA Performance
's performance by allowing a more rapid search through the hypothesis space. This is achieved by the prior be very different than their parents, thus increasing the speed in which the hypothesis space is searchedA Simple Representation Technique to Improve GA Performance Steven L. Keast Department of Computer
THE CATEGORICAL WEIL REPRESENTATION SHAMGAR GUREVICH AND RONNY HADANI
Gurevich, Shamgar
))f(y), where G(B, ) is an appropriate Gauss sum normalization. 0.2. Canonical vector space. In [10, 11 of odd characteristic: There exists a canonical system of intertwining operators between the Lagrangian models of the Heisenberg representation. This defines a canonical vector space H(V ) associated
Towards Event Sequence Representation, Reasoning and Visualization for EHR Data
Golbeck, Jennifer
Towards Event Sequence Representation, Reasoning and Visualization for EHR Data Cui Tao Dept will provide a comprehensive environment for users to visualize inferred temporal relationships from EHR data the narrative, temporal reasoning is also needed in order to analyze the trends in time. Manually assessing tens
Music Representation in a Digital Music Library Donald Byrd
Indiana University
Music Representation in a Digital Music Library Donald Byrd School of Music Indiana University Bloomington, IN 47401 812-855-0296 isaacso@indiana.edu Abstract The Variations2 digital music library users. 1. Introduction Variations2 is a large-scale digital music library project under development
The Arc type Dependence Representation in Polaris Naraig Manjikian
Padua, David
The Arc type Dependence Representation in Polaris Naraig Manjikian Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, Canada M5S 1A4 May 20, 1995 1 Introduction in a dependence pair, i.e., there is no redundant information. The implication of this is that both a source
On Radix Representation of Rings \\Lambda Asger Munk Nielsen
Kornerup, Peter
systems is performed. This includes the ``classical'' complex number systems for the Gaussian integers research topic in the field of computer arithmetic, since choosing the wrong number system can have of operation. By conception designing a number system amounts to choosing a representation suitable
Radon transform and kinetic equations in tomographic representation
V. N. Chernega; V. I. Man'ko; B. I. Sadovnikov
2009-11-01T23:59:59.000Z
Statistical properties of classical random process are considered in tomographic representation. The Radon integral transform is used to construct the tomographic form of kinetic equations. Relation of probability density on phase space for classical systems with tomographic probability distributions is elucidated. Examples of simple kinetic equations like Liouville equations for one and many particles are studied in detail.
Parameterized versus Generative Representations in Structural Design: An Empirical Comparison
George Mason University
Parameterized versus Generative Representations in Structural Design: An Empirical Comparison Rafal of structural design problems, including the design of a wind bracing system and the design of an entire-dimensional cellular automata were used to develop, or `grow,' structural designs from the corresponding `design
Topical review Cortical representation of pain: functional characterization of nociceptive
Apkarian, A. Vania
of this increase in knowledge was due to advances in the imaging technologies of positron emission tomography (PET processing of these stimuli. There is mounting evidence for closely located but separate representations of the somatosensory system. The term `nocicep- tion' refers to signal processing of noxious stimulus input
Shape Recipes: Scene Representations that Refer to the Image
Torralba, Antonio
Shape Recipes: Scene Representations that Refer to the Image William T. Freeman and Antonio- resentation, called a scene recipe, that relies on the image itself to de- scribe the complex scene configurations. Shape recipes are an example: these are the regression coefficients that predict the bandpassed