Comparison of generality based algorithm variants for automatic taxonomy generation
Madnick, Stuart E.
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21T23:59:59.000Z
We consider deterministic and {\\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\\in\\{H_1,...,H_m\\}$, $H=\\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\\e$ at least have $\\Omega(t^{3/2}\\e^{-1/2})$ exponentials.
Parameterized algorithms and computational lower bounds: a structural approach
Xia, Ge
2006-10-30T23:59:59.000Z
Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ...
Comparison of Generality Based Algorithm Variants for Automatic Taxonomy Generation
Henschel, Andreas
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymannalgorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...
Adaptive Control of Third Harmonic Generation via Genetic Algorithm
Hua, Xia
2010-10-12T23:59:59.000Z
. We use genetic algorithm to optimize third harmonic generation (THG), and investigate various pulse shaper options. We test our setup by running the experiment with varied initial conditions and study factors that affect convergence of the algorithm...
An evolutionary algorithm approach to poetry generation
Manurung, Hisar
Poetry is a unique artifact of the human language faculty, with its defining feature being a strong unity between content and form. Contrary to the opinion that the automatic generation of poetry is a relatively easy ...
Detecting Networks Employing Algorithmically Generated Domain Names
Ashwath Kumar Krishna Reddy
2011-10-21T23:59:59.000Z
. 15 0 0.02 0.04 0.06 0.08 0.1 0.12 0 1 2 3 4 5 6 7 8 9 a b c d e f g h i j k l m n o p q r s t u v w x y z Probability of occurrenc e Alphanumeric characters Malicious (Kraken) Malicious (Kwyjibo) Malicious (randomly generated... . . . . . . . . . . . . . . . . . . . 28 V RESULTS : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 30 5.1 Per-domain analysis . . . . . . . . . . . . . . . . . . . . . . . . 30 5.1.1 Data set . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 5.1.2 K...
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
Asymptotic, Algorithmic and Geometric Aspects of Groups Generated by Automata
Savchuk, Dmytro M.
2010-01-14T23:59:59.000Z
: Mathematics iii ABSTRACT Asymptotic, Algorithmic and Geometric Aspects of Groups Generated by Automata. (August 2009) Dmytro Savchuk, B.S., National Taras Shevchenko University of Kyiv, Ukraine; M.S., National Taras Shevchenko University of Kyiv, Ukraine Co...?4; qn?3 = (a;a) n?3; (1.1) where i 2 Sym(f0;1g) is chosen arbitrarily. Conjecturally, each automaton in the family for which at least one of the i is nontrivial, generates the free product of groups of order 2. The flrst result supporting...
Man-Portable Power Generation Devices: Product Design and Supporting Algorithms
Man-Portable Power Generation Devices: Product Design and Supporting Algorithms by Alexander Mitsos-Portable Power Generation Devices: Product Design and Supporting Algorithms by Alexander Mitsos Submitted power generation. These devices are potential consumer products that com- prise a more or less complex
Using Genetic Algorithms to Improve the Visual Quality of Fractal Plants Generated with CSGPLSystems
1 Using Genetic Algorithms to Improve the Visual Quality of Fractal Plants Generated with CSGÂsystem, that generates a desired plant. Especially the tuning of the parameter values is time consuming and demands a lot genetic algorithms to find PLÂsystems that generate natural looking plants of a desired species. PL
Effects of a potential fourth fermion generation on the upper and lower Higgs boson mass bounds
Philipp Gerhold; Karl Jansen; Jim Kallarackal
2010-10-28T23:59:59.000Z
We study the effect of a potential fourth fermion generation on the upper and lower Higgs boson mass bounds. This investigation is based on the numerical evaluation of a chirally invariant lattice Higgs-Yukawa model emulating the same Higgs-fermion coupling structure as in the Higgs sector of the electroweak Standard Model. In particular, the considered model obeys a Ginsparg-Wilson version of the underlying ${SU}(2)_L\\times {U}(1)_Y$ symmetry, being a global symmetry here due to the neglection of gauge fields in this model. We present our results on the modification of the upper and lower Higgs boson mass bounds induced by the presence of a hypothetical very heavy fourth quark doublet. Finally, we compare these findings to the standard scenario of three fermion generations.
Termination for a Class of Algorithms for Constructing Algebras Given by Generators and Relations
van Leeuwen, Marc
Termination for a Class of Algorithms for Constructing Algebras Given by Generators" of the algebra is used. The algorithm itself is only partially specified: it proceed* *s by repeatedly taking* * for selecting steps is assumed. We study the question whether termination of the algorithm is guaranteed
Adaptive Control of Third Harmonic Generation via Genetic Algorithm
Hua, Xia
2010-10-12T23:59:59.000Z
with selection, to improve the population as the evolution progresses from generation to generation. Femtosecond laser pulse tailoring, with the use of a pulse shaper, has become an important technology which enables applications in femtochemistry, micromachining...
Generation of Blue Noise Arrays by Genetic Algorithm Jeffrey Newbern and V. Michael Bove, Jr.
Bove Jr., V. Michael
Generation of Blue Noise Arrays by Genetic Algorithm Jeffrey Newbern and V. Michael Bove, Jr for generating blueÂnoise threshold arrays which do not appear regular, and offer the visual advantages of error or output device characteristics. We present instead a genetic method for generating a blueÂnoise threshold
Lower bound and an optimal algorithm for leader election in faulty asynchronous general networks
Lateef, Mohammed Afroz
1993-01-01T23:59:59.000Z
the problem of electing a leader in faulty asynchronous general net- works. The network coritams a reliable path connecting all the nodes in the network. The type of failure the links experience is interinittent. Since thc network is asyn- chronous..., the link failures are undetectable. The size of tdic network is N nodes. We prove that the opl, imal message complexity for electing a leader in such a network is H(N E logsN) hits. We also develop an optimal algorithm of message complexity O(N. E...
An Auto-Generated Real-Time Iteration Algorithm for Nonlinear MPC in the Microsecond Range
. Yet a differ- ent approach is the nonlinear real-time iteration (RTI) scheme [11,13]. Like. An overview of existing algorithms for fast non- linear MPC can be found in [14]. The RTI scheme has is to demonstrate that NMPC algorithms based on the RTI scheme can be optimized and auto-generated efficiently
Optimization of a Small Passive Wind Turbine Generator with Multiobjective Genetic Algorithms
Paris-Sud XI, Université de
: Multiobjective Optimization, Genetic Algorithms, Wind Energy, Vertical Axis Wind Turbine hal-00763673,version1 #12;2.2. The Wind Turbine Characteristics A Savonius Vertical Axis Wind Turbine of radius R = 0.5 mOptimization of a Small Passive Wind Turbine Generator with Multiobjective Genetic Algorithms A
An enhanced algorithm for protocol conformance test sequence generation based on the UIO method
Allada, Ravindra
1993-01-01T23:59:59.000Z
An Enhanced Algorithm for Protocol Conformance Test Sequence Generation Based on the UIO Method. (December 1993) Ravindra Allada, B.E., Osmania University, Hyderabad, India Chair of Advisory Committee: Dr. Hosame Abu-Amara A computer protocol is a...
The lower hybrid (LH) heating and current drive system can generate 10-12 MW of microwave power
Background The lower hybrid (LH) heating and current drive system can generate 10-12 MW Plasma diagnostic design and integration Lower hybrid antenna viewing system and protection #12;case with Zemax model · Remote, IR compatible, double vacuum window with pumped interspace · 4, two colour
A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator
Paris-Sud XI, Université de
A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator Wail Rezgui observations distributed over classes is used for simulation purposes. Keywords--Photovoltaic generator, SVM, k-NN, short-circuit fault, smart classification, linear programming. NOMENCLATURE PV = Photovoltaic; SVM
Power Flow Analysis Algorithm for Islanded LV Microgrids Including Distributed Generator Units with
Chaudhary, Sanjay
Power Flow Analysis Algorithm for Islanded LV Microgrids Including Distributed Generator Units With larger portion of growing electricity demand which is being fed through distributed generation (DG power system. Being able to operate in both grid-connected and islanded mode, a microgrid manages
Paris-Sud XI, Université de
The performance of a photovoltaic generator is unfortunately degraded by the presence of defects which may causeA Regression Algorithm for the Smart Prognosis of a Reversed Polarity Fault in a Photovoltaic database containing sample data is used for simulation purposes. Keywords--Photovoltaic generator, SVR, k
Chertkov, Michael; Pan, Feng; Baldick, Ross
2011-01-01T23:59:59.000Z
In this manuscript we continue the thread of [M. Chertkov, F. Pan, M. Stepanov, Predicting Failures in Power Grids: The Case of Static Overloads, IEEE Smart Grid 2011] and suggest a new algorithm discovering most probable extreme stochastic events in static power grids associated with intermittent generation of wind turbines. The algorithm becomes EXACT and EFFICIENT (polynomial) in the case of the proportional (or other low parametric) control of standard generation, and log-concave probability distribution of the renewable generation, assumed known from the wind forecast. We illustrate the algorithm's ability to discover problematic extreme events on the example of the IEEE RTS-96 model of transmission with additions of 10%, 20% and 30% of renewable generation. We observe that the probability of failure may grow but it may also decrease with increase in renewable penetration, if the latter is sufficiently diversified and distributed.
Efficient generation and optimization of stochastic template banks by a neighboring cell algorithm
Henning Fehrmann; Holger J. Pletsch
2014-11-17T23:59:59.000Z
Placing signal templates (grid points) as efficiently as possible to cover a multi-dimensional parameter space is crucial in computing-intensive matched-filtering searches for gravitational waves, but also in similar searches in other fields of astronomy. To generate efficient coverings of arbitrary parameter spaces, stochastic template banks have been advocated, where templates are placed at random while rejecting those too close to others. However, in this simple scheme, for each new random point its distance to every template in the existing bank is computed. This rapidly increasing number of distance computations can render the acceptance of new templates computationally prohibitive, particularly for wide parameter spaces or in large dimensions. This work presents a neighboring cell algorithm that can dramatically improve the efficiency of constructing a stochastic template bank. By dividing the parameter space into sub-volumes (cells), for an arbitrary point an efficient hashing technique is exploited to obtain the index of its enclosing cell along with the parameters of its neighboring templates. Hence only distances to these neighboring templates in the bank are computed, massively lowering the overall computing cost, as demonstrated in simple examples. Furthermore, we propose a novel method based on this technique to increase the fraction of covered parameter space solely by directed template shifts, without adding any templates. As is demonstrated in examples, this method can be highly effective..
Delp, Scott
Capacity to increase walking speed is limited by impaired hip and ankle power generation in lower ankle power generation and increased hip power generation has been proposed as an important mechanism
A comparison and case study of capacity credit algorithms for intermittent generators
Milligan, M.
1997-03-01T23:59:59.000Z
As the electric utility industry moves toward a new structure the responsibility of providing a reliable portfolio of generating resources may be shifted among the various entities m the industry To evaluate whether to undertake a construction project for new generating resources, utilities have traditionally used sophisticated models to assist in the comparison of alternative resources. It is not clear how this type of evaluation will be carried out after the restructuring dust has settled. What is clear, however, is that the market will require some way to measure capacity credit of new power plants, and future contracts will contain provisions under which buyer and seller must agree on capacity measures. This paper co the traditional capacity credit calculations with algorithms that are not nearly so labor intensive.
Chu, Shih-I
-dimensional quantum study of the coherent control of high-order harmonic generation HHG processes in intense pulsed.65.Ky, 32.80.Wr The study of coherent control of atomic and molecular processes is a subject of muchOptimization of high-order harmonic generation by genetic algorithm and wavelet time
Vdovin, V. L., E-mail: vdov@nfi.kiae.ru [National Research Centre 'Kurchatov Institute,' (Russian Federation)
2013-02-15T23:59:59.000Z
The innovative concept and 3D full-wave code modeling the off-axis current drive by radio-frequency (RF) waves in large-scale tokamaks, ITER and DEMO, for steady-state operation with high efficiency is proposed. The scheme uses the helicon radiation (fast magnetosonic waves at high (20-40) ion cyclotron frequency harmonics) at frequencies of 500-700 MHz propagating in the outer regions of the plasmas with a rotational transform. It is expected that the current generated by helicons, in conjunction with the bootstrap current, ensure the maintenance of a given value of the total current in the stability margin q(0) {>=} 2 and q(a) {>=} 4, and will help to have regimes with a negative magnetic shear and internal transport barrier to ensure stability at high normalized plasma pressure {beta}{sub N} > 3 (the so-called advanced scenarios) of interest for the commercial reactor. Modeling with full-wave three-dimensional codes PSTELION and STELEC showed flexible control of the current profile in the reactor plasmas of ITER and DEMO, using multiple frequencies, the positions of the antennae and toroidal wave slow down. Also presented are the results of simulations of current generation by helicons in the DIII-D, T-15MD, and JT-60AS tokamaks. Commercially available continuous-wave klystrons of the MW/tube range are promising for commercial stationary fusion reactors. The compact antennae of the waveguide type are proposed, and an example of a possible RF system for today's tokamaks is given. The advantages of the scheme (partially tested at lower frequencies in tokamaks) are a significant decline in the role of parametric instabilities in the plasma periphery, the use of electrically strong resonator-waveguide type antennae, and substantially greater antenna-plasma coupling.
Man-portable power generation devices : product design and supporting algorithms
Mitsos, Alexander
2006-01-01T23:59:59.000Z
A methodology for the optimal design and operation of microfabricated fuel cell systems is proposed and algorithms for relevant optimization problems are developed. The methodology relies on modeling, simulation and ...
Sorokine, Alexandre [ORNL; Schlicher, Bob G [ORNL; Ward, Richard C [ORNL; Wright, Michael C [ORNL; Kruse, Kara L [ORNL
2015-01-01T23:59:59.000Z
This paper describes an original approach to generating scenarios for the purpose of testing the algorithms used to detect special nuclear materials (SNM) that incorporates the use of ontologies. Separating the signal of SNM from the background requires sophisticated algorithms. To assist in developing such algorithms, there is a need for scenarios that capture a very wide range of variables affecting the detection process, depending on the type of detector being used. To provide such a cpability, we developed an ontology-driven information system (ODIS) for generating scenarios that can be used in creating scenarios for testing of algorithms for SNM detection. The ontology-driven scenario generator (ODSG) is an ODIS based on information supplied by subject matter experts and other documentation. The details of the creation of the ontology, the development of the ontology-driven information system, and the design of the web user interface (UI) are presented along with specific examples of scenarios generated using the ODSG. We demonstrate that the paradigm behind the ODSG is capable of addressing the problem of semantic complexity at both the user and developer levels. Compared to traditional approaches, an ODIS provides benefits such as faithful representation of the users' domain conceptualization, simplified management of very large and semantically diverse datasets, and the ability to handle frequent changes to the application and the UI. The approach makes possible the generation of a much larger number of specific scenarios based on limited user-supplied information
A new gravitational wave generation algorithm for particle perturbations of the Kerr spacetime
Enno Harms; Sebastiano Bernuzzi; Alessandro Nagar; Anil Zenginoglu
2014-11-25T23:59:59.000Z
We present a new approach to solve the 2+1 Teukolsky equation for gravitational perturbations of a Kerr black hole. Our approach relies on a new horizon penetrating, hyperboloidal foliation of Kerr spacetime and spatial compactification. In particular, we present a framework for waveform generation from point-particle perturbations. Extensive tests of a time domain implementation in the code {\\it Teukode} are presented. The code can efficiently deliver waveforms at future null infinity. As a first application of the method, we compute the gravitational waveforms from inspiraling and coalescing black-hole binaries in the large-mass-ratio limit. The smaller mass black hole is modeled as a point particle whose dynamics is driven by an effective-one-body-resummed analytical radiation reaction force. We compare the analytical angular momentum loss to the gravitational wave angular momentum flux. We find that higher-order post-Newtonian corrections are needed to improve the consistency for rapidly spinning binaries. Close to merger, the subdominant multipolar amplitudes (notably the $m=0$ ones) are enhanced for retrograde orbits with respect to prograde ones. We argue that this effect mirrors nonnegligible deviations from circularity of the dynamics during the late-plunge and merger phase. We compute the gravitational wave energy flux flowing into the black hole during the inspiral using a time-domain formalism proposed by Poisson. Finally, a self-consistent, iterative method to compute the gravitational wave fluxes at leading-order in the mass of the particle is presented. For a specific case study with $\\hat{a}$=0.9, a simulation that uses the consistent flux differs from one that uses the analytical flux by $\\sim35$ gravitational wave cycles over a total of about $250$ cycles. In this case the horizon absorption accounts for about $+5$ gravitational wave cycles.
Linear Programming Lower Bounds for Minimum Converter ...
generation algorithm for solving the linear relaxation of the most promising ... Keywords: Optical Networks, Wavelength Assignment, Integer Programming.
Pedram, Massoud
to meet the expected growth of end user energy consumption at the worst case, integration of smart metersA Hierarchical Control Algorithm for Managing Electrical Energy Storage Systems in Homes Equipped University of Southern California Los Angeles, CA, USA {yanzhiwa, siyuyue, pedram}@usc.edu Louis Kerofsky
Xu, Lei
which can Generate Topography Map John Sum, Chi-sing Leung, Lai-wan Chan, and Lei Xu Abstract ordered map, in particular the topography map. Goodhill [4], Kohonen [5], and Willshaw and van der
Vilalta, Ricardo
THEMATIC MAPS OF MARTIAN TOPOGRAPHY GENERATED BY A CLUSTERING ALGORITHM. R. Vilalta, Dept digital topography. These maps show spatial distribution of topo- graphical features and are generated for the observable topography. Traditionally, the descriptive method, applied to imagery data, has been used to study
Next-generation transcriptome assembly
Martin, Jeffrey A.
2012-01-01T23:59:59.000Z
technologies - the next generation. Nat Rev Genet 11, 31-algorithms for next-generation sequencing data. Genomicsassembly from next- generation sequencing data. Genome Res
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21T23:59:59.000Z
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Michele Mosca
2008-08-04T23:59:59.000Z
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
Central Ferry Lower Monumental
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
& Reliability Projects Expand Projects Skip navigation links Line Projects Big Eddy-Knight Central Ferry Lower Monumental Grand Coulee Transmission Line Replacement...
Ness, E.
1999-09-02T23:59:59.000Z
Distributed generation, locating electricity generators close to the point of consumption, provides some unique benefits to power companies and customers that are not available from centralized electricity generation. Photovoltaic (PV) technology is well suited to distributed applications and can, especially in concert with other distributed resources, provide a very close match to the customer demand for electricity, at a significantly lower cost than the alternatives. In addition to augmenting power from central-station generating plants, incorporating PV systems enables electric utilities to optimize the utilization of existing transmission and distribution.
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01T23:59:59.000Z
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
Next generation gas turbines will be required to produce low concentrations of pollutants such as oxides of nitrogen (NOx), carbon monoxide (CO), and soot. In order to design gas turbines which produce Eddy Simulations of A Reverse Flow Combustion System Jeff Spencer Advisor: Marcus Herrmann March 29
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm
International Association for Cryptologic Research (IACR)
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm Shaohua Zhang School of Mathematics, Shandong University, Jinan, Shandong, 250100, PRC Abstract: It is known that Euclid's algorithm, Guass' elimination and Buchberger's algorithm play important roles in algorithmic number the- ory
Lower Bounds and Exact Algorithms for the Quadratic Minimum ...
2013-12-16T23:59:59.000Z
Dec 16, 2013 ... 50. 1225. OP2. 13198. -. -. 13231. 5608. 12940.4. 189. 71. 8244. -. -. -. -. -. -. 50. 1225. OP2. 15137. -. -. 15218. 4768. 14708.5. 193. 123. 11761.
Obtaining Lower Bounds from the Progressive Hedging Algorithm ...
2014-01-21T23:59:59.000Z
Oct 11, 2013 ... Energy Network Integration (GENI) program, and by the Department of ... fied into two or more stages according to which parameter values ..... Simultaneous consideration of multiple scenarios ..... tion from unpredictable and variable sources such as wind and .... We converted the SIPLIB instances into the.
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10T23:59:59.000Z
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.
Topics in Approximation Algorithms
Khare, Monik
2012-01-01T23:59:59.000Z
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
Algorithmic issues in queueing systems and combinatorial counting problems
Katz-Rogozhnikov, Dmitriy A
2008-01-01T23:59:59.000Z
(cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms ...
A hybrid of the genetic algorithm and concurrent simplex
Randolph, David Ethan
1995-01-01T23:59:59.000Z
by drawing the genetic algorithm's attention to local optima too quickly, leading to premature con- vergence [7]. Thus, while local optimization might improve the speed of the analysis, the genetic algorithm might pay dearly with a much lower quality linal...
Nikolova, Evdokia Velinova
2009-01-01T23:59:59.000Z
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components ...
Co-Clustering with Generative Models
Golland, Polina
2009-11-03T23:59:59.000Z
In this paper, we present a generative model for co-clustering and develop algorithms based on the mean field approximation for the corresponding modeling problem. These algorithms can be viewed as generalizations of the ...
Tree Elaboration Strategies Branch and Bound Algorithms
, Elon College Terri Anne Johnson, Elon College Monique Guignard-Spielberg, The University of a sharp lower bound technique in these algorithms is one of the major difficulties. Recently, Hahn
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23T23:59:59.000Z
We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the Hybrid R Algorithm, RHMC is reversible, admitting a Metropolis accept/reject step that eliminates the $\\mathcal{O}(\\delta t^2)$ errors inherent in the R Algorithm. We also employ several algorithmic speed-ups, including multiple time scales, the use of a more efficient numerical integrator, and Hasenbusch pre-conditioning of the fermion force.
Detecting Networks Employing Algorithmically Generated Domain Names
Ashwath Kumar Krishna Reddy
2011-10-21T23:59:59.000Z
Recent Botnets such as Conficker, Kraken and Torpig have used DNS based "domain fluxing" for command-and-control, where each Bot queries for existence of a series of domain names and the owner has to register only one ...
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
Accelerating Majorization Algorithms
Leeuw, Jan de
2008-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
KIRKPATRICK, BONNIE
2011-01-01T23:59:59.000Z
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Advanced Data Analysis Capability and Surrogate Generation |...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Data Analysis Capability and Surrogate Generation May 16, 2013 ADACGen Problem Statement: Researchers rely on realistic datasets to build new analysis algorithms, but in many...
The Simulation of Humans and Lower Animals Demetri Terzopoulos
Terzopoulos, Demetri
work on the motor control of anthropomorphically articulated dynamic models, as well as the biomechanical modeling of lower animals such as fish, including motor control algorithms that enable and Simulation, Human Simulation, Musculoskeletal Modeling, Neuro- muscular Control, Motor Control Learning 1
Advanced CHP Control Algorithms: Scope Specification
Katipamula, Srinivas; Brambley, Michael R.
2006-04-28T23:59:59.000Z
The primary objective of this multiyear project is to develop algorithms for combined heat and power systems to ensure optimal performance, increase reliability, and lead to the goal of clean, efficient, reliable and affordable next generation energy systems.
Cyclic Genetic Algorithm with Conditional Branching PredatorPrey Scenario
Parker, Gary B.
generation, genetic algorithm, hexapod Introduction Evolving controllers autonomous legged robots reduce levels. CGAs were successfully past evolve singleloop robot cycles cycles hexapod robots area coverage
An Improved Algorithm for the Generalized Quadratic Assignment ...
artur
2008-05-15T23:59:59.000Z
presented a special-purpose branch-and-bound algorithm that utilizes linear programming cuts, feasible solution generators, Lagrangean relaxation, and ...
LOWER COLUMBIA SALMON AND STEELHEAD
Appendices Prepared By: Lower Columbia Fish Recovery Board Prepared For Northwest Power And Conservation for Recovery and Subbasin Planning prepared under direction of the Washington Lower Columbia River Fish prepared by the Fish Recovery Board. The Technical Foundation is an encyclopedia of information relating
Lower Tuscaloosa of southern Mississippi
Devery, D.M.
1980-12-01T23:59:59.000Z
The Lower Tuscaloosa Formation of the upper Cretaceous currently is producing primarily oil from more than 50 fields in the interior salt basin of Mississippi. These fields are located within an area extending from east Louisiana into SW and S.-central Mississippi (Jefferson, Adams, Franklin, Lincoln, Amite, Pike, Walthall, Lamar, Forrest, and Pearl River Counties). Stratigraphically, the Lower Tuscaloosa unconformably overlies lower Cretaceous sediments of the Dantzler Formation and underlies lower Cretaceous shales of the Middle Tuscaloosa. The formation consists of a transgressive sequence that grades upward from alluvial plain through delta to marine deposits. Prospecting for oil and gas as well as developing new fields in the Lower Tuscaloosa can be difficult. There is generally a lack of strong structural closure; accumulation of oil and gas is controlled largely by stratigraphy, with lenticular sands pinching out into shales.
A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization
Terri Anne Johnson, Clemson University Monique Guignard-Spielberg, The University of Pennsylvania-and-bound are the most successful, but the lack of sharp lower bounds in these algorithms has been one of the major
Lower Hybrid antennas for nuclear fusion experiments
Hillairet, Julien; Bae, Young-Soon; Bai, X; Balorin, C; Baranov, Y; Basiuk, V; Bécoulet, A; Belo, J; Berger-By, G; Brémond, S; Castaldo, C; Ceccuzzi, S; Cesario, R; Corbel, E; Courtois, X; Decker, J; Delmas, E; Delpech, L; Ding, X; Douai, D; Ekedahl, A; Goletto, C; Goniche, M; Guilhem, D; Hertout, P; Imbeaux, F; Litaudon, X; Magne, R; Mailloux, J; Mazon, D; Mirizzi, F; Mollard, P; Moreau, P; Oosako, T; Petrzilka, V; Peysson, Y; Poli, S; Preynas, M; Prou, M; Saint-Laurent, F; Samaille, F; Saoutic, B
2015-01-01T23:59:59.000Z
The nuclear fusion research goal is to demonstrate the feasibility of fusion power for peaceful purposes. In order to achieve the conditions similar to those expected in an electricity-generating fusion power plant, plasmas with a temperature of several hundreds of millions of degrees must be generated and sustained for long periods. For this purpose, RF antennas delivering multi-megawatts of power to magnetized confined plasma are commonly used in experimental tokamaks. In the gigahertz range of frequencies, high power phased arrays known as "Lower Hybrid" (LH) antennas are used to extend the plasma duration. This paper reviews some of the technological aspects of the LH antennas used in the Tore Supra tokamak and presents the current design of a proposed 20 MW LH system for the international experiment ITER.
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01T23:59:59.000Z
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
Technical Report No. 494 Using Cyclic Genetic Algorithms
Parker, Gary B.
automata for a small hexapod robot are generated by a cyclic genetic algorithm. From these automata of the hexapod's ``nervous system'' is part of a general environment for experimentation with multi involves a form of genetic algorithm generating locomotion control in very simple hexapod agents. Frequent
Method of generating a surface mesh
Shepherd, Jason F. (Albuquerque, NM); Benzley, Steven (Provo, UT); Grover, Benjamin T. (Tracy, CA)
2008-03-04T23:59:59.000Z
A method and machine-readable medium provide a technique to generate and modify a quadrilateral finite element surface mesh using dual creation and modification. After generating a dual of a surface (mesh), a predetermined algorithm may be followed to generate and modify a surface mesh of quadrilateral elements. The predetermined algorithm may include the steps of generating two-dimensional cell regions in dual space, determining existing nodes in primal space, generating new nodes in the dual space, and connecting nodes to form the quadrilateral elements (faces) for the generated and modifiable surface mesh.
Shlapentokh, Alexandra
Diophantine Generation, Horizontal and Vertical Problems, and the Weak Vertical Method Alexandra Shlapentokh Diophantine Sets, Definitions and Generation Diophantine Sets Diophantine Generation Properties of Diophantine Generation Diophantine Family of Z Diophantine Family of a Polynomial Ring Going Down Horizontal
Automatic toilet seat lowering apparatus
Guerty, Harold G. (Palm Beach Gardens, FL)
1994-09-06T23:59:59.000Z
A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat. A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat.
Improved Sampling Algorithms in Lattice QCD
Gambhir, Arjun Singh
2015-01-01T23:59:59.000Z
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Improved Sampling Algorithms in Lattice QCD
Arjun Singh Gambhir; Kostas Orginos
2015-06-19T23:59:59.000Z
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Catalyst for producing lower alcohols
Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)
1987-01-01T23:59:59.000Z
A process and system for the production of the lower alcohols such as methanol, ethanol and propanol involves the reaction of carbon monoxide and water in the presence of a lead salt and an alkali metal formate catalyst combination. The lead salt is present as solid particles such as lead titanate, lead molybdate, lead vanadate, lead zirconate, lead tantalate and lead silicates coated or in slurry within molten alkali metal formate. The reactants, carbon monoxide and steam are provided in gas form at relatively low pressures below 100 atmospheres and at temperatures of 200-400.degree. C. The resulted lower alcohols can be separated into boiling point fractions and recovered from the excess reactants by distillation.
A background correction algorithm for Van Allen Probes MagEIS electron flux measurements
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Claudepierre, S. G.; O'Brien, T. P.; Blake, J. B.; Fennell, J. F.; Roeder, J. L.; Clemmons, J. H.; Looper, M. D.; Mazur, J. E.; Mulligan, T. M.; Spence, H. E.; et al
2015-07-14T23:59:59.000Z
We describe an automated computer algorithm designed to remove background contamination from the Van Allen Probes Magnetic Electron Ion Spectrometer (MagEIS) electron flux measurements. We provide a detailed description of the algorithm with illustrative examples from on-orbit data. We find two primary sources of background contamination in the MagEIS electron data: inner zone protons and bremsstrahlung X-rays generated by energetic electrons interacting with the spacecraft material. Bremsstrahlung X-rays primarily produce contamination in the lower energy MagEIS electron channels (~30–500 keV) and in regions of geospace where multi-M eV electrons are present. Inner zone protons produce contamination in all MagEIS energymore »channels at roughly L « less
Oxygen enhanced switching to combustion of lower rank fuels
Kobayashi, Hisashi; Bool III, Lawrence E.; Wu, Kuang Tsai
2004-03-02T23:59:59.000Z
A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum amount of energy per unit of time is enabled to combust fuel having a lower energy content, while still obtaining at least the stated minimum energy generation rate, by replacing a small amount of the combustion air fed to the furnace by oxygen. The replacement of oxygen for combustion air also provides reduction in the generation of NOx.
A family of lowered isothermal models
Gieles, Mark
2015-01-01T23:59:59.000Z
We present a family of self-consistent, spherical, lowered isothermal models, consisting of one or more mass components, with parameterised prescriptions for the energy truncation and for the amount of radially biased pressure anisotropy. The models are particularly suited to describe the phase-space density of stars in tidally limited, mass-segregated star clusters in all stages of their life-cycle. The models extend a family of isotropic, single-mass models by Gomez-Leyton and Velazquez, of which the well-known Woolley, King and Wilson (in the non-rotating and isotropic limit) models are members. We derive analytic expressions for the density and velocity dispersion components in terms of potential and radius, and introduce a fast model solver in PYTHON (LIMEPY), that can be used for data fitting or for generating discrete samples.
Office of Environmental Management (EM)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 of Thomas P.Oil,J. B. Cardell Smith College C.of EnergyStrategic Actionof Lower Coloradofrom5
Lower Sioux Wind Feasibility & Development
Minkel, Darin
2012-04-01T23:59:59.000Z
This report describes the process and findings of a Wind Energy Feasibility Study (Study) conducted by the Lower Sioux Indian Community (Community). The Community is evaluating the development of a wind energy project located on tribal land. The project scope was to analyze the critical issues in determining advantages and disadvantages of wind development within the Community. This analysis addresses both of the Community's wind energy development objectives: the single turbine project and the Commerical-scale multiple turbine project. The main tasks of the feasibility study are: land use and contraint analysis; wind resource evaluation; utility interconnection analysis; and project structure and economics.
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01T23:59:59.000Z
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
GENERATING TEXT DESCRIPTIONS FOR GEOGRAPHICALLY DISTRIBUTED SENSORS
Molina, Martín
GENERATING TEXT DESCRIPTIONS FOR GEOGRAPHICALLY DISTRIBUTED SENSORS Martin Molina and Javier generation of geographic descriptions in natural language for geographically distributed sensors. We describe and the algorithm that we designed to generate the geographic descriptions for sensors. Besides GIS data files, our
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption
California at Irvine, University of
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption Andrew Gearhart #12;Relation design use feedback to "cotune" compute kernel energy efficiency #12;Previous Work: Communication Lower-optimal" algorithms #12;Communication is energy inefficient! · On-chip/Off-chip gap isn't going to improve much Data
Kalina, Alexander I. (12214 Clear Fork, Houston, TX 77077)
1984-01-01T23:59:59.000Z
A method of generating energy which comprises utilizing relatively lower temperature available heat to effect partial distillation of at least portion of a multicomponent working fluid stream at an intermediate pressure to generate working fluid fractions of differing compositions. The fractions are used to produce at least one main rich solution which is relatively enriched with respect to the lower boiling component, and to produce at least one lean solution which is relatively improverished with respect to the lower boiling component. The pressure of the main rich solution is increased whereafter it is evaporated to produce a charged gaseous main working fluid. The main working fluid is expanded to a low pressure level to release energy. The spent low pressure level working fluid is condensed in a main absorption stage by dissolving with cooling in the lean solution to regenerate an initial working fluid for reuse.
None
2012-03-16T23:59:59.000Z
GENI Project: The CRA team is developing control technology to help grid operators more actively manage power flows and integrate renewables by optimally turning on and off entire power lines in coordination with traditional control of generation and load resources. The control technology being developed would provide grid operators with tools to help manage transmission congestion by identifying the facilities whose on/off status must change to lower generation costs, increase utilization of renewable resources and improve system reliability. The technology is based on fast optimization algorithms for the near to real-time change in the on/off status of transmission facilities and their software implementation.
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
Algorithms and Problem Solving Introduction
Razak, Saquib
Unit 16 1 Algorithms and Problem Solving · Introduction · What is an Algorithm? · Algorithm Properties · Example · Exercises #12;Unit 16 2 What is an Algorithm? What is an Algorithm? · An algorithm. · The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem
Mass Market Demand Response and Variable Generation Integration Issues: A Scoping Study
Cappers, Peter
2012-01-01T23:59:59.000Z
Pricing on the Usage of Wind Generation. Power Systems, IEEE2008) Analysis of Wind Generation Impact on ERCOT Anclillaryto higher or lower wind generation than scheduled. To manage
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01T23:59:59.000Z
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Reconstruction algorithms for MRI
Bilgic?, Berkin
2013-01-01T23:59:59.000Z
This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...
Rubinfeld, Ronitt
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01T23:59:59.000Z
Indigenous Optimizing Algorithm. Mathematical Anthropologythe use of maximizing algorithms in behavior is a crucialthe knowledge, rules, and algorithms that they apply. If we
Variational Algorithms for Marginal MAP
Liu, Q; Ihler, A
2013-01-01T23:59:59.000Z
2004. A. L. Yuille. CCCP algorithms to minimize the BetheA tutorial on MM algorithms. The American Statistician, 1(time approximation algorithms for the ising model. SIAM
Savings Project: Lower Water Heating Temperature | Department...
Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings 12-30 annually for each 10F...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
High Quality Compact Delay Test Generation
Wang, Zheng
2011-08-08T23:59:59.000Z
and pattern count. First, a new dynamic compaction algorithm has been proposed to generate compacted test sets for K longest paths per gate (KLPG) in combinational circuits or scan-based sequential circuits. This algorithm uses a greedy approach to compact...
Giorda, Paolo [Institute for Scientific Interchange, Villa Gualino Viale Settimio Severo 65, 10133 Turin (Italy); Iorio, Alfredo [Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307 (United States); INFN, Rome (Italy); Sen, Samik [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); Sen, Siddhartha [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); IACS, Jadavpur, Calcutta 700032 (India)
2004-09-01T23:59:59.000Z
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-(1/2) SU(2) generalized coherent states. Surprisingly, we find evidence that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.
Physical Algorithms Roger Wattenhofer
Physical Algorithms Roger Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07T23:59:59.000Z
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
Relation between XL algorithm and Grobner Bases Algorithms
International Association for Cryptologic Research (IACR)
Relation between XL algorithm and Gr¨obner Bases Algorithms Makoto Sugita1 , Mitsuru Kawazoe2 the XL algorithm and Gr¨obner bases algorithms. The XL algorithm was proposed to be a more efficient algorithm to solve a system of equations with a special assumption with- out trying to calculate a whole Gr
Sec$on Summary ! Properties of Algorithms
#12;Sec$on Summary ! Properties of Algorithms ! Algorithms for Searching and Sorting ! Greedy Algorithms ! Halting Problem #12;Problems and Algorithms ! In many. This procedure is called an algorithm. #12;Algorithms Definition: An algorithm
Status of dynamical ensemble generation
Chulwoo Jung
2010-01-06T23:59:59.000Z
I give an overview of current and future plans of dynamical QCD ensemble generation activities. A comparison of simulation cost between different discretizations is made. Recent developments in techniques and algorithms used in QCD dynamical simulations, especially mass reweighting, are also discussed.
Combinations of Estimation of Distribution Algorithms and Other Techniques
Zhang, Qingfu
for solving hard search and optimization problems: (a) guided mutation, an offspring generator in which algorithm with guided mutation outperforms the best GA for the maximum clique problem, (b) evolutionary to be improved by an expensive local search. Index Terms Estimation Distribution Algorithm, Guided Mutation
A distributed accelerated gradient algorithm for distributed model predictive
Como, Giacomo
power control, Distributed optimization, Accelerated gradient algorithm, Model predictive control, Distributed model predictive control 1. Introduction Hydro power plants generate electricity from potential. By sig- nificantly increasing the power efficiency of hydro power valley (HPV) systems, real-time control
FDD Algorithm for an AHU Reverse-Return System
Djuric, N.; Novakovic, V.
A fault detection and diagnosis (FDD) algorithm was developed for an AHU reverse-return system for air cooling. These FDD rules were generated using simulation in three steps. Cause-effect rules were established by connecting the faults...
Monroe, David Charles
2014-08-11T23:59:59.000Z
Believably and realistically fracturing computer generated glass for visual effects has been previously solved through various methods such as algorithmic approaches, utilizing texture maps, or finite element analysis. These solutions can achieve...
Winter Energy Savings from Lower Thermostat Settings
Reports and Publications (EIA)
2000-01-01T23:59:59.000Z
This discussion provides details on the effect of lowering thermostat settings during the winter heating months of 1997.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Untapped Value of Backup Generation While new guidelines and regulations such as IEEE (Institute of Electrical and Electronics Engineers) 1547 have come a long way in addressing...
Mills, Andrew
2013-01-01T23:59:59.000Z
demand, more flexible thermal generation, and lower costof VG technologies), more flexible thermal generation, pricedemand, more flexible thermal generation, and low-cost bulk-
Algorithms for Symmetric Linear and Integer Programs
Bödi, Richard; Joswig, Michael
2010-01-01T23:59:59.000Z
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
Polak, E.
1982-05-01T23:59:59.000Z
An implementable master algorithm for solving optimal design centering, tolerancing, and tuning problems is presented. This master algorithm decomposes the original nondifferentiable optimization problem into a sequence of ordinary nonlinear programming problems. The master algorithm generates sequences with accumulation points that are feasible and satisfy a new optimality condition, which is shown to be stronger than the one previously used for these problems.
Thermoacoustic magnetohydrodynamic electrical generator
Wheatley, J.C.; Swift, G.W.; Migliori, A.
1984-11-16T23:59:59.000Z
A thermoacoustic magnetohydrodynamic electrical generator includes an intrinsically irreversible thermoacoustic heat engine coupled to a magnetohydrodynamic electrical generator. The heat engine includes an electrically conductive liquid metal as the working fluid and includes two heat exchange and thermoacoustic structure assemblies which drive the liquid in a push-pull arrangement to cause the liquid metal to oscillate at a resonant acoustic frequency on the order of 1000 Hz. The engine is positioned in the field of a magnet and is oriented such that the liquid metal oscillates in a direction orthogonal to the field of the magnet, whereby an alternating electrical potential is generated in the liquid metal. Low-loss, low-inductance electrical conductors electrically connected to opposite sides of the liquid metal conduct an output signal to a transformer adapted to convert the low-voltage, high-current output signal to a more usable higher voltage, lower current signal.
Thermoacoustic magnetohydrodynamic electrical generator
Wheatley, John C. (Los Alamos, NM); Swift, Gregory W. (Los Alamos, NM); Migliori, Albert (Santa Fe, NM)
1986-01-01T23:59:59.000Z
A thermoacoustic magnetohydrodynamic electrical generator includes an intrinsically irreversible thermoacoustic heat engine coupled to a magnetohydrodynamic electrical generator. The heat engine includes an electrically conductive liquid metal as the working fluid and includes two heat exchange and thermoacoustic structure assemblies which drive the liquid in a push-pull arrangement to cause the liquid metal to oscillate at a resonant acoustic frequency on the order of 1,000 Hz. The engine is positioned in the field of a magnet and is oriented such that the liquid metal oscillates in a direction orthogonal to the field of the magnet, whereby an alternating electrical potential is generated in the liquid metal. Low-loss, low-inductance electrical conductors electrically connected to opposite sides of the liquid metal conduct an output signal to a transformer adapted to convert the low-voltage, high-current output signal to a more usable higher voltage, lower current signal.
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy
Stadler, Peter F.
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy landscapes a generic, problem independent algorithm for exploration of the low- energy portion of the energy landscape of discrete systems and apply it to the energy landscape of lattice proteins. Starting from a set of optimal
Thermoelectric Generators 1. Thermoelectric generator
Lee, Ho Sung
1 Thermoelectric Generators HoSung Lee 1. Thermoelectric generator 1.1 Basic Equations In 1821 effects are called the thermoelectric effects. The mechanisms of thermoelectricity were not understood. Cold Hot I - -- - - - - -- Figure 1 Electron concentration in a thermoelectric material. #12;2 A large
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01T23:59:59.000Z
and A. Spillner. Consistency of the Neighbor-Net algorithm.Algorithms for Molecular Biology, 2:8, 2007. [10] P.D. Gusfield. Efficient algorithms for inferring evolutionary
Sandia National Laboratories: lowering costs associated with...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
lowering costs associated with geothermal energy production Sandia and Atlas-Copco Secoroc Advance to Phase 2 in Their Geothermal Energy Project On July 31, 2013, in Energy,...
Savings Project: Lower Water Heating Temperature | Department...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
and Energy at Home Savings Project: Lower Water Heating Temperature Tips: Booklet Distribution Save energy and more with ENERGY STAR. ENERGY STAR clothes washers use 20% less...
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01T23:59:59.000Z
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
Kiran Kumar Bhogadi Decomposition and Generation of Minimal Strongly Connected Digraphs
Robinson, Robert W.
of this algorithm, we are also able to generate all the 2connected MSDs through 13 vertices in less than an hourKiran Kumar Bhogadi Decomposition and Generation of Minimal Strongly Connected Digraphs (Under the direction of Robert W. Robinson) A new algorithm for the generation of minimal strongly connected digraphs
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
Sandbar Dynamics of the Lower Platte
Nebraska-Lincoln, University of
Sandbar Dynamics of the Lower Platte River Pilot Study 2011 methods and initial results In cooperation with Lower Platte South Natural Resources District By Jason S. Alexander and Ron Zelt Photo credits: Nebraska Tern and Plover Conservation Partnership #12;Why does the Platte River provide excellent
CS 441T 539T: Advanced Algorithms Fall Semester, 2002 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T/539T: Advanced Algorithms Fall Semester, 2003 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
CS 441T 539T: Advanced Algorithms Fall Semester, 2003 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T 539T: Advanced Algorithms Fall Semester, 2001 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T/539T: Advanced Algorithms Fall Semester, 2001 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
CS 441T/539T: Advanced Algorithms Fall Semester, 2002 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
Muon ID - taking care of lower momenta muons
Milstene, C.; Fisk, G.; Para, A.; /Fermilab
2005-12-01T23:59:59.000Z
In the Muon package under study, the tracks are extrapolated using an algorithm which accounts for the magnetic field and the ionization (dE/dx). We improved the calculation of the field dependent term to increase the muon detection efficiency at lower momenta using a Runge-Kutta method. The muon identification and hadron separation in b-bbar jets is reported with the improved software. In the same framework, the utilization of the Kalman filter is introduced. The principle of the Kalman filter is described in some detail with the propagation matrix, with the Runge-Kutta term included, and the effect on low momenta for low momenta single muons particles is described.
Fast generation of sparse random kernel graphs
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10T23:59:59.000Z
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
Project Profile: Next-Generation Parabolic Trough Collectors...
Broader source: Energy.gov (indexed) [DOE]
team hopes to employ innovative approaches to developing the next generation of lower-cost parabolic trough technologies that can compete on an equal footing with conventional...
Ricci, Laura
D in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithmsIntroduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Epidemic Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Stochastic Ion Heating by Lower Hybrid Turbulence
Candy, J.
2010-01-01T23:59:59.000Z
of Tur b ulent S jpectrum Heating S imulations. Run 1A 2A 3ADivision Stochastic Ion Heating by Lower Hybrid Turbulenceweb development in this heating process is also discussed. I
Lower Saccharide Nanometric Materials and Methods
Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek
2004-07-13T23:59:59.000Z
A ceramic composition having at least one nanometric ceramic powder, at least one lower saccharide, and water. The composition is useful in many industrial applications, including preparation of stronger and substantially defect free green and sintered ceramic bodies.
Continental Lower Crust Bradley R. Hacker,1
Hacker, Bradley R.
Continental Lower Crust Bradley R. Hacker,1 Peter B. Kelemen,2 and Mark D. Behn3 1 Department of Earth Science, University of California, Santa Barbara, California 93106; email: hacker@geol.ucsb.edu 2
An efficient parallel algorithm for matrix-vector multiplication
Hendrickson, B.; Leland, R.; Plimpton, S.
1993-03-01T23:59:59.000Z
The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in the well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.
Disentangling Clustering Effects in Jet Algorithms
Randall Kelley; Jonathan R. Walsh; Saba Zuberi
2012-04-04T23:59:59.000Z
Clustering algorithms build jets though the iterative application of single particle and pairwise metrics. This leads to phase space constraints that are extremely complicated beyond the lowest orders in perturbation theory, and in practice they must be implemented numerically. This complication presents a significant barrier to gaining an analytic understanding of the perturbative structure of jet cross sections. We present a novel framework to express the jet algorithm's phase space constraints as a function of clustered groups of particles, which are the possible outcomes of the algorithm. This approach highlights the analytic properties of jet observables, rather than the explicit constraints on individual final state momenta, which can be unwieldy at higher orders. We derive the form of the n-particle phase space constraints for a jet algorithm with any measurement. We provide an expression for the measurement that makes clustering effects manifest and relates them to constraints from clustering at lower orders. The utility of this framework is demonstrated by using it to understand clustering effects for a large class of jet shape observables in the soft/collinear limit. We apply this framework to isolate divergences and analyze the logarithmic structure of the Abelian terms in the soft function, providing the all-orders form of these terms and showing that corrections from clustering start at next-to-leading logarithmic order in the exponent of the cross section.
A Next Generation Alarm Processing Algorithm Incorporating Recommendations and Decisions
capacitors, transformer tap changing, wide area control systems, wide area measurement systems. I if the system events that have caused the alarms require immediate action. For example, a transformer fault can at relatively high power levels more frequently in order to fully implement power marketing. These high levels
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01T23:59:59.000Z
parameters for 4 different tiles of the 76- cycle PhiX174scores at error tolerance . . . . 2.9 Tile-specific errorsection). Normalizing by the tile-wide average c t is to
Generation of Simulated Wind Data using an Intelligent Algorithm...
Office of Scientific and Technical Information (OSTI)
Technologies Office Country of Publication: United States Language: English Subject: 17 WIND ENERGY; 24 POWER TRANSMISSION AND DISTRIBUTION Wind Energy Word Cloud More Like This...
Generating Arachnid Robot Gaits with Cyclic Genetic Algorithms
Parker, Gary B.
hexapod robot (1994). These solutions proved to be successful for the robots used but we wanted a solution
Generation of Simulated Wind Data using an Intelligent Algorithm
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,SeparationConnect Journal Article: DiscreteFELIX: Thenerve(Technical(Journal Article) |(Conference) | SciTech
Pre-processing Techniques For Anytime Coalition Structure Generation Algorithms
McBurney, Peter
, Andrew Dowell, Peter McBurney and Michael Wooldridge Department of Computer Science, The University
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01T23:59:59.000Z
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \\lim_{+\\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \\lambda q, with \\lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.
Srinivasan-Rao, Triveni (Shoreham, NY)
2002-01-01T23:59:59.000Z
A photon generator includes an electron gun for emitting an electron beam, a laser for emitting a laser beam, and an interaction ring wherein the laser beam repetitively collides with the electron beam for emitting a high energy photon beam therefrom in the exemplary form of x-rays. The interaction ring is a closed loop, sized and configured for circulating the electron beam with a period substantially equal to the period of the laser beam pulses for effecting repetitive collisions.
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Powell, Warren B.
for the optimal control of such power systems are critical for the deployment of reliable and more economical and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We useBenchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
Pavel, Lacra
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game Lacra Pavel Department. A Nash game is formulated between channels with channel utility related to maximizing channel optical the coupled Nash game into a lower-level Nash game with no coupled constraints, and a higher-level link
A Flexible Integrated Architecture For Generating Poetic Texts
Manurung, Hisar; Ritchie, Graeme; Thompson, Henry
2000-01-01T23:59:59.000Z
In this paper we describe a flexible approach to natural language generation that employs a stochastic hillclimbing search algorithm and an integrated architecture. We then discuss the benefits of this approach over existing, informative, goal...
Quantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1
Salvaggio, Carl
, and quantitatively evaluate infrared contrast enhancement algorithms for use in a real-time long-wave infrared imageQuantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1 and Carl range imagery output from current sensors are compressed in a pleasing way for display on lower dynamic
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02T23:59:59.000Z
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.
Incentives and Internet Algorithms
Feigenbaum, Joan
Game Theory Internet Design #12;9 Game Theory and the Internet Â· Long history of work: Â NetworkingIncentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf Scott with selfishness? Â· Internet Architecture: robust scalability Â How to build large and robust systems? #12
Genetic Algorithms Artificial Life
Forrest, Stephanie
systems tremendously. Likewise, evolution of artificial systems is an important component of artificial) are currently the most promi nent and widely used models of evolution in artificiallife systems. GAs have beenGenetic Algorithms and Artificial Life Melanie Mitchell Santa Fe Institute 1660 Old Pecos Tr
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01T23:59:59.000Z
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm
Morsy, Hazem Kamal
1997-01-01T23:59:59.000Z
Distributed systems have become a popular computing environment. Due to their high potentials in improving performance and resource sharing, the evolution and maturing of technologies such as networks and computer hardware, have led to more...
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01T23:59:59.000Z
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
EARTH SCIENCES Lower-Division Requirements
Constable, Steve
2012-2013 EARTH SCIENCES Lower-Division Requirements Math 20A_____ 20B_____ 20C_____ 20D (BILD 3) _____ SIO 50* _____ Group A: Earth Science Upper-Division Core Requirements (all courses _____ Introduction to Geophysics SIO 104 _____ Paleobiology and History of Life* Group B: Upper-Division Earth
THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN
Rutten, Rob
over large fields, long times and many wave- lengths (heights) simultaneously -- Judge and Peter (1998THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN Sterrekundig Instituut, Postbus 80 000, NLÂ3508 TA, Utrecht, The Netherlands Abstract. This "rapporteur" report discusses the solar photosphere and low
Lower-Dimensional Black Hole Chemistry
Antonia M. Frassino; Robert B. Mann; Jonas R. Mureika
2015-09-18T23:59:59.000Z
The connection between black hole thermodynamics and chemistry is extended to the lower-dimensional regime by considering the rotating and charged BTZ metric in the $(2+1)$-D and a $(1+1)$-D limits of Einstein gravity. The Smarr relation is naturally upheld in both BTZ cases, where those with $Q \
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23T23:59:59.000Z
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Axioms, algorithms and Hilbert's Entscheidungsproblem
Axioms, algorithms and Hilbert's Entscheidungsproblem Jan Stovicek Department of Mathematical Sciences September 9th, 2008 www.ntnu.no Jan Stovicek, Axioms & algorithms #12;2 Outline The Decision & algorithms #12;3 Outline The Decision Problem Formal Languages and Theories Incompleteness Undecidability www
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02T23:59:59.000Z
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.
Tomasz Plawski, J. Hovater
2010-09-01T23:59:59.000Z
A digital low level radio frequency (RF) system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA, and finally a transmitting DAC. This universal platform opens up the possibilities for a variety of control algorithm implementations. The foremost concern for an RF control system is cavity field stability, and to meet the required quality of regulation, the chosen control system needs to have sufficient feedback gain. In this paper we will investigate the effectiveness of the regulation for three basic control system algorithms: I&Q (In-phase and Quadrature), Amplitude & Phase and digital SEL (Self Exciting Loop) along with the example of the Jefferson Lab 12 GeV cavity field control system.
Stability of Coupling Algorithms
Akkasale, Abhineeth
2012-07-16T23:59:59.000Z
of Committee, K. B. Nakshatrala Committee Members, Steve Suh J. N. Reddy Head of Department, Dennis O?Neal May 2011 Major Subject: Mechanical Engineering iii ABSTRACT Stability of Coupling Algorithms. (May 2011) Abhineeth Akkasale, B.E., Bangalore... step. iv To Amma and Anna v ACKNOWLEDGMENTS First and foremost, I thank Dr. Kalyana B. Nakshatrala for being an incredible advisor and for his time and patience in constantly guiding me through my research. I am indebted to him for his guidance...
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01T23:59:59.000Z
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Monitoring and Commissioning Verification Algorithms for CHP Systems
Brambley, Michael R.; Katipamula, Srinivas; Jiang, Wei
2008-03-31T23:59:59.000Z
This document provides the algorithms for CHP system performance monitoring and commissioning verification (CxV). It starts by presenting system-level and component-level performance metrics, followed by descriptions of algorithms for performance monitoring and commissioning verification, using the metric presented earlier. Verification of commissioning is accomplished essentially by comparing actual measured performance to benchmarks for performance provided by the system integrator and/or component manufacturers. The results of these comparisons are then automatically interpreted to provide conclusions regarding whether the CHP system and its components have been properly commissioned and where problems are found, guidance is provided for corrections. A discussion of uncertainty handling is then provided, which is followed by a description of how simulations models can be used to generate data for testing the algorithms. A model is described for simulating a CHP system consisting of a micro-turbine, an exhaust-gas heat recovery unit that produces hot water, a absorption chiller and a cooling tower. The process for using this model for generating data for testing the algorithms for a selected set of faults is described. The next section applies the algorithms developed to CHP laboratory and field data to illustrate their use. The report then concludes with a discussion of the need for laboratory testing of the algorithms on a physical CHP systems and identification of the recommended next steps.
QCD Jet Rates with the Inclusive Generalized kt Algorithms
Erik Gerwick; Ben Gripaios; Steffen Schumann; Bryan Webber
2013-04-15T23:59:59.000Z
We derive generating functions, valid to next-to-double logarithmic accuracy, for QCD jet rates according to the inclusive forms of the kt, Cambridge/Aachen and anti-kt algorithms, which are equivalent at this level of accuracy. We compare the analytical results with jet rates and average jet multiplicities from the SHERPA event generator, and study the transition between Poisson-like and staircase-like behaviour of jet ratios.
Distributed algorithms for mobile ad hoc networks
Malpani, Navneet
2001-01-01T23:59:59.000Z
We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...
Random Search Algorithms Zelda B. Zabinsky
Del Moral , Pierre
Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross
PVT Analysis With A Deconvolution Algorithm
Kouzes, Richard T.
2011-02-01T23:59:59.000Z
Polyvinyl Toluene (PVT) plastic scintillator is the most common gamma ray detector material used for large systems when only gross counting is needed because of its low cost, robustness, and relative sensitivity. PVT does provide some energy information about the incident photons, as has been demonstrated through the development of Energy Windowing analysis. There is a more sophisticated energy analysis algorithm developed by Symetrica, Inc., and they have demonstrated the application of their deconvolution algorithm to PVT with very promising results. The thrust of such a deconvolution algorithm used with PVT is to allow for identification and rejection of naturally occurring radioactive material, reducing alarm rates, rather than the complete identification of all radionuclides, which is the goal of spectroscopic portal monitors. Under this condition, there could be a significant increase in sensitivity to threat materials. The advantage of this approach is an enhancement to the low cost, robust detection capability of PVT-based radiation portal monitor systems. The success of this method could provide an inexpensive upgrade path for a large number of deployed PVT-based systems to provide significantly improved capability at a much lower cost than deployment of NaI(Tl)-based systems of comparable sensitivity.
Downhole hydraulic seismic generator
Gregory, Danny L. (Corrales, NM); Hardee, Harry C. (Albuquerque, NM); Smallwood, David O. (Albuquerque, NM)
1992-01-01T23:59:59.000Z
A downhole hydraulic seismic generator system for transmitting energy wave vibrations into earth strata surrounding a borehole. The system contains an elongated, unitary housing operably connected to a well head aboveground by support and electrical cabling, and contains clamping apparatus for selectively clamping the housing to the walls of the borehole. The system further comprises a hydraulic oscillator containing a double-actuating piston whose movement is controlled by an electro-servovalve regulating a high pressure hydraulic fluid flow into and out of upper and lower chambers surrounding the piston. The spent hydraulic fluid from the hydraulic oscillator is stored and pumped back into the system to provide high pressure fluid for conducting another run at the same, or a different location within the borehole.
Prime number generation and factor elimination
Vineet Kumar
2014-10-06T23:59:59.000Z
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the number line. Generally the different categories of prime numbers found till date, satisfy the form of this function. We present some absolute and probabilistic conditions for the primality of the number generated by this method. This function is capable of leading to highly efficient algorithms for generating prime numbers.
5. Greedy and other efficient optimization algorithms
Keil, David M.
5. Greedy and other efficient optimization algorithms David Keil Analysis of Algorithms 7/14 1David Keil Analysis of Algorithms 5. Greedy algorithms 8/14 CSCI 347 Analysis of Algorithms David M. Keil, Framingham State University 5. Greedy and other fast optimization algorithms 1. When the next step is easy
Optimal Algorithms for GSM Viterbi Modules M.Sc. Student
design of the 3rd-Generation Global System for Mobile communica- tions(GSM 3G) unit's channel code soft-decision bits. The power and area optimization is only considered at the algorithm communication methodology . . . . . . . . . . . . . . . . . . . . . . . . 16 2.1.1 Data transmission
Technical Report No. 494 Using Cyclic Genetic Algorithms
Portland State University
for a small hexapod robot are generated by a cyclic genetic algorithm. From these automata a Xilinx net list the communication network of an experimental robot colony. This recon guration of the hexapod's nervous system locomotion control in very simple hexapod agents. Frequent redesign of agent control is part of the evolving
Optimizing Ballast Design of Wave Energy Converters Using Evolutionary Algorithms
Tumer, Kagan
Optimizing Ballast Design of Wave Energy Converters Using Evolutionary Algorithms Mitch Colby, 97331 kagan.tumer@oregonstate.edu ABSTRACT Wave energy converters promise to be a viable alternative the ballast geometry of a wave energy genera- tor using a two step process. First, we generate a function
Learning Active Basis Models by EM-Type Algorithms
Wu, Ying Nian
Learning Active Basis Models by EM-Type Algorithms Zhangzhang Si1, Haifeng Gong1,2, Song-Chun Zhu1, and scales as latent variables into the image generation process, and learn the template by EM-type scheme for learning image templates of object categories where the learning is not fully supervised. We
Mobile Applications and Algorithms to Facilitate Electric Vehicle Deployment
de Veciana, Gustavo
Mobile Applications and Algorithms to Facilitate Electric Vehicle Deployment Yuhuan Du and Gustavo: dyhuan123@gmail.com, gustavo@ece.utexas.edu Abstract--Although electric vehicles are attracting strengthen the potential of electric vehicle integration with the renewable energy generation and storage. We
Constrained Multi-Objective Optimization Using Steady State Genetic Algorithms
Rasheed, Khaled
evaluations in an optimization. For such problems steady state GAs may perform better than generational GAs constrained multi-objective optimization problems using steady state GAs. These methods are intended method called Objective Exchange Genetic Algorithm for Design Optimization (OEGADO) runs several GAs
Editor's Note Owing to the increasing length of algorithms accepted for publication in ACM
Hoffman, Karla
Editor's Note Owing to the increasing length of algorithms accepted for publication in ACM,D.R. A test problem generator for discrete linear LI approximation problems. ACM Trans. Math. Softw. 6, 4 (Dec part of the listing is printed here. The complete listing is available from the ACM Algorithms
Optical measurements of winds in the lower thermosphere
Wiens, R.H.; Shepherd, G.G.; Gault, W.A. (York Univ., Toronto, Ontario (Canada)); Kosteniuk, P.R. (Univ. of Saskatchewan, Saskatoon (Canada))
1988-06-01T23:59:59.000Z
WAMDII, the wide-angle Michelson Doppler imaging interferometer, was used to measure the neutral wind in the lower thermosphere by the Doppler shift of the O I 557-nm line. Observations were made at Saskatoon (60.5{degree} N invariant) around the spring equinox of 1985 with WAMDII coupled to an all-sky lens. With dopplergrams averaged over 3 to 30 min, no evidence was found for persistent highly localized winds on either of the two nights studied, one viewing only aurora and one viewing only airglow. The nocturnal variation was determined for both nights using average horizontal wind for the whole all-sky image. The pattern for the auroral case shows winds parallel to the aurora orientation in the evening but substantial crosswinds near midnight. High latitude general circulation models seem to represent this case better than local auroral generation models. The airglow case showed eastward winds in the morning sector.
Jitter-aware time-frequency resource allocation and packing algorithm
Yao, Huan
One of the main components of the next generation protected military satellite communication systems is dynamic bandwidth resource allocation (DBRA). A centralized DBRA algorithm on the satellite dynamically grants terminals ...
Control, estimation, and planning algorithms for aggressive flight using onboard sensing
Bry, Adam Parker
2012-01-01T23:59:59.000Z
This thesis is motivated by the problem of fixed-wing flight through obstacles using only on-board sensing. To that end, we propose novel algorithms in trajectory generation for fixed-wing vehicles, state estimation in ...
Numerical Simulation of a Natural Circulation Steam Generator
Weinmüller, Ewa B.
Numerical Simulation of a Natural Circulation Steam Generator W. Linzer \\Lambda , K. Ponweiser circulation steam generator. We focus on a model with a simple geometry consisting of two vertical pipes properties of water and steam. We present a numerical algorithm based on an explicit upwind discretization
An algorithmic implementation of the Pi function based on a new sieve
Damian Gulich; Gustavo Funes; Nahuel Lofeudo; Leopoldo Garavaglia; Mario Garavaglia
2008-10-07T23:59:59.000Z
In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete list of primes of absolute value greater than 3 in the interval of interest. This algorithm avoids the problem of generating large lists of numbers, and can be used to compute (even in parallel) the prime counting function $\\pi(h)$.
EIA lowers forecast for summer gasoline prices
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production% of41.1Diesel prices increase nationally TheCold FusiongasolineEIA lowers
Lower Snake River I | Open Energy Information
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: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaP a gHigh Plains Wind Farm JumpKahului, Hawaii:Lempstersource HistoryLorainLoupLow-PressureInyoLower
Distributed Algorithms for Optimal Power Flow Problem
Lam, Albert Y S; Tse, David
2011-01-01T23:59:59.000Z
Optimal power flow (OPF) is an important problem for power generation and it is in general non-convex. With the employment of renewable energy, it will be desirable if OPF can be solved very efficiently so its solution can be used in real time. With some special network structure, e.g. trees, the problem has been shown to have a zero duality gap and the convex dual problem yields the optimal solution. In this paper, we propose a primal and a dual algorithm to coordinate the smaller subproblems decomposed from the convexified OPF. We can arrange the subproblems to be solved sequentially and cumulatively in a central node or solved in parallel in distributed nodes. We test the algorithms on IEEE radial distribution test feeders, some random tree-structured networks, and the IEEE transmission system benchmarks. Simulation results show that the computation time can be improved dramatically with our algorithms over the centralized approach of solving the problem without decomposition, especially in tree-structured...
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01T23:59:59.000Z
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
Environmental analysis of Lower Pueblo/Lower Los Alamos Canyon, Los Alamos, New Mexico
Ferenbaugh, R.W.; Buhl, T.E.; Stoker, A.K.; Becker, N.M.; Rodgers, J.C.; Hansen, W.R.
1994-12-01T23:59:59.000Z
The radiological survey of the former radioactive waste treatment plant site (TA-45), Acid Canyon, Pueblo Canyon, and Los Alamos Canyon found residual contamination at the site itself and in the channel and banks of Acid, Pueblo, and lower Los Alamos Canyons all the way to the Rio Grande. The largest reservoir of residual radioactivity is in lower Pueblo Canyon, which is on DOE property. However, residual radioactivity does not exceed proposed cleanup criteria in either lower Pueblo or lower Los Alamos Canyons. The three alternatives proposed are (1) to take no action, (2) to construct a sediment trap in lower Pueblo Canyon to prevent further transport of residual radioactivity onto San Ildefonso Indian Pueblo land, and (3) to clean the residual radioactivity from the canyon system. Alternative 2, to cleanup the canyon system, is rejected as a viable alternative. Thousands of truckloads of sediment would have to be removed and disposed of, and this effort is unwarranted by the low levels of contamination present. Residual radioactivity levels, under either present conditions or projected future conditions, will not result in significant radiation doses to persons exposed. Modeling efforts show that future transport activity will not result in any residual radioactivity concentrations higher than those already existing. Thus, although construction of a sediment trap in lower Pueblo Canyon is a viable alternative, this effort also is unwarranted, and the no-action alternative is the preferred alternative.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08T23:59:59.000Z
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06T23:59:59.000Z
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
Algorithms for dynamical overlap fermions
Stefan Schaefer
2006-09-28T23:59:59.000Z
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
Hedge Algorithm and Subgradient Methods
2010-10-05T23:59:59.000Z
standard complexity results on subgradient algorithms allows us to derive optimal parameters ...... the American Statistical Association, 58:13–30, 1963. 1In fact ...
Nagurney, Anna
of Management This support is gratefully acknowledged Dmytro Matsypura Electric Power Supply Chain Networks #12 "[In recent years] the adequacy of the bulk power transmission system has been challenged to support for Electric Power Generation, Supply, Transmission, and Consumption, Proceedings of the International
Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms
Balasubramonian, Rajeev
1 Lecture 24: Parallel Algorithms I · Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) · At each clock, processors receive input output #12;4 Control at Each Processor · Each processor stores the minimum number it has seen
Energy Department Announces $9 Million to Lower Costs, Increase...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Energy Department Announces 9 Million to Lower Costs, Increase Performance of Solar Energy Systems Energy Department Announces 9 Million to Lower Costs, Increase Performance of...
The implementation of the Lower Silver Creek watershed project
Keenan, Christina; McPherson, Mariah
2003-01-01T23:59:59.000Z
Measures on Lower Silver Creek Interim Project. San Jose,Valley Water District. May 1978. Lower Silver Creek, LakeCunningham, Thompson Creek Planning Survey consisting of
Understanding and Managing Generation Y
Wallace, Kevin
2007-12-14T23:59:59.000Z
There are four generations in the workplace today; they consist of the Silent Generation, Baby Boom Generation, Generation X, and Generation Y. Generation Y, being the newest generation, is the least understood generation although marketers...
Algorithms for Supporting Compiled Communication
Yuan, Xin
Algorithms for Supporting Compiled Communication Xin Yuan Rami Melhem Rajiv Gupta Dept. We present an experimental compiler, ESUIF, that supports compiled communication for High algorithms used in ESUIF. We further demonstrate the effectiveness of compiled communication on all optical
Janis-Newman algorithm: simplifications and gauge field transformation
Harold Erbin
2015-02-16T23:59:59.000Z
The Janis-Newman algorithm is an old but very powerful tool to generate rotating solutions from static ones through a set of complex coordinate transformations. Several solutions have been derived in this way, including solutions with gauge fields. However, the transformation of the latter was so far always postulated as an ad hoc result. In this paper we propose a generalization of the procedure, extending it to the transformation of the gauge field. We also present a simplification of the algorithm due to G. Giampieri. We illustrate our prescription on the Kerr-Newman solution.
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15T23:59:59.000Z
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.
Nonlinear evolution of lower hybrid waves Charles F. F. Karney
Karney, Charles
problem. With typical fields for lower hybrid heating of a tokamak, it is found that large reflections can occur close to the edge of the plasma. I. INTRODUCTION In typical lower hybrid heating schemes, lower hy, and determine the consequences of our results for lower hybrid heating. The plan of this paper i s a s follows
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01T23:59:59.000Z
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
Ramachandran, Santosh; Anand, S V R; Hegde, Malati; Kumar, Anurag; Sundaresan, Rajesh
2011-01-01T23:59:59.000Z
We propose distributed link reversal algorithms to circumvent communication voids in geographic routing. We also solve the attendant problem of integer overflow in these algorithms. These are achieved in two steps. First, we derive partial and full link reversal algorithms that are oblivious to one-hop neighbor information, and convert a destination-disoriented DAG to a destination-oriented DAG. We embed these in the framework of Gafni and Bertsekas ("Distributed algorithms for generating loop-free routes in networks with frequently changing topology", 1981) in order to establish their termination properties. We also analyze certain key properties exhibited by our neighbor oblivious link reversal algorithms. In the second step, we resolve the integer overflow problem by analytically deriving one-bit full link reversal and two-bit partial link reversal versions of our neighbor oblivious link reversal algorithms.
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
Catalyurek, Umit; Gebremedhin, Assefaw; Halappanavar, Mahantesh; Pothen, Alex
2012-01-01T23:59:59.000Z
We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We introduce two different kinds of multithreaded heuristic algorithms for the stated, NP-hard, problem. The first algorithm relies on speculation and iteration, and is suitable for any shared-memory system. The second algorithm uses dataflow principles, and is targeted at the non-conventional, massively multithreaded Cray XMT system. We study the performance of the algorithms on the Cray XMT and two multi-core systems, Sun Niagara 2 and Intel Nehalem. Together, the three systems represent a spectrum of multithreading capabilities and memory structure. As testbed, we use synthetically generated large-scale graphs carefully chosen to cover a wide range of input types. The results show that the algorithms have scalable runtime performance and use nearly the same number of colors as...
The lower extremity dexterity test as a measure of lower extremity dynamical capability
Valero-Cuevas, Francisco
Angeles, CA 90089-9006, United States b Department of Biomedical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, United States c School of Applied Physiology the extent to which it is associated with lower extremity strength and anthropometry in healthy young adults
Cholesterol-Lowering Foods Tasty, functional foods help you lower cholesterol naturally.
. Morgan Griffin Reviewed by Brunilda Nazario, MD WebMD Feature Do you want a diet to lower cholesterol? We Harris, DrPH, RD, spokeswoman, American Dietetic Association. U.S. Food and Drug Administration web site. American Dietetic Association web site. National Heart, Lung, and Blood Institute web site. American Heart
Hsu, Christina M. L. [Department of Biomedical Engineering, Duke University, Durham, North Carolina 27708 and Carl E. Ravin Advanced Imaging Laboratories, Duke University Medical Center, Durham, North Carolina 27705 (United States); Palmeri, Mark L. [Department of Biomedical Engineering, Duke University, Durham, North Carolina 27708 (United States); Department of Anesthesiology, Duke University Medical Center, Durham, North Carolina 27710 (United States); Segars, W. Paul [Carl E. Ravin Advanced Imaging Laboratories, Duke University Medical Center, Durham, North Carolina 27705 (United States); Department of Radiology, Duke University Medical Center, Durham, North Carolina 27710 (United States); Department of Biomedical Engineering, Duke University, Durham, North Carolina 27708 (United States); Medical Physics Graduate Program, Duke University, Durham, North Carolina 27705 (United States); Veress, Alexander I. [Department of Mechanical Engineering, University of Washington, Seattle, Washington 98195 (United States); Dobbins, James T. III [Carl E. Ravin Advanced Imaging Laboratories, Duke University Medical Center, Durham, North Carolina 27705 (United States); Department of Radiology, Duke University Medical Center, Durham, North Carolina 27710 (United States); Department of Biomedical Engineering, Duke University, Durham, North Carolina 27708 (United States); Medical Physics Graduate Program, Duke University, Durham, North Carolina 27705 (United States); Department of Physics, Duke University, Durham, North Carolina 27708 (United States)
2013-04-15T23:59:59.000Z
Purpose: The authors previously reported on a three-dimensional computer-generated breast phantom, based on empirical human image data, including a realistic finite-element based compression model that was capable of simulating multimodality imaging data. The computerized breast phantoms are a hybrid of two phantom generation techniques, combining empirical breast CT (bCT) data with flexible computer graphics techniques. However, to date, these phantoms have been based on single human subjects. In this paper, the authors report on a new method to generate multiple phantoms, simulating additional subjects from the limited set of original dedicated breast CT data. The authors developed an image morphing technique to construct new phantoms by gradually transitioning between two human subject datasets, with the potential to generate hundreds of additional pseudoindependent phantoms from the limited bCT cases. The authors conducted a preliminary subjective assessment with a limited number of observers (n= 4) to illustrate how realistic the simulated images generated with the pseudoindependent phantoms appeared. Methods: Several mesh-based geometric transformations were developed to generate distorted breast datasets from the original human subject data. Segmented bCT data from two different human subjects were used as the 'base' and 'target' for morphing. Several combinations of transformations were applied to morph between the 'base' and 'target' datasets such as changing the breast shape, rotating the glandular data, and changing the distribution of the glandular tissue. Following the morphing, regions of skin and fat were assigned to the morphed dataset in order to appropriately assign mechanical properties during the compression simulation. The resulting morphed breast was compressed using a finite element algorithm and simulated mammograms were generated using techniques described previously. Sixty-two simulated mammograms, generated from morphing three human subject datasets, were used in a preliminary observer evaluation where four board certified breast radiologists with varying amounts of experience ranked the level of realism (from 1 ='fake' to 10 ='real') of the simulated images. Results: The morphing technique was able to successfully generate new and unique morphed datasets from the original human subject data. The radiologists evaluated the realism of simulated mammograms generated from the morphed and unmorphed human subject datasets and scored the realism with an average ranking of 5.87 {+-} 1.99, confirming that overall the phantom image datasets appeared more 'real' than 'fake.' Moreover, there was not a significant difference (p > 0.1) between the realism of the unmorphed datasets (6.0 {+-} 1.95) compared to the morphed datasets (5.86 {+-} 1.99). Three of the four observers had overall average rankings of 6.89 {+-} 0.89, 6.9 {+-} 1.24, 6.76 {+-} 1.22, whereas the fourth observer ranked them noticeably lower at 2.94 {+-} 0.7. Conclusions: This work presents a technique that can be used to generate a suite of realistic computerized breast phantoms from a limited number of human subjects. This suite of flexible breast phantoms can be used for multimodality imaging research to provide a known truth while concurrently producing realistic simulated imaging data.
Kinematics Algorithms for Tensegrity Structures
Burt, Steven James
2013-01-01T23:59:59.000Z
A kinematic notation for lower-pair mechanisms based onKinematic analysis of a translational 3-dof tensegrity mechanism.
Dynamic Algorithm for Space Weather Forecasting System
Fischer, Luke D.
2011-08-08T23:59:59.000Z
We propose to develop a dynamic algorithm that intelligently analyzes existing solar weather data and constructs an increasingly more accurate equation/algorithm for predicting solar weather accurately in real time. This dynamic algorithm analyzes a...
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01T23:59:59.000Z
Resolution QRS Detection Algorithm for Sparsely Sampled ECGShamlo. 2011. A disk-aware algorithm for time series motifJ. M. Kleinberg, 1997. Two algorithms for nearest-neighbor
End of semester project Global Optimization algorithms
Dreyfuss, Pierre
End of semester project Global Optimization algorithms Ecole Polytechnique de l'UniversitÃ© de Nice.......................................................................................................................................3 II. Simulated annealing algorithm (SA.........................................................................................................................................7 2.Principle,algorithm and choice of parameters
Minimally entangled typical thermal state algorithms
Stoudenmire, E. M.; White, Steven R.
2010-01-01T23:59:59.000Z
s 2 t 2 ? 1 )? 2 and the algorithm continued by defining R 3order indicated, this algorithm for multiplying MPOs scalestypical thermal state algorithms E M Stoudenmire 1 and
Sensor Networks: Distributed Algorithms Reloaded or Revolutions?
Sensor Networks: Distributed Algorithms Reloaded or Revolutions? Roger Wattenhofer Computer. This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why community, a sensor network essentially is a database. The distributed algorithms community should join
Implicit Alternative Splicing for Genetic Algorithms Philipp Rohlfshagen and John A. Bullinaria
Bullinaria, John
allowing the population's average fitness to increase from one generation to the next. In other words, GAs the selection pressure [1]. In either case, such methods must ensure that the generation of diversity does in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is repeatedly applied
Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation
GADH,RAJIT; LU,YONG; TAUTGES,TIMOTHY J.
1999-09-27T23:59:59.000Z
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning the entire geometry into meshable pieces matched with appropriate meshing algorithm the original geometry becomes meshable and may achieve better mesh quality. Each meshable portion is recognized as a meshing feature. This paper, which is a part of the feature based meshing methodology, presents the work on shape recognition and volume decomposition to automatically decompose a CAD model into meshable volumes. There are four phases in this approach: (1) Feature Determination to extinct decomposition features, (2) Cutting Surfaces Generation to form the ''tailored'' cutting surfaces, (3) Body Decomposition to get the imprinted volumes; and (4) Meshing Algorithm Assignment to match volumes decomposed with appropriate meshing algorithms. The feature determination procedure is based on the CLoop feature recognition algorithm that is extended to be more general. Results are demonstrated over several parts with complicated topology and geometry.
Generation gaps in engineering?
Kim, David J. (David Jinwoo)
2008-01-01T23:59:59.000Z
There is much enthusiastic debate on the topic of generation gaps in the workplace today; what the generational differences are, how to address the apparent challenges, and if the generations themselves are even real. ...
A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear ...
A Direct Manipulation Language for Explaining Algorithms
Scott, Jeremy
Instructors typically explain algorithms in computer science by tracing their behavior, often on blackboards, sometimes with algorithm visualizations. Using blackboards can be tedious because they do not facilitate ...
Small Generator Aggregation (Maine)
Broader source: Energy.gov [DOE]
This section establishes requirements for electricity providers to purchase electricity from small generators, with the goal of ensuring that small electricity generators (those with a nameplate...
Randomized algorithms for reliable broadcast
Vaikuntanathan, Vinod
2009-01-01T23:59:59.000Z
In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...
Bayesian inference algorithm on Raw
Luong, Alda
2004-01-01T23:59:59.000Z
This work explores the performance of Raw, a parallel hardware platform developed at MIT, running a Bayesian inference algorithm. Motivation for examining this parallel system is a growing interest in creating a self-learning ...
DOE Funds Advanced Magnet Lab and NREL to Develop Next-Generation...
in next generation drivetrains can help lower the cost and improve the reliability of wind turbines, particularly in larger offshore applications. This includes both improving...
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08T23:59:59.000Z
The paper reviews progress in imaging in radio interferometry for the period 1993-1996. Unlike an optical telescope, the basic measurements of a radio interferometer (correlations between antennas) are indirectly related to a sky brightness image. In a real sense, algorithms and computers are the lenses of a radio interferometer. In the last 20 years, whereas interferometer hardware advances have resulted in improvements of a factor of a few, algorithm and computer advances have resulted in orders of magnitude improvement in image quality. Developing these algorithms has been a fruitful and comparatively inexpensive method of improving the performance of existing telescopes, and has made some newer telescopes possible. In this paper, we review recent developments in the algorithms used in the imaging part of the reduction process. What constitutes an `imaging algorithm'? Whereas once there was a steady `forward' progression in the reduction process of editing, calibrating, transforming and, finally, deconvolving, this is no longer true. The introduction of techniques such as self-calibration, and algorithms that go directly from visibilities to final images, have made the dividing lines less clear. Although we briefly consider self-calibration, for the purposes of this paper calibration issues are generally excluded. Most attention will be directed to the steps which form final images from the calibrated visibilities.
Algorithmic construction of static perfect fluid spheres
Damien Martin; Matt Visser
2004-03-31T23:59:59.000Z
Perfect fluid spheres, both Newtonian and relativistic, have attracted considerable attention as the first step in developing realistic stellar models (or models for fluid planets). Whereas there have been some early hints on how one might find general solutions to the perfect fluid constraint in the absence of a specific equation of state, explicit and fully general solutions of the perfect fluid constraint have only very recently been developed. In this article we present a version of Lake's algorithm [Phys. Rev. D 67 (2003) 104015; gr-qc/0209104] wherein: (1) we re-cast the algorithm in terms of variables with a clear physical meaning -- the average density and the locally measured acceleration due to gravity, (2) we present explicit and fully general formulae for the mass profile and pressure profile, and (3) we present an explicit closed-form expression for the central pressure. Furthermore we can then use the formalism to easily understand the pattern of inter-relationships among many of the previously known exact solutions, and generate several new exact solutions.
Efficient discrete-time simulations of continuous-time quantum query algorithms
R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo
2008-11-26T23:59:59.000Z
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.
Supergravity, complex parameters and the Janis-Newman algorithm
Harold Erbin; Lucien Heurtier
2015-01-09T23:59:59.000Z
The Demia\\'nski-Janis-Newman algorithm is an original solution generating technique. For a long time it has been limited to producing rotating solutions, restricting to the case of a metric and real scalar fields, despite the fact that Demia\\'nski extended it to include more parameters such as a NUT charge. Recently two independent prescriptions have been given for extending the algorithm to gauge fields and thus electrically charged configurations. In this paper we aim to end setting up the algorithm by providing a missing but important piece, which is how the transformation is applied to complex scalar fields. We illustrate our proposal through several examples taken from N=2 supergravity, including the stationary BPS solutions from Behrndt et al. and Sen's axion-dilaton rotating black hole. Moreover we discuss solutions that include pairs of complex parameters, such as the mass and the NUT charge, or the electric and magnetic charges, and we explain how to perform the algorithm in this context (with the example of Kerr-Newman-Taub-NUT and dyonic Kerr-Newman black holes). The final formulation of the DJN algorithm can possibly handle solutions with five of the six Pleba\\'nski-Demia\\'nski parameters along with any type of bosonic fields with spin less than two (exemplified with the SWIP solutions). This provides all the necessary tools for applications to general matter-coupled gravity and to (gauged) supergravity.
Utility Solar Generation Valuation Methods
Hansen, Thomas N.; Dion, Phillip J.
2009-06-30T23:59:59.000Z
Tucson Electric Power (TEP) developed, tested and verified the results of a new and appropriate method for accurately evaluating the capacity credit of time variant solar generating sources and reviewed new methods to appropriately and fairly evaluate the value of solar generation to electric utilities. The project also reviewed general integrated approaches for adequately compensating owners of solar generation for their benefits to utilities. However, given the limited funding support and time duration of this project combined with the significant differences between utilities regarding rate structures, solar resource availability and coincidence of solar generation with peak load periods, it is well beyond the scope of this project to develop specific rate, rebate, and interconnection approaches to capture utility benefits for all possible utilities. The project developed computer software based evaluation method models to compare solar generation production data measured in very short term time increments called Sample Intervals over a typical utility Dispatch Cycle during an Evaluation Period against utility system load data. Ten second resolution generation production data from the SGSSS and actual one minute resolution TEP system load data for 2006 and 2007, along with data from the Pennington Street Garage 60 kW DC capacity solar unit installed in downtown Tucson will be applied to the model for testing and verification of the evaluation method. Data was provided by other utilities, but critical time periods of data were missing making results derived from that data inaccurate. The algorithms are based on previous analysis and review of specific 2005 and 2006 SGSSS production data. The model was built, tested and verified by in house TEP personnel. For this phase of the project, TEP communicated with, shared solar production data with and collaborated on the development of solar generation valuation tools with other utilities, including Arizona Public Service, Salt River Project, Xcel and Nevada Power Company as well as the Arizona electric cooperatives. In the second phase of the project, three years of 10 second power output data of the SGSSS was used to evaluate the effectiveness of frequency domain analysis, normal statistical distribution analysis and finally maximum/minimum differential output analysis to test the applicability of these mathematic methods in accurately modeling the output variations produced by clouds passing over the SGSSS array.
Searches for Fourth Generation Fermions
Ivanov, A.; /Fermilab
2011-09-01T23:59:59.000Z
We present the results from searches for fourth generation fermions performed using data samples collected by the CDF II and D0 Detectors at the Fermilab Tevatron p{bar p} collider. Many of these results represent the most stringent 95% C. L. limits on masses of new fermions to-date. A fourth chiral generation of massive fermions with the same quantum numbers as the known fermions is one of the simplest extensions of the SM with three generations. The fourth generation is predicted in a number of theories, and although historically have been considered disfavored, stands in agreement with electroweak precision data. To avoid Z {yields} {nu}{bar {nu}} constraint from LEP I a fourth generation neutrino {nu}{sub 4} must be heavy: m({nu}{sub 4}) > m{sub Z}/2, where m{sub Z} is the mass of Z boson, and to avoid LEP II bounds a fourth generation charged lepton {ell}{sub 4} must have m({ell}{sub 4}) > 101 GeV/c{sup 2}. At the same time due to sizeable radiative corrections masses of fourth generation fermions cannot be much higher the current lower bounds and masses of new heavy quarks t' and b' should be in the range of a few hundred GeV/c{sup 2}. In the four-generation model the present bounds on the Higgs are relaxed: the Higgs mass could be as large as 1 TeV/c{sup 2}. Furthermore, the CP violation is significantly enhanced to the magnitude that might account for the baryon asymmetry in the Universe. Additional chiral fermion families can also be accommodated in supersymmetric two-Higgs-doublet extensions of the SM with equivalent effect on the precision fit to the Higgs mass. Another possibility is heavy exotic quarks with vector couplings to the W boson Contributions to radiative corrections from such quarks with mass M decouple as 1/M{sup 2} and easily evade all experimental constraints. At the Tevatron p{bar p} collider 4-th generation chiral or vector-like quarks can be either produced strongly in pairs or singly via electroweak production, where the latter can be enhanced for vector-like quarks. In the following we present searches for both pair and single production of heavy quarks performed by CDF and D0 Collaborations.
Fact Sheet - Myths & Facts about the lower Snake River dams ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Myths and facts about the lower Snake River dams MYTH: The four lower Snake River dams are low value. FACT: It costs about 5 per megawatt-hour to produce power at the dams. The...
The effects of orthotics on lower extremity variability during running
Brethauer, Samuel
2011-12-31T23:59:59.000Z
Introduction: Abnormal foot mechanics may affect kinematics of the lower extremity, predisposing individuals to injury. Foot orthotics are often used to alter lower extremity mechanics. Little research is available examining ...
Energy Department Announces $25 Million to Lower Cost of Concentrating...
Office of Environmental Management (EM)
5 Million to Lower Cost of Concentrating Solar Power Energy Department Announces 25 Million to Lower Cost of Concentrating Solar Power October 1, 2014 - 2:26pm Addthis Building on...
Fact #889: September 7, 2015 Average Diesel Price Lower than...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
9: September 7, 2015 Average Diesel Price Lower than Gasoline for the First Time in Six Years Fact 889: September 7, 2015 Average Diesel Price Lower than Gasoline for the First...
Updated distribution and reintroduction of the Lower Keys marsh rabbit
Faulhaber, Craig Alan
2005-02-17T23:59:59.000Z
Listed as federally-endangered in 1990, the Lower Keys marsh rabbit (LKMR, Sylvilagus palustris hefneri) exists as a metapopulation in patches of wetland habitat in Florida?s Lower Keys. This study sought to address 2 ...
Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques
Boyer, Edmond
. En particulier plusieurs facettes et applications des algorithmes MCO, MCOP, MCOG, ... seront mises
9. Genetic Algorithms 9.1 Introduction
Cambridge, University of
66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem
Production of highly unidirectional lower-hybrid waves
McWilliams, R.; Okubo, M.; Platt, R.C.; Sheehan, D.P.
1985-01-01T23:59:59.000Z
The development of a highly unidirectional lower-hybrid wave source would improve the electron current drive efficiency in tokamaks. Lower-hybrid waves launched from a phased wave array are shown to be reflected from a grid placed in a cold, low-density plasma. The antenna--grid combination results in highly unidirectional lower-hybrid waves.
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits
Edinburgh, University of
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits Arkadev Chattopadhyay to prove the first lower bounds on general probabilistic multi-round instance compression. We show, and strengthens results of Dubrov and Ishai [DI06]. We also show that a similar lower bound holds for Majority. We
Appendix 28 Geomorphology of the Lower Flathead River
erodible materials (e.g., sedimentary plains). Typically, rivers meander like a whip or snake acrossAppendix 28 Geomorphology of the Lower Flathead River The following description of the geomorphic processes on the lower Flathead River is excerpted from Riparian Inventory of the Lower Flathead River
Generation to Generation: The Heart of Family Medicine
Winter, Robin O
2012-01-01T23:59:59.000Z
Ageism in the Workplace. Generations Spring, 5. Westman,of caring for multiple generations simultaneously. StronglyGeneration to Generation: The Heart of Family Medicine
ENERGY GENERATION RESEARCH PIER Energy Generation Research
Project: The project will employ cost-effective integrated renewable energy resources to provide onsite renewable energy production (wind and poultry bio-gas); and use onsite energy storage at electricENERGY GENERATION RESEARCH PIER Energy Generation Research www.energy.ca.gov/research/ renewable
Firestone, Richard B; Reijonen, Jani
2014-05-27T23:59:59.000Z
An embodiment of a gamma ray generator includes a neutron generator and a moderator. The moderator is coupled to the neutron generator. The moderator includes a neutron capture material. In operation, the neutron generator produces neutrons and the neutron capture material captures at least some of the neutrons to produces gamma rays. An application of the gamma ray generator is as a source of gamma rays for calibration of gamma ray detectors.
Papalaskari, Mary-Angela
CSC 8301 Design and Analysis of Algorithms Lecture 1 CSC 8301CSC 8301-- Design and Analysis of AlgorithmsDesign and Analysis of Algorithms Lecture 1Lecture 1 Algorithms: OverviewAlgorithms: Overview Next time: Principles of the analysis of algorithms (2.1, 2.2) Design and Analysis of Algorithms
Optimal Placement and Sizing of Distributed Generator Units using Genetic Optimization
-scale production units (e.g. fuel cells, micro-CHPs, photovoltaic panels) and the liberalization of the energyOptimal Placement and Sizing of Distributed Generator Units using Genetic Optimization Algorithms describe how genetic optimization algorithms can be used to find the optimal size and location
Efficient Double-Precision Cosine Generation Derek Nowrouzezahrai Brian Decker William Bishop
Toronto, University of
Efficient Double-Precision Cosine Generation Derek Nowrouzezahrai Brian Decker William Bishop the CORDIC algorithm and its many variants for double-precision floating point cal- culations. A hardware on the CORDIC algorithm offer single-precision results. This paper proposes an imple- mentation of a double
Lifetime Prediction of IGBT in a STATCOM Using Modified-Graphical Rainflow Counting Algorithm
Gopi Reddy, Lakshmi Reddy [ORNL; Tolbert, Leon M [ORNL; Ozpineci, Burak [ORNL
2012-01-01T23:59:59.000Z
Rainflow algorithms are one of the best counting methods used in fatigue and failure analysis [17]. There have been many approaches to the rainflow algorithm, some proposing modifications. Graphical Rainflow Method (GRM) was proposed recently with a claim of faster execution times [10]. However, the steps of the graphical method of rainflow algorithm, when implemented, do not generate the same output as the four-point or ASTM standard algorithm. A modified graphical method is presented and discussed in this paper to overcome the shortcomings of graphical rainflow algorithm. A fast rainflow algorithm based on four-point algorithm but considering point comparison than range comparison is also presented. A comparison between the performances of the common rainflow algorithms [6-10], including the proposed methods, in terms of execution time, memory used, and efficiency, complexity, and load sequences is presented. Finally, the rainflow algorithm is applied to temperature data of an IGBT in assessing the lifetime of a STATCOM operating for power factor correction of the load. From 5-minute data load profiles available, the lifetime is estimated to be at 3.4 years.
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 2002 spring out-migration at migrant traps on the Snake River and Salmon River. In 2002 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 11.4 times greater in 2002 than in 2001. The wild Chinook catch was 15.5 times greater than the previous year. Hatchery steelhead trout catch was 2.9 times greater than in 2001. Wild steelhead trout catch was 2.8 times greater than the previous year. The Snake River trap collected 3,996 age-0 Chinook salmon of unknown rearing. During 2002, the Snake River trap captured 69 hatchery and 235 wild/natural sockeye salmon and 114 hatchery coho salmon O. kisutch. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant increase in catch in 2002 was due to a 3.1 fold increase in hatchery Chinook production and a more normal spring runoff. Trap operations began on March 10 and were terminated on June 7. The trap was out of operation for a total of four days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 4.2 times greater and wild Chinook salmon catch was 2.4 times greater than in 2001. The hatchery steelhead trout collection in 2002 was 81% of the 2001 numbers. Wild steelhead trout collection in 2002 was 81% of the previous year's catch. Trap operations began on March 10 and were terminated on May 29 due to high flows. The trap was out of operation for four days due to high flow or debris. The increase in hatchery Chinook catch in 2002 was due to a 3.1 fold increase in hatchery production and differences in flow between years. Changes in hatchery and wild steelhead catch are probably due to differences in flow between years. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2002 data detected a relation between migration rate and discharge for hatchery and wild Chinook salmon. For hatchery and wild Chinook salmon there was a 4.7-fold and a 3.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.8-fold and a 1.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2002 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for wild Chinook salmon and hatchery steelhead trout. The analysis was unable to detect a relation between migration rate and discharge for hatchery Chinook salmon. The lack of a detectable relation was probably a result of the migration rate data being spread over a very narrow range of discharge. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 4.3-fold for wild Chinook salmon and 2.2-fold for hatchery steelhead between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River trap were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at
INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592. Theorem 5.1.2A, 26. Theorem{54. Theorem 5.1.4C, 55. Algorithm 5.1.4D, 50. Theorem 5.1.4D, 57. Algorithm 5.1.4G, 69. Algorithm 5.1.4H, 612. Theorem 5.1.4H, 60. Algorithm 5.1.4I, 49{50. Algorithm 5.1.4P, 70. Algorithm 5.1.4Q, 614. Algorithm 5.1.4S
INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4. Algorithm 1.1F, 466. Algorithm 1.2.1E, 13{14. Algorithm 1.2.1I, 11{12. Algorithm 1.2.2E, 470. Algorithm 1.2.2L, 26. Law 1.2.4A, 40. Law, 81{82. Theorem 1.2.10A, 101. Algorithm 1.2.10M, 96. Theorem 1.2.11.3A, 119. Algorithm 1.3.2E, 160
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
and California algorithm #8 using Fuzzy Logic to evaluate the new algorithm's effectiveness in detecting incidents on freeways. To test these algorithms, real data from TransGuide were run through the algorithms. Algorithm output were compared with CCTV (closed...
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent on
Santhanam, Balu
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent. Stability and convergence time issues of concern for ill- conditioned inputs. Leaky LMS AlgorithmLeaky LMS cost. Block LMS AlgorithmBlock LMS Algorithm Uses type-I polyphase components of the input u[n]: Block
Leung, Ka-Ngo (Hercules, CA)
2009-12-29T23:59:59.000Z
A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.
Leung, Ka-Ngo (Hercules, CA)
2008-04-22T23:59:59.000Z
A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.
Leung, Ka-Ngo
2005-06-14T23:59:59.000Z
A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04T23:59:59.000Z
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Optimisation of Quantum Evolution Algorithms
Patel, Apoorva
2015-01-01T23:59:59.000Z
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Five Quantum Algorithms Using Quipper
Safat Siddiqui; Mohammed Jahirul Islam; Omar Shehab
2014-06-18T23:59:59.000Z
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \\ensuremath{4 \\times 4} matrix constructors for Unitary operators, we have also implemented \\ensuremath{8 \\times 8} and \\ensuremath{16 \\times 16} matrix constructors.
Secret-key generation with correlated sources and noisy channels
Khisti, Ashish
Secret-key generation with correlated sources and noisy channels Ashish Khisti EECS Dept. MIT for secret-key generation between remote terminals is considered. The sender communicates to the receiver discrete memoryless sources. Lower and upper bounds for the secret-key rate are presented and shown
Secret-Key Generation using Correlated Sources and Channels
Khisti, Ashish
1 Secret-Key Generation using Correlated Sources and Channels Ashish Khisti, Member, IEEE of generating a shared secret key between two terminals in a joint source-channel setup -- the terminals to correlated discrete memoryless source sequences. We establish lower and upper bounds on the secret
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05T23:59:59.000Z
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a quantum computer can induce quantum chaos and put into question the operability of a quantum computer. In this work I investigate whether already the interactions between the qubits introduced with the intention to operate the quantum computer may lead to quantum chaos. The analysis focuses on two well--known quantum algorithms, namely Grover's search algorithm and the quantum Fourier transform. I show that in both cases the same very unusual combination of signatures from chaotic and from integrable dynamics arises.
HU TA
2007-10-26T23:59:59.000Z
Assess the steady-state flammability level at normal and off-normal ventilation conditions. The methodology of flammability analysis for Hanford tank waste is developed. The hydrogen generation rate model was applied to calculate the gas generation rate for 177 tanks. Flammability concentrations and the time to reach 25% and 100% of the lower flammability limit, and the minimum ventilation rate to keep from 100 of the LFL are calculated for 177 tanks at various scenarios.
A genetic algorithm based method for docking flexible molecules
Judson, R.S. [Sandia National Labs., Livermore, CA (United States); Jaeger, E.P.; Treasurywala, A.M. [Sterling-Winthrop Inc., Collegeville, PA (United States)
1993-11-01T23:59:59.000Z
The authors describe a computational method for docking flexible molecules into protein binding sites. The method uses a genetic algorithm (GA) to search the combined conformation/orientation space of the molecule to find low energy conformation. Several techniques are described that increase the efficiency of the basic search method. These include the use of several interacting GA subpopulations or niches; the use of a growing algorithm that initially docks only a small part of the molecule; and the use of gradient minimization during the search. To illustrate the method, they dock Cbz-GlyP-Leu-Leu (ZGLL) into thermolysin. This system was chosen because a well refined crystal structure is available and because another docking method had previously been tested on this system. Their method is able to find conformations that lie physically close to and in some cases lower in energy than the crystal conformation in reasonable periods of time on readily available hardware.
Mercier, Matthieu J.
We present the results of a combined experimental and numerical study of the generation of internal waves using the novel internal wave generator design of Gostiaux et al. (Exp. Fluids, vol. 42, 2007, pp. 123–130). This ...
Development and application of an advanced switched reluctance generator drive
Asadi, Peyman
2009-05-15T23:59:59.000Z
will not generate the maximum output power. Therefore, a self-tuning algorithm, based on a local search method, is proposed and experimentally tested. It works effectively and does not need extra hardware or rigorous calculations. The attempts to benefit from...
On automated prepared statement generation to remove SQL injection vulnerabilities
Xie, Tao
On automated prepared statement generation to remove SQL injection vulnerabilities Stephen Thomas in revised form 5 August 2008 Accepted 8 August 2008 Available online 27 September 2008 Keywords: SQL vulnerabilities were SQL injection vulnerabilities (SQLIVs). This paper presents an algorithm of prepared
A new maintenance friendly concept for bulb type generators
Scheidl, W.
1998-07-01T23:59:59.000Z
Bulb type generators in the rating range up to 15 MW are in a severe competition with geared up machines which operate at much higher speed and are therefore smaller and cheaper. Up to now the conventional bulb type generator in the standard design as it is used on several rivers in Austria and many other countries was not so economic in the lower rating range. A new and maintenance friendly concept for the bulb type generator design especially for these lower rating range ended in a more economic solution and is now able to compete with the geared up machines.
A Fourth Chiral Generation And Susy Breaking
Akin Wingerter
2011-05-30T23:59:59.000Z
We revisit four generations within the context of supersymmetry. We compute the perturbativity limits for the fourth generation Yukawa couplings and show that if the masses of the fourth generation lie within reasonable limits of their present experimental lower bounds, it is possible to have perturbativity only up to scales around 1000 TeV, i.e. the current experimental bounds and perturbative unification are mutually exclusive. Such low scales are ideally suited to incorporate gauge mediated supersymmetry breaking, where the mediation scale can be as low as 10-20 TeV. The minimal messenger model, however, is highly constrained. Lack of electroweak symmetry breaking rules out a large part of the parameter space, and in the remaining part, the fourth generation stau is tachyonic.
Stuart, Steven J.
The Clemson First Generation Success Program A First-RAte expeRience College is an experience college. First-generation college students are students whose parents do not hold a degree from a four-year college or university. Clemson is proud of its first- generation students and is committed
Superconducting Power Generation
Mario Rabinowitz
2003-02-20T23:59:59.000Z
The superconducting ac generator has the greatest potential for large-scale commercial application of superconductivity that can benefit the public. Electric power is a vital ingredient of modern society, and generation may be considered to be the vital ingredient of a power system. This articles gives background, and an insight into the physics and engineering of superconducting power generation.
R. Guerraoui 1 Distributed algorithms
Guerraoui, Rachid
and then algorithms 7 Best-effort broadcast (beb) Events Request: bebBroadcast, m> Indication: bebDeliver, src, m> Â· Properties: BEB1, BEB2, BEB3 8 Best-effort broadcast (beb) Properties BEB1. Validity: If pi and pj are correct, then every message broadcast by pi is eventually delivered by pj BEB2. No duplication: No message
Adaptive protection algorithm and system
Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA
2009-04-28T23:59:59.000Z
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Algorithmic Aspects of Risk Management
Gehani, Ashish
Algorithmic Aspects of Risk Management Ashish Gehani1 , Lee Zaniewski2 , and K. Subramani2 1 SRI International 2 West Virginia University Abstract. Risk analysis has been used to manage the security of sys configuration. This allows risk management to occur in real time and reduces the window of exposure to attack
Machine Learning: Foundations and Algorithms
Ben-David, Shai
with accident prevention systems that are built using machine learning algorithms. Machine learning is also to us). Machine learning tools are concerned with endowing programs with the ability to "learn if the learning process succeeded or failed? The second goal of this book is to present several key machine
Algorithmic + Geometric characterization of CAR
Gill, Richard D.
Algorithmic + Geometric characterization of CAR (Coarsening at Random) Richard Gill - Utrecht but independent) CCAR 3 door problem X=door with car behind Y=two doors still closed = {your first choice, other door left closed} 3 door problem X=door with car behind Y=(your first choice, other door left closed
GEET DUGGAL Algorithms for Determining
Relationship to Gene Regulation Final Public Oral Examination Doctor of Philosophy Recent genome sequencing. Analyses from them have shown that the 3D structure of DNA may be closely linked to genome functions structure of DNA and genome function on the scale of the whole genome. Specifically, we designed algorithms
Hierarchical Correctness Proofs Distributed Algorithms
Tuttle, Mark R.
distributed networks. With this model we are able to construct modular, hierarchical correct- ness proofs these messages and process variables can be extremely di cult, and the resulting proofs of correct- ness of the full algorithm's correct- ness. Some time ago, we began to consider this approach of proof by re nement
Algorithmic Thermodynamics John C. Baez
Tomkins, Andrew
Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + Âµd
Lower Valley Energy- Residential Energy Efficiency Rebate Program
Broader source: Energy.gov [DOE]
Lower Valley Energy offers numerous rebates for residential customers who wish to increase the energy efficiency of eligible homes. Rebates are available for weatherization measures, water heaters,...
Energy Department Announces $3 Million to Lower Cost of Geothermal...
Broader source: Energy.gov (indexed) [DOE]
and development projects to advance technologies that could lower the cost of geothermal energy production while diversifying and stabilizing the supply of critical materials for...
Lowering Drilling Cost, Improving Operational Safety, and Reducing
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
in the Marcellus Shale." DEA Technology Forum. Houston, TX: DEA, 2013. -. "Lowering Drilling Cost, Improving Operational Safety, and Reducing Environmental Impact through...
Innovative, Lower Cost Sensors and Controls Yield Better Energy...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Yield Better Energy Efficiency Innovative, Lower Cost Sensors and Controls Yield Better Energy Efficiency March 23, 2015 - 1:05pm Addthis ORNL researchers are experimenting with...
Hickam, Christopher Dale (Glasford, IL)
2008-05-13T23:59:59.000Z
A motor/generator is provided for connecting between a transmission input shaft and an output shaft of a prime mover. The motor/generator may include a motor/generator housing, a stator mounted to the motor/generator housing, a rotor mounted at least partially within the motor/generator housing and rotatable about a rotor rotation axis, and a transmission-shaft coupler drivingly coupled to the rotor. The transmission-shaft coupler may include a clamp, which may include a base attached to the rotor and a plurality of adjustable jaws.
EELS (ANGUILLA ANGUILLA (L.)) OF THE LOWER RIVER SHANNON, WITH
McCarthy, T.K.
flow of 10m3 sec(1 as a result of the construction of the Ardnacrusha hydroelectric generating station
Incorporating Wind Generation in Cap and Trade Programs
Bluestein, J.; Salerno, E.; Bird, L.; Vimmerstedt, L.
2006-07-01T23:59:59.000Z
Cap and trade programs are increasingly being used to reduce emissions from electricity generation in the United States. Cap and trade programs primarily target emitting generators, but programs have also included renewable generators, such as wind generators. States cite several reasons why they have considered the policy option of including renewable generators in cap and trade programs: to provide an incentive for lower-emitting generation, to achieve emissions reductions in non-capped pollutants, and to gain local economic benefits associated with renewable energy projects. The U.S. Environmental Protection Agency also notes these rationales for considering this policy alternative, and the National Association of Regulatory Commissioners (NARUC) passed a resolution supporting the inclusion of renewable energy in cap and trade programs. This report explores why states consider this policy option, what participation could mean for wind generators, and how wind generation can most effectively be included in state, federal, and regional cap and trade programs.
Discharge cell for ozone generator
Nakatsuka, Suguru (Amagasaki, JP)
2000-01-01T23:59:59.000Z
A discharge cell for use in an ozone generator is provided which can suppress a time-related reduction in ozone concentration without adding a catalytic gas such as nitrogen gas to oxygen gas as a raw material gas. The discharge cell includes a pair of electrodes disposed in an opposed spaced relation with a discharge space therebetween, and a dielectric layer of a three-layer structure consisting of three ceramic dielectric layers successively stacked on at least one of the electrodes, wherein a first dielectric layer of the dielectric layer contacting the one electrode contains no titanium dioxide, wherein a second dielectric layer of the dielectric layer exposed to the discharge space contains titanium dioxide in a metal element ratio of not lower than 10 wt %.
Learning Motor Skills: From Algorithms to Robot
Learning Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu Roboter-Experimenten Zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01T23:59:59.000Z
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...
Constant time algorithms in sparse graph model
Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology
2010-01-01T23:59:59.000Z
We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...
A distributed K-mutual exclusion algorithm
Bulgannawar, Shailaja Gurupad
1994-01-01T23:59:59.000Z
This thesis presents a new token-based K-mutual exclusion algorithm for distributed systems. The proposed algorithm uses K tokens to achieve K-mutual exclusion. The system of N nodes is organized as a logical forest, with ...
On Learning Algorithms for Nash Equilibria
Daskalakis, Constantinos
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising games, and thus results on the convergence or ...
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01T23:59:59.000Z
2.2 Graph Search Algorithms . . . . . . . . . . . . .an Efficient Algorithm . . . . . . 4.6.4 RestrictionAn O(r)-Approximation Algorithm for GTSPP . . . . . . . .
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek; Hurand, Mathilde; Sgall, Ji?í
2009-01-01T23:59:59.000Z
5th European symposium on algorithms (ESA) (pp. 296–307).· Real-time systems · Algorithms 1 Introduction Ghosh etfault-tolerance testing algorithm, under the restriction
Algorithms for tandem mass spectrometry-based proteomics
Frank, Ari Michael
2008-01-01T23:59:59.000Z
4. MS-Clustering Algorithm . . . . . . . . . . C.De Novo Sequencing Algorithm . . . . . . C. Experimental2. The RankBoost Algorithm (Freund et al. , 2003) B.
Approximation Algorithms for the Fault-Tolerant Facility Placement Problem
Yan, Li
2013-01-01T23:59:59.000Z
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
Pulse tube coolers for Meteosat third generation
Butterworth, James; Aigouy, Gérald; Chassaing, Clement; Debray, Benoît; Huguet, Alexandre [Air Liquide Advanced Technologies, 2 Rue de Clémencière, F-38600 Sassenage (France)
2014-01-29T23:59:59.000Z
Air Liquide's Large Pulse Tube Coolers (LPTC) will be used to cool the focal planes of the Infrared Sounder (IRS) and Flexible Combined Imager (FCI) instruments aboard the ESA/Eumetsat satellites Meteosat Third Generation (MTG). This cooler consists of an opposed piston linear compressor driving a pulse tube cold head and the associated drive electronics including temperature regulation and vibration cancellation algorithms. Preparations for flight qualification of the cooler are now underway. In this paper we present results of the optimization and qualification activities as well as an update on endurance testing.
MAX-PLANCK-INSTITUT.. ( Lower Bounds for Set Intersection
. Mehlhorn R. Raman C. Uhrig MPI- I-92-127 October 1992 o mPD_ _ _ _ _ _ _ IN F 0 R M AT I K _ _ _ _ __ Im Stadtwald 66123 Saarbrücken Germany #12;Lower Bounds for Set Intersection Queries P. Dietz K. Mehlhorn R. Raman C. Uhrig MPI-I-92-127 October 1992 #12;Lower Bounds for Set Intersection Queries PAUL DIETZ KURT
NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN
Waste Management Zone" (AMZ) as defined in the "Agricultural Inventory of the Lower Fraser Valley Data the data base (acquired from the B.C. Assessment Authority in 1993) in the Ministry of Health report#12;NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN DOE FRAP 1997-25 Prepared for
First satellite observations of lower tropospheric ammonia and methanol
First satellite observations of lower tropospheric ammonia and methanol Reinhard Beer,1 Mark W) and methanol (CH3OH), well above the normal background levels. This is the first time that these molecules have. Citation: Beer, R., et al. (2008), First satellite observations of lower tropospheric ammonia and methanol
Optimization Online - Efficient parallel coordinate descent algorithm ...
Ion Necoara
2012-11-02T23:59:59.000Z
Nov 2, 2012 ... Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC.
Optimization Online - Efficient Algorithmic Techniques for Several ...
Mugurel Ionut Andreica
2008-10-23T23:59:59.000Z
Oct 23, 2008 ... Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems. Mugurel Ionut ...
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09T23:59:59.000Z
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09T23:59:59.000Z
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
An algorithm for discovering Lagrangians automatically from data
Hills, D J A; Hudson, J J
2015-01-01T23:59:59.000Z
An activity fundamental to science is building mathematical models. These models are used to both predict the results of future experiments and gain insight into the structure of the system under study. We present an algorithm that automates the model building process in a scientifically principled way. The algorithm can take observed trajectories from a wide variety of mechanical systems and, without any other prior knowledge or tuning of parameters, predict the future evolution of the system. It does this by applying the principle of least action and searching for the simplest Lagrangian that describes the system's behaviour. By generating this Lagrangian in a human interpretable form, it also provides insight into the working of the system.
Generalized URV Subspace Tracking LMS Algorithm 1
Boley, Daniel
Generalized URV Subspace Tracking LMS Algorithm 1 S. Hosur and A. H. Tew k and D. Boley Dept The convergence rate of the Least Mean Squares (LMS) algorithm is poor whenever the adaptive lter input auto-correlation matrix is ill-conditioned. In this paper we propose a new LMS algorithm to alleviate this problem
Total Algorithms \\Lambda Gerard Tel y
Utrecht, Universiteit
Total Algorithms \\Lambda Gerard Tel y Department of Computer Science, University of Utrecht, P and February 1993 Abstract We define the notion of total algorithms for networks of processes. A total algorithm enforces that a ``decision'' is taken by a subset of the processes, and that participation of all
Distributed QR Factorization Based on Randomized Algorithms
Zemen, Thomas
Distributed QR Factorization Based on Randomized Algorithms Hana Strakov´a1 , Wilfried N. Gansterer of Algorithms Hana.Strakova@univie.ac.at, Wilfried.Gansterer@univie.ac.at 2 Forschungszentrum Telekommunication Wien, Austria Thomas.Zemen@ftw.at Abstract. Most parallel algorithms for matrix computations assume
Finding Algorithms in Scientific Articles Sumit Bhatia
Giles, C. Lee
Finding Algorithms in Scientific Articles Sumit Bhatia , Prasenjit Mitra and C. Lee Giles,giles}@ist.psu.edu ABSTRACT Algorithms are an integral part of computer science literature. How- ever, none of the current search engines offer specialized algorithm search facility. We describe a vertical search engine
Algorithms in pure mathematics G. Stroth
Stroth, Gernot
Algorithms in pure mathematics G. Stroth 1 Introduction In this article, we will discuss algorithmic group theory from the point of view of pure, and where one might be surprised that there is no algorithmic solution. The two most developed areas
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
A DISTRIBUTED POWER CONTROL ALGORITHM FOR
Mitra, Debasis
A DISTRIBUTED POWER CONTROL ALGORITHM FOR BURSTY TRANSMISSIONS ON CELLULAR, SPREAD SPECTRUM, USA ABSTRACT We propose a distributed algorithm for power control in cellular, wideband networks, although its parameters are different from data. We propose a distributed algorithm for power control
university-logo Intro Algorithm Results Concl.
Aarts, Gert
university-logo Intro Algorithm Results Concl. Strong coupling lattice QCD at finite temperature Ph. de Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. QCD Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. Motivation (1
Equivalence of Learning Algorithms Julien Audiffren1
Equivalence of Learning Algorithms Julien Audiffren1 and Hachem Kadri2 1 CMLA, ENS Cachan is to introduce a concept of equivalence between machine learn- ing algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01T23:59:59.000Z
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close proximity in the phase space to each other. We show the performance of our algorithm in the case of magnetic shower.
The Observer Algorithm for Visibility Approximation
Doherty, Patrick
, with dif- ferent view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm or more sentries while moving to a goal position. Algorithms for finding a covert paths in the presence of stationary and moving sentries has been devised by [5] [6]. An approximate visibility algorithm was devised
Study of Proposed Internet Congestion Control Algorithms*
Study of Proposed Internet Congestion Control Algorithms* Kevin L. Mills, NIST (joint work with D Y Algorithms Mills et al. Innovations in Measurement Science More information @ http;Study of Proposed Internet Congestion Control Algorithms Mills et al. OutlineOutline Technical
Partitioned algorithms for maximum likelihood and
Smyth, Gordon K.
Partitioned algorithms for maximum likelihood and other nonlinear estimation Gordon K. Smyth There are a variety of methods in the literature which seek to make iterative estimation algorithms more manageable by breaking the iterations into a greater number of simpler or faster steps. Those algorithms which deal
Algorithms and Theory of Computation Handbook, Second
Algorithms and Theory of Computation Handbook, Second Edition CRC PRESS Boca Raton Ann Arbor London Parameterized Algorithms 1 Rodney G. Downey and Catherine McCartin School of Mathematical and Computing Sciences.2 The Main Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Practical FPT Algorithms
Minimum-Flip Supertrees: Complexity and Algorithms
Sanderson, Michael J.
Minimum-Flip Supertrees: Complexity and Algorithms Duhong Chen, Oliver Eulenstein, David Ferna that it is fixed-parameter tractable and give approximation algorithms for special cases. Index Terms assembled from all species in the study. Because the conventional algorithms to solve these problems
Tuning bandit algorithms in stochastic environments
Szepesvari, Csaba
Tuning bandit algorithms in stochastic environments Jean-Yves Audibert1 and R´emi Munos2 and Csaba@cs.ualberta.ca Abstract. Algorithms based on upper-confidence bounds for balancing exploration and exploitation a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account
A Genetic Algorithm Approach for Technology Characterization
Galvan, Edgar
2012-10-19T23:59:59.000Z
A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY CHARACTERIZATION A Thesis by EDGAR GALVAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE August 2012 Major Subject: Mechanical Engineering A Genetic Algorithm Approach for Technology Characterization Copyright 2012 Edgar Galvan A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY...
Algorithmic proof of Barnette's Conjecture
I. Cahit
2009-04-22T23:59:59.000Z
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the operation of opening disjoint chambers, bu using spiral-chain like movement of the outer-cycle elastic-sticky edges of the cubic planar graph. In fact we have shown that in hamiltonicity of Barnette graph a single-chamber or double-chamber with a bridge face is enough to transform the problem into finding specific hamiltonian path in the cubic bipartite graph reduced. In the last part of the paper we have demonstrated that, if the given cubic planar graph is non-hamiltonian then the algorithm which constructs spiral-chain (or double-spiral chain) like chamber shows that except one vertex there exists (n-1)-vertex cycle.
Barnette, Daniel W. (Veguita, NM)
2002-01-01T23:59:59.000Z
The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.
Steam generator support system
Moldenhauer, James E. (Simi Valley, CA)
1987-01-01T23:59:59.000Z
A support system for connection to an outer surface of a J-shaped steam generator for use with a nuclear reactor or other liquid metal cooled power source. The J-shaped steam generator is mounted with the bent portion at the bottom. An arrangement of elongated rod members provides both horizontal and vertical support for the steam generator. The rod members are interconnected to the steam generator assembly and a support structure in a manner which provides for thermal distortion of the steam generator without the transfer of bending moments to the support structure and in a like manner substantially minimizes forces being transferred between the support structure and the steam generator as a result of seismic disturbances.
Steam generator support system
Moldenhauer, J.E.
1987-08-25T23:59:59.000Z
A support system for connection to an outer surface of a J-shaped steam generator for use with a nuclear reactor or other liquid metal cooled power source is disclosed. The J-shaped steam generator is mounted with the bent portion at the bottom. An arrangement of elongated rod members provides both horizontal and vertical support for the steam generator. The rod members are interconnected to the steam generator assembly and a support structure in a manner which provides for thermal distortion of the steam generator without the transfer of bending moments to the support structure and in a like manner substantially minimizes forces being transferred between the support structure and the steam generator as a result of seismic disturbances. 4 figs.
Santhanam, Balu
LMS Algorithm: MotivationLMS Algorithm: Motivation Only a single realization of observations : delay in tap-weight adjustment. Simplicity: real-time applications possible. LMS AlgorithmLMS Algorithm Use instantaneous estimates for statistics: Filter output: Estimation error: Tap-weight update: LMS
Logo-like Learning of Basic Concepts of Algorithms -Having Fun with Algorithms
Logo-like Learning of Basic Concepts of Algorithms - Having Fun with Algorithms Gerald Futschek are not primarily interested in programming the way of learning is highly influenced by the Logo style of learning to design efficient algorithms. Keywords Logo-like learning, algorithms, group learning 1 2 3 4 5 n ... 1
On the relation between the MXL family of algorithms and Grobner basis algorithms
International Association for Cryptologic Research (IACR)
On the relation between the MXL family of algorithms and Gr¨obner basis algorithms Martin R Solving (PoSSo) problem. The most efficient known algorithms reduce the Gr¨obner basis computation", on which a new family of algorithms is based (MXL, MXL2 and MXL3). By studying and de- scribing
Improved algorithms for reaction path following: Higher-order implicit algorithms
Schlegel, H. Bernhard
Improved algorithms for reaction path following: Higher-order implicit algorithms Carlos Gonzaleza (Received 13May 1991;accepted17June 1991) Eight new algorithms for reaction path following are presented or if accurate propertiessuch ascurvature and frequenciesare needed.3*4 Numerous algorithms exist for following
Energy Science and Technology Software Center (OSTI)
003027MLTPL00 Network Traffic Generator for Low-rate Small Network Equipment Software http://eln.lbl.gov/sne_traffic_gen.html
Renewable Electricity Generation
None
2012-09-01T23:59:59.000Z
This document highlights DOE's Office of Energy Efficiency and Renewable Energy's advancements in renewable electricity generation technologies including solar, water, wind, and geothermal.
Fourth Generation Majorana Neutrinos
Alexander Lenz; Heinrich Päs; Dario Schalla
2012-05-02T23:59:59.000Z
We investigate the possibility of a fourth sequential generation in the lepton sector. Assuming neutrinos to be Majorana particles and starting from a recent - albeit weak - evidence for a non-zero admixture of a fourth generation neutrino from fits to weak lepton and meson decays we discuss constraints from neutrinoless double beta decay, radiative lepton decay and like-sign dilepton production at hadron colliders. Also an idea for fourth generation neutrino mass model building is briefly outlined. Here we soften the large hierarchy of the neutrino masses within an extradimensional model that locates each generation on different lepton number violating branes without large hierarchies.
Broader source: Energy.gov [DOE]
The amount of electricity generated by the wind industry started to grow back around 1999, and since 2007 has been increasing at a rapid pace.
Hydrogen Generation for Refineries
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Single Cycle Shown for ATB SteamCarbon 3 * ATB reforming * Steamcarbon 3 * Syngas generated during reforming * 70% H 2 * 20% CO * Syngas composition agrees with...
Improved method for calculating the radiation heat generation in the BOR-60 reactor
Varivtsev, A. V., E-mail: vav3@niiar.ru; Zhemkov, I. Yu. [JSC “SSC RIAR,” Dimitrovgrad-10 (Russian Federation)
2014-12-15T23:59:59.000Z
The results of theoretical and experimental studies aimed at determining the radiation heat generation in the BOR-60 reactor reveal the drawbacks of the computational methods used at present. An algorithm that is free from these drawbacks and allows one to determine the radiation heat generation computationally is proposed.
Non-Stationary Spectral Estimation for Wind Turbine Induction Generator Faults Detection
Paris-Sud XI, Université de
- or indirect-drive, fixed- or variable-speed turbine generators, advanced signal processing tools are required on the generator stator current. The detection algorithm uses a recursive maximum likelihood estimator to track, induction machine, faults de- tection, stator current, spectral estimation, maximum likelihood estimator. I
Simple Extractors for All MinEntropies and a New Pseudorandom Generator #
Shaltiel, Ronen
from a distribution with sufficiently high minentropy and a short random seed produces an output generator'' is an algorithm that given a short random seed produces a long output that is computationallySimple Extractors for All MinEntropies and a New Pseudorandom Generator # Ronen Shaltiel
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23TribalInformation Access toTen Problems in ExperimentalUnitarityOrganic lightCap plasticity 'ORNL
Distributed Approaches for Determination of Reconfiguration Algorithm Termination
Lai, Hong-jian
Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard
NEXT GENERATION TURBINE SYSTEM STUDY
Frank Macri
2002-02-28T23:59:59.000Z
Rolls-Royce has completed a preliminary design and marketing study under a Department of Energy (DOE) cost shared contract (DE-AC26-00NT40852) to analyze the feasibility of developing a clean, high efficiency, and flexible Next Generation Turbine (NGT) system to meet the power generation market needs of the year 2007 and beyond. Rolls-Royce evaluated the full range of its most advanced commercial aerospace and aeroderivative engines alongside the special technologies necessary to achieve the aggressive efficiency, performance, emissions, economic, and flexibility targets desired by the DOE. Heavy emphasis was placed on evaluating the technical risks and the economic viability of various concept and technology options available. This was necessary to ensure the resulting advanced NGT system would provide extensive public benefits and significant customer benefits without introducing unacceptable levels of technical and operational risk that would impair the market acceptance of the resulting product. Two advanced cycle configurations were identified as offering significant advantages over current combined cycle products available in the market. In addition, balance of plant (BOP) technologies, as well as capabilities to improve the reliability, availability, and maintainability (RAM) of industrial gas turbine engines, have been identified. A customer focused survey and economic analysis of a proposed Rolls-Royce NGT product configuration was also accomplished as a part of this research study. The proposed Rolls-Royce NGT solution could offer customers clean, flexible power generation systems with very high efficiencies, similar to combined cycle plants, but at a much lower specific cost, similar to those of simple cycle plants.
Current Legal and Institutional Frameworks for Investing in Lower Carbon Electricity in China
Lang, X; Reiner, David; Neuhoff, Karsten
for ultra-supercritical (USC) coal units, CHP, and biomass power , since they enjoy the advantages of higher efficiency or lower fossil fuel consumption. The policy may also encourage retrofitting oil-fired power plants to natural gas which would emit... about 50% less carbon dioxide compared to oil. Policy on ‘Utilising coal bed methane (CBM) to generate electricity’ Coal bed methane is a form of natural gas found in coal seams, but one that, to date, has been underdeveloped in China. In 2005...
Market Designs for High Levels of Variable Generation: Preprint
Milligan, M.; Holttinen, H.; Kiviluoma, J.; Orths, A.; Lynch, M.; Soder, L.
2014-10-01T23:59:59.000Z
Variable renewable generation is increasing in penetration in modern power systems, leading to higher variability in the supply and price of electricity as well as lower average spot prices. This raises new challenges, particularly in ensuring sufficient capacity and flexibility from conventional technologies. Because the fixed costs and lifetimes of electricity generation investments are significant, designing markets and regulations that ensure the efficient integration of renewable generation is a significant challenge. This papers reviews the state of play of market designs for high levels of variable generation in the United States and Europe and considers new developments in both regions.
Prescott, D.S.; Schober, R.K.; Beller, J.
1992-03-17T23:59:59.000Z
An improved solid aerosol generator used to produce a gas borne stream of dry, solid particles of predetermined size and concentration is disclosed. The improved solid aerosol generator nebulizes a feed solution of known concentration with a flow of preheated gas and dries the resultant wet heated aerosol in a grounded, conical heating chamber, achieving high recovery and flow rates. 2 figs.
Contracting for wind generation
Newbery, David
The UK Government proposes offering long-term Feed-in-Tariffs (FiTs) to low-carbon generation to reduce risk and encourage new entrants. Their preference is for a Contract-for-Difference (CfD) or a premium FiT (pFiT) for all generation regardless...
Internal split field generator
Thundat; Thomas George (Knoxville, TN); Van Neste, Charles W. (Kingston, TN); Vass, Arpad Alexander (Oak Ridge, TN)
2012-01-03T23:59:59.000Z
A generator includes a coil of conductive material. A stationary magnetic field source applies a stationary magnetic field to the coil. An internal magnetic field source is disposed within a cavity of the coil to apply a moving magnetic field to the coil. The stationary magnetic field interacts with the moving magnetic field to generate an electrical energy in the coil.
Laser beam generating apparatus
Warner, B.E.; Duncan, D.B.
1994-02-15T23:59:59.000Z
Laser beam generating apparatus including a septum segment disposed longitudinally within the tubular structure of the apparatus is described. The septum provides for radiatively dissipating heat buildup within the tubular structure and for generating relatively uniform laser beam pulses so as to minimize or eliminate radial pulse delays (the chevron effect). 7 figures.
Laser beam generating apparatus
Warner, B.E.; Duncan, D.B.
1993-12-28T23:59:59.000Z
Laser beam generating apparatus including a septum segment disposed longitudinally within the tubular structure of the apparatus. The septum provides for radiatively dissipating heat buildup within the tubular structure and for generating relatively uniform laser beam pulses so as to minimize or eliminate radial pulse delays (the chevron effect). 11 figures.
Improved solid aerosol generator
Prescott, D.S.; Schober, R.K.; Beller, J.
1988-07-19T23:59:59.000Z
An improved solid aerosol generator used to produce a gas borne stream of dry, solid particles of predetermined size and concentration. The improved solid aerosol generator nebulizes a feed solution of known concentration with a flow of preheated gas and dries the resultant wet heated aerosol in a grounded, conical heating chamber, achieving high recovery and flow rates. 2 figs.
Jet Shapes and Jet Algorithms in SCET
Stephen D. Ellis; Andrew Hornig; Christopher Lee; Christopher K. Vermilion; Jonathan R. Walsh
2010-11-15T23:59:59.000Z
Jet shapes are weighted sums over the four-momenta of the constituents of a jet and reveal details of its internal structure, potentially allowing discrimination of its partonic origin. In this work we make predictions for quark and gluon jet shape distributions in N-jet final states in e+e- collisions, defined with a cone or recombination algorithm, where we measure some jet shape observable on a subset of these jets. Using the framework of Soft-Collinear Effective Theory, we prove a factorization theorem for jet shape distributions and demonstrate the consistent renormalization-group running of the functions in the factorization theorem for any number of measured and unmeasured jets, any number of quark and gluon jets, and any angular size R of the jets, as long as R is much smaller than the angular separation between jets. We calculate the jet and soft functions for angularity jet shapes \\tau_a to one-loop order (O(alpha_s)) and resum a subset of the large logarithms of \\tau_a needed for next-to-leading logarithmic (NLL) accuracy for both cone and kT-type jets. We compare our predictions for the resummed \\tau_a distribution of a quark or a gluon jet produced in a 3-jet final state in e+e- annihilation to the output of a Monte Carlo event generator and find that the dependence on a and R is very similar.
on the complexity of some hierarchical structured matrix algorithms
2012-05-17T23:59:59.000Z
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
Big and Small Ideas: How to Lower Solar Financing Costs
Broader source: Energy.gov [DOE]
DOE hosted the "Big & Small Ideas: How to Lower Solar Financing Costs" breakout session during the SunShot Grand Challenge Summit and Technology Forum. This session explored a range of...
Wild and Scenic River Acts (Lower St. Croix Riverway)
Broader source: Energy.gov [DOE]
The lower portion of the St. Croix River in Minnesota and Wisconsin is regulated under the National Wild and Scenic Rivers Program. Most new residential, commercial, and industrial uses are...
Several new lower bounds for football pool systems
Litsyn, Simon
Several new lower bounds for football pool systems Uri Blass and Simon Litsyn TelAviv University a big deal of attention due to its equivalence to constructing systems for football pools. A survey
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA A Thesis Submitted Institute for providing the SCADA trace and to Andrew K. Wright for suggesting semi-embedded devices. I
Optimization Online - Lower Bounds on Complexity of Lyapunov ...
Amir Ali Ahmadi
2015-04-14T23:59:59.000Z
Apr 14, 2015 ... Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems ... of the optimal product, generalizing a result of Lagarias and Wang. ... belonging to some of the most popular function classes in controls.
A Tight Lower Bound for the Adjacent Quadratic Assignment Problem
Borzou Rostami
2014-09-23T23:59:59.000Z
Sep 23, 2014 ... A Tight Lower Bound for the Adjacent Quadratic Assignment Problem ... The first is based on a ``flow'' formulation whose linear relaxation can be solved very efficiently ... Category 2: Integer Programming (0-1 Programming ).
Are independent directors effective in lowering earnings management in China?
Lai, Liona Hoi Yan
2006-10-30T23:59:59.000Z
investigate: (i) whether voluntary adoption of board independence prior to the China Regulatory Securities Commission (CSRC) regulation on board independence is associated with lower earnings management; and (ii) the extent to which the CSRC regulation...
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Print It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
2008 00:00 It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
Lower bounds for the earliness-tardiness scheduling problem on ...
2004-10-27T23:59:59.000Z
and show that the gap between upper and lower bounds is about 1%. ..... n jobs and the supply of source i is at most pi. There are T sinks with a demand.
Oxygen enhanced switching to combustion of lower rank fuels ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
enhanced switching to combustion of lower rank fuels Re-direct Destination: A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum...
The coolability limits of a reactor pressure vessel lower head
Theofanous, T.G.; Syri, S. [Univ. of California, Santa Barbara, CA (United States)
1995-09-01T23:59:59.000Z
Configuration II of the ULPU experimental facility is described, and from a comprehensive set of experiments are provided. The facility affords full-scale simulations of the boiling crisis phenomenon on the hemispherical lower head of a reactor pressure vessel submerged in water, and heated internally. Whereas Configuration I experiments (published previously) established the lower limits of coolability under low submergence, pool-boiling conditions, with Configuration II we investigate coolability under conditions more appropriate to practical interest in severe accident management; that is, heat flux shapes (as functions of angular position) representative of a core melt contained by the lower head, full submergence of the reactor pressure vessel, and natural circulation. Critical heat fluxes as a function of the angular position on the lower head are reported and related the observed two-phase flow regimes.
Woody vegetation of the lower Navasota River watershed
Allen, Harriet Louise Gell
1974-01-01T23:59:59.000Z
WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by DIl 5~ HARRIET ?GELL ALLEN Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE December... 1974 Major Subject: Range Science WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by HARRIET GELL ALLEN Approved as to style and content by: (Chairman of Committee) (Head of Department) (Member) (Member) December 1974...
A Mobile Motion Analysis System Using Intertial Sensors for Analysis of Lower Limb Prosthetics
Mueller, John Kyle P [ORNL] [ORNL; Ericson, Milton Nance [ORNL] [ORNL; Farquhar, Ethan [ORNL] [ORNL; Lind, Randall F [ORNL] [ORNL; Evans III, Boyd Mccutchen [ORNL] [ORNL
2011-01-01T23:59:59.000Z
Soldiers returning from the global war on terror requiring lower leg prosthetics generally have different concerns and requirements than the typical lower leg amputee. These subjects are usually young, wish to remain active and often desire to return to active military duty. As such, they demand higher performance from their prosthetics, but are at risk for chronic injury and joint conditions in their unaffected limb. Motion analysis is a valuable tool in assessing the performance of new and existing prosthetic technologies as well as the methods in fitting these devices to both maximize performance and minimize risk of injury for the individual soldier. We are developing a mobile, low-cost motion analysis system using inertial measurement units (IMUs) and two custom force sensors that detect ground reaction forces and moments on both the unaffected limb and prosthesis. IMUs were tested on a robot programmed to simulate human gait motion. An algorithm which uses a kinematic model of the robot and an extended Kalman filter (EKF) was used to convert the rates and accelerations from the gyro and accelerometer into joint angles. Compared to encoder data from the robot, which was considered the ground truth in this experiment, the inertial measurement system had a RMSE of <1.0 degree. Collecting kinematic and kinetic data without the restrictions and expense of a motion analysis lab could help researchers, designers and prosthetists advance prosthesis technology and customize devices for individuals. Ultimately, these improvements will result in better prosthetic performance for the military population.
Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms
Baumgartner, Gerald
Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms Sandhya Krishnan1,choppellav @ornl.gov Abstract. This paper describes an approach to synthesis of efficient out-of-core code for the generation of out-of-core code. Experimental measurements are provided that show a good match with model
Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms
Ramanujam, J. "Ram"
Data Locality Optimization for Synthesis of Efficient Out-of-Core Algorithms Sandhya Krishnan1,choppellav}@ornl.gov Abstract. This paper describes an approach to synthesis of efficient out-of-core code for a class for the generation of out-of-core code. Experimental measurements are provided that show a good match with model
Genetic Algorithm based Data-aware Group Scheduling for Big Data Clouds Raghavendra Kune1
Buyya, Rajkumar
Genetic Algorithm based Data-aware Group Scheduling for Big Data Clouds Raghavendra Kune1 , Pramod on demand. Big Data Clouds is a new generation data analytics platform using Cloud computing as a back end and empirical tools. MapReduce scheduling models for Big Data computing operate in the cluster mode, where
A Robust Learning Algorithm Based on SURF and PSM for Facial Expression Recognition
Takiguchi, Tetsuya
A Robust Learning Algorithm Based on SURF and PSM for Facial Expression Recognition Jinhui Chen is based on the Perturbed Subspace Method (PSM), which is an effective way to improve the robustness of learning machines. First, PSM is used to extend the training data, which allows for the generation of ideal
Magnetic Resonance Imaging 1 A new global optimization algorithm and its application to a
Neumaier, Arnold
by the uniformity of the magnetic field generated by this magnet, in that, the more uniform is the magnetic field a low field dedicated magnet is that of using permanent magnets surrounded by an iron yoke to amplifyMagnetic Resonance Imaging 1 A new global optimization algorithm and its application to a Magnetic
Leung, Ka-Ngo; Lou, Tak Pui
2005-03-22T23:59:59.000Z
A compact neutron generator has at its outer circumference a toroidal shaped plasma chamber in which a tritium (or other) plasma is generated. A RF antenna is wrapped around the plasma chamber. A plurality of tritium ion beamlets are extracted through spaced extraction apertures of a plasma electrode on the inner surface of the toroidal plasma chamber and directed inwardly toward the center of neutron generator. The beamlets pass through spaced acceleration and focusing electrodes to a neutron generating target at the center of neutron generator. The target is typically made of titanium tubing. Water is flowed through the tubing for cooling. The beam can be pulsed rapidly to achieve ultrashort neutron bursts. The target may be moved rapidly up and down so that the average power deposited on the surface of the target may be kept at a reasonable level. The neutron generator can produce fast neutrons from a T-T reaction which can be used for luggage and cargo interrogation applications. A luggage or cargo inspection system has a pulsed T-T neutron generator or source at the center, surrounded by associated gamma detectors and other components for identifying explosives or other contraband.
Hero, Alfred O.
Background Basic methods Model-based algorithms Model-free algorithms RTI Perspectives Conclusions 23, 2015 1 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI Coates (McGill) 2 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI
Lothian, Josh [ORNL; Powers, Sarah S [ORNL; Sullivan, Blair D [ORNL; Baker, Matthew B [ORNL; Schrock, Jonathan [ORNL; Poole, Stephen W [ORNL
2013-12-01T23:59:59.000Z
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Synthetic guide star generation
Payne, Stephen A.; Page, Ralph H.; Ebbers, Christopher A.; Beach, Raymond J.
2004-03-09T23:59:59.000Z
A system for assisting in observing a celestial object and providing synthetic guide star generation. A lasing system provides radiation at a frequency at or near 938 nm and radiation at a frequency at or near 1583 nm. The lasing system includes a fiber laser operating between 880 nm and 960 nm and a fiber laser operating between 1524 nm and 1650 nm. A frequency-conversion system mixes the radiation and generates light at a frequency at or near 589 nm. A system directs the light at a frequency at or near 589 nm toward the celestial object and provides synthetic guide star generation.
Synthetic guide star generation
Payne, Stephen A. (Castro Valley, CA) [Castro Valley, CA; Page, Ralph H. (Castro Valley, CA) [Castro Valley, CA; Ebbers, Christopher A. (Livermore, CA) [Livermore, CA; Beach, Raymond J. (Livermore, CA) [Livermore, CA
2008-06-10T23:59:59.000Z
A system for assisting in observing a celestial object and providing synthetic guide star generation. A lasing system provides radiation at a frequency at or near 938 nm and radiation at a frequency at or near 1583 nm. The lasing system includes a fiber laser operating between 880 nm and 960 nm and a fiber laser operating between 1524 nm and 1650 nm. A frequency-conversion system mixes the radiation and generates light at a frequency at or near 589 nm. A system directs the light at a frequency at or near 589 nm toward the celestial object and provides synthetic guide star generation.
Automatic generation of Feynman rules in the Schroedinger functional
Shinji Takeda
2008-08-22T23:59:59.000Z
We provide an algorithm to generate vertices for the Schr\\"odinger functional with an abelian background gauge field. The background field has a non-trivial color structure, therefore we mainly focus on a manipulation of the color matrix part. We propose how to implement the algorithm especially in python code. By using python outputs produced by the code, we also show how to write a numerical expression of vertices in the time-momentum as well as the coordinate space into a Feynman diagram calculation code. As examples of the applications of the algorithm, we provide some one-loop results, ratios of the Lambda parameters between the plaquette gauge action and the improved gauge actions composed from six-link loops (rectangular, chair and parallelogram), the determination of the O(a) boundary counter term to this order, and the perturbative cutoff effects of the step scaling function of the Schroedinger functional coupling constant.
Innovative Self- Generating Projects
Kelly, L.
2013-01-01T23:59:59.000Z
and tubular steel ESL-IE-13-05-06 Proceedings of the Thrity-Fifth Industrial Energy Technology Conference New Orleans, LA. May 21-24, 2013 ? 2013 CLEAResult ? All rights reserved. By-Product Gas Flow COG = Coke Oven Gas BFG = Blast Furnace Gas - Highly... Compared to Natural Gas Amount available (mmBTU/hr) Coke Oven Gas 475 BTU/scf 55% lower 40.4 Blast Furnace Gas 83 BTU/scf 91% lower 43.2 ESL-IE-13-05-06 Proceedings of the Thrity-Fifth Industrial Energy Technology Conference New Orleans, LA. May 21...
A fast contour descriptor algorithm for supernova imageclassification
Aragon, Cecilia R.; Aragon, David Bradburn
2006-07-16T23:59:59.000Z
We describe a fast contour descriptor algorithm and its application to a distributed supernova detection system (the Nearby Supernova Factory) that processes 600,000 candidate objects in 80 GB of image data per night. Our shape-detection algorithm reduced the number of false positives generated by the supernova search pipeline by 41% while producing no measurable impact on running time. Fourier descriptors are an established method of numerically describing the shapes of object contours, but transform-based techniques are ordinarily avoided in this type of application due to their computational cost. We devised a fast contour descriptor implementation for supernova candidates that meets the tight processing budget of the application. Using the lowest-order descriptors (F{sub 1} and F{sub -1}) and the total variance in the contour, we obtain one feature representing the eccentricity of the object and another denoting its irregularity. Because the number of Fourier terms to be calculated is fixed and small, the algorithm runs in linear time, rather than the O(n log n) time of an FFT. Constraints on object size allow further optimizations so that the total cost of producing the required contour descriptors is about 4n addition/subtraction operations, where n is the length of the contour.
Fourth Generation Bound States
Koji Ishiwata; Mark B. Wise
2011-05-25T23:59:59.000Z
We investigate the spectrum and wave functions of {\\bar q}'q' bound states for heavy fourth generation quarks (q') that have a very small mixing with the three observed generations of standard model quarks. Such bound states come with different color, spin and flavor quantum numbers. Since the fourth generation Yukawa coupling, \\lambda_{q'}, is large we include all perturbative corrections to the potential between the heavy quark and antiquark of order \\lambda_{q'}^2N_c/16\\pi^2 where N_c is the number of colors, as well as relativistic corrections suppressed by (v/c)^2. We find that the lightest fourth generation quark masses for which a bound state exists for color octet states. For the the color singlet states, which always have a bound state, we analyze the influence that the Higgs couplings have on the size and binding energy of the bound states.
Vector generator scan converter
Moore, James M. (Livermore, CA); Leighton, James F. (Livermore, CA)
1990-01-01T23:59:59.000Z
High printing speeds for graphics data are achieved with a laser printer by transmitting compressed graphics data from a main processor over an I/O (input/output) channel to a vector generator scan converter which reconstructs a full graphics image for input to the laser printer through a raster data input port. The vector generator scan converter includes a microprocessor with associated microcode memory containing a microcode instruction set, a working memory for storing compressed data, vector generator hardward for drawing a full graphic image from vector parameters calculated by the microprocessor, image buffer memory for storing the reconstructed graphics image and an output scanner for reading the graphics image data and inputting the data to the printer. The vector generator scan converter eliminates the bottleneck created by the I/O channel for transmitting graphics data from the main processor to the laser printer, and increases printer speed up to thirty fold.
Vector generator scan converter
Moore, J.M.; Leighton, J.F.
1988-02-05T23:59:59.000Z
High printing speeds for graphics data are achieved with a laser printer by transmitting compressed graphics data from a main processor over an I/O channel to a vector generator scan converter which reconstructs a full graphics image for input to the laser printer through a raster data input port. The vector generator scan converter includes a microprocessor with associated microcode memory containing a microcode instruction set, a working memory for storing compressed data, vector generator hardware for drawing a full graphic image from vector parameters calculated by the microprocessor, image buffer memory for storing the reconstructed graphics image and an output scanner for reading the graphics image data and inputting the data to the printer. The vector generator scan converter eliminates the bottleneck created by the I/O channel for transmitting graphics data from the main processor to the laser printer, and increases printer speed up to thirty fold. 7 figs.
Burra G. Sidharth
2010-03-11T23:59:59.000Z
Modifications in the energy momentum dispersion laws due to a noncommutative geometry, have been considered in recent years. We examine the oscillations of extended objects in this perspective and find that there is now a "generation" of energy.
Oscillating fluid power generator
Morris, David C
2014-02-25T23:59:59.000Z
A system and method for harvesting the kinetic energy of a fluid flow for power generation with a vertically oriented, aerodynamic wing structure comprising one or more airfoil elements pivotably attached to a mast. When activated by the moving fluid stream, the wing structure oscillates back and forth, generating lift first in one direction then in the opposite direction. This oscillating movement is converted to unidirectional rotational movement in order to provide motive power to an electricity generator. Unlike other oscillating devices, this device is designed to harvest the maximum aerodynamic lift forces available for a given oscillation cycle. Because the system is not subjected to the same intense forces and stresses as turbine systems, it can be constructed less expensively, reducing the cost of electricity generation. The system can be grouped in more compact clusters, be less evident in the landscape, and present reduced risk to avian species.
Generating electricity from viruses
Lee, Seung-Wuk
2013-10-31T23:59:59.000Z
Berkeley Lab's Seung-Wuk Lee discusses "Generating electricity from viruses" in this Oct. 28, 2013 talk, which is part of a Science at the Theater event entitled Eight Big Ideas.
I. G. Knowles; T. Sjostrand; A. Blondel; A. Boehrer; C. D. Buchanan; D. G. Charlton; S. -L. Chu; S. Chun; G. Dissertori; D. Duchesneau; J. W. Gary; M. Gibbs; A. Grefrath; G. Gustafson; J. Hakkinen; K. Hamacher; K. Kato; L. Lonnblad; W. Metzger; R. Moller; T. Munehisa; R. Odorico; Y. Pei; G. Rudolph; S. Sarkar; M. H. Seymour; J. C. Thompson; S. Todorova; B. R. Webber
1996-01-04T23:59:59.000Z
This report is a survey on QCD Event Generator issues of relevance for LEP 2. It contains four main sections: a summary of experience from LEP 1, extrapolations to LEP 2 energies, Monte Carlo descriptions and standardization issues.
Contextualizing generative design
Arida, Saeed, 1977-
2004-01-01T23:59:59.000Z
Generative systems have been widely used to produce two- and three-dimensional constructs, in an attempt to escape from our preconceptions and pre-existing spatial language. The challenge is to use this mechanism in ...
Generating electricity from viruses
Lee, Seung-Wuk
2014-06-23T23:59:59.000Z
Berkeley Lab's Seung-Wuk Lee discusses "Generating electricity from viruses" in this Oct. 28, 2013 talk, which is part of a Science at the Theater event entitled Eight Big Ideas.
Local entropy generation analysis
Drost, M.K.; White, M.D.
1991-02-01T23:59:59.000Z
Second law analysis techniques have been widely used to evaluate the sources of irreversibility in components and systems of components but the evaluation of local sources of irreversibility in thermal processes has received little attention. While analytical procedures for evaluating local entropy generation have been developed, applications have been limited to fluid flows with analytical solutions for the velocity and temperature fields. The analysis of local entropy generation can be used to evaluate more complicated flows by including entropy generation calculations in a computational fluid dynamics (CFD) code. The research documented in this report consists of incorporating local entropy generation calculations in an existing CFD code and then using the code to evaluate the distribution of thermodynamic losses in two applications: an impinging jet and a magnetic heat pump. 22 refs., 13 figs., 9 tabs.
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17T23:59:59.000Z
The model of laminated wave turbulence puts forth a novel computational problem - construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order $10^{12}$ and more. The equations to be solved in integers are resonant conditions for nonlinearly interacting waves and their form is defined by the wave dispersion. It is established that for the most common dispersion as an arbitrary function of a wave-vector length two different generic algorithms are necessary: (1) one-class-case algorithm for waves interacting through scales, and (2) two-class-case algorithm for waves interacting through phases. In our previous paper we described the one-class-case generic algorithm and in our present paper we present the two-class-case generic algorithm.
MacDonald, P.E.; Shah, V.N.; Ward, L.W.; Ellison, P.G.
1996-04-01T23:59:59.000Z
A review and summary of the available information on steam generator tubing failures and the impact of these failures on plant safety is presented. The following topics are covered: pressurized water reactor (PWR), Canadian deuterium uranium (CANDU) reactor, and Russian water moderated, water cooled energy reactor (VVER) steam generator degradation, PWR steam generator tube ruptures, the thermal-hydraulic response of a PWR plant with a faulted steam generator, the risk significance of steam generator tube rupture accidents, tubing inspection requirements and fitness-for-service criteria in various countries, and defect detection reliability and sizing accuracy. A significant number of steam generator tubes are defective and are removed from service or repaired each year. This wide spread damage has been caused by many diverse degradation mechanisms, some of which are difficult to detect and predict. In addition, spontaneous tube ruptures have occurred at the rate of about one every 2 years over the last 20 years, and incipient tube ruptures (tube failures usually identified with leak detection monitors just before rupture) have been occurring at the rate of about one per year. These ruptures have caused complex plant transients which have not always been easy for the reactor operators to control. Our analysis shows that if more than 15 tubes rupture during a main steam line break, the system response could lead to core melting. Although spontaneous and induced steam generator tube ruptures are small contributors to the total core damage frequency calculated in probabilistic risk assessments, they are risk significant because the radionuclides are likely to bypass the reactor containment building. The frequency of steam generator tube ruptures can be significantly reduced through appropriate and timely inspections and repairs or removal from service.
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19T23:59:59.000Z
Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.
Message Passing for Integrating and Assessing Renewable Generation in a Redundant Power Grid
Zdeborová, Lenka; Chertkov, Michael
2009-01-01T23:59:59.000Z
A simplified model of a redundant power grid is used to study integration of fluctuating renewable generation. The grid consists of large number of generator and consumer nodes. The net power consumption is determined by the difference between the gross consumption and the level of renewable generation. The gross consumption is drawn from a narrow distribution representing the predictability of aggregated loads, and we consider two different distributions representing wind and solar resources. Each generator is connected to D consumers, and redundancy is built in by connecting R of these consumers to other generators. The lines are switchable so that at any instance each consumer is connected to a single generator. We explore the capacity of the renewable generation by determining the level of "firm" generation capacity that can be displaced for different levels of redundancy R. We also develop message-passing control algorithm for finding switch settings where no generator is overloaded.
Evaluating the Impact of Solar Generation on Balancing Requirements in Southern Nevada System
Ma, Jian; Lu, Shuai; Etingov, Pavel V.; Makarov, Yuri V.
2012-07-26T23:59:59.000Z
Abstract—In this paper, the impacts of solar photovoltaic (PV) generation on balancing requirements including regulation and load following in the Southern Nevada balancing area are analyzed. The methodology is based on the “swinging door” algorithm and a probability box method developed by PNNL. The regulation and load following signals are mimicking the system’s scheduling and real-time dispatch processes. Load, solar PV generation and distributed PV generation (DG) data are used in the simulation. Different levels of solar PV generation and DG penetration profiles are used in the study. Sensitivity of the regulation requirements with respect to real-time solar PV generation forecast errors is analyzed.
Geometric lower bound for a quantum coherence measure
Diego Paiva Pires; Lucas C. Céleri; Diogo O. Soares-Pinto
2015-04-23T23:59:59.000Z
Nowadays, geometric tools are being used to treat a huge class of problems of quantum information science. By understanding the interplay between the geometry of the state space and information-theoretic quantities, it is possible to obtain less trivial and more robust physical constraints on quantum systems. In this sense, here we establish a geometric lower bound for the Wigner-Yanase skew information (WYSI), a well-known information theoretic quantity recently recognized as a proper quantum coherence measure. Starting from a mixed state evolving under unitary dynamics, while WYSI is a constant of motion, the lower bound indicates the rate of change of quantum statistical distinguishability between initial and final states. Our result shows that, since WYSI fits in the class of Petz metrics, this lower bound is the change rate of its respective geodesic distance on quantum state space. The geometric approach is advantageous because raises several physical interpretations of this inequality under the same theoretical umbrella.
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2014-11-17T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase the qubits' purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of 13C2-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. For example, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
LO, NLO, LO* and jet algorithms
J. Huston
2010-01-14T23:59:59.000Z
The impact of NLO corrections, and in particular, the role of jet algorithms, is examined for a variety of processes at the Tevatron and LHC.
Optimization Online - Efficient Heuristic Algorithms for Maximum ...
T. G. J. Myklebust
2012-11-19T23:59:59.000Z
Nov 19, 2012 ... Efficient Heuristic Algorithms for Maximum Utility Product Pricing Problems. T. G. J. Myklebust(tmyklebu ***at*** csclub.uwaterloo.ca)
Efficient Algorithmic Techniques for Several Multidimensional ...
Mugurel
2008-10-23T23:59:59.000Z
Politehnica University of Bucharest, Romania, mugurel.andreica@cs.pub.ro. Abstract: In this paper I present several novel, efficient, algorithmic techniques for.
Parallel Interval Continuous Global Optimization Algorithms
abdeljalil benyoub
2002-07-19T23:59:59.000Z
Jul 19, 2002 ... Abstract: We theorically study, on a distributed memory architecture, the parallelization of Hansen's algorithm for the continuous global ...
High-Performance Engineering Optimization: Applications, Algorithms...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
High-Performance Engineering Optimization: Applications, Algorithms, and Adoption Event Sponsor: Mathematics and Computer Science Division Start Date: Aug 19 2015 - 10:30am...
Design and Analysis of Algorithms Course Page
Design and Analysis of Algorithms. TTR 3:05- 4:25, IC 109. OFFICE HOURS: Wed 11-12 or by appointment (Rm: Skiles, 116).
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
MEACHAM JE
2009-10-26T23:59:59.000Z
This report assesses the steady state flammability level under off normal ventilation conditions in the tank headspace for 28 double-shell tanks (DST) and 149 single shell-tanks (SST) at the Hanford Site. Flammability was calculated using estimated gas release rates, Le Chatelier's rule, and lower flammability limits of fuels in an air mixture. This revision updates the hydrogen generation rate input data for all 177 tanks using waste composition information from the Best Basis Inventory Detail Report (data effective as of August 4,2008). Assuming only barometric breathing, the shortest time to reach 25% of the lower flammability limit is 11 days for DSTs (i.e., tank 241-AZ-10l) and 36 days for SSTs (i.e., tank 241-B-203). Assuming zero ventilation, the shortest time to reach 25% of the lower flammability limit is 10 days for DSTs (i.e., tank 241-AZ-101) and 34 days for SSTs (i.e., tank 241-B-203).
MEACHAM JE
2008-11-17T23:59:59.000Z
This report assesses the steady state flammability level under off normal ventilation conditions in the tank headspace for 28 double-shell tanks (DST) and 149 single shell-tanks (SST) at the Hanford Site. Flammability was calculated using estimated gas release rates, Le Chatelier's rule, and lower flammability limits of fuels in an air mixture. This revision updates the hydrogen generation rate input data for al1 177 tanks using waste composition information from the Best Basis Inventory Detail Report (data effective as of August 4,2008). Assuming only barometric breathing, the shortest time to reach 25% of the lower flammability limit is 13 days for DSTs (i.e., tank 241-AZ-102) and 36 days for SSTs (i.e., tank 241-B-203). Assuming zero ventilation, the shortest time to reach 25% of the lower flammability limit is 12 days for DSTs (i.e., tank 241-AZ-102) and 34 days for SSTs (i.e., tank 241-B-203).
Lowering On-Road Fuel Use: A Component Approach
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
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: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Department ofFormerCommittee: Notice ofJoshuaviiof Lower Colorado River Authority'sLowering On-Road
Lower and upper probabilities in the distributive lattice of subsystems
A. Vourdas
2014-10-08T23:59:59.000Z
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m) is the projector to) obeys a supermodularity inequality, and it is interpreted as a lower probability in the sense of the Dempster-Shafer theory, and not as a Kolmogorov probability. It is shown that the basic concepts of the Dempster-Shafer theory (lower and upper probabilities and the Dempster multivaluedness) are pertinent to the quantum formalism of finite systems.
Zonca, Fulvio
hybrid current drive (LHCD) is of strong interest for the burning plasma research, as the trapped heating (ECRH) is of strong interest for the burning plasma research. The charged fusion product effects
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . , . Event Scan Algorithm . Neural Network . . . . . . . . . . . . . . . , . . . . . . California Algorithm ?8 with Fuzzy Logic Selected Algorithms Page 20 21 22 24 24 25 26 27 28 28 30 32 32 33 33 33 33... 7 California Algorithm ?10 Decision Tree 12 14 15 8 Speed/Flow Curve 9 McMaster Algorithm Template 15 25 10 Traffic Flow Relationships Applied in the Dynamic Model Algorithm. . . 26 11 Multi-Layer Feed-Forward Neural Network 12 Membership...
Resource analysis of the quantum linear system algorithm
Artur Scherer; Benoît Valiron; Siun-Chuon Mau; Scott Alexander; Eric van den Berg; Thomas E. Chapuran
2015-05-25T23:59:59.000Z
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described generalization [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order $10^{25}$ if oracle costs are excluded, and a circuit width and depth of order $10^8$ and $10^{29}$, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.
Fuel cycle comparison of distributed power generation technologies.
Elgowainy, A.; Wang, M. Q.; Energy Systems
2008-12-08T23:59:59.000Z
The fuel-cycle energy use and greenhouse gas (GHG) emissions associated with the application of fuel cells to distributed power generation were evaluated and compared with the combustion technologies of microturbines and internal combustion engines, as well as the various technologies associated with grid-electricity generation in the United States and California. The results were primarily impacted by the net electrical efficiency of the power generation technologies and the type of employed fuels. The energy use and GHG emissions associated with the electric power generation represented the majority of the total energy use of the fuel cycle and emissions for all generation pathways. Fuel cell technologies exhibited lower GHG emissions than those associated with the U.S. grid electricity and other combustion technologies. The higher-efficiency fuel cells, such as the solid oxide fuel cell (SOFC) and molten carbonate fuel cell (MCFC), exhibited lower energy requirements than those for combustion generators. The dependence of all natural-gas-based technologies on petroleum oil was lower than that of internal combustion engines using petroleum fuels. Most fuel cell technologies approaching or exceeding the DOE target efficiency of 40% offered significant reduction in energy use and GHG emissions.
Addendum to "Coherent radio pulses from GEANT generated electromagnetic showers in ice"
S. Razzaque; S. Seunarine; S. Chambers; D. Besson; D. McKay; J. Ralston; D. Seckel
2003-06-13T23:59:59.000Z
We reevaluate our published calculations of electromagnetic showers generated by GEANT 3.21 and the radio frequency pulses they produce in ice. We are prompted by a recent report showing that GEANT 3.21-modeled showers are sensitive to internal settings in the electron tracking subroutine. We report the shower and pulse characteristics obtained with different settings of GEANT 3.21 and with GEANT 4. The default setting of electron tracking in GEANT 3.21 we used in previous work speeds up the shower simulation at the cost of information near the end of the tracks. We find that settings tracking electron and positron to lower energy yield a more accurate calculation, a more intense shower, and proportionately stronger radio pulses at low frequencies. At high frequencies the relation between shower tracking algorithm and pulse spectrum is more complex. We obtain radial distributions of shower particles and phase distributions of pulses from 100 GeV showers that are consistent with our published results.
Superconducting thermoelectric generator
Metzger, J.D.; El-Genk, M.S.
1994-01-01T23:59:59.000Z
Thermoelectricity is produced by applying a temperature differential to dissimilar electrically conducting or semiconducting materials, thereby producing a voltage that is proportional to the temperature difference. Thermoelectric generators use this effect to directly convert heat into electricity; however, presently-known generators have low efficiencies due to the production of high currents which in turn cause large resistive heating losses. Some thermoelectric generators operate at efficiencies between 4% and 7% in the 800{degrees} to 1200{degrees}C range. According to its major aspects and bradly stated, the present invention is an apparatus and method for producing electricity from heat. In particular, the invention is a thermoelectric generator that juxtaposes a superconducting material and a semiconducting material - so that the superconducting and the semiconducting materials touch - to convert heat energy into electrical energy without resistive losses in the temperature range below the critical temperature of the superconducting material. Preferably, an array of superconducting material is encased in one of several possible configurations within a second material having a high thermal conductivity, preferably a semiconductor, to form a thermoelectric generator.
Fischer, Noah A. [Los Alamos National Laboratory
2012-08-14T23:59:59.000Z
The reactor core input generator allows for MCNP input files to be tailored to design specifications and generated in seconds. Full reactor models can now easily be created by specifying a small set of parameters and generating an MCNP input for a full reactor core. Axial zoning of the core will allow for density variation in the fuel and moderator, with pin-by-pin fidelity, so that BWR cores can more accurately be modeled. LWR core work in progress: (1) Reflectivity option for specifying 1/4, 1/2, or full core simulation; (2) Axial zoning for moderator densities that vary with height; (3) Generating multiple types of assemblies for different fuel enrichments; and (4) Parameters for specifying BWR box walls. Fuel pin work in progress: (1) Radial and azimuthal zoning for generating further unique materials in fuel rods; (2) Options for specifying different types of fuel for MOX or multiple burn assemblies; (3) Additional options for replacing fuel rods with burnable poison rods; and (4) Control rod/blade modeling.
Petrick, Michael (Joliet, IL); Pierson, Edward S. (Chicago, IL); Schreiner, Felix (Mokena, IL)
1980-01-01T23:59:59.000Z
According to the present invention, coal combustion gas is the primary working fluid and copper or a copper alloy is the electrodynamic fluid in the MHD generator, thereby eliminating the heat exchangers between the combustor and the liquid-metal MHD working fluids, allowing the use of a conventional coalfired steam bottoming plant, and making the plant simpler, more efficient and cheaper. In operation, the gas and liquid are combined in a mixer and the resulting two-phase mixture enters the MHD generator. The MHD generator acts as a turbine and electric generator in one unit wherein the gas expands, drives the liquid across the magnetic field and thus generates electrical power. The gas and liquid are separated, and the available energy in the gas is recovered before the gas is exhausted to the atmosphere. Where the combustion gas contains sulfur, oxygen is bubbled through a side loop to remove sulfur therefrom as a concentrated stream of sulfur dioxide. The combustor is operated substoichiometrically to control the oxide level in the copper.
FIRST-GENERATION COLLEGE STUDENTS
Su, Xiao
FIRST-GENERATION COLLEGE STUDENTS PROGRAM AT SAN JOSÉ STATE UNIVERSITY INTERESTED IN PARTICIPATING OUR WEBSITE: sjsu.edu/studentaffairs/ current_students/first- generation/generate We are currently located in MOD A in the MOSAIC Cross- Cultural Center. Visit us today! WHAT IS GENERATE? GENERATE
St Andrews, University of
The Need for Language Repair The Reformation Algorithm Discussion Reformation: A Domain of Edinburgh University of St Andrews, 27th November 2013 #12;The Need for Language Repair The Reformation Algorithm Discussion Outline 1 The Need for Language Repair 2 The Reformation Algorithm 3 Discussion #12;The
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL Mehdi-NN search in large scale image databases, based on top-k multi-criteria search tech- niques. The method retrieval, stor- age requirements and update cost. The search algorithm delivers ap- proximate results
Vaze, Rahul
2011-01-01T23:59:59.000Z
We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of...
Investigation of Newton-Krylov algorithms for low Mach number compressible flow
McHugh, P.R.; Knoll, D.A.; Mousseau, V.A.; Hansen, G.A.
1995-10-01T23:59:59.000Z
Fully coupled Newton-Krylov algorithms are used to solve steady speed compressible flow past a backward facing step flow Mach and Reynolds numbers. Various preconditioned Krylov iterative methods are used to solve the linear systems that arise on each Newton step, specifically Lanczos-based and Arnoldi-based algorithms. Several preconditioning strategies are considered to improve the performance of these iterative techniques, including incomplete lower-upper factorization with various levels of fill-in [ILU(k)] and domain based additive and multiplicative Schwarz type preconditioning both with and without overlapping domains. The ILU(K) preconditioners were generally less reliable for lower values of the flow Mach number, and exhibited strong sensitivity to cell ordering. In addition, the parallel nature of the domain based preconditioners is exploited on both a shared memory computer and a distributed system of workstations. Important aspects of the numerical solutions are discussed.
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948-
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948- With particular reference to the Willamette River, intended to aid or direct management or utilization praotices and as gi.\\ides for administrative POLLUTION IN THE LOTOR COLIMRIA BASIN IN 1948 WITH PARTI CirW.R REFERENCE TO THE WTLLAJTETTE BASIN
Lower bounding procedure for the Asymmetric Quadratic Traveling ...
2015-02-04T23:59:59.000Z
a lower bound is to linearize the quadratic terms xijxjk for all (i, j),(j, k) ? A ..... Consider any cycle C. Since column Cp is the selected column to enter the basis we ..... some kind of subtour elimination constraint, we restrict the search to find a
Surface OceanLower Atmosphere Processes Geophysical Research Series 187
Kohfeld, Karen
, British Columbia, Canada Andy Ridgwell Bristol Research Initiative for the Dynamic Global Environment251 Surface OceanLower Atmosphere Processes Geophysical Research Series 187 Copyright 2009, and processes have been identified that have improved our understanding of the modern and future carbon cycle
A lower bound of quantum conditional mutual information
Lin Zhang; Junde Wu
2014-09-29T23:59:59.000Z
In this paper, a lower bound of quantum conditional mutual information is obtained by employing the Peierls-Bogoliubov inequality and Golden Thompson inequality. Comparison with the bounds obtained by other researchers indicates that our result is independent of any measurements. It may give some new insights over squashed entanglement and perturbations of Markov chain states.
Lower Oil Prices: A Reason to Give Thanks GENE EPSTEIN
California at Davis, University of
Lower Oil Prices: A Reason to Give Thanks By GENE EPSTEIN Nov. 29, 2014 1:31 a.m. ET I give thanks thanks for an oil price that fell below $70 a barrel Friday, mainly because it bodes well for general early this year ("Here Comes $75 Oil," March 31). Amy Jaffe, executive director of energy
Citrus Varieties for the Lower Rio Grande Valley.
Wood, J. F. (John Fielding); Friend, W. H. (William Heartsill)
1941-01-01T23:59:59.000Z
of juice, 191.0 cc.; per cent juice by wt., 48.4; CITRUS VARIETIES FOR THE LOWER RIO GRANDE VALLEY 11 typical seed 15 x 9 mm.; total solids, 10.15; acid, 1.68; solids to acid ratio, 6.0:l. Ripening season, October 15 to December 1. Cecily Seedless...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Hernandez, Manuel
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
New Lower Bounds for Online k-Server Routing Problems
Krumke, Sven O.
New Lower Bounds for Online k-Server Routing Problems Irene Fink a Sven O. Krumke a Stephan, 67653 Kaiserslautern, Germany. {fink,krumke,westphal}@mathematik.uni-kl.de Abstract In a k-server routing problem k 1 servers move in a metric space in order to visit specified points or carry objects
Is there Lower Limit to Velocity or Velocity Change?
B. N. Sreenath; Kenath Arun; C. Sivaram
2013-06-19T23:59:59.000Z
Here we explore the possibility of a lower limit to velocity or velocity change which is 20 orders of magnitude smaller than the speed of light and explore the various observable signatures including those in cosmic rays and gamma ray bursts.
Lower Bounds on Testing Membership to a Polyhedron by
Grigoriev, Dima
Email:imilar question was ope* *n for algebraic decision dima@cse.psu.edu. Supported in part by the Volkswagen and ECUS030, and by the Volkswagen-Stiftung.oEmail:btaining lower bounds f* *or the complexity of test
DEVELOPMENTS IN LARGE BLADES FOR LOWER COST WIND TURBINES
DEVELOPMENTS IN LARGE BLADES FOR LOWER COST WIND TURBINES by Thomas D. Ashwill Sandia National of the WindPACT project, the Blade System Design Studies developed innovations in manufacturing, materials capacity is a companion drop in the cost of wind energy (COE). The current cost of wind-produced power
Traversal, Case Analysis, and Lowering for C++ Program Analysis
Wagner, Luke A.
2010-01-14T23:59:59.000Z
++. This extension, named Filter, assists the tool builder in traversal, case analysis, and lowering of the data structure representing C++ programs. Comparisons described in the thesis show a 2-4x code reduction when solving basic problems (e.g., searching for uses...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Hernandez, Manuel
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
A Heat Transfer Model for a Stratified Corium-Metal Pool in the Lower Plenum of a Nuclear Reactor
M. S. Sohal; L. J. Siefken
1999-08-01T23:59:59.000Z
This preliminary design report describes a model for heat transfer in a corium-metal stratified pool. It was decided to make use of the existing COUPLE model. Currently available correlations for natural convection heat transfer in a pool with and without internal heat generation were obtained. The appropriate correlations will be incorporated in the existing COUPLE model. Heat conduction and solidification modeling will be done with existing algorithms in the COUPLE. Assessment of the new model will be done by simple energy conservation problems.
A Heat Transfer Model for a Stratified Corium-metal Pool in the Lower Plenum of a Nuclear Reactor
Sohal, Manohar Singh; Siefken, Larry James
1999-08-01T23:59:59.000Z
This preliminary design report describes a model for heat transfer in a corium-metal stratified pool. It was decided to make use of the existing COUPLE model. Currently available correlations for natural convection heat transfer in a pool with and without internal heat generation were obtained. The appropriate correlations will be incorporated in the existing COUPLE model. Heat conduction and solidification modeling will be done with existing algorithms in the COUPLE. Assessment of the new model will be done by simple energy conservation problems.
MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC-TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES
Paris-Sud XI, Université de
MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC- TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES Eddy-Current nondestructive evaluation of metal plates is of interest in a wide range of applications in the lower frequency band (kHz) for eddy-current testing, to retrieve small void defects inside a conducting
Unit Commitment Considering Generation Flexibility and Environmental Constraints
Lu, Shuai; Makarov, Yuri V.; Zhu, Yunhua; Lu, Ning; Prakash Kumar, Nirupama; Chakrabarti, Bhujanga B.
2010-07-31T23:59:59.000Z
This paper proposes a new framework for power system unit commitment process, which incorporates the generation flexibility requirements and environmental constraints into the existing unit commitment algorithm. The generation flexibility requirements are to address the uncertainties with large amount of intermittent resources as well as with load and traditional generators, which causes real-time balancing requirements to be variable and less predictable. The proposed flexibility requirements include capacity, ramp and ramp duration for both upward and downward balancing reserves. The environmental constraints include emission allowance for fossil fuel-based generators and ecological regulations for hydro power plants. Calculation of emission rates is formulated. Unit commitment under this new framework will be critical to the economic and reliable operation of the power grid and the minimization of its negative environmental impacts, especially when high penetration levels of intermittent resources are being approached, as required by the renewable portfolio standards in many states.
Leung, Ka-Ngo
2006-11-21T23:59:59.000Z
A spherical neutron generator is formed with a small spherical target and a spherical shell RF-driven plasma ion source surrounding the target. A deuterium (or deuterium and tritium) ion plasma is produced by RF excitation in the plasma ion source using an RF antenna. The plasma generation region is a spherical shell between an outer chamber and an inner extraction electrode. A spherical neutron generating target is at the center of the chamber and is biased negatively with respect to the extraction electrode which contains many holes. Ions passing through the holes in the extraction electrode are focused onto the target which produces neutrons by D-D or D-T reactions.
Using Backup Generators: Choosing the Right Backup Generator...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Generators: Choosing the Right Backup Generator - Business Owners Identify essential systems and equipment-What do you need to keep your business operating? These may include...
External split field generator
Thundat, Thomas George (Knoxville, TN); Van Neste, Charles W. (Kingston, TN); Vass, Arpad Alexander (Oak Ridge, TN)
2012-02-21T23:59:59.000Z
A generator includes a coil disposed about a core. A first stationary magnetic field source may be disposed on a first end portion of the core and a second stationary magnetic field source may be disposed on a second end portion of core. The first and second stationary magnetic field sources apply a stationary magnetic field to the coil. An external magnetic field source may be disposed outside the coil to apply a moving magnetic field to the coil. Electrical energy is generated in response to an interaction between the coil, the moving magnetic field, and the stationary magnetic field.
Fritz, Robert J. (Schenectady, NY)
1986-01-01T23:59:59.000Z
A flowmeter is provided which uses the sidetones generated in a cavity formed in the wall of a flowpipe or the like in response to fluid flowing past the cavity to provide a measure of the flow velocity of that fluid. The dimensions of the cavity are such as to provide a dominant vibratory frequency which is sensed by a pressure sensor. The flowmeter is adapted for use for a range of frequencies in which the Strouhal number is constant and under these conditions the vibratory frequency is directly related to the flow rate. The tone generator cavity and pressure transducer form a unit which is connected in-line in the flowpipe.
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11T23:59:59.000Z
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of number fields to an open conjecture from elementary number theory.
On the Potential of Automatic Algorithm Configuration
Hutter, Frank
.g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well lead to enormous speed-ups of tree search algorithms for SAT for solving SAT-encoded software The problem of setting an algorithm's free parameters for maximal performance on a class of problem instances
Quadruped Gait Learning Using Cyclic Genetic Algorithms
Hickey, Timothy J.
and in particular, Genetic Algorithms, have previously been used to develop gaits for legged (primarily hexapod]. In a previous work Parker made use of cyclic genetic algorithms to develop walking gaits for a hexapod robot [5]. Each of the six legs of this hexapod robot could only move vertically and horizontally and the number
Enhancing Smart Home Algorithms Using Temporal Relations
Cook, Diane J.
Enhancing Smart Home Algorithms Using Temporal Relations Vikramaditya R. JAKKULA1 and Diane J COOK School of Electrical Engineering and Computer Science Abstract. Smart homes offer a potential benefit improves the performance of these algorithms and thus enhances the ability of smart homes to monitor
Virtual Scanning Algorithm for Road Network Surveillance
Jeong, Jaehoon "Paul"
Virtual Scanning Algorithm for Road Network Surveillance Jaehoon Jeong, Student Member, IEEE, Yu Gu a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design roadways and 2) the road network maps are normally known. We guarantee the detection of moving targets
Communication and Computation in Distributed CSP Algorithms
Krishnamachari, Bhaskar
Communication and Computation in Distributed CSP Algorithms C`esar Fern`andez1 , Ram´on B´ejar1 in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
Power Control Algorithms in Wireless Communications
Power Control Algorithms in Wireless Communications Judd Rohwer , Chaouki T. Abdallah , Aly El-Osery 1 Abstract This paper presents a comprehensive review of the published algorithms on power control) and Time Division Multiple Access (TDMA). 2 Introduction Power control in cellular systems is applied
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
A Faster Primal Network Simplex Algorithm
Aggarwal, Charu C.
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...
ASYNPLEX, an asynchronous parallel revised simplex algorithm
Hall, Julian
ASYNPLEX, an asynchronous parallel revised simplex algorithm J.A.J. Hall K.I.M. McKinnon February, an asynchronous parallel revised simplex algorithm J. A. J. Hall K. I. M. McKinnon 27th February 1998 Abstract This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable
Buffer assignment algorithms for data driven architectures
Chatterjee, Mitrajit
1994-01-01T23:59:59.000Z
algorithms have been shown to be O(V x E) and O(V'xlogV) re spectively; an improvement over the existing strategies. A novel buffer distribution algorithm to maximize the pipelining and throughput has also been proposed. The number of buffers obtained...
Stochastic Search for Signal Processing Algorithm Optimization
Stochastic Search for Signal Processing Algorithm Optimization Bryan Singer Manuela Veloso May address the complex task of signal processing optimization. We first introduce and discuss the complexities of this domain. In general, a single signal processing algorithm can be represented by a very
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05T23:59:59.000Z
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08T23:59:59.000Z
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15T23:59:59.000Z
We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.
Energy Aware Algorithmic Engineering Swapnoneel Roy
Rudra,, Atri
Energy Aware Algorithmic Engineering Swapnoneel Roy School of Computing University of North Florida: akshat.verma@in.ibm.com Abstract--In this work, we argue that energy management should be a guiding are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number
Algorithmic Problems in Power Management Sandy Irani
Pruhs, Kirk
Algorithmic Problems in Power Management Sandy Irani School of Information and Computer Science on algorithmic problems related to power management. We will try to highlight some open problems that we feel are interesting. This survey places more concentration on lines of research of the authors: managing power using
Algorithmic cooling and scalable NMR quantum computers
Mor, Tal
Algorithmic cooling and scalable NMR quantum computers P. Oscar Boykin*, Tal MorÂ§ , Vwani cooling (via polarization heat bath)--a powerful method for obtaining a large number of highly polarized (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression
Computational Fluid Dynamic Analysis of the VHTR Lower Plenum Standard Problem
Richard W. Johnson; Richard R. Schultz
2009-07-01T23:59:59.000Z
The United States Department of Energy is promoting the resurgence of nuclear power in the U. S. for both electrical power generation and production of process heat required for industrial processes such as the manufacture of hydrogen for use as a fuel in automobiles. The DOE project is called the next generation nuclear plant (NGNP) and is based on a Generation IV reactor concept called the very high temperature reactor (VHTR), which will use helium as the coolant at temperatures ranging from 450 ºC to perhaps 1000 ºC. While computational fluid dynamics (CFD) has not been used for past safety analysis for nuclear reactors in the U. S., it is being considered for safety analysis for existing and future reactors. It is fully recognized that CFD simulation codes will have to be validated for flow physics reasonably close to actual fluid dynamic conditions expected in normal and accident operational situations. To this end, experimental data have been obtained in a scaled model of a narrow slice of the lower plenum of a prismatic VHTR. The present report presents results of CFD examinations of these data to explore potential issues with the geometry, the initial conditions, the flow dynamics and the data needed to fully specify the inlet and boundary conditions; results for several turbulence models are examined. Issues are addressed and recommendations about the data are made.
WECC Variable Generation Planning Reference Book: Appendices
Makarov, Yuri V.; Du, Pengwei; Etingov, Pavel V.; Ma, Jian; Vyakaranam, Bharat
2013-05-13T23:59:59.000Z
The document titled “WECC Variable Generation Planning Reference Book”. This book is divided into two volumes; one is the main document (volume 1)and the other is appendices (volume 2). The main document is a collection of the best practices and the information regarding the application and impact of variables generation on power system planning. This volume (appendices) has additional information on the following topics: Probabilistic load flow problems. 2. Additional useful indices. 3. high-impact low-frequency (HILF) events. 4. Examples of wide-area nomograms. 5. Transmission line ratings, types of dynamic rating methods. 6. Relative costs per MW-km of different electric power transmission technologies. 7. Ultra-high voltage (UHV) transmission. 8.High voltage direct current (VSC-HVDC). 9. HVDC. 10. Rewiring of existing transmission lines. 11. High-temperature low sag (HTLS) conductors. 12. The direct method and energy functions for transient stability analysis in power systems. 13.Blackouts caused by voltage instability. 14. Algorithm for parameter continuation predictor-corrector methods. 15. Approximation techniques available for security regions. 16. Impacts of wind power on power system small signals stability. 17. FIDVR. 18. FACTS. 19. European planning standard and practices. 20. International experience in wind and solar energy sources. 21. Western Renewable Energy Zones (WREZ). 22. various energy storage technologies. 23. demand response. 24. BA consolidation and cooperation options. 25. generator power management requirements and 26. European planning guidelines.
The Generation Effect and Memory
Rosner, Zachary Alexander
2012-01-01T23:59:59.000Z
M. A. (2007). The generation effect: A meta- analyticBjork, R. A. (1988). The generation effect: Support for aE. J. (2012). The next generation: The value of reminding.
Options for Generating Steam Efficiently
Ganapathy, V.
This paper describes how plant engineers can efficiently generate steam when there are steam generators and Heat Recovery Steam Generators in their plant. The process consists of understanding the performance characteristics of the various equipment...
EM Algorithms from a Non-Stochastic Perspective Charles Byrne
Byrne, Charles
EM Algorithms from a Non-Stochastic Perspective Charles Byrne Charles Byrne@uml.edu Department The EM algorithm is not a single algorithm, but a template for the con- struction of iterative algorithms a method for estimat- ing parameters in statistics, the essence of the EM algorithm is not stochastic
A Visualization System for Correctness Proofs of Graph Algorithms
Metaxas, Takis
A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm
QRlike Algorithms---An Overview of Convergence Theory and Practice
QRÂlike Algorithms--- An Overview of Convergence Theory and Practice David S. Watkins Abstract. The family of GR algorithms is discussed. This includes the stanÂ dard and multishift QR and LR algorithms, the Hamiltonian QR algorithm, divideÂandÂconquer algorithms such as the matrix sign function method, and many
Sketching, streaming, and sub-linear space algorithms
Reif, Rafael
Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) #12 algorithms are approximate · We assume worst-case input stream Adversaries do exist General algorithms Modular composition · Randomized algorithms OK (often necessary) Randomness in the algorithm
Code Generation on Steroids: Enhancing COTS Code Generators via Generative Aspects
Ryder, Barbara G.
Code Generation on Steroids: Enhancing COTS Code Generators via Generative Aspects Cody Henthorne tilevich@cs.vt.edu Abstract Commercial of-the-shelf (COTS) code generators have become an integral part of modern commercial software development. Programmers use code generators to facilitate many tedious
Discrimination of Unitary Transformations and Quantum Algorithms
David Collins
2008-11-09T23:59:59.000Z
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the sequence with others remaining fixed. For oracle query algorithms, the input determines the oracle unitary transformation. Such algorithms can be regarded as devices for discriminating amongst a set of unitary transformations. The question arises: "Given a set of known oracle unitary transformations, to what extent is it possible to discriminate amongst them?" We investigate this for the Deutsch-Jozsa problem. The task of discriminating amongst the admissible oracle unitary transformations results in an exhaustive collection of algorithms which can solve the problem with certainty.
Method and apparatus for generating low energy nuclear particles
Powell, James R. (Shoreham, NY); Reich, Morris (Flushing, NY); Ludewig, Hans (Brookhaven, NY); Todosow, Michael (Miller Place, NY)
1999-02-09T23:59:59.000Z
A particle accelerator (12) generates an input particle beam having an initial energy level above a threshold for generating secondary nuclear particles. A thin target (14) is rotated in the path of the input beam for undergoing nuclear reactions to generate the secondary particles and correspondingly decrease energy of the input beam to about the threshold. The target (14) produces low energy secondary particles and is effectively cooled by radiation and conduction. A neutron scatterer (44) and a neutron filter (42) are also used for preferentially degrading the secondary particles into a lower energy range if desired.
Method and apparatus for generating low energy nuclear particles
Powell, J.R.; Reich, M.; Ludewig, H.; Todosow, M.
1999-02-09T23:59:59.000Z
A particle accelerator generates an input particle beam having an initial energy level above a threshold for generating secondary nuclear particles. A thin target is rotated in the path of the input beam for undergoing nuclear reactions to generate the secondary particles and correspondingly decrease energy of the input beam to about the threshold. The target produces low energy secondary particles and is effectively cooled by radiation and conduction. A neutron scatterer and a neutron filter are also used for preferentially degrading the secondary particles into a lower energy range if desired. 18 figs.
Pulse compression in plasma: generation of femtosecond pulses without CPA
frequency laser beam into the energy of a short lowerfrequency laser pulse. The standard approach to generating highintensity ultrashort laser pulses is Chirped Pulse Amplification [1] (CPA), in which a laser Garching, Germany Abstract: Laser pulses can be e#ciently compressed to femto second duration when
Advancing Next-Generation Energy in Indian Country (Fact Sheet)
Not Available
2012-08-01T23:59:59.000Z
This fact sheet provides information on Tribes in the lower 48 states selected to receive assistance from the Strategic Technical Assistance Response Team (START) Program, a U.S. Department of Energy Office of Indian Energy Policy and Programs (DOE-IE) initiative to provide technical expertise to support the development of next-generation energy projects in Indian Country.
Nuclear Power Generating Facilities (Maine)
Broader source: Energy.gov [DOE]
The first subchapter of the statute concerning Nuclear Power Generating Facilities provides for direct citizen participation in the decision to construct any nuclear power generating facility in...
Volcanoes generate devastating waves
Lockridge, P. (National Geophysical Data Center, Boulder, CO (USA))
1988-01-01T23:59:59.000Z
Although volcanic eruptions can cause many frightening phenomena, it is often the power of the sea that causes many volcano-related deaths. This destruction comes from tsunamis (huge volcano-generated waves). Roughly one-fourth of the deaths occurring during volcanic eruptions have been the result of tsunamis. Moreover, a tsunami can transmit the volcano's energy to areas well outside the reach of the eruption itself. Some historic records are reviewed. Refined historical data are increasingly useful in predicting future events. The U.S. National Geophysical Data Center/World Data Center A for Solid Earth Geophysics has developed data bases to further tsunami research. These sets of data include marigrams (tide gage records), a wave-damage slide set, digital source data, descriptive material, and a tsunami wall map. A digital file contains information on methods of tsunami generation, location, and magnitude of generating earthquakes, tsunami size, event validity, and references. The data can be used to describe areas mot likely to generate tsunamis and the locations along shores that experience amplified effects from tsunamis.
Fourth generation bound states
Ishiwata, Koji; Wise, Mark B. [California Institute of Technology, Pasadena, California, 91125 (United States)
2011-04-01T23:59:59.000Z
We investigate the spectrum and wave functions of q{sup '}q{sup '} bound states for heavy fourth generation quarks (q{sup '}) that have a very small mixing with the three observed generations of standard model quarks. Such bound states come with different color, spin and flavor quantum numbers. Since the fourth generation Yukawa coupling, {lambda}{sub q}{sup '}, is large we include all perturbative corrections to the potential between the heavy quark and antiquark of order {lambda}{sub q}{sup '2}N{sub c}/16{pi}{sup 2} where N{sub c} is the number of colors, as well as relativistic corrections suppressed by (v/c){sup 2}. We find that the lightest fourth generation quark masses for which a bound state exists for color octet states. For the color singlet states, which always have a bound state, we analyze the influence that the Higgs couplings have on the size and binding energy of the bound states.
Treves, S.; Cheng, C.C.
1988-03-08T23:59:59.000Z
Potassium osmate, of the formula K[sub 2]OsO[sub 2](OH)[sub 4], is used to make a column for the generation of Ir-191 m, which is used in first pass angiography to detect cardiac defects in patients. 2 figs.
B. V. Vasiliev
2001-10-29T23:59:59.000Z
It is a current opinion that thermonuclear fusion is the main source of the star activity. It is shown below that this source is not unique. There is another electrostatic mechanism of the energy generation which accompanies thermonuclear fusion. Probably, this approach can solve the solar neutrino problem.
GENERATIVE AND DISCRIMINATIVE CLASSIFIERS
Baltes, Jacky
CHAPTER 1 GENERATIVE AND DISCRIMINATIVE CLASSIFIERS: NAIVE BAYES AND LOGISTIC REGRESSION Machine, or equivalently P(Y|X). To begin, we will assume Y is a boolean-valued random variable, and X is a vector) where ym represents the mth possible value for Y, and where the summation in the denominator is over all
GENERATIVE AND DISCRIMINATIVE CLASSIFIERS
Mitchell, Tom
CHAPTER 3 GENERATIVE AND DISCRIMINATIVE CLASSIFIERS: NAIVE BAYES AND LOGISTIC REGRESSION Machine, or equivalently P(Y|X). To begin, we will assume Y is a boolean-valued random variable, and X is a vector. Mitchell. 2 where ym denotes the mth possible value for Y, xk denotes the kth possible vector value for X
Generating Resources Advisory Committee
Generating Resources Advisory Committee May 28, 2014 Steve Simmons Gillian Charles #12;2 9:30 AM plants 10:45 AM Break 11:00 AM Peaking Technologies Continued... 11:30 AM Combined Cycle Combustion Turbine and Utility Scale Solar PV Reference plant updates Levelized cost of energy 12:00 PM Lunch
Generating Resources Advisory Committee
Generating Resources Advisory Committee February 27, 2014 Steven Simmons and Gillian Charles Upcoming Symposium 9:15 am Natural Gas Peaking Technologies Technology Trends Proposed reference plant Costing, Economies of Scale, Normalizations Reference Plants 12:30 pm Discussion of Next GRAC Meetings
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15T23:59:59.000Z
Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.
An improved spectral graph partitioning algorithm for mapping parallel computations
Hendrickson, B.; Leland, R.
1992-09-01T23:59:59.000Z
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.
On-Site Diesel Generation- How You Can Reduce Your Energy Costs
Charles, D.
Interruptible power rates, Utility special rate negotiations, and the emergence of a spot electrical power market all can lead to lower industrial energy costs. The installation of low cost on-site diesel powered generation, or the proposed...
On-Site Diesel Generation- How You Can Reduce Your Energy Costs
Charles, D.
1996-01-01T23:59:59.000Z
Interruptible power rates, Utility special rate negotiations, and the emergence of a spot electrical power market all can lead to lower industrial energy costs. The installation of low cost on-site diesel powered generation, or the proposed...
Chu, Shih-I
2015-01-01T23:59:59.000Z
PHYSICAL REVIEW A 91, 063408 (2015) Optimal control of high-order harmonics for the generation an efficient high-order-harmonic optimal control scheme for the generation of the ultrabroad supercontinuum NEWUOA (NEW Unconstrained Optimization Algorithm). For illustration, the high-order-harmonic generation
Electron heating using lower hybrid waves in the PLT tokamak
Bell, R.E.; Bernabei, S.; Cavallo, A.; Chu, T.K.; Luce, T.; Motley, R.; Ono, M.; Stevens, J.; von Goeler, S.
1987-06-01T23:59:59.000Z
Lower hybrid waves with a narrow high velocity wave spectrum have been used to achieve high central electron temperatures in a tokamak plasma. Waves with a frequency of 2.45 GHz launched by a 16-waveguide grill at a power level less than 600 kW were used to increase the central electron temperature of the PLT plasma from 2.2 keV to 5 keV. The magnitude of the temperature increase depends strongly on the phase difference between the waveguides and on the direction of the launched wave. A reduction in the central electron thermal diffusivity is associated with the peaked electron temperature profiles of lower hybrid current-driven plasmas. 16 refs.
GENERATION AND RANDOM GENERATION: FROM SIMPLE GROUPS TO MAXIMAL SUBGROUPS
Burness, Tim
GENERATION AND RANDOM GENERATION: FROM SIMPLE GROUPS TO MAXIMAL SUBGROUPS TIMOTHY C. BURNESS of generators for G. It is well known that d(G) = 2 for all (non-abelian) finite simple groups. We prove that d investigate the random generation of maximal subgroups of simple and almost simple groups. By applying
Chitinozoans in the subsurface Lower Paleozoic of West Texas
Kauffman, A. E.
1971-10-22T23:59:59.000Z
THE UNIVERSITY OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS October 22, 1971 Paper 54 CHITINOZOANS IN THE SUBSURFACE LOWER PALEOZOIC OF WEST TEXAS A. E. KAUFFMAN Humble Oil & Refining Company, Midland, Texas ABSTRACT Studies based on both comprehensive... are found throughout the West Texas area. As generally accepted by operational petroleum geologists, the Simpson Group comprises the Joins Formation (limestone and dolomite); Oil Creek Formation (sandstone, shale, and limestone); McLish Formation (sand...
Lower Colorado River Authority LCRA | Open Energy Information
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: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaPLawrence County, Pennsylvania: EnergyInformation Louisiana'sInformationLowell, Michigan:Lower
Nonlinear lower-hybrid oscillations in cold plasma
Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Calcutta 700 064 (India); Sengupta, Sudip [Institute of Plasma Research, Bhat, Gandhinagar 382428 (India)
2010-08-15T23:59:59.000Z
In a fluid description nonlinear lower-hybrid oscillation have been studied in a cold quasineutral magnetized plasma using Lagrangian variables. An exact analytical solution with nontrivial space and time dependence is obtained. The solution demonstrates that under well defined initial and boundary conditions the amplitude of the oscillations increases due to nonlinearity and then comes back to its initial condition again. These solutions indicate a class of nonlinear transient structures in magnetized plasma.
Lower Metal Enrichment of Virialized Gas in Minihalos
Renyue Cen; Mario A. Riquelme
2007-04-26T23:59:59.000Z
We differentiate between the metal enrichment of the gas in virialized minihalos and that of the intergalactic medium at high redshift, pertinent to cosmological reionization, with the initial expectation that gas in the high density regions within formed dark matter halos may be more robust thus resistant to mixing with lower density intergalactic medium. Using detailed hydrodynamic simulations of gas clouds in minihalos subject to destructive processes associated with the encompassing intergalactic shocks carrying metal-enriched gas, we find, as an example, that, for realistic shocks of velocities of 10-100km/s, more than (90%,65%) of the high density gas with rho>500 rhob inside a minihalo virialized at z=10 of mass (10^7,10^6)Msun remains at a metallicity lower than 3% of that of the intergalactic medium by redshift z=6. It may be expected that the high density gas in minihalos becomes fuel for subsequent star formation, when they are incorporated into larger halos where efficient atomic cooling can induce gas condensation hence star formation. Since minihalos virialize at high redshift when the universe is not expected to have been significantly reionized, the implication is that gas in virialized minihalos may provide an abundant reservoir of primordial gas to possibly allow for the formation of Population-III metal-free stars to extend to much lower redshift than otherwise expected based on the enrichment of intergalactic medium.
Lower Columbia River Terminal Fisheries Research Project : Final Environmental Assessment.
United States. Bonneville Power Administration.
1995-04-01T23:59:59.000Z
This notice announces BPA`S`s decision to fund the Oregon Department of Fish and Wildlife (ODFW), the Washington Department of Fish and Wildlife (WDFW), and the Clatsop Economic Development Committee for the Lower Columbia River Terminal Fisheries Research Project (Project). The Project will continue the testing of various species/stocks, rearing regimes, and harvest options for terminal fisheries, as a means to increase lower river sport and commercial harvest of hatchery fish, while providing both greater protection of weaker wild stocks and increasing the return of upriver salmon runs to potential Zone 6 Treaty fisheries. The Project involves relocating hatchery smolts to new, additional pen locations in three bays/sloughs in the lower Columbia River along both the Oregon and Washington sides. The sites are Blind Slough and Tongue Point in Clatsop County, Oregon, and Grays Bay/Deep River, Wahkiakum County, Washington. The smolts will be acclimated for various lengths of time in the net pens and released from these sites. The Project will expand upon an existing terminal fisheries project in Youngs Bay, Oregon. The Project may be expanded to other sites in the future, depending on the results of this initial expansion. BPA`S has determined the project is not a major Federal action significantly affecting the quality of the human environment, within the meaning of the National Environmental Policy Act (NEPA) of 1969. Therefore, the preparation of an environmental impact statement is not required, and BPA`S is issuing this FONSI.
Public policy implications of deepening the lower Mississippi
Cocchiara, J.G.
1983-11-01T23:59:59.000Z
The Mississippi River and its tributary system serves the industrial and agricultural heartland of the United States. In terms of total tonnage, the deep water channel of the lower Mississippi, stretching 253 miles from the Gulf of Mexico to Baton Rouge, is the largest port complex in the world. The vast majority of the cargo carried on the river is carried in bulk, a major portion of which could benefit from a deeper river channel. The Corps of Engineers has recommended a 55 foot channel to Baton Rouge, but the Reagan administration has insisted that the federal government will no longer fully fund such projects. In response, the State of Louisiana, under the direction of Governor David C. Treen, has conducted its own independent in-depth evaluation of providing deeper draft access to the lower Mississippi. A special task force established for this purpose recently concluded a year long investigation. On September 2, it issued a recommendation for a phased deepening project, at a significantly lower cost than the Corps recommended plan, in combination with private development of offshore topping-off facilities.
Environmental audit, Bonneville Power Administration, lower Columbia area
Not Available
1990-11-01T23:59:59.000Z
This report documents the results of the US Department of Energy's (DOE's) Environmental Audit conducted by the DOE Headquarters Office of Environmental Audit within the Bonneville Power Administration's (BPA's) Lower Columbia Area. The BPA facilities included in the Audit are the Ross Complex in Vancouver, Washington; the substations of North Bonneville, North Bonneville Annex, Camas, and Longview within the state of Washington; and the Acton and Troutdale Substations within the state of Oregon. The independent Audit was conducted by a team of professionals from DOE and contractors. The purpose of the Audit is to provide the Secretary of Energy, Admiral James D. Watkins, Ret., with the status of environmental programs within BPA's Lower Columbia Area. The Environmental Audit team identified 25 findings dealing with the lack of conformance with federal and state laws and regulations and DOE Orders, and 7 findings in which BMPs were not attained. Although all findings require corrective action, none required cessation of operations or reflect situations that present an immediate risk to public health or the environment. The Audit team noted inadequacies in PCB management included storage, labeling, reporting, and spill control. The most significant causal factors for the findings include lack of policy implementation throughout the Lower Columbia Area, inadequate training of personnel charged with environmental protection, lack of standard operating procedures for many programs, lack of reviews and appraisals, and an inaccurate perception of low risk for environmental concerns.
GASIFICATION FOR DISTRIBUTED GENERATION
Ronald C. Timpe; Michael D. Mann; Darren D. Schmidt
2000-05-01T23:59:59.000Z
A recent emphasis in gasification technology development has been directed toward reduced-scale gasifier systems for distributed generation at remote sites. The domestic distributed power generation market over the next decade is expected to be 5-6 gigawatts per year. The global increase is expected at 20 gigawatts over the next decade. The economics of gasification for distributed power generation are significantly improved when fuel transport is minimized. Until recently, gasification technology has been synonymous with coal conversion. Presently, however, interest centers on providing clean-burning fuel to remote sites that are not necessarily near coal supplies but have sufficient alternative carbonaceous material to feed a small gasifier. Gasifiers up to 50 MW are of current interest, with emphasis on those of 5-MW generating capacity. Internal combustion engines offer a more robust system for utilizing the fuel gas, while fuel cells and microturbines offer higher electric conversion efficiencies. The initial focus of this multiyear effort was on internal combustion engines and microturbines as more realistic near-term options for distributed generation. In this project, we studied emerging gasification technologies that can provide gas from regionally available feedstock as fuel to power generators under 30 MW in a distributed generation setting. Larger-scale gasification, primarily coal-fed, has been used commercially for more than 50 years to produce clean synthesis gas for the refining, chemical, and power industries. Commercial-scale gasification activities are under way at 113 sites in 22 countries in North and South America, Europe, Asia, Africa, and Australia, according to the Gasification Technologies Council. Gasification studies were carried out on alfalfa, black liquor (a high-sodium waste from the pulp industry), cow manure, and willow on the laboratory scale and on alfalfa, black liquor, and willow on the bench scale. Initial parametric tests evaluated through reactivity and product composition were carried out on thermogravimetric analysis (TGA) equipment. These tests were evaluated and then followed by bench-scale studies at 1123 K using an integrated bench-scale fluidized-bed gasifier (IBG) which can be operated in the semicontinuous batch mode. Products from tests were solid (ash), liquid (tar), and gas. Tar was separated on an open chromatographic column. Analysis of the gas product was carried out using on-line Fourier transform infrared spectroscopy (FT-IR). For selected tests, gas was collected periodically and analyzed using a refinery gas analyzer GC (gas chromatograph). The solid product was not extensively analyzed. This report is a part of a search into emerging gasification technologies that can provide power under 30 MW in a distributed generation setting. Larger-scale gasification has been used commercially for more than 50 years to produce clean synthesis gas for the refining, chemical, and power industries, and it is probable that scaled-down applications for use in remote areas will become viable. The appendix to this report contains a list, description, and sources of currently available gasification technologies that could be or are being commercially applied for distributed generation. This list was gathered from current sources and provides information about the supplier, the relative size range, and the status of the technology.
Advanced algorithms for information science
Argo, P.; Brislawn, C.; Fitzgerald, T.J.; Kelley, B.; Kim, W.H.; Mazieres, B.; Roeder, H.; Strottman, D.
1998-12-31T23:59:59.000Z
This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). In a modern information-controlled society the importance of fast computational algorithms facilitating data compression and image analysis cannot be overemphasized. Feature extraction and pattern recognition are key to many LANL projects and the same types of dimensionality reduction and compression used in source coding are also applicable to image understanding. The authors have begun developing wavelet coding which decomposes data into different length-scale and frequency bands. New transform-based source-coding techniques offer potential for achieving better, combined source-channel coding performance by using joint-optimization techniques. They initiated work on a system that compresses the video stream in real time, and which also takes the additional step of analyzing the video stream concurrently. By using object-based compression schemes (where an object is an identifiable feature of the video signal, repeatable in time or space), they believe that the analysis is directly related to the efficiency of the compression.
Statistical algorithms in the study of mammalian DNA methylation
Singer, Meromit
2012-01-01T23:59:59.000Z
non-overlapping CCGIs: the algorithm 2.2.6 Running time andI Statistical algorithms in the study of mammalian DNAof the result of the CCGI algorithm. Nodes marked along the
Two Strategies to Speed up Connected Component Labeling Algorithms
Wu, Kesheng; Otoo, Ekow; Suzuki, Kenji
2008-01-01T23:59:59.000Z
but not linear set union algorithm,” J. ACM, vol. 22, no. 2,analysis of set union algorithms,” J. ACM, vol. 31, no. 2,An improved equivalence algorithm,” Commun. ACM, vol. 7, no.