Sample records for linear programming representation

  1. Algorithms for Symmetric Linear and Integer Programs

    E-Print Network [OSTI]

    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.

  2. Linear Programming Environmental

    E-Print Network [OSTI]

    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

  3. Linear optimization Linear programming using the Simplex method

    E-Print Network [OSTI]

    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

  4. Optimization Online - Linear, Cone and Semidefinite Programming ...

    E-Print Network [OSTI]

    Strong duality in conic linear programming: facial reduction and extended duals ... A new semide nite programming relaxation for the quadratic assignment ...

  5. Duality for Mixed-Integer Linear Programs

    E-Print Network [OSTI]

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

  6. Symmetries in Linear and Integer Programs

    E-Print Network [OSTI]

    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.

  7. Linear Programming Lower Bounds for Minimum Converter ...

    E-Print Network [OSTI]

    generation algorithm for solving the linear relaxation of the most promising ... Keywords: Optical Networks, Wavelength Assignment, Integer Programming.

  8. An Integer Programming Approach for Linear Programs with ...

    E-Print Network [OSTI]

    2008-05-02T23:59:59.000Z

    Linear programs with joint probabilistic constraints (PCLP) are dif- ficult to solve ...... Stochastic optimization for operating chemical processes under uncertainty.

  9. The Equivalence of Linear Programs and Zero-Sum Games

    E-Print Network [OSTI]

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

  10. Stochastic linear programming games with concave preferences

    E-Print Network [OSTI]

    2014-12-04T23:59:59.000Z

    We study stochastic linear programming games: a class of stochastic ... which include minimum cost spanning trees (Granot and Huberman 1981) as a special

  11. On linear programing approach to inventory control

    E-Print Network [OSTI]

    Mayfield, John

    On linear programing approach to inventory control problems Zhu received his PhD from Wayne State with inventory control problems under the discounted criterion. The objective is to minimize the discounted total imbeds the inventory control problem into an infinite-dimensional linear program over a space of measures

  12. Blood Management Using Approximate Linear Programming

    E-Print Network [OSTI]

    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

  13. Preservice teachers' knowledge of linear functions within multiple representation modes

    E-Print Network [OSTI]

    You, Zhixia

    2009-05-15T23:59:59.000Z

    and algebraic representations; (3) flexibility within visual representations; (4) flexibility with real-life situations, and (5) procedural skills. In terms of pedagogical content knowledge, two aspects were examined across five corresponding components...

  14. Alternative mixed-integer linear programming models of a maritime inventory routing problem

    E-Print Network [OSTI]

    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

  15. A Linear Programming based Satisfiability solver using a new

    E-Print Network [OSTI]

    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

  16. Shrink-Wrapping trajectories for Linear Programming

    E-Print Network [OSTI]

    2010-05-30T23:59:59.000Z

    May 30, 2010 ... In particular, we analyze the geometry of these trajectories in the ... convexity that does not rely on complex variables; in Section 3 we ..... otal observation for building Shrink-Wrapping framework for linear programming ... In applications, these three types of problems provide an extremely powerful modeling.

  17. Linearized Constraints in the Connection Representation: Hamilton-Jacobi Solution

    E-Print Network [OSTI]

    J. N. Goldberg; D. C. Robinson

    1994-05-11T23:59:59.000Z

    Newman and Rovelli have used singular Hamilton-Jacobi transformations to reduce the phase space of general relativity in terms of the Ashtekar variables. Their solution of the gauge constraint cannot be inverted and indeed has no Minkowski space limit. Nonetheless, we exhibit an explicit Hamilton-Jacobi solution of all the linearized constraints. The result does not encourage an iterative solution, but it does indicate the origin of the singularity of the Newman-Rovelli result.

  18. Lifted Linear Programming Martin Mladenov Babak Ahmadi Kristian Kersting

    E-Print Network [OSTI]

    Kersting, Kristian

    Lifted Linear Programming Martin Mladenov Babak Ahmadi Kristian Kersting Knowledge Discovery Lifted inference approaches have rendered large, previously intractable probabilistic in- ference- tuitively, given a linear program (LP), we em- ploy a lifted variant of Gaussian belief propa- gation (Ga

  19. Trajectory Optimization using Mixed-Integer Linear Programming

    E-Print Network [OSTI]

    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

  20. A Dynamic Near-Optimal Algorithm for Online Linear Programming

    E-Print Network [OSTI]

    Ye, Yinyu

    -time forward dynamic pricing for PEVs charging/discharging on smart-grid; Yinyu Ye Online Linear Program 2009

  1. SCIL --Symbolic Constraints in Integer Linear Programming \\Lambda Ernst Althaus

    E-Print Network [OSTI]

    Mehlhorn, Kurt

    want short development time (= efficient use of human resources) and runtime efficiency (= efficient introduces symbolic constraints into branch­and­cut­and­price algorithms for integer linear programs for integer linear programming (ILP) and mixed integer linear programming (MILP) based on a branch­and­cut­and­price

  2. ABDUCTIVE LOGIC PROGRAMMING Abductive Logic Programming is a high level knowledge representation

    E-Print Network [OSTI]

    Moraitis, Pavlos

    ABDUCTIVE LOGIC PROGRAMMING Abductive Logic Programming is a high level knowledge representation framework that allows us to solve problems declaratively based on abductive reasoning. It extends normal predicates. Problem solving is effected by deriving hypotheses on these abducible predicates (abductive hy

  3. Recent Progresses on Linear Programming and the Simplex Method

    E-Print Network [OSTI]

    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

  4. Transient Analysis of Linear Circuits using Constraint Logic Programming

    E-Print Network [OSTI]

    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

  5. Tools for primal degenerate linear programs: IPS, DCA, and PE

    E-Print Network [OSTI]

    Jean-Bertrand Gauthier

    2014-10-08T23:59:59.000Z

    Oct 8, 2014 ... Tools for primal degenerate linear programs: IPS, DCA, and PE. Jean-Bertrand Gauthier(jean-bertrand.gauthier ***at*** hec.ca) Jacques ...

  6. On treating single-objective fuzzy integer linear fractional programs

    E-Print Network [OSTI]

    User

    2009-06-05T23:59:59.000Z

    On Solving Single-objective Fuzzy Integer Linear Fractional Programs. Omar M. Saad*; Azza H. Amer and Eman F. Abdellah. Department of Mathematics ...

  7. Classical Simplex Methods for Linear Programming and Their ...

    E-Print Network [OSTI]

    This paper presents a new primal dual simplex method and investigates the ... The classical simplex algorithm is the most popularly used for linear programming ...

  8. Optimization Online - Large-Scale Linear Programming Techniques ...

    E-Print Network [OSTI]

    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)

  9. PuLP: A Linear Programming Toolkit for Python

    E-Print Network [OSTI]

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

  10. A several new mixed integer linear programming formulations for ...

    E-Print Network [OSTI]

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

  11. A new mixed integer linear programming formulation for one ...

    E-Print Network [OSTI]

    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.

  12. Control structures in linear and stack-based Genetic Programming

    E-Print Network [OSTI]

    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

  13. Comparison of open-source linear programming solvers.

    SciTech Connect (OSTI)

    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.

  14. IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming

    E-Print Network [OSTI]

    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

  15. A polynomial projection algorithm for linear programming

    E-Print Network [OSTI]

    2013-05-03T23:59:59.000Z

    algorithm is based on a procedure whose input is a homogeneous system of linear ..... In this case s = 0 and the procedure sets the output vector yout to 0.

  16. New linear and positive semidefinite programming based ...

    E-Print Network [OSTI]

    2014-04-18T23:59:59.000Z

    testing matrix copositivity [10, 25]; (ii) 0-1 linear optimisation problems [35, 36, ...... 1. By letting Mr be the set of polynomials in M of degree less than or equal to r, ...

  17. Linear Programming Uses for Recycling and Product Reuse

    E-Print Network [OSTI]

    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

  18. Static and Dynamic Locality Optimizations Using Integer Linear Programming

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    Static and Dynamic Locality Optimizations Using Integer Linear Programming Mahmut Kandemir, Member hierarchies is closely related to the performance of the memory subsystem. Compiler optimizations aimed at improving cache locality are critical in realizing the performance potential of powerful processors

  19. PRICING ENERGY DERIVATIVES BY LINEAR PROGRAMMING: TOLLING AGREEMENT CONTRACTS

    E-Print Network [OSTI]

    Uryasev, Stanislav

    PRICING ENERGY DERIVATIVES BY LINEAR PROGRAMMING: TOLLING AGREEMENT CONTRACTS Valeriy Ryabchenko for pricing energy derivatives known as tolling agreement contracts. The pricing problem is reduced energy derivatives. The problem of pricing such contracts falls into the class of multiple optimal

  20. Designing AC Power Grids using Integer Linear Programming

    E-Print Network [OSTI]

    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 (

  1. Efficient representation for formal verification of PLC programs * Vincent Gourcuff, Olivier De Smet and Jean-Marc Faure

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Efficient representation for formal verification of PLC programs * Vincent Gourcuff, Olivier De, an efficient representation of PLC programs is proposed. This representation includes only the states that are meaningful for properties proof. A method to translate PLC programs developed in Structured Text into Nu

  2. CS 521: LINEAR PROGRAMMING Fall 2009, 3 Credits INSTRUCTOR: Bahman Kalantari (kalantar@cs.rutgers.edu)

    E-Print Network [OSTI]

    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

  3. Section Notes 5 Review of Linear Programming

    E-Print Network [OSTI]

    Chen, Yiling

    3 Lecture 4: Convexity, Extreme points 3 4 Lecture 5: Primal Simplex 4 5 Lecture 6: Advanced Primal (LP) is an optimization problem that involves maximizing or minimizing a linear objective function, ..., Am form a square matrix that is invertible · Span ­ These vectors A1, ..., Am span the vector space

  4. Generative Story Worlds Linear Logic Programs

    E-Print Network [OSTI]

    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

  5. Integer linear programming models for a cement delivery problem

    E-Print Network [OSTI]

    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

  6. Interior-point methods for linear programming: a guided tour

    E-Print Network [OSTI]

    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

  7. Interior-point methods for linear programming: a guided tour

    E-Print Network [OSTI]

    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

  8. Planning under uncertainty solving large-scale stochastic linear programs

    SciTech Connect (OSTI)

    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.

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

    SciTech Connect (OSTI)

    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.

  10. Lyapunov Function Synthesis using Handelman Representations.

    E-Print Network [OSTI]

    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

  11. A Distributed Simplex Algorithm for Degenerate Linear Programs and Multi-Agent Assignments

    E-Print Network [OSTI]

    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

  12. Non-Linear Continuum Regression Using Genetic Programming Ben.McKay@ncl.ac.uk

    E-Print Network [OSTI]

    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

  13. Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming

    SciTech Connect (OSTI)

    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.

  14. Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming

    E-Print Network [OSTI]

    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

  15. On the Equivalence of Linear Programming Problems and Zero-Sum ...

    E-Print Network [OSTI]

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

  16. A Comparison of Software Packages for Verified Linear Programming

    E-Print Network [OSTI]

    Christian Keil

    2008-06-11T23:59:59.000Z

    Jun 11, 2008 ... ... is supported by the Mathematical Programming Society and by the Optimization Technology Center. Mathematical Programming Society.

  17. Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic

    E-Print Network [OSTI]

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

  18. Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes

    E-Print Network [OSTI]

    Rosnes, Eirik; Amat, Alexandre Graell i

    2011-01-01T23:59:59.000Z

    In this work, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs), recently introduced by Berrou et al.. Here, we consider binary 3D-TCs while the original work of Berrou et al. considered double-binary codes. We present a relaxed LP decoder for 3D-TCs, which is an adaptation of the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. The vertices of this relaxed polytope are the pseudocodewords. We show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure channel. Furthermore, we present a numerical study of small block length 3D-TCs, which shows that typically the minimum pseudoweight (on the additive white Gaussian noise (AWGN) channel) is smaller than both the minimum distance and the stopping distance. In particular, we performed an exhaustive search over all interleaver pairs in the 3D-TC based on quadratic...

  19. An Analytic Linear Accelerator Source Model for Monte Carlo Dose Calculations. I. Model Representation and Construction

    E-Print Network [OSTI]

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

  20. Scalable massively parallel simplex algorithms for block-structured linear programs

    E-Print Network [OSTI]

    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

  1. Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage

    E-Print Network [OSTI]

    Sadeh, Norman M.

    Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage in practice. Focusing on commodity storage, we identify a deficiency of approximate linear programming, which their corresponding ALPs. Applied to existing natural gas storage instances, our ALP relaxations significantly

  2. Solving the quadratic assignment problem by means of general purpose mixed integer linear programming

    E-Print Network [OSTI]

    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

  3. Deriving Unit Cost Coefficients for Linear Programming-Driven Priority-Based Simulations

    E-Print Network [OSTI]

    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

  4. Decoding Turbo-Like Codes via Linear Programming Jon Feldman David R. Karger

    E-Print Network [OSTI]

    Decoding Turbo-Like Codes via Linear Programming Jon Feldman David R. Karger MIT Laboratory algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of Repeat is the path corresponding to the original transmitted code word. 1 Introduction The introduction of turbo

  5. Calmness of linear programs under perturbations of all data ...

    E-Print Network [OSTI]

    2014-06-18T23:59:59.000Z

    the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping in linear optimization

  6. New Semidefinite Programming Relaxations for the Linear Ordering ...

    E-Print Network [OSTI]

    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 (

  7. THE CENTRAL CURVE IN LINEAR PROGRAMMING 1. Introduction ...

    E-Print Network [OSTI]

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

  8. Optimization Online - ADMM for Convex Quadratic Programs: Linear ...

    E-Print Network [OSTI]

    Arvind U. Raghunathan

    2015-01-08T23:59:59.000Z

    Jan 8, 2015 ... Abstract: In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) ...

  9. Linear Program to Select Energy Conservation Projects in an Existing Facility

    E-Print Network [OSTI]

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

  10. Analysis of Linear Programming Relaxations for a Class of Connectivity Problems

    E-Print Network [OSTI]

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

  11. Data Envelopment Analysis: A Linear Programming Application to Measure the Relative Efficiencies of Internal Business Divisions

    E-Print Network [OSTI]

    Shockley, Laura

    2014-05-16T23:59:59.000Z

    that an A/E/C firm may want to evaluate include: 1. Customer Satisfaction Data Envelopment Analysis: A Linear Programming Application to Measure the Relative Efficiencies of Internal Business Divisions Laura Shockley 26 2. Percent Repeat Customer... the Relative Efficiencies of Internal Business Divisions Laura Shockley 1 Executive Summary Data Envelopment Analysis (DEA) is a non-parametric linear programming model used to determine relative efficiencies of similar decision making units based...

  12. Evolution of Biped Locomotion using Linear Genetic Programming

    E-Print Network [OSTI]

    Wolff, Krister

    of anthropomorphic bipedal loco- motion is addressed by means of artificial evolution using linear genetic model free evolution of bipedal gaits for a system with high number of degrees of freedom. 1, except when the robot is on a steep slope. Legged robots, on the contrary, lift their feet off the ground

  13. Linear Dynamic Programs for Resource Management Marek Petrik

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    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 dynamic programming, a method used to optimize hydroelectric systems. 1 Introduction Sequential decision

  14. Part II - Managerial Competencies: Organizational Representation...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    II - Managerial Competencies: Organizational Representation and Liaison Part II - Managerial Competencies: Organizational Representation and Liaison Form for the SES program...

  15. An Integer Linear Programming Approach to Product Software Release

    E-Print Network [OSTI]

    Utrecht, Universiteit

    and Computing Sciences Utrecht University, Utrecht, The Netherlands www.cs.uu.nl #12;ISSN: 0924-3275 Department of Information and Computing Sciences Utrecht University P.O. Box 80.089 3508 TB Utrecht The Netherlands #12 Thesis Master program of Business Informatics Department of information & computing science Utrecht

  16. A linear programming problem Math 10120, Spring 2014

    E-Print Network [OSTI]

    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

  17. A Linear Programming Approach to Time Optimal Control of Integrator Switched Systems with State Constraints

    E-Print Network [OSTI]

    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

  18. ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy

    E-Print Network [OSTI]

    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

  19. ISE 536Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy

    E-Print Network [OSTI]

    Ordóñez, Fernando

    ISE 536­Fall03: 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

  20. Solving Linear Programs #2 1.0 Manipulations of the simplex method

    E-Print Network [OSTI]

    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

  1. Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda

    E-Print Network [OSTI]

    Zhang, Yin

    Solving the Double Digestion Problem as a Mixed­Integer Linear Program \\Lambda Zhijun Wu y and Yin Zhang z August, 2001 Abstract. The double digestion problem for DNA restriction mapping is known­scale double digestion problems. Key Words. DNA sequencing, restriction mapping, double digestion, NP

  2. Application of linear programming methods to determine the best location of concrete dispatch plants

    E-Print Network [OSTI]

    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

  3. Pose Estimation of Object Categories in Videos Using Linear Programming Michele Fenzi1

    E-Print Network [OSTI]

    Giger, Christine

    Pose Estimation of Object Categories in Videos Using Linear Programming Michele Fenzi1 , Laura Leal to consistently recover the pose of an object from a known class in a video se- quence. As individual poses estimated from monocular im- ages are rather noisy, we optimally aggregate pose evidence over all video

  4. LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP

    E-Print Network [OSTI]

    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

  5. Linear programming applied to the ower sector: a Gladiolus bulb production case study

    E-Print Network [OSTI]

    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

  6. Job Scheduling Using successive Linear Programming Approximations of a Sparse Model

    E-Print Network [OSTI]

    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

  7. Developmental Plasticity in Linear Genetic Programming Nicholas Freitag McPhee

    E-Print Network [OSTI]

    Poli, Riccardo

    Developmental Plasticity in Linear Genetic Programming Nicholas Freitag McPhee Division of Science numerous types of plasticity, where they respond both developmentally and behaviorally to environ- mental selection to act on these otherwise "invis- ible" genes. In contrast to biological plasticity, the vast

  8. A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank Farm Operations

    E-Print Network [OSTI]

    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

  9. Polymer representations and geometric quantization

    E-Print Network [OSTI]

    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.

  10. The Lee-Yang and Polya-Schur Programs. I. Linear Operators Preserving Stability

    E-Print Network [OSTI]

    Borcea, Julius

    2008-01-01T23:59:59.000Z

    In 1952 Lee and Yang proposed the program of analyzing phase transitions in terms of zeros of partition functions. Linear operators preserving non-vanishing properties are an essential tool in this program as well as various contexts in complex analysis, probability theory, combinatorics, matrix theory. We characterize all linear operators on finite or infinite-dimensional spaces of multivariate polynomials preserving the property of being non-vanishing when the variables are in prescribed open circular domains. In particular, this supersedes [7, 9] and solves the higher dimensional counterpart of a long-standing classification problem originating from classical works of Hermite, Laguerre, Hurwitz and Polya-Schur on univariate polynomials with such properties.

  11. Estimation of the regional demand for hired farm labor: a parametric linear programming approach

    E-Print Network [OSTI]

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

  12. Waste management under multiple complexities: Inexact piecewise-linearization-based fuzzy flexible programming

    SciTech Connect (OSTI)

    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.

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

    E-Print Network [OSTI]

    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

  14. ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 8: Simplex Method, Optimality Conditions

    E-Print Network [OSTI]

    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

  15. ISE 536{Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma

    E-Print Network [OSTI]

    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

  16. ISE 536Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma

    E-Print Network [OSTI]

    Ordóñez, Fernando

    ISE 536­Fall03: 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

  17. A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem

    E-Print Network [OSTI]

    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.

  18. Computer Methods and Programs in Biomedicine 65 (2001) 191200 A step-by-step guide to non-linear regression analysis of

    E-Print Network [OSTI]

    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) 191­200 A step-by-step guide to non-linear

  19. Loop Representations

    E-Print Network [OSTI]

    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)

  20. Optimization Online - PuLP: A Linear Programming Toolkit for Python

    E-Print Network [OSTI]

    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.

  1. Experiments in real time path planning for a small unmanned helicopter using mixed integer linear programming

    E-Print Network [OSTI]

    Martinos, Ioannis, 1977-

    2003-01-01T23:59:59.000Z

    We use mathematical programming to perform simulated and actual flight experiments with the MIT autonomous helicopter platform. The experimental platform mechanical hardware, avionics and software architecture are described. ...

  2. P. J. Antsaklis, "Notes on Polynomial Matrix Representation of Linear Control Systems," Publication No. 80/17, Dept. of Electrical Engineering, Imperial College, June 1980.

    E-Print Network [OSTI]

    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

  3. Application of a dynamic linear programming model for optimum use of range resources over time

    E-Print Network [OSTI]

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

  4. Transformer procurement and relocation at a large electric utility: A mixed 0-1 linear programming model

    SciTech Connect (OSTI)

    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.

  5. The ECO Program Construction System: Ways of Increasing its Representational Power and their Effects on the User Interface 

    E-Print Network [OSTI]

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

  6. Teaching residential segregation: an evaluation of the value of graphical representations presented with the SegMaps program

    E-Print Network [OSTI]

    Wiederstein, Sharon Baker

    2001-01-01T23:59:59.000Z

    design, and included controls for all the normal aspects of a classroom interaction such as an assigned reading and a lecture that did not include the program illustrations being tested. While this thesis did not provide conclusive support...

  7. The application of bi-level non-linear programming to the aluminum industry

    SciTech Connect (OSTI)

    Nicholls, M.

    1994-12-31T23:59:59.000Z

    In this paper a bi-level non-linear mathematical model of an aluminum smelter is described. The model is based on the Portland Aluminum smelter and aims at maximizing the aluminum production while minimizing the costs associated with the production of this maximum output. The model has two variables, the power input (kilo-Amperes) and the setting cycle (of the anode replacement). The solution algorithm, based on a grid search which enumerates the appropriate intersections of the resource and other constraints is then discussed. Additionally, some of the areas currently being developed, including sensitivity analysis and the incorporation of dependencies between some of the variables and coefficients are considered.

  8. 150-MW S-band klystron program at the Stanford Linear Accelerator Center

    SciTech Connect (OSTI)

    Sprehn, D.; Caryotakis, G.; Phillips, R.M.

    1996-07-01T23:59:59.000Z

    Two S-Band klystrons operating at 150 MW have been designed, fabricated and tested at the Stanford Linear Accelerator Center (SLAC) during the past two years for use in an experimental accelerator at Deutsches Elektronen-Synchrotron (DESY) in Hamburg, Germany. Both klystrons operate at the design power, 60 Hz repetition rate, 3 {micro}s pulsewidth, with an efficiency {gt} 40%, and agreement between the experimental results and simulations is excellent. The 535 kV, 700 A electron gun was tested by constructing a solenoidal focused beam stick which identified a source of oscillation, subsequently engineered out of the klystron guns. Design of the beam stick and the two klystrons is discussed, along with observation and suppression of spurious oscillations. Differences in design and the resulting performance of the Klystrons is emphasized.

  9. SPARSE REPRESENTATIONS WITH DATA FIDELITY TERM VIA AN ITERATIVELY REWEIGHTED LEAST SQUARES ALGORITHM

    SciTech Connect (OSTI)

    WOHLBERG, BRENDT [Los Alamos National Laboratory; RODRIGUEZ, PAUL [Los Alamos National Laboratory

    2007-01-08T23:59:59.000Z

    Basis Pursuit and Basis Pursuit Denoising, well established techniques for computing sparse representations, minimize an {ell}{sup 2} data fidelity term subject to an {ell}{sup 1} sparsity constraint or regularization term on the solution by mapping the problem to a linear or quadratic program. Basis Pursuit Denoising with an {ell}{sup 1} data fidelity term has recently been proposed, also implemented via a mapping to a linear program. They introduce an alternative approach via an iteratively Reweighted Least Squares algorithm, providing greater flexibility in the choice of data fidelity term norm, and computational advantages in certain circumstances.

  10. transformations: representations

    E-Print Network [OSTI]

    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

  11. Linear Map of $D$-Algebra

    E-Print Network [OSTI]

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

  12. Inverse Stochastic Linear Programming

    E-Print Network [OSTI]

    2007-01-05T23:59:59.000Z

    The instance LandS is from the Slptestset [23] and is an electric investment planning ... investments in the electricity generation industry. The instances stormg ...

  13. Linear Programming brewer's problem

    E-Print Network [OSTI]

    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

  14. Representation of Universal Algebra

    E-Print Network [OSTI]

    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.

  15. Fractal Representation of Planar Shapes Wladyslaw Skarbek3

    E-Print Network [OSTI]

    Vialatte, François

    Fractal Representation of Planar Shapes Wladyslaw Skarbek3 Frontier Research Program RIKEN, ABS of planar shapes, (e.g. characters in the given font) a fractal operator is de#12;ned which when applied on the fractal representation. Signi#12;cant compression of data volume was obtained for shape representation

  16. Robust Linearization of RF Amplifiers Using NonLinear Internal Model Control Method

    E-Print Network [OSTI]

    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

  17. Programming models

    SciTech Connect (OSTI)

    Daniel, David J [Los Alamos National Laboratory; Mc Pherson, Allen [Los Alamos National Laboratory; Thorp, John R [Los Alamos National Laboratory; Barrett, Richard [SNL; Clay, Robert [SNL; De Supinski, Bronis [LLNL; Dube, Evi [LLNL; Heroux, Mike [SNL; Janssen, Curtis [SNL; Langer, Steve [LLNL; Laros, Jim [SNL

    2011-01-14T23:59:59.000Z

    A programming model is a set of software technologies that support the expression of algorithms and provide applications with an abstract representation of the capabilities of the underlying hardware architecture. The primary goals are productivity, portability and performance.

  18. Optimization Online - Vector Space Decomposition for Linear ...

    E-Print Network [OSTI]

    Jean Bertrand Gauthier

    2015-02-26T23:59:59.000Z

    Feb 26, 2015 ... Abstract: This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility ...

  19. Does Culture Matter? Understanding Cultural Representation in the Writing of First to Third Generation Mexican American Students in a Transitional High School to College Program

    E-Print Network [OSTI]

    Aguilar, Liz Ann Ba?ez

    2011-10-21T23:59:59.000Z

    and university level. Statement of the Problem On March 10, 2009, President Obama spoke on educational policy in the U.S. (Martin, 2009). He indicated that he would continue endorsing the ?No Child Left Behind? program for the improvement of student...

  20. Student Representation System Policy Student Representation System Policy

    E-Print Network [OSTI]

    Birmingham, University of

    Policy Student Representation System Policy 2013-14 Student Representation System Policy UNIVERSITY OF BIRMINGHAM STUDENT REPRESENTATION SYSTEM POLICY #12;Policy Student Representation System Policy 2013-14 Student Representation System Policy Index of points 1. Introduction 2. Purpose 3. Core Principles 4

  1. ModelicaXML A Modelica XML representation

    E-Print Network [OSTI]

    Zhao, Yuxiao

    >email@none.ro person> ... person job="manager"> Classified person> persons> #12;6November 04 for XML document validation person-job-attribute "job (programmer|manager) #REQUIREDModelicaXML A Modelica XML representation with Applications Adrian Pop, Peter Fritzson Programming

  2. MIXED INTEGER LINEAR PROGRAMMING FORMULATION ...

    E-Print Network [OSTI]

    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.

  3. Parallel solution of linear programs 

    E-Print Network [OSTI]

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

  4. Stripping Coupons with Linear Programming 

    E-Print Network [OSTI]

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

  5. Hermeneutics, Information and Representation

    E-Print Network [OSTI]

    Chalmers, Matthew

    Hermeneutics, Information and Representation Matthew Chalmers Computing Science, Glasgow University, United Kingdom Abstract By drawing from semiology, epistemology and philosophical hermeneutics, we for computer­supported collaborative work (CSCW). We point out similarities between discourse in hermeneutics

  6. EXTENSIONS OF GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS

    E-Print Network [OSTI]

    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

  7. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint. Technical report

    SciTech Connect (OSTI)

    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.

  8. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint

    SciTech Connect (OSTI)

    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.

  9. A note on Burer's copositive representation of mixed-binary QPs

    E-Print Network [OSTI]

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

  10. Umbra's system representation.

    SciTech Connect (OSTI)

    McDonald, Michael James

    2005-07-01T23:59:59.000Z

    This document describes the Umbra System representation. Umbra System representation, initially developed in the spring of 2003, is implemented in Incr/Tcl using concepts borrowed from Carnegie Mellon University's Architecture Description Language (ADL) called Acme. In the spring of 2004 through January 2005, System was converted to Umbra 4, extended slightly, and adopted as the underlying software system for a variety of Umbra applications that support Complex Systems Engineering (CSE) and Complex Adaptive Systems Engineering (CASE). System is now a standard part Of Umbra 4. While Umbra 4 also includes an XML parser for System, the XML parser and Schema are not described in this document.

  11. GENERALIZED DUAL FACE ALGORITHM FOR LINEAR ...

    E-Print Network [OSTI]

    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 .

  12. Optimization Online - Equivalence of an Approximate Linear ...

    E-Print Network [OSTI]

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

  13. Additional Problem: Chapter 5 Linear Algebra and Probability for Computer Science Applications This problem has to do with the programming assignment on Electric Charges in this repository

    E-Print Network [OSTI]

    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

  14. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    type safe [Nec97, MWCG99]. Furthermore, types that survive through the back end can be used to support run-time operations such as garbage collection [Tol94] and run-time type dispatch [Mor95]. The bene#12

  15. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    Turbak, Franklyn

    ), the resulting object code is certifiably type safe [Nec97, MWCG99]. Furthermore, types that survive through the back end can be used to support run­time operations such as garbage collection [Tol94] and run

  16. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    Turbak, Franklyn

    object code is certifiably type safe [Nec97, MWCG99]. Furthermore, types that survive through the back end can be used to support run-time operations such as garbage collection [Tol94] and run-time type

  17. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    Turbak, Franklyn

    ), the resulting object code is certifiably type safe [Nec97, MWCG99]. Furthermore, types that survive through the back end can be used to support run-time operations such as garbage collection [Tol94] and run

  18. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    Dimock, Allyn

    , MWCG99]. Furthermore, types that survive through the back end can be used to support run-time operations such as garbage collection [Tol94] and run-time type dispatch [Mor95]. The bene#12;ts of using

  19. Program Representation Size in an Intermediate Language

    E-Print Network [OSTI]

    Turbak, Franklyn

    object code is certifiably type safe [Nec97, MWCG99]. Furthermore, types that survive through the back end can be used to support run­time operations such as garbage collection [Tol94] and run­time type

  20. Optimization Online - Efficient First-Order Methods for Linear ...

    E-Print Network [OSTI]

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

  1. Exploiting group symmetry in semidefinite programming relaxations ...

    E-Print Network [OSTI]

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

  2. Optimization Online - Improved semidefinite programming bounds ...

    E-Print Network [OSTI]

    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.

  3. A Linear Storage-Retrieval Policy for Robust Warehouse Management

    E-Print Network [OSTI]

    Marcus Ang

    2008-11-10T23:59:59.000Z

    Nov 10, 2008 ... A Linear Storage-Retrieval Policy for Robust Warehouse Management ... Keywords: Dynamic programming, Transportation, Materials handling, ...

  4. Geometry, noncommutative algebra and representations

    E-Print Network [OSTI]

    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

  5. REPRESENTATION GROWTH OF LINEAR GROUPS MICHAEL LARSEN AND ALEXANDER LUBOTZKY

    E-Print Network [OSTI]

    Lubotzky, Alex

    Growth"--see [LS] and the references therein. Counting subgroups is essentially the same as counting(). If = G(OS) as before and if in addition satisfies the congruence subgroup property (CSP, for short), i in the Proposition is the fact that the CSP implies super-rigidity: If is a finite dimensional complex

  6. REPRESENTATION GROWTH OF LINEAR GROUPS MICHAEL LARSEN AND ALEXANDER LUBOTZKY

    E-Print Network [OSTI]

    Lubotzky, Alex

    . Counting subgroups is essentially the same as counting permutation representa- tions. In this paper we take the congruence subgroup property (CSP, for short), i.e. C( ) := ker(G"(OS) ! G

  7. Programming

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)IntegratedSpeedingTechnical News,Program Direction and Analysis DeputyStructure

  8. Lectures on Linear Algebra over Division Ring

    E-Print Network [OSTI]

    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.

  9. Small Representation Principle

    E-Print Network [OSTI]

    H. B. F. Nielsen

    2014-03-06T23:59:59.000Z

    In a previous article Don Bennett and I looked for, found and proposed a game in which the Standard Model Gauge Group $S(U(2) \\times U(3))$ gets singled out as the "winner". This "game" means that the by Nature chosen gauge group should be just that one, which has the maximal value for a quantity, which is a modification of the ratio of the quadratic Casimir for the adjoint representation and that for a "smallest" faithful representation. In a recent article I proposed to extend this "game" to construct a corresponding game between different potential dimensions for space-time. The idea is to formulate, how the same competition as the one between the potential gauge groups would run out, if restricted to the potential Lorentz or Poincare groups achievable for different dimensions of space-time $d$. The remarkable point is, that it is the experimental space-time dimension 4, which wins. It follows that the whole Standard Model is specified by requiring SMALLEST REPRESENTATIONS! Speculatively we even argue that our principle found suggests the group of gauge transformations and some manifold(suggestive of say general relativity).

  10. DOE CALiPER Program, Report 21.2: Linear (T8) LED Lamp Performance in Five Types of Recessed Troffers

    SciTech Connect (OSTI)

    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.

  11. Linear Accelerator

    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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)Integrated Codes |Is Your HomeLatestCenter (LMI-EFRC) -Choices toLeeLinear Accelerator

  12. Reduced Harmonic Representation of Partitions

    E-Print Network [OSTI]

    Michalis Psimopoulos

    2011-03-08T23:59:59.000Z

    In the present article the reduced integral representation of partitions in terms of harmonic products has been derived first by using hypergeometry and the new concept of fractional sum and secondly by studying the Fourier series of the kernel function appearing in the integral representation. Using the method of induction, a generalization of the theory has also been obtained.

  13. STANFORD LINEAR ACCELERATOR CENTER DIRECTOR'S OFFICE

    E-Print Network [OSTI]

    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

  14. Positrons for linear colliders

    SciTech Connect (OSTI)

    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)

  15. affirmative action program: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    programming Air pollution modeling: proportional rollback, Gaussian transport, emissions trading Location of waste disposal facilities, integer linear programming Dissolved...

  16. Universal Linear Optics

    E-Print Network [OSTI]

    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.

  17. LR: Compact connectivity representation for triangle meshes

    SciTech Connect (OSTI)

    Gurung, T; Luffel, M; Lindstrom, P; Rossignac, J

    2011-01-28T23:59:59.000Z

    We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.

  18. Graph dynamics : learning and representation

    E-Print Network [OSTI]

    Ribeiro, Andre Figueiredo

    2006-01-01T23:59:59.000Z

    Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision ...

  19. Symmetries in Integer Programs

    E-Print Network [OSTI]

    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.

  20. Quantum Field Theory and Representation Theory

    E-Print Network [OSTI]

    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

  1. on an efficient implementation of the face algorithm for linear ...

    E-Print Network [OSTI]

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

  2. Generating All Efficient Extreme Points in Multiple Objective Linear ...

    E-Print Network [OSTI]

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

  3. Outcome-Space Outer Approximation Algorithm for Linear ...

    E-Print Network [OSTI]

    2007-07-20T23:59:59.000Z

    Jul 20, 2007 ... This paper presents an outcome-space outer approximation algo- rithm for globally solving the linear multiplicative programming prob- lem.

  4. assessment program final: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    25 Next Page Last Page Topic Index 1 Stanford Geothermal Program Final Report Renewable Energy Websites Summary: Linear Programming1 Stanford Geothermal Program Final Report July...

  5. apprenticeship program final: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    to and screened Jun, Suckjoon 15 Stanford Geothermal Program Final Report Renewable Energy Websites Summary: Linear Programming1 Stanford Geothermal Program Final Report July...

  6. MATH 511: Linear Algebra

    E-Print Network [OSTI]

    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

  7. On semidefinite programming bounds for graph bandwidth

    E-Print Network [OSTI]

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

  8. Evolution Operators for Linearly Polarized Two-Killing Cosmological Models

    E-Print Network [OSTI]

    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.

  9. Representation of noncommutative phase space

    E-Print Network [OSTI]

    Kang Li; Jianhua Wang; Chiyi Chen

    2005-08-16T23:59:59.000Z

    The representations of the algebra of coordinates and momenta of noncommutative phase space are given. We study, as an example, the harmonic oscillator in noncommutative space of any dimension. Finally the map of Sch$\\ddot{o}$dinger equation from noncommutative space to commutative space is obtained.

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

  11. Iterative Estimation Maximization for Stochastic Linear Programs ...

    E-Print Network [OSTI]

    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.

  12. Optimal portfolios using Linear Programming models

    E-Print Network [OSTI]

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

  13. A computer program for linear models

    E-Print Network [OSTI]

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

  14. Polynomial Approximations for Continuous Linear Programs

    E-Print Network [OSTI]

    2012-04-05T23:59:59.000Z

    where the cost rate c(t), the right hand side vector b(t) as well as the matrices. G(t) and H(t, ... dual approximations, respectively, estimates the degree of suboptimality of the ...... the matrix of capital coefficients, where Bij defines the stock of good i required per unit of ...... In Optimization methods for resource allocation (Proc.

  15. Linear Programming Algorithms for Sparse Filter Design

    E-Print Network [OSTI]

    Baran, Thomas A.

    In designing discrete-time filters, the length of the impulse response is often used as an indication of computational cost. In systems where the complexity is dominated by arithmetic operations, the number of nonzero ...

  16. Apprentice Program: Linear Algebra Instructor: Miklos Abert

    E-Print Network [OSTI]

    Babai, László

    is the dot product of the ith row of A with the jth column of B. In particular, if n = 1 and m = 1 (i.e., A is a row vector and B is a column vector) then AB is simply the dot product of A and B. The set of all n number (written (i j) in cycle notation) is called a transposition. Consider now the bubble sort

  17. Analysis of Copositive Optimization Based Linear Programming ...

    E-Print Network [OSTI]

    2014-04-18T23:59:59.000Z

    inner approximations of the cone C. More specifically, the corresponding inner approxima- tions are given by. Ir := ?. ?. ?. ? d??r n ?d ddT : ?d ? 0 for each d

  18. Optimization Online - Decomposition theorems for linear programs

    E-Print Network [OSTI]

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

  19. SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...

    E-Print Network [OSTI]

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

  20. Limitations of Linear and Semidefinite Programs

    E-Print Network [OSTI]

    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-

  1. Using Enhanced Spherical Images for Object Representation

    E-Print Network [OSTI]

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

  2. Quantum Mechanics and Representation Theory Columbia University

    E-Print Network [OSTI]

    Woit, Peter

    Quantum Mechanics and Representation Theory Peter Woit Columbia University Texas Tech, November 21 2013 Peter Woit (Columbia University) Quantum Mechanics and Representation Theory November 2013 1 / 30, 1967 Peter Woit (Columbia University) Quantum Mechanics and Representation Theory November 2013 2 / 30

  3. Context Representation for Web Search Results

    E-Print Network [OSTI]

    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

  4. IAI : Knowledge Representation John A. Bullinaria, 2005

    E-Print Network [OSTI]

    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

  5. Temporal Representation in Semantic Graphs

    SciTech Connect (OSTI)

    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.

  6. Generalized Linear Quadratic Control

    E-Print Network [OSTI]

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

  7. The Microscopic Linear Dynamics

    E-Print Network [OSTI]

    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

  8. Introduction Linear Dynamics

    E-Print Network [OSTI]

    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

  9. 1 INTRODUCTION An application of the finite element method (FEM) for non-linear elastoplastic analysis of rein-

    E-Print Network [OSTI]

    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

  10. Introduction to Linear Relaxations

    E-Print Network [OSTI]

    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

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

  12. Irreducibility of the Lawrence-Krammer representation of the BMW algebra of type $A_{n-1}$

    E-Print Network [OSTI]

    Levaillant, Claire Isabelle

    2008-01-01T23:59:59.000Z

    It is known that the Lawrence-Krammer representation of the Artin group of type $A_{n-1}$ based on the two parameters $t$ and $q$ that was used by Krammer and independently by Bigelow to show the linearity of the Braid group on $n$ strands is generically irreducible. Here, we recover this result and show further that for some complex specializations of the parameters the representation is reducible. We give all the values of the parameters for which the representation is reducible as well as the dimensions of the invariant subspaces. We deduce some results of semisimplicity of the Birman-Murakami-Wenzl algebra of type $A_{n-1}$.

  13. Fast linear algebra is stable

    E-Print Network [OSTI]

    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–

  14. GRADUATE PROGRAM UNDERGRADUATE PROGRAMS

    E-Print Network [OSTI]

    SELF STUDY GRADUATE PROGRAM UNDERGRADUATE PROGRAMS DEPARTMENT OF POLITICAL SCIENCE COLLEGE OF LIBERALARTS TEXAS A&M UNIVERSITY March 2007 #12;SELF STUDY GRADUATE PROGRAM UNDERGRADUATE PROGRAMS DEPARTMENT........................................................................................ 4 Brief History of Degree Programs and the Department

  15. ON AUTOMORPHY OF CERTAIN GALOIS REPRESENTATIONS OF ...

    E-Print Network [OSTI]

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

  16. Knowledge and Skill Representations for Robotized Production

    E-Print Network [OSTI]

    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

  17. Gendering Representation: Parties, Institutions, and the Under-Representation Of Women In Brazil's State Legislatures

    E-Print Network [OSTI]

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

  18. Fault tolerant linear actuator

    DOE Patents [OSTI]

    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.

  19. Using Linearity Web Copyright 2007

    E-Print Network [OSTI]

    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

  20. Bad semidefinite programs: they all look the same 1 Introduction

    E-Print Network [OSTI]

    2014-05-14T23:59:59.000Z

    Conic linear programs provide a natural framework to study duality in convex programs, and model a wide variety of practical optimization problems.

  1. Optimization Online - A novel integer programming formulation for ...

    E-Print Network [OSTI]

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

  2. Super Linear Algebra

    E-Print Network [OSTI]

    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.

  3. August 2000 ((Mixed) Integer Nonlinear Programming ) Sven Leyffer ...

    E-Print Network [OSTI]

    ((Mixed) Integer Linear Programming ) ... Facets of The Cardinality Constrained Circuit Polytope ..... Analysis of MILP Techniques for the Pooling Problem

  4. Knowledge representation in process engineering Ulrike Sattler

    E-Print Network [OSTI]

    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.rwth­aachen.de Abstract Process engineering is surely no pure con­ figuration application, but modeling the structure

  5. Rational Univariate Representation 1 Stickelberger's Theorem

    E-Print Network [OSTI]

    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

  6. Topics in Representation Theory: The Heisenberg Algebra

    E-Print Network [OSTI]

    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

  7. Representations of Petri net interactions Pawel Sobocinski

    E-Print Network [OSTI]

    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

  8. DNA Motif Representation with Nucleotide Dependency

    E-Print Network [OSTI]

    Chin, Francis Y.L.

    DNA Motif Representation with Nucleotide Dependency Francis Chin1 and Henry Leung1 1 Department, these representations cannot model biological binding sites well because they fail to capture nucleotide interdependence. It has been pointed out by many researchers that the nucleotides of the DNA binding site cannot

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

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

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

  12. 1Q 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 January  to March  2002. Data for these indicators are gathered by the Field...

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

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

  15. A Linear Parabolic Trough Solar Collector Performance Model

    E-Print Network [OSTI]

    Qu, M.; Archer, D.; Masson, S.

    2006-01-01T23:59:59.000Z

    A performance model has been programmed for solar thermal collector based on a linear, tracking parabolic trough reflector focused on a surface-treated metallic pipe receiver enclosed in an evacuated transparent tube: a Parabolic Trough Solar...

  16. E-model for Transportation Problem of Linear Stochastic Fractional ...

    E-Print Network [OSTI]

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

  17. Active recognition enhances the representation of behaviorally relevant information in single auditory forebrain neurons

    E-Print Network [OSTI]

    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: 1690­1703, 2013. First pub- lished January 9, 2013; doi:10.1152/jn.00461.2012.--Sensory sys

  18. Application of separable programming to optimization by geometric programming

    E-Print Network [OSTI]

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

  19. Free Oscillations of a Linear Oscillator Eugene Butikov

    E-Print Network [OSTI]

    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

  20. Linear Motor Powered Transportation

    E-Print Network [OSTI]

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

  1. Optimization Online - Linear-quadratic control problem with a linear ...

    E-Print Network [OSTI]

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

  2. Towards OWL-based Knowledge Representation in Petrology

    E-Print Network [OSTI]

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

  3. Optimization Online - Integer Programming Submissions - 2013

    E-Print Network [OSTI]

    January 2013. (Mixed) Integer Linear Programming ... Memory-Aware Parallelized RLT3 for Solving Quadratic Assignment Problems Peter Hahn, Amir Roth, ...

  4. Improved semidefinite programming bounds for quadratic ...

    E-Print Network [OSTI]

    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.

  5. ON SEMIDEFINITE PROGRAMMING RELAXATIONS OF THE ...

    E-Print Network [OSTI]

    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.

  6. Converting Boundary Representation Solid Models to Half-Space Representation Models for Monte Carlo Analysis

    SciTech Connect (OSTI)

    Davis JE, Eddy MJ, Sutton TM, Altomari TJ

    2007-03-01T23:59:59.000Z

    Solid modeling computer software systems provide for the design of three-dimensional solid models used in the design and analysis of physical components. The current state-of-the-art in solid modeling representation uses a boundary representation format in which geometry and topology are used to form three-dimensional boundaries of the solid. The geometry representation used in these systems is cubic B-spline curves and surfaces--a network of cubic B-spline functions in three-dimensional Cartesian coordinate space. Many Monte Carlo codes, however, use a geometry representation in which geometry units are specified by intersections and unions of half-spaces. This paper describes an algorithm for converting from a boundary representation to a half-space representation.

  7. 6, 74277469, 2006 Linear ozone

    E-Print Network [OSTI]

    Boyer, Edmond

    ACPD 6, 7427­7469, 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

  8. Mental Representations Formed From Educational Website Formats

    SciTech Connect (OSTI)

    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.

  9. Evaluating Hydrology Preservation of Simplified Terrain Representations

    E-Print Network [OSTI]

    Varela, Carlos

    Evaluating Hydrology Preservation of Simplified Terrain Representations Ph. D. Student: Christopher captures the hydrology is important for determining the effectiveness of a terrain simplification technique also present a novel ter- rain simplification algorithm based on the compression of hydrology features

  10. Evaluating Hydrology Preservation of Simplified Terrain Representations

    E-Print Network [OSTI]

    Franklin, W. Randolph

    Evaluating Hydrology Preservation of Simplified Terrain Representations Jonathan Muckella , Marcus network. A quan- titative measurement of how accurately a drainage network captures the hydrology to preserve the important hydrology features. This method and other simplification schemes are then evaluated

  11. Towards improving phenotype representation in OWL

    E-Print Network [OSTI]

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

  12. Text representations in digital hypermedia library systems 

    E-Print Network [OSTI]

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

  13. Harmonic Representation of Combinations and Partitions

    E-Print Network [OSTI]

    Michalis Psimopoulos

    2011-03-01T23:59:59.000Z

    In the present article a new method of deriving integral representations of combinations and partitions in terms of harmonic products has been established. This method may be relevant to statistical mechanics and to number theory.

  14. QUASI-REPRESENTATIONS OF SURFACE GROUPS 1 ...

    E-Print Network [OSTI]

    2012-07-13T23:59:59.000Z

    C?-algebra. 1. Introduction. Let G be a discrete countable group. In [3,4] the ... conjecture, a unital finite dimensional representation ?: C?(G) ? Mr(C) induces ...

  15. Representations up to homotopy of Lie algebroids

    E-Print Network [OSTI]

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

  16. Robust Linear Optimization With Recourse

    E-Print Network [OSTI]

    2010-05-19T23:59:59.000Z

    We propose an approach to two-stage linear optimization with recourse that does ... Linear optimization with recourse was first introduced by Dantzig in [17] as a ...

  17. Comparing Single and Multiple Turbine Representations in a Wind Farm Simulation: Preprint

    SciTech Connect (OSTI)

    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.

  18. INDECOMPOSABLE REPRESENTATIONS FOR REAL ROOTS OF A WILD QUIVER

    E-Print Network [OSTI]

    Su, Xiuping

    INDECOMPOSABLE REPRESENTATIONS FOR REAL ROOTS OF A WILD QUIVER BERNT TORE JENSEN AND XIUPING SU wild quiver. We define operations which act on representations of this quiver, and using representation and the generic representation coincide. We will see that for wild quivers, the situation can

  19. Spectral learning of linear dynamics from generalised-linear observations

    E-Print Network [OSTI]

    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

  20. Linear Quantum Feedback Networks

    E-Print Network [OSTI]

    J. Gough; R. Gohm; M. Yanagisawa

    2008-07-15T23:59:59.000Z

    The mathematical theory of quantum feedback networks has recently been developed for general open quantum dynamical systems interacting with bosonic input fields. In this article we show, for the special case of linear dynamical systems Markovian systems with instantaneous feedback connections, that the transfer functions can be deduced and agree with the algebraic rules obtained in the nonlinear case. Using these rules, we derive the the transfer functions for linear quantum systems in series, in cascade, and in feedback arrangements mediated by beam splitter devices.

  1. Pressure vs. decibel modulation in spectrotemporal representations

    E-Print Network [OSTI]

    Simon, Jonathan Z.

    by the inverse-repeat method) relative to the that of the linearized response. Nominal Stimulus Modulation-Inverted

  2. Functional Answer Set Programming

    E-Print Network [OSTI]

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

  3. Optimal linear Glauber model

    E-Print Network [OSTI]

    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.

  4. Interval Linear Algebra

    E-Print Network [OSTI]

    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.

  5. Nonlinear programming with feedforward neural networks.

    SciTech Connect (OSTI)

    Reifman, J.

    1999-06-02T23:59:59.000Z

    We provide a practical and effective method for solving constrained optimization problems by successively training a multilayer feedforward neural network in a coupled neural-network/objective-function representation. Nonlinear programming problems are easily mapped into this representation which has a simpler and more transparent method of solution than optimization performed with Hopfield-like networks and poses very mild requirements on the functions appearing in the problem. Simulation results are illustrated and compared with an off-the-shelf optimization tool.

  6. Control of linear systems subject to input constraints: a polynomial approach. \\Lambda

    E-Print Network [OSTI]

    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 discrete­time linear systems

  7. Natural geometric representation for electron local observables

    SciTech Connect (OSTI)

    Minogin, V.G., E-mail: minogin@isan.troitsk.ru

    2014-03-15T23:59:59.000Z

    An existence of the quartic identities for the electron local observables that define orthogonality relations for the 3D quantities quadratic in the electron observables is found. It is shown that the joint solution of the quartic and bilinear identities for the electron observables defines a unique natural representation of the observables. In the natural representation the vector type electron local observables have well-defined fixed positions with respect to a local 3D orthogonal reference frame. It is shown that the natural representation of the electron local observables can be defined in six different forms depending on a choice of the orthogonal unit vectors. The natural representation is used to determine the functional dependence of the electron wave functions on the local observables valid for any shape of the electron wave packet. -- Highlights: •Quartic identities that define the orthogonality relations for the electron local observables are found. •Joint solution of quartic and bilinear identities defines a unique natural representation of the electron local observables. •Functional dependence of the electron wave functions on the electron local observables is determined.

  8. Visualization of Program-Execution Data for Deployed

    E-Print Network [OSTI]

    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

  9. Duality in linearized gravity

    SciTech Connect (OSTI)

    Henneaux, Marc; Teitelboim, Claudio [Physique Theorique et Mathematique and International Solvay Institutes, Universite Libre de Bruxelles, Campus Plaine C. P. 231, B-1050 Brussels (Belgium) and Centro de Estudios Cientificos (CECS), Valdivia (Chile); Centro de Estudios Cientificos (CECS), Valdivia (Chile)

    2005-01-15T23:59:59.000Z

    We show that duality transformations of linearized gravity in four dimensions, i.e., rotations of the linearized Riemann tensor and its dual into each other, can be extended to the dynamical fields of the theory so as to be symmetries of the action and not just symmetries of the equations of motion. Our approach relies on the introduction of two superpotentials, one for the spatial components of the spin-2 field and the other for their canonically conjugate momenta. These superpotentials are two-index, symmetric tensors. They can be taken to be the basic dynamical fields and appear locally in the action. They are simply rotated into each other under duality. In terms of the superpotentials, the canonical generator of duality rotations is found to have a Chern-Simons-like structure, as in the Maxwell case.

  10. Bistructures, Bidomains and Linear Logic 

    E-Print Network [OSTI]

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

  11. Linear induction accelerator

    DOE Patents [OSTI]

    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.

  12. Combustion powered linear actuator

    DOE Patents [OSTI]

    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.

  13. The International Linear Collider

    E-Print Network [OSTI]

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

  14. arXiv:0805.0396v1 REPRESENTATION GROWTH OF LINEAR GROUPS

    E-Print Network [OSTI]

    Lubotzky, Alex

    \\Subgroup Growth"|see [LS] and the references therein. Counting subgroups is essentially the same property (CSP, for short), i.e. C() := ker ( \\ G(O S ) ! G( ^ O S )) is #12;nite, then A() can be described in the Proposition is the fact that the CSP implies super-rigidity: If #26; is a #12;nite dimensional complex

  15. Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation

    SciTech Connect (OSTI)

    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.

  16. Linear Collider Physics Resource Book Snowmass 2001

    SciTech Connect (OSTI)

    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.

  17. An assessment of natural history representation in Texas state parks and natural areas

    E-Print Network [OSTI]

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

  18. Hybrid electromagnetic transient simulation with the state variable representation of HVDC converter plant

    SciTech Connect (OSTI)

    Zavahir, J.M.; Arrillaga, J.; Watson, N.R. (Univ. of Canterbury, Christchurch (New Zealand))

    1993-07-01T23:59:59.000Z

    The two alternative methods in current use for the transient simulation of HVdc power systems are Electromagnetic Transient Programs and State Variable Analysis. A hybrid algorithm is described in this paper which combines the two methods selecting their best features. The relative performances of conventional and hybrid algorithms are discussed. Simulation results of typical back-to back HVdc link show that the hybrid representation provides more stable, accurate and efficient solutions.

  19. Representation Issues in Neighborhood Search and

    E-Print Network [OSTI]

    Whitley, Darrell

    . Yet, we also know that no search method is better than another over all possible problems is better than any other over all possible discrete functions. Radcliffe and Surry (1995) extend these notions to also cover the idea that all representations are equivalent when their behavior is considered

  20. ACQUIRED EQUIVALENCE CHANGES STIMULUS REPRESENTATIONS , D. SHOHAMY

    E-Print Network [OSTI]

    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

  1. Theta Representations Of Odd Orthogonal Groups

    E-Print Network [OSTI]

    Bump, Daniel

    Theta Representations Of Odd Orthogonal Groups This is a report on three papers of Daniel Bump'ns of semisimple G \\Theta SLn were given in a uniform way by Kazhdan and Savin (1989) when G is simply­laced (all

  2. FROM NORLUND MATRICES TO LAPLACE REPRESENTATIONS

    E-Print Network [OSTI]

    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

  3. THE BREUILMEZARD CONJECTURE FOR POTENTIALLY BARSOTTITATE REPRESENTATIONS.

    E-Print Network [OSTI]

    Kisin, Mark

    THE BREUIL­M´EZARD CONJECTURE FOR POTENTIALLY BARSOTTI­TATE REPRESENTATIONS. TOBY GEE AND MARK, proving a variety of results including the Buzzard­Diamond­Jarvis conjecture. Contents Overview. 2.3. Patching 14 3.4. Potential diagonalizability 18 3.5. Local results 20 4. The Buzzard­Diamond­Jarvis

  4. Issues in Temporal Representation of Multimedia Documents

    E-Print Network [OSTI]

    Joseph Fourier Grenoble-I, Université

    Issues in Temporal Representation of Multimedia Documents Nabil Layaïda OPERA project, INRIA Rhône the means of increasing the rich­ ness of information contained in electronic documents. One of the goals of the Opera team is designing an authoring environment for multimedia documents, called MADEUS, which meets

  5. Neuronal Representations of Learning Sensorimotor Skills

    E-Print Network [OSTI]

    of learning-related changes: additional controls and simulations....68-74 V. Viewing and Doing: SimilarNeuronal Representations of Learning Sensorimotor Skills Thesis submitted for the degree "Doctor.......................................................................................26-47 II. Preparatory Activity in Motor Cortex Reflects Learning of Local Visuomotor Skills

  6. Bayes Nets Representation: joint distribution and conditional

    E-Print Network [OSTI]

    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

  7. Taylor Expansion Diagrams: A Canonical Representation for

    E-Print Network [OSTI]

    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

  8. Video Indexing Based on Mosaic Representations

    E-Print Network [OSTI]

    Shapiro, Ehud

    1 Video Indexing Based on Mosaic Representations Michal Irani P. Anandan Abstract| Video is a rich is implicitly buried inside the raw video data, and is provided with the cost of very high temporal redundancy. While the standard sequential form of video storage is ad- equate for viewing in a "movie mode

  9. A Highly Linear Broadband LNA

    E-Print Network [OSTI]

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

  10. Narratives of Contamination: Representations of Race, Gender, and Disease in Nineteenth Century Cuban Fiction

    E-Print Network [OSTI]

    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

  11. Explicit representations for multiscale Lévy processes, and asymptotics of multifractal conservation laws

    E-Print Network [OSTI]

    K. Górska; W. A. Woyczynski

    2015-02-01T23:59:59.000Z

    Nonlinear conservation laws driven by L\\'evy processes have solutions which, in the case of supercritical nonlinearities, have an asymptotic behavior dictated by the solutions of the linearized equations. Thus the explicit representation of the latter is of interest in the nonlinear theory. In this paper we concentrate on the case where the driving L\\'evy process is a multiscale stable (anomalous) diffusion, which corresponds to the case of multifractal conservation laws considered in [1-4]. The explicit representations, building on the previous work on single-scale problems (see, e.g.,[5]), are developed in terms of the special functions (such as Meijer G functions), and are amenable to direct numerical evaluations of relevant probabilities.

  12. Wave functions of linear systems

    E-Print Network [OSTI]

    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.

  13. Special set linear algebra and special set fuzzy linear algebra

    E-Print Network [OSTI]

    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.

  14. Representation of Energy Use in the Food Products Industry 

    E-Print Network [OSTI]

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

  15. PRODUCT REPRESENTATION IN LIGHTWEIGHT FORMATS FOR PRODUCT LIFECYCLE MANAGEMENT (PLM)

    E-Print Network [OSTI]

    Rzepa, Henry S.

    PRODUCT REPRESENTATION IN LIGHTWEIGHT FORMATS FOR PRODUCT LIFECYCLE MANAGEMENT (PLM) Lian Ding environments and the entire product lifecycle. There are new requirements for product representations, including: platform/application independence, support for the product lifecycle, rapidly sharing information

  16. Complex-wide representation of material packaged in 3013 containers

    SciTech Connect (OSTI)

    Narlesky, Joshua E.; Peppers, Larry G.; Friday, Gary P.

    2009-06-01T23:59:59.000Z

    The DOE sites packaging plutonium oxide materials packaged according to Department of Energy 3013 Standard (DOE-STD-3013) are responsible for ensuring that the materials are represented by one or more samples in the Materials Identification and Surveillance (MIS) program. The sites categorized most of the materials into process groups, and the remaining materials were characterized, based on the prompt gamma analysis results. The sites issued documents to identify the relationships between the materials packaged in 3013 containers and representative materials in the MIS program. These “Represented” documents were then reviewed and concurred with by the MIS Working Group. However, these documents were developed uniquely at each site and were issued before completion of sample characterization, small-scale experiments, and prompt gamma analysis, which provided more detailed information about the chemical impurities and the behavior of the material in storage. Therefore, based on the most recent data, relationships between the materials packaged in 3013 containers and representative materials in the MIS program been revised. With the prompt gamma analysis completed for Hanford, Rocky Flats, and Savannah River Site 3013 containers, MIS items have been assigned to the 3013 containers for which representation is based on the prompt gamma analysis results. With the revised relationships and the prompt gamma analysis results, a Master “Represented” table has been compiled to document the linkages between each 3013 container packaged to date and its representative MIS items. This table provides an important link between the Integrated Surveillance Program database, which contains information about each 3013 container to the MIS items database, which contains the characterization, prompt gamma data, and storage behavior data from shelf-life experiments for the representative MIS items.

  17. Representation Theory, Geometry & Combinatorics Organizer: M. Haiman and N. Reshetikhin

    E-Print Network [OSTI]

    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

  18. Anomaly-free representations of the holonomy-flux algebra

    E-Print Network [OSTI]

    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.

  19. Extremely local MR representations: Youngmi Hur1 & Amos Ron2

    E-Print Network [OSTI]

    Maryland at College Park, University of

    Extremely local MR representations: L-CAMP Youngmi Hur1 & Amos Ron2 Workshop on sparse representations: UMD, May 2005 1 Math, UW-Madison 2 CS, UW-Madison #12;Wavelet and framelet constructions History of all local MR representations #12;L-CAMP: Extremely local MR constructions Bird's view of the CAP

  20. Animal representations and animal remains at Çatalhöyük

    E-Print Network [OSTI]

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

  1. Inverse operator representations of quantum phase

    E-Print Network [OSTI]

    G. M. Saxena

    2008-03-14T23:59:59.000Z

    We define quantum phase in terms of inverses of annihilation and creation operators. We show that like Susskind - Glogower phase operators, the measured phase operators and the unitary phase operators can be defined in terms of the inverse operators. However, for the unitary phase operator the Hilbert space includes the negative energy states. The quantum phase in inverse operator representation may find the applications in the field of quantum optics particularly in the squeezed states.

  2. Virasoro Representations on (Diff S1)/S1 Coadjoint Orbits

    E-Print Network [OSTI]

    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.

  3. A NOVEL INTEGER PROGRAMMING FORMULATION FOR THE K ...

    E-Print Network [OSTI]

    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.

  4. Code verification by static analysis: a mathematical programming ...

    E-Print Network [OSTI]

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

  5. On solving multistage stochastic programs with coherent risk ...

    E-Print Network [OSTI]

    A. B. Philpott

    2012-08-13T23:59:59.000Z

    Aug 13, 2012 ... Abstract: We consider a class of multistage stochastic linear programs in which at each stage a coherent risk measure of future costs is to be ...

  6. Euclid Programming

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

  7. 6, 66276694, 2006 linearized ozone

    E-Print Network [OSTI]

    Boyer, Edmond

    ACPD 6, 6627­6694, 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, 6627­6694, 2006 CHEM2D-OPP linearized ozone photochemistry J. P. McCormack et al

  8. Winding for linear pump

    DOE Patents [OSTI]

    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.

  9. Winding for linear pump

    DOE Patents [OSTI]

    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.

  10. Reformulations, Relaxations and Cutting Planes for Linear Generalized Disjunctive

    E-Print Network [OSTI]

    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

  11. Decomposition and Dynamic Cut Generation in Integer Linear ...

    E-Print Network [OSTI]

    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.

  12. GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS

    E-Print Network [OSTI]

    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

  13. Quantization of general linear electrodynamics

    SciTech Connect (OSTI)

    Rivera, Sergio; Schuller, Frederic P. [Albert Einstein Institute, Max Planck Institute for Gravitational Physics, Am Muehlenberg 1, 14476 Potsdam (Germany)

    2011-03-15T23:59:59.000Z

    General linear electrodynamics allow for an arbitrary linear constitutive relation between the field strength 2-form and induction 2-form density if crucial hyperbolicity and energy conditions are satisfied, which render the theory predictive and physically interpretable. Taking into account the higher-order polynomial dispersion relation and associated causal structure of general linear electrodynamics, we carefully develop its Hamiltonian formulation from first principles. Canonical quantization of the resulting constrained system then results in a quantum vacuum which is sensitive to the constitutive tensor of the classical theory. As an application we calculate the Casimir effect in a birefringent linear optical medium.

  14. Frank Masci (1)MIPS D/L Review (S5), February 28, 2001 24m SUR-mode Linearization

    E-Print Network [OSTI]

    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

  15. 2012 Damon A. Miller Page 1 of 4 4: Transfer Functions, Parameters, and Equivalent Circuits of Linear

    E-Print Network [OSTI]

    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

  16. Identifying Redundant Linear Constraints in Systems of Linear ...

    E-Print Network [OSTI]

    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.

  17. Linear Algebra 1: Computing canonical forms in exact linear

    E-Print Network [OSTI]

    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

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

  19. Infinite Time Optimal Control of Hybrid Systems with a Linear Performance Index Mato Baotic, Frank J. Christophersen, and Manfred Morari

    E-Print Network [OSTI]

    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

  20. Typing Illegal Information Flows as Program Effects Draft

    E-Print Network [OSTI]

    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

  1. Representations of groups of order 16

    E-Print Network [OSTI]

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

  2. BASHIR et al.: GAIT REPRESENTATION USING FLOW FIELDS 1 Gait Representation Using Flow Fields

    E-Print Network [OSTI]

    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

  3. Program School/ Career: Descripton ISIS Program Codes

    E-Print Network [OSTI]

    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

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

  5. Fusion Algebras Induced by Representations of the Modular Group

    E-Print Network [OSTI]

    W. Eholzer

    1992-11-27T23:59:59.000Z

    Using the representation theory of the subgroups SL_2(Z_p) of the modular group we investigate the induced fusion algebras in some simple examples. Only some of these representations lead to 'good' fusion algebras. Furthermore, the conformal dimensions and the central charge of the corresponding rational conformal field theories are calculated. Two series of representations which can be realized by unitary theories are presented. We show that most of the fusion algebras induced by admissible representations are realized in well known rational models.

  6. Irreducibility of the Lawrence-Krammer representation of the BMW algebra of type $A_{n-1}$, PhD thesis California Institute of Technology 2008

    E-Print Network [OSTI]

    Levaillant, Claire

    2009-01-01T23:59:59.000Z

    Given two nonzero complex parameters $l$ and $m$, we construct by the mean of knot theory a matrix representation of size $\\chl$ of the BMW algebra of type $A_{n-1}$ with parameters $l$ and $m$ over the field $\\Q(l,r)$, where $m=\\unsurr-r$. As a representation of the braid group on $n$ strands, it is equivalent to the Lawrence-Krammer representation that was introduced by Lawrence and Krammer to show the linearity of the braid groups. We prove that the Lawrence-Krammer representation is generically irreducible, but that for some values of the parameters $l$ and $r$, it becomes reducible. In particular, we show that for these values of the parameters $l$ and $r$, the BMW algebra is not semisimple. When the representation is reducible, the action on a proper invariant subspace of the Lawrence-Krammer space must be a Hecke algebra action. It allows us to describe the invariant subspaces when the representation is reducible.

  7. Bilevel Programming and the Separation Problem

    E-Print Network [OSTI]

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

  8. Global Inference for Sentence Compression: An Integer Linear Programming Approach 

    E-Print Network [OSTI]

    Clarke, James

    2008-01-01T23:59:59.000Z

    In this thesis we develop models for sentence compression. This text rewriting task has recently attracted a lot of attention due to its relevance for applications (e.g., summarisation) and simple formulation by means ...

  9. Multi-stage Stochastic Linear Programming: Scenarios Versus Events

    E-Print Network [OSTI]

    2010-05-17T23:59:59.000Z

    †laureano.escudero@urjc.es, Statistics and Operations Research, Rey Juan Carlos University, Madrid ..... where f?[t] and f?t , are joint and marginal distributions, respectively. ...... site production planning problem in an uncertain environment.

  10. mixed zero-one linear programs under objective uncertainty

    E-Print Network [OSTI]

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

  11. A new method for solving linear fractional programming problems By ...

    E-Print Network [OSTI]

    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

  12. Equivalence of an Approximate Linear Programming Bound with the ...

    E-Print Network [OSTI]

    2013-03-06T23:59:59.000Z

    Mar 6, 2013 ... management [5], stochastic games [32] and stochastic vehicle routing [47]. ...... The traveling-salesman problem and minimum spanning trees, ...

  13. A Pivoting Algorithm for Linear Programs with Complementarity ...

    E-Print Network [OSTI]

    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.

  14. Protein Helical Topology Prediction Using Mixed-Integer Linear Programming

    E-Print Network [OSTI]

    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

  15. Objective space for multiple objectives linear fractional programming ...

    E-Print Network [OSTI]

    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.

  16. Sequential Linear Programming Coordination Strategy for Deterministic and Probabilistic

    E-Print Network [OSTI]

    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

  17. Improved Linear Programming Bounds for Antipodal Spherical Codes

    E-Print Network [OSTI]

    and include all codes obtained as the collection of minimal vectors in a lattice. ... We also show that for n = 4, 6 and 7 the antipodal codes with. maximal kissing ...

  18. Economic analysis of the Stiles Farm: a linear programming approach

    E-Print Network [OSTI]

    Barreyro, Hector Ramon

    1971-01-01T23:59:59.000Z

    cotton allotrent; 1, 033. 5 ac. & X (ll) For feed crain base; 1, 498 ac. & X In the case of' objective function two' the acreace restriction equations are: (12) . -. 'or effecti. v cottcn allotment; 1, 033. 5 ac. & X + X 7 (13) 7 :"or dc:. stic... cotton alloi~~t; 671. 77 ac. & X (14) =or cotton diverted acres; 310. 00 ac. & X + X (15) (16) :-or feed gra'n base; 1, 498. 00 ac. & X3 + X4 + X5 . or dom-. stic feed crain base; 749. 00 ac. & X3 (17) For paic crain sorghum diversion. 499. 00 ac...

  19. Chance Constrained Mixed Integer Program: Bilinear and Linear ...

    E-Print Network [OSTI]

    2014-05-31T23:59:59.000Z

    typically introduced to model decisions with concrete definitions in practice, e.g., quantity of ..... Indeed, given that our testing instances are unstructured, we.

  20. How bad is a gradient algorithm for linear programming?

    E-Print Network [OSTI]

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

  1. A strong polynomial gradient algorithm in Linear Programming

    E-Print Network [OSTI]

    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.

  2. Large-Scale Linear Programming Techniques for the Design of ...

    E-Print Network [OSTI]

    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.

  3. Linear programming optimization for aquifer influence functions on microcomputers

    E-Print Network [OSTI]

    Brown, Don L

    1989-01-01T23:59:59.000Z

    NO FEASIBLE SOLUTION * I ) GOIO 600 25 CONTINUE INE=O I COUNT=ICDUNT+1 MM=O MPH=0 C C ******************************************************************* C * * C * CHECKING ROW INDICATORS FOR FEASIBILITY. * C * DEZERMINE THE ~ ABSOIUTE CHANGE...

  4. Calmness of linear programs under perturbations of all data

    E-Print Network [OSTI]

    M.J. Cánovas

    2014-05-26T23:59:59.000Z

    May 26, 2014 ... Abstract: This paper provides operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing ...

  5. A Stable Primal-Dual Approach for Linear Programming under ...

    E-Print Network [OSTI]

    2007-12-13T23:59:59.000Z

    computations in this section were done on a Sun-Fire-480R running SunOS 5.8. ... negative effect that the loss of sparsity has on the stable direct solver, since ..... centiat thesis, Department of Mathematics, Linköping University, Sweden, 1991.

  6. Constraint Reduction for Linear Programs with Many Inequality ...

    E-Print Network [OSTI]

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

  7. An Augmented Primal-Dual Method for Linear Conic Programs

    E-Print Network [OSTI]

    2007-04-11T23:59:59.000Z

    Apr 11, 2007 ... apd-function with a conjugate gradient method illustrate the ... as a conjugate gradient type method or a limited memory BFGS method.

  8. Higher-order Linear Logic Programming of Categorial Deduction

    E-Print Network [OSTI]

    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

  9. A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 1 ...

    E-Print Network [OSTI]

    2007-10-15T23:59:59.000Z

    its approximation Devex rule [6] are now accepted to be as the best ones, and are commonly used in commercial packages, such as CPLEX [1, 7]. Recently, Pan ...

  10. Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming

    E-Print Network [OSTI]

    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

  11. Short Communication: A Linear Programming Approach for the ...

    E-Print Network [OSTI]

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

  12. Looking for strong polynomiality in Linear Programming : Arguments ...

    E-Print Network [OSTI]

    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.

  13. Tools for primal degenerate linear programs: IPS, DCA, and PE

    E-Print Network [OSTI]

    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-

  14. Non-Linear Stochastic Fractional Programming Model of Financial ...

    E-Print Network [OSTI]

    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

  15. Scheduling Smart Home Appliances Using Mixed Integer Linear Programming

    E-Print Network [OSTI]

    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

  16. Exercise 1. Let (P) be the following linear program

    E-Print Network [OSTI]

    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

  17. An elementary proof of optimality conditions for linear programming

    E-Print Network [OSTI]

    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.

  18. an elementary proof of optimality conditions for linear programming

    E-Print Network [OSTI]

    2008-06-30T23:59:59.000Z

    References. Acknowledgement. This note has its origin in discussions with Krister Svanberg on elementary proofs of Farkas' lemma. References. [1] A. Charnes.

  19. Interior-Point Algorithms for a Generalization of Linear Programming ...

    E-Print Network [OSTI]

    2011-02-23T23:59:59.000Z

    Feb 23, 2011 ... Acknowledgement. I am grateful to Eric Denardo for a series of conversations that stimulated my interest in the topic of this paper. 11 ...

  20. a nonstandard simplex algorithm for linear programming 1.

    E-Print Network [OSTI]

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

  1. STUDENT LEARNING ASSESSMENT PROGRAM ARCHITECTURE: POST-PROFESSIONAL MASTER OF ARCHITECTURE

    E-Print Network [OSTI]

    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

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

  3. On representations of Higher Spin symmetry algebras for mixed-symmetry HS fields on AdS-spaces. Lagrangian formulation

    E-Print Network [OSTI]

    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.

  4. Optimal Unravellings for Feedback Control in Linear Quantum Systems

    E-Print Network [OSTI]

    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.

  5. Updated U.S. Geothermal Supply Characterization and Representation for Market Penetration Model Input

    SciTech Connect (OSTI)

    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.

  6. Representations of the groups of order 24

    E-Print Network [OSTI]

    Strange, John Billy

    1967-01-01T23:59:59.000Z

    'y 0 1 0 0 0 1 z z 1 0 0 x m g22 ~ ( x, y-x, z) -1 1 0 y = y-x 0 0 1 z z a( 1, -1, 0) 0 1 0 1 0 0 0 0 1 x y z z g3 (y? ) 24 1 -1 0 0 -1 0 0 0 1 z z g24- (x-X -V g. O 2W ~RI 3 g3 JR I a' i6 L t 5 y Jt 9 l3 Figure 3. Six... in the representation tables are the exponents of m in k cos kn/12 + i sin k&/12. CAYLEY TABLE FOR GROUP NUHBER 2 3 10 ll 3 11 12 1 2 12 10 7 8 9 10 11 12 4 5 8 9 7 lj 12 10 5 6 9 7 8 12 10 ll 6 4 10 jl 12 7 11 12 10 8 12 10...

  7. Holographic Representation of Higher Spin Gauge Fields

    E-Print Network [OSTI]

    Debajyoti Sarkar; Xiao Xiao

    2014-11-17T23:59:59.000Z

    Extending the results of \\cite{Heem}, \\cite{KLRS} on the holographic representation of local gauge field operators in anti de Sitter space, here we construct the bulk operators for higher spin gauge fields in the leading order of $\\frac{1}{N}$ expansion. Working in holographic gauge for higher spin gauge fields, we show that gauge field operators with integer spin $s>1$ can be represented by an integration over a ball region, which is the interior region of the spacelike bulk lightcone on the boundary. The construction is shown to be AdS-covariant up to gauge transformations, and the two-point function between higher spin gauge fields and boundary higher spin current exhibit singularities on both bulk and boundary lightcones. We also comment on possible extension to the level of three-point functions and carry out a causal construction for higher spin fields in de Sitter spacetime.

  8. The representation theory of cyclotomic BMW algebras

    E-Print Network [OSTI]

    Rui, H

    2008-01-01T23:59:59.000Z

    In this paper, we go on Rui-Xu's work on cyclotomic Birman-Wenzl algebras $\\W_{r, n}$ in \\cite{RX}. In particular, we use the representation theory of cellular algebras in \\cite{GL} to classify the irreducible $\\W_{r, n}$-modules for all positive integers $r$ and $n$. By constructing cell filtrations for all cell modules of $\\W_{r, n}$, we compute the discriminants associated to all cell modules for $\\W_{r, n} $. Via such discriminats together with induction and restriction functors given in section~5, we determine explicitly when $\\W_{r, n}$ is semisimple over a field. This generalizes our previous result on Birman-Wenzl algebras in \\cite{RS1}.

  9. An introduction to GUGA in the COLUMBUS Program System

    SciTech Connect (OSTI)

    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.

  10. Non Linear Beam Dynamics Studies at SPEAR

    SciTech Connect (OSTI)

    Terebilo, A.; Pellegrini, C.; /UCLA; Cornacchia, M.; Corbett, J.; Martin, D.; /SLAC

    2011-09-12T23:59:59.000Z

    The frequency map analysis of a Hamiltonian system recently introduced to accelerators physics in combination with turn-by-turn phase space measurements opens new experimental opportunities for studying non linear dynamic in storage rings. In this paper we report on the experimental program at SPEAR having the goal of measuring the frequency map of the machine. In this paper we discuss the accuracy of the instantaneous tune extraction from experimental data and demonstrate the possibility of the frequency map measurement. The instantaneous tune extraction technique can be applied to experimental tracking data with reasonable accuracy. Frequency map can be experimentally determined using the existing turn-by-turn phase space measurement techniques and NAFF instantaneous tune extraction.

  11. Deep Learning Representation using Autoencoder for 3D Shape Retrieval

    E-Print Network [OSTI]

    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

  12. Infrared regular representation of the three dimensional massless Nelson model

    E-Print Network [OSTI]

    Infrared regular representation of the three dimensional massless Nelson model J#19;ozsef L this Gaussian measure space. KEYWORDS: Nelson's scalar #12;eld model, infrared regular representation, ground] of a spinless electron coupled to a scalar massless Bose #12;eld is infrared divergent in 3 space dimensions

  13. Decomposition of Representations of CAR Induced by Bogoliubov Endomorphisms

    E-Print Network [OSTI]

    Jens B{ö}ckenhauer

    1994-10-04T23:59:59.000Z

    In a Fock representation, a non-surjective Bogoliubov transformation of CAR leads to a reducible representation. For the case that the corresponding Bogoliubov operator has finite corank, the decomposition into irreducible subrepresentations is clarified. In particular, it turns out that the number of appearing subrepresentations is completely determined by the corank.

  14. Wigner representation of the rotational dynamics of rigid tops

    E-Print Network [OSTI]

    Dmitry V. Zhdanov; Tamar Seideman

    2014-06-15T23:59:59.000Z

    We propose the general methodology to design the Wigner representations with the desired dynamical and semiclassical properties in the phase spaces with nontrivial topology. As an illustration, two representations of molecular rotations are developed to suit the computational demands of contemporary applications of laser alignment, diagnostics of reaction dynamics, studies of scattering and dissipative processes.

  15. Using Graphical Representations to Support the Calculation of Infusion Parameters

    E-Print Network [OSTI]

    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

  16. SEMANTIC DATA INTEGRATION IN A MULTIPLE REPRESENTATION ENVIRONMENT

    E-Print Network [OSTI]

    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

  17. Fast Multipole Representation of Diffusion Curves and Points Timothy Sun

    E-Print Network [OSTI]

    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

  18. An alternative proof of the Bryant representation Jose A. Galveza

    E-Print Network [OSTI]

    Gálvez, José Antonio

    An alternative proof of the Bryant representation Jos´e A. G´alveza and Pablo Mirab a Departamento Keywords: constant mean curvature, Bryant surfaces, Liouville equation. 1 Introduction In his famous 1987 paper, R. Bryant [Bry] established a meromorphic representation for the surfaces with constant mean

  19. An Ontology for Semantic Representation of an Urban Virtual Environment

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    An Ontology for Semantic Representation of an Urban Virtual Environment K. Harkouken Saiah1, N of semantic representation of a dynamic virtual environment. Our model is embodied into a simulation with the semantic state of their environment. The idea is to represent the services offered by the environment

  20. Sponsored Program Resources SPONSORED PROGRAMS

    E-Print Network [OSTI]

    Mather, Patrick T.

    Sponsored Program Resources - 1 - SPONSORED PROGRAMS Sponsored programs are research, instruction for sponsored programs is provided through an agreement between the sponsor and Syracuse University are being achieved and funds properly used Sponsored programs are managed by the Office of Sponsored

  1. Program Description

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

  2. Program Administration

    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.

  3. Virasoro representations and fusion for general augmented minimal models

    E-Print Network [OSTI]

    Holger Eberle; Michael Flohr

    2006-04-13T23:59:59.000Z

    In this paper we present explicit results for the fusion of irreducible and higher rank representations in two logarithmically conformal models, the augmented c_{2,3} = 0 model as well as the augmented Yang-Lee model at c_{2,5} = -22/5. We analyse their spectrum of representations which is consistent with the symmetry and associativity of the fusion algebra. We also describe the first few higher rank representations in detail. In particular, we present the first examples of consistent rank 3 indecomposable representations and describe their embedding structure. Knowing these two generic models we also conjecture the general representation content and fusion rules for general augmented c_{p,q} models.

  4. Efficient implementation and the product state representation of numbers.

    SciTech Connect (OSTI)

    Benioff, P.; Physics

    2001-10-12T23:59:59.000Z

    The relation between the requirement of efficient implementability and the product-state representation of numbers is examined. Numbers are defined to be any model of the axioms of number theory or arithmetic. Efficient implementability (EI) means that the basic arithmetic operations are physically implementable and the space-time and thermodynamic resources needed to carry out the implementations are polynomial in the range of numbers considered. Different models of numbers are described to show the independence of both EI and the product-state representation from the axioms. The relation between EI and the product-state representation is examined. It is seen that the condition of a product-state representation does not imply EI. Arguments used to refute the converse implication, EI implies a product-state representation, seem reasonable; but they are not conclusive. Thus this implication remains an open question.

  5. Environmental Programs Environmental Programs Committee

    E-Print Network [OSTI]

    Richards-Kortum, Rebecca

    162 Environmental Programs Environmental Programs Committee Walter Whitfield Isle, Chair (English) Katherine Bennett Ensor (Statistics) Mark R. Wiesner (Civil and Environmental Engineering) Donald Ostdiek (Architecture) The Environmental Programs Committee coordinates courses and curricula on environmental topics

  6. Accessible programming using program synthesis

    E-Print Network [OSTI]

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

  7. Linear conic optimization for nonlinear optimal control

    E-Print Network [OSTI]

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

  8. Human Responses to Climate Change: Social Representation, Identity and Socio-Psychological Action

    E-Print Network [OSTI]

    Royal Holloway, University of London

    and methodological approaches. Keywords: climate change; communication; social representation; identity; social representations and applies them to the issue of climate change communication, focusing in particularHuman Responses to Climate Change: Social Representation, Identity and Socio- Psychological Action

  9. Biholomorphic maps with linear parts having Jordan blocks: linearization and

    E-Print Network [OSTI]

    Jordan block. Our main result proves convergence of the linearizing transformation of maps for which the Jordan part of the spectrum lies inside the unit circle and the spectrum satis#12;es a R in (C [x]) n , (1.2) where C [x] stands for the set of all formal power series with complex coe

  10. Design and performance of the Stanford Linear Collider Control System

    SciTech Connect (OSTI)

    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.

  11. High dimensional linear inverse modelling

    E-Print Network [OSTI]

    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.

  12. Quantum loop programs

    E-Print Network [OSTI]

    Mingsheng Ying; Yuan Feng

    2007-01-04T23:59:59.000Z

    Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop programs. In this paper, we introduce a general scheme of quantum loops and describe its computational process. The notions of termination and almost termination are proposed for quantum loops, and the function computed by a quantum loop is defined. To show their expressive power, quantum loops are applied in describing quantum walks. Necessary and sufficient conditions for termination and almost termination of a general quantum loop on any mixed input state are presented. A quantum loop is said to be (almost) terminating if it (almost) terminates on any input state. We show that a quantum loop is almost terminating if and only if it is uniformly almost terminating. It is observed that a small disturbance either on the unitary transformation in the loop body or on the measurement in the loop guard can make any quantum loop (almost) terminating. Moreover, a representation of the function computed by a quantum loop is given in terms of finite summations of matrices. To illustrate the notions and results obtained in this paper, two simplest classes of quantum loop programs, one qubit quantum loops, and two qubit quantum loops defined by controlled gates, are carefully examined.

  13. Inference in Probabilistic Logic Programs with Continuous Random Variables

    E-Print Network [OSTI]

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

  14. SMART TOOLS A Multi-Representational Approach

    E-Print Network [OSTI]

    with algebra: 1. the concept of variables { the conceptual leap from operating with numbers to dealing, an instructional learning environment (ILE) for teaching students about distance, time, and speed calculations disc based program that focuses on anchored instruction and generative learning, to help students learn

  15. Continuous representation for shell models of turbulence

    E-Print Network [OSTI]

    Alexei A. Mailybaev

    2014-09-16T23:59:59.000Z

    In this work we construct and analyze continuous hydrodynamic models in one space dimension, which are induced by shell models of turbulence. After Fourier transformation, such continuous models split into an infinite number of uncoupled subsystems, which are all identical to the same shell model. The two shell models, which allow such a construction, are considered: the dyadic (Desnyansky--Novikov) model with the intershell ratio $\\lambda = 2^{3/2}$ and the Sabra model of turbulence with $\\lambda = \\sqrt{2+\\sqrt{5}} \\approx 2.058$. The continuous models allow understanding various properties of shell model solutions and provide their interpretation in physical space. We show that the asymptotic solutions of the dyadic model with Kolmogorov scaling correspond to the shocks (discontinuities) for the induced continuous solutions in physical space, and the finite-time blowup together with its viscous regularization follow the scenario similar to the Burgers equation. For the Sabra model, we provide the physical space representation for blowup solutions and intermittent turbulent dynamics.

  16. Graph representation of protein free energy landscape

    SciTech Connect (OSTI)

    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.

  17. The generalization of A. E. Kennelly theory of complex representation of the electrical quantities in sinusoidal periodic regime to the one and three-phase electric quantities in non-sinusoidal periodic regime

    E-Print Network [OSTI]

    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.

  18. Linear electric field mass spectrometry

    DOE Patents [OSTI]

    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.

  19. Linearized theory of peridynamic states.

    SciTech Connect (OSTI)

    Silling, Stewart Andrew

    2009-04-01T23:59:59.000Z

    A state-based peridynamic material model describes internal forces acting on a point in terms of the collective deformation of all the material within a neighborhood of the point. In this paper, the response of a state-based peridynamic material is investigated for a small deformation superposed on a large deformation. The appropriate notion of a small deformation restricts the relative displacement between points, but it does not involve the deformation gradient (which would be undefined on a crack). The material properties that govern the linearized material response are expressed in terms of a new quantity called the modulus state. This determines the force in each bond resulting from an incremental deformation of itself or of other bonds. Conditions are derived for a linearized material model to be elastic, objective, and to satisfy balance of angular momentum. If the material is elastic, then the modulus state is obtainable from the second Frechet derivative of the strain energy density function. The equation of equilibrium with a linearized material model is a linear Fredholm integral equation of the second kind. An analogue of Poincare's theorem is proved that applies to the infinite dimensional space of all peridynamic vector states, providing a condition similar to irrotationality in vector calculus.

  20. PROCESS CONTROLLABILITY ANALYSIS USING LINEAR AND NONLINEAR

    E-Print Network [OSTI]

    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

  1. MATH F314-F71 Linear Algebra

    E-Print Network [OSTI]

    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

  2. Why quantum dynamics is linear

    E-Print Network [OSTI]

    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.

  3. Low-rank separated representation surrogates of high-dimensional stochastic functions: Application in Bayesian inference

    SciTech Connect (OSTI)

    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.

  4. On the Representation of Physical Quantities in Natural Language Text

    E-Print Network [OSTI]

    Forbus, Kenneth D.

    On the Representation of Physical Quantities in Natural Language Text Sven E. Kuehne (skuehne processes from natural language text. In an earlier analysis (Kuehne & Forbus, 2002) we presented a scheme

  5. Surface Dependent Representations for Illumination Insensitive Image Comparison

    E-Print Network [OSTI]

    Lindenbaum, Michael

    . Lighting variation significantly affects surface appearance and makes image comparison difficultSurface Dependent Representations for Illumination Insensitive Image Comparison Margarita Osadchy the problem of matching images to tell whether they come from the same scene viewed under different lighting

  6. Generating Tensor Representation from Concept Tree in Meaning Based Search

    E-Print Network [OSTI]

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

  7. Containing the opposition : selective representation in Jordan and Turkey

    E-Print Network [OSTI]

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

  8. Stochastic Roadmap Simulation: Efficient Representation and Algorithms for

    E-Print Network [OSTI]

    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

  9. Fast quantum algorithms for approximating some irreducible representations of groups

    E-Print Network [OSTI]

    Stephen P. Jordan

    2009-04-21T23:59:59.000Z

    We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this problem. Furthermore, quantum Schur transforms yield efficient solutions for certain irreducible representations of the unitary group. Beyond this, we obtain poly(n)-time quantum algorithms for approximating matrix elements from all the irreducible representations of the alternating group A_n, and all the irreducible representations of polynomial highest weight of U(n), SU(n), and SO(n). These quantum algorithms offer exponential speedup in worst case complexity over the fastest known classical algorithms. On the other hand, we show that average case instances are classically easy, and that the techniques analyzed here do not offer a speedup over classical computation for the estimation of group characters.

  10. Representation of Energy Use in the Food Products Industry

    E-Print Network [OSTI]

    Elliott, N. R.

    2007-01-01T23:59:59.000Z

    such as combined heat and power (CHP). This paper discusses the differences between energy end-uses and service demands, proposes an approach for approximating service demands and discusses the ramifications of this alternative representation to energy modeling...

  11. Karhunen-Loeve representation of stochastic ocean waves

    E-Print Network [OSTI]

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

  12. The Role of Knowledge in Visual Shape Representation

    E-Print Network [OSTI]

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

  13. Crystal Structure Representations for Machine Learning Models of Formation Energies

    E-Print Network [OSTI]

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

  14. Representation and compression of multidimensional piecewise functions using surflets

    E-Print Network [OSTI]

    Chandrasekaran, Venkat

    We study the representation, approximation, and compression of functions in M dimensions that consist of constant or smooth regions separated by smooth (M-1)-dimensional discontinuities. Examples include images containing ...

  15. Incorporating Representation of Agricultural Ecosystems and Management Within IBIS

    E-Print Network [OSTI]

    Incorporating Representation of Agricultural Ecosystems and Management Within IBIS: The development of Agro-IBIS Chris Kucharik Department of Agronomy & Center for Sustainability and the Global Environment balance Soil and canopy physics Leaf physiology Minutes Phenology Budburst, senescence, dormancy Daily

  16. An Executable Representation of Distance and Direction Richard Johnson

    E-Print Network [OSTI]

    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

  17. Set Linear Algebra and Set Fuzzy Linear Algebra

    E-Print Network [OSTI]

    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.

  18. Optimization Online - On the Copositive Representation of Binary ...

    E-Print Network [OSTI]

    Samuel Burer

    2006-10-23T23:59:59.000Z

    Oct 23, 2006 ... ... is supported by the Mathematical Programming Society and by the Optimization Technology Center. Mathematical Programming Society.

  19. Lawrence Berkeley Laboratory Affirmative Action Program. Revised

    SciTech Connect (OSTI)

    NONE

    1995-06-01T23:59:59.000Z

    The Lawrence Berkeley Laboratory`s Affirmative Action Program (AAP) serves as a working document that describes current policies, practices, and results in the area of affirmative action. It represents the Laboratory`s framework for an affirmative approach to increasing the representation of people of color and women in segments of our work force where they have been underrepresented and taking action to increase the employment of persons with disabilities and special disabled and Vietnam era veterans. The AAP describes the hierarchy of responsibility for Laboratory affirmative action, the mechanisms that exist for full Laboratory participation in the AAP, the policies and procedures governing recruitment at all levels, the Laboratory`s plan for monitoring, reporting, and evaluating affirmative action progress, and a description of special affirmative action programs and plans the Laboratory has used and will use in its efforts to increase the representation and retention of groups historically underrepresented in our work force.

  20. Concise representation of the saturation properties for pure compounds 

    E-Print Network [OSTI]

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

  1. International linear collider reference design report

    SciTech Connect (OSTI)

    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.

  2. Enhanced algorithms for stochastic programming

    SciTech Connect (OSTI)

    Krishna, A.S.

    1993-09-01T23:59:59.000Z

    In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.

  3. Optimal Constructions of Fault Tolerant Optical Linear Compressors and Linear Decompressors

    E-Print Network [OSTI]

    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

  4. Memory with memory: Soft assignment in Genetic Programming

    E-Print Network [OSTI]

    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

  5. Memory with Memory: Soft Assignment in Genetic Programming

    E-Print Network [OSTI]

    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

  6. Cast dielectric composite linear accelerator

    DOE Patents [OSTI]

    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.

  7. Linearized supergravity from Matrix theory

    E-Print Network [OSTI]

    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.

  8. Precision linear ramp function generator

    DOE Patents [OSTI]

    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.

  9. Precision linear ramp function generator

    DOE Patents [OSTI]

    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.

  10. Segmented rail linear induction motor

    SciTech Connect (OSTI)

    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.

  11. A linear induction motor conveyer

    E-Print Network [OSTI]

    Solinsky, Kenneth Sheldon

    1973-01-01T23:59:59.000Z

    wave 14. Fundamentals of inducing a magnetic field. 25 15. Dsr made of conducting material placed above six current carrying wire . . . . . . . . . . . . . . . . . . . 26 16. Change in conductor's magnetic field with time. 27 17. Origin of. forces..., it is pos- sible to design a mears of moving certain objects, such that the arly moving parts of the entire convey- ing system are the items to be moved. Such a system can be used to move any item made of a nonmagnetic conductor. A linear inductior...

  12. The Dissimilarity Representation as a Tool for Three-Way Data Classification: A 2D Measure

    E-Print Network [OSTI]

    Duin, Robert P.W.

    ´ia (Ingeominas), Colombia jmakario@ingeominas.gov.co Abstract. The dissimilarity representation has demonstrated

  13. WILD ALGEBRAS HAVE ONE-POINT EXTENSIONS OF REPRESENTATION DIMENSION AT LEAST FOUR

    E-Print Network [OSTI]

    Oppermann, Steffen

    WILD ALGEBRAS HAVE ONE-POINT EXTENSIONS OF REPRESENTATION DIMENSION AT LEAST FOUR STEFFEN OPPERMANN Abstract. We show that any wild algebra has a one-point exten- sion of representation dimension at least between tame and wild representation type is another way of saying "how infinite" the representation

  14. 2008 Academic Program Review Graduate Programs

    E-Print Network [OSTI]

    2008 Academic Program Review of Graduate Programs November 2008 Texas A&M University College ........................................................................................................12 III. Graduate Program.....................................................................................................14 B. Educational Programs

  15. Linear-quadratic control problem with a linear term on semiinfinite ...

    E-Print Network [OSTI]

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

  16. High speed linear induction motor efficiency optimization

    E-Print Network [OSTI]

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

  17. MANEUVER REGULATION, TRANSVERSE FEEDBACK LINEARIZATION, AND ZERO

    E-Print Network [OSTI]

    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

  18. Stochastic bridges of linear systems

    E-Print Network [OSTI]

    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.

  19. A Graphic Representation of States for Quantum Copying Machines

    E-Print Network [OSTI]

    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.

  20. Environmental representation and the role of clouds in studies and analysis models

    SciTech Connect (OSTI)

    Hummel, J.R.; Campbell, A.P.

    1997-10-01T23:59:59.000Z

    The Joint Analysis community is currently making significant improvements and enhancements to its suite of modeling tools used to support studies and analyses for Joint applications. This effort is being performed under the Joint Analytic Model Improvement Program (JAMIP) that began in 1995. One part of the JAMIP effort is the development of the Joint Warfare System (JWARS). JWARS will be a state of the art closed-form, constructive simulation of multisided, joint warefare for analysis. The environment will be a significant factor in future warefare analysis and so JWARS will include an authoritative environmental representation that can be represented at variable spatial and temporal scales. Argonne`s Dynamic Environmental Effects Model (DEEM) was used to provide the environmental representation for the JWARS prototype effort. In this paper we will present an overview of JWARS and describe how the environment and environmental effects are being represented in JWARS. Specific emphasis will be given on how clouds are included in the JWARS environment and the impacts they have on the warfighting functionality included in JWARS.

  1. Varying-Coefficient Functional Linear Regression Models

    E-Print Network [OSTI]

    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

  2. Computational Reality XIII Non-linear regression

    E-Print Network [OSTI]

    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

  3. (Parallel Linear Algebra Package) Jess Cmara Moreno

    E-Print Network [OSTI]

    Giménez, Domingo

    álgebra lineal (Linear Algebra Objects). También permite la utilización de vistas (objetos referenciadosPLAPACK (Parallel Linear Algebra Package) Jesús Cámara Moreno Programación Paralela y Computación Reducción de Vectores Inicialización de PLAPACK. Funciones. Templates. Funciones. Linear Algebra Objects

  4. A study of linear programming and methods for programming the simplex method

    E-Print Network [OSTI]

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

  5. Finite element analyses of a linear-accelerator electron gun

    SciTech Connect (OSTI)

    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.

  6. Developing a gas purchasing strategy using a linear model

    SciTech Connect (OSTI)

    Alst, K.M. Van [Midland Cogeneration Venture Limited Partnership, Midland, MI (United States)

    1995-12-31T23:59:59.000Z

    This paper outlines the process of developing a gas purchasing strategy with the use of a linear programming model. The linear model is used to determine the least cost approach regarding the acquisition of natural gas which has a considerable impact on the company`s financial performance. The author discusses the importance of optimizing gas costs from an end-user`s perspective. The Midland Cogeneration Venture (MCV) is the country`s largest cogeneration facility. The Facility has been certified by FERC (Federal Energy Regulatory Commission) as a Q.F. (Qualifying Facility) under PURPA (Public Utility Regulatory Policies Act of 1978). Unlike utilities, who have the ability to pass costs through to customers, MCV`s revenues are based on long-term contracts with its utility and industrial customers. Therefore, MCV cannot pass costs through to its customers. As such, effectively managing costs is vital to the success of the company.

  7. Counterintelligence Program

    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.

  8. Program Description

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Program Description Discover E (Engineering) is an evening of interesting, interactive and fun engineering, science, math, and technology demonstrations for K-12 students and their...

  9. Programming Stage

    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.

  10. Counterintelligence Program

    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.

  11. Program Description

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

  12. Community Leadership Certificate Program Program Overview

    E-Print Network [OSTI]

    Saldin, Dilano

    Community Leadership Certificate Program Program Overview The undergraduate Community Leadership Certificate Program is an interdisciplinary program where students from any major can explore leadership in community engagement and leadership. The program is based on a social justice model of leadership

  13. Some unitary representations of Thompson's groups F and T

    E-Print Network [OSTI]

    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

  14. Clifford, Dirac, and Majorana algebras, and their representations

    SciTech Connect (OSTI)

    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.

  15. Representations of the LL BFKL Kernel and the Bootstrap

    E-Print Network [OSTI]

    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.

  16. Calibrating Bayesian Network Representations of Social-Behavioral Models

    SciTech Connect (OSTI)

    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.

  17. 6.231 Dynamic Programming and Stochastic Control, Fall 2002

    E-Print Network [OSTI]

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

  18. Apprentice Program Alternate Proof of the Spectral Theorem

    E-Print Network [OSTI]

    May, J. Peter

    Math REU Apprentice Program Alternate Proof of the Spectral Theorem Julian Hartman September 17 in the apprentice class but not in this manner. Because the Spectral Theorem is such a fundamental theorem in linear

  19. Optimal Linear Quadratic Regulator for Markovian Jump Linear Systems, in the

    E-Print Network [OSTI]

    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

  20. The linear quadratic optimal control problem for linear descriptor systems with variable coefficients

    E-Print Network [OSTI]

    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

  1. ENGI 3423 Simple Linear Regression Page 12-01 Simple Linear Regression

    E-Print Network [OSTI]

    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

  2. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2005; 12:683

    E-Print Network [OSTI]

    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

  3. Reticle stage based linear dosimeter

    DOE Patents [OSTI]

    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.

  4. Reticle stage based linear dosimeter

    DOE Patents [OSTI]

    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.

  5. Final Report for the UNIVERSITY-BASED DETECTOR RESEARCH AND DEVELOPMENT FOR THE INTERNATIONAL LINEAR COLLIDER

    SciTech Connect (OSTI)

    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.

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

  7. Representations and Properties of Generalized $A_r$ Statistics

    E-Print Network [OSTI]

    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.

  8. A Simple Representation Technique to Improve GA Performance

    E-Print Network [OSTI]

    '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

  9. Music Representation in a Digital Music Library Donald Byrd

    E-Print Network [OSTI]

    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

  10. Rendering Optical Effects Based on Spectra Representation in Complex Scenes

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Rendering Optical Effects Based on Spectra Representation in Complex Scenes Weiming Dong Project ALICE, INRIA Lorraine/Loria, France Weiming.Dong@loria.fr Abstract. Rendering the structural color sensitive phenomena. Achieving the rendering of complex scenes with both the full spectra and RGB light

  11. Path-transformations in probability and representation theory

    E-Print Network [OSTI]

    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

  12. FROM NO"RLUND MATRICES TO LAPLACE REPRESENTATIONS

    E-Print Network [OSTI]

    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

  13. Knowledge representation in process engineering Franz Baader and Ulrike Sattler

    E-Print Network [OSTI]

    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

  14. Subspace Segmentation with A Minimal Squared Frobenius Norm Representation

    E-Print Network [OSTI]

    Yu, Yizhou

    Minimal Squared Frobenius Norm Representa- tion (MSFNR). MSFNR performs data clustering by solving benchmark [9]. However, LRR in- volves nuclear norm1 minimization. Solving LRR re- quires computing multiple Representation (MSFNR). It employs convex optimization to perform subspace clustering. The method minimizes

  15. Attention and biased competition in multi-voxel object representations

    E-Print Network [OSTI]

    VanRullen, Rufin

    . In a multidimensional voxel space, the response to simultaneously-presented categories was well described as a weighted.e., univariate) fMRI methods (13­15), these recently discov- ered multivariate pattern analysis techniques have to understand attentional influences in large-scale multivariate representations of simultaneously

  16. Analytical Representation of the Longitudinal Hadronic Shower Development

    E-Print Network [OSTI]

    Y. A. Kulchitsky; V. B. Vinogradov

    1999-03-12T23:59:59.000Z

    The analytical representation of the longitudinal hadronic shower development from the face of a calorimeter is presented and compared with experimental data. The suggested formula is particularly useful at designing, testing and calibration of huge calorimeter complex like in ATLAS at LHC.

  17. Analytical representation of the longitudinal hadronic shower development

    E-Print Network [OSTI]

    Kulchitskii, Yu A

    1998-01-01T23:59:59.000Z

    The analytical representation of the longitudinal hadronic shower development from the face of a calorimeter is presented and compared with experimental data. The suggested formula is particularly useful at designing, testing and calibration of huge calorimeter complex like in ATLAS at LHC.

  18. Security Requirements Engineering: A Framework for Representation and Analysis

    E-Print Network [OSTI]

    Nuseibeh, Bashar

    Security Requirements Engineering: A Framework for Representation and Analysis Charles B. Haley Abstract--This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requirements as constraints

  19. Compact Representation of Coordinated Sampling Policies for Body Sensor Networks

    E-Print Network [OSTI]

    Panangadan, Anand

    .Talukder@jpl.nasa.gov Abstract Embedded sensors of a Body Sensor Network need to efficiently utilize their energy resources Department of Electrical Engineering Los Angeles, CA 90089, USA 1-213-821-0871 {lius,raghu}@usc.edu 2 of a compact representation is feasible with little loss in performance. The global optimal policy is computed

  20. CAPlets: wavelet representations without wavelets Youngmi Hur Amos Ron

    E-Print Network [OSTI]

    Liblit, Ben

    CAPlets: wavelet representations without wavelets Youngmi Hur Amos Ron Department of Mathematics" between each two consecutive layers is recorded in terms of detail coefficients. Wavelet decomposition of wavelet decompositions is their implementation and inversion by a fast algorithm, the so-called fast

  1. Interactive Dimensions in the Construction of Mental Representations for Text

    E-Print Network [OSTI]

    Patel, Aniruddh D.

    Interactive Dimensions in the Construction of Mental Representations for Text David N. Rapp be as critical to the construction of complex mental models as the discrete dimensions themselves. In the present a bead on Specify again. Incredibly, the horse was still rolling along. A pang of fear went through Woolf

  2. TORSION, AS A FUNCTION ON THE SPACE OF REPRESENTATIONS

    E-Print Network [OSTI]

    Haller, Stefan

    triangulation, and the dynamical torsion to a vector field with the properties listed in section 2TORSION, AS A FUNCTION ON THE SPACE OF REPRESENTATIONS DAN BURGHELEA AND STEFAN HALLER Abstract functions on Rep M (#; V ) called in this paper complex valued Ray--Singer torsion, Milnor--Turaev torsion

  3. Brief Communications Unstable Representation of Sound: A Biological Marker of

    E-Print Network [OSTI]

    Brief Communications Unstable Representation of Sound: A Biological Marker of Dyslexia Jane and reading skills. Children with dyslexia, who often exhibit impairments in auditory-based perceptual skills manifestations of auditory impairments in dyslexia include impaired perception of speech in background noise

  4. Representation Theory, Geometry & Combinatorics Organizer: M. Haiman and N. Reshetikhin

    E-Print Network [OSTI]

    Haiman, Mark D.

    Representation Theory, Geometry & Combinatorics Seminar Organizer: M. Haiman and N. Reshetikhin Wednesday, 4:00­6:00pm, 939 Evans Apr. 14 Ivan Shestakov, IME-USP, S~ao Paolo Nonassociative Lie Theory The theory of Lie algebras is one of the corner-stones of modern mathematics and physics. They usually relate

  5. CONTEXTUALLY ADAPTIVE SIGNAL REPRESENTATION USING CONDITIONAL PRINCIPAL COMPONENT ANALYSIS

    E-Print Network [OSTI]

    Rajashekar, Umesh

    is the construction of bases that are adapted to individual signal in- stances. Here we develop a new framework. Index Terms-- Adaptive basis, conditional PCA, self-similarities, image modeling, image representation traditional methods, primarily due to the cost of encoding the indices of selected basis elements

  6. Case Generation Using Rough Sets with Fuzzy Representation

    E-Print Network [OSTI]

    Mitra, Pabitra

    , granular computing, rough-fuzzy hybridization, soft computing, pattern recognition, data mining. æ 1 for case generation. Fuzzy set theory is used for linguistic representation of patterns, thereby producing a fuzzy granulation of the feature space. Rough set theory is used to obtain dependency rules which model

  7. BACK TO OFFICE REPORT Enhancing the Representation of Environment and

    E-Print Network [OSTI]

    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

  8. Network sampling and classification: An investigation of network model representations

    E-Print Network [OSTI]

    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

  9. Towards Event Sequence Representation, Reasoning and Visualization for EHR Data

    E-Print Network [OSTI]

    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

  10. Nucleon-nucleon potentials in phase-space representation

    E-Print Network [OSTI]

    H. Feldmeier; T. Neff; D. Weber

    2014-12-02T23:59:59.000Z

    A phase-space representation of nuclear interactions, which depends on the distance $\\vec{r}$ and relative momentum $\\vec{p}$ of the nucleons, is presented. A method is developed that permits to extract the interaction $V(\\vec{r},\\vec{p})$ from antisymmetrized matrix elements given in a spherical basis with angular momentum quantum numbers, either in momentum or coordinate space representation. This representation visualizes in an intuitive way the non-local behavior introduced by cutoffs in momentum space or renormalization procedures that are used to adapt the interaction to low momentum many-body Hilbert spaces, as done in the unitary correlation operator method or with the similarity renormalization group. It allows to develop intuition about the various interactions and illustrates how the softened interactions reduce the short-range repulsion in favor of non-locality or momentum dependence while keeping the scattering phase shifts invariant. It also reveals that these effective interactions can have undesired complicated momentum dependencies at momenta around and above the Fermi momentum. Properties, similarities and differences of the phase-space representations of the Argonne and the N3LO chiral potential, and their UCOM and SRG derivatives are discussed.

  11. THE CATEGORICAL WEIL REPRESENTATION SHAMGAR GUREVICH AND RONNY HADANI

    E-Print Network [OSTI]

    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

  12. LINEAR COLLIDER PHYSICS RESOURCE BOOK FOR SNOWMASS 2001.

    SciTech Connect (OSTI)

    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.

  13. Solar Thermal Incentive Program

    Broader source: Energy.gov [DOE]

    Note: This program is not currently accepting applications. Check the program web site for information regarding future financing programs.

  14. Coherent Feedback Control of Linear Quantum Optical Systems via Squeezing and Phase Shift

    E-Print Network [OSTI]

    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.

  15. ARRA Program Summary: Energy Smart Jobs Program

    E-Print Network [OSTI]

    ARRA Program Summary: Energy Smart Jobs Program Statewide Program (Initially targeting urban 30,000 buildings surveyed, approximately 5,000 will be retrofitted, yielding approximately $40

  16. Machinist Pipeline/Apprentice Program Program Description

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Machinist PipelineApprentice Program Program Description The Machinist Pipeline Program was created by the Prototype Fabrication Division to fill a critical need for skilled...

  17. International Workshop on Linear Colliders 2010

    ScienceCinema (OSTI)

    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

  18. Summer 2012 Mathematics 317, Linear Algebra

    E-Print Network [OSTI]

    Long, Nicholas

    or download a .pdf version for use on a Kindle or Sony Reader or a printable .pdf version. You do not need://linear.ups.edu/xml/latest/fcla-xml-latest.xml Amazon Kindle DX format (optimized PDF): http://linear.ups.edu/download/fcla-kindleDX-2.30.pdf SONY Reader format (optimized PDF for PRS-500, PRS-505): http://linear.ups.edu/download/fcla-sony505-2.30.pdf

  19. They Must Be Mediocre: Representations, Cognitive Complexity, and Problem Solving in Secondary Calculus Textbooks

    E-Print Network [OSTI]

    Romero, Christopher 1978-

    2012-12-03T23:59:59.000Z

    -depth analytic review of calculus textbooks, we cannot know whether the books are likely to help students learn (McNeely, 1997). The roles of representations (Cunningham, 2005; Knuth, 2000; Porzio, 1999) and representational transfer (Keller & Hirsch, 1998...

  20. Niigata (Japan), July 18-20, 2007 Pierre Laforcade 1 Graphical representation of abstractGraphical representation of abstract

    E-Print Network [OSTI]

    Laforcade, Pierre

    Niigata (Japan), July 18-20, 2007 Pierre Laforcade 1 Graphical representation of abstract (Japan), July 18-20, 2007 Pierre Laforcade 2 Outline 1. Research context 2. Experimentation: the UML4LD proposition 3. Summary and ongoing work #12;Niigata (Japan), July 18-20, 2007 Pierre Laforcade 3 Research

  1. DOE Publishes CALiPER Report on Cost-Effectiveness of Linear (T8) LED Lamps

    Broader source: Energy.gov [DOE]

    The U.S. Department of Energy's CALiPER program has released Report 21.3, which is part of a series of investigations on linear LED lamps. Report 21.3 details a set of life-cycle cost simulations...

  2. Numerical Platon: a unified linear equation solver interface for industrial softwares

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    . However, the resolution of these linear systems uses a large share of program's CPU load, e.g. up to 90% of the total CPU time. Moreover, these resolution methods are shared between codes. From a strategic viewpoint a single interface without any change in the code, while being able to manage dis- tributed and shared

  3. Under consideration for publication in Math. Struct. in Comp. Science Linear Logic Propositions as Session Types

    E-Print Network [OSTI]

    Goldstein, Seth Copen

    by Honda on session types (Honda 1993). Many expressive type disciplines for -calculi in which linearity 2 role have been proposed since then (e.g., (Kobayashi 1998; Honda et al. 1998; Yoshida et al. 2007 of session types (Honda 1993; Honda et al. 1998), in which the programming language is a session

  4. CalCS: SMT Solving for Non-Linear Convex Constraints

    E-Print Network [OSTI]

    Seshia, Sanjit A.

    CalCS: SMT Solving for Non-Linear Convex Constraints Pierluigi Nuzzo, Alberto Puggelli, Sanjit A fundamental results from the theory of convex programming to realize a satisfiability modulo theory (SMT) for such systems [3], [4], it is necessary to develop efficient satisfiability modulo theories (SMT) solvers [5

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

  6. Linear conic optimization for nonlinear optimal control

    E-Print Network [OSTI]

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

  7. Elastic Wave Behavior Across Linear Slip Interfaces

    E-Print Network [OSTI]

    Schoenberg, M.

    plane waves incident at arbitrary angles upon a plane linear slip interface are computed ... Also included in these sections is an analysis ... ish, Ut is of the form.

  8. Linear dependence of exponentials - Department of Mathematics ...

    E-Print Network [OSTI]

    2012-09-30T23:59:59.000Z

    in the books of the Russian mathematician A. Leontiev. Dear Steven and Sherman,. I recently saw the problem on “linear independence of exponentials”.

  9. Siting the International Linear Collider at Hanford

    SciTech Connect (OSTI)

    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.

  10. Siting the International Linear Collider at Hanford

    SciTech Connect (OSTI)

    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.

  11. Optimization Online - Linear equalities in blackbox optimization

    E-Print Network [OSTI]

    Charles Audet

    2014-05-28T23:59:59.000Z

    May 28, 2014 ... ... neither in theory nor in practice. The present work proposes extensions to treat problems with linear equalities whose expression is known.

  12. Ultra-high vacuum photoelectron linear accelerator

    DOE Patents [OSTI]

    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.

  13. The Linear Complementarity Problem, Lemke Algorithm ...

    E-Print Network [OSTI]

    2011-03-01T23:59:59.000Z

    graphs [4], [14], [9] and the research articles in their reference lists. One of the interesting ..... The Linear Complementarity Problem, Academic-Press,. Inc., 1992

  14. SECO Programs

    E-Print Network [OSTI]

    Trevino, E.

    2011-01-01T23:59:59.000Z

    this web page address! ASSISTANCE AND FUNDING OPPORTUNITIES Energy Efficiency Technical Assistance Energy Efficiency Grants Renewable Energy Technology Grants Alternative Fuel Grants The LoanSTAR Revolving Loan Program Energy Efficiency... maximum of $50,000 per grant ? Funded on a reimbursement basis Renewable Energy Technology Grants ? Fort Worth ISD ? South Sills High School ? 5KW Wind Turbine Alternative Fuel Grants ? Grant program to convert city/county and ISD vehicle...

  15. Fusion rules for admissible representations of affine algebras: the case of $A_2^{(1)}$

    E-Print Network [OSTI]

    P. Furlan; A. Ch. Ganchev; V. B. Petkova

    1997-10-26T23:59:59.000Z

    We derive the fusion rules for a basic series of admissible representations of $\\hat{sl}(3)$ at fractional level $3/p-3$. The formulae admit an interpretation in terms of the affine Weyl group introduced by Kac and Wakimoto. It replaces the ordinary affine Weyl group in the analogous formula for the fusion rules multiplicities of integrable representations. Elements of the representation theory of a hidden finite dimensional graded algebra behind the admissible representations are briefly discussed.

  16. Program Year 2008 State Energy Program Formula

    Broader source: Energy.gov [DOE]

    U.S. Department of Energy (DOE) State Energy Program (SEP), SEP Program Guidance Fiscal Year 2008, Program Year 2008, energy efficiency and renewable energy programs in the states, DOE Office of Energy Efficiency and Renewable Energy

  17. Multipole Representation of the Fermi Operator with Application to the Electronic Structure Analysis of Metallic Systems

    E-Print Network [OSTI]

    Lu, Jianfeng

    Multipole Representation of the Fermi Operator with Application to the Electronic Structure, Princeton University, Princeton, NJ 08544 We propose a multipole representation of the Fermi-Dirac function temperature Green's functions in many-body physics [13]. It is natural to consider a multipole representation

  18. Faculty of Engineering and Natural Sciences Knowledge Representation and Automated Reasoning

    E-Print Network [OSTI]

    Gozuacik, Devrim

    Faculty of Engineering and Natural Sciences AI Day on Knowledge Representation and Automated representations of knowledge manipulated by reasoning engines are an integral and crucial component of intelligent Reasoning Wednesday, 21 May 2008 13:40­15:30, FENS G035 15:40­17:00, FENS G029 Knowledge Representation

  19. Oscillator or Segal-Shale-Weil representation Geometry: Associating the oscillator to symplectic manifolds

    E-Print Network [OSTI]

    Krysl, Svatopluk

    C -algebras Oscillator or Segal-Shale-Weil representation Geometry: Associating the oscillator or Segal-Shale-Weil representation Geometry: Associating the oscillator to symplectic manifolds Global and (x) = 0 implies x = 0 2 S. Krýsl #12;C -algebras Oscillator or Segal-Shale-Weil representation

  20. A special irreducible matrix representation of the real Clifford algebra C,,3,1...

    E-Print Network [OSTI]

    Scharnhorst, Klaus

    a particularly symmetric real representation of 4 4 Dirac matrices Majorana representation which may prove useful represen- tations of these Clifford algebras, a set of real 4 4 Dirac matrices Majorana representation Received 1 May 1998; accepted for publication 29 October 1998 4 4 Dirac gamma matrices irreducible matrix