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-21
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.
IEEE TRANSACTIONS ON COMMUNICATIONS 1 An Efficient Algorithmic Lower Bound for the
Wehlau, David
IEEE TRANSACTIONS ON COMMUNICATIONS 1 An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes Firouz Behnamfar, Member, IEEE, Fady Alajaji, Senior Member, IEEE, and Tam´as Linder, Senior Member, IEEE Abstract We present an efficient algorithmic lower bound for the block error rate
Parameterized algorithms and computational lower bounds: a structural approach
Xia, Ge
2006-10-30
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 ...
Obtaining Lower Bounds from the Progressive Hedging Algorithm ...
2014-01-21
Oct 11, 2013 ... Energy Network Integration (GENI) program, and by the Department of Energy's Office ... sizing [18], electricity generation unit commitment [32], supply chain design ...... Ela, E., Milligan, M., O'Malley, M.: A flexible power system operations simulation model ... etration in a transmission constrained network.
Detecting Networks Employing Algorithmically Generated Domain Names
Ashwath Kumar Krishna Reddy
2011-10-21
, current botnets use simple pseudo-random generators which may not preserve the distribution of alphabets or bigrams (two consecutive alphabets) as usually occur in legitimate domain name strings. In this regards, we propose several metrics to classify a... generates. For instance, in the extreme scenario that a botnet generates 50 domains mapped to the same TLD, we show that KL-divergence over unigrams achieves 100% detection accuracy albeit at 15% false positive rate (legitimate domain groups clas- 7 si ed...
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 ...
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
A Fast Algorithm To Generate Open Meandric Systems and Meanders
Sawada, Joe
can be thought of as the system formed by an infinite river running from northwest to east which optimization steps to yield the first fast and simple algorithm to generate open meanders. Categories analogy of a road with 6 bridges and a meandering river. (b)(a) Fig. 2. a) Example of an open meandric
Asymptotic, Algorithmic and Geometric Aspects of Groups Generated by Automata
Savchuk, Dmytro M.
2010-01-14
: 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...
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
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
Effects of a potential fourth fermion generation on the upper and lower Higgs boson mass bounds
Philipp Gerhold; Karl Jansen; Jim Kallarackal
2010-10-28
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.
Adaptive Control of Third Harmonic Generation via Genetic Algorithm
Hua, Xia
2010-10-12
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 bluenoise 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 bluenoise threshold
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-01
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 ...
Gupta, Satyandra K.
. Algorithms for generating multi-stage molding plans for articulated assemblies. Robotics and Computer-STAGE MOLDING PLANS FOR ARTICULATED ASSEMBLIES Alok K. Priyadarshi Satyandra K. Gupta August 31, 2007 Abstract Multi-stage molding is capable of producing better-quality articulated products at a lower cost. Dur
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
Chertkov, Michael; Pan, Feng; Baldick, Ross
2011-01-01
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-17
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..
that by defining the cost function in different ways, we can mimic various well-known algorithms for the generationA Meta-Algorithm for the Generation of Referring Expressions Emiel Krahmer, Sebastiaan van Erk.J.Krahmer@tue.nl Abstract This paper describes a new approach to the generation of referring expres- sions. We propose
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 power system. Being able to operate in both grid-connected and islanded mode, a microgrid manages and controls distributed energy resources, energy storage systems and loads, most of them are power electronic
Paris-Sud XI, Université de
A 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-NNR, reversed polarity fault, diagnosis, prognosis. NOMENCLATURE PV = Photovoltaic; SVM = Support Vector
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
Implications of Lower Natural Gas Prices for Electric Generators in the Southeast, The
Reports and Publications (EIA)
2009-01-01
This supplement to the Energy Information Administration's (EIA) May 2009 Short-Term Energy Outlook (STEO) focuses on changes in the utilization of coal- and natural-gas-fired generation capacity in the electric utility sector as the differential between delivered fuel prices narrows.
NWTC Aerodynamics Studies Improve Energy Capture and Lower Costs of Wind-Generated Electricity
2015-08-01
Researchers at the National Wind Technology Center (NWTC) at the National Renewable Energy Laboratory (NREL) have expanded wind turbine aerodynamic research from blade and rotor aerodynamics to wind plant and atmospheric inflow effects. The energy capture from wind plants is dependent on all of these aerodynamic interactions. Research at the NWTC is crucial to understanding how wind turbines function in large, multiple-row wind plants. These conditions impact the cumulative fatigue damage of turbine structural components that ultimately effect the useful lifetime of wind turbines. This work also is essential for understanding and maximizing turbine and wind plant energy production. Both turbine lifetime and wind plant energy production are key determinants of the cost of wind-generated electricity.
Chu, Xi
Optimization of high-order harmonic generation by genetic algorithm and wavelet time laser fields by means of the genetic algorithm optimization of the laser-pulse amplitude and phase optimization 11 of the laser-pulse shape and intra-atomic phase matching. We show that by combining the GA
A comparison and case study of capacity credit algorithms for intermittent generators
Milligan, M.
1997-03-01
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.
Pedram, Massoud
A Hierarchical Control Algorithm for Managing Electrical Energy Storage Systems in Homes Equipped with PV Power Generation Yanzhi Wang, Siyu Yue, and Massoud Pedram Department of Electrical Engineering}@sharplabs.com Abstract-- Integrating residential-level photovoltaic (PV) power generation and energy storage systems
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-15
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.
Lewis, Robert Michael (College of William and Mary, Williamsburg, VA); Torczon, Virginia Joanne (College of William and Mary, Williamsburg, VA); Kolda, Tamara Gibson
2006-08-01
We consider the solution of nonlinear programs in the case where derivatives of the objective function and nonlinear constraints are unavailable. To solve such problems, we propose an adaptation of a method due to Conn, Gould, Sartenaer, and Toint that proceeds by approximately minimizing a succession of linearly constrained augmented Lagrangians. Our modification is to use a derivative-free generating set direct search algorithm to solve the linearly constrained subproblems. The stopping criterion proposed by Conn, Gould, Sartenaer and Toint for the approximate solution of the subproblems requires explicit knowledge of derivatives. Such information is presumed absent in the generating set search method we employ. Instead, we show that stationarity results for linearly constrained generating set search methods provide a derivative-free stopping criterion, based on a step-length control parameter, that is sufficient to preserve the convergence properties of the original augmented Lagrangian algorithm.
Burger, Eric M.; Moura, Scott J.
2015-01-01
5 minute ahead forecasts of wind and solar generationUsing actual wind and solar generation forecasts, ambientCalifornia ISO Wind and Solar Generation 5-Min Forecasts for
Burger, Eric M.; Moura, Scott J.
2015-01-01
We present 5-minute wind and solar power forecasts reported6 presents the wind and solar power generation for theimpacts of wind generation on california power systems,”
slowly driving the generator while flying fast in a crosswind direction. To achieve a periodic power
Man-portable power generation devices : product design and supporting algorithms
Mitsos, Alexander
2006-01-01
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 ...
Man-Portable Power Generation Devices: Product Design and Supporting Algorithms
and operation of microfabricated fuel cell sys- tems is proposed and algorithms for relevant optimization here. Microfabricated fuel cell systems are a promising alternative to batteries for man- portable for the degree of Doctor of Philosophy in Chemical Engineering Abstract A methodology for the optimal design
200 kHz Commercial Sonar Systems Generate Lower Frequency Side Lobes Audible to Some Marine Mammals
Deng, Zhiqun; Southall, Brandon; Carlson, Thomas J.; Xu, Jinshan; Martinez, Jayson J.; Weiland, Mark A.; Ingraham, John M.
2014-04-15
The spectral properties of pulses transmitted by three commercially available 200 kHz echo sounders were measured to assess the possibility that sound energy in below the center (carrier) frequency might be heard by marine mammals. The study found that all three sounders generated sound at frequencies below the center frequency and within the hearing range of some marine mammals and that this sound was likely detectable by the animals over limited ranges. However, at standard operating source levels for the sounders, the sound below the center frequency was well below potentially harmful levels. It was concluded that the sounds generated by the sounders could affect the behavior of marine mammals within fairly close proximity to the sources and that that the blanket exclusion of echo sounders from environmental impact analysis based solely on the center frequency output in relation to the range of marine mammal hearing should be reconsidered.
Sorokine, Alexandre; Schlicher, Bob G; Ward, Richard C; Wright, Michael C; Kruse, Kara L
2015-01-01
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-25
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.
Coplan, Kevin P.
1984-01-01
An algorithm is presented for game-tree searching that is shown under fairly general but formally specifiable conditions to be more sparing of computational resource than classical alpha-beta minimax. The algorithm was ...
Barranco, Bernabe Linares
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 17, NO. 3, MAY 2006 771 On Algorithmic Rate-Coded AER of frames into the spike event-based representation known as the address-event-rep- resentation (AER). In this paper we concentrate on rate-coded AER. The problem is addressed as an algorithmic problem, in which
Lapa, Celso M.F.; Pereira, Claudio M.N.A. [CNEN, Comissao Nacional de Energia Nuclear, Rua General Severiano 90, Rio de Janeiro, RJ-22-294-900 (Brazil); Frutuoso e Melo, P.F. [COPPE/UFRJ, Cidade Universitaria, Centro de Tecnologia, Bloco G, sala 101, Ilha do Fundao, 21945-970, Rio de Janeiro - RJ (Brazil)
2002-07-01
Nuclear standby safety systems must frequently, be submitted to periodic surveillance tests. The main reason is to detect, as soon as possible, the occurrence of unrevealed failure states. Such interventions may, however, affect the overall system availability due to component outages. Besides, as the components are demanded, deterioration by aging may occur, penalizing again the system performance. By these reasons, planning a good surveillance test policy implies in a trade-off between gains and overheads due to the surveillance test interventions. In order maximize the systems average availability during a given period of time, it has recently been developed a non-periodic surveillance test optimization methodology based on genetic algorithms (GA). The fact of allowing non-periodic tests turns the solution space much more flexible and schedules can be better adjusted, providing gains in the overall system average availability, when compared to those obtained by an optimized periodic tests scheme. The optimization problem becomes, however, more complex. Hence, the use of a powerful optimization technique, such as GAs, is required. Some particular features of certain systems can turn it advisable to introduce other specific constraints in the optimization problem. The Emergency Diesel Generation System (EDGS) of a Nuclear Power Plant (N-PP) is a good example for demonstrating the introduction of seasonal constraints in the optimization problem. This system is responsible for power supply during an external blackout. Therefore, it is desirable during periods of high blackout probability to maintain the system availability as high as possible. Previous applications have demonstrated the robustness and effectiveness of the methodology. However, no seasonal constraints have ever been imposed. This work aims at investigating the application of such methodology in the Angra-II Brazilian NPP EDGS surveillance test policy optimization, considering the blackout probability growth during summer, due to the electrical power demand increase. Here, the model used penalizes test interventions by a continuous modulating function, which depends on the instantaneous blackout probability. Results have demonstrated the ability of the method in adapting the surveillance tests policy to seasonal behaviors. The knowledge acquired by the GA during the searching process has lead to test schedules that drastically minimize the test interventions at periods of high blackout probability. It is compensated by more frequent tests redistributed through the periods of low blackout probability, in order to provide improvement on the overall average availability at the system level. (authors)
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-01
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-21
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.
Algorithms Demands and Bounds Applications of Flow
Kabanets, Valentine
2/28/2014 1 Algorithms Demands and Bounds Applications of Flow Networks Design and Analysis of Algorithms Andrei Bulatov Algorithms Demands and Bounds 12-2 Lower Bounds The problem can be generalized) capacities (ii) demands (iii) lower bounds A circulation f is feasible if (Capacity condition) For each e E
Michele Mosca
2008-08-04
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.
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
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-02
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.
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
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
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10
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.
Lower Bounds and Exact Algorithms for the Quadratic Minimum ...
2013-12-16
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.
Topics in Approximation Algorithms
Khare, Monik
2012-01-01
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
Energy Department Announces $25 Million to Lower Cost of Concentrating...
Broader source: Energy.gov (indexed) [DOE]
clean and renewable energy, even at night, by storing the heat generated by the sun. "Investments to improve the efficiency and lower the costs of concentrating solar...
Nikolova, Evdokia Velinova
2009-01-01
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 ...
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23
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.
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01
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-01
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-01
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Lower hybrid wavepacket stochasticity revisited
Fuchs, V.; Krlín, L.; Pánek, R.; Preinhaelter, J.; Seidl, J.; Urban, J.
2014-02-12
Analysis is presented in support of the explanation in Ref. [1] for the observation of relativistic electrons during Lower Hybrid (LH) operation in EC pre-heated plasma at the WEGA stellarator [1,2]. LH power from the WEGA TE11 circular waveguide, 9 cm diameter, un-phased, 2.45 GHz antenna, is radiated into a B?0.5 T, Ðœ„n{sub e}?5×10{sup 17} 1/m{sup 3} plasma at T{sub e}?10 eV bulk temperature with an EC generated 50 keV component [1]. The fast electrons cycle around flux or drift surfaces with few collisions, sufficient for randomizing phases but insufficient for slowing fast electrons down, and thus repeatedly interact with the rf field close to the antenna mouth, gaining energy in the process. Our antenna calculations reveal a standing electric field pattern at the antenna mouth, with which we formulate the electron dynamics via a relativistic Hamiltonian. A simple approximation of the equations of motion leads to a relativistic generalization of the area-preserving Fermi-Ulam (F-U) map [3], allowing phase-space global stochasticity analysis. At typical WEGA plasma and antenna conditions, the F-U map predicts an LH driven current of about 230 A, at about 225 W of dissipated power, in good agreement with the measurements and analysis reported in [1].
Algorithms for builder guidelines
Balcomb, J.D.; Lekov, A.B.
1989-06-01
The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.
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...
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
Statistical weaknesses in the alleged RC4 keystream generator Marina Pudovkina
International Association for Cryptologic Research (IACR)
1 Statistical weaknesses in the alleged RC4 keystream generator Marina Pudovkina Moscow Engineering RC4 keystream generator is an algorithm for generating an arbitrarily long pseudorandom sequences
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
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
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
Improved Sampling Algorithms in Lattice QCD
Gambhir, Arjun Singh
2015-01-01
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-19
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.
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-01
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.
Automatic toilet seat lowering apparatus
Guerty, Harold G. (Palm Beach Gardens, FL)
1994-09-06
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.
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-14
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
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
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
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
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
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
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
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 ...
Algorithms for strategic agents
Weinberg, S. Matthew (Seth Matthew)
2014-01-01
In traditional algorithm design, no incentives come into play: the input is given, and your algorithm must produce a correct output. How much harder is it to solve the same problem when the input is not given directly, but ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01
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-01
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
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Catalyst for producing lower alcohols
Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)
1987-01-01
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.
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
Oxygen enhanced switching to combustion of lower rank fuels
Kobayashi, Hisashi; Bool, III, Lawrence E.; Wu, Kuang Tsai
2004-03-02
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.
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07
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).
A family of lowered isothermal models
Gieles, Mark
2015-01-01
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.
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
Lower Sioux Wind Feasibility & Development
Minkel, Darin
2012-04-01
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.
2012-03-16
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.
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
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Electricity, US Data. 6. Distributed Generation: Standby Generation and Cogeneration Ozz Energy Solutions, Inc. February 28 th , 2005. For more information about...
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
Savings Project: Lower Water Heating Temperature | Department...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings 12-30 annually for each 10F...
Radar deception through phantom track generation
Maithripala, Diyogu Hennadige Asanka
2006-04-12
This thesis presents a control algorithm to be used by a team of ECAVs (Electronic Combat Air Vehicle) to deceive a network of radars through the generation of a phantom track. Each ECAV has the electronic capability of ...
FDD Algorithm for an AHU Reverse-Return System
Djuric, N.; Novakovic, V.
2008-01-01
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...
Reliability assessment of electrical power systems using genetic algorithms
Samaan, Nader Amin Aziz
2004-11-15
The first part of this dissertation presents an innovative method for the assessment of generation system reliability. In this method, genetic algorithm (GA) is used as a search tool to truncate the probability state space ...
Span Programs, Electrical Flows, and Beyond: New Approaches to Quantum Algorithms
Wang, Guoming
2014-01-01
4 Electrical Flows and Quantum Algorithms 4.14.3 Electrical Flows and EffectiveResistances . 4.7 Generating Electrical Flows as Quantum
Status of dynamical ensemble generation
Chulwoo Jung
2010-01-06
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.
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01
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
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01
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 ...
Optimized Algorithms Boost Combustion Research
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Optimized Algorithms Boost Combustion Research Optimized Algorithms Boost Combustion Research Methane Flame Simulations Run 6x Faster on NERSC's Hopper Supercomputer November 25,...
Leemis, Larry
Variate Generation for Accelerated Life and Proportional Hazards Models with Time Dependent, Monte Carlo simulation, Proportional hazards model, Time dependent covariates, Variate generation. #12 Engineering 202 West Boyd, Room 124 Norman, OK 73019 September, 1989 SUMMARY Variate generation algorithms
A New Statistical Distinguisher for the Shrinking Generator
International Association for Cryptologic Research (IACR)
A New Statistical Distinguisher for the Shrinking Generator Jovan Dj. Goli#19;c and Renato Menicocci Abstract The shrinking generator is a well-known keystream generator composed of two linear for keystream generators are algorithms whose objective is to distinguish the keystream sequence from a purely
Winter Energy Savings from Lower Thermostat Settings
Reports and Publications (EIA)
2000-01-01
This discussion provides details on the effect of lowering thermostat settings during the winter heating months of 1997.
MANAGEMENT OF AGRICULTURAL WASTES LOWER FRASER VALLEY
#12;MANAGEMENT OF AGRICULTURAL WASTES IN THE LOWER FRASER VALLEY SUMMARY REPORT - A WORKING DOCUMENT Presented on Behalf of: The Management of Agricultural Wastes in the Lower Fraser Valley Program of the Agricultural Nutrient Management in the Lower Fraser Valley program. The ideas and opinions expressed herein do
Nagurney, Anna
Transformation, Appears in Transportation Research D 11, 171-190. Dmytro Matsypura Electric Power Supply Chain Markets Transmission Service Providers Power SupplIntroduction The Model The Algorithm Modeling of Electric Power Supply Chain Networks with Fuel
Generating Particlelike Scattering States in Wave Transport
Rotter, Stefan
Generating Particlelike Scattering States in Wave Transport Philipp Ambichl1, Florian Libisch1.ambichl@tuwien.ac.at Algorithm to Generate Particlelike States1 Results of Numerical Simulation References Generic Scattering in general · wave spreads over entire resonator · no secure and efficient communication between A and B
An algorithm for constrained one-step inversion of spectral CT data
Barber, Rina Foygel; Schmidt, Taly Gilat; Pan, Xiaochuan
2015-01-01
We develop a primal-dual algorithm that allows for one-step inversion of spectral CT transmission photon counts data to a basis map decomposition. The algorithm allows for image constraints to be enforced on the basis maps during the inversion. The derivation of the algorithm makes use of a local upper bounding quadratic approximation to generate descent steps for non-convex spectral CT data discrepancy terms, combined with a new convex-concave optimization algorithm. Convergence of the algorithm is demonstrated on simulated spectral CT data. Simulations with noise and anthropomorphic phantoms show examples of how to employ the constrained one-step algorithm for spectral CT data.
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
A lower bound for the tree-width of planar graphs with vital linkages
Adler, Isolde
A lower bound for the tree-width of planar graphs with vital linkages Isolde Adler, Philipp Klaus implementable. The algorithm uses a bound on the tree- width of graphs with vital linkages, and deletion with vital linkages, and for the size of the grid necessary for finding irrelevant vertices. 1 Introduction
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
A background correction algorithm for Van Allen Probes MagEIS electron flux measurements
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.; Reeves, G. D.; Friedel, R. H. W.; Henderson, M. G.; Larsen, B. A.
2015-07-14
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 energy channels at roughly L < 2.5. The background-corrected MagEIS electron data produce a more accurate measurement of the electron radiation belts, as most earlier measurements suffer from unquantifiable and uncorrectable contamination in this harsh region of the near-Earth space environment. These background-corrected data will also be useful for spacecraft engineering purposes, providing ground truth for the near-Earth electron environment and informing the next generation of spacecraft design models (e.g., AE9).
Thermoacoustic magnetohydrodynamic electrical generator
Wheatley, J.C.; Swift, G.W.; Migliori, A.
1984-11-16
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-01
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.
New Effective Multithreaded Matching Algorithms
Manne, Fredrik; Halappanavar, Mahantesh
2014-05-19
Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.
Distributed Sustainable Generation Dispatch via Evolutionary Games
Kundur, Deepa
and solar panels are sustainable but unreliable as these have inherently variable generation capacities The power grid is composed of a diverse mix of energy generation systems designed to provision for all types such as wind and solar power generators are green en- ergy sources with lower levelized costs [4
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
Next Generation Radioisotope Generators | Department of Energy
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Generators Next Generation Radioisotope Generators Advanced Stirling Radioisotope Generator (ASRG) - The ASRG is currently being developed as a high-efficiency RPS technology...
Ricci, Laura
Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms EpidemicD in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01
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.
Displacing Natural Gas Consumption and Lowering Emissions
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
for Refinery and Chemical Plant Process Heaters ADVANCED MANUFACTURING OFFICE Displacing Natural Gas Consumption and Lowering Emissions By enabling process heaters to utilize...
Savings Project: Lower Water Heating Temperature | Department...
Broader source: Energy.gov (indexed) [DOE]
Thermostats Savings Project: Lower Water Heating Temperature Tips: Passive Solar Heating and Cooling Where to insulate. Adding insulation in the areas shown here may be...
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
A known plaintext attack on the ISAAC keystream generator Marina Pudovkina
International Association for Cryptologic Research (IACR)
1 A known plaintext attack on the ISAAC keystream generator Marina Pudovkina maripa are a requirement. The ISAAC keystream generator is a fast software-oriented encryption algorithm. In this papers the security of the ISAAC keystream generator is investigated. Cryptanalytic algorithm is developed for a known
A known plaintext attack on the ISAAC keystream generator Marina Pudovkina
International Association for Cryptologic Research (IACR)
1 A known plaintext attack on the ISAAC keystream generator Marina Pudovkina maripa are a requirement. The ISAAC keystream generator is a fast softwareÂoriented encryption algorithm. In this papers the security of the ISAAC keystream generator is investigated. Cryptanalytic algorithm is developed for a known
Disentangling Clustering Effects in Jet Algorithms
Randall Kelley; Jonathan R. Walsh; Saba Zuberi
2012-04-04
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.
An efficient parallel algorithm for matrix-vector multiplication
Hendrickson, B.; Leland, R.; Plimpton, S.
1993-03-01
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.
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
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02
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.
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-10
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
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01
in the Human Genome Project(HGP) 1 . However, because Sangerprohibitive. In the case of HGP, it took more than 13 years
The Automatic Generation of Mutation Operators for Genetic Algorithms
Woodward, John
of Computing Science and Mathematics School of Natural Sciences, University of Stirling, Stirling FK9 4LA class. Engineering design is an intrinsically multi-dimensional activity, where the dimensions might
Pre-processing Techniques For Anytime Coalition Structure Generation Algorithms
McBurney, Peter
, Andrew Dowell, Peter McBurney and Michael Wooldridge Department of Computer Science, The University
Generation of Simulated Wind Data using an Intelligent Algorithm...
Office of Scientific and Technical Information (OSTI)
Renewable Energy Laboratory (NREL), Golden, CO. Sponsoring Org: USDOE Office of Energy Efficiency and Renewable Energy Wind Power Technologies Office Country of Publication:...
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
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
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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfate Reducing(Journal Article) |productionPatent:Compression (Journal Article) | SciTech(Conference)
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Powell, Warren B.
wind supply, demand and electricity prices may evolve stochastically. We found that the algorithm and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We use received significant attention as a way to increase the efficiency of the electrical grid by smoothing
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
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
NC machine tool path generation from CSG part
Bobrow, James E.
NC machine tool path generation from CSG part representations James E Bobrow Recent improvements for machine tool path generation. Current machining algorithms require that any port geometric information modelling system is used. Thispaper presents o method for generating numerically-controlled milling machine
Reducing the Cost of Generating APH-distributed Random Numbers
Telek, Miklós
Reducing the Cost of Generating APH-distributed Random Numbers Philipp Reinecke1 , Mikl´os Telek2 from PH distributions and propose two algorithms for reducing the cost associated with generating representation that minimises the cost associated with generating random numbers. In this paper we study
The optimization problem Genetic Algorithm
Giménez, Domingo
The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
Waste Heat Recovery Power Generation with WOWGen
Romero, M.
2009-01-01
WOW operates in the energy efficiency field- one of the fastest growing energy sectors in the world today. The two key products - WOWGen® and WOWClean® provide more energy at cheaper cost and lower emissions. •WOWGen® - Power Generation from...
CERTIFICATION REGARDING LOBBYING LOWER TIER COVERED TRANSACTIONS
Kurapov, Alexander
, or an employee of a Member of Congress in connection with this commitment providing for the United StatesCERTIFICATION REGARDING LOBBYING LOWER TIER COVERED TRANSACTIONS Applicants should review
Lower Saccharide Nanometric Materials and Methods
Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek
2004-07-13
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.
Capturing Waste Gas: Saves Energy, Lower Costs
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Capturing Waste Gas: Saves Energy, Lowers Costs ArcelorMittal's Indiana Harbor plant in East Chicago, Indiana, is the largest steel mill in the Western Hemisphere. It operates five...
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
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02
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.
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23
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
Project Profile: Next-Generation Parabolic Trough Collectors...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
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...
Next-Generation Wind Technology | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
and reliability of next-generation wind technologies while lowering the cost of wind energy. The program's research efforts have helped to increase the average capacity...
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-01
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.
A new generation of load sharing algorithms: the semi-adaptive load sharing algorithm
Morsy, Hazem Kamal
1997-01-01
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...
A Flexible Integrated Architecture For Generating Poetic Texts
Manurung, Hisar; Ritchie, Graeme; Thompson, Henry
2000-01-01
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, ...
Srinivasan-Rao, Triveni (Shoreham, NY)
2002-01-01
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.
Donchev, Todor I. (Urbana, IL); Petrov, Ivan G. (Champaign, IL)
2011-05-31
Described herein is an apparatus and a method for producing atom clusters based on a gas discharge within a hollow cathode. The hollow cathode includes one or more walls. The one or more walls define a sputtering chamber within the hollow cathode and include a material to be sputtered. A hollow anode is positioned at an end of the sputtering chamber, and atom clusters are formed when a gas discharge is generated between the hollow anode and the hollow cathode.
Foster, Jr., John S. (Pleasanton, CA); Wilson, James R. (Livermore, CA); McDonald, Jr., Charles A. (Danville, CA)
1983-01-01
1. In an electrical energy generator, the combination comprising a first elongated annular electrical current conductor having at least one bare surface extending longitudinally and facing radially inwards therein, a second elongated annular electrical current conductor disposed coaxially within said first conductor and having an outer bare surface area extending longitudinally and facing said bare surface of said first conductor, the contiguous coaxial areas of said first and second conductors defining an inductive element, means for applying an electrical current to at least one of said conductors for generating a magnetic field encompassing said inductive element, and explosive charge means disposed concentrically with respect to said conductors including at least the area of said inductive element, said explosive charge means including means disposed to initiate an explosive wave front in said explosive advancing longitudinally along said inductive element, said wave front being effective to progressively deform at least one of said conductors to bring said bare surfaces thereof into electrically conductive contact to progressively reduce the inductance of the inductive element defined by said conductors and transferring explosive energy to said magnetic field effective to generate an electrical potential between undeformed portions of said conductors ahead of said explosive wave front.
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
Monitoring and Commissioning Verification Algorithms for CHP Systems
Brambley, Michael R.; Katipamula, Srinivas; Jiang, Wei
2008-03-31
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.
Baijal, Anant; Jayabarathi, T
2011-01-01
This paper illustrates successful implementation of three evolutionary algorithms, namely- Particle Swarm Optimization(PSO), Artificial Bee Colony (ABC) and Bacterial Foraging Optimization (BFO) algorithms to economic load dispatch problem (ELD). Power output of each generating unit and optimum fuel cost obtained using all three algorithms have been compared. The results obtained show that ABC and BFO algorithms converge to optimal fuel cost with reduced computational time when compared to PSO for the two example problems considered.
QCD Jet Rates with the Inclusive Generalized kt Algorithms
Erik Gerwick; Ben Gripaios; Steffen Schumann; Bryan Webber
2013-04-15
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.
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
Heuristic Algorithm for Coordinating Smart Houses in MicroGrid.
Zito, Michele
Heuristic Algorithm for Coordinating Smart Houses in MicroGrid. Mohamed Arikiez 1 , Floriana Grasso connected in a micro- grid configuration. The micro-grid consists of houses and local renewable plants, each, power generation, and smart appliances [4]. Smart micro-grids [5] can be defined as a set of houses
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
SEXUAL SELECTION WITH COMPETITIVE/COOPERATIVE OPERATORS FOR GENETIC ALGORITHMS
Bullinaria, John
of Evolutionary Computation. Although GAs were conceived by modelling key elements of natural evolution, one, both in number of generations required and in the quality of solutions. KEY WORDS Genetic Algorithms]. Through gender came the developing of sexual selec tion, a component of natural selection where
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
Supplying Renewable Energy to Deferrable Loads: Algorithms and Economic Analysis
Oren, Shmuel S.
Supplying Renewable Energy to Deferrable Loads: Algorithms and Economic Analysis Anthony compares to price responsive demand in terms capacity gains and energy market revenues for renewable to renewable generation. I. INTRODUCTION Renewable power is emerging as a mainstream source of energy supply
Algorithm-Based Fault Tolerance for Fail-Stop Failures
Dongarra, Jack
after failures, the next generation high performance computing applications need to be able to continue1 Algorithm-Based Fault Tolerance for Fail-Stop Failures Zizhong Chen and Jack Dongarra Abstract Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging
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
A FLUID-CELL INTERACTION AND ADHESION ALGORITHM FOR TISSUE-COATING OF CARDIOVASCULAR IMPLANTS
Canic, Suncica
A FLUID-CELL INTERACTION AND ADHESION ALGORITHM FOR TISSUE-COATING OF CARDIOVASCULAR IMPLANTS JIAN. In this manuscript we develop a fluid-cell interaction and adhesion algorithm applied to modeling the cell coating parameters and adhesion parameters on the generation of a stable and strong tissue coating of artificial
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-18
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 \
Control, estimation, and planning algorithms for aggressive flight using onboard sensing
Bry, Adam Parker
2012-01-01
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 ...
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01
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.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08
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.
Distributed Algorithms for Optimal Power Flow Problem
Lam, Albert Y S; Tse, David
2011-01-01
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...
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06
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-28
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.
An algorithmic implementation of the Pi function based on a new sieve
Damian Gulich; Gustavo Funes; Nahuel Lofeudo; Leopoldo Garavaglia; Mario Garavaglia
2008-10-07
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)$.
Wu, L; Huang, B; Rowedder, B; Ma, B; Kuang, Y
2014-06-15
Purpose: The Smart leaf motion calculator (SLMC) in Eclipse treatment planning system is an advanced fluence delivery modeling algorithm as it takes into account fine MLC features including inter-leaf leakage, rounded leaf tips, non-uniform leaf thickness, and the spindle cavity etc. In this study, SLMC and traditional Varian LMC (VLMC) algorithms were investigated, for the first time, in dosimetric characteristics and delivery accuracy of sliding window (SW) IMRT. Methods: The SW IMRT plans of 51 cancer cases were included to evaluate dosimetric characteristics and dose delivery accuracy from leaf motion calculated by SLMC and VLMC, respectively. All plans were delivered using a Varian TrueBeam Linac. The DVH and MUs of the plans were analyzed. Three patient specific QA tools - independent dose calculation software IMSure, Delta4 phantom, and EPID portal dosimetry were also used to measure the delivered dose distribution. Results: Significant differences in the MUs were observed between the two LMCs (p?0.001).Gamma analysis shows an excellent agreement between the planned dose distribution calculated by both LMC algorithms and delivered dose distribution measured by three QA tools in all plans at 3%/3 mm, leading to a mean pass rate exceeding 97%. The mean fraction of pixels with gamma < 1 of SLMC is slightly lower than that of VLMC in the IMSure and Delta4 results, but higher in portal dosimetry (the highest spatial resolution), especially in complex cases such as nasopharynx. Conclusion: The study suggests that the two LMCs generates the similar target coverage and sparing patterns of critical structures. However, SLMC is modestly more accurate than VLMC in modeling advanced MLC features, which may lead to a more accurate dose delivery in SW IMRT. Current clinical QA tools might not be specific enough to differentiate the dosimetric discrepancies at the millimeter level calculated by these two LMC algorithms. NIH/NIGMS grant U54 GM104944, Lincy Endowed Assistant Professorship.
Prime number generation and factor elimination
Vineet Kumar
2014-10-06
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.
Downhole hydraulic seismic generator
Gregory, Danny L. (Corrales, NM); Hardee, Harry C. (Albuquerque, NM); Smallwood, David O. (Albuquerque, NM)
1992-01-01
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.
A bridge to lower overhead quantum computation
Austin G. Fowler; Simon J. Devitt
2013-04-09
Two primary challenges stand in the way of practical large-scale quantum computation, namely achieving sufficiently low error rate quantum gates and implementing interesting quantum algorithms with a physically reasonable number of qubits. In this work we address the second challenge, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code. The surface code has a number of highly desirable properties, including the ability to achieve arbitrarily reliable computation given sufficient qubits and quantum gate error rates below approximately 1%, and the use of only a 2-D array of qubits with nearest neighbor interactions. As such, our compression technique is of great practical relevance.
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
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-01
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.
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15
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.
Evolution of Force-Generating Equations for PSO using GP
Poli, Riccardo
Evolution of Force-Generating Equations for PSO using GP Cecilia Di Chio, Riccardo Poli- gramming (GP), can automatically generate new PSO algorithms that outperform standard PSOs designed Swarm Optimisation (PSO) [5]. PSOs use a population of "interacting particles" (i.e. candidate solutions
Impact of lightning on the lower ionosphere of Saturn and possible generation of halos and sprites
Ebert, Ute
-dimensional model of the electric field and electron density is used to estimate the changes of the local electron , C. Price a a Department of Geophysical, Atmospheric and Planetary Sciences, Tel-Aviv University and find that the conservative estimation of lightning charge moment change 104 to 105 C km could lead
Janis-Newman algorithm: simplifications and gauge field transformation
Harold Erbin
2015-02-16
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.
Arctic Lower Troposphere Observed Structure (ALTOS)
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsiclouddenDVA N C E D B L O O D SFederal8823 Revision 02August 1, Lower Troposphere
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 QA:QA J-E-1 SECTION J APPENDIXsource HistoryScenarios Towards 2050 Jump to: navigation, search ToolWells andLower
Lower Colorado River Authority | Department of Energy
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 DeliciousMathematicsEnergyInterested Parties - WAPA PublicLED1,400 Jobs |Inc. | DepartmentModeling AssessmentLower
EIA lowers forecast for summer gasoline prices
Gasoline and Diesel Fuel Update (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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming Dry Natural GasNatural GasEIA lowers forecast for summer gasoline prices
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
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-01
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.
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
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01
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-01
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
Generators, Recursion, and Fractals 1 Generators
Verschelde, Jan
Generators, Recursion, and Fractals 1 Generators computing a list of Fibonacci numbers defining a generator with yield putting yield in the function fib 2 Recursive Functions computing factorials, 24 April 2015 Intro to Computer Science (MCS 260) generators and recursion L-41 24 April 2015 1 / 36
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures
Catalyurek, Umit; Gebremedhin, Assefaw; Halappanavar, Mahantesh; Pothen, Alex
2012-01-01
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...
Ramachandran, Santosh; Anand, S V R; Hegde, Malati; Kumar, Anurag; Sundaresan, Rajesh
2011-01-01
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.
St-Ong, Guillaume
of the Lower St. Lawrence Estuary (Eastern Canada). The multibeam data were used to generate a high that they were produced by a combination of erosive turbidity flows and retrogressive failures. The two box cores. Introduction Submarine canyons are initiated by failures on depositional oversteepenings of continental slopes
Kinematics Algorithms for Tensegrity Structures
Burt, Steven James
2013-01-01
A kinematic notation for lower-pair mechanisms based onKinematic analysis of a translational 3-dof tensegrity mechanism.
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 ...
A Distributed Generation Control Architecture for Islanded AC Microgrids
Dominguez-Garcia, Alejandro
1 A Distributed Generation Control Architecture for Islanded AC Microgrids Stanton T. Cady, Student in islanded ac microgrids with both synchronous generators and inverter-interfaced power supplies. Although they are smaller and have lower ratings, the generation control objectives for an islanded microgrid are similar
Machine History Pertinent to Lower Hybird Coupler Analysis
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
82005 History Pertinent to Lower Hybird Coupler Analysis 0104 lower hybrid fwg installed and flange leaktight 0113 first pumpdown following up-to-air 0120 start magnet cooldown...
Energy Department Announces $9 Million to Lower Costs, Increase...
Office of Environmental Management (EM)
9 Million to Lower Costs, Increase Performance of Solar Energy Systems Energy Department Announces 9 Million to Lower Costs, Increase Performance of Solar Energy Systems December...
Aalborg Universitet Energy Management System with Equalization Algorithm for Distributed Energy
Vasquez, Juan Carlos
Aalborg Universitet Energy Management System with Equalization Algorithm for Distributed Energy for Distributed Energy Storage Systems in PV-Active Generator Based Low Voltage DC Microgrids. In IEEE ICDCM 2015 for Distributed Energy Storage Systems in PV-Active Generator Based Low Voltage DC Microgrids Nelson L. D
Understanding and Managing Generation Y
Wallace, Kevin
2007-12-14
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...
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08
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-31
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.
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
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-26
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.
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
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
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-15
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.
Designing a Computational Geometry Algorithms Library \\Lambda
Waldmann, Uwe
for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM, Udine, Italy, September
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
Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation
GADH,RAJIT; LU,YONG; TAUTGES,TIMOTHY J.
1999-09-27
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.
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
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-01
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
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04
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.
Generation gaps in engineering?
Kim, David J. (David Jinwoo)
2008-01-01
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. ...
Wave-front generation of Zernike polynomial modes with a micromachined membrane
Fainman, Yeshaiahu
Wave-front generation of Zernike polynomial modes with a micromachined membrane deformable mirror the characteristics of a 37-channel micromachined membrane deformable mirror for wave-front generation. We demonstrate wave-front generation of the first 20 Zernike polynomial modes, using an iterative algorithm to adjust
Dynamic On-the-Fly Minimum Cost Benchmarking for Storing Generated Scientific
Yang, Yun
IEEEProof Dynamic On-the-Fly Minimum Cost Benchmarking for Storing Generated Scientific Datasets some generated datasets to save the storage cost but more computation cost is incurred for regeneration with efficient algorithms for dynamic yet practical on-the-fly minimum cost benchmarking of storing generated
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05
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.
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...
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...
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-01
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.
Utility Solar Generation Valuation Methods
Hansen, Thomas N.; Dion, Phillip J.
2009-06-30
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.
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...
Energy Department Helping Lower Biofuel Costs for the Nation...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Energy Department Helping Lower Biofuel Costs for the Nation Energy Department Helping Lower Biofuel Costs for the Nation January 29, 2015 - 9:31am Addthis Biofuels are produced in...
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Transition in the Earth's Lower Mantle 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...
Protecting Public Health through Cleaner Fuels and Lower Emissions...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Protecting Public Health through Cleaner Fuels and Lower Emissions Protecting Public Health through Cleaner Fuels and Lower Emissions December 14, 2015 1:00PM to 2:00PM EST 385...
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
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
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-28
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.
Digitales Video Scanline Algorithms -1 -
that exploits simplifications in digital filtering and memory access. The geometric transformations a special class of geometric transformation techniques that operate only along rows and columns. The purpose be resampled independently of the other. Separable algorithms spatially transform 2-D images by decomposing
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
Algorithmic Thermodynamics John C. Baez
Cortes, Corinna
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
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
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
Searches for Fourth Generation Fermions
Ivanov, A.; /Fermilab
2011-09-01
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.
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2005 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2005 spring out-migration at migrant traps on the Snake River and Salmon River. In 2005 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, the age-1 and older fish were distinguishable from wild fish by the occurrence of fin erosion. Age-0 Chinook salmon are more difficult to distinguish between wild and non-adclipped hatchery fish and therefore classified as unknown rearing. The total annual hatchery spring/summer Chinook salmon catch at the Snake River trap was 0.34 times greater in 2005 than in 2004. The wild spring/summer Chinook catch was 0.34 times less than the previous year. Hatchery steelhead trout catch was 0.67 times less than in 2004. Wild steelhead trout catch was 0.72 times less than the previous year. The Snake River trap collected 1,152 age-0 Chinook salmon of unknown rearing. During 2005, the Snake River trap captured 219 hatchery and 44 wild/natural sockeye salmon and 110 coho salmon O. kisutch of unknown rearing. 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. Trap operations began on March 6 and were terminated on June 3. The trap was out of operation for a total of one day due to heavy debris. FPC requested that the trap be restarted on June 15 through June 22 to collect and PIT tag age-0 Chinook salmon. Hatchery Chinook salmon catch at the Salmon River trap was 1.06 times greater and wild Chinook salmon catch was 1.26 times greater than in 2004. The hatchery steelhead trout collection in 2005 was 1.41 times greater and wild steelhead trout collection was 1.27 times greater than the previous year. Trap operations began on March 6 and were terminated on May 17 due to high flows. There were two days when the trap was taken out of service because of mechanical failure. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for passive integrated transponder (PIT) tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2005 data detected a relation between migration rate and discharge for hatchery Chinook but was unable to detect a relation for wild Chinook. The inability to detect a migration rate discharge relation for wild Chinook salmon was caused by a lack of data. For hatchery Chinook salmon there was a 1.8-fold increase in migration rate 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 2.2-fold and a 2.2-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 2005 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon, hatchery steelhead trout, and wild steelhead trout. Migration rate increased 4.2-fold for hatchery Chinook salmon, 2.9-fold for wild Chinook salmon and 2.5-fold for hatchery steelhead, and 1.7-fold for wild steelhead as discharge increased between 50 kcfs and 100 kcfs. Fish tagged with PIT tags at the Snake River and Salmon River traps 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 Lower Granite Dam in 2001, caution must be used in comparing cumulative interrogation data. Cumulative interrogations at the fo
Investigating jets in the lower-to-mid solar atmosphere
, in the lower-to-mid solar atmosphere, remains one of the biggest unanswered questions in solar physics today reconnection driven processes. Spicules are one of the most common features in the lower-to-mid solarInvestigating jets in the lower-to-mid solar atmosphere: Observations & Numerical Simulations Eamon
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Radziszowski, Stanislaw P.
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers Xu Xiaodong and Xie Zheng studies lower bounds for classical multicolor Ramsey numbers, #12;rst by giving a short overview of past diagonal and o#11;-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for R
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
Current Legal and Institutional Frameworks for Investing in Lower Carbon Electricity in China
Lang, X.; Reiner, David; Neuhoff, Karsten
.e. installed capacity >30 MW) Small hydro power Wind power Solar photovoltaic (PV) power Biomass power Wave & tidal power (ocean power) Geothermal power Nuclear Power * may lower carbon emissions relative to reference emissions... a doubling of total installed electricity generation (NBSC, 2006). As the second largest electricity sector in the world, total installed capacity reached 622 GW by the end of 2006 (CEC, 2007). In 2006 alone, China added over 100 GW of installed...
BATTERY -FRIENDLY DESIGN OF SIGNAL PROCESSING ALGORITHMS Praveen Raghavan & Chaitali Chakrabarti
Kambhampati, Subbarao
BATTERY - FRIENDLY DESIGN OF SIGNAL PROCESSING ALGORITHMS Praveen Raghavan & Chaitali Chakrabarti metric. This is unfortunate since maximizing battery lifetime is a more appropriate inetric, and lowering energy does not necessarily mean improving battery lifetime. In this paper we first show how to design
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
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
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2004 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2004 spring out-migration at migrant traps on the Snake River and Salmon River. In 2004 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 1.1 times greater in 2004 than in 2003. The wild Chinook catch was 1.1 times greater than the previous year. Hatchery steelhead trout catch was 1.2 times greater than in 2003. Wild steelhead trout catch was 1.6 times greater than the previous year. The Snake River trap collected 978 age-0 Chinook salmon of unknown rearing. During 2004, the Snake River trap captured 23 hatchery and 18 wild/natural sockeye salmon and 60 coho salmon O. kisutch of unknown rearing. 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. Trap operations began on March 7 and were terminated on June 4. The trap was out of operation for a total of zero days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 10.8% less and wild Chinook salmon catch was 19.0% less than in 2003. The hatchery steelhead trout collection in 2004 was 20.0% less and wild steelhead trout collection was 22.3% less than the previous year. Trap operations began on March 7 and were terminated on May 28 due to high flows. There were two days when the trap was taken out of service because wild Chinook catch was very low, hatchery Chinook catch was very high, and the weekly quota of PIT tagged hatchery Chinook had been met. 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 2004 data detected a relation between migration rate and discharge for wild Chinook salmon but was unable to detect a relation for hatchery Chinook. The inability to detect a migration rate discharge relation for hatchery Chinook salmon was caused by age-0 fall Chinook being mixed in with the age 1 Chinook. Age-0 fall Chinook migrate much slower than age-1 Chinook, which would confuse the ability to detect the migration rate discharge relation. When several groups, which consisted of significant numbers of age-0 Chinook salmon, were removed from the analysis a relation was detected. For hatchery and wild Chinook salmon there was a 2.8-fold and a 2.4-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 2.3-fold and a 2.0-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 2004 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon and hatchery steelhead trout. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 7.0-fold for hatchery Chinook salmon, 4.7-fold for wild Chinook salmon and 3.8-fold for hatchery steelhead as discharge increased between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River and Salmon River traps 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 Monume
Firestone, Richard B; Reijonen, Jani
2014-05-27
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.
Generation to Generation: The Heart of Family Medicine
Winter, Robin O
2012-01-01
Ageism in the Workplace. Generations Spring, 5. Westman,of caring for multiple generations simultaneously. StronglyGeneration to Generation: The Heart of Family Medicine
Tight Lower Bound for Linear Sketches of Moments
Andoni, Alexandr
2013-01-01
The problem of estimating frequency moments of a data stream has attracted a lot of attention since the onset of streaming algorithms [AMS99]. While the space complexity for approximately computing the p [superscript th] ...
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 ...
Convergence Conditions for Variational Inequality Algorithms
Magnanti, Thomas L.
Within the extensive variational inequality literature, researchers have developed many algorithms. Depending upon the problem setting, these algorithms ensure the convergence of (i) the entire sequence of iterates, (ii) ...
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01
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. ...
Bayesian Algorithmic Mechanism Design [Extended Abstract
Hartline, Jason D.
Bayesian Algorithmic Mechanism Design [Extended Abstract] Jason D. Hartline Northwestern, Canada blucier@cs.toronto.edu ABSTRACT The principal problem in algorithmic mechanism design approach for designing incen- tive compatible mechanisms, namely that of Vickrey, Clarke, and Groves
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
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01
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-01
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-01
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-01
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
Evaluating Las Vegas Algorithms ---Pitfalls and Remedies
Hoos, Holger H.
cism regarding the empirical testing of algorithms (Hooker, 1994; Hooker, 1996; McGeoch, 1996). It has
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09
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.
A Fast Algorithm for Nonstationary Delay Estimation
So, Hing-Cheung
to the explicit time delay estimator (ETDE) algorithm 4] but it is more computationally e cient and provides more
Energy Management in Microgrids: Algorithms and System
Shi, Wenbo
2015-01-01
study the supply-demand balancing problem in microgrids under more realistic conditions and pro- pose algorithms for microgrid
Leung, Ka-Ngo (Hercules, CA)
2009-12-29
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-22
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-14
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.
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
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING Dong Jia Post-Doctoral Research Associate vehicles (UAVs). Premature convergence prevents evolutionary-based algorithms from reaching global optimal. To overcome this problem, this paper presents a framework of parallel evolutionary algorithms for UAV path
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
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
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
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
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
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
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
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
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
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01
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.
Algorithmic proof of Barnette's Conjecture
I. Cahit
2009-04-22
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.
Investment and Upgrade in Distributed Generation under Uncertainty
Guillas, Serge
for microgrids to use small-scale distributed generation (DG) and combined heat and power (CHP) applications via.maribu@ensmp.fr 1 #12;Investment and Upgrade under Uncertainty in Distributed Generation 2 Keywords: Combined heat heat exchangers (HXs) to meet local energy loads. Although the electric-only efficiency of DG is lower
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
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
An algorithm for discovering Lagrangians automatically from data
Hills, D J A; Hudson, J J
2015-01-01
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.
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 TWO-DIMENSIONAL BATHYMETRY BASED UNSTRUCTURED TRIANGULAR GRID GENERATOR
unstructured triangular grid refinement algorithms, including the recent "off-centers" method, is providedBATTRI* : A TWO-DIMENSIONAL BATHYMETRY BASED UNSTRUCTURED TRIANGULAR GRID GENERATOR FOR FINITE utilities to check and improve grid quality. The final output mesh node locations, node depths and element
HU TA
2007-10-26
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.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas2195
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas21958524
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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield MunicipalTechnicalInformation4563 LLNL Small-scale Friction Sensitivityv b W r88fracturing
Office of Environmental Management (EM)
databases for ICME Surface treatments User facility for remanufactured parts testing; lower-cost coating materials Low-cost laser processing; high accuracy non-planar surface...
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2003 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2003 spring out-migration at migrant traps on the Snake River and Salmon River. In 2003 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 2.1 times less in 2003 than in 2002. The wild Chinook catch was 1.1 times less than the previous year. Hatchery steelhead trout catch was 1.7 times less than in 2002. Wild steelhead trout catch was 2.1 times less than the previous year. The Snake River trap collected 579 age-0 Chinook salmon of unknown rearing. During 2003, the Snake River trap captured five hatchery and 13 wild/natural sockeye salmon and 36 coho salmon O. kisutch of unknown rearing. 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 differences in catch between 2003 and the previous year were due mainly to low flows during much of the trapping season and then very high flows at the end of the season, which terminated the trapping season 12 days earlier than in 2002. Trap operations began on March 9 and were terminated on May 27. The trap was out of operation for a total of zero days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 16.8% less and wild Chinook salmon catch was 1.7 times greater than in 2002. The hatchery steelhead trout collection in 2003 was 5.6% less than in 2002. Wild steelhead trout collection was 19.2% less than the previous year. Trap operations began on March 9 and were terminated on May 24 due to high flows. There were zero days when the trap was out of operation due to high flow or debris. The decrease in hatchery Chinook catch in 2003 was partially due to differences in flow between years because there was a 5.9% increase in hatchery production in the Salmon River drainage in 2003. The decrease in hatchery steelhead catch may be partially due to a 13% decrease in hatchery production in the Salmon River drainage in 2003. 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 2003 data detected a relation between migration rate and discharge for wild Chinook salmon but was unable to detect a relation for hatchery Chinook. The inability to detect a migration rate discharge relation for hatchery Chinook was probably caused by age 0 fall Chinook being mixed in with the age 1 Chinook. Age 0 fall Chinook migrate much slower than age 1 Chinook, which would confuse the ability to detect the migration rate discharge relation. For wild Chinook salmon there was a 1.4-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.7-fold and a 1.9-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 2003 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon and hatchery steelhead trout. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 14-fold for hatchery Chinook salmon, 8.3-fold for wild Chinook salmon and 2.4-fold for hatchery steelhead as discharge increased between 50 kcfs and
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 ...
Chang, Shih-Fu
#12;#12;#12;#12;features function utility Training Pool Utility Generator Per-frame function content utility classes utility classes utility Tree Decision Generator Module Utility Clustering Adaptive
Citrus Production in the Lower Rio Grande Valley of Texas.
Traub, Hamilton Paul; Friend, W. H. (William Heartsill)
1930-01-01
. TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR COLLEGE STATION, BRAZOS COUNTY, TEXAS - BULLETIN NO. 419 DIVISION OF HORTICULTURE Citrus Production in the Lower Rio Grande Valley of Texas AGRICULTURAL AND MECHANICAL COLLEGE OF TEXAS.... . Citrus fruit production in the Lower Rio Grande Valley, especially grapefruit, has increased at a rather rapid rate dur- ing the past few years. More than 5,000,000 citrus trees were set in orchard form in the Lower Rio Grande Valley up to July, 1929...
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
A Fourth Chiral Generation And Susy Breaking
Akin Wingerter
2011-05-30
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.
Generating Functions Introduction
Gould, Ron
CHAPTER 10 Ordinary Generating Functions Introduction We'll begin this chapter by introducing the notion of ordinary generating functions and discussing the basic techniques for manipulating them must master these basic ideas before reading further. In Section 2, we apply generating functions
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-20
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.
Nebel, Jean-Christophe
1 Mesh Generator Matthew Hanlon 9804817 hanlonmj@dsc.gla.ac.uk Class CS4H Session 2002 from two dimensional slices. Medical data stored as sets of slices can be used to generate a three was developed with the following requirements: Â· Load a set of slices into the system Â· Generate a mesh for each
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...
Optimization Online - Lower Bounds on Complexity of Lyapunov ...
Amir Ali Ahmadi
2015-04-14
Apr 14, 2015 ... Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems. Amir Ali Ahmadi(a_a_a ***at*** princeton.edu) Raphael ...
Project Reports for Lower Sioux Indian Community- 2010 Project
Office of Energy Efficiency and Renewable Energy (EERE)
Lower Sioux intends to continue its efforts to develop wind projects on its lands as a continuation of efforts begun roughly 20 years ago.
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,...
on the complexity of some hierarchical structured matrix algorithms
2012-05-17
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
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
Hickam, Christopher Dale (Glasford, IL)
2008-05-13
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.
Study of lower hybrid wave propagation in ionized gas by Hamiltonian theory
Casolari, A.; Cardinali, A.
2014-02-12
In order to find an approximate solution to the Vlasov-Maxwell equation system describing the lower hybrid wave propagation in magnetic confined plasmas, the use of the WKB method leads to the ray tracing equations. The Hamiltonian character of the ray tracing equations is investigated analytically and numerically in order to deduce the physical properties of the wave propagating without absorption in the confined plasma. The consequences of the Hamiltonian character of the equations on the travelling wave, in particular, on the evolution of the parallel wavenumber along the propagation path have been accounted and the chaotic diffusion of the timeaveraged parallel wave-number towards higher values has been evaluated. Numerical analysis by means of a Runge-Kutta based algorithm implemented in a ray tracing code supplies the analytical considerations. A numerical tool based on the symplectic integration of the ray trajectories has been developed.
Yao, Jinping; Jia, Xinyan; Hao, Xiaolei; Zeng, Bin; Jing, Chenrui; Chu, Wei; Ni, Jielei; Zhang, Haisu; Xie, Hongqiang; Zhang, Chaojin; Zhao, Zengxiu; Chen, Jing; Liu, Xiaojun; Cheng, Ya; Xu, Zhizhan
2013-01-01
We show that fluorescence emission induced by strong field tunnel ionization of carbon dioxide from its lower-lying orbitals exhibits a peculiar molecular alignment dependence. The experimentally measured alignment-dependence of the fluorescence agrees with the alignment-dependence of the ionization probability calculated in the framework of the strong field approximation. Our results demonstrate the feasibility of an all-optical approach for shedding more light on the ionization mechanisms of molecules from their lower-lying orbitals in tunnel ionization regime.
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
.F. Kalama Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind by recovery and subbasin planning. Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
.F. Kalama Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind by recovery and subbasin planning Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin by recovery and subbasin planning. Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Radziszowski, Stanislaw P.
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers Xu Xiaodong and Xie Zheng bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for Rk(4) and Rk(5) for some small
More Constructive Lower Bounds on Classical Ramsey Numbers
Radziszowski, Stanislaw P.
More Constructive Lower Bounds on Classical Ramsey Numbers Xiaodong Xu Guangxi Academy of Sciences Abstract. We present several new constructive lower bounds for classical Ramsey numbers. In particular that for all integers k, l, with k 5 and l 3, the connectivity of any Ramsey-critical (k, l
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
Biomechanical Considerations in the Design of Lower Limb Exoskeletons
Haller, Gary L.
Biomechanical Considerations in the Design of Lower Limb Exoskeletons Massimo Cenciarini and Aaron of the human biomechanical considerations related to the development of lower limb exoskeletons. Factors biomechanical considerations. The exoskeletons we consider in this review are those that act in parallel
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
Paleoecology and paleontology of the Lower Cretaceous Kiowa Formation, Kansas
Scott, R. W.
1970-01-15
OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS ARTICLE 52 (CRETACEOUS 1) PALEOECOLOGY AND PALEONTOLOGY OF THE LOWER CRETACEOUS KIOWA FORMATION, KANSAS ROBERT W. SCOTT Department of Geology, University of Kansas, Lawrence Present address: Waynesburg College... PALEOECOLOGY AND PALEONTOLOGY OF THE LOWER CRETACEOUS KIOWA FORMATION, KANSAS ROBERT W. SCOTT Department of Geology, University of Kansas, Lawrence Present address: Waynesburg College, Waynesburg, Pennsylvania CONTENTS PAGE ABSTRACT 5 Interspecific...
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
Discharge cell for ozone generator
Nakatsuka, Suguru (Amagasaki, JP)
2000-01-01
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 %.
Grosse-Kunstleve, Ralf
10 cctbx news: Fast triplet generator for direct methods, Gallery of direct-space asymmetric units crystallographic algorithms. In this article we give an overview of recent developments. Fast triplet generator for direct methods For almost a year the cctbx has included an experimental triplet generator in the cctbx
Bent functions at the minimal distance and algorithms of constructing linear codes for
International Association for Cryptologic Research (IACR)
1 Bent functions at the minimal distance and algorithms of constructing linear codes for CDMA 1 In this paper we study linear codes for CDMA (Code Division Multiple Access). This is the standard for the 3rd Generation cellular communications systems. In this standard bent functions are used for constructing codes
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
Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm
Mountziaris, T. J.
Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm *Michael Ameckson Science Foundation. Generating electricity using offshore wind farms can assist coastal regions to meet growing electricity demands supported by a renewable source [4]. However modeling wind farm siting must
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
A Dual Algorithm for the Short Term Power Production Planning with Network
data from the uruguayan system. Keywords: Short term power scheduling, hydro thermal coordination, unit), finding the power generation of the hydro plants, and solving the transmission network problem. ThoseA Dual Algorithm for the Short Term Power Production Planning with Network Constraints Alfredo
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
Switching algorithms for extending battery life in Electric Vehicles Ron Adany a,*, Doron Aurbach b
Kraus, Sarit
-wide driving cycles. The results reveal that compared to the common discharge method almost all penalties can reserved. 1. Introduction Electric Vehicles (EVs) are the next generation of cars in the worldSwitching algorithms for extending battery life in Electric Vehicles Ron Adany a,*, Doron Aurbach b
Louis, Sushil J.
Seismic Velocity Inversion with Genetic Algorithms Sushil J. Louis Qinxue Chen Satish to compute travel times for seismic waves. However, in practice, we have to solve the inverse problem: travel synthetic seismic models shows that large population sizes are crit- ical to generating good seismic
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
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17
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.
Barnette, Daniel W. (Veguita, NM)
2002-01-01
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-01
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-25
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.
Decision-Theoretic User Interface Generation Krzysztof Z. Gajos and Daniel S. Weld
Wobbrock, Jacob O.
Decision-Theoretic User Interface Generation Krzysztof Z. Gajos and Daniel S. Weld Department of Computer Science and Engineering University of Washington Seattle, WA 98195, USA {kgajos,weld interfaces and developing efficient algorithms for their automatic generation (Gajos & Weld, 2004; Gajos et
Tool path generation and 3D tolerance analysis for free-form surfaces
Choi, Young Keun
2005-08-29
in the tool paths. Several parts, for which the CC points are generated using the proposed algorithm, are machined using a three axes milling machine. As part of the validation process, the tool paths generated during machining are analyzed to compare...
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
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19
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.
A fast contour descriptor algorithm for supernova imageclassification
Aragon, Cecilia R.; Aragon, David Bradburn
2006-07-16
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.
Thermophotovoltaic energy generation
Celanovic, Ivan; Chan, Walker; Bermel, Peter; Yeng, Adrian Y. X.; Marton, Christopher; Ghebrebrhan, Michael; Araghchini, Mohammad; Jensen, Klavs F.; Soljacic, Marin; Joannopoulos, John D.; Johnson, Steven G.; Pilawa-Podgurski, Robert; Fisher, Peter
2015-08-25
Inventive systems and methods for the generation of energy using thermophotovoltaic cells are described. Also described are systems and methods for selectively emitting electromagnetic radiation from an emitter for use in thermophotovoltaic energy generation systems. In at least some of the inventive energy generation systems and methods, a voltage applied to the thermophotovoltaic cell (e.g., to enhance the power produced by the cell) can be adjusted to enhance system performance. Certain embodiments of the systems and methods described herein can be used to generate energy relatively efficiently.
Fourth Generation Majorana Neutrinos
Alexander Lenz; Heinrich Päs; Dario Schalla
2012-05-02
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.
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
2012-09-01
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.
Office of Energy Efficiency and Renewable Energy (EERE)
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.
Theoretical Analysis and Efficient Algorithms for Crowdsourcing
Li, Hongwei
2015-01-01
algorithm to solve it efficiently. Empirical results on bothto solve problems efficiently by online game players. Foralgorithm is proposed to efficiently infer the true labels
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).
Parallel GPU Algorithms for Mechanical CAD
Krishnamurthy, Adarsh
2010-01-01
of California, Berkeley, Mechanical Engineering Department,GPU Algorithms for Mechanical CAD by Adarsh Krishnamurthy Aof Philosophy in Engineering - Mechanical Engineering in the
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05
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.
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...
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-11-08
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.
LO, NLO, LO* and jet algorithms
J. Huston
2010-01-14
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.
Lower Freezing DEF For Higher NOx Reduction Attainment | Department...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Mixing Design -- Simulation and Test Investigation 3rd Generation SCR System Using Solid Ammonia Storage and Direct Gas Dosing Urea SCR and DPF System for Deisel Sport Utility...
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-01
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.
NEXT GENERATION TURBINE SYSTEM STUDY
Frank Macri
2002-02-28
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.
Lower bounds for the earliness-tardiness scheduling problem on ...
2004-10-27
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.
Flow Of Mantle Fluids Through The Ductile Lower Crust- Helium...
Flow Of Mantle Fluids Through The Ductile Lower Crust- Helium Isotope Trends Jump to: navigation, search OpenEI Reference LibraryAdd to library Journal Article: Flow Of Mantle...
Particle simulation of lower hybrid waves in tokamak plasmas
Bao, J; Kuley, A; Wang, Z X; Lu, Z X
2014-01-01
Global particle simulations of the lower hybrid waves have been carried out using fully kinetic ions and drift kinetic electrons with a realistic electron-to-ion mass ratio. The lower hybrid wave frequency, mode structure, and electron Landau damping from the electrostatic simulations agree very well with the analytic theory. Linear simulation of the propagation of a lower hybrid wave-packet in the toroidal geometry shows that the wave propagates faster in the high field side than the low field side, in agreement with a ray tracing calculation. Electromagnetic benchmarks of lower hybrid wave dispersion relation are also carried out. Electromagnetic mode conversion are observed in toroidal geometry, slow waves are launched at the plasma boundary and converts to fast waves at the mode conversion layer, which is consistent with linear theory.
A new lower hybrid launcher built in collaboration with PPPL...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
for its approximate thermal expansion match to the alumina material used for the vacuum windows. Since plasma operation resumed in February, over 200 kW of lower hybrid power...
Sandia National Laboratories: Dirt-cheap catalyst may lower fuel...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Twitter YouTube Flickr RSS News Dirt-cheap catalyst may lower fuel costs for H2-powered cars By Neal Singer Photography By Randy Montoya Thursday, October 15, 2015 Dirt Cheap...
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-01
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.
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....
SRS Recovery Act Completes Major Lower Three Runs Project Cleanup
Office of Environmental Management (EM)
Pope, "The EPA is pleased with the cleanup of hot spots of contaminated soil and sediment along Lower Three Runs. EPA worked closely with the Department of Energy, South...
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
Lower limb response to modified ankle impedance in gait
Blackburn, Bonnie Lucille
2011-01-01
This project used an exoskeletal robot to increase and decrease the stiffness of the ankle joint during treadmill walking to measure the effect of ankle impedance on lower limb joint kinematics. By quantifying the effect ...
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...
Pika Energy Develops Innovative Manufacturing Process and Lowers...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
CIP is to help U.S. manufacturers that produce distributed wind systems to lower the cost of energy from their turbines and increase their market competitiveness. By focusing on...
Fact #889: September 7, 2015 Average Diesel Price Lower than...
Broader source: Energy.gov (indexed) [DOE]
Average Diesel Price Lower than Gasoline for the First Time in Six Years fotw889web.xlsx More Documents & Publications Fact 859 February 9, 2015 Excess Supply is the Most Recent...
EV Community Readiness projects: New York City and Lower Hudson...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
EV Community Readiness projects: New York City and Lower Hudson Valley Clean Communities, Inc. (NY, MA, PA); NYSERDA (ME, NH, VT, MA, RI, CT, NY, NJ, PA, DE, MD, DC) EV Community...
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-25
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.
Market Designs for High Levels of Variable Generation: Preprint
Milligan, M.; Holttinen, H.; Kiviluoma, J.; Orths, A.; Lynch, M.; Soder, L.
2014-10-01
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.
Laser beam generating apparatus
Warner, B.E.; Duncan, D.B.
1994-02-15
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.
Prescott, D.S.; Schober, R.K.; Beller, J.
1992-03-17
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.
Improved solid aerosol generator
Prescott, D.S.; Schober, R.K.; Beller, J.
1988-07-19
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.
Wroclaw neutrino event generator
Jaroslaw A. Nowak
2006-07-07
A neutrino event generator developed by the Wroclaw Neutrino Group is described. The physical models included in the generator are discussed and illustrated with the results of simulations. The considered processes are quasi-elastic scattering and pion production modelled by combining the $\\Delta$ resonance excitation and deep inelastic scattering.
Internal split field generator
Thundat; Thomas George (Knoxville, TN); Van Neste, Charles W. (Kingston, TN); Vass, Arpad Alexander (Oak Ridge, TN)
2012-01-03
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.
1993-12-28
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.
HIGH EFFICIENCY SYNGAS GENERATION
Robert J. Copeland; Yevgenia Gershanovich; Brian Windecker
2005-02-01
This project investigated an efficient and low cost method of auto-thermally reforming natural gas to hydrogen and carbon monoxide. Reforming is the highest cost step in producing products such as methanol and Fisher Tropsch liquids (i.e., gas to liquids); and reducing the cost of reforming is the key to reducing the cost of these products. Steam reforming is expensive because of the high cost of the high nickel alloy reforming tubes (i.e., indirectly fired reforming tubes). Conventional auto-thermal or Partial Oxidation (POX) reforming minimizes the size and cost of the reformers and provides a near optimum mixture of CO and hydrogen. However POX requires pure oxygen, which consumes power and significantly increases the cost to reforming. Our high efficiency process extracts oxygen from low-pressure air with novel oxygen sorbent and transfers the oxygen to a nickel-catalyzed reformer. The syngas is generated at process pressure (typically 20 to 40 bar) without nitrogen dilution and has a 1CO to 2H{sub 2} ratio that is near optimum for the subsequent production of Fisher-Tropsch liquid to liquids and other chemicals (i.e., Gas to Liquids, GTL). Our high process efficiency comes from the way we transfer the oxygen into the reformer. All of the components of the process, except for the oxygen sorbent, are commonly used in commercial practice. A process based on a longlived, regenerable, oxygen transfer sorbent could substantially reduce the cost of natural gas reforming to syngas. Lower cost syngas (CO + 2H{sub 2}) that is the feedstock for GTL would reduce the cost of GTL and for other commercial applications (e.g., methanol, other organic chemicals). The vast gas resources of Alaska's North Slope (ANS) offer more than 22 Tcf of gas and GTL production in this application alone, and could account for as much as 300,000 to 700,000 bpd for 20 to 30+ years. We developed a new sorbent, which is an essential part of the High Efficiency Oxygen Process (HOP). We tested the sorbent and observed that it has both a good oxygen capacity and operates as a highly effective reforming catalyst. We conducted a long duration tests of the sorbent (1,500 hours of continuous operation in the HOP cycle). Although the sorbent lost some oxygen capacity with cycling, the sorbent oxygen capacity stabilized after 1,000 hours and remained constant to the end of the test, 1,500 hour. The activity of the catalyst to reform methane to a hydrogen and carbon monoxide mixture was unchanged through the oxidation/reduction cycling. Our cost and performance analyses indicated a significant reduction in the cost of GTL production when using the HOP process integrated into a GTL plant.
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05
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.
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
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
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
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11
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.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08
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.
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01
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...
Algorithmic Aspects of Proportional Symbol Sergio Cabello
Utrecht, Universiteit
Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello Herman Haverkort Marc van Kreveld-CS-2008-008 www.cs.uu.nl ISSN: 0924-3275 #12;Algorithmic Aspects of Proportional Symbol Maps Sergio@cs.uu.nl Abstract Proportional symbol maps visualize numerical data associated with point locations by plac- ing
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
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
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
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
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15
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.
Pole Placement Algorithms ROBERT MAHONY~ UWE
Moore, John Barratt
Pole Placement Algorithms ROBERT MAHONY~ UWE for Symmetric Realisations HELMKE$ JOHN MOORE a numerical algorithm for deter- mining optimal output feedback gains for the pole place- ment task is well defined even when an exact solution to the pole placement task does not exist. Thus, the proposed
Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator
International Association for Cryptologic Research (IACR)
Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator Matthew J. Campagna random bit generators are analyzed in the context of being indistinguishable from random. Upper and lower Introduction Random bit generation is an essential element to almost every cryptographic system. A fundamental
Vaze, Rahul
2011-01-01
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...
Automatic generation of Feynman rules in the Schroedinger functional
Shinji Takeda
2008-08-22
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.
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-01
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.
Discrimination of Unitary Transformations and Quantum Algorithms
David Collins
2008-11-09
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.
2003 Special issue Statistical efficiency of adaptive algorithms
Widrow, Bernard
2003 Special issue Statistical efficiency of adaptive algorithms Bernard Widrow*, Max Kamenetsky Serra Mall, Stanford, CA 94305, USA Abstract The statistical efficiency of a learning algorithm applied gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS
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
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
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
Leung, Ka-Ngo; Lou, Tak Pui
2005-03-22
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.
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
Lothian, Josh; Powers, Sarah S; Sullivan, Blair D; Baker, Matthew B; Schrock, Jonathan; Poole, Stephen W
2013-12-01
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. (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-10
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.; Page, Ralph H.; Ebbers, Christopher A.; Beach, Raymond J.
2004-03-09
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.
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-15
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.
SCDAP/RELAP5 Lower Core Plate Model
Coryell, Eric Wesley; Griffin, F. P.
1999-10-01
The SCDAP/RELAP5 computer code is a best-estimate analysis tool for performing nuclear reactor severe accident simulations. This report describes the justification, theory, implementation, and testing of a new modeling capability which will refine the analysis of the movement of molten material from the core region to the vessel lower head. As molten material moves from the core region through the core support structures it may encounter conditions which will cause it to freeze in the region of the lower core plate, delaying its arrival to the vessel head. The timing of this arrival is significant to reactor safety, because during the time span for material relocation to the lower head, the core may be experiencing steam-limited oxidation. The time at which hot material arrives in a coolant-filled lower vessel head, thereby significantly increasing the steam flow rate through the core region, becomes significant to the progression and timing of a severe accident. This report is a revision of a report INEEL/EXT-00707, entitled "Preliminary Design Report for SCDAP/RELAP5 Lower Core Plate Model".
SCDAP/RELAP5 lower core plate model
Coryell, E.W.; Griffin, F.P.
1999-09-01
The SCDAP/RELAP5 computer code is a best-estimate analysis tool for performing nuclear reactor severe accident simulations. This report describes the justification, theory, implementation, and testing of a new modeling capability which will refine the analysis of the movement of molten material from the core region to the vessel lower head. As molten material moves from the core region through the core support structures it may encounter conditions which will cause it to freeze in the region of the lower core plate, delaying its arrival to the vessel head. The timing of this arrival is significant to reactor safety, because during the time span for material relocation to the lower head, the core may be experiencing steam-limited oxidation. The time at which hot material arrives in a coolant-filled lower vessel head, thereby significantly increasing the steam flow rate through the core region, becomes significant to the progression and timing of a severe accident. This report is a revision of a report INEEL/EXT-00707, entitled ``Preliminary Design Report for SCDAP/RELAP5 Lower Core Plate Model''.
Energy Management in Microgrids: Algorithms and System
Shi, Wenbo
2015-01-01
R. Gadh, “Two-tier prediction of solar power generation withGadh, and N. Li, “Solar generation prediction using the ARMAGadh, and N. Li, “Solar Generation Prediction using the ARMA
Energy Management in Microgrids: Algorithms and System
Shi, Wenbo
2015-01-01
to i) minimize the cost of generation, the cost of energyis given and there is no generation cost for renewable DGs.the conventional DG generation cost at each time t ? T using
Message Passing for Integrating and Assessing Renewable Generation in a Redundant Power Grid
Zdeborová, Lenka; Chertkov, Michael
2009-01-01
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.
Burra G. Sidharth
2010-03-11
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.
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-04
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-01
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-23
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.
Fourth Generation Bound States
Koji Ishiwata; Mark B. Wise
2011-05-25
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.
Johanson, Edward W. (New Lenox, IL); Simms, Richard (Westmont, IL)
1981-01-01
A scram signal generating circuit for nuclear reactor installations monitors a flow signal representing the flow rate of the liquid sodium coolant which is circulated through the reactor, and initiates reactor shutdown for a rapid variation in the flow signal, indicative of fuel motion. The scram signal generating circuit includes a long-term drift compensation circuit which processes the flow signal and generates an output signal representing the flow rate of the coolant. The output signal remains substantially unchanged for small variations in the flow signal, attributable to long term drift in the flow rate, but a rapid change in the flow signal, indicative of a fast flow variation, causes a corresponding change in the output signal. A comparator circuit compares the output signal with a reference signal, representing a given percentage of the steady state flow rate of the coolant, and generates a scram signal to initiate reactor shutdown when the output signal equals the reference signal.
Vector generator scan converter
Moore, James M. (Livermore, CA); Leighton, James F. (Livermore, CA)
1990-01-01
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-05
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.
Oscillating fluid power generator
Morris, David C
2014-02-25
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-31
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.
Biomass for Electricity Generation
Reports and Publications (EIA)
2002-01-01
This paper examines issues affecting the uses of biomass for electricity generation. The methodology used in the National Energy Modeling System to account for various types of biomass is discussed, and the underlying assumptions are explained.
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-31
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.
Almeida, G. L.; Silvani, M. I.; Lopes, R. T.
2014-11-11
Two main parameters rule the performance of an Image Acquisition System, namely, spatial resolution and contrast. For radiographic systems using cone beam arrangements, the farther the source, the better the resolution, but the contrast would diminish due to the lower statistics. A closer source would yield a higher contrast but it would no longer reproduce the attenuation map of the object, as the incoming beam flux would be reduced by unequal large divergences and attenuation factors. This work proposes a procedure to correct these effects when the object is comprised of a hull - or encased in it - possessing a shape capable to be described in analytical geometry terms. Such a description allows the construction of a matrix containing the attenuation factors undergone by the beam from the source until its final destination at each coordinate on the 2D detector. Each matrix element incorporates the attenuation suffered by the beam after its travel through the hull wall, as well as its reduction due to the square of distance to the source and the angle it hits the detector surface. When the pixel intensities of the original image are corrected by these factors, the image contrast, reduced by the overall attenuation in the exposure phase, are recovered, allowing one to see details otherwise concealed due to the low contrast. In order to verify the soundness of this approach, synthetic images of objects of different shapes, such as plates and tubes, incorporating defects and statistical fluctuation, have been generated, recorded for further comparison and afterwards processed to improve their contrast. The developed algorithm which, generates processes and plots the images has been written in Fortran 90 language. As the resulting final images exhibit the expected improvements, it therefore seemed worthwhile to carry out further tests with actual experimental radiographies.
An improved spectral graph partitioning algorithm for mapping parallel computations
Hendrickson, B.; Leland, R.
1992-09-01
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.
Innovative Self- Generating Projects
Kelly, L.
2013-01-01
? All rights reserved. Case Studies on Canadian Customer Generation Projects Innovative Self-Generation Projects Liam Kelly, M.A.Sc, CMVP Energy Engineer Willis Energy Services A CLEAResult company ESL-IE-13-05-06 Proceedings of the Thrity...-05-06 Proceedings of the Thrity-Fifth Industrial Energy Technology Conference New Orleans, LA. May 21-24, 2013 ? 2013 CLEAResult ? All rights reserved. Overcoming Challenges ? Look for innovative opportunities ? Leverage available incentives ? Quantify other...
Geometric lower bound for a quantum coherence measure
Diego Paiva Pires; Lucas C. Céleri; Diogo O. Soares-Pinto
2015-04-23
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.
MEACHAM JE
2008-11-17
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).
MEACHAM JE
2009-10-26
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).
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Vempala, Santosh
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a homogeneous linear inequality system Ax > 0. A natural condition measure associated with this algorithm is the Euclidean ...
Statistical algorithms in the study of mammalian DNA methylation
Singer, Meromit
2012-01-01
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-01
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.
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions
Troina, Angelo
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions Roberto Barbuti, Andrea introduce a probabilistic algorithm for the simulation of chemical reactions, which can be used evolution of chemical reactive systems described by Gillespie. Moreover, we use our algorithm
Lower and upper probabilities in the distributive lattice of subsystems
A. Vourdas
2014-10-08
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.
The lower hybrid (LH) heating and current drive system can generate 10-12 MW of microwave power
reflecting optics · Remote vacuum window manufactured by CCFE · Industrial contract for periscope manufacture, including the effect of plasma disruptions, done by CCFE engineering group · Manufacture of periscope body
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
21SPIRAL LIBRARY GENERATOR SPIRAL: A GENERATOR FOR
Moura, José
21SPIRAL LIBRARY GENERATOR SPIRAL: A GENERATOR FOR PLATFORM-ADAPTED LIBRARIES OF SIGNAL PROCESSING Manuela Veloso6 Robert W. Johnson7 Abstract SPIRAL is a generator for libraries of fast software imple perform- ance of SPIRAL generated code. Key words: program generation, automatic performance tuning
Generating a Generator Department of Computer and Information Sciences
Gray, Jeffrey G.
Generating a Generator Jeff Gray Department of Computer and Information Sciences University. A key to this future work will be the generation of a generator from an XML DTD or schema. 1 for crosscutting modeling concerns, a combination of an aspect-oriented [6] and generative programming [2] approach
A KNOWLEDGE-BASED CODE GENERATOR GENERATOR Christopher W. Fraser %
Fraser, Christopher W.
A KNOWLEDGE-BASED CODE GENERATOR GENERATOR Christopher W. Fraser % Department of Computer Science a good local code generator for an ALGOL-like language. It is organized as a production system of rules generation of compilers. Automatic generation of some compiler modules is already available; for example
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-13
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.
QCDLAB: Designing Lattice QCD Algorithms with MATLAB
Artan Borici
2006-10-09
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses the Schwinger model on the lattice, a great simplification, which shares many features and algorithms with lattice QCD. A typical computing project using QCDLAB is characterised by short codes, short run times, and the ability to make substantial changes in a few seconds. QCDLAB 1.0 can be downloaded from the QCDLAB project homepage {\\tt http://phys.fshn.edu.al/qcdlab.html}.
Recent Developments in Dual Lattice Algorithms
J. Wade Cherrington
2008-10-02
We review recent progress in numerical simulations with dually transformed SU(2) LGT, starting with a discussion of explicit dual amplitudes and algorithms for SU(2) pure Yang Mills in D=3 and D=4. In the D=3 case, we discuss results that validate the dual algorithm against conventional simulations. We also review how a local, exact dynamical fermion algorithm can naturally be incorporated into the dual framework. We conclude with an outlook for this technique and a look at some of the current challenges we've encountered with this method, specifically critical slowing down and the sign problem.
An Overview of LISA Data Analysis Algorithms
Edward K. Porter
2009-10-02
The development of search algorithms for gravitational wave sources in the LISA data stream is currently a very active area of research. It has become clear that not only does difficulty lie in searching for the individual sources, but in the case of galactic binaries, evaluating the fidelity of resolved sources also turns out to be a major challenge in itself. In this article we review the current status of developed algorithms for galactic binary, non-spinning supermassive black hole binary and extreme mass ratio inspiral sources. While covering the vast majority of algorithms, we will highlight those that represent the state of the art in terms of speed and accuracy.
Fuel cycle comparison of distributed power generation technologies.
Elgowainy, A.; Wang, M. Q.; Energy Systems
2008-12-08
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.
Environmental Assessment of the Lower Cape Fear River System, 2009
Mallin, Michael
along Cape Fear Estuary Persistent blue-green Microcystis algal bloom in Cape Fear River, fall 2009 Microcystis blue-green bloom magnified 150X #12;Executive Summary Multiparameter water sampling for the Lower as blackwater systems because of their tea colored water. The Northeast Cape Fear River often seems to be more
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
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
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06
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...
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
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
Suspended sediment sources and tributary effects in the lower
Yeager, Kevin M.
Suspended sediment sources and tributary effects in the lower reaches of a coastal plain stream Abstract Characterizing the dynamics of fluvial sediment sources over space and time is often critical in identifying human impacts on fluvial systems. Upland interfluve and subsoil sources of suspended sediment
Soft Wearable Motion Sensing Suit for Lower Limb Biomechanics Measurements*
Wood, Robert
Soft Wearable Motion Sensing Suit for Lower Limb Biomechanics Measurements* Yigit Meng¨uc¸1,2, Yong of human biomechanics as well as the entertainment industry. Although existing technologies motion data in order to understand the underlying biomechanics. Simulation tools such as Open- Sim [2
DOES DUAL SOURCING LOWER PROCUREMENT COSTS? Thomas P. Lyonw
Lyon, Thomas P.
DOES DUAL SOURCING LOWER PROCUREMENT COSTS?Ã Thomas P. Lyonw U.S. defense policy encourages the use of dual sourcing to reduce government procurement costs, but recent theoretical work raises doubts about procurement costs using a panel dataset of tactical missiles. I find dual sourcing is not driven by failures
Lower bounding procedure for the Asymmetric Quadratic Traveling ...
2015-02-04
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
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-31
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.
Using Backup Generators: Choosing the Right Backup Generator...
overheated, which may cause the generator to fail. Make sure your generator produces more power than will be drawn by the electrical devices you connect to the generator, including...
Superconducting thermoelectric generator
Metzger, J.D.; El-Genk, M.S.
1994-01-01
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.
Petrick, Michael (Joliet, IL); Pierson, Edward S. (Chicago, IL); Schreiner, Felix (Mokena, IL)
1980-01-01
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.
Fischer, Noah A.
2012-08-14
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.
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
MREG V1.1 : a multi-scale image registration algorithm for SAR applications.
Eichel, Paul H.
2013-08-01
MREG V1.1 is the sixth generation SAR image registration algorithm developed by the Signal Processing&Technology Department for Synthetic Aperture Radar applications. Like its predecessor algorithm REGI, it employs a powerful iterative multi-scale paradigm to achieve the competing goals of sub-pixel registration accuracy and the ability to handle large initial offsets. Since it is not model based, it allows for high fidelity tracking of spatially varying terrain-induced misregistration. Since it does not rely on image domain phase, it is equally adept at coherent and noncoherent image registration. This document provides a brief history of the registration processors developed by Dept. 5962 leading up to MREG V1.1, a full description of the signal processing steps involved in the algorithm, and a user's manual with application specific recommendations for CCD, TwoColor MultiView, and SAR stereoscopy.
Lower granite GIS data description and collection guidelines
Gordon, J.L.; Evans, B.J.; Perry, E.M.
1995-12-01
The Lower Granite Geographic Information System (GIS) was developed jointly by the US Army Corps of Engineers (USCOE) Walla Walla District and the Pacific Northwest Laboratory (PNL). The goal of the project is to use GIS technology to analyze impacts of the drawdown mitigation option on the physical and biological environment of the Lower Granite Reservoir. The drawdown mitigation option is based on the hypothesis that faster juvenile salmon travel to the ocean would result in higher juvenile survival and greater smolt-to-adult return ratios; to accomplish this, reservoir elevations would be lowered to increase channel velocities. Altering the elevation of the reservoirs on the Snake River is expected to have a variety of impacts to the Physical environment including changes to water velocity, temperature, dissolved gases, and turbidity. The GIS was developed to evaluate these changes and the resulting impacts on the anadromous and resident fish of the Snake River, as well as other aquatic organisms and terrestrial wildlife residing in the adjacent riparian areas. The Lower Granite GIS was developed using commercial hardware and software and is supported by a commercial relational database. Much of the initial system development involved collecting and incorporating data describing the river channel characteristics, hydrologic properties, and aquatic ecology. Potentially meaningful data for the Lower Granite GIS were identified and an extensive data search was performed. Data were obtained from scientists who are analyzing the habitats, limnology, and hydrology of the Snake River. The next six sections of this document describe the bathymetry, fish abundance, substrate, sediment chemistry, and channel hydrology data.
XL : a communication-efficient routing algorithm
Levchenko, Kirill
2008-01-01
generate link failure events by the Generator program. Thegenerator link event model, a link is either up (nominal weight) or down (in?nite weight); the time between failures andGenerator program generates a sequence of link cost changes according to a stochastic model of link failures.
Benchmarking Derivative-Free Optimization Algorithms
2008-05-13
has encouraged a new wave of theory and algorithms. ... the solver that delivers the largest reduction within a given computational budget. ..... cost per iteration. ..... expensive optimization problems that arise in DOE's SciDAC initiative.
A modified convective/stratiform partitioning algorithm
Listemaa, Steven Alan
1998-01-01
by using different radar reflectivity-rail-ate relationships. Several authors have developed their own convective-stratiform partitioning, but each had its limitations. An algorithm has been developed which partitions precipitating systems...
Large scale prediction models and algorithms
Monsch, Matthieu (Matthieu Frederic)
2013-01-01
Over 90% of the data available across the world has been produced over the last two years, and the trend is increasing. It has therefore become paramount to develop algorithms which are able to scale to very high dimensions. ...
An algorithmic approach to social networks
Liben-Nowell, David
2005-01-01
Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze ...
A Saturation Algorithm for Homogeneous Binomial Ideals
Mehta, Shashank K
A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian at computation in smaller rings is by Kesh and Mehta [7] which also requires the computation of one Gr