Powered by Deep Web Technologies
Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

Optimization Online - Lower Bounds and Exact Algorithms for the ...  

E-Print Network [OSTI]

Dec 16, 2013 ... Lower Bounds and Exact Algorithms for the Quadratic Minimum Spanning Tree Problem. Dilson Pereira(dilsonlucas ***at*** gmail.com)

Dilson Pereira

2013-12-16T23:59:59.000Z

2

NEMS integrating module documentation report  

SciTech Connect (OSTI)

The National Energy Modeling System (NEMS) is a computer-based, energy-economy modeling system of U.S. energy markets for the midterm period. NEMS projects the production, imports, conversion, consumption, and prices of energy, subject to a variety of assumptions. The assumptions encompass macroeconomic and financial factors, world energy markets, resource availability and costs, behavioral and technological choice criteria, technology characteristics, and demographics. NEMS produces a general equilibrium solution for energy supply and demand in the U.S. energy markets on an annual basis through 2015. Baseline forecasts from NEMS are published in the Annual Energy Outlook. Analyses are also prepared in response to requests by the U.S. Congress, the DOE Office of Policy, and others. NEMS was first used for forecasts presented in the Annual Energy Outlook 1994.

NONE

1997-05-01T23:59:59.000Z

3

National Energy Modeling System (NEMS)  

DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

The National Energy Modeling System (NEMS) is a computer-based, energy-economy modeling system of U.S. through 2030. NEMS projects the production, imports, conversion, consumption, and prices of energy, subject to assumptions on macroeconomic and financial factors, world energy markets, resource availability and costs, behavioral and technological choice criteria, cost and performance characteristics of energy technologies, and demographics. NEMS was designed and implemented by the Energy Information Administration (EIA) of the U.S. Department of Energy (DOE). NEMS can be used to analyze the effects of existing and proposed government laws and regulations related to energy production and use; the potential impact of new and advanced energy production, conversion, and consumption technologies; the impact and cost of greenhouse gas control; the impact of increased use of renewable energy sources; and the potential savings from increased efficiency of energy use; and the impact of regulations on the use of alternative or reformulated fuels. NEMS has also been used for a number of special analyses at the request of the Administration, U.S. Congress, other offices of DOE and other government agencies, who specify the scenarios and assumptions for the analysis. Modules allow analyses to be conducted in energy topic areas such as residential demand, industrial demand, electricity market, oil and gas supply, renewable fuels, etc.

4

NEMS Freight Transportation Module Improvement Study  

Gasoline and Diesel Fuel Update (EIA)

and forecast accuracy. Challenges might include new skill development within EIA, contracting for additional commercial services, and possibly altering the manner in which NEMS...

5

Randomized Algorithms and Lower Bounds for Quantum Simulation  

E-Print Network [OSTI]

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.

Chi Zhang

2009-10-21T23:59:59.000Z

6

Obtaining Lower Bounds from the Progressive Hedging Algorithm ...  

E-Print Network [OSTI]

Oct 11, 2013 ... Note that the non-anticipativity constraints (15) define a ..... Complicating constraints are incurred by generator ... Next, we consider the interaction between PHA lower bound quality and .... for assessing wind integration.

2014-01-21T23:59:59.000Z

7

Investigation of residential central air conditioning load shapes in NEMS  

SciTech Connect (OSTI)

This memo explains what Berkeley Lab has learned about how the residential central air-conditioning (CAC) end use is represented in the National Energy Modeling System (NEMS). NEMS is an energy model maintained by the Energy Information Administration (EIA) that is routinely used in analysis of energy efficiency standards for residential appliances. As part of analyzing utility and environmental impacts related to the federal rulemaking for residential CAC, lower-than-expected peak utility results prompted Berkeley Lab to investigate the input load shapes that characterize the peaky CAC end use and the submodule that treats load demand response. Investigations enabled a through understanding of the methodology by which hourly load profiles are input to the model and how the model is structured to respond to peak demand. Notably, it was discovered that NEMS was using an October-peaking load shape to represent residential space cooling, which suppressed peak effects to levels lower than expected. An apparent scaling down of the annual load within the load-demand submodule was found, another significant suppressor of the peak impacts. EIA promptly responded to Berkeley Lab's discoveries by updating numerous load shapes for the AEO2002 version of NEMS; EIA is still studying the scaling issue. As a result of this work, it was concluded that Berkeley Lab's customary end-use decrement approach was the most defensible way for Berkeley Lab to perform the recent CAC utility impact analysis. This approach was applied in conjunction with the updated AEO2002 load shapes to perform last year's published rulemaking analysis. Berkeley Lab experimented with several alternative approaches, including modifying the CAC efficiency level, but determined that these did not sufficiently improve the robustness of the method or results to warrant their implementation. Work in this area will continue in preparation for upcoming rulemakings for the other peak coincident end uses, commercial air conditioning and distribution transformers.

Hamachi LaCommare, Kristina; Marnay, Chris; Gumerman, Etan; Chan, Peter; Rosenquist, Greg; Osborn, Julie

2002-05-01T23:59:59.000Z

8

U.S. Regional Demand Forecasts Using NEMS and GIS  

E-Print Network [OSTI]

Forecasts Using NEMS and GIS National Climatic Data Center.with Changing Boundaries." Use of GIS to Understand Socio-Forecasts Using NEMS and GIS Appendix A. Map Results Gallery

Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris

2005-01-01T23:59:59.000Z

9

Integrated NEMS and optoelectronics for sensor applications.  

SciTech Connect (OSTI)

This work utilized advanced engineering in several fields to find solutions to the challenges presented by the integration of MEMS/NEMS with optoelectronics to realize a compact sensor system, comprised of a microfabricated sensor, VCSEL, and photodiode. By utilizing microfabrication techniques in the realization of the MEMS/NEMS component, the VCSEL and the photodiode, the system would be small in size and require less power than a macro-sized component. The work focused on two technologies, accelerometers and microphones, leveraged from other LDRD programs. The first technology was the nano-g accelerometer using a nanophotonic motion detection system (67023). This accelerometer had measured sensitivity of approximately 10 nano-g. The Integrated NEMS and optoelectronics LDRD supported the nano-g accelerometer LDRD by providing advanced designs for the accelerometers, packaging, and a detection scheme to encapsulate the accelerometer, furthering the testing capabilities beyond bench-top tests. A fully packaged and tested die was never realized, but significant packaging issues were addressed and many resolved. The second technology supported by this work was the ultrasensitive directional microphone arrays for military operations in urban terrain and future combat systems (93518). This application utilized a diffraction-based sensing technique with different optical component placement and a different detection scheme from the nano-g accelerometer. The Integrated NEMS LDRD supported the microphone array LDRD by providing custom designs, VCSELs, and measurement techniques to accelerometers that were fabricated from the same operational principles as the microphones, but contain proof masses for acceleration transduction. These devices were packaged at the end of the work.

Czaplewski, David A.; Serkland, Darwin Keith; Olsson, Roy H., III; Bogart, Gregory R. (Symphony Acoustics, Rio Rancho, NM); Krishnamoorthy, Uma; Warren, Mial E.; Carr, Dustin Wade (Symphony Acoustics, Rio Rancho, NM); Okandan, Murat; Peterson, Kenneth Allen

2008-01-01T23:59:59.000Z

10

NEMS Freight Transportation Module Improvement Study  

Reports and Publications (EIA)

The U.S. Energy Information Administration (EIA) contracted with IHS Global, Inc. (IHS) to analyze the relationship between the value of industrial output, physical output, and freight movement in the United States for use in updating analytic assumptions and modeling structure within the National Energy Modeling System (NEMS) freight transportation module, including forecasting methodologies and processes to identify possible alternative approaches that would improve multi-modal freight flow and fuel consumption estimation.

2015-01-01T23:59:59.000Z

11

How to obtain the National Energy Modeling System (NEMS)  

Reports and Publications (EIA)

The National Energy Modeling System (NEMS) NEMS is used by the modelers at the U. S. Energy Information Administration (EIA) who understand its structure and programming. NEMS has only been used by a few organizations outside of the EIA, because most people that requested NEMS found out that it was too difficult or rigid to use. NEMS is not typically used for state-level analysis and is poorly suited for application to other countries. However, many do obtain the model simply to use the data in its input files or to examine the source code.

2013-01-01T23:59:59.000Z

12

Overview of NEMS-H2, Version 1.0  

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

NEMS-H2, Version 1.0 NEMS-H2, Version 1.0 Frances Wood OnLocation, Inc., Energy Systems Consulting (fwood@onlocationinc.com) January 26, 2006 OnLocation, Inc., Energy Systems Consulting 2 Today's Presentation * Overview of NEMS-H2 Structure * Current Status * New Hydrogen Market Module (HMM) * Transportation Module Modifications * Preliminary Test Runs * Looking Ahead to Next Phase OnLocation, Inc., Energy Systems Consulting 3 NEMS Overview * The National Energy Modeling System (NEMS) was developed and is maintained by EIA - Annual Energy Outlook projections - Congressional as well as agency requests * NEMS has also been used extensively outside of EIA - Various National Laboratories studies - National Commission on Energy Policy - Program offices within DOE for R&D benefits estimation * Modular structure allows each sector to be represented by

13

EIA Buildings Analysis of Consumer Behavior in NEMS  

U.S. Energy Information Administration (EIA) Indexed Site

Buildings Analysis of Consumer Buildings Analysis of Consumer Behavior in NEMS Behavioral Economics Experts Meeting July 17, 2013 | Washington, DC David Peterson Buildings Energy Consumption and Efficiency Analysis Overview Behavioral Economics Experts Meeting, Washington DC, July 17, 2013 2 * NEMS Structure * Housing/floorspace and service demand in Residential Demand Module (RDM) and Commercial Demand Module (CDM) * Market share calculation for equipment in RDM and CDM * Price responses / elasticities * Distributed generation (DG) & combined heat and power (CHP) NEMS Structure Behavioral Economics Experts Meeting, Washington DC, July 17, 2013 3 * Represents energy supply, conversion, and demand in a unified, but modular system * Detailed structural and process models in most energy sectors

14

National Energy Modeling System (NEMS) | Open Energy Information  

Open Energy Info (EERE)

National Energy Modeling System (NEMS) National Energy Modeling System (NEMS) Jump to: navigation, search Tool Summary LAUNCH TOOL Name: National Energy Modeling System (NEMS) Agency/Company /Organization: Energy Information Administration Sector: Energy Focus Area: Economic Development Phase: Develop Goals Topics: Policies/deployment programs Resource Type: Software/modeling tools User Interface: Desktop Application Website: www.eia.gov/oiaf/aeo/overview/index.html OpenEI Keyword(s): EERE tool, National Energy Modeling System, NEMS Language: English References: The National Energy Modeling System: An Overview[1] Project the production, imports, conversion, consumption, and prices of energy, subject to assumptions on macroeconomic and financial factors, world energy markets, resource availability and costs, behavioral and

15

Overview of NEMS-H2, Version 1.0  

Broader source: Energy.gov [DOE]

Presentation on Overview of NEMS-H2, Version 1.0 given by Frances Wood of OnLocation during the DOE Hydrogen Transition Analysis Workshop on January 26, 2006.

16

NEMS Buildings Sector Working Group Meeting  

Gasoline and Diesel Fuel Update (EIA)

20 * Photovoltaic system cost path - Updated 2010 system costs based on Tracking the Sun IV (LBNL, 2011) * No change from AEO2012 for residential, 7% lower for commercial -...

17

U.S. Regional Demand Forecasts Using NEMS and GIS  

SciTech Connect (OSTI)

The National Energy Modeling System (NEMS) is a multi-sector, integrated model of the U.S. energy system put out by the Department of Energy's Energy Information Administration. NEMS is used to produce the annual 20-year forecast of U.S. energy use aggregated to the nine-region census division level. The research objective was to disaggregate this regional energy forecast to the county level for select forecast years, for use in a more detailed and accurate regional analysis of energy usage across the U.S. The process of disaggregation using a geographic information system (GIS) was researched and a model was created utilizing available population forecasts and climate zone data. The model's primary purpose was to generate an energy demand forecast with greater spatial resolution than what is currently produced by NEMS, and to produce a flexible model that can be used repeatedly as an add-on to NEMS in which detailed analysis can be executed exogenously with results fed back into the NEMS data flow. The methods developed were then applied to the study data to obtain residential and commercial electricity demand forecasts. The model was subjected to comparative and statistical testing to assess predictive accuracy. Forecasts using this model were robust and accurate in slow-growing, temperate regions such as the Midwest and Mountain regions. Interestingly, however, the model performed with less accuracy in the Pacific and Northwest regions of the country where population growth was more active. In the future more refined methods will be necessary to improve the accuracy of these forecasts. The disaggregation method was written into a flexible tool within the ArcGIS environment which enables the user to output the results in five year intervals over the period 2000-2025. In addition, the outputs of this tool were used to develop a time-series simulation showing the temporal changes in electricity forecasts in terms of absolute, per capita, and density of demand.

Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris

2005-07-01T23:59:59.000Z

18

A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS  

E-Print Network [OSTI]

other assumptions for wind power to determine which onesused in NEMS regarding wind power to determine their impact

Osborn, Julie G.; Wood, Frances; Richey, Cooper; Sanders, Sandy; Short, Walter; Koomey, Jonathan

2001-01-01T23:59:59.000Z

19

Analysis and Representation of Miscellaneous Electric Loads in NEMS -  

Gasoline and Diesel Fuel Update (EIA)

Analysis and Representation of Miscellaneous Electric Loads in NEMS Analysis and Representation of Miscellaneous Electric Loads in NEMS Release date: January 6, 2014 Miscellaneous Electric Loads (MELs) comprise a growing portion of delivered energy consumption in residential and commercial buildings. Recently, the growth of MELs has offset some of the efficiency gains made through technology improvements and standards in major end uses such as space conditioning, lighting, and water heating. Miscellaneous end uses, including televisions, personal computers, security systems, data center servers, and many other devices, have continued to penetrate into building-related market segments. Part of this proliferation of devices and equipment can be attributed to increased service demand for entertainment, computing, and convenience appliances.

20

All-nanophotonic NEMS biosensor on a chip  

E-Print Network [OSTI]

Integrated chemical and biological sensors give advantages in cost, size and weight reduction and open new prospects for parallel monitoring and analysis. Biosensors based on nanoelectromechanical systems (NEMS) are the most attractive candidates for the integrated platform. However, actuation and transduction techniques (e.g. electrostatic, magnetomotive, thermal or piezoelectric) limit their operation to laboratory conditions. All-optical approach gives the possibility to overcome this problem, nevertheless, the existing schemes are either fundamentally macroscopic or excessively complicated and expensive in mass production. Here we propose a novel scheme of extremely compact NEMS biosensor monolithically integrated on a chip with all-nanophotonic transduction and actuation. It consists of the photonic waveguide and the nanobeam cantilever placed above the waveguide, both fabricated in the same CMOS-compatible process. Being in the near field of the strongly confined photonic mode, cantilever is efficiently...

Fedyanin, Dmitry Yu

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Price Responsiveness in the AEO2003 NEMS Residential and Commercial Buildings Sector Models  

Reports and Publications (EIA)

This paper describes the demand responses to changes in energy prices in the Annual Energy Outlook 2003 versions of the Residential and Commercial Demand Modules of the National Energy Modeling System (NEMS). It updates a similar paper completed for the Annual Energy Outlook 1999 version of the NEMS.

2003-01-01T23:59:59.000Z

22

Nano-Electro-Mechanical (NEM) Relay Devices and Technology for Ultra-Low Energy Digital Integrated Circuits  

E-Print Network [OSTI]

Technology 3.1 Introduction Nano-electro-mechanical (NEM)improvements, a scaled nano-relay technology with optimizedNano-Electro-Mechanical (NEM) Relay Devices and Technology

Nathanael, Rhesa

2012-01-01T23:59:59.000Z

23

The National Energy Modeling System: An Overview 1998 - Overview of NEMS  

Gasoline and Diesel Fuel Update (EIA)

OVERVIEW OF NEMS OVERVIEW OF NEMS blueball.gif (205 bytes) Major Assumptions blueball.gif (205 bytes) NEMS Modular Structure blueball.gif (205 bytes) Integrating Module NEMS represents domestic energy markets by explicitly representing the economic decisionmaking involved in the production, conversion, and consumption of energy products. For example, the penetration of a new or advanced technology for electricity generation is projected only if the technology is deemed to be economic when considering the cost-minimizing mix of fuels over the life of the equipment. Since energy costs and availability and energy- consuming characteristics can vary widely across regions, considerable regional detail is included. Other details of production and consumption categories are represented to

24

The National Energy Modeling System: An Overview 2000 - Overview of NEMS  

Gasoline and Diesel Fuel Update (EIA)

NEMS represents domestic energy markets by explicitly representing the economic decision making involved in the production, conversion, and consumption of energy products. Where possible, NEMS includes explicit representation of energy technologies and their characteristics. NEMS represents domestic energy markets by explicitly representing the economic decision making involved in the production, conversion, and consumption of energy products. Where possible, NEMS includes explicit representation of energy technologies and their characteristics. Since energy costs and availability and energy-consuming characteristics can vary widely across regions, considerable regional detail is included. Other details of production and consumption categories are represented to facilitate policy analysis and ensure the validity of the results. A summary of the detail provided in NEMS is shown below. Summary Table Major Assumptions Each module of NEMS embodies many assumptions and data to characterize the future production, conversion, or consumption of energy in the United States. Two major assumptions concern economic growth in the United States and world oil prices, as determined by world oil supply and demand.

25

Recycling Guide: Reduce, Reuse, Recycle Recycling Information Call 301-496-7990 or visit the NEMS Website at http://www.nems.nih.gov  

E-Print Network [OSTI]

Recycling Guide: Reduce, Reuse, Recycle Recycling Information ­ Call 301-496-7990 or visit the NEMS in COMMINGLED bin Rinse food/beverage containers before recycling No Pyrex or Styrofoam Printer and Copier Toner Cartridges in TONER CARTRIDGE bin Recycle packaging material in appropriate bin NIH charities

Baker, Chris I.

26

Workshop on Opportunities for Magnetism in MEMS/NEMS, April 16-17, 2010  

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

Opportunities for Magnetism in MEMS/NEMS Opportunities for Magnetism in MEMS/NEMS Argonne National Laboratory - April 16-17, 2010 Sponsored by NSF, NIST and Argonne National Laboratory Friday, April 16 13:00 Welcome and Introduction Chair: John Moreland 13:10 Pritiraj Mohanty Boston University "Study of Spin Dynamics using Nanomechanics" 13:50 T. Mitch Wallis NIST, Boulder "Measurement of the Einstein-de Haas Effect with a Microcantilever" 14:30 Albrecht Jander Oregon State University "Application of Torques to Nanostructures using Ferromagnetic Resonance" 15:10 Coffee Break Chair: Dennis Greywall 15:30 Rassul Karabalin Caltech "Next-Generation NEMS Functionality Enable by Advances in Novel Materials"

27

Comparison of Bottom-Up and Top-Down Forecasts: Vision Industry Energy Forecasts with ITEMS and NEMS  

E-Print Network [OSTI]

of the Department of Energy's Office of Industrial Technologies, EIA extracted energy use infonnation from the Annual Energy Outlook (AEO) - 2000 (8) for each of the seven # The Pacific Northwest National Laboratory is operated by Battelle Memorial Institute...-6, 2000 NEMS The NEMS industrial module is the official forecasting model for EIA and thus the Department of Energy. For this reason, the energy prices and output forecasts used to drive the ITEMS model were taken from EIA's AEO 2000. Understanding...

Roop, J. M.; Dahowski, R. T

28

NEM modication prevents high-anity ATP binding to the rst nucleotide binding fold of the sulphonylurea receptor, SUR1  

E-Print Network [OSTI]

NEM modi¢cation prevents high-a¤nity ATP binding to the ¢rst nucleotide binding fold, UK Received 7 July 1999; received in revised form 11 August 1999 Abstract Pancreatic LL-cell ATP WWM 8-azido- [KK-32 P]ATP or 8-azido-[QQ-32 P]ATP was inhibited by NEM with Ki of 1.8 WWM and 2.4 WWM

Tucker, Stephen J.

29

Assessment and Suggestions to Improve the Commercial Building Module of EIA-NEMS  

E-Print Network [OSTI]

use from the base case divided by the total change in lighting electricity use from the base case. VI LIST OF FIGURES Figure 1. Impact of lighting energy reduction on heating and cooling energy use in the large office building Figure 2. Impact...-South-Central) for the Commercial Sector Demand Module of NEMS. Units are in MBtu/sq.ft./year. E = Electricity NG = Natural Gas O = Other LA This was usually done by metering consumption before and after the retrofit and then analyzing the data to account for weather and changes...

O'Neal, D. L.; Reddy, T. A.; Sucher, B.

1996-01-01T23:59:59.000Z

30

Appendix E: Other NEMS-MP results for the base case and scenarios.  

SciTech Connect (OSTI)

The NEMS-MP model generates numerous results for each run of a scenario. (This model is the integrated National Energy Modeling System [NEMS] version used for the Multi-Path Transportation Futures Study [MP].) This appendix examines additional findings beyond the primary results reported in the Multi-Path Transportation Futures Study: Vehicle Characterization and Scenario Analyses (Reference 1). These additional results are provided in order to help further illuminate some of the primary results. Specifically discussed in this appendix are: (1) Energy use results for light vehicles (LVs), including details about the underlying total vehicle miles traveled (VMT), the average vehicle fuel economy, and the volumes of the different fuels used; (2) Resource fuels and their use in the production of ethanol, hydrogen (H{sub 2}), and electricity; (3) Ethanol use in the scenarios (i.e., the ethanol consumption in E85 vs. other blends, the percent of travel by flex fuel vehicles on E85, etc.); (4) Relative availability of E85 and H2 stations; (5) Fuel prices; (6) Vehicle prices; and (7) Consumer savings. These results are discussed as follows: (1) The three scenarios (Mixed, (P)HEV & Ethanol, and H2 Success) when assuming vehicle prices developed through literature review; (2) The three scenarios with vehicle prices that incorporate the achievement of the U.S. Department of Energy (DOE) program vehicle cost goals; (3) The three scenarios with 'literature review' vehicle prices, plus vehicle subsidies; and (4) The three scenarios with 'program goals' vehicle prices, plus vehicle subsidies. The four versions or cases of each scenario are referred to as: Literature Review No Subsidies, Program Goals No Subsidies, Literature Review with Subsidies, and Program Goals with Subsidies. Two additional points must be made here. First, none of the results presented for LVs in this section include Class 2B trucks. Results for this class are included occasionally in Reference 1. They represent a small, though noticeable, segment of the 'LV plus 2B' market (e.g., a little more than 3% of today's energy use in that market). We generally do not include them in this discussion, simply because it requires additional effort to combine the NEMS-MP results for them with the results for the other LVs. (Where there is an exception, we will indicate so.) Second, where reference is made to E85, the ethanol content is actually 74%. The Energy Information Administration (EIA) assumes that, to address cold-starting issues, the percent of ethanol in E85 will vary seasonally. The EIA uses an annual average ethanol content of 74% in its forecasts. That assumption is maintained in the NEMS-MP scenario runs.

Plotkin, S. E.; Singh, M. K.; Energy Systems

2009-12-03T23:59:59.000Z

31

Multi-Path Transportation Futures Study: Vehicle Characterization and Scenario Analyses - Appendix E: Other NEMS-MP Results for the Base Case and Scenarios  

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

Appendix E: Other NEMS-MP Results Appendix E: Other NEMS-MP Results for the Base Case and Scenarios Energy Systems Division Availability of This Report This report is available, at no cost, at http://www.osti.gov/bridge. It is also available on paper to the U.S. Department of Energy and its contractors, for a processing fee, from: U.S. Department of Energy Office of Scientific and Technical Information P.O. Box 62

32

14 - Graphene nanoelectromechanics (NEMS)  

Science Journals Connector (OSTI)

Abstract: The use of graphene in the development of nanoscale mechanical structures is reviewed. The recent development of graphene resonators and techniques used to fabricate and characterise them is described. Some applications in sensor technology are highlighted.

Z. Moktadir

2014-01-01T23:59:59.000Z

33

Arctic Lower Troposphere Observed Structure (ALTOS)  

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

Lower Troposphere Observed Structure (ALTOS) Lower Troposphere Observed Structure (ALTOS) will raise and lower a heavily instrumented tethered balloon system at regular intervals in the lower 2 kilometers of the atmosphere at Oliktok Point. Data obtained during the ALTOS campaign will provide a statistically significant set of observed in situ cloud properties for validating retrieval algorithms and help scientists reduce the uncertainty in the radiative forcing and heating rates on hourly time scales. The data will also help researchers gain a better understanding of the driving processes that control climate changes and determine the state of the Arctic climate system. Collaborators Science Team: The Pennsylvania State University, Stratton

34

Central Ferry Lower Monumental  

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

Projects Wind Projects Central Ferry Lower Monumental Transmission Line Project BPA will build a new 500-kilovolt (kV) transmission line from BPA's Central Ferry...

35

Inexact and accelerated proximal point algorithms  

E-Print Network [OSTI]

Aug 10, 2011 ... Abstract: We present inexact accelerated proximal point algorithms for minimizing a proper lower semicon- tinuous and convex function.

Saverio Salzo

2011-08-10T23:59:59.000Z

36

Algorithmic issues in queueing systems and combinatorial counting problems  

E-Print Network [OSTI]

(cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms ...

Katz-Rogozhnikov, Dmitriy A

2008-01-01T23:59:59.000Z

37

Genetic algorithms  

SciTech Connect (OSTI)

Genetic algorithms solve problems by using principles inspired by natural population genetics: They maintain a population of knowledge structures that represent candidate solutions, and then let that population evolve over time through competition and controlled variation. GAs are being applied to a wide range of optimization and learning problems in many domains.

Grefenstette, J.J.

1994-12-31T23:59:59.000Z

38

Lower East Fork Poplar Creek  

Broader source: Energy.gov [DOE]

This document explains the cleanup activities and any use limitations for the land surrounding the Lower East Fork Poplar Creek.

39

TOWARDS AFFECTIVE ALGORITHMIC COMPOSITION  

E-Print Network [OSTI]

TOWARDS AFFECTIVE ALGORITHMIC COMPOSITION Duncan Williams* , Alexis Kirke* , Eduardo Reck Miranda are driving an emerging field: affective algorithmic composition. Strate- gies for algorithmic composition within the last decade) implementing systems for algorithmic composition with the intention of targeting

Miranda, Eduardo Reck

40

Central Ferry-Lower Monumental  

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

Projects Spacer Damper Replacement Program Wind Projects Central Ferry-Lower Monumental BPA will build a new 500-kilovolt (kV) transmission line from BPA's Central Ferry...

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Lowering Barriers | Department of Energy  

Office of Environmental Management (EM)

Lowering Barriers DOE is working to improve solar market conditions in order to create green jobs and increase the availability of clean, renewable energy for Americans. Efforts...

42

Japan may lower investment bars  

Science Journals Connector (OSTI)

Japan may lower investment bars ... But Minister of International Trade and Industry Takeo Miki did indicate that his ministry is studying the feasibility of easing restrictions on foreign investments, industry by industry. ...

1966-07-11T23:59:59.000Z

43

Lower Cost Carbon Fiber Precursors  

Broader source: Energy.gov (indexed) [DOE]

1 Lower Cost Carbon Fiber Precursors P.I. Name: Dave Warren Presenter: Dr. Amit K. Naskar Oak Ridge National Laboratory 05162012 Project ID LM004 This presentation does not...

44

Algorithm Development & Stepwise Refinement Algorithm Development  

E-Print Network [OSTI]

? Daylight savings time? Another required property of an algorithm is that each step can actually be carried to have no solution; algorithm asserts that a sub- problem will be solved without specifying how; etc

Murphy, John

45

Deductive Algorithmic Knowledge  

Science Journals Connector (OSTI)

......Original Articles Deductive Algorithmic Knowledge Riccardo Pucella Northeastern University...June 2005. The framework of algorithmic knowledge assumes that agents use algorithms to...reasoning about both implicit and explicit knowledge with the latter defined with respect......

Riccardo Pucella

2006-04-01T23:59:59.000Z

46

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

: Perfect Matching Graph Algorithms 6 #12;Edge Covering An edge covering, EC E, is a set of edges #12;Example: Edge Covering Graph Algorithms 8 #12;Example: Minimal Edge Covering Graph Algorithms 9 #12;Example: Minimum Size Edge Covering Graph Algorithms 10 #12;Matching and Edge Covering Definition

Bar-Noy, Amotz

47

Lower bounds on mutual information  

Science Journals Connector (OSTI)

We correct claims about lower bounds on mutual information (MI) between real-valued random variables made by Kraskov et al., Phys. Rev. E 69, 066138 (2004). We show that non-trivial lower bounds on MI in terms of linear correlations depend on the marginal (single variable) distributions. This is so in spite of the invariance of MI under reparametrizations, because linear correlations are not invariant under them. The simplest bounds are obtained for Gaussians, but the most interesting ones for practical purposes are obtained for uniform marginal distributions. The latter can be enforced in general by using the ranks of the individual variables instead of their actual values, in which case one obtains bounds on MI in terms of Spearman correlation coefficients. We show with gene expression data that these bounds are in general nontrivial, and the degree of their (non)saturation yields valuable insight.

David V. Foster and Peter Grassberger

2011-01-20T23:59:59.000Z

48

Lower Sioux Wind Feasibility & Development  

SciTech Connect (OSTI)

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.

Minkel, Darin

2012-04-01T23:59:59.000Z

49

How Efficient Can We Be?: Bounds on Algorithm Energy Consumption  

E-Print Network [OSTI]

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

California at Irvine, University of

50

Tensor rank : some lower and upper bounds  

E-Print Network [OSTI]

The results of Strassen [25] and Raz [19] show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit ...

Forbes, Michael Andrew

2011-01-01T23:59:59.000Z

51

Reconstruction algorithms for MRI  

E-Print Network [OSTI]

This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...

Bilgic?, Berkin

2013-01-01T23:59:59.000Z

52

ALGORITHM FOR ACCNT  

Energy Science and Technology Software Center (OSTI)

002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance

53

Distributed Algorithms Distributed Transactions  

E-Print Network [OSTI]

Algorithms© Gero Mühl 8 Concurrency Control serial RC (ReCoverable) ACA (Avoiding Cascading Aborts) ST (StricDistributed Algorithms Distributed Transactions PD Dr.-Ing. Gero Mühl Kommunikations- und Betriebssysteme Fakultät für Elektrotechnik u. Informatik Technische Universität Berlin #12;Distributed Algorithms

Wichmann, Felix

54

Assignment: Greedy Algorithms Name: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  

E-Print Network [OSTI]

Algorithms Assignment: Greedy Algorithms Name to finding the largest set of jobs that can be scheduled on one machine. · Ordering by a non-decreasing order, there are inputs for which this greedy algorithm produces a solution whose profit is almost 1/n of the optimal

Bar-Noy, Amotz

55

Network Algorithms (Lecture Notes)  

E-Print Network [OSTI]

Network Algorithms (Lecture Notes) Dr. Stefan Schmid Thanks to Prof. Dr. Roger Wattenhofer and Prof to the Network Algorithms course! Computer systems are becoming more distributed and networked. This has two main, in order to fully exploit the distributed resource network, efficient algorithms need to be designed

Schmid, Stefan

56

Randomized Algorithms Robert Elsasser  

E-Print Network [OSTI]

Randomized Algorithms Robert Els¨asser 15. June 2011 Program of the day: · Random walks on graphs Robert Els¨asser Universit¨at Paderborn Randomized Algorithms SS 11 0 #12;Markov Chains and Random Walks¨asser Universit¨at Paderborn Randomized Algorithms SS 11 1 #12;Markov Chains and Random Walks A Markov chain M

Elsässer, Robert

57

Extrapolating Environmental Benefits from IGCC in NEMS  

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

August 2008 (April August 2008 (April 2009 Revision) DOE/NETL-402/080108 Water Requirements for Existing and Emerging Thermoelectric Plant Technologies Disclaimer This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference therein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or

58

Lower hybrid wavepacket stochasticity revisited  

SciTech Connect (OSTI)

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}?510{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].

Fuchs, V.; Krln, L.; Pnek, R.; Preinhaelter, J.; Seidl, J.; Urban, J. [Institute of Plasma Physics AS CR, v.v.i., Prague, CZ, Association EURATOM/IPP.CR (Czech Republic); Laqua, H. P. [Max Planck Institute fr Plasmaphysik, EURATOM Association, D-17491 Greifswald (Germany)

2014-02-12T23:59:59.000Z

59

SunShot Initiative: Lowering Barriers  

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

Lowering Barriers to someone by Lowering Barriers to someone by E-mail Share SunShot Initiative: Lowering Barriers on Facebook Tweet about SunShot Initiative: Lowering Barriers on Twitter Bookmark SunShot Initiative: Lowering Barriers on Google Bookmark SunShot Initiative: Lowering Barriers on Delicious Rank SunShot Initiative: Lowering Barriers on Digg Find More places to share SunShot Initiative: Lowering Barriers on AddThis.com... Concentrating Solar Power Photovoltaics Systems Integration Balance of Systems Reducing Non-Hardware Costs Lowering Barriers Fostering Growth Lowering Barriers DOE is working to improve solar market conditions in order to create green jobs and increase the availability of clean, renewable energy for Americans. Efforts to promote favorable policies and encourage easier

60

Distributed algorithms for mobile ad hoc networks  

E-Print Network [OSTI]

]. In the algorithms in [9], each node keeps a value, called its height, from a totally ordered set (typically, a tuple of integers), and links are logically considered to be directed from higher to lower heights. The heights are manipulated when topology changes... in advance the type and dimensions of the polyhedron that is used for the quanti- zation of S; furthermore, the nodes must be able to measure the distance that they cover when they move. All this adds to the complexity of the algorithm. Also, the ?ori...

Malpani, Navneet

2012-06-07T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Sampling Within k-Means Algorithm to Cluster Large Datasets  

SciTech Connect (OSTI)

Due to current data collection technology, our ability to gather data has surpassed our ability to analyze it. In particular, k-means, one of the simplest and fastest clustering algorithms, is ill-equipped to handle extremely large datasets on even the most powerful machines. Our new algorithm uses a sample from a dataset to decrease runtime by reducing the amount of data analyzed. We perform a simulation study to compare our sampling based k-means to the standard k-means algorithm by analyzing both the speed and accuracy of the two methods. Results show that our algorithm is significantly more efficient than the existing algorithm with comparable accuracy. Further work on this project might include a more comprehensive study both on more varied test datasets as well as on real weather datasets. This is especially important considering that this preliminary study was performed on rather tame datasets. Also, these datasets should analyze the performance of the algorithm on varied values of k. Lastly, this paper showed that the algorithm was accurate for relatively low sample sizes. We would like to analyze this further to see how accurate the algorithm is for even lower sample sizes. We could find the lowest sample sizes, by manipulating width and confidence level, for which the algorithm would be acceptably accurate. In order for our algorithm to be a success, it needs to meet two benchmarks: match the accuracy of the standard k-means algorithm and significantly reduce runtime. Both goals are accomplished for all six datasets analyzed. However, on datasets of three and four dimension, as the data becomes more difficult to cluster, both algorithms fail to obtain the correct classifications on some trials. Nevertheless, our algorithm consistently matches the performance of the standard algorithm while becoming remarkably more efficient with time. Therefore, we conclude that analysts can use our algorithm, expecting accurate results in considerably less time.

Bejarano, Jeremy [Brigham Young University; Bose, Koushiki [Brown University; Brannan, Tyler [North Carolina State University; Thomas, Anita [Illinois Institute of Technology; Adragni, Kofi [University of Maryland; Neerchal, Nagaraj [University of Maryland; Ostrouchov, George [ORNL

2011-08-01T23:59:59.000Z

62

Lower bounds for randomized Exclusive Write PRAMs  

SciTech Connect (OSTI)

In this paper we study the question: How useful is randomization in speeding up Exclusive Write PRAM computations? Our results give further evidence that randomization is of limited use in these types of computations. First we examine a compaction problem on both the CREW and EREW PRAM models, and we present randomized lower bounds which match the best deterministic lower bounds known. (For the CREW PRAM model, the lower bound is asymptotically optimal.) These are the first non-trivial randomized lower bounds known for the compaction problem on these models. We show that our lower bounds also apply to the problem of approximate compaction. Next we examine the problem of computing boolean functions on the CREW PRAM model, and we present a randomized lower bound, which improves on the previous best randomized lower bound for many boolean functions, including the OR function. (The previous lower bounds for these functions were asymptotically optimal, but we improve the constant multiplicative factor.) We also give an alternate proof for the randomized lower bound on PARITY, which was already optimal to within a constant additive factor. Lastly, we give a randomized lower bound for integer merging on an EREW PRAM which matches the best deterministic lower bound known. In all our proofs, we use the Random Adversary method, which has previously only been used for proving lower bounds on models with Concurrent Write capabilities. Thus this paper also serves to illustrate the power and generality of this method for proving parallel randomized lower bounds.

MacKenzie, P.D.

1995-05-02T23:59:59.000Z

63

Winter Energy Savings from Lower Thermostat Settings  

Reports and Publications (EIA)

This discussion provides details on the effect of lowering thermostat settings during the winter heating months of 1997.

2000-01-01T23:59:59.000Z

64

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

-regular bipartite graph has a perfect matching. Definition 3: A vertex cover of a graph G = (V, E) is a set Q VGraph Algorithms Robert Els¨asser 10 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

65

Genetic Algorithms: Applications  

E-Print Network [OSTI]

Independent Set Problem ffl Bin Packing Problem ffl Maximum Set Covering Problem ffl Terminal AssignmentGenetic Algorithms: Applications Sami Khuri Dept. of Math. & Computer Science San Jos'e State; GA Applications: Topics Today's Topics ffl Brief Introduction to the Simple Genetic Algorithm. ffl

Khuri, Sami

66

Studienarbeit Tuning Algorithms for  

E-Print Network [OSTI]

-time algorithms when k is fixed. (For example, given a graph, decide if it has a Vertex Cover of size at most k solution for Vertex Cover or Dominating Set is determined with the help of dynamic programming, whichStudienarbeit Tuning Algorithms for Hard Planar Graph Problems Frederic Dorn Betreuer: Dipl

Fomin, Fedor V.

67

Tight Lower Bounds for st-Connectivity on the NNJAG Model (jeff@cs.yorku.ca)  

E-Print Network [OSTI]

4=3) on the NNJAG model by Edmonds Edm93a]. Our lower bound is tight for S 2 O(n1 ), for any > 0 to the size of the internal mem- ory of a machine. In these applications algorithms that run in small space

Edmonds, Jeff

68

Sandia National Laboratories: lowering costs associated with...  

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

lowering costs associated with geothermal energy production Sandia and Atlas-Copco Secoroc Advance to Phase 2 in Their Geothermal Energy Project On July 31, 2013, in Energy,...

69

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

. Definition 3: A vertex cover of a graph G = (V, E) is a set Q V , such that each edge of E is incidentGraph Algorithms Robert Els¨asser 17 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

70

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

Coloring Definition I: A disjoint collection of independent sets that cover all the vertices in the graphGraph Algorithms Vertex Coloring Graph Algorithms #12;The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A B EF C D A B C D E F A 0 1 1 1 0 0 B 1 0

Bar-Noy, Amotz

71

Lower bound and an optimal algorithm for leader election in faulty asynchronous general networks  

E-Print Network [OSTI]

the problem of electing a leader in faulty asynchronous general net- works. The network coritams a reliable path connecting all the nodes in the network. The type of failure the links experience is interinittent. Since thc network is asyn- chronous... are faulty in nature. A faulty network may contain either faulty nodes, faulty links or both. In reliable networlcs, even if some of the elements fail, the whole network still will work reliably, giving the impression that everytliing is fine. Under a...

Lateef, Mohammed Afroz

2012-06-07T23:59:59.000Z

72

Algorithms With Impact (CpSc 940: Advanced Algorithms)  

E-Print Network [OSTI]

Algorithms With Impact (CpSc 940: Advanced Algorithms) Instructor: Dr. Brian Dean Fall 2011 Webpage and Course Goals The study of algorithms is a significant part of the foundation for the discipline of computer science. Over the past several decades, research in algorithmic computer science has advanced

Dean, Brian C.

73

Viscosity profile of the lower mantle  

Science Journals Connector (OSTI)

......October 1985 research-article Articles Viscosity profile of the lower mantle Kirk Ellsworth...determine the variation of effective viscosity across the lower mantle from models of...consistent with recent estimates of mantle viscosity from post-glacial rebound and true......

Kirk Ellsworth; Gerald Schubert; Charles G. Sammis

1985-10-01T23:59:59.000Z

74

Strict Lower Bounds for Model Checking BPA  

E-Print Network [OSTI]

Strict Lower Bounds for Model Checking BPA Richard Mayr Institut f¨ur Informatik, Technische lower bounds for the complexity of several model checking problems for BPA and branching­time logics Algebra (BPA) processes were defined by Bergstra and Klop in [BK85]. They are transition systems

?ayr, Richard

75

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre, Switzerland luca@idsia.ch Abstract This paper overviews recent work on ant algorithms, that is, algorithms and of some of the most important aspects of the ACO meta-heuristic. 1 Introduction Ant algorithms were first

Gambardella, Luca Maria

76

SWAP: PARALLELIZATION THROUGH ALGORITHM SUBSTITUTION  

E-Print Network [OSTI]

://code.google.com/p/ thrust). There is a vast set of tasks that pro- grammers want to perform, and few of the algorithms: PARALLELIZATION THROUGH ALGORITHM SUBSTITUTION ................................................................................................................................................................................................................... BY EXPLICITLY INDICATING WHICH ALGORITHMS THEY USE AND ENCAPSULATING THESE ALGORITHMS WITHIN SOFTWARE COMPONENTS

Eeckhout, Lieven

77

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo Gianni Di Caro IRIDIA CP 194/6 Universit algorithms, ant colony optimiza- tion, swarm intelligence, metaheuris- tics, natural computation Abstract This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete

Hutter, Frank

78

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit#19;e, Switzerland luca@idsia.ch Abstract This paper overviews recent work on ant algorithms, that is, algorithms work and of some of the most important aspects of the ACO meta-heuristic. 1 Introduction Ant algorithms

Ducatelle, Frederick

79

ALGORITHMS FOR CONSTRUCTING COMPARATIVE MAPS  

E-Print Network [OSTI]

. In this paper we present e#cient algorithms that help in automating this e#ort and o#er an explicit setALGORITHMS FOR CONSTRUCTING COMPARATIVE MAPS Debra S. Goldberg Susan McCouch Jon Kleinberg expert analysis, a simple linear algorithm, and a more complex stack­based algorithm. All three methods

Kleinberg, Jon

80

Lower Saccharide Nanometric Materials and Methods  

DOE Patents [OSTI]

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.

Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek

2004-07-13T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Quantum Lower Bounds by Polynomials Robert Beals  

E-Print Network [OSTI]

Quantum Lower Bounds by Polynomials Robert Beals University of Arizonaz Harry Buhrman CWI.O. Box 210089, 617 N. Santa Rita Ave, Tucson AZ 85721­0089, USA. E-mail: beals@math.arizona.edu. xCWI, P

de Wolf, Ronald

82

Nonlocality improves Deutsch algorithm  

E-Print Network [OSTI]

Recently, [{arXiv:0810.3134}] is accepted and published. We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered a use of entangled photon pairs to determine simultaneously and probabilistically two unknown functions. The usual Deutsch algorithm determines one unknown function and exhibits a two to one speed up in a certain computation on a quantum computer rather than on a classical computer. We found that the violation of Bell locality in the Hilbert space formalism of quantum theory predicts that the proposed {\\it probabilistic} Deutsch algorithm for computing two unknown functions exhibits at least a $2\\sqrt{2}(\\simeq 2.83)$ to one speed up.

Koji Nagata; Sangkyung Lee; Jaewook Ahn

2007-03-15T23:59:59.000Z

83

Approximation Algorithms Tandy Warnow  

E-Print Network [OSTI]

size and 1 / . #12;Approximation algorithms for: Minimum Vertex Cover (finding a set of vertices-SAT 3-SAT DIR-HAM-CYCLEINDEPENDENT SET VERTEX COVER GRAPH 3-COLOR HAM-CYCLE TSP SUBSET-SUM SCHEDULINGPLANAR 3-COLOR SET COVER NP-Completeness by definition of NP-completeness #12;NP-hard Optimization

Warnow,Tandy

84

Genetic algorithm eclipse mapping  

E-Print Network [OSTI]

In this paper we analyse capabilities of eclipse mapping technique, based on genetic algorithm optimization. To model of accretion disk we used the "fire-flies" conception. This model allows us to reconstruct the distribution of radiating medium in the disk using less number of free parameters than in other methods. Test models show that we can achieve good approximation without optimizing techniques.

Halevin, A V

2008-01-01T23:59:59.000Z

85

A BIASED RANDOM-KEY GENETIC ALGORITHM FOR ROUTING ...  

E-Print Network [OSTI]

Apr 4, 2010 ... much faster than the currently available electronic devices for signal reception and transmission. ..... This genetic algorithm does not make use of the .... provided by the heuristic and a lower bound lb for the optimal cost, calculated as ..... In Handbook for Optimization in Telecommunications, pages 637677.

Thiago

86

CS 105: Algorithms (Grad) Approximation Algorithms (continued) Feb 21, 2005  

E-Print Network [OSTI]

.g. Clique. = O(log n), e.g. Set Cover. = O(1), e.g. Vertex Cover. Page 1 of 7 #12;CS 105: Algorithms (Grad Algorithms: Vertex Cover 1.1 Introduction to Approximation Algorithms There are several optimization problems (TSP) - finding a minimum cost tour of all cities � Vertex Cover - find minimum set of vertex

Chakrabarti, Amit

87

Comments of the Lower Colorado River Authority | Department of...  

Broader source: Energy.gov (indexed) [DOE]

the Lower Colorado River Authority Comments of the Lower Colorado River Authority Comments of the Lower Colorado River Authority on Implementing the National Broadband Plan by...

88

Lower Hybrid to Whistler Wave Conversion  

SciTech Connect (OSTI)

In this presentation we discuss recent work concerning the conversion of whistler waves to lower hybrid waves (as well as the inverse process). These efforts have been motivated by the issue of attenuation of upward propagating whistler waves in the ionosphere generated by VLF transmitters on the ground, i.e., the 'Starks 20 db' problem, which affects the lifetimes of energetic electrons trapped in the geomagnetic field at low magnetic altitude (L). We discuss recent fluid and kinetic plasma simulations as well as ongoing experiments at UCLA to quantify linear and nonlinear mode conversion of lower hybrid to whistler waves.

Winske, Dan [Los Alamos National Laboratory

2012-07-16T23:59:59.000Z

89

The optimization problem Genetic Algorithm  

E-Print Network [OSTI]

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

Giménez, Domingo

90

A lower bound for routing on a completely connected optical communication parallel computer  

SciTech Connect (OSTI)

The task of routing a 2-relation on an n-processor completely connected optical communication parallel computer (OCPC) is considered. A lower bound is presented that applies to any randomized distributed algorithm for this task: specifically, it is shown that the expected number of steps required to route a 2-relation is {Omega}({radical} log log n) in the worst case. For comparison, the best upper bound known is O(log log n).

Goldberg, L.A. [Sandia National Labs., Albuquerque, NM (United States); Jerrum, M. [Edinburgh Univ. (United Kingdom). Dept. of Computer Science; MacKenzie, P.D. [Texas Univ., Austin, TX (United States). Dept. of Computer Sciences

1993-08-03T23:59:59.000Z

91

Deutsch and Jozsa's Algorithm Revisited  

E-Print Network [OSTI]

A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed

John W. Cooper

2006-03-27T23:59:59.000Z

92

Shrinking Procedures and Optimal Algorithms  

E-Print Network [OSTI]

Jun 18, 2012 ... Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal...

Saeed Ghadimi

2012-06-18T23:59:59.000Z

93

Primitives for animation of algorithms  

E-Print Network [OSTI]

are the difficulty to animate algorithms automatically (or even manually) and the lack of color which is an important visual attribute. TANGO [23] (transition-based animation generation) is another algorithm animation system developed using a path... are the difficulty to animate algorithms automatically (or even manually) and the lack of color which is an important visual attribute. TANGO [23] (transition-based animation generation) is another algorithm animation system developed using a path...

Sudarsky, Sandra

2012-06-07T23:59:59.000Z

94

THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN  

E-Print Network [OSTI]

of solar composition studies. The first column labeled "radial" describes the overall structure of the workTHE 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

Rutten, Rob

95

EQUATIONS FOR LOWER BOUNDS ON BORDER RANK  

E-Print Network [OSTI]

EQUATIONS FOR LOWER BOUNDS ON BORDER RANK JONATHAN D. HAUENSTEIN, CHRISTIAN IKENMEYER, AND J of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 multiplication operator M2, which gives a new proof that the border rank of the multiplication of 2 ? 2 matrices

Hauenstein, Jonathan

96

Localized velocity anomalies in the lower mantle  

Science Journals Connector (OSTI)

......projection centred on the Argentina source region. The location...approximately 80" from the Argentina source region. S-waves...Bolivia are dominated by SV energy, and large Sp precursors...closer to the stations than Argentina. Lower mantle velocity anomalies......

Thorne Lay

1983-02-01T23:59:59.000Z

97

EARTH SCIENCES Lower-Division Requirements  

E-Print Network [OSTI]

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

Constable, Steve

98

Lower Snake River I | Open Energy Information  

Open Energy Info (EERE)

Lower Snake River I Lower Snake River I Jump to: navigation, search Name Lower Snake River I Facility Lower Snake River I Sector Wind energy Facility Type Commercial Scale Wind Facility Status In Service Owner Puget Sound Energy Developer Puget Sound Energy Energy Purchaser Puget Sound Energy Location South of Pomeroy and north of Pataha Creek in Garfield County Coordinates 46.375632°, -117.703257° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":46.375632,"lon":-117.703257,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

99

Multipartite entanglement in quantum algorithms  

SciTech Connect (OSTI)

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyze the multipartite entanglement properties in the Deutsch-Jozsa, Grover, and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.

Bruss, D. [Institut fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf, D-40225 Duesseldorf (Germany); Macchiavello, C. [Dipartimento di Fisica 'A. Volta' and INFN-Sezione di Pavia, Via Bassi 6, 27100 Pavia (Italy)

2011-05-15T23:59:59.000Z

100

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path

Bar-Noy, Amotz

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Stability of Coupling Algorithms  

E-Print Network [OSTI]

INTRODUCTION AND MOTIVATION : : : : : : : : : : : : : 1 A. Approaches to solving a coupled system . . . . . . . . . . . 3 B. Common terminology . . . . . . . . . . . . . . . . . . . . . 5 C. Classi cation of coupling algorithms . . . . . . . . . . . . . 7 1... equal, cA = cB = mA = mB = 1 and with dissipation, = 0:5 : : : : : : : : : : : : : : : : 26 10 Conditional stability observed with cA > cB. The material prop- erties: cA = 100; cB = 1; mA = mB = 1; = 1 : : : : : : : : : : : : : 27 11 An unstable...

Akkasale, Abhineeth

2012-07-16T23:59:59.000Z

102

Nonlinear lower hybrid modeling in tokamak plasmas  

SciTech Connect (OSTI)

We present here new results concerning the nonlinear mechanism underlying the observed spectral broadening produced by parametric instabilities occurring at the edge of tokamak plasmas in present day LHCD (lower hybrid current drive) experiments. Low frequency (LF) ion-sound evanescent modes (quasi-modes) are the main parametric decay channel which drives a nonlinear mode coupling of lower hybrid (LH) waves. The spectrum of the LF fluctuations is calculated here considering the beating of the launched LH wave at the radiofrequency (RF) operating line frequency (pump wave) with the noisy background of the RF power generator. This spectrum is calculated in the frame of the kinetic theory, following a perturbative approach. Numerical solutions of the nonlinear LH wave equation show the evolution of the nonlinear mode coupling in condition of a finite depletion of the pump power. The role of the presence of heavy ions in a Deuterium plasma in mitigating the nonlinear effects is analyzed.

Napoli, F.; Schettini, G. [Universit Roma Tre, Dipartimento di Ingegneria, Roma (Italy); Castaldo, C.; Cesario, R. [Associazione EURATOM/ENEA sulla Fusione, Centro Ricerche Frascati (Italy)

2014-02-12T23:59:59.000Z

103

LOWER TRANSPORT BOUNDS FOR ONEDIMENSIONAL CONTINUUM SCHR  

E-Print Network [OSTI]

of Alabama, Birmingham, AL 35294, U.S.A., E­Mail: stolz@math.uab.edu Dedicated to Joachim Weidmann for the associated whole­line operator, denoted by H, as well as for the associated selfadjoint operator HD on [0 D. DAMANIK, D. LENZ, G. STOLZ (lower di#usion exponents) (4) # - f (p) := lim inf T## log M f (T , p

Damanik, David

104

PVT Analysis With A Deconvolution Algorithm  

SciTech Connect (OSTI)

Polyvinyl Toluene (PVT) plastic scintillator is the most common gamma ray detector material used for large systems when only gross counting is needed because of its low cost, robustness, and relative sensitivity. PVT does provide some energy information about the incident photons, as has been demonstrated through the development of Energy Windowing analysis. There is a more sophisticated energy analysis algorithm developed by Symetrica, Inc., and they have demonstrated the application of their deconvolution algorithm to PVT with very promising results. The thrust of such a deconvolution algorithm used with PVT is to allow for identification and rejection of naturally occurring radioactive material, reducing alarm rates, rather than the complete identification of all radionuclides, which is the goal of spectroscopic portal monitors. Under this condition, there could be a significant increase in sensitivity to threat materials. The advantage of this approach is an enhancement to the low cost, robust detection capability of PVT-based radiation portal monitor systems. The success of this method could provide an inexpensive upgrade path for a large number of deployed PVT-based systems to provide significantly improved capability at a much lower cost than deployment of NaI(Tl)-based systems of comparable sensitivity.

Kouzes, Richard T.

2011-02-01T23:59:59.000Z

105

Prospects and Limitations of Algorithmic Cooling  

E-Print Network [OSTI]

Heat-bath algorithmic cooling (AC) of spins is a theoretically powerful effective cooling approach, that (ideally) cools spins with low polarization exponentially better than cooling by reversible entropy manipulations alone. Here, we investigate the limitations and prospects of AC. For non-ideal and semioptimal AC, we study the impact of finite relaxation times of reset and computation spins on the achievable effective cooling. We derive, via simulations, the attainable cooling levels for given ratios of relaxation times using two semioptimal practicable algorithms. We expect this analysis to be valuable for the planning of future experiments. For ideal and optimal AC, we make use of lower bounds on the number of required reset steps, based on entropy considerations, to present important consequences of using AC as a tool for improving signal-to-noise ratio in liquid-state magnetic resonance spectroscopy. We discuss the potential use of AC for noninvasive clinical diagnosis and drug monitoring, where it may have significantly lower specific absorption rate (SAR) with respect to currently used methods.

Gilles Brassard; Yuval Elias; Tal Mor; Yossi Weinstein

2014-04-27T23:59:59.000Z

106

MODELING OF LOWER LIMBS FOR VIBROTACTILE COMPENSATION Martin J.-D. Otis, Guillaume Millet, Stephane Beniak, and Jeremy R. Cooperstock  

E-Print Network [OSTI]

. A real-time algorithm is developed, based on an FFT filter-bank and a rheological limb model, which-synthesis filter-bank and rheological modeling of lower limbs. A previous study demonstrated that we could compensate for the structural properties of the tile, obtaining a flat response in the desired frequency

Cooperstock, Jeremy R.

107

A bridge to lower overhead quantum computation  

E-Print Network [OSTI]

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.

Austin G. Fowler; Simon J. Devitt

2012-09-04T23:59:59.000Z

108

Spherical Harmonic Transform Algorithms  

SciTech Connect (OSTI)

A collection of MATLAB classes for computing spherical harmonic transforms are presented and used to solve simple partial differential equations on the sphere. The spectral synthesis and analysis using fast Fourier transforms and Legendre transforms with the associated Legendre functions are presented in depth. A set of methods associated with a spectral\\_field class provides spectral approximation to the $\\DIV$, $\\CURL$, $\\GRAD$, and $\\LAPL$ in spherical geometr y. Laplace inversion and Helmholtz equation solvers are also methods for this clas s. Investigation of algorithms and analysis for spherical harmonic transform optio ns for parallel high performance computers are discussed in the context of global climate and weather models.

Drake, John B [ORNL; Worley, Patrick H [ORNL; D'Azevedo, Eduardo [ORNL

2008-01-01T23:59:59.000Z

109

Spectral energetics of the lower thermosphere  

SciTech Connect (OSTI)

A spectral energetics analysis of the lower thermosphere is carried out using simulated data from the NCAR Thermosphere-Ionosphere General Circulation Model (TIGCM). The results clarify the physical processes through which upwardly propagating semidiurnal tides dissipate and release their energy into the lower thermosphere. Energy residing within the study region is partitioned into reservoirs of available potential energy, irrotational kinetic energy, and nondivergent kinetic energy at four vertical levels. A definition of available potential energy is used that is appropriate for regions of variable mean molecular weight. The reservoirs are further subdivided by vector spherical harmonic wave numbers, and an energy budget is computed for each mode. The source, sink, and transformation terms are obtained using a post-processor that reproduces the contribution of each term in the momentum and thermodynamic equations. The loss terms for the zonal wave number two modes represent the dissipating forces for the semidiurnal tides. Viscosity, heat conduction, and ion drag represent the primary dissipative forces. Numerical smoothing within the TIGCM, representing the subgrid-scale diffusion, is found to have a non-negligible contribution to the tidal dissipation. A small terdiurnal tide that is excited by ion drag is also observed in the model. A sensitivity analysis is carried out to ascertain the effects of the seasonal cycle, solar cycle, UT, and geomagnetic activity. At solar maximum, solar heating at the trough of the tide is an important dissipative force; the altitude of tidal dissipation is correspondingly lower. At high values of geomagnetic forcing, the propagating semidiurnal tide is completely dissipated within the study region.

Raskin, R.G.

1992-01-01T23:59:59.000Z

110

OPEC agrees to lower oil prices, production  

Science Journals Connector (OSTI)

OPEC agrees to lower oil prices, production ... The attempt to stabilize prices and salvage some of OPEC's eroding control of the world oil market forced the cartel to make the first price cut in its history. ... U.S. government officials, predicting that the price ultimately would fall to between $25 and $27 per barrel from the new benchmark level of $29, said the new price would increase domestic production of goods and services 0.4% and cut consumer prices in the U.S. nearly 1.0%. ...

1983-03-21T23:59:59.000Z

111

Pulverizer performance upgrades lower fuel costs  

SciTech Connect (OSTI)

Between 2002 and 2005, combustion equipment modifications were carried out at St. Johns River Power Plant in Jacksonville, FL. The effort succeeded in obtaining the desired emission reductions and to increase petroleum coke consumption. Since 2005 the boilers typically fired a blend of 70% Colombia coal and 30% delayed petroleum coke. To realize significant fuel savings, the pulverizer capacity was increased by 14% to allow a lower grade coal to be used. The article describes the changes made to the pulverizer to allow 11,800 Btu/pound coal to be burnt, with annual savings of $6.3 m beginning in 2006. 4 figs., 1 tab.

Hansen, T.

2007-05-15T23:59:59.000Z

112

Environmental analysis of Lower Pueblo/Lower Los Alamos Canyon, Los Alamos, New Mexico  

SciTech Connect (OSTI)

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.

Ferenbaugh, R.W.; Buhl, T.E.; Stoker, A.K.; Becker, N.M.; Rodgers, J.C.; Hansen, W.R.

1994-12-01T23:59:59.000Z

113

Non adiabatic quantum search algorithms  

E-Print Network [OSTI]

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.

A. Perez; A. Romanelli

2007-06-08T23:59:59.000Z

114

AN ENGINE OIL LIFE ALGORITHM.  

E-Print Network [OSTI]

??An oil-life algorithm to calculate the remaining percentage of oil life is presented as a means to determine the right time to change the oil (more)

Bommareddi, Anveshan

2009-01-01T23:59:59.000Z

115

Optimization Online - Coordinate descent algorithms  

E-Print Network [OSTI]

Dec 1, 2014 ... Stephen Wright(swright ***at*** cs.wisc.edu). Abstract: Coordinate descent algorithms solve optimization problems by successively minimizing...

Stephen Wright

2014-12-01T23:59:59.000Z

116

Messy genetic algorithms: Recent developments  

SciTech Connect (OSTI)

Messy genetic algorithms define a rare class of algorithms that realize the need for detecting appropriate relations among members of the search domain in optimization. This paper reviews earlier works in messy genetic algorithms and describes some recent developments. It also describes the gene expression messy GA (GEMGA)--an {Omicron}({Lambda}{sup {kappa}}({ell}{sup 2} + {kappa})) sample complexity algorithm for the class of order-{kappa} delineable problems (problems that can be solved by considering no higher than order-{kappa} relations) of size {ell} and alphabet size {Lambda}. Experimental results are presented to demonstrate the scalability of the GEMGA.

Kargupta, H. [Los Alamos National Lab., NM (United States). Computational Science Methods Group

1996-09-01T23:59:59.000Z

117

I Lower Yakima Valley Wetlands and Riparian  

Broader source: Energy.gov (indexed) [DOE]

I I Lower Yakima Valley Wetlands and Riparian - Restoration Project \ , Final Environmental Assessment DOENo. 0941 c Bonneville Power kdmi.nistration, Yakama Indian Nation, Bureawof Indian Affairs % J e;r%mBlYTlON OF THIS DOCUMENT IS UNLIMITED DISCLAIMER This report was .prepared as a n account of work sponsored by an agency of t h e United States Government. Neither t h e United States Government nor any agency thereof, nor any of their employees, make any warranty, express or implied, or assumes a n y legal liability or responsibility for t h e accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial

118

Lower Colorado River Authority | Open Energy Information  

Open Energy Info (EERE)

River Authority River Authority Jump to: navigation, search Name Lower Colorado River Authority Place Texas Utility Id 11269 Utility Location Yes Ownership S NERC Location TRE NERC ERCOT Yes ISO Ercot Yes Operates Generating Plant Yes Activity Generation Yes Activity Transmission Yes Activity Buying Transmission Yes Activity Distribution Yes Activity Bundled Services Yes Alt Fuel Vehicle Yes Alt Fuel Vehicle2 Yes References EIA Form EIA-861 Final Data File for 2010 - File1_a[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Utility Rate Schedules Grid-background.png No rate schedules available. Average Rates No Rates Available References ↑ "EIA Form EIA-861 Final Data File for 2010 - File1_a"

119

Lower Cost, Higher Performance Carbon Fiber  

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

David (Dave) Warren David (Dave) Warren Field Technical Manager Transportation Materials Research Oak Ridge National Laboratory P.O. Box 2009, M/S 8050 Oak Ridge, Tennessee 37831-8050 Phone: 865-574-9693 Fax: 865-574-0740 Email: WarrenCD@ORNL.GOV Lower Cost, Higher Performance Carbon Fiber 14 February 2011 2 Managed by UT-Battelle for the U.S. Department of Energy Presentation_name Questions for Today Materials How can the cost of carbon fiber suitable for higher performance applications (H 2 Storage) be developed? H 2 Storage requirements implies Aerospace grade fibers. Can we build off of work previously done for more modest structural applications? To accurately answer: We need to know the minimum performance and maximum cost requirements of the fiber not simply the properties of current fiber.

120

Lower Valley Energy Inc | Open Energy Information  

Open Energy Info (EERE)

Jump to: navigation, search Jump to: navigation, search Name Lower Valley Energy Inc Place Idaho Utility Id 11273 References Energy Information Administration.[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Utility Rate Schedules Grid-background.png C-1 Small Commercial Commercial C-2 Large Power Service Commercial I-1 Small Irrigation Service Commercial I-2 Large Irrigation Service Commercial I-3 Small Irrigation Optional Commercial L-1 Street and Yard Light Service-100W Sodium Vapor Lighting L-1 Street and Yard Light Service-175W Sodium Vapor Lighting L-1 Street and Yard Light Service-200W Sodium Vapor Lighting L-1 Street and Yard Light Service-250W Sodium Vapor Lighting L-1 Street and Yard Light Service-400W Sodium Vapor Lighting

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Light water reactor lower head failure analysis  

SciTech Connect (OSTI)

This document presents the results from a US Nuclear Regulatory Commission-sponsored research program to investigate the mode and timing of vessel lower head failure. Major objectives of the analysis were to identify plausible failure mechanisms and to develop a method for determining which failure mode would occur first in different light water reactor designs and accident conditions. Failure mechanisms, such as tube ejection, tube rupture, global vessel failure, and localized vessel creep rupture, were studied. Newly developed models and existing models were applied to predict which failure mechanism would occur first in various severe accident scenarios. So that a broader range of conditions could be considered simultaneously, calculations relied heavily on models with closed-form or simplified numerical solution techniques. Finite element techniques-were employed for analytical model verification and examining more detailed phenomena. High-temperature creep and tensile data were obtained for predicting vessel and penetration structural response.

Rempe, J.L.; Chavez, S.A.; Thinnes, G.L. [EG and G Idaho, Inc., Idaho Falls, ID (United States)] [and others

1993-10-01T23:59:59.000Z

122

Will customer choice always lower costs?  

SciTech Connect (OSTI)

Since competition may either increase or decrease electricity costs for individual customers, regulators need the authority and tools to determine whether retail competition will result in a lower or higher cost of electric service, and whether anti-competitive conduct can be detected. Today`s regulations of the electric industry generally allows only a single supplier to serve all retail customers within an exclusive service territory. Due to changes in technology, law, and in what might best be called philosophy, many large customers are now being joined by independent power producers, marketers and brokers in arguing that a multitude of suppliers should be allowed to compete to serve retail customers. Thus, a critical issue regulators and legislatures must address is whether or not to allow more than one supplier of electricity at the retail level. The primary economic rationale for permitting exclusive service territories and a single retail provider is the existence of a natural monopoly. The driving force for retail competition, on the other hand, is the perception that a less costly non-utility option is available for a number of customers. Conventional wisdom seems to see natural monopoly and lower-cost options for customers as mutually exclusive alternatives. That is, it is often thought that there can be no less costly alternative for any customer if a natural monopoly exists. Conversely, if there is a cheaper alternative for any customer, many see this as evidence that a natural monopoly no longer exists, and that free entry into the retail market should be allowed.

Corneli, S.B.

1996-10-01T23:59:59.000Z

123

Lower Cost Carbon Fiber Precursors | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Lower Cost Carbon Fiber Precursors Lower Cost Carbon Fiber Precursors 2010 DOE Vehicle Technologies and Hydrogen Programs Annual Merit Review and Peer Evaluation Meeting, June...

124

Brain insulin lowers circulating BCAA levels by inducing hepatic...  

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

Brain insulin lowers circulating BCAA levels by inducing hepatic BCAA catabolism. Brain insulin lowers circulating BCAA levels by inducing hepatic BCAA catabolism. Abstract:...

125

An algorithm for the difference between set covers  

Science Journals Connector (OSTI)

A set cover for a set S is a collection C of special subsets whose union is S . Given covers A and B for two sets, the set-cover difference problem is to construct a new cover for the elements covered by A but not B . Applications include testing equivalence of set covers and maintaining a set cover dynamically. In this paper, we solve the set-cover difference problem by defining a difference operation A - B , which turns out to be a pseudocomplement on a distributive lattice. We give an algorithm for constructing this difference, and show how to implement the algorithm for two examples with applications in computer science: face covers on a hypercube, and rectangle covers on a grid. We derive an upper bound on the time complexity of the algorithm, and give upper and lower bounds on complexity for face covers and rectangle covers.

D.S. Franzblau; G. Xenakis

2008-01-01T23:59:59.000Z

126

Fixed Parameter Algorithms Daniel Marx  

E-Print Network [OSTI]

, for example k-CLIQUE and k-INDEPENDENT SET, no FPT algorithm is known. Can we show that these problems if and only if it has a vertex cover of size n - k. Transforming an INDEPENDENT SET instance (G, k, but INDEPENDENT SET is not known to be FPT. Fixed Parameter Algorithms ­ p.5/41 #12;Parameterized reduction

Fondements et Applications, Université Paris 7

127

ALGEBRAIC AND NUMERICAL ALGORITHMS 1  

E-Print Network [OSTI]

ALGEBRAIC AND NUMERICAL ALGORITHMS 1 Ioannis Z. Emiris National Kapodistrian University of Athens as manipulation with truncated series and algebraic sets. Such problems can be solved based on the error by employing various nontrivial computational techniques such as the Euclidean algorithm and continuous

Tsigaridas, Elias

128

Accidental Algorithms Leslie G. Valiant  

E-Print Network [OSTI]

Accidental Algorithms Leslie G. Valiant Division of Engineering and Applied Sciences Harvard also show a similar dichtomy for a vertex cover problem. To derive completeness results we use a new show in this way that 2CNF, the parity problem for 2CNF, is P-complete. To derive efficient algorithms

Valiant, Leslie

129

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

11/11/10 1 L21: "Irregular" Graph Algorithms November 11, 2010 Administrative ·Class cancelled Monday, November 22, 11:59 PM Today we will cover Successive Over Relaxation. Here is the sequential code ·Irregular parallel computation - Sparse matrix operations (last time) and graph algorithms (this time

Hall, Mary W.

130

ALGEBRAIC AND NUMERICAL ALGORITHMS1  

E-Print Network [OSTI]

ALGEBRAIC AND NUMERICAL ALGORITHMS1 Ioannis Z. Emiris National Kapodistrian University of Athens as manipulation with truncated series and algebraic sets. Such problems can be solved based on the error by employing various nontrivial computational techniques such as the Euclidean algorithm and continuous

Tsigaridas, Elias

131

A Genetic Algorithm for Coverage Problems  

E-Print Network [OSTI]

or all classes covered) Genetic Algorithm step on P producing child population C: Roulette genetic algorithm 2. A GENETIC ALGORITHM FOR COVER- AGE PROBLEMS We have devised a genetic algorithmA Genetic Algorithm for Coverage Problems Colin Johnson Computing Laboratory, University of Kent

Kent, University of

132

Generalized Greedy Algorithm for Shortest Superstring  

E-Print Network [OSTI]

an approximation factor of 2. The greedy set covering algorithm. To see that the approximation factor of GreedyHn factor approximation algorithm, using the greedy set cover algorithm [11], where Hn = 1 + 1 2 + 1 of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced

Markowitch, Olivier

133

A combinatorial algorithm for MAX CSP  

Science Journals Connector (OSTI)

We consider the problem MAX CSP over multi-valued domains with variables ranging over sets of size si ? s and constraints involving kj ? k variables. We study two algorithms with approximation ratios A ... Keywords: algorithmical approximation, analysis of algorithms, combinatorial problems, databases, design of algorithms, graph algorithms

Mayur Datar; Toms Feder; Aristides Gionis; Rajeev Motwani; Rina Panigrahy

2003-03-01T23:59:59.000Z

134

960 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 Low-Complexity Soft-Decoding Algorithms  

E-Print Network [OSTI]

to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which-Decoding Algorithms for Reed­Solomon Codes--Part II: Soft-Input Soft-Output Iterative Decoding Jason Bellorado with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing

Ping, Li

135

Natural Gas Productive Capacity for the Lower-48 States  

Gasoline and Diesel Fuel Update (EIA)

for the Lower-48 States for the Lower-48 States 6/4/01 Click here to start Table of Contents Natural Gas Productive Capacity for the Lower-48 States Natural Gas Productive Capacity for the Lower-48 States Natural Gas Productive Capacity for the Lower-48 States - Summary - Natural Gas Productive Capacity for the Lower-48 States - Summary - PPT Slide Natural Gas Productive Capacity for the Lower-48 States - Summary - Natural Gas Productive Capacity for the Lower-48 States - Methodology - Natural Gas Productive Capacity for the Lower-48 States - Methodology - Natural Gas Productive Capacity for the Lower-48 States - Methodology - PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide PPT Slide Other Areas PPT Slide PPT Slide PPT Slide

136

Dynamic Algorithm for Space Weather Forecasting System  

E-Print Network [OSTI]

We propose to develop a dynamic algorithm that intelligently analyzes existing solar weather data and constructs an increasingly more accurate equation/algorithm for predicting solar weather accurately in real time. This dynamic algorithm analyzes a...

Fischer, Luke D.

2011-08-08T23:59:59.000Z

137

Berkeley Algorithms Help Researchers Understand Dark Energy  

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

Berkeley Algorithms Help Researchers Understand Dark Energy Berkeley Algorithms Help Researchers Understand Dark Energy November 24, 2014 | Tags: Astrophysics Contact: Linda Vu, +1...

138

Approximation Algorithms Vijay V. Vazirani  

E-Print Network [OSTI]

: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 I COMBINATORIAL ALGORITHMS 2 Set cover and its application to shortest superstring­duality : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 52 11 Rounding applied to set cover : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 59 12 LP­duality based analysis for set cover

Porat, Ely

139

Randomized algorithms for reliable broadcast  

E-Print Network [OSTI]

In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...

Vaikuntanathan, Vinod

2009-01-01T23:59:59.000Z

140

Standards for graph algorithm primitives  

E-Print Network [OSTI]

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...

Mattson, Tim

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

An Algorithm for Bootstrapping Communications  

E-Print Network [OSTI]

I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time. Communication is robust and ...

Beal, Jacob

2001-08-13T23:59:59.000Z

142

Fully relativistic lattice Boltzmann algorithm  

SciTech Connect (OSTI)

Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through simulations of a quark-gluon plasma, yielding excellent agreement with hydrodynamic simulations. The present scheme opens the possibility of transferring the recognized computational advantages of lattice kinetic theory to the context of both weakly and ultrarelativistic systems.

Romatschke, P. [Frankfurt Institute for Advanced Studies, D-60438 Frankfurt (Germany); Mendoza, M. [ETH Zuerich, Computational Physics for Engineering Materials, Institute for Building Materials, Schafmattstrasse 6, HIF, CH-8093 Zuerich (Switzerland); Succi, S. [Istituto per le Applicazioni del Calcolo C.N.R., Via dei Taurini, 19 I-00185, Rome (Italy); Freiburg Institute for Advanced Studies, Albertstrasse, 19, D-79104, Freiburg (Germany)

2011-09-15T23:59:59.000Z

143

Particle-particle, particle-scaling function algorithm for electrostatic problems in free boundary conditions  

Science Journals Connector (OSTI)

An algorithm for fast calculation of the Coulombic forces and energies of point particles with free boundary conditions is proposed. Its calculation time scales as N log N for N particles. This novel method has lower crossover point with the full O ( N 2 ) direct summation than the fast multipole method. The forces obtained by our algorithm are analytical derivatives of the energy which guarantees energy conservation during a molecular dynamics simulation. Our algorithm is very simple. A version of the code parallelized with the Message Passing Interface can be downloaded under the GNU General Public License from the website of our group.

Alexey Neelov; S. Alireza Ghasemi; Stefan Goedecker

2007-01-01T23:59:59.000Z

144

Patch-Levy-based initialization algorithm for Bees Algorithm  

Science Journals Connector (OSTI)

Abstract The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.

Wasim A. Hussein; Shahnorbanun Sahran; Siti Norul Huda Sheikh Abdullah

2014-01-01T23:59:59.000Z

145

Lower oil prices also cutting winter heating oil and propane...  

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

Lower oil prices also cutting winter heating oil and propane bills Lower oil prices are not only driving down gasoline costs, but U.S. consumers will also see a bigger savings in...

146

Capturing Waste Gas: Saves Energy, Lower Costs - Case Study,...  

Office of Environmental Management (EM)

Capturing Waste Gas: Saves Energy, Lower Costs - Case Study, 2013 Capturing Waste Gas: Saves Energy, Lower Costs - Case Study, 2013 ArcelorMittal USA, Inc.'s Indiana Harbor steel...

147

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2005 Annual Report.  

SciTech Connect (OSTI)

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

Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game

2009-02-18T23:59:59.000Z

148

Advanced Algorithms Course. Lecture Notes. Part 2  

E-Print Network [OSTI]

Advanced Algorithms Course. Lecture Notes. Part 2 Set Cover This is a very fundamental problem approximation algorithm. A natural greedy rule is to successively add sets Si to the solution, that cover Si be the set that covers this sj in the greedy algorithm. Since the algorithm always picks an Si

Damaschke, Peter

149

ZART: A Multifunctional Itemset Mining Algorithm  

E-Print Network [OSTI]

ZART: A Multifunctional Itemset Mining Algorithm Laszlo Szathmary1 , Amedeo Napoli1 , and Sergei O independent, multi-purposed data mining platform, incorporating a rich collection of data mining algorithms. One of these algorithms is a multifunctional itemset mining algorithm called Zart, which is based

Boyer, Edmond

150

The Observer Algorithm for Visibility Approximation  

E-Print Network [OSTI]

other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areasThe Observer Algorithm for Visibility Approximation Per-Magnus OLSSON a and Patrick DOHERTY present a novel algorithm for visibility approximation that is sub- stantially faster than ray casting

Doherty, Patrick

151

Introduction to Algorithms April 8, 2014  

E-Print Network [OSTI]

1 CS38 Introduction to Algorithms Lecture 3 April 8, 2014 April 8, 2014 CS38 Lecture 3 2 Outline · greedy algorithms... ­ Dijkstra's algorithm for single-source shortest paths · guest lecturer (this lecture and next) ­ coin changing ­ interval scheduling ­ MCST (Prim and Kruskal) Greedy algorithms

Umans, Chris

152

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

{u e}. Graph Algorithms 8 #12;Example: A Vertex Cover Set Graph Algorithms 9 #12;Example: A Minimum Size Vertex Cover Set Graph Algorithms 10 #12;A Clique A set of vertices for which all possible edges * * * * * Graph Algorithms 20 #12;Independent Sets and Vertex Cover Sets Observation: I is an independent set

Bar-Noy, Amotz

153

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan Volume II ­ Subbasin Plan Chapter J ­ Wind Lower Columbia Fish Recovery Board December 15, 2004 #12;Preface This is one in a series Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White

154

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2004 Annual Report.  

SciTech Connect (OSTI)

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

Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game

2009-02-18T23:59:59.000Z

155

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.  

SciTech Connect (OSTI)

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

Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game

2009-02-18T23:59:59.000Z

156

A Cavity QED Implementation of Deutsch-Jozsa Algorithm  

E-Print Network [OSTI]

The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.

E. S. Guerra

2004-10-23T23:59:59.000Z

157

A preliminary evaluation of a speed threshold incident detection algorithm  

E-Print Network [OSTI]

detection algorithm. San Antonio's new traffic management center, TransGuide, uses a new speed based algorithm, The TXDOT (Texas Department of Transportation) Speed algorithm. This research compares the TXDOT Speed algorithm with California algorithm #8...

Kolb, Stephanie Lang

1996-01-01T23:59:59.000Z

158

Lower Valley Energy - Residential Energy Efficiency Rebate Program |  

Broader source: Energy.gov (indexed) [DOE]

Lower Valley Energy - Residential Energy Efficiency Rebate Program Lower Valley Energy - Residential Energy Efficiency Rebate Program Lower Valley Energy - Residential Energy Efficiency Rebate Program < Back Eligibility Residential Savings Category Home Weatherization Commercial Weatherization Appliances & Electronics Sealing Your Home Ventilation Heating & Cooling Commercial Heating & Cooling Water Heating Windows, Doors, & Skylights Program Info State Wyoming Program Type Utility Rebate Program Rebate Amount Energy Audit: Discounted Cost Weatherization Measures: Varies Marathon Water Heater: $25 Water Heater: $15 - $25 Clothes Washer: $25 - $50 Refrigerator: $15 Refrigerator Recycling: $75 Energy Star Manufactured Home: $1,000 Geothermal Heat Pumps: Up to $2,100 Provider Lower Valley Energy Lower Valley Energy offers numerous rebates for residential customers who

159

Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in  

Alternative Fuels and Advanced Vehicles Data Center [Office of Energy Efficiency and Renewable Energy (EERE)]

Alternative Fuel Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio to someone by E-mail Share Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on Facebook Tweet about Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on Twitter Bookmark Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on Google Bookmark Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on Delicious Rank Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on Digg Find More places to share Alternative Fuels Data Center: Alternative Fuel Vehicles Lower Emissions in Columbus, Ohio on AddThis.com...

160

Audio Binary Halftone Watermarking Algorithm  

Science Journals Connector (OSTI)

Conventional audio watermarking method has the following deficiencies: the embedded watermarking signal bits are too less; the image watermarking pre-process is too simple which reduce the security; the embedded audio watermarking is meaningless binary sequence. To address these problems, we propose a robust audio watermarking algorithm based on audio binary halftone pre-process. The meaningful audio watermarking can be preprocessed to high-fidelity binary audio. The variable dimension operation is used to scramble the host audio. Experiments show the proposed algorithm has big embedding quantity, high security, strong practicability and robustness in enduring common attacks.

Huan Li; Zheng Qin; Xuanping Zhang; Xu Wang

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Computational problems algorithmsComputational problems, algorithms, runtime, hardness  

E-Print Network [OSTI]

we model set cover as an integer program? · See examples Algorithms and runtime · We would see (a brief introduction to theoretical computer science) slides by Vincent Conitzer Set Cover (a a T of size at most k will suffice Set Cover (a computational problem) · One instance of the set cover problem

Allan, Vicki H.

162

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2003 Annual Report.  

SciTech Connect (OSTI)

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

Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game

2009-02-18T23:59:59.000Z

163

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 1998 Annual Report.  

SciTech Connect (OSTI)

This project monitored the daily passage of chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka, during the 1998 spring outmigration at migrant traps on the Snake and Salmon rivers. All hatchery chinook salmon released above Lower Granite Dam 19 1998 were marked with a fin-clip. Total annual hatchery chinook salmon catch at the Snake River trap was 226% of the 1997 number and 110% of the 1996 catch. The wild chinook catch was 120% of the 1997 catch but was only 93% of 1996. Hatchery steelhead trout catch was 501% of 1997 numbers but only 90% of the 1996 numbers. Wild steelhead trout catch was 569% of 1997 and 125% of the 1996 numbers. The Snake River trap collected 106 age-0 chinook salmon. During 1998, for the first time, the Snake River trap captured a significant number of hatchery sockeye salmon (1,552) and hatchery coho salmon O. kisutch (166). 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 high flows. Trap operations began on March 8 and were terminated for the season due to high flows on June 12. The trap was out of operation for 34 d during the season due to high flow and debris. Hatchery chinook salmon catch at the Salmon River trap was 476% and wild chinook salmon catch was 137% of 1997 numbers and 175% and 82% of 1996 catch, respectively. The hatchery steelhead trout collection in 1998 was 96% of the 1997 catch and 13% of the 1996 numbers. Wild steelhead trout collection in 1998 was 170% of the 1997 catch and 37% of the 1996 numbers. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged chinook salmon and steelhead trout, marked at the head of the reservoir were affected by discharge. For fish tagged at the Snake River trap, statistical analysis of 1998 detected a significant relation between migration rate and discharge. For hatchery and wild chinook salmon there was a 2.0- and 2.6-fold increase in migration rate, respectively, between 50 and 100 thousands of cubic feet per second (kcfs). For hatchery steelhead trout there was a 2.6-fold increase in migration rate between 50 kcfs and 100 kcfs. For fish marked at the Salmon River trap, statistical analysis of the 1998 data detected a significant relation between migration rate and discharge for hatchery and wild chinook salmon hatchery and found a 3.3- and 2.6-fold increase in migration rate, respectively, between 50 and 100 kcfs. A significant relation between migration rate and discharge was not detected for hatchery steelhead trout. Insufficient numbers of wild steelhead trout were PIT-tagged at the Salmon River trap to estimate travel time and migration rate to Lower Granite Dam.

Buettner, Edwin W.; Brimmer, Arnold F.

2000-04-01T23:59:59.000Z

164

GEET DUGGAL Algorithms for Determining  

E-Print Network [OSTI]

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

165

CIPRES: Algorithmic Challenges Bernard Moret  

E-Print Network [OSTI]

CIPRES: Algorithmic Challenges Bernard Moret University of New Mexico Phylogenetic Reconstruction difference in the two sets of induced bipartitions. � RF distance treats all bipartitions equally in most settings. � Maximum likelihood (ML): maximize probability that the data could have been produced

Moret, Bernard

166

5 Hyperspectral Data Processing Algorithms  

E-Print Network [OSTI]

121 5 Hyperspectral Data Processing Algorithms Antonio Plaza, Javier Plaza, Gabriel Martín), able to cover the wavelength region from 400 to 2500nm using more than 200 spec- tral channels. The special characteristics of hyperspectral data sets pose different processing problems [3], which must

Plaza, Antonio J.

167

Fixed Parameter Algorithms Dniel Marx  

E-Print Network [OSTI]

complexity Problem: VERTEX COVER INDEPENDENT SET Input: Graph G, integer k Graph G, integer k Question-complete NP-complete Fixed Parameter Algorithms ­ p.3/40 #12;Parameterized complexity Problem: VERTEX COVER INDEPENDENT SET Input: Graph G, integer k Graph G, integer k Question: Is it possible to cover the edges

Narasayya, Vivek

168

Parrondo Games and Quantum Algorithms  

E-Print Network [OSTI]

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.

Chiu Fan Lee; Neil Johnson

2002-03-10T23:59:59.000Z

169

Why is Boris algorithm so good?  

SciTech Connect (OSTI)

Due to its excellent long term accuracy, the Boris algorithm is the de facto standard for advancing a charged particle. Despite its popularity, up to now there has been no convincing explanation why the Boris algorithm has this advantageous feature. In this paper, we provide an answer to this question. We show that the Boris algorithm conserves phase space volume, even though it is not symplectic. The global bound on energy error typically associated with symplectic algorithms still holds for the Boris algorithm, making it an effective algorithm for the multi-scale dynamics of plasmas.

Qin, Hong [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China) [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China); Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States); Zhang, Shuangxi; Xiao, Jianyuan; Liu, Jian [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China)] [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China); Sun, Yajuan [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China)] [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China); Tang, William M. [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States)] [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States)

2013-08-15T23:59:59.000Z

170

Why is Boris Algorithm So Good?  

SciTech Connect (OSTI)

Due to its excellent long term accuracy, the Boris algorithm is the de facto standard for advancing a charged particle. Despite its popularity, up to now there has been no convincing explanation why the Boris algorithm has this advantageous feature. In this letter, we provide an answer to this question. We show that the Boris algorithm conserves phase space volume, even though it is not symplectic. The global bound on energy error typically associated with symplectic algorithms still holds for the Boris algorithm, making it an effective algorithm for the multi-scale dynamics of plasmas.

et al, Hong Qin

2013-03-03T23:59:59.000Z

171

SRS Recovery Act Completes Major Lower Three Runs Project Cleanup |  

Broader source: Energy.gov (indexed) [DOE]

SRS Recovery Act Completes Major Lower Three Runs Project Cleanup SRS Recovery Act Completes Major Lower Three Runs Project Cleanup SRS Recovery Act Completes Major Lower Three Runs Project Cleanup American Recovery and Reinvestment Act can now claim that 85 percent of the Savannah River Site (SRS) has been cleaned up with the recent completion of the Lower Three Runs (stream) Project. Twenty miles long, Lower Three Runs leaves the main body of the 310-square mile site and runs through parts of Barnwell and Allendale Counties until it flows into the Savannah River. Government property on both sides of the stream acts as a buffer as it runs through privately-owned property. Completing this project reduces the site's footprint by another 10 percent. SRS Recovery Act Completes Major Lower Three Runs Project Cleanup More Documents & Publications

172

SRS Recovery Act Completes Major Lower Three Runs Project Cleanup |  

Broader source: Energy.gov (indexed) [DOE]

SRS Recovery Act Completes Major Lower Three Runs Project Cleanup SRS Recovery Act Completes Major Lower Three Runs Project Cleanup SRS Recovery Act Completes Major Lower Three Runs Project Cleanup American Recovery and Reinvestment Act can now claim that 85 percent of the Savannah River Site (SRS) has been cleaned up with the recent completion of the Lower Three Runs (stream) Project. Twenty miles long, Lower Three Runs leaves the main body of the 310-square mile site and runs through parts of Barnwell and Allendale Counties until it flows into the Savannah River. Government property on both sides of the stream acts as a buffer as it runs through privately-owned property. Completing this project reduces the site's footprint by another 10 percent. SRS Recovery Act Completes Major Lower Three Runs Project Cleanup More Documents & Publications

173

OUTDOOR RECREATION DEMAND AND EXPENDITURES: LOWER SNAKE RIVER RESERVOIRS  

E-Print Network [OSTI]

i OUTDOOR RECREATION DEMAND AND EXPENDITURES: LOWER SNAKE RIVER RESERVOIRS John R. Mc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v SECTION ONE - OUTDOOR RECREATION DEMAND . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Recreation Demand Methods

O'Laughlin, Jay

174

Optimization Online - Lower Bounding Procedures for the Single ...  

E-Print Network [OSTI]

Nov 30, 2014 ... Lower Bounding Procedures for the Single Allocation Hub Location Problem. Borzou Rostami(brostami ***at*** mathematik.tu-dortmund.de)

Borzou Rostami

2014-11-30T23:59:59.000Z

175

,"Lower 48 Federal Offshore Natural Gas Plant Liquids, Expected...  

U.S. Energy Information Administration (EIA) Indexed Site

Of Series","Frequency","Latest Data for" ,"Data 1","Lower 48 Federal Offshore Natural Gas Plant Liquids, Expected Future Production (Million Barrels)",1,"Annual",2...

176

,"Lower 48 Federal Offshore Coalbed Methane Proved Reserves ...  

U.S. Energy Information Administration (EIA) Indexed Site

Of Series","Frequency","Latest Data for" ,"Data 1","Lower 48 Federal Offshore Coalbed Methane Proved Reserves (Billion Cubic Feet)",1,"Annual",2013 ,"Release...

177

Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate...  

U.S. Energy Information Administration (EIA) Indexed Site

Liquids Lease Condensate, Proved Reserves (Million Barrels) Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate, Proved Reserves (Million Barrels) Decade Year-0 Year-1...

178

,"Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate...  

U.S. Energy Information Administration (EIA) Indexed Site

Of Series","Frequency","Latest Data for" ,"Data 1","Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate, Proved Reserves (Million Barrels)",1,"Annual",2...

179

Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate...  

Gasoline and Diesel Fuel Update (EIA)

Reserves Based Production (Million Barrels) Lower 48 Federal Offshore Natural Gas Liquids Lease Condensate, Reserves Based Production (Million Barrels) Decade Year-0 Year-1 Year-2...

180

Lower Watts Bar Reservoir Clinch River/Poplar Creek  

Broader source: Energy.gov [DOE]

This document explains the cleanup activities and any use limitations for the land surrounding the Lower Watts Bar Reservoir Clinch River/Poplar Creek.

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Energy Department Announces $25 Million to Lower Cost of Concentrating...  

Energy Savers [EERE]

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

182

Lower 48 States Crude Oil + Lease Condensate Estimated Production...  

U.S. Energy Information Administration (EIA) Indexed Site

Estimated Production from Reserves (Million Barrels) Lower 48 States Crude Oil + Lease Condensate Estimated Production from Reserves (Million Barrels) Decade Year-0 Year-1 Year-2...

183

Lower 48 Federal Offshore Natural Gas Plant Liquids, Expected...  

U.S. Energy Information Administration (EIA) Indexed Site

Plant Liquids, Expected Future Production (Million Barrels) Lower 48 Federal Offshore Natural Gas Plant Liquids, Expected Future Production (Million Barrels) Decade Year-0 Year-1...

184

Lower 48 Federal Offshore Natural Gas Plant Liquids, Reserves...  

Gasoline and Diesel Fuel Update (EIA)

Reserves Based Production (Million Barrels) Lower 48 Federal Offshore Natural Gas Plant Liquids, Reserves Based Production (Million Barrels) Decade Year-0 Year-1 Year-2 Year-3...

185

Developing a Lower Cost and Higher Energy Density Alternative...  

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

for Advanced Batteries ADVANCED MANUFACTURING OFFICE Developing a Lower Cost and Higher Energy Density Alternative to Lithium-Ion Batteries Introduction As the world moves toward...

186

Accurate Detection of Impurities in Hydrogen Fuel at Lower Cost...  

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

Accurate Detection of Impurities in Hydrogen Fuel at Lower Cost Technology available for licensing: Two alternative strategies for detecting impurities in the hydrogen used in fuel...

187

BELLORADO, KAV CI C, LI PING: IEEE TRANSACTIONS ON INFORMATION THEORY LETTERS 1 Low Complexity Soft Decoding Algorithms for Reed-Solomon  

E-Print Network [OSTI]

a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes Soft Decoding Algorithms for Reed-Solomon Codes: Part II - Soft-Input-Soft-Output Iterative Decoding with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing

Kavcic, Aleksandar

188

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 1997 Annual Report.  

SciTech Connect (OSTI)

This project monitored the daily passage of chinook salmon Oncorhynchus tshawytscha and steelhead trout O. mykiss smolts during the 1997 spring out-migration at migrant traps on the Snake River and Salmon River. All hatchery chinook salmon released above Lower Granite Dam were marked with a fin clip in 1997. Total annual hatchery chinook salmon catch at the Snake River trap was 49% of the 1996 number but only 6% of the 1995 catch. The wild chinook catch was 77% of the 1996 but was only 13% of 1995. Hatchery steelhead trout catch was 18% of 1996 numbers but only 7% of the 1995 numbers. Wild steelhead trout catch was 22% of 1996 but only 11% of the 1995 numbers. The Snake River trap collected eight age-0 chinook salmon and one sockeye/kokanee salmon O. nerka. 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 high flows. Trap operations were terminated for the season due to high flows and trap damage on May 8 and were out of operation for 23 d due to high flow and debris. Hatchery chinook salmon catch at the Salmon River trap was 37% and wild chinook salmon catch was 60% of 1996 numbers but only 5% and 11% of 1995 catch, respectively. The 1997 hatchery steelhead trout collection was 13% of the 1996 catch and 32% of the 1995 numbers. Wild steelhead trout collection in 1997 was 21% of the 1996 catch and 13% of the 1995 numbers. Trap operations were terminated for the season due to high flows and trap damage on May 7 and were out of operation for 19 d due to high flow and debris.

Buettner, Edwin W.; Nelson, William R.

1999-04-01T23:59:59.000Z

189

Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 1999 Annual Report.  

SciTech Connect (OSTI)

This project monitored the daily passage of chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 1999 spring out-migration at migrant traps on the Snake River and Salmon River. All hatchery chinook salmon released above Lower Granite Dam were marked with a fin clip in 1999. Total annual hatchery chinook salmon catch at the Snake River trap was 440% of the 1998 number. The wild chinook catch was 603% of the previous year's catch. Hatchery steelhead trout catch was 93% of 1998 numbers. Wild steelhead trout catch was 68% of 1998 numbers. The Snake River trap collected 62 age-0 chinook salmon. During 1998 the Snake River trap captured 173 hatchery and 37 wild/natural sockeye salmon and 130 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 high flows. Trap operations began on March 14 and were terminated for the season due to high flows on May 25. The trap was out of operation for 18 d during the season due to high flow and debris. Hatchery chinook salmon catch at the Salmon River trap was 214%, and wild chinook salmon catch was 384% of 1998 numbers. The hatchery steelhead trout collection in 1999 was 210% of the 1998 numbers. Wild steelhead trout collection in 1999 was 203% of the 1998 catch. Trap operations began on March 14 and were terminated for the season due to high flows on May 21. The trap was out of operation for 17 d during the season due to high flow and debris.

Buettner, Edwin W.; Brimmer, Arnold F.; Putnam, Scott A.

2001-06-01T23:59:59.000Z

190

Advanced Algorithms Course. Lecture Notes. Part 4  

E-Print Network [OSTI]

algorithms for Weighted Vertex Cover, but this was only an example to demonstrate the technique of LP for Vertex Cover. In general (for any set miniAdvanced Algorithms Course. Lecture Notes. Part 4 Using Linear Programming for Approximation

Damaschke, Peter

191

An optimal filtering algorithm for table constraints  

Science Journals Connector (OSTI)

Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. This paper proposes four efficient value-based algorithms for table constraints, ...

Jean-Baptiste Mairy; Pascal Van Hentenryck; Yves Deville

2012-10-01T23:59:59.000Z

192

The IMAGETCL multimedia algorithm development system  

Science Journals Connector (OSTI)

The IMAGETCL multimedia development system is a new Tcl/Tk-based development environment specifically targeting development of high-performance multimedia data analysis algorithms. Multimedia algorithm development is complicated by large volumes of data, ...

Charles B. Owen

1997-07-01T23:59:59.000Z

193

Comprehensive database on Induan (Lower Triassic) to Sinemurian (Lower Jurassic) marine bivalve genera and their paleobiogeographic record  

E-Print Network [OSTI]

Marine bivalve genera that were described or mentioned for Triassic and Lower Jurassic deposits worldwide are reviewed in terms of their validity, stratigraphic range, paleogeographic distribution, paleoautecology, and ...

Ros-Franch, Sonia; Marquez-Aliaga, Ana; Damborenea, Susana

2014-04-10T23:59:59.000Z

194

Implementation of the Iterative Proportion Fitting Algorithm for Geostatistical Facies Modeling  

SciTech Connect (OSTI)

In geostatistics, most stochastic algorithm for simulation of categorical variables such as facies or rock types require a conditional probability distribution. The multivariate probability distribution of all the grouped locations including the unsampled location permits calculation of the conditional probability directly based on its definition. In this article, the iterative proportion fitting (IPF) algorithm is implemented to infer this multivariate probability. Using the IPF algorithm, the multivariate probability is obtained by iterative modification to an initial estimated multivariate probability using lower order bivariate probabilities as constraints. The imposed bivariate marginal probabilities are inferred from profiles along drill holes or wells. In the IPF process, a sparse matrix is used to calculate the marginal probabilities from the multivariate probability, which makes the iterative fitting more tractable and practical. This algorithm can be extended to higher order marginal probability constraints as used in multiple point statistics. The theoretical framework is developed and illustrated with estimation and simulation example.

Li Yupeng, E-mail: yupeng@ualberta.ca; Deutsch, Clayton V. [University of Alberta (Canada)

2012-06-15T23:59:59.000Z

195

Efficiency improvement and torque ripple minimization of Switched Reluctance Motor using FEM and Seeker Optimization Algorithm  

Science Journals Connector (OSTI)

Abstract In this paper, performance optimization of Switched Reluctance Motor (SRM) was determined using Seeker Optimization Algorithm (SOA). The most efficient aim of the algorithm was found for maximum torque value at a minimum mass of the entire construction, following changing the geometric parameters. The optimization process was carried out using a combination of Seeker Optimization Algorithm and Finite Element Method (FEM). Fitness value was calculated by FEM analysis using COMSOL3.4, and the SOA was realized by MATLAB. The proposed method has been applied for a case study and it has been also compared with Genetic Algorithm (GA). The results show that the optimized motor using SOA had higher torque value and efficiency with lower mass and torque ripple, exhibiting the validity of this methodology for SRM design.

Mohammad Javad Navardi; Behnaz Babaghorbani; Abbas Ketabi

2014-01-01T23:59:59.000Z

196

An SRP-based energy-efficient scheduling algorithm for dependent real-time tasks  

Science Journals Connector (OSTI)

In this paper, we are interested in the energy-efficient scheduling of dependent real-time tasks which may access multiunit resources. Based on the well-known stack resource policy (SRP), we propose the blocking-time stealing (BTS) algorithm to schedule dynamic-priority and fixed-priority tasks on a non-ideal dynamic voltage scaling (DVS) processor. Under the BTS algorithm, tasks are scheduled to be executed at proper processor speeds which are determined according to the sufficient schedulability conditions of the earliest deadline first (EDF) and the rate monotonic (RM) algorithms. The BTS algorithm measures dynamically the slack between the actual blocking time of a task and its estimated worst-case blocking time. The slack is then exploited to lower the processor speed guaranteeing that the feasibility of tasks is not affected. As a result, the energy consumption can be reduced while satisfying the timing constraints of real-time tasks.

Jun Wu; Jun-Xing Wu

2014-01-01T23:59:59.000Z

197

An algorithm for minimization of quantum cost  

E-Print Network [OSTI]

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.

Anindita Banerjee; Anirban Pathak

2009-10-12T23:59:59.000Z

198

Repetitions in strings: algorithms and combinatorics  

E-Print Network [OSTI]

is that stuttering is likely to slow down any string-matching algorithm. The analysis of periods is even more

Paris-Sud XI, Université de

199

Limit theorems for stochastic approximation algorithms  

E-Print Network [OSTI]

We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We show how this applies to a certain class of these algorithms that in particular covers a generalized P\\'olya urn model, which is also discussed. In addition, we show how to scale these algorithms in some cases where we cannot determine the limiting distribution but expect it to be non-normal.

Renlund, Henrik

2011-01-01T23:59:59.000Z

200

The nature of moss and lower atmospheric seismology  

Science Journals Connector (OSTI)

...TR (i.e. thermal interface between...perform lower atmospheric seismology...chromospheric plasma upwards at...despite the atmospheric seeing deformations...EUV-emitting plasma in its vicinity...tunnel some non-propagating...examples of lower atmospheric seismology...in the solar plasma. Figure 1...

2006-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

A useful strong lower bound on two-qubit concurrence  

Science Journals Connector (OSTI)

A new strong lower bound on concurrence for two-qubit states is derived. Its equality with the concurrence itself for the pure- and X-states is proved analytically; while extensive numerical computations show that equality for a general mixed state may ... Keywords: Concurrence, Entanglement, Localizable entanglement, Lower bound

Mojtaba Jafarpour; Abbass Sabour

2012-12-01T23:59:59.000Z

202

Updated distribution and reintroduction of the Lower Keys marsh rabbit  

E-Print Network [OSTI]

, privately-owned parcels of land intersecting the area encompassed by occupied or potential Lower Keys marsh rabbit populations on Boca Chica and Saddlehill keys in 2001?2003 ................................................... 116 4....2 Undeveloped and partially-developed (parcels of land intersecting the area encompassed by occupied or potential Lower Keys marsh rabbit populations on Sugarloaf and the Saddlebunch keys in 2001...

Faulhaber, Craig Alan

2005-02-17T23:59:59.000Z

203

Lower Bounds for Betti Numbers of Special Extensions  

E-Print Network [OSTI]

Lower Bounds for Betti Numbers of Special Extensions Melvin Hochster Benjamin Richert University 0 !M ! 0; where f#11; M 0 ; : : : ; #11; M n g are the Betti numbers of M . Giving lower bounds for these Betti numbers has been a long standing problem in commutative algebra. In fact, in 1977, Buchsbaum

Hochster, Melvin

204

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan Volume II ­ Subbasin Plan Chapter.F. Kalama Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind and wildlife species of interest to recovery and subbasin planning. Appdx. C Program Directory Descriptions

205

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan APPENDIX D - ECONOMICS Lower Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White Salmon Subbasin II.L. Columbia Descriptions, status, and limiting factors of other fish and wildlife species of interest to recovery

206

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan APPENDIX E ­ ASSESSMENT METHODS Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White. Appdx. B Other Species Descriptions, status, and limiting factors of other fish and wildlife species

207

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan Volume II ­ Subbasin Plan Chapter Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin and wildlife species of interest to recovery and subbasin planning. Appdx. C Program Directory Descriptions

208

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan APPENDIX C ­ PROGRAM DIRECTORY Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White. Appdx. B Other Species Descriptions, status, and limiting factors of other fish and wildlife species

209

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan APPENDIX B - OTHER SPECIES Lower Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White Salmon Subbasin II.L. Columbia Descriptions, status, and limiting factors of other fish and wildlife species of interest to recovery

210

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan APPENDIX A ­ FOCAL FISH Lower Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White Salmon Subbasin II.L. Columbia Descriptions, status, and limiting factors of other fish and wildlife species of interest to recovery

211

Factorization law for two lower bounds of concurrence  

SciTech Connect (OSTI)

We study the dynamics of two lower bounds of concurrence in bipartite quantum systems when one party goes through an arbitrary channel. We show that these lower bounds obey the factorization law similar to that of [Konrad et al., Nat. Phys. 4, 99 (2008)]. We also discuss the application of this property in an example.

Mirafzali, Sayyed Yahya; Sargolzahi, Iman; Ahanj, Ali; Javidan, Kurosh; Sarbishaei, Mohsen [Department of Physics, Ferdowsi University of Mashhad, Mashhad (Iran, Islamic Republic of); Khayyam Institute of Higher Education, Mashhad, Iran and School of Physics, Institute for Research in Fundamental Science (IPM), P. O. Box 19395-5531, Tehran (Iran, Islamic Republic of); Department of Physics, Ferdowsi University of Mashhad, Mashhad (Iran, Islamic Republic of)

2010-09-15T23:59:59.000Z

212

Supplement to the Mainstem Lower Columbia River and  

E-Print Network [OSTI]

Recovery Board LCREP Lower Columbia River Estuary Partnership LF limiting factor NOAA National Oceanic Subbasin and Lower Columbia Fish Recovery Board Subbasin 2 Focal Species Selection Figure 1 Distribution Mainstem SUPPLEMENT TEXT.DOC III #12;#12;Acronyms and Abbreviations APRE Artificial Production Review

213

The Iron Spin Transition in the Earth's Lower Mantle  

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

The Iron Spin Transition in the Earth's Lower Mantle Print The Iron Spin 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 of the spins of its 3d electrons. A team from the University of California, Berkeley, Tel Aviv University, and Lawrence Livermore National Laboratory has used x-ray diffraction at very high pressure to investigate the effects of this transition on the elastic properties of magnesiowüstite (Mg1-xFex)O, the second most abundant mineral in the Earth's lower mantle. The new results suggest that the effect of the spin-pairing transition on magnesiowüstite can be large enough to require a partial revision of the most accepted model of the lower mantle composition.

214

The Iron Spin Transition in the Earth's Lower Mantle  

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

The Iron Spin Transition in the Earth's Lower Mantle Print The Iron Spin 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 of the spins of its 3d electrons. A team from the University of California, Berkeley, Tel Aviv University, and Lawrence Livermore National Laboratory has used x-ray diffraction at very high pressure to investigate the effects of this transition on the elastic properties of magnesiowüstite (Mg1-xFex)O, the second most abundant mineral in the Earth's lower mantle. The new results suggest that the effect of the spin-pairing transition on magnesiowüstite can be large enough to require a partial revision of the most accepted model of the lower mantle composition.

215

The Iron Spin Transition in the Earth's Lower Mantle  

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

The Iron Spin Transition in the Earth's Lower Mantle Print The Iron Spin 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 of the spins of its 3d electrons. A team from the University of California, Berkeley, Tel Aviv University, and Lawrence Livermore National Laboratory has used x-ray diffraction at very high pressure to investigate the effects of this transition on the elastic properties of magnesiowüstite (Mg1-xFex)O, the second most abundant mineral in the Earth's lower mantle. The new results suggest that the effect of the spin-pairing transition on magnesiowüstite can be large enough to require a partial revision of the most accepted model of the lower mantle composition.

216

The Iron Spin Transition in the Earth's Lower Mantle  

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

The Iron Spin Transition in the The Iron Spin Transition in the Earth's Lower Mantle The Iron Spin Transition in the Earth's Lower Mantle Print Wednesday, 30 April 2008 00:00 It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons. A team from the University of California, Berkeley, Tel Aviv University, and Lawrence Livermore National Laboratory has used x-ray diffraction at very high pressure to investigate the effects of this transition on the elastic properties of magnesiowüstite (Mg1-xFex)O, the second most abundant mineral in the Earth's lower mantle. The new results suggest that the effect of the spin-pairing transition on magnesiowüstite can be large enough to require a partial revision of the most accepted model of the lower mantle composition.

217

Automated Architectural Exploration for Signal Processing Algorithms  

E-Print Network [OSTI]

Automated Architectural Exploration for Signal Processing Algorithms Ramsey Hourani, Ravi Jenkal, W processing algorithms. The goal of our framework is to improve hardware architectural exploration by guiding Property (IP) cores for system level signal processing algorithms. We present our view of a framework

Davis, Rhett

218

Presenting Data from Experiments in Algorithmics  

E-Print Network [OSTI]

Presenting Data from Experiments in Algorithmics Peter Sanders 1? Max�Planck�Institut f�ur Informatik Saarbr�ucken, Germany sanders@mpi�sb.mpg.de Abstract. Algorithmic experiments yield large amounts tools such as gnuplot 1 . 1 Introduction A paper in experimental algorithmics will often start

Sanders, Peter

219

An efficient algorithm for minimumweight bibranching  

E-Print Network [OSTI]

that the following algorithm finds a minimum car­ dinality bibranching in a digraph: determine a minimum edge cover]. Presently, an O(m+n log n)­algorithm is known (cf. [5]). The minimum­weight edge cover problem canAn efficient algorithm for minimum­weight bibranching J. Keijsper and R. Pendavingh Faculteit der

Keijsper, Judith

220

DYNAMIC ALGORITHMS FOR THE DYCK LANGUAGES  

E-Print Network [OSTI]

DYNAMIC ALGORITHMS FOR THE DYCK LANGUAGES GUDMUND SKOVBJERG FRANDSEN, THORE HUSFELDT, PETER BRO the Dy­ namic Word problem for the free group. We present deterministic algorithms and data structures Las Vegas­ and Monte Carlo­type randomised algorithms to achieve better running times, and present

Miltersen, Peter Bro

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

Introduction to Algorithms May 29, 2014  

E-Print Network [OSTI]

· Greedy approximation algorithm: ­ at each step, pick set covering largest number of remaining uncovered items Theorem: greedy set cover algorithm achieves an approximation ratio of (ln m + 1) May 29, 2014 CS38 Lecture 18 6 #12;5/29/2014 2 Set cover Theorem: greedy set cover algorithm achieves

Umans, Chris

222

Using Cycles and Scaling Parallel Algorithms  

E-Print Network [OSTI]

graph by finding a max­ imal set of edge­disjoint cycles. We give a parallel algorithm to find the first efficient parallel algorithm for finding an approximation to a min­ imum cycle cover. Our algorithm finds a cycle cover whose size is within a factor of O(1 + n log n m+n ) of the minimum sized

Yang, Junfeng

223

Algorithmics Towards programming as a mathematical activity  

E-Print Network [OSTI]

Algorithmics Towards programming as a mathematical activity Lambert Meenens Centre for Mathematics inefficient--algorithm, and to improve it by successively applying correctness-preserving transformations to this method are the verbosity of algorithmic notations, making the process cumber- some, and the semantic

Meertens, Lambert

224

Distributed algorithms for edge dominating sets  

E-Print Network [OSTI]

Distributed algorithms for edge dominating sets Jukka Suomela Helsinki Institute for Information problem · Simple 2-approximation algorithm: find any maximal matching 5 #12;Edge dominating sets · NP dominating sets · using deterministic distributed algorithms, in the port-numbering model · But why would we

Suomela, Jukka

225

Mechanical Verification of Clock Synchronization Algorithms ?  

E-Print Network [OSTI]

functions, in addition to averaging algorithms. The generic theory is presented as a set of param­ eterizedMechanical Verification of Clock Synchronization Algorithms ? D. Schwier and F. von Henke schwier,vhenke@informatik.uni­ulm.de Universit¨at Ulm, Fakult¨at f¨ur Informatik, D­89069 Ulm, Germany Abstract. Clock synchronization algorithms

Biundo, Susanne

226

An Analysis of Algorithms Laboratory Utilizing the  

E-Print Network [OSTI]

An Analysis of Algorithms Laboratory Utilizing the Maximum Segment Sum Problem Robert Mc a laboratory/homework exercise, appropriate for the traditional CS 2 or Data Structures & Algorithms course (CS 7) [1], that gives students practice in analyzing algorithms to determine their asymptotic run­ ning

McCloskey, Robert

227

CMPSCI 791N: Algorithms for Communication  

E-Print Network [OSTI]

: traditional algorithms. ffl Inputs: -- Multinode network (graph). -- Set of packets specified by: \\LambdaCMPSCI 791N: Algorithms for Communication Networks Seminar for Fall 1999 Instructor: Micah Adler of seminar: ffl To learn about networking research conducted in the algorithms community. ffl To explore

Adler, Micah

228

The Design and Analysis of Algorithms  

E-Print Network [OSTI]

serves a dual purpose: to cover core material in algorithms for graduate students in computer scienceThe Design and Analysis of Algorithms Dexter C. Kozen Cornell University December 1990 c Copyright in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At rst I

Kozen, Dexter

229

The Weak Aggregating Algorithm and Weak Mixability  

E-Print Network [OSTI]

of the Weak Aggregating Algorithm that covers unbounded games is also described. #12; CONTENTS 2 Contents 1The Weak Aggregating Algorithm and Weak Mixability Yuri Kalnishkan Michael V. Vyugin 1 fyura the Weak Aggregating Algorithm that allows us to obtain additive terms of the form C p n. A modification

Kalnishkan, Yuri

230

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network [OSTI]

Proceedings from Workshop on Experimental Algorithmics ALCOM­FT Deliverable D4 Rolf Fagerberg BRICS on Experimental Algorithmics held at Schlo? Dagstuhl, Wadern, Germany. The workshop took place in the period, to start establishing a methodology of experimental algorithmics by discussing problems like . What

Brodal, Gerth Stølting

231

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network [OSTI]

Proceedings from Workshop on Experimental Algorithmics ALCOM-FT Deliverable D4 Rolf Fagerberg BRICS on Experimental Algorithmics held at Schlo? Dagstuhl, Wadern, Germany. The workshop took place in the period, to start establishing a methodology of experimental algorithmics by discussing problems like · What

Brodal, Gerth Stølting

232

Lattice Completion Algorithms for Distributed Computations  

E-Print Network [OSTI]

Lattice Completion Algorithms for Distributed Computations Vijay K. Garg Parallel and Distributed is usually modeled as a finite par- tially ordered set (poset) of events. Many operations on this poset new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed

Garg, Vijay

233

Fast algorithms for triangular Josephson junction arrays  

SciTech Connect (OSTI)

We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket formalism is introduced in the context of such arrays. We note that triangular arrays can have both hexagonal and rectangular periodicity and develop algorithms for each. Boundaries are next introduced and fast algorithms for finite arrays are developed. 40 refs., 4 figs.

Datta, S.; Sahdev, D. [Indian Institute of Technology, Kanpur (India)] [Indian Institute of Technology, Kanpur (India)

1997-04-01T23:59:59.000Z

234

Tafel Musik: Formatting algorithm of tables  

Science Journals Connector (OSTI)

This paper provides a description on the formatting algorithm of tables that the authors have developed. This algorithm is an important component of the so called TafeMusik (Tafel Musik) environment. TafeMusikprovides the user with an environment to ... Keywords: First-fit algorithm, Linear programming, Optimization, Tables, Tabular formatting, Tabular layout

K. -H. Shin; K. Kobayashi; A. Suzuki

1997-07-01T23:59:59.000Z

235

Deutsch Algorithm on Classical Circuits  

E-Print Network [OSTI]

The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum computer can find the answer with certainty within a few steps although classical electronic systems must evaluate more iterations than quantum computer. In this paper, it is shown that a classical computation system formed by using ordinary electronic parts may perform the same task with equal performance than quantum computers. DA and DJA quantum circuits act like an analog computer, so it is unfair to compare the bit of classical digital computers with the qubit of quantum computers. An analog signal carrying wire will of course carry more information that a bit carrying wire without serial communication protocols.

Osman Kaan Erol

2008-03-21T23:59:59.000Z

236

Study of lower hybrid wave propagation in ionized gas by Hamiltonian theory  

SciTech Connect (OSTI)

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.

Casolari, A. [Universit di Pisa, Pisa (Italy); Cardinali, A. [Associazione Euratom-ENEA sulla Fusione, C.P. 65 - I-00044 - Frascati, Rome (Italy)

2014-02-12T23:59:59.000Z

237

Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems  

E-Print Network [OSTI]

algorithm to solve very large LPs with both packing and covering constraints. We give algo- rithms to the ratio described for the online setting. We discuss several applications, and how our algorithms improve Algorithms, Economics, Theory Keywords Online algorithms, Stochastic input, Packing-Covering 1. INTRODUCTION

Sandholm, Tuomas W.

238

Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$  

E-Print Network [OSTI]

Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$ Vaibhav with sigmoid utilities. We merge approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmoid utilities

Bullo, Francesco

239

Cambodia-Lowering Emissions in Asia's Forests (LEAF) | Open Energy  

Open Energy Info (EERE)

Cambodia-Lowering Emissions in Asia's Forests (LEAF) Cambodia-Lowering Emissions in Asia's Forests (LEAF) Jump to: navigation, search Name Cambodia-Lowering Emissions in Asia's Forests (LEAF) Agency/Company /Organization United States Agency for International Development Sector Climate, Land Focus Area Biomass, Forestry Topics GHG inventory, Low emission development planning, -LEDS Resource Type Training materials Website http://www.snvworld.org/en/sec Country Cambodia South-Eastern Asia References LEAF[1] "Lowering Emissions in Asia's Forests (LEAF), supported by USAID/RDMA, aims to strengthen the capacity of target countries to achieve meaningful and sustained reductions in GHG emissions from the forestry-land use sector while assisting them in benefitting from the emerging international REDD+

240

ARM - Field Campaign - Lower Atmospheric Boundary Layer Experiment  

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

govCampaignsLower Atmospheric Boundary Layer Experiment govCampaignsLower Atmospheric Boundary Layer Experiment Campaign Links LABLE Website Related Campaigns 2013 Lower Atmospheric Boundary Layer Experiment 2013.05.28, Turner, SGP Comments? We would love to hear from you! Send us a note below or call us at 1-888-ARM-DATA. Send Campaign : Lower Atmospheric Boundary Layer Experiment 2012.09.17 - 2012.11.13 Lead Scientist : David Turner Description Boundary layer turbulence is an important process that is parameterized in most atmospheric numerical models. Turbulence redistributes energy and mass within the boundary layer. Many different characteristics can impact the character of turbulence in the boundary layer, including different surface types, horizontal wind speed and direction, and the vertical temperature structure of the atmosphere. However, there have been few studies that have

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Vietnam-Lowering Emissions in Asia's Forests (LEAF) | Open Energy  

Open Energy Info (EERE)

Vietnam-Lowering Emissions in Asia's Forests (LEAF) Vietnam-Lowering Emissions in Asia's Forests (LEAF) Jump to: navigation, search Name Vietnam-Lowering Emissions in Asia's Forests (LEAF) Agency/Company /Organization United States Agency for International Development Sector Climate, Land Focus Area Biomass, Forestry Topics GHG inventory, Low emission development planning, -LEDS Resource Type Training materials Website http://www.snvworld.org/en/sec Country Vietnam South-Eastern Asia References LEAF[1] "Lowering Emissions in Asia's Forests (LEAF), supported by USAID/RDMA, aims to strengthen the capacity of target countries to achieve meaningful and sustained reductions in GHG emissions from the forestry-land use sector while assisting them in benefitting from the emerging international REDD+ framework.

242

Lowering Emissions in Asia's Forests (LEAF) | Open Energy Information  

Open Energy Info (EERE)

Lowering Emissions in Asia's Forests (LEAF) Lowering Emissions in Asia's Forests (LEAF) Jump to: navigation, search Name Lowering Emissions in Asia's Forests (LEAF) Agency/Company /Organization United States Agency for International Development Sector Climate, Land Focus Area Biomass, Forestry Topics GHG inventory, Low emission development planning, -LEDS Resource Type Training materials Website http://www.snvworld.org/en/sec Country Cambodia, Laos, Malaysia, Papua New Guinea, Thailand, Vietnam South-Eastern Asia, South-Eastern Asia, South-Eastern Asia, Melanesia, South-Eastern Asia, South-Eastern Asia References LEAF[1] "Lowering Emissions in Asia's Forests (LEAF), supported by USAID/RDMA, aims to strengthen the capacity of target countries to achieve meaningful and sustained reductions in GHG emissions from the forestry-land use sector

243

Thailand-Lowering Emissions in Asia's Forests (LEAF) | Open Energy  

Open Energy Info (EERE)

Thailand-Lowering Emissions in Asia's Forests (LEAF) Thailand-Lowering Emissions in Asia's Forests (LEAF) Jump to: navigation, search Name Thailand-Lowering Emissions in Asia's Forests (LEAF) Agency/Company /Organization United States Agency for International Development Sector Climate, Land Focus Area Biomass, Forestry Topics GHG inventory, Low emission development planning, -LEDS Resource Type Training materials Website http://www.snvworld.org/en/sec Country Thailand South-Eastern Asia References LEAF[1] "Lowering Emissions in Asia's Forests (LEAF), supported by USAID/RDMA, aims to strengthen the capacity of target countries to achieve meaningful and sustained reductions in GHG emissions from the forestry-land use sector while assisting them in benefitting from the emerging international REDD+

244

EA-0941: Lower Yakima Valley Wetlands and Riparian Restoration Project,  

Broader source: Energy.gov (indexed) [DOE]

41: Lower Yakima Valley Wetlands and Riparian Restoration 41: Lower Yakima Valley Wetlands and Riparian Restoration Project, Washington EA-0941: Lower Yakima Valley Wetlands and Riparian Restoration Project, Washington SUMMARY This EA evaluates the environmental impacts of the proposal for the U.S. Department of Energy's Bonneville Power Administration to fund that portion of the Washington Wildlife Mitigation Agreement pertaining to the Lower Yakima Valley Wetlands and Riparian Restoration Project (Project) in a cooperative effort with the Yakama Indian Nation and the Bureau of Indian Affairs. The proposed action would allow the sponsors to ensure property and conduct wildlife management activities for the Project within the boundaries of the Yakama Indian Reservation. PUBLIC COMMENT OPPORTUNITIES None available at this time.

245

Particle simulation of lower hybrid waves in tokamak plasmas  

E-Print Network [OSTI]

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.

Bao, J; Kuley, A; Wang, Z X; Lu, Z X

2014-01-01T23:59:59.000Z

246

Lower limb response to modified ankle impedance in gait  

E-Print Network [OSTI]

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

Blackburn, Bonnie Lucille

2011-01-01T23:59:59.000Z

247

Sandia National Laboratories: lowering the financial risk associated...  

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

lowering the financial risk associated with geothermal energy production Sandia and Atlas-Copco Secoroc Advance to Phase 2 in Their Geothermal Energy Project On July 31, 2013, in...

248

EV Community Readiness projects: New York City and Lower Hudson...  

Broader source: Energy.gov (indexed) [DOE]

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

249

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

250

The Iron Spin Transition in the Earth's Lower Mantle  

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

2008 00:00 It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....

251

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

252

Lower 48 States Coalbed Methane Proved Reserves (Billion Cubic...  

Gasoline and Diesel Fuel Update (EIA)

Proved Reserves (Billion Cubic Feet) Lower 48 States Coalbed Methane Proved Reserves (Billion Cubic Feet) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8...

253

Lower 48 States Coalbed Methane Production (Billion Cubic Feet...  

Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]

Production (Billion Cubic Feet) Lower 48 States Coalbed Methane Production (Billion Cubic Feet) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8 Year-9 2000's...

254

ORIGINAL ARTICLE Hydropower development in the lower Mekong basin  

E-Print Network [OSTI]

ORIGINAL ARTICLE Hydropower development in the lower Mekong basin: alternative approaches to deal hydropower generation and potentially irreversible negative impacts on the ecosystems that provide hydropower generation and potentially irreversible negative impacts on the ecosystems that provide

Vermont, University of

255

Accurate Detection of Impurities in Hydrogen Fuel at Lower Cost...  

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

Hydrogen and Fuel Cell Hydrogen and Fuel Cell Find More Like This Return to Search Accurate Detection of Impurities in Hydrogen Fuel at Lower Cost Advancing the science of fuel...

256

Lower Cost Carbon Fiber Precursors | Department of Energy  

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

2 DOE Hydrogen and Fuel Cells Program and Vehicle Technologies Program Annual Merit Review and Peer Evaluation Meeting lm004warren2012o.pdf More Documents & Publications Lower...

257

Fuel Cell Tax Incentives: How Monetization Lowers the Government...  

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

Cell Tax Incentives: How Monetization Lowers the Government Outlay By: Lee J. Peterson, Esq. Reznick Group, P.C. February 19, 2009 The Big Picture: Financing with Private Capital...

258

Self-consistent full wave simulations of lower hybrid waves  

E-Print Network [OSTI]

Self-consistent full wave simulations of lower hybrid waves John C. Wright P. T. Bonoli - MIT E .J for Simulation of Wave-Plasma Interactions L.A. Berry, D.B. Batchelor, E.F. Jaeger, E. D`Azevedo D. Green C. Milanesio #12;3 Outline · Introduction to Lower Hybrid waves · Modeling LH waves ­ Ray tracing ­ Full Wave

Wright, John C.

259

A Mobile Motion Analysis System Using Intertial Sensors for Analysis of Lower Limb Prosthetics  

SciTech Connect (OSTI)

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.

Mueller, John Kyle P [ORNL] [ORNL; Ericson, Milton Nance [ORNL] [ORNL; Farquhar, Ethan [ORNL] [ORNL; Lind, Randall F [ORNL] [ORNL; Evans III, Boyd Mccutchen [ORNL] [ORNL

2011-01-01T23:59:59.000Z

260

Good covers are algorithmically unrecognizable  

E-Print Network [OSTI]

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are algorithmically unrecognizable. More precisely, the intersection pattern of a good cover can be stored in a simplicial complex called nerve which records which subfamilies of the good cover intersect. A simplicial complex is topologically d-representable if it is isomorphic to the nerve of a good cover in R^d. We prove that it is algorithmically undecidable whether a given simplicial complex is topologically d-representable for any fixed d \\geq 5. As an auxiliary result we prove that if a simplicial complex is PL embeddable into R^d, then it is topologically d-representable. We also supply this result with showing that if a "sufficiently fine" subdivision of a k-dimensional complex is d-represen...

Tancer, Martin

2012-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

Enhanced algorithms for stochastic programming  

SciTech Connect (OSTI)

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

Krishna, A.S.

1993-09-01T23:59:59.000Z

262

A Faster Algorithm for Computing Motorcycle Graphs  

Science Journals Connector (OSTI)

We present a new algorithm for computing motorcycle graphs that runs in $$O(n^{4/3+\\varepsilon })$$O(n4/3+) time for any $$\\varepsilon >0$$>0, improving on all previously known algorithms. The main application of this result is to computing the straight ... Keywords: 65D18, 68Q25, 68U05, Algorithms design and analysis, Medial axis, Motorcycle graph, Polygon, Straight skeleton

Antoine Vigneron, Lie Yan

2014-10-01T23:59:59.000Z

263

New Monte Carlo Algorithm for Protein Folding  

Science Journals Connector (OSTI)

We demonstrate that the recently introduced pruned-enriched Rosenbluth method leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for lattice heteropolymers, and compare the results to published Monte Carlo studies. In all cases our algorithms are faster than previous ones, and in several cases we find new minimal energy states. In addition, our algorithms give estimates for the partition sum at finite temperatures.

Helge Frauenkron; Ugo Bastolla; Erwin Gerstner; Peter Grassberger; Walter Nadler

1998-04-06T23:59:59.000Z

264

MEMORANDUM OF UNDERSTANDING Between The Numerical Algorithms...  

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

Numerical Algorithms Group Ltd (NAG) with a registered address at: Wilkinson House, Jordan hill Road, Oxford, UK and the University of California, as Management and Operating...

265

Comprehensive Study of Image Restoration Algorithms.  

E-Print Network [OSTI]

??Abstract Comprehensive Study of Image Restoration Algorithms By Lize Zong Master of Science in Electrical Engineering Image restoration is an important part of digital image-processing. (more)

Zong, Lize

2015-01-01T23:59:59.000Z

266

Fast Algorithms for the Minimum Volume Estimator  

E-Print Network [OSTI]

Abstract: The MVE estimator is an important tool in robust regression and outlier detection in statistics. We develop fast and efficient algorithms for the MVE...

S D Ahipasaoglu

267

Protein Folding: Generalized-Ensemble Algorithms  

Science Journals Connector (OSTI)

We briefly review the development of generalized-ensemble optimization techniques and their application since publication of Protein Folding: Generalized-Ensemble Algorithms was published in...

Ulrich H. E. Hansmann

2009-01-01T23:59:59.000Z

268

AN AUGMENTED LAGRANGIAN BASED ALGORITHM FOR ...  

E-Print Network [OSTI]

Let the functions fi and hi be twice continuously differentiable with the fis being strictly convex and the his being convex. If Algorithm 2 is based on constraint...

2014-07-03T23:59:59.000Z

269

Accelerated and Inexact forward-backward algorithms  

E-Print Network [OSTI]

Aug 17, 2011 ... Accelerated and Inexact forward-backward algorithms. Silvia Villa (villa ***at*** dima.unige.it) Saverio Salzo (salzo ***at*** disi.unige.it)

Silvia Villa

2011-08-17T23:59:59.000Z

270

Parallel GPU Algorithms for Mechanical CAD  

E-Print Network [OSTI]

of California, Berkeley, Mechanical Engineering Department,GPU Algorithms for Mechanical CAD by Adarsh Krishnamurthy Aof Philosophy in Engineering - Mechanical Engineering in the

Krishnamurthy, Adarsh

2010-01-01T23:59:59.000Z

271

Algorithmic Cooling in Liquid State NMR  

E-Print Network [OSTI]

Algorithmic cooling is a method that employs thermalization to increase the qubits' purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of 13C2-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. For example, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.

Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein

2014-11-17T23:59:59.000Z

272

Upping Efficiency Standards, Lowering Utility Bills | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Upping Efficiency Standards, Lowering Utility Bills Upping Efficiency Standards, Lowering Utility Bills Upping Efficiency Standards, Lowering Utility Bills September 2, 2010 - 4:17pm Addthis Niketa Kumar Niketa Kumar Public Affairs Specialist, Office of Public Affairs What does this mean for me? Using energy-efficient appliances is one of the easiest and most important ways consumers have to save money. Purchasing energy-efficient appliances is one of the easiest and most important ways consumers have to save money, reduce their electricity consumption and help cut down on carbon pollution. We use appliances every day - to cook our food, cool our homes, heat our water and clean our clothes. In fact, for a typical U.S. family, heating and cooling and water heating account for about 50 percent of utility bills. Home appliances and

273

Less platinum means lower prices for autos | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Less platinum means lower prices for autos Less platinum means lower prices for autos Less platinum means lower prices for autos January 21, 2010 - 3:29pm Addthis Joshua DeLung You might wear a platinum wedding band, but tucked away in the guts of a car probably isn't where Americans prefer this pricey, precious metallic element to be. Luckily, researchers at 3M's Fuel Cell Component's Program in St. Paul, Minnesota have us covered. 3M has developed technology that will reduce the amount of platinum necessary in a fuel cell system by using nano-catalyst particles that actually make surface atoms more efficient at producing energy. Platinum is needed in fuel cells because no other metals are even close to being as effective at speeding up chemical reactions to make power. 3M is among a handful of fuel cell system suppliers in the U.S., and these advancements

274

Maryland Small Business Helping Lower Solar Costs | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Maryland Small Business Helping Lower Solar Costs Maryland Small Business Helping Lower Solar Costs Maryland Small Business Helping Lower Solar Costs January 12, 2010 - 9:14am Addthis Joshua DeLung One potential problem with going solar across America is that the up-front costs of installing solar panels are often too high for the average consumer. Though panels can produce mounds of energy savings over a long period of time, the expense of installation is still too high for many. However, stimulus funding awarded to a small, Maryland-based business with six employees - AccuStrata Inc. - by the U.S. Department of Energy under the Recovery Act is helping the company develop technology to eliminate such barriers. AccuStrata was awarded its third Small Business Innovation Research grant of $150,000 in December. These grants will help the company increase the

275

Lower Colorado River Authority LCRA | Open Energy Information  

Open Energy Info (EERE)

Lower Colorado River Authority LCRA Lower Colorado River Authority LCRA Jump to: navigation, search Name Lower Colorado River Authority (LCRA) Place Austin, Texas Zip 78703 Product LCRA is a conservation and reclamation district created by the Texas Legislature in 1934. Coordinates 30.267605°, -97.742984° Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"ROADMAP","zoom":14,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"600px","height":"350px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":30.267605,"lon":-97.742984,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

276

Navy Lowering Upfront Costs to Save Energy | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Navy Lowering Upfront Costs to Save Energy Navy Lowering Upfront Costs to Save Energy Navy Lowering Upfront Costs to Save Energy June 21, 2010 - 11:23am Addthis This hangar at Naval Air Station Meridian in Mississippi received an energy-efficiency makeover that included major lighting retrofits and water conservation measures. | Photo Courtesy U.S. Navy This hangar at Naval Air Station Meridian in Mississippi received an energy-efficiency makeover that included major lighting retrofits and water conservation measures. | Photo Courtesy U.S. Navy Joshua DeLung What does this mean for me? 2 mechanical project upgrades, 16 lighting project upgrades and 19 water conservation measures $267,565 in taxpayer money saved annually 3.1 million gallons of water saved annuallym 1,889 MWh of electricity saved annually and 56,118 therms natural gas saved annually

277

Savings Project: Lower Water Heating Temperature | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings $12-$30 annually for each 10ºF reduction Time to Complete 2 hours Overall Cost $0 Turning down your water heater temperature can save energy and money. | Photo courtesy of iStockphoto.com/BanksPhotos Turning down your water heater temperature can save energy and money. | Photo courtesy of iStockphoto.com/BanksPhotos Although some manufacturers set water heater thermostats at 140ºF, most households usually only require them to be set at 120ºF, which also slows mineral buildup and corrosion in your water heater and pipes. Water heated at 140ºF also poses a safety hazard-scalding. Savings resulting from turning down your water heater temperature are based

278

EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets  

Broader source: Energy.gov (indexed) [DOE]

EM's Strategic Planning Initiative Examines Impact of Lower Funding EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets February 1, 2012 - 12:00pm Addthis WASHINGTON, D.C. - EM is conducting a strategic planning effort that aims to optimize progress in the organization's environmental cleanup program. As part of efforts to continuously improve the effectiveness and efficiency of resource management and build on the success of the $6 billion EM American Recovery and Reinvestment Act Program, EM headquarters officials are working with staff at EM's 17 field sites to analyze the impact of austere funding projections on project costs and schedules. EM is working to align the cleanup program with current budget realities and prioritize

279

Microsoft Word - Central Ferry-Lower Monumental ROD.doc  

Broader source: Energy.gov (indexed) [DOE]

1 1 Record of Decision March 2011 Bonneville Power Administration's Central Ferry-Lower Monumental 500-kilovolt Transmission Line Project Record of Decision March 2011 Decision The Bonneville Power Administration (BPA) has decided to construct the proposed Central Ferry-Lower Monumental 500-kilovolt (kV) Transmission Line Project in Garfield, Columbia, and Walla Walla counties, Washington. BPA has decided to implement the Combination A Alternative identified in the Central Ferry-Lower Monumental 500-kV Transmission Line Project Final Environmental Impact Statement (DOE/EIS-0422, February 2011). The Combination A Alternative consists of constructing a new 500-kV transmission line from BPA's new Central Ferry Substation near the Port of Central Ferry in Garfield County generally west

280

EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets  

Broader source: Energy.gov (indexed) [DOE]

EM's Strategic Planning Initiative Examines Impact of Lower Funding EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets EM's Strategic Planning Initiative Examines Impact of Lower Funding Targets February 1, 2012 - 12:00pm Addthis WASHINGTON, D.C. - EM is conducting a strategic planning effort that aims to optimize progress in the organization's environmental cleanup program. As part of efforts to continuously improve the effectiveness and efficiency of resource management and build on the success of the $6 billion EM American Recovery and Reinvestment Act Program, EM headquarters officials are working with staff at EM's 17 field sites to analyze the impact of austere funding projections on project costs and schedules. EM is working to align the cleanup program with current budget realities and prioritize

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

Upping Efficiency Standards, Lowering Utility Bills | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Upping Efficiency Standards, Lowering Utility Bills Upping Efficiency Standards, Lowering Utility Bills Upping Efficiency Standards, Lowering Utility Bills September 2, 2010 - 4:17pm Addthis Niketa Kumar Niketa Kumar Public Affairs Specialist, Office of Public Affairs What does this mean for me? Using energy-efficient appliances is one of the easiest and most important ways consumers have to save money. Purchasing energy-efficient appliances is one of the easiest and most important ways consumers have to save money, reduce their electricity consumption and help cut down on carbon pollution. We use appliances every day - to cook our food, cool our homes, heat our water and clean our clothes. In fact, for a typical U.S. family, heating and cooling and water heating account for about 50 percent of utility bills. Home appliances and

282

Maryland Small Business Helping Lower Solar Costs | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Small Business Helping Lower Solar Costs Small Business Helping Lower Solar Costs Maryland Small Business Helping Lower Solar Costs January 12, 2010 - 9:14am Addthis Joshua DeLung One potential problem with going solar across America is that the up-front costs of installing solar panels are often too high for the average consumer. Though panels can produce mounds of energy savings over a long period of time, the expense of installation is still too high for many. However, stimulus funding awarded to a small, Maryland-based business with six employees - AccuStrata Inc. - by the U.S. Department of Energy under the Recovery Act is helping the company develop technology to eliminate such barriers. AccuStrata was awarded its third Small Business Innovation Research grant of $150,000 in December. These grants will help the company increase the

283

Waste Shipment Tracking Technology Lowers Costs, Increases Efficiency |  

Broader source: Energy.gov (indexed) [DOE]

Shipment Tracking Technology Lowers Costs, Increases Shipment Tracking Technology Lowers Costs, Increases Efficiency Waste Shipment Tracking Technology Lowers Costs, Increases Efficiency February 27, 2013 - 12:00pm Addthis This graphic shows how the radiofrequency identification technology tracks and monitors packages in transport, in-transit stops and storage. This graphic shows how the radiofrequency identification technology tracks and monitors packages in transport, in-transit stops and storage. The technology developed by EM’s Office of Packaging and Transportation Packaging Certification Program technology development team was selected by the RFID Journal as the "Most Innovated Use of RFIDs.” Team members pictured here include Dr. John Lee, Dr. Yung Liu, Dr. Jim Shuler, Dr. Hanchung Tsai and John Anderson. Team members not pictured are Brian Craig and Dr. Kun Chen.

284

SRS Recovery Act Completes Major Lower Three Runs Project Cleanup  

Broader source: Energy.gov (indexed) [DOE]

August 14, 2012 August 14, 2012 AIKEN, S.C. - American Recovery and Reinvestment Act can now claim that 85 percent of the Savannah River Site (SRS) has been cleaned up with the recent completion of the Lower Three Runs (stream) Project. Twenty miles long, Lower Three Runs leaves the main body of the 310-square mile site and runs through parts of Barnwell and Allendale Coun- ties until it flows into the Savannah River. Government property on both sides of the stream acts as a buffer as it runs through privately-owned property. Completing this project reduces the site's footprint by another 10 percent. "We excavated and disposed of over five million pounds of contaminated soil from three specific sites along the stream, erected miles of fence and placed over 2,000 signs in order to make Lower Three Runs safe and to reduce our site's footprint by another 10 percent," said Chris

285

Savings Project: Lower Water Heating Temperature | Department of Energy  

Broader source: Energy.gov (indexed) [DOE]

Lower Water Heating Temperature Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings $12-$30 annually for each 10ºF reduction Time to Complete 2 hours Overall Cost $0 Turning down your water heater temperature can save energy and money. | Photo courtesy of iStockphoto.com/BanksPhotos Turning down your water heater temperature can save energy and money. | Photo courtesy of iStockphoto.com/BanksPhotos Although some manufacturers set water heater thermostats at 140ºF, most households usually only require them to be set at 120ºF, which also slows mineral buildup and corrosion in your water heater and pipes. Water heated at 140ºF also poses a safety hazard-scalding. Savings resulting from turning down your water heater temperature are based

286

Baseline Hydrologic Studies in the Lower Elwha River Prior to  

E-Print Network [OSTI]

After the removal of two large, longstanding dams on the Elwha River, Washington, the additional loadChapter 4 4 Chapter Baseline Hydrologic Studies in the Lower Elwha River Prior to Dam Removal characteristics of the river and estuary before dam removal, several hydrologic data sets were collected

287

Improved lower bound on the entropic uncertainty relation  

SciTech Connect (OSTI)

We present a lower bound on the entropic uncertainty relation for the distinguished measurements of two observables in a d-dimensional Hilbert space for d up to 5. This bound provides an improvement over the best one yet available. The feasibility of the obtained bound presenting an improvement for higher dimensions is also discussed.

Jafarpour, Mojtaba; Sabour, Abbass [Physics Department, Shahid Chamran University, Ahvaz (Iran, Islamic Republic of)

2011-09-15T23:59:59.000Z

288

Lower 48 Federal Offshore Coalbed Methane Proved Reserves (Billion...  

U.S. Energy Information Administration (EIA) Indexed Site

Lower 48 Federal Offshore Coalbed Methane Proved Reserves (Billion Cubic Feet) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8 Year-9 2000's 0 0 0 0 0 2010's...

289

Improved lower bound on the entropic uncertainty relation  

Science Journals Connector (OSTI)

We present a lower bound on the entropic uncertainty relation for the distinguished measurements of two observables in a d-dimensional Hilbert space for d up to 5. This bound provides an improvement over the best one yet available. The feasibility of the obtained bound presenting an improvement for higher dimensions is also discussed.

Mojtaba Jafarpour and Abbass Sabour

2011-09-08T23:59:59.000Z

290

Accessibility for lower hybrid waves in PBX-M  

SciTech Connect (OSTI)

Understanding the wave damping mechanism in the presence of a spectral gap' is an important issue for the current profile control using Lower Hybrid Current Drive (LHCD). The authors examine a traditional explanation based upon upshifting of the wave parallel refractive index (n[sub [parallel

Takahashi, H.; Bell, R.; Bernabei, S.; Chance, M.; Chu, T.K.; Gettelfinger, G.; Greenough, N.; Hatcher, R.; Ignat, D.; Jardin, S.; Kaita, R.; Kaye, S.; Kugel, H.; LeBlanc, B.; Manickam, J.; Okabayashi, M.; Ono, M.; Paul, S.; Perkins, F.; Sauthoff, N.; Sesnic, S.; Sun, Y.; Tighe, W.; Valeo, E.; von Goeler, S. (Princeton Univ., NJ (United States). Plasma Physics Lab.); Batha, S.; Levinton, F. (Fusion Physics and Technology

1993-07-01T23:59:59.000Z

291

Suspended sediment sources and tributary effects in the lower  

E-Print Network [OSTI]

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

Yeager, Kevin M.

292

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan Volume II ­ Subbasin Plan Chapter II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White Salmon Subbasin II.L. Columbia Gorge, status, and limiting factors of other fish and wildlife species of interest to recovery and subbasin

293

Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan  

E-Print Network [OSTI]

Lower Columbia Salmon Recovery And Fish & Wildlife Subbasin Plan Volume II ­ Subbasin Plan Chapter Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin II.K. Little White Salmon Subbasin II.L. Columbia Descriptions, status, and limiting factors of other fish and wildlife species of interest to recovery

294

Selfconsistent full wave simulations of lower hybrid waves  

E-Print Network [OSTI]

Selfconsistent full wave simulations of lower hybrid waves John C. Wright P. T. Bonoli MIT E .J. Porkolab Sherwood/Spring APS Denver May 2009 #12; 2 Participants in the Center for Simulation of Wave hybrid (LH) waves have the attractive property of damping strongly via electron Landau resonance

Wright, John C.

295

LOWER TRANSPORT BOUNDS FOR ONE-DIMENSIONAL CONTINUUM SCHRODINGER OPERATORS  

E-Print Network [OSTI]

, Germany, E-Mail: dlenz@mathematik.tu-chemnitz.de 3 Department of Mathematics, University of Alabama x |V (t)| dt well. DAMANIK, D. LENZ, G. STOLZ (lower diffusion exponents) (4) - f (p) := lim inf T log Mf (T, p) log

296

Lower Oil Prices: A Reason to Give Thanks GENE EPSTEIN  

E-Print Network [OSTI]

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

California at Davis, University of

297

Lower granite GIS data description and collection guidelines  

SciTech Connect (OSTI)

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.

Gordon, J.L.; Evans, B.J.; Perry, E.M.

1995-12-01T23:59:59.000Z

298

Quadratic Diffusion Monte-Carlo Algorithms for Solving Atomic Many-Body Problems  

E-Print Network [OSTI]

that of the algorithm and can therefore degrade the algorithm to lower order. ?2.95- E ?3.05- ?3.1$ 0.1 0.2 0.3 0.4 0.5 FIG. 1. The trial ground-state energy of helium as a function of ht as computed by four DMC algorithms. The statistical er- rors are at most... of view, consider T e ?ht(H ?E) 7 where H =K+ V is the 3X-dimensional many-body Ham- iltonian with kinetic energy K =?,'p and potential energy V= V(x). The iteration of T will converge to its largest eigenstate l %o), which is the ground state of H...

Chin, Siu A.

1990-01-01T23:59:59.000Z

299

The Bidimensionality Theory and Its Algorithmic Applications  

E-Print Network [OSTI]

of such problems include feedback vertex set, vertex cover, minimum maximal matching, face cover, a seriesThe Bidimensionality Theory and Its Algorithmic Applications by MohammadTaghi Hajiaghayi B Theory and Its Algorithmic Applications by MohammadTaghi Hajiaghayi Submitted to the Department

300

APPROXIMATION ALGORITHMS FOR CLUSTERING A Dissertation  

E-Print Network [OSTI]

develop new algorithmic techniques that will find application in a wide range of settings. We consider problems such as the stochastic versions of the set cover, vertex cover, and facility location problemsAPPROXIMATION ALGORITHMS FOR CLUSTERING PROBLEMS A Dissertation Presented to the Faculty

Swamy, Chaitanya

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

Using Stalmarck's algorithm to prove inequalities  

E-Print Network [OSTI]

of coverings. A covering C of a formula f is a set of monomials drawn from a set of predicates P of the abstraction. St°almarck's algorithm is a candidate method for computing these appoxima- tive coverings whenUsing St°almarck's algorithm to prove inequalities Byron Cook and Georges Gonthier Microsoft

Rajamani, Sriram K.

302

Solutions diversification in a column generation algorithm  

E-Print Network [OSTI]

Solutions diversification in a column generation algorithm N. Touati a L. L´etocart a A. Nagih b a Column generation algorithms have been specially designed for solving mathemat- ical programs with a huge-based techniques. A more classical approach, known as "intensification", consists in inserting a set of columns

Létocart, Lucas

303

Forward Rasterization: A Reconstruction Algorithm for  

E-Print Network [OSTI]

-buffer sample- selection method, designed to ensure that the set of selected samples covers every visibleForward Rasterization: A Reconstruction Algorithm for Image-Based Rendering TROl-019 May 29, 2001: A RECONSTRUCTION ALGORITHM FOR IMAGE-BASED RENDERING by Voicu Sebastian Popescu A dissertation submitted

North Carolina at Chapel Hill, University of

304

Sommersemester 2002 Algorithms on Railway Optimisation  

E-Print Network [OSTI]

Sommersemester 2002 Seminar Algorithms on Railway Optimisation Miriam Walter 01/423731 SHUNTING. The topic shunting covers the routing of train units, the scheduling of personnel, cleaning and maintainance integer program of (MSP) and have a look at two online algorithms. Finally we will show

Brandes, Ulrik

305

Parameterized Algorithms for Graph Partitioning Problems  

E-Print Network [OSTI]

) time algorithm for any FGPP. Parameterized by p, Max and Min k-Vertex Cover can be solved in times O (1Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi are constants defining the problem, and m1, m2 are the cardinalities of the edge sets having both endpoints

Shachnai, Hadas

306

Introduction to Algorithms May 27, 2014  

E-Print Network [OSTI]

in graphs ­ independent set ­ vertex cover ­ clique · sequencing ­ Hamilton Path ­ Hamilton Cycle and TSP5/27/2014 1 CS38 Introduction to Algorithms Lecture 17 May 27, 2014 May 27, 2014 1CS38 Lecture 17 ­ fixed parameter complexity ­ approximation algorithms May 27, 2014 CS38 Lecture 17 3 Hardness

Umans, Chris

307

Approximation Algorithms for Maximization Problems arising in  

E-Print Network [OSTI]

Approximation Algorithms for Maximization Problems arising in Graph Partitioning Thesis for the M of size k that maximizes : Max­k­Vertex Cover : the weight of edges incident with vertices in U . Max a number of approximation algorithms based on linear and semidefinite programming, and obtain approximation

Langberg, Michael

308

Algorithms for Graphs (Locally) Bounded Treewidth  

E-Print Network [OSTI]

set, vertex cover and independent set. Others used this approach to solve other NP-hard problemsAlgorithms for Graphs of (Locally) Bounded Treewidth by MohammadTaghi Hajiaghayi A thesis presented-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness

Hajiaghayi, Mohammad

309

Biclustering Algorithms: A Survey Amos Tanay  

E-Print Network [OSTI]

seek a disjoint cover of the set of elements, requiring that no gene or sample belongs to more than oneBiclustering Algorithms: A Survey Amos Tanay£ Roded SharanÝ Ron Shamir£ May 2004 Abstract Analysis review some of the algorithmic approaches to biclustering and discuss their properties. 1 Introduction

Shamir, Ron

310

On Spectral Clustering: Analysis and an algorithm  

E-Print Network [OSTI]

be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm the top eigenvectors of a matrix derived from the distance between points. Such algorithms have been at a time. One line of analysis makes the link to spectral graph partitioning, in which the sec- #12; ond

Weiss, Yair

311

A local search algorithm for branchwidth  

Science Journals Connector (OSTI)

As many problems can be solved in polynomial time on graphs of bounded branchwidth, there is a need for efficient and practical algorithms that find branch decompositions of small width of given graphs. In this paper, we give the first local search algorithm ...

Arnold Overwijk; Eelko Penninkx; Hans L. Bodlaender

2011-01-01T23:59:59.000Z

312

Learning Motor Skills: From Algorithms to Robot  

E-Print Network [OSTI]

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

313

Optimization algorithm for reverse osmosis desalination economics  

Science Journals Connector (OSTI)

In this work an optimization algorithm for the calculation of water unit cost from various RO candidate schemes was developed. Such an algorithm may be used for evaluation purposes when many RO candidate schemes are taken into account. The applicability of the method is demonstrated on an example in which six RO candidate schemes are examined.

Andreas Poullikkas

2001-01-01T23:59:59.000Z

314

A heuristic algorithm for graph isomorphism  

E-Print Network [OSTI]

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

Torres Navarro, Luz

1999-01-01T23:59:59.000Z

315

Communication and Computation in Distributed CSP Algorithms  

E-Print Network [OSTI]

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

Krishnamachari, Bhaskar

316

Generating Fast Indulgent Algorithms Dan Alistarh1  

E-Print Network [OSTI]

, France Abstract. Synchronous distributed algorithms are easier to design and prove cor- rect than overhead in terms of time complexity in well-behaved executions. Our technique is based on a new. This line of research inspired the introduction of indulgent algo- rithms [1], i.e. algorithms

Paris-Sud XI, Université de

317

Groundwater Remediation Strategy Using Global Optimization Algorithms  

E-Print Network [OSTI]

. DOI: 10.1061/ ASCE 0733-9496 2002 128:6 431 CE Database keywords: Ground water; Remedial action; Algorithms; Ground-water management. Introduction The contamination of groundwater is a widespread problemGroundwater Remediation Strategy Using Global Optimization Algorithms Shreedhar Maskey1 ; Andreja

Neumaier, Arnold

318

Energy Aware Algorithmic Engineering Swapnoneel Roy  

E-Print Network [OSTI]

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

Rudra,, Atri

319

Towards a Definition of an Algorithm  

Science Journals Connector (OSTI)

......Although the set of programs does not even form a category, the...and function algebras. In: Handbook of Computability Theory, Vol...Although the set of programs does not even form a category, the...algorithms, e.g. `There does not exist an algorithm to solve......

Noson S. Yanofsky

2011-04-01T23:59:59.000Z

320

"Mtrack 1.0": A multi-vehicle, deterministic tracking algorithm  

SciTech Connect (OSTI)

As overhead persistent surveillance sensors become more capable at acquiring wide-field image sequences for longer time-spans, the need to exploit such data becomes ever greater. A desirable use of such sensors is to be able to track all the observable vehicles while they persist in the imagery. Typically, this imagery is characterized by lower resolutions (e.g. >= 0.5 m/pixel ) and lower frame rates (e.g. {approx} few Hz). We describe our initial implementation of a multiple-vehicle tracking algorithm for overhead persistent surveillance imagery. Subsequent reports will then present results of applying this tracker to specific persistent surveillance imagery as well as algorithm improvements and extensions for dealing with wider-field imagery.

Carrano, C J

2008-05-22T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

On Spectral Clustering: Analysis and an algorithm  

E-Print Network [OSTI]

Despite many empirical successes of spectral clustering methods -- algorithms that cluster points using eigenvectors of matrices derived from the distances between the points -- there are several unresolved issues. First, there is a wide variety of algorithms that use the eigenvectors in slightly different ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems.

Andrew Y. Ng; Michael I. Jordan; Yair Weiss

2001-01-01T23:59:59.000Z

322

A probabilistic approach to apriori algorithm  

Science Journals Connector (OSTI)

We consider the problem of applying probability concepts to discover frequent itemsets in a transaction database. The paper presents a probabilistic algorithm to discover association rules. The proposed algorithm outperforms the apriori algorithm for larger databases without losing a single rule. It involves a single database scan and significantly reduces the number of unsuccessful candidate sets generated in apriori algorithm that later fails the minimum support test. It uses the concept of recursive medians to compute the dispersion in the transaction list for each itemset. The recursive medians are implemented in the algorithm as an Inverted V-Median Search Tree (IVMST). The recursive medians are used to compute the maximum number of common transactions for any two itemsets. We try to present a time efficient probabilistic mechanism to discover frequent itemsets.

Vaibhav Sharma; M.M. Sufyan Beg

2012-01-01T23:59:59.000Z

323

Control algorithms for dynamic attenuators  

SciTech Connect (OSTI)

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.

Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)

2014-06-15T23:59:59.000Z

324

Consumer Tips for Lowering Your Utility Bill | Open Energy Information  

Open Energy Info (EERE)

Consumer Tips for Lowering Your Utility Bill Consumer Tips for Lowering Your Utility Bill Jump to: navigation, search Whether you are a residential or commercial customer, your monthly utility bill contains a wide range of data such as how much energy you use, what your current rate is, and detailed fees. Depending on how much information your utility provider offers, you can refer to it along with these tips to reduce your energy use and save money. For in-depth tips on saving energy and money at home, visit EnergySavers.gov. If you have 13 months of historical data on your bill: See if you're using more energy now than you did during the same month last year. Are you using more energy? Look for ways to use less electricity such as purchasing energy efficient appliances and lighting and using a programmable thermostat.

325

BPA/Lower Valley Transmission Project Final Environmental Impact Statement  

Broader source: Energy.gov (indexed) [DOE]

1 1 Summary Summary * The Purpose and Need for Action * Alternatives * Affected Environment * Impacts This summary gives the major points of the Final Environmental Impact Statement (EIS) prepared for the BPA/Lower Valley Transmission Project by Bonneville Power Administration (BPA). BPA is the lead federal agency on this project and supervises the preparation of the EIS. The U.S. Forest Service is a cooperating agency and assists BPA in EIS preparation. The Targhee and Bridger-Teton National Forests are crossed by BPA's existing transmission line and some of the alternatives. S.1 Purpose and Need For Action S.1.1 BPA Lower Valley Power and Light, Inc. (LVPL) buys electricity from BPA and then supplies it to the residences, farms and businesses of the Jackson and Afton, Wyoming areas. Since the late 1980s,

326

Detecting a Spin Transition Zone in Earth's Lower Mantle | Advanced  

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

A 450-million-year-old Protein Reveals Evolution's Steps A 450-million-year-old Protein Reveals Evolution's Steps What Keeps Bugs from Being Bigger? A Mystery No More Understanding Materials Under High Pressure Malaria-resistant Mosquitoes Battle Disease with "Molecular Warhead" Science Highlights Archives: 2013 | 2012 | 2011 | 2010 2009 | 2008 | 2007 | 2006 2005 | 2004 | 2003 | 2002 2001 | 2000 | 1998 | Subscribe to APS Science Highlights rss feed Detecting a Spin Transition Zone in Earth's Lower Mantle SEPTEMBER 21, 2007 Bookmark and Share Schematic illustration of in situ x-ray emission spectroscopy combined with x-ray diffraction and double-sided laser heating techniques for studies of electronic spin states of iron in ferropericlase (Mg0.75,Fe0.25)O and its crystal structure at relevant pressures and temperatures for the lower

327

Tropospheric and Lower Stratospheric Temperature Anomalies Based on Global  

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

Tropospheric and Lower Stratospheric Temperature Anomalies Based on Global Tropospheric and Lower Stratospheric Temperature Anomalies Based on Global Radiosonde Network Data DOI: 10.3334/CDIAC/cli.004 data Data image Graphics Investigators Alexander M. Sterin Russian Research Institute for Hydrometeorological Information-World Data Center (RIHMI-WDC), 6, Korolyov str., Obninsk, Kaluga region, Russia, 249035 Period of Record January, 1958 - September, 2005 (relative to the average for 1961-1975). Methods The observed radiosonde data from the Comprehensive Aerological Reference Data Set (CARDS) (Eskridge et al. 1995) were taken as the primary input for obtaining the series. These data were for the global radiosonde observational network through 2001. Since 2002, the AEROSTAB data (uper-air observations obtained through communication channels), collected at

328

Lower 48 States Natural Gas Liquids Lease Condensate, Reserves Based  

Gasoline and Diesel Fuel Update (EIA)

Reserves Based Production (Million Barrels) Reserves Based Production (Million Barrels) Lower 48 States Natural Gas Liquids Lease Condensate, Reserves Based Production (Million Barrels) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8 Year-9 1970's 147 1980's 159 161 157 157 179 168 169 162 162 165 1990's 158 153 147 153 157 145 162 174 178 199 2000's 208 215 207 191 182 174 182 181 173 178 2010's 224 211 - = No Data Reported; -- = Not Applicable; NA = Not Available; W = Withheld to avoid disclosure of individual company data. Release Date: 8/1/2013 Next Release Date: 8/1/2014 Referring Pages: Lease Condensate Estimated Production Lower 48 States Lease Condensate Proved Reserves, Reserve Changes, and Production Lease Condensate

329

Jet Observables Without Jet Algorithms  

E-Print Network [OSTI]

We introduce a new class of event shapes to characterize the jet-like structure of an event. Like traditional event shapes, our observables are infrared/collinear safe and involve a sum over all hadrons in an event, but like a jet clustering algorithm, they incorporate a jet radius parameter and a transverse momentum cut. Three of the ubiquitous jet-based observables---jet multiplicity, summed scalar transverse momentum, and missing transverse momentum---have event shape counterparts that are closely correlated with their jet-based cousins. Due to their "local" computational structure, these jet-like event shapes could potentially be used for trigger-level event selection at the LHC. Intriguingly, the jet multiplicity event shape typically takes on non-integer values, highlighting the inherent ambiguity in defining jets. By inverting jet multiplicity, we show how to characterize the transverse momentum of the n-th hardest jet without actually finding the constituents of that jet. Since many physics applications do require knowledge about the jet constituents, we also build a hybrid event shape that incorporates (local) jet clustering information. As a straightforward application of our general technique, we derive an event-shape version of jet trimming, allowing event-wide jet grooming without explicit jet identification. Finally, we briefly mention possible applications of our method for jet substructure studies.

Daniele Bertolini; Tucker Chan; Jesse Thaler

2013-10-28T23:59:59.000Z

330

Chitinozoans in the subsurface Lower Paleozoic of West Texas  

E-Print Network [OSTI]

THE UNIVERSITY OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS October 22, 1971 Paper 54 CHITINOZOANS IN THE SUBSURFACE LOWER PALEOZOIC OF WEST TEXAS A. E. KAUFFMAN Humble Oil & Refining Company, Midland, Texas ABSTRACT Studies based on both comprehensive... with known lithologie in- tervals and electric logs. These fossils were re- covered from most lithologies. Chert, including novaculite and tripolitic types, and dark micritic 4 The University of Kansas Paleontological ContributionsPaper 54 limestone yield...

Kauffman, A. E.

1971-10-22T23:59:59.000Z

331

Lower Granite Dam Smolt Monitoring Program; 1997 Annual Report.  

SciTech Connect (OSTI)

The 1997 fish collection season at Lower Granite was characterized by high spring flows, extensive spill, cool spring and early summer water temperatures and comparatively low numbers of fish, particularly yearling chinook. The Fish Passage Center's Smolt Monitoring Program is designed to provide a consistent, real-time database of fish passage and document the migrational characteristics of the many stocks of salmon and steelhead in the Columbia Basin.

Verhey, Peter; Witalis, Shirley; Morrill, Charles (Washington Department of Fish and Wildlife, Olympia, WA)

1998-01-01T23:59:59.000Z

332

Lower-Temperature Invert Design For Diffusion Barrier  

SciTech Connect (OSTI)

The objective of this analysis is to advance the state of the subsurface facilities design to primarily support the ''Yucca Mountain Science and Engineering Report'' (DOE 2001) and to also support the preparation and revision of System Description Document's Section 2 system descriptions (CRWMS M&O 2001, pp. 9 and 11). The results may also eventually support the License Application (CRWMS M&O 2001, p. 3). The Performance Assessment Department will be the primary user of the information generated and will be used in abstraction modeling for the lower-temperature scenario (CRWMS M&O 200 1, p. 27). This analysis will evaluate the invert relative to the lower- and higher-temperature conditions in accordance with the primary tasks below. Invert design is a major factor in allowing water entering the drift to pass freely and enter the drift floor without surface ponding and in limiting diffusive transport into the host rock. Specific cost effective designs will be conceptualized under the new lower-temperature conditions in this analysis. Interfacing activities and all aspects of Integrated Safety Management and Nuclear Culture principles are included in this work scope by adhering to the respective principles during this design activity and by incorporating safety into the design analysis (CRWMS M&O 2001, p. 8). Primary tasks of this analysis include identifying available design information from existing sources on the invert as a diffusive barrier, developing concepts that reduce the amount steel, and developing other design features that accommodate both lower- and higher-temperature operating modes (CRWMS M&O 2001, p.16).

Bruce Stanley

2001-07-30T23:59:59.000Z

333

Lower Ray River Geothermal Area | Open Energy Information  

Open Energy Info (EERE)

Lower Ray River Geothermal Area Lower Ray River Geothermal Area Jump to: navigation, search GEOTHERMAL ENERGYGeothermal Home Geothermal Resource Area: Lower Ray River Geothermal Area Contents 1 Area Overview 2 History and Infrastructure 3 Regulatory and Environmental Issues 4 Exploration History 5 Well Field Description 6 Geology of the Area 7 Geofluid Geochemistry 8 NEPA-Related Analyses (0) 9 Exploration Activities (0) 10 References Loading map... {"minzoom":false,"mappingservice":"googlemaps3","type":"TERRAIN","zoom":6,"types":["ROADMAP","SATELLITE","HYBRID","TERRAIN"],"geoservice":"google","maxzoom":false,"width":"500px","height":"300px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"wmsoverlay":"","layers":[],"controls":["pan","zoom","type","scale","streetview"],"zoomstyle":"DEFAULT","typestyle":"DEFAULT","autoinfowindows":false,"kml":[],"gkml":[],"fusiontables":[],"resizable":false,"tilt":0,"kmlrezoom":false,"poi":true,"imageoverlays":[],"markercluster":false,"searchmarkers":"","locations":[{"text":"","title":"","link":null,"lat":65.9839,"lon":-150.5797,"alt":0,"address":"","icon":"","group":"","inlineLabel":"","visitedicon":""}]}

334

Lower 48 States Natural Gas Working Underground Storage (Billion Cubic  

Gasoline and Diesel Fuel Update (EIA)

Lower 48 States Natural Gas Working Underground Storage (Billion Cubic Feet) Lower 48 States Natural Gas Working Underground Storage (Billion Cubic Feet) Lower 48 States Natural Gas Working Underground Storage (Billion Cubic Feet) Year-Month Week 1 Week 2 Week 3 Week 4 Week 5 End Date Value End Date Value End Date Value End Date Value End Date Value 1993-Dec 12/31 2,322 1994-Jan 01/07 2,186 01/14 2,019 01/21 1,782 01/28 1,662 1994-Feb 02/04 1,470 02/11 1,303 02/18 1,203 02/25 1,149 1994-Mar 03/04 1,015 03/11 1,004 03/18 952 03/25 965 1994-Apr 04/01 953 04/08 969 04/15 1,005 04/22 1,085 04/29 1,161 1994-May 05/06 1,237 05/13 1,325 05/20 1,403 05/27 1,494

335

Lower Columbia River Terminal Fisheries Research Project : Final Environmental Assessment.  

SciTech Connect (OSTI)

This notice announces BPA`S`s decision to fund the Oregon Department of Fish and Wildlife (ODFW), the Washington Department of Fish and Wildlife (WDFW), and the Clatsop Economic Development Committee for the Lower Columbia River Terminal Fisheries Research Project (Project). The Project will continue the testing of various species/stocks, rearing regimes, and harvest options for terminal fisheries, as a means to increase lower river sport and commercial harvest of hatchery fish, while providing both greater protection of weaker wild stocks and increasing the return of upriver salmon runs to potential Zone 6 Treaty fisheries. The Project involves relocating hatchery smolts to new, additional pen locations in three bays/sloughs in the lower Columbia River along both the Oregon and Washington sides. The sites are Blind Slough and Tongue Point in Clatsop County, Oregon, and Grays Bay/Deep River, Wahkiakum County, Washington. The smolts will be acclimated for various lengths of time in the net pens and released from these sites. The Project will expand upon an existing terminal fisheries project in Youngs Bay, Oregon. The Project may be expanded to other sites in the future, depending on the results of this initial expansion. BPA`S has determined the project is not a major Federal action significantly affecting the quality of the human environment, within the meaning of the National Environmental Policy Act (NEPA) of 1969. Therefore, the preparation of an environmental impact statement is not required, and BPA`S is issuing this FONSI.

United States. Bonneville Power Administration.

1995-04-01T23:59:59.000Z

336

Environmental audit, Bonneville Power Administration, lower Columbia area  

SciTech Connect (OSTI)

This report documents the results of the US Department of Energy's (DOE's) Environmental Audit conducted by the DOE Headquarters Office of Environmental Audit within the Bonneville Power Administration's (BPA's) Lower Columbia Area. The BPA facilities included in the Audit are the Ross Complex in Vancouver, Washington; the substations of North Bonneville, North Bonneville Annex, Camas, and Longview within the state of Washington; and the Acton and Troutdale Substations within the state of Oregon. The independent Audit was conducted by a team of professionals from DOE and contractors. The purpose of the Audit is to provide the Secretary of Energy, Admiral James D. Watkins, Ret., with the status of environmental programs within BPA's Lower Columbia Area. The Environmental Audit team identified 25 findings dealing with the lack of conformance with federal and state laws and regulations and DOE Orders, and 7 findings in which BMPs were not attained. Although all findings require corrective action, none required cessation of operations or reflect situations that present an immediate risk to public health or the environment. The Audit team noted inadequacies in PCB management included storage, labeling, reporting, and spill control. The most significant causal factors for the findings include lack of policy implementation throughout the Lower Columbia Area, inadequate training of personnel charged with environmental protection, lack of standard operating procedures for many programs, lack of reviews and appraisals, and an inaccurate perception of low risk for environmental concerns.

Not Available

1990-11-01T23:59:59.000Z

337

On the Toroidal Plasma Rotations Induced by Lower Hybrid Waves  

SciTech Connect (OSTI)

A theoretical model is developed to explain the plasma rotations induced by lower hybrid waves in Alcator C-Mod. In this model, torodial rotations are driven by the Lorentz force on the bulk electron flow across flux surfaces, which is a response of the plasma to the resonant-electron flow across flux surfaces induced by the lower hybrid waves. The flow across flux surfaces of the resonant electrons and the bulk electrons are coupled through the radial electric fi eld initiated by the resonant electrons, and the friction between ions and electrons transfers the toroidal momentum to ions from electrons. An improved quasilinear theory with gyrophase dependent distribution function is developed to calculate the perpendicular resonant-electron flow. Toroidal rotations are determined using a set of fluid equations for bulk electrons and ions, which are solved numerically by a fi nite- difference method. Numerical results agree well with the experimental observations in terms of flow pro file and amplitude. The model explains the strong correlation between torodial flow and internal inductance observed experimentally, and predicts both counter-current and co-current flows, depending on the perpendicular wave vectors of the lower hybrid waves. __________________________________________________

Xiaoyin Guan, Hong Qin, Jian Liu and Nathaniel J. Fisch

2012-11-14T23:59:59.000Z

338

Set Covering and Network Optimization: Dynamic and Approximation Algorithms  

E-Print Network [OSTI]

Set Covering and Network Optimization: Dynamic and Approximation Algorithms Orestis A. Telelis summarize our results on development and analysis of approximation and dynamic algorithms for set covering and network optimization problems. The results include probabilistic analysis of set covering algorithms

Kouroupetroglou, Georgios

339

Multiobjective evolutionary algorithm for the optimization of noisy combustion processes  

Science Journals Connector (OSTI)

This work introduces a multiobjective evolutionary algorithm capable of handling noisy problems with a particular emphasis on robustness against unexpected measurements (outliers). The algorithm is based on the Strength Pareto evolutionary algorithm ...

D. Buche; P. Stoll; R. Dornberger; P. Koumoutsakos

2002-11-01T23:59:59.000Z

340

Approximation algorithms for the partition vertex cover problem  

Science Journals Connector (OSTI)

Abstract We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = ( V , E ) , a cost function c : V ? Z + , a partition P 1 , , P r of the edge set E, and a parameter k i for each partition P i . The objective is to find a minimum cost set of vertices which cover at least k i edges from the partition P i . We call this the Partition-VC problem. In this paper, we give matching upper and lower bound on the approximability of this problem. Our algorithm is based on a novel LP relaxation for this problem. This LP relaxation is obtained by adding knapsack cover inequalities to a natural LP relaxation of the problem. We show that this LP has integrality gap of O ( log ? r ) , where r is the number of sets in the partition of the edge set. We also extend our result to more general settings. For example we consider a problem where additionally edges have profits, and we would like to pick a minimum cost set of vertices which cover edges of total profit at least ? i for each partition P i . We call this the Knapsack Partition Vertex Cover problem. We give an O ( log ? r ) approximation algorithm for this problem as well.

Suman K. Bera; Shalmoli Gupta; Amit Kumar; Sambuddha Roy

2014-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

E-Print Network 3.0 - application genetic algorithms Sample Search...  

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

algorithms Page: << < 1 2 3 4 5 > >> 1 Foundations Algorithm Components Numerical Optimization Genetic Programming Genetic Algorithms Summary: Algorithm Components Numerical...

342

QCDLAB: Designing Lattice QCD Algorithms with MATLAB  

E-Print Network [OSTI]

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

Artan Borici

2006-10-09T23:59:59.000Z

343

Algorithms for optimal dyadic decision trees  

SciTech Connect (OSTI)

A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.

Hush, Don [Los Alamos National Laboratory; Porter, Reid [Los Alamos National Laboratory

2009-01-01T23:59:59.000Z

344

Scheduling and allocation algorithm for an elliptic filter  

E-Print Network [OSTI]

A new evolutionary algorithm for scheduling and allocation algorithm is developed for an elliptic filter. The elliptic filter is scheduled and allocated in the proposed work which is then compared with the different scheduling algorithms like As Soon As Possible algorithm, As Late As Possible algorithm, Mobility Based Shift algorithm, FDLS, FDS and MOGS. In this paper execution time and resource utilization is calculated using different scheduling algorithm for an Elliptic Filter and reported that proposed Scheduling and Allocation increases the speed of operation by reducing the control step. The proposed work to analyse the magnitude, phase and noise responses for different scheduling algorithm in an elliptic filter.

Marikkannan, Sangeetha

2012-01-01T23:59:59.000Z

345

A quantum algorithm for the quantum Schur-Weyl transform  

E-Print Network [OSTI]

We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for any value of the quantum parameter $q \\in [0,\\infty]$. Our algorithm is a $q$-deformation of the Bacon-Chuang-Harrow algorithm, in the sense that it has the same structure and is identically equal when $q=1$. When $q=0$, our algorithm is the unitary realization of the Robinson-Schensted-Knuth (or RSK) algorithm, while when $q=\\infty$ it is the dual RSK algorithm together with phase signs. Thus, we interpret a well-motivated quantum algorithm as a generalization of a well-known classical algorithm.

Sonya Berg

2012-05-17T23:59:59.000Z

346

Dynamic Fuzzy Logic Control of GeneticAlgorithm Probabilities.  

E-Print Network [OSTI]

?? Genetic algorithms are commonly used to solve combinatorial optimizationproblems. The implementation evolves using genetic operators (crossover, mutation,selection, etc.). Anyway, genetic algorithms like some other (more)

Feng, Yi

2008-01-01T23:59:59.000Z

347

Reservoir Operation by Ant Colony Optimization Algorithms M. R. ...  

E-Print Network [OSTI]

Reservoir Operation by Ant Colony Optimization Algorithms. 1. Reservoir Operation by Ant Colony Optimization Algorithms. M. R. Jalali1; A. Afshar2; and M. A....

Jalali

2000-11-05T23:59:59.000Z

348

A scenario decomposition algorithm for 0-1 stochastic programs  

E-Print Network [OSTI]

Jul 19, 2013 ... Abstract: We propose a scenario decomposition algorithm for stochastic 0-1 programs. The algorithm recovers an optimal solution by iteratively...

Shabbir Ahmed

2013-07-19T23:59:59.000Z

349

New Design Methods and Algorithms for Multi-component Distillation...  

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

New Design Methods and Algorithms for Multi-component Distillation Processes New Design Methods and Algorithms for Multi-component Distillation Processes multicomponent.pdf More...

350

Sandia National Laboratories: High-Resolution Computational Algorithms...  

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

WindHigh-Resolution Computational Algorithms for Simulating Offshore Wind Farms High-Resolution Computational Algorithms for Simulating Offshore Wind Farms This Sandia National...

351

a nonstandard simplex algorithm for linear programming 1.  

E-Print Network [OSTI]

Ten Algorithms in the Twenty Century (IEEE2002), it is one of the most famous and ... Section 3 formulas the proposed nonstandard algorithm. Section 4 deals...

2008-12-29T23:59:59.000Z

352

Lower Flathead System Fisheries Study, 1984 Annual Report.  

SciTech Connect (OSTI)

This study was undertaken to assess the effects of Kerr Dam operations on the fisheries of the Lower Flathead System. Supported by Bonneville Power Administration funding, and conducted by the Confederated Salish and Kootenai Tribes, the study began in December of 1982 and is scheduled for completion in December of 1987. This report covers the 1983-84 field season and includes the status of target fish species populations in the Flathead River and tributaries, and initial work in South Bay of Flathead Lake. Additionally it addresses how Kerr operations may effect the reproduction of salmonids and northern pike. Combined trout population estimates for rainbow, brown, brook, and bull trout, averaged 13 fish/km of the lower Flathead River. The number of bull trout and cutthroat trout captured was so low that estimation of their individual populations was not possible. An interim closure to trout harvest on the lower Flathead River was recommended and approved by the Tribal Council until study results can be further analyzed and management options reviewed. Population estimates for northern pike ranged from six/kilometer in poorer habitat, to one hundred three/km in the best habitat in the main Flathead River. Seven pike were radio tagged and their movements monitored. Movements of over 89 km were recorded. One fish left the Flathead River and moved down the Clark Fork to the Plains area. Fish weirs were constructed on the Jocko River and Mission Creek to assess spawning runs of trout from the main river. Thirty-two adult rainbow passed the Jocko weir and twenty-eight passed the Mission weir during the spring spawning season. Twenty adult brown trout were captured at the Jocko weir and five at Mission weir in the fall. The Jocko weir suffered minor damage due to bed load movement during high flows of spring runoff. The structure of trout populations in the lower Flathead River points to spawning and recruitment problems caused by hydroelectric operations and sedimentation. Among the consequences of the present operational regime are constant, rapid changes in river discharge during spawning and Incubation seasons of trout species present in the lower river. Hamilton and Buell (1976) reported that similar fluctuation might exceed tolerance limits of adults and inhibit spawning behavior, dewater redds, strand fry, and displace juveniles to habitats less suitable for survival. Similar problems are felt to exist on the lower river. Constant fluctuations over backwater vegetation have been linked to major problems in successful northern pike spawning and recruitment by preventing access to spawning sites, and dewatering eggs and attached fry. Phase I of the South Bay investigation was completed this year resulting in a detailed study program for the next three years. Dominant habitat types were mapped, and physical habitat and biological monitoring methods were evaluated and selected. Permanent habitat transects, water quality stations, fish sampling, gillnetting, seining, and trapping sites were established.

Darling, James E.; Pajak, Paul; Wunderlich, Mary P.

1984-12-01T23:59:59.000Z

353

Sequence architecture of Lower Cretaceous carbonate shelf, Gulf Coast  

SciTech Connect (OSTI)

Cretaceous carbonate shelves in the Gulf Coast and the Chihuahua trough in Arizona record both eustatic and tectonic events. The Lower Cretaceous Comanche shelf in Texas and Louisiana consists of five major depositional/seismic sequences. The regionally extensive bounding surfaces of each sequence are either drowning unconformities or exposure unconformities. Drowning is inferred where shallow shelf facies are overlain by deeper water pelagic facies. Exposure is inferred where coastal terrigenous facies overlie marine shelf carbonates or paralic clastics. The interval of downlap and maximum flooding may be either a sharp contact that corresponds with the sequence boundary, or may be a gradational interval where deeper facies change to shoaling-upward facies. Medial Albian terrigenous clastics terminated the lower Albian carbonate shelf in the northern part of the Chihuahua trough. Farther south, the carbonate shelf persisted into the middle Albian. In Texas and Louisiana lower and middle Albian shelf margins prograded southward up to 15 km. Low-angle simple sigmoidal sequence geometry (type 1) suggests low-energy areas of the shelf. Steep, complex-oblique sequences (type 2) suggested high-energy areas. During the late Albian, the shelf margin was drowned in many places, and pelagic facies overlie the shelf facies. Rates of sediment accumulation within the low-energy prograding Fredericksburg sequence shelf margin are nearly two times those in the forereef basin and seven times greater than in the updip shoreward portion (8.98 cm/ky.; 4.85 cm/k.y.; 1.28 cm/k.y.). numerous hiatuses probably punctuate the interbedded sand and carbonate section in the updip, nearshore part of the shelf. Even rates in the pelagic shelf of the Washita sequence are greater than in the updip intrashelf Fast Texas embayment (1.69 cm/ky. compared to 1.28 cm/ky-).

Scott, R.W. (Amoco Production Co., Tulsa, OK (USA))

1990-05-01T23:59:59.000Z

354

Student's algorithm solves real-world problem  

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

Student's algorithm solves real-world problem Student's algorithm solves real-world problem Supercomputing Challenge: student's algorithm solves real-world problem Students learn how to use powerful computers to analyze, model, and solve real-world problems. April 3, 2012 Jordon Medlock of Albuquerque's Manzano High School won the 2012 Lab-sponsored Supercomputing Challenge Jordon Medlock of Albuquerque's Manzano High School won the 2012 Lab-sponsored Supercomputing Challenge by creating a computer algorithm that automates the process of counting and analyzing plaques, substances in the blood such as fat and cholesterol found in persons diagnosed with Alzheimer's disease. Contact Kurt Steinhaus (505) 665-7370 Email "The mission of the Supercomputing Challenge is to teach students how to use powerful computers to analyze, model, and solve real-world problems,"

355

subspace accelerated matrix splitting algorithms for bound ...  

E-Print Network [OSTI]

Their algorithm uses a projected gradient search in the first phase ..... eration is generally superior to a projected gradient iteration in terms of identifying an optimal ..... Once the subspace step has been computed, we enter Step 3 and compute.

2011-09-28T23:59:59.000Z

356

Automated Algorithm for MFRSR Data Analysis  

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

calibration constants from the data is a part of the retrieval process. Our algorithm is applied simultaneously to a set of daily MFRSR records covering at least a month...

357

A Local Search Algorithm for Branchwidth  

Science Journals Connector (OSTI)

As many problems can be solved in polynomial time on graphs of bounded branchwidth, there is a need for efficient and practical algorithms that find branch decompositions of small width of given graphs. In thi...

Arnold Overwijk; Eelko Penninkx

2011-01-01T23:59:59.000Z

358

Implementing Shor's algorithm on Josephson charge qubits  

SciTech Connect (OSTI)

We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits are available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.

Vartiainen, Juha J.; Salomaa, Martti M. [Materials Physics Laboratory, POB 2200 (Technical Physics), Helsinki University of Technology, FIN-02015 HUT (Finland); Niskanen, Antti O. [VTT Information Technology, Microsensing, POB 1207, 02044 VTT (Finland); Nakahara, Mikio [Materials Physics Laboratory, POB 2200 (Technical Physics), Helsinki University of Technology, FIN-02015 HUT (Finland); Department of Physics, Kinki University, Higashi-Osaka 577-8502 (Japan)

2004-07-01T23:59:59.000Z

359

Quantum Robot: Structure, Algorithms and Applications  

E-Print Network [OSTI]

A kind of brand-new robot, quantum robot, is proposed through fusing quantum theory with robot technology. Quantum robot is essentially a complex quantum system and it is generally composed of three fundamental parts: MQCU (multi quantum computing units), quantum controller/actuator, and information acquisition units. Corresponding to the system structure, several learning control algorithms including quantum searching algorithm and quantum reinforcement learning are presented for quantum robot. The theoretic results show that quantum robot can reduce the complexity of O(N^2) in traditional robot to O(N^(3/2)) using quantum searching algorithm, and the simulation results demonstrate that quantum robot is also superior to traditional robot in efficient learning by novel quantum reinforcement learning algorithm. Considering the advantages of quantum robot, its some potential important applications are also analyzed and prospected.

Dao-Yi Dong; Chun-Lin Chen; Chen-Bin Zhang; Zong-Hai Chen

2005-06-18T23:59:59.000Z

360

Jun. 6, 2013 BBM 202 -ALGORITHMS  

E-Print Network [OSTI]

that would create a clockwise turn. 11 aham scan. Choose point p with smallest (or largest) y that would create a clockwise turn. aham scan algorithm p an. e point p with smallest (or largest) y

Erdem, Erkut

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Large scale prediction models and algorithms  

E-Print Network [OSTI]

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

Monsch, Matthieu (Matthieu Frederic)

2013-01-01T23:59:59.000Z

362

The proximal-proximal gradient algorithm  

E-Print Network [OSTI]

Aug 23, 2013 ... to consider a proximal gradient algorithm [11] for solving (1), where one ...... Hence, in the case when ? = 1 and M is surjective so that T = MR for...

2013-08-24T23:59:59.000Z

363

Computer Animation: Algorithms and Techniques, 3 edition  

Science Journals Connector (OSTI)

Driven by demand from the entertainment industry for better and more realistic animation, technology continues to evolve and improve. The algorithms and techniques behind this technology are the foundation of this comprehensive book, which is written ...

Rick Parent

2012-10-01T23:59:59.000Z

364

Universality in algorithmic self-assembly.  

E-Print Network [OSTI]

??Tile-based self-assembly is a model of "algorithmic crystal growth" in which square "tiles" represent molecules that bind to each other via specific and variable-strength bonds (more)

Summers, Scott

2010-01-01T23:59:59.000Z

365

Distributed Algorithms for Autonomous Mobile Robots  

Science Journals Connector (OSTI)

The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a ... algorithmic limitations on what a set of autonomous mobile robots can achieve. In particular, th...

Nicola Santoro

2006-01-01T23:59:59.000Z

366

Practical algorithms for distributed network control  

E-Print Network [OSTI]

Optimal routing and scheduling algorithms have been studied for decades, however several practical issues prevent the adoption of these network control policies on the Internet. This thesis considers two distinct topics ...

Jones, Nathaniel Matthew

2013-01-01T23:59:59.000Z

367

Algorithmic Decision Theory and the Smart Grid  

E-Print Network [OSTI]

professionals #12;8 Algorithmic Decision Theory ·First International Conference on ADT, Venice 2009. ·Second are borrowed from a presentation by Gil Bindewald of the Dept. of Energy to the SIAM Science Policy Committee

368

Quantum Algorithms for Element Distinctness Harry Buhrman  

E-Print Network [OSTI]

Quantum Algorithms for Element Distinctness Harry Buhrman Christoph D¨urr Mark Heiligman§ Peter, France. Email: durr@lri.fr. §NSA, Suite 6111, Fort George G. Meade, MD 20755, USA. Email: mheilig

Magniez, Frédéric

369

Quantum Algorithms for Element Distinctness Harry Buhrman  

E-Print Network [OSTI]

Quantum Algorithms for Element Distinctness Harry Buhrman£ Christoph D¨urr? Mark Heiligman? Peter, France. Email: durr@lri.fr. ?NSA, Suite 6111, Fort George G. Meade, MD 20755, USA. Email: mheilig

de Wolf, Ronald

370

Genetic algorithms at UC Davis/LLNL  

SciTech Connect (OSTI)

A tutorial introduction to genetic algorithms is given. This brief tutorial should serve the purpose of introducing the subject to the novice. The tutorial is followed by a brief commentary on the term project reports that follow.

Vemuri, V.R. [comp.

1993-12-31T23:59:59.000Z

371

Microsoft Word - LowerJocko_Acquisition_CX_final_081310.doc  

Broader source: Energy.gov (indexed) [DOE]

6, 2010 6, 2010 REPLY TO ATTN OF: KEC-4 SUBJECT: Environmental Clearance Memorandum Cecilia Brown Project Manager - KEWM-4 Proposed Action: Provision of funds to Confederated Salish and Kootenai Tribes (CSKT) for purchase of the Lower Jocko River Property Fish and Wildlife Project No.: 2002-003-00, Contract # BPA-44646 Categorical Exclusion Applied (from Subpart D, 10 C.F.R. Part 1021): B1.25 Transfer, lease, disposition or acquisition of interests in uncontaminated land for habitat preservation or wildlife

372

Nonlinear lower hybrid oscillations in a cold viscous plasma  

SciTech Connect (OSTI)

An analytical description of nonlinear lower hybrid oscillations in a cold quasi-neutral plasma in the presence of viscosity is presented in one spatial dimension by using Lagrangian variables. By treating viscosity coefficients of the electron and ion fluids as inversely proportional to their respective densities, an exact solution is obtained. It is found that the damping rate of such oscillations is directly proportional to the effective viscosity coefficients of electron and ion fluids. A possible implication of such solutions is briefly outlined.

Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Kolkata-700064 (India)

2011-12-15T23:59:59.000Z

373

Investigation of towing resistance of rectangular platform lower base  

SciTech Connect (OSTI)

The paper describes model tests with a rectangular (in plan view) lower base of an offshore platform in calm seas. The resistance-reduction exercise was aimed at improving the economical aspect of an intended long-distance towing project and resulted in designing an additional structural element forming a fixed separation zone in front of the platform and thus helping to save tug boat fuel thanks to a 15--20% reduction in the towing resistance. The test also included calm seas unsteady force evaluations for both the initial and modified design options.

Poustoshniy, A.V. [Krylov Shipbuilding Research Inst., St. Petersburg (Russian Federation)

1995-12-31T23:59:59.000Z

374

More wind generation means lower GHG emissions, right?  

SciTech Connect (OSTI)

The answer to what will be the net effect of an x percent increase in wind generation on GHG emissions in a given system is not a simple y percent -- but is likely to depend on many variables, assumptions, modeling, and number crunching. But the result is important, and hence there has been a flurry of contradictory studies, confusing policymakers and the general public alike. While one can certainly find exceptions, under most circumstances, more renewable generation can be expected to result in lower GHG emissions.

NONE

2010-11-15T23:59:59.000Z

375

An Algorithmic Approach to Heterotic String Phenomenology  

E-Print Network [OSTI]

We briefly review the recent programme to construct, systematically and algorithmically, large classes of heterotic vacua, as well as the search for the MSSM therein. Specifically, we outline the monad construction of vector bundles over complete intersection Calabi-Yau threefolds, their classification, stability, equivariant cohomology and subsequent relevance to string phenomenology. It is hoped that this top-down algorithmic approach will isolate special corners in the heterotic landscape.

Yang-Hui He

2010-01-14T23:59:59.000Z

376

Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets  

E-Print Network [OSTI]

Simulations of frustrated quantum antiferromagnets suffer from a severe sign problem. We solve the ergodicity problem of the loop-cluster algorithm in a natural way and apply a powerful strategy to address the sign problem. For the spin 1/2 Heisenberg antiferromagnet on a kagome and on a frustrated square lattice, a nested cluster algorithm eliminates the sign problem for large systems. The method is applicable to general lattice geometries but limited to moderate temperatures.

M. Nyfeler; F. -J. Jiang; F. Kmpfer; U. -J. Wiese

2008-03-25T23:59:59.000Z

377

A fast indexing algorithm for sparse matrices  

E-Print Network [OSTI]

A FAST INDEXING ALGORITHM FOR SPARSE MATRICES A Thesis ALVIN EDWARD NIEDER Submitted to the Graduate College of Texas Algal University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE December 1/71 Major Subject... INDEXING ALGORITHM FOR SPARSE MATRICES (December, 1/71) Alvin Edward Nieder B. S. , Texas AEZ University Directed by: Dr. Udo Pooch A sparse matrix is defined to be a matrix con- taining a high proportion of elements that are zeros. Sparse matrices...

Nieder, Alvin Edward

1971-01-01T23:59:59.000Z

378

Lower 48 States Natural Gas Liquids Lease Condensate, Proved Reserves  

U.S. Energy Information Administration (EIA) Indexed Site

Liquids Lease Condensate, Proved Reserves (Million Barrels) Liquids Lease Condensate, Proved Reserves (Million Barrels) Lower 48 States Natural Gas Liquids Lease Condensate, Proved Reserves (Million Barrels) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8 Year-9 1970's 1,401 1980's 1,530 1,580 1,601 1,613 1,503 1,452 1,436 1,402 1,389 1,389 1990's 1,302 1,244 1,226 1,192 1,147 1,197 1,307 1,341 1,336 1,403 2000's 1,472 1,398 1,346 1,215 1,221 1,262 1,339 1,495 1,433 1,633 2010's 1,914 2,370 - = No Data Reported; -- = Not Applicable; NA = Not Available; W = Withheld to avoid disclosure of individual company data. Release Date: 8/1/2013 Next Release Date: 8/1/2014 Referring Pages: Lease Condensate Proved Reserves as of Dec. 31 Lower 48 States Lease Condensate Proved Reserves, Reserve Changes,

379

Lower Flathead System Fisheries Study, 1986 Interim Report.  

SciTech Connect (OSTI)

We believe our results have clearly shown Kerr hydroelectric operations and operational constraints have negatively affected Flathead River trout and northern pike populations and the aquatic habitat which support them. Even so, it is possible to mitigate many of these impacts and develop a very important fishery. Trout abundance in the lower Flathead averaged only 19 fish per kilometer, the lowest abundance of trout for a river of this size in Montana. Little main channel spawning by trout was observed and most spawning probably occurs in tributaries. Lower river tributaries support resident populations of brook, rainbow, brown, and cutthroat trout; and a small resident population of bull trout is present in the South Fork of the Jocko River. Using weirs, spawning runs of rainbow and brown trout from the main river were monitored entering the Jocko River and the Post/Mission Creek system. Utilization of Crow Creek by main river trout stocks of trout was limited to the 6 km segment below Crow Dam. Evaluations of tributary spawning gravels showed high levels of silt which would suggest poor survival of trout eggs. Excessive harvest in the tributaries was indicated by analysis of age class structure and abundance of trout greater than 200 mm.

Bradshaw, William H.; DosSantos, Joseph M.; Darling, James M.

1986-08-01T23:59:59.000Z

380

Storing syngas lowers the carbon price for profitable coal gasification  

SciTech Connect (OSTI)

Integrated gasification combined cycle (IGCC) electric power generation systems with carbon capture and sequestration have desirable environmental qualities but are not profitable when the carbon dioxide price is less than approximately $50 per metric ton. We examine whether an IGCC facility that operates its gasifier continuously but stores the syngas and produces electricity only when daily prices are high may be profitable at significantly lower CO{sub 2} prices. Using a probabilistic analysis, we have calculated the plant-level return on investment (ROI) and the value of syngas storage for IGCC facilities located in the U.S. Midwest using a range of storage configurations. Adding a second turbine to use the stored syngas to generate electricity at peak hours and implementing 12 h of above-ground high-pressure syngas storage significantly increases the ROI and net present value. Storage lowers the carbon price at which IGCC enters the U.S. generation mix by approximately 25%. 36 refs., 7 figs., 1 tab.

Adam Newcomer; Jay Apt [Carnegie Mellon University, Pittsburgh, PA (USA). Carnegie Mellon Electricity Industry Center

2007-12-15T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

http://www.energy.gov/media/F...Biofuels_Lower_Gas_Prices.pdf...  

Broader source: Energy.gov (indexed) [DOE]

http:www.energy.govmediaF...BiofuelsLowerGasPrices.pdf http:www.energy.govmediaF...BiofuelsLowerGasPrices.pdf http:www.energy.govmediaF...BiofuelsLowerGasPrice...

382

A GENERALIZATION OF THE DEUTSCH-JOZSA QUANTUM ALGORITHM  

E-Print Network [OSTI]

A GENERALIZATION OF THE DEUTSCH-JOZSA QUANTUM ALGORITHM Randall R. Holmes and Frederic Texier of functions on a finite abelian group. The algorithm is patterned after and generalizes one due to Deutsch of the integers modulo two. The Deutsch-Jozsa algorithm is a quantum algorithm for distinguishing between two

Tam, Tin-Yau

383

A Seeded Memetic Algorithm for Large Unit Commitment Problems  

Science Journals Connector (OSTI)

The paper shows that the use of a memetic algorithm (MA), a genetic algorithm (GA) combined with local search, synergistically combined with Lagrangian relaxation is effective and efficient for solving large unit commitment problems in electric power ... Keywords: Lagrangian relaxation, electrical power generation, genetic algorithm, memetic algorithm, unit commitment

Jorge Valenzuela; Alice E. Smith

2002-03-01T23:59:59.000Z

384

An evolutive algorithm for wind farm optimal design  

Science Journals Connector (OSTI)

An evolutive algorithm for the optimal design of wind farms is presented. The algorithm objective is to optimize the profits given an investment on a wind farm. Net present value will be used as a figure of the revenue. To work out this figure, several ... Keywords: Evolutive algorithm, Genetic algorithm, Optimization, Wind farms

Jos Castro Mora; Jos M. Calero Barn; Jess M. Riquelme Santos; Manuel Burgos Payn

2007-10-01T23:59:59.000Z

385

SCCMulti: an improved parallel strongly connected components algorithm  

Science Journals Connector (OSTI)

Tarjan's famous linear time, sequential algorithm for finding the strongly connected components (SCCs) of a graph relies on depth first search, which is inherently sequential. Deterministic parallel algorithms solve this problem in logarithmic time using ... Keywords: parallel graph algorithms, randomized algorithms, strongly connected components

Daniel Tomkins; Timmie Smith; Nancy M. Amato; Lawrence Rauchwerger

2014-02-01T23:59:59.000Z

386

A prototype classifier based on gravitational search algorithm  

Science Journals Connector (OSTI)

In recent years, heuristic algorithms have been successfully applied to solve clustering and classification problems. In this paper, gravitational search algorithm (GSA) which is one of the newest swarm based heuristic algorithms is used to provide a ... Keywords: Classification, Gravitational search algorithm, Prototype classifier, Swarm intelligence, UCI machine learning repository

Abbas Bahrololoum; Hossein Nezamabadi-pour; Hamid Bahrololoum; Masoud Saeed

2012-02-01T23:59:59.000Z

387

Autonomous UAV based search operations using Constrained Sampling Evolutionary Algorithms  

Science Journals Connector (OSTI)

This paper introduces and studies the application of Constrained Sampling Evolutionary Algorithms in the framework of an UAV based search and rescue scenario. These algorithms have been developed as a way to harness the power of Evolutionary Algorithms ... Keywords: Evolutionary algorithms, Robot coordination, Swarm intelligence, Team coordination, UAV, Unmanned Aerial Vehicles

Gervasio Varela, Pilar Caamao, Flix Orjales, lvaro Deibe, Fernando Lpez-Pea, Richard J. Duro

2014-05-01T23:59:59.000Z

388

NETL: News Release - More Electricity, Lower Emissions from Lignite Plants  

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

25, 2004 25, 2004 More Electricity, Lower Emissions from Lignite Plants Are Goals of New Clean Coal Project Fuel Enhancement System Expected to Boost Generating Capacities WASHINGTON, DC - Secretary of Energy Spencer Abraham today announced the testing of the Lignite Fuel Enhancement System, a new process that could dramatically reduce air emissions from certain coal-based power plants while boosting overall generating capacity. The project, conducted by Great River Energy, is expected to boost the generating capacity and efficiency of power plants that burn high-moisture lignite coal, thereby reducing air pollutants and greenhouse gases. The new technology uses waste heat to dry nearly a quarter of the moisture in the coal before it is fed into the power plant boiler.

389

Fuel Cell Tax Incentives: How Monetization Lowers the Government Outlay  

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

Tax Incentives: How Tax Incentives: How Monetization Lowers the Government Outlay By: Lee J. Peterson, Esq. Reznick Group, P.C. February 19, 2009 The Big Picture: Financing with Private Capital Income/Excise Tax Credits Depreciation Deductions - Regular and Accelerated Income Exclusions CREBS Income/Premium State Tax Credits Sales/Property Tax Exemptions Grants/Subsidies Rebates Buy-Downs Loan Guarantees REC Sales Tax-Exempt Debt Financing C F S B R T B R G Building Business Value February 19, 2009 1 § 45 Production Tax Credit (PTC) Established by the Energy Policy Act of 1992 Intended to stimulate the development of alternative technologies for power production, hence, you must produce power to receive the tax credit (production-

390

Bonneville Power Administration/Lower Valley Transmission Project  

Broader source: Energy.gov (indexed) [DOE]

853 853 Federal Register / Vol. 63, No. 162 / Friday, August 21, 1998 / Notices Radiological Impacts-Total radiological releases would be significantly lower than either the U.S. Environmental Protection Agency (EPA) limit or past annual releases from LANL. The resulting maximum concentrations for radionuclides measured at the location of the MEI for the demonstration is estimated to be less than two percent of the EPA limit. Radiological impacts associated with the proposed action could increase LANL total site impacts by a small percentage (1.0 percent for the MEI, 1.3 percent for the surrounding population, and 1.3 percent for the average individual). Under the proposed action, the estimated annual average dose to pit disassembly workers would be 750 mrem. The annual dose received by the

391

Microsoft Word - Lower-MidColumbia-Upgrade-CX.doc  

Broader source: Energy.gov (indexed) [DOE]

3, 2010 3, 2010 REPLY TO ATTN OF: KEC-4 SUBJECT: Environmental Clearance Memorandum Steve Prickett Project Manager - TEP Proposed Action: Lower Mid-Columbia / Midway-Vantage 230-kV Transmission Line Upgrade Project Budget Information: Work Order #238901 and #231311, Task 03 Categorical Exclusion Applied (from Subpart D, 10 C.F.R. Part 1021): B4.6 "Additions or modifications to electric power transmission facilities that would not affect the environment beyond the previously developed facility..." B4.7 Adding fiber optic cable to transmission structures or burying fiber optic cable in existing transmission line rights-of-way. B4.13 "Reconstruction (upgrading or rebuilding) and/or minor relocation of existing electric powerlines

392

BPA/Lower Valley Transmission Project Final Environmental Impact Statement  

Broader source: Energy.gov (indexed) [DOE]

1 9 9 7 1 9 9 7 B PA / L O W E R VA L L E Y T R A N S M I S S I O N P R O J E C T Final Environmental Impact Statement DOE/EIS-0267 J U N E 1 9 9 8 Bonneville Power Administration PO Box 3621 Portland, Oregon 97208-3621 DOE/BP-3067 JUNE 1998 450 Final Environmental Impact Statement BPA/Lower Valley Transmission Project Bonneville Power Administration U.S. Department of Energy and Forest Service U.S. Department of Agriculture June 1998 Table of Contents - i Table of Contents Summary ............................................................................................................................ S-1 S.1 Purpose and Need For Action ................................................................................................ S-1 S.1.1 BPA ...............................................................................................................................................

393

Lower Yellowstone R E A, Inc | Open Energy Information  

Open Energy Info (EERE)

R E A, Inc R E A, Inc Jump to: navigation, search Name Lower Yellowstone R E A, Inc Place Montana Utility Id 11272 Utility Location Yes Ownership C NERC Location MRO NERC MRO Yes Activity Distribution Yes References EIA Form EIA-861 Final Data File for 2010 - File1_a[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Utility Rate Schedules Grid-background.png Electric Heat Residential Net Metering Rate Schedule - Base #3 Commercial Net Metering Rate Schedule - Base 1 Residential Net Metering Rate Schedule - Base 2 Commercial Schedule A Residential Schedule AS - Annual Service Residential Schedule DC-1 Commercial Schedule EH - Electric Heat Rate Commercial Schedule GS - Single Phase Commercial

394

Numerical modeling of lower hybrid heating and current drive  

SciTech Connect (OSTI)

The generation of currents in toroidal plasma by application of waves in the lower hybrid frequency range involves the interplay of several physical phenomena which include: wave propagation in toroidal geometry, absorption via wave-particle resonances, the quasilinear generation of strongly nonequilibrium electron and ion distribution functions, and the self-consistent evolution of the current density in such a nonequilibrium plasma. We describe a code, LHMOD, which we have developed to treat these aspects of current drive and heating in tokamaks. We present results obtained by applying the code to a computation of current ramp-up and to an investigation of the possible importance of minority hydrogen absorption in a deuterium plasma as the ''density limit'' to current drive is approached.

Valeo, E.J.; Eder, D.C.

1986-03-01T23:59:59.000Z

395

Lower bounds to the spectral gap of Davies generators  

SciTech Connect (OSTI)

We construct lower bounds to the spectral gap of a family of Lindblad generators known as Davies maps. These maps describe the thermalization of quantum systems weakly coupled to a heat bath. The steady state of these systems is given by the Gibbs distribution with respect to the system Hamiltonian. The bounds can be evaluated explicitly, when the eigenbasis and the spectrum of the Hamiltonian is known. A crucial assumption is that the spectrum of the Hamiltonian is non-degenerate. Furthermore, we provide a counterexample to the conjecture, that the convergence rate is always determined by the gap of the associated Pauli master equation. We conclude that the full dynamics of the Lindblad generator has to be considered. Finally, we present several physical example systems for which the bound to the spectral gap is evaluated.

Temme, Kristan [Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)] [Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)

2013-12-15T23:59:59.000Z

396

Damping of lower hybrid waves in large spectral gap configurations  

SciTech Connect (OSTI)

Extensive experimental data support reliable power deposition and current drive by lower-hybrid (LH) waves in conditions where a large spectral gap exists between the nominal parallel index of refraction prescribed by the antenna characteristics and phasing, and that required for significant Landau damping to take place. We argue that only a significant modification of the initial spectrum at the plasma edge could explain experimental observations. Based on this assumption, a new prescription for reliable simulations of LH current drive using ray-tracing and Fokker-Planck modelling is proposed. A remarkable agreement between experimental observations in the Tore Supra tokamak and simulations is obtained for relevant parametric scans, including electron density and LH waveguide phasing. In an effort to investigate the possible role of fluctuations, it is shown that the spectral gap can be bridged dynamically in the presence of a fluctuating LH spectrum.

Decker, J.; Peysson, Y.; Artaud, J.-F.; Nilsson, E.; Ekedahl, A.; Goniche, M.; Hillairet, J.; Mazon, D. [CEA, IRFM, F-13108 Saint Paul lez Durance (France)

2014-02-12T23:59:59.000Z

397

Stochastic Ion Heating by a Lower Hybrid Wave: II  

E-Print Network [OSTI]

The motion of an ion in a coherent lower hybrid wave (characterized by |k_parallel| > Omega_i) in a tokamak plasma is studied. For ions satisfying v_perp > omega/k_perp, the Lorentz force law for the ions is reduced to a set of difference equations which give the Larmor radius and phase of an ion on one cyclotron orbit in terms of these quantities a cyclotron period earlier. From these difference equations an earlier result [Phys. Fluids 21, 1584 (1978)] that above a certain wave amplitude the ion motion is stochastic, is readily obtained. The stochasticity threshold is given a simple physical interpretation. In addition, the difference equations are used to derive a diffusion equation governing the heating of the ions above the stochasticity threshold. By including the effects of collisions, the heating rate for the bulk ions is obtained.

Charles F. F. Karney

2005-01-07T23:59:59.000Z

398

Accessibility for lower hybrid waves in PBX-M  

SciTech Connect (OSTI)

Understanding the wave damping mechanism in the presence of a `spectral gap` is an important issue for the current profile control using Lower Hybrid Current Drive (LHCD). The authors examine a traditional explanation based upon upshifting of the wave parallel refractive index (n{sub {parallel}}) and find that there can be an upper bound in the n{sub {parallel}} upshift. The amount of upshift is not sufficient to bridge the spectral gap completely under some PBX-M LHCD conditions. There is experimental evidence, however, that current was driven even under such conditions. Another mechanism is also considered, based upon the 2-D velocity space dynamics coupled with a compound wave spectrum, here consisting of forward- and backward-running waves. The runaway critical speed relative to the phase speeds of these waves plays an important role in this model.

Takahashi, H.; Bell, R.; Bernabei, S.; Chance, M.; Chu, T.K.; Gettelfinger, G.; Greenough, N.; Hatcher, R.; Ignat, D.; Jardin, S.; Kaita, R.; Kaye, S.; Kugel, H.; LeBlanc, B.; Manickam, J.; Okabayashi, M.; Ono, M.; Paul, S.; Perkins, F.; Sauthoff, N.; Sesnic, S.; Sun, Y.; Tighe, W.; Valeo, E.; von Goeler, S. [Princeton Univ., NJ (US). Plasma Physics Lab.; Batha, S.; Levinton, F. [Fusion Physics and Technology, Torrance, CA (US); Dunlap, J.; England, A.; Harris, J.; Hirshman, S.; Isler, R.; Post-Zwicker, A. [Oak Ridge National Lab., TN (US); Jones, S.; Kesner, J.; Luckhardt, S.; Paoletti, F. [Massachusetts Inst. of Tech., Cambridge, MA (US); Schmitz, L.; Tynan, G. [Univ. of California, Los Angeles, CA (US)

1993-07-01T23:59:59.000Z

399

The Ion Cyclotron, Lower Hybrid, and Alfven Wave Heating Methods  

SciTech Connect (OSTI)

This lecture covers the practical features and experimental results of the three heating methods. The emphasis is on ion cyclotron heating. First, we briefly come back to the main non-collisional heating mechanisms and to the particular features of the quasilinear coefficient in the ion cyclotron range of frequencies (ICRF). The specific case of the ion-ion hybrid resonance is treated, as well as the polarisation issue and minority heating scheme. The various ICRF scenarios are reviewed. The experimental applications of ion cyclotron resonance heating (ICRH) systems are outlined. Then, the lower hybrid and Alfven wave heating and current drive experimental results are covered more briefly. Where applicable, the prospects for ITER are commented.

Koch, R

2004-03-15T23:59:59.000Z

400

Lower-Energy Energy Storage System (LEESS) Component Evaluation  

SciTech Connect (OSTI)

Alternate hybrid electric vehicle (HEV) energy storage systems (ESS) such as lithium-ion capacitors (LICs) and electrochemical double-layer capacitor (EDLC) modules have the potential for improved life, superior cold temperature performance, and lower long-term cost projections relative to traditional battery storage systems. If such lower-energy ESS (LEESS) devices can also be shown to maintain high HEV fuel savings, future HEVs designed with these devices could have an increased value proposition relative to conventional vehicles. NREL's vehicle test platform is helping validate the in-vehicle performance capability of alternative LEESS devices and identify unforeseen issues. NREL created the Ford Fusion Hybrid test platform for in-vehicle evaluation of such alternative LEESS devices, bench testing of the initial LIC pack, integration and testing of the LIC pack in the test vehicle, and bench testing and installation of an EDLC module pack. EDLC pack testing will continue in FY15. The in-vehicle LIC testing results suggest technical viability of LEESS devices to support HEV operation. Several LIC configurations tested demonstrated equivalent fuel economy and acceleration performance as the production nickel-metal-hydride ESS configuration across all tests conducted. The lowest energy LIC scenario demonstrated equivalent performance over several tests, although slightly higher fuel consumption on the US06 cycle and slightly slower acceleration performance. More extensive vehicle-level calibration may be able to reduce or eliminate these performance differences. The overall results indicate that as long as critical attributes such as engine start under worst case conditions can be retained, considerable ESS downsizing may minimally impact HEV fuel savings.

Gonder, J.; Cosgrove, J.; Shi, Y.; Saxon, A.; Pesaran, A.

2014-10-01T23:59:59.000Z

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Bayesian Policy Gradient and Actor-Critic Algorithms Bayesian Policy Gradient and Actor-Critic Algorithms  

E-Print Network [OSTI]

Bayesian Policy Gradient and Actor-Critic Algorithms Bayesian Policy Gradient and Actor Yaakov Engel yakiengel@gmail.com Editor: Abstract Policy gradient methods are reinforcement learning algorithms that adapt a param- eterized policy by following a performance gradient estimate. Many

Paris-Sud XI, Université de

402

A comparison between anisotropic analytical and multigrid superposition dose calculation algorithms in radiotherapy treatment planning  

SciTech Connect (OSTI)

Monte Carlo (MC) simulation is currently the most accurate dose calculation algorithm in radiotherapy planning but requires relatively long processing time. Faster model-based algorithms such as the anisotropic analytical algorithm (AAA) by the Eclipse treatment planning system and multigrid superposition (MGS) by the XiO treatment planning system are 2 commonly used algorithms. This study compared AAA and MGS against MC, as the gold standard, on brain, nasopharynx, lung, and prostate cancer patients. Computed tomography of 6 patients of each cancer type was used. The same hypothetical treatment plan using the same machine and treatment prescription was computed for each case by each planning system using their respective dose calculation algorithm. The doses at reference points including (1) soft tissues only, (2) bones only, (3) air cavities only, (4) soft tissue-bone boundary (Soft/Bone), (5) soft tissue-air boundary (Soft/Air), and (6) bone-air boundary (Bone/Air), were measured and compared using the mean absolute percentage error (MAPE), which was a function of the percentage dose deviations from MC. Besides, the computation time of each treatment plan was recorded and compared. The MAPEs of MGS were significantly lower than AAA in all types of cancers (p<0.001). With regards to body density combinations, the MAPE of AAA ranged from 1.8% (soft tissue) to 4.9% (Bone/Air), whereas that of MGS from 1.6% (air cavities) to 2.9% (Soft/Bone). The MAPEs of MGS (2.6%2.1) were significantly lower than that of AAA (3.7%2.5) in all tissue density combinations (p<0.001). The mean computation time of AAA for all treatment plans was significantly lower than that of the MGS (p<0.001). Both AAA and MGS algorithms demonstrated dose deviations of less than 4.0% in most clinical cases and their performance was better in homogeneous tissues than at tissue boundaries. In general, MGS demonstrated relatively smaller dose deviations than AAA but required longer computation time.

Wu, Vincent W.C., E-mail: htvinwu@polyu.edu.hk [Department of Health Technology and Informatics, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong SAR (Hong Kong); Tse, Teddy K.H.; Ho, Cola L.M.; Yeung, Eric C.Y. [Department of Health Technology and Informatics, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong SAR (Hong Kong)

2013-07-01T23:59:59.000Z

403

Pruning Neural Networks with Distribution Estimation Algorithms  

SciTech Connect (OSTI)

This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algorithm (GA), the paper considers three distribution estimation algorithms (DEAs): a compact GA, an extended compact GA, and the Bayesian Optimization Algorithm. The objective is to determine if the DEAs present advantages over the simple GA in terms of accuracy or speed in this problem. The experiments used a feed forward neural network trained with standard back propagation and public-domain and artificial data sets. The pruned networks seemed to have better or equal accuracy than the original fully-connected networks. Only in a few cases, pruning resulted in less accurate networks. We found few differences in the accuracy of the networks pruned by the four EAs, but found important differences in the execution time. The results suggest that a simple GA with a small population might be the best algorithm for pruning networks on the data sets we tested.

Cantu-Paz, E

2003-01-15T23:59:59.000Z

404

A linearly constrained adaptive algorithm for seismic array processing  

E-Print Network [OSTI]

is described. The constrained IPS adaptive algorithm of Frost ( 1972) is derived from this linearly constrained LNS algorithm and compared with other algorithms. Theoretical analyses show that the constrained LMS adaptive algorithm is able to provide1 a... better than simple channel-averaging. hut in the case of the real seismic data, it takes advantage of the coher- ence feature of noise between channels to reduce the noise power. Further experiments indicate that the constrained LNS adaptive algorithm...

Byun, Bok Sub

2012-06-07T23:59:59.000Z

405

The Georgi Algorithms of Jet Clustering  

E-Print Network [OSTI]

We reveal the direct link between the jet clustering algorithms recently proposed by Howard Georgi and parton shower kinematics, providing sound support from the theoretical side. The kinematics of this class of elegant algorithms is explored systematically and the jet function is generalized to $J^{(n)}_\\beta$ with a jet function index $n$. Based on three basic requirements that the result of jet clustering is process-independent, for softer subjets the inclusion cone is larger, and that the cone size cannot be too large in order to avoid mixing different jets, we derive constraints on the jet function index $n$ and the jet function parameter $\\beta$ which are closely related to phase space boundaries. Finally, we demonstrate that the jet algorithm is boost invariant.

Shao-Feng Ge

2014-08-30T23:59:59.000Z

406

Pinning impulsive control algorithms for complex network  

SciTech Connect (OSTI)

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China)] [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); L, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)] [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China)] [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)] [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)

2014-03-15T23:59:59.000Z

407

MATLAB tensor classes for fast algorithm prototyping.  

SciTech Connect (OSTI)

Tensors (also known as mutidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB's multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor as matrix class supports the 'matricization' of a tensor, i.e., the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp tensor and tucker tensor. We descibe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.

Bader, Brett William; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)

2004-10-01T23:59:59.000Z

408

Lower 48 States Natural Gas Underground Storage Withdrawals (Million Cubic  

U.S. Energy Information Administration (EIA) Indexed Site

Gas Underground Storage Withdrawals (Million Cubic Feet) Gas Underground Storage Withdrawals (Million Cubic Feet) Lower 48 States Natural Gas Underground Storage Withdrawals (Million Cubic Feet) Year Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec 2011 849,115 666,248 313,952 100,096 58,314 80,472 115,649 125,989 55,418 51,527 183,799 473,674 2012 619,332 515,817 205,365 126,403 73,735 90,800 129,567 133,919 66,652 85,918 280,933 489,707 2013 791,849 646,483 480,032 134,680 48,945 68,117 98,141 101,568 66,273 - = No Data Reported; -- = Not Applicable; NA = Not Available; W = Withheld to avoid disclosure of individual company data. Release Date: 12/12/2013 Next Release Date: 1/7/2014 Referring Pages: Withdrawals of Natural Gas from Underground Storage - All Operators

409

Penetration and scattering of lower hybrid waves by density fluctuations  

SciTech Connect (OSTI)

Lower Hybrid [LH] ray propagation in toroidal plasma is controlled by a combination of the azimuthal spectrum launched from the antenna, the poloidal variation of the magnetic field, and the scattering of the waves by the density fluctuations. The width of the poloidal and radial RF wave spectrum increases rapidly as the rays penetrate into higher density and scatter from the turbulence. The electron temperature gradient [ETG] spectrum is particularly effective in scattering the LH waves due to its comparable wavelengths and parallel phase velocities. ETG turbulence is also driven by the radial gradient of the electron current density giving rise to an anomalous viscosity spreading the LH-driven plasma currents. The scattered LH spectrum is derived from a Fokker-Planck equation for the distribution of the ray trajectories with a diffusivity proportional to the fluctuations. The LH ray diffusivity is large giving transport in the poloidal and radial wavenumber spectrum in one - or a few passes - of the rays through the core plasma.

Horton, W. [Institute for Fusion Studies, University of Texas at Austin (United States); Goniche, M.; Peysson, Y.; Decker, J.; Ekedahl, A.; Litaudon, X. [CEA, IRFM, F-13108 St-Paul-Lez-Durance (France)

2014-02-12T23:59:59.000Z

410

Depositional environment of Lower Permian Stone Corral Formation  

SciTech Connect (OSTI)

The Lower Permian Stone Corral Formation is a 5-8 ft thick unit of dolomitic limestone and shale in a sequence of red beds that crops out in south-central Kansas. It forms a good stratigraphic marker bed in the subsurface, where it consists mainly of anhydrite (the Cimmaron anhydrite) up to 100 ft thick. At outcrop, the formation is weathered and consists of 2 interfingering facies - a crinoidal-echinoidal grainstone (in the north) and a laminated mudstone (in the south). Both the grainstone and mudstone exhibit diagenetic alteration. The grainstone is composed of well-rounded allochems of crinoid and echinoid fragments with scattered ooids, sponge spicules, peloids, and possible foraminifers and ostracods. Layers of sponge spicules alternate with peloid or ooid layers. The mudstone facies has a clotted texture and has laminations defined by the occurrence of fenestral fabric and peloids. Dolomite occurring in the Stone Corral Formation is of secondary origin. The grainstone is interpreted as being lagoonal in origin, whereas the mudstone facies is interpreted as supratidal. The grumous (clotted) texture may indicate phreatic diagenesis. The absence of anhydrite on outcrop, where it was presumably leached by surface waters leaving the less soluble dolomite, is additional evidence for a regional disconformity above the unit on the eastern side of a large, shallow, evaporitic basin.

Hylton, A.K.; Merriam, D.F.

1985-02-01T23:59:59.000Z

411

Lower 48 States Total Natural Gas Injections into Underground Storage  

U.S. Energy Information Administration (EIA) Indexed Site

Total Natural Gas Injections into Underground Storage (Million Cubic Feet) Total Natural Gas Injections into Underground Storage (Million Cubic Feet) Lower 48 States Total Natural Gas Injections into Underground Storage (Million Cubic Feet) Year Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec 2011 50,130 81,827 167,632 312,290 457,725 420,644 359,267 370,180 453,548 436,748 221,389 90,432 2012 74,854 56,243 240,351 263,896 357,965 323,026 263,910 299,798 357,109 327,767 155,554 104,953 2013 70,592 41,680 99,330 270,106 465,787 438,931 372,458 370,471 418,848 - = No Data Reported; -- = Not Applicable; NA = Not Available; W = Withheld to avoid disclosure of individual company data. Release Date: 12/12/2013 Next Release Date: 1/7/2014 Referring Pages: Injections of Natural Gas into Underground Storage - All Operators

412

Lower 48 States Nonassociated Natural Gas, Wet After Lease Separation,  

U.S. Energy Information Administration (EIA) Indexed Site

Nonassociated Natural Gas, Wet After Lease Separation, Proved Reserves (Billion Cubic Feet) Nonassociated Natural Gas, Wet After Lease Separation, Proved Reserves (Billion Cubic Feet) Lower 48 States Nonassociated Natural Gas, Wet After Lease Separation, Proved Reserves (Billion Cubic Feet) Decade Year-0 Year-1 Year-2 Year-3 Year-4 Year-5 Year-6 Year-7 Year-8 Year-9 1970's 143,852 1980's 139,421 143,515 142,984 143,469 141,226 138,464 139,070 135,256 141,211 139,798 1990's 141,941 140,584 138,883 136,953 138,213 139,369 141,136 140,382 139,015 142,098 2000's 154,113 159,612 163,863 166,512 171,547 183,197 189,329 213,851 224,873 249,406 2010's 280,880 305,010 - = No Data Reported; -- = Not Applicable; NA = Not Available; W = Withheld to avoid disclosure of individual company data. Release Date: 8/1/2013

413

Algorithms for the Markov entropy decomposition  

Science Journals Connector (OSTI)

The Markov entropy decomposition (MED) is a recently proposed, cluster-based simulation method for finite temperature quantum systems with arbitrary geometry. In this paper, we detail numerical algorithms for performing the required steps of the MED, principally solving a minimization problem with a preconditioned Newton's algorithm, as well as how to extract global susceptibilities and thermal responses. We demonstrate the power of the method with the spin-1/2 XXZ model on the 2D square lattice, including the extraction of critical points and details of each phase. Although the method shares some qualitative similarities with exact diagonalization, we show that the MED is both more accurate and significantly more flexible.

Andrew J. Ferris and David Poulin

2013-05-20T23:59:59.000Z

414

Auditory Cryptography Security Algorithm With Audio Shelters  

Science Journals Connector (OSTI)

In this paper, auditory cryptography security algorithm with audio shelters is proposed. The meaningful audio watermarking is pretreated to high-fidelity binary audio, and the binary audio is encrypted to n cryptographic audios by (k, n) threshold scheme. Less than k of the cryptographic audios give no information, only synchronized playing k or more than k of the audios the original can be heard directly. The n cryptographic audios are embedded in the corresponding n shelter audios which are pretreated by high-dimensional matrix transformation. Experiments show that the proposed algorithm has strong practicability, high security and robustness in enduring common attacks.

Huan Li; Zheng Qin; Xuanping Zhang; Xu Wang

2011-01-01T23:59:59.000Z

415

Efficient algorithm for many-electron angular momentum and spin diagonalization on atomic subshells  

E-Print Network [OSTI]

We devise an efficient algorithm for the symbolic calculation of irreducible angular momentum and spin (LS) eigenspaces within the n-fold antisymmetrized tensor product $\\wedge^n V_u$, where n is the number of electrons and u = s, p, d, ... denotes the atomic subshell. This is an essential step for dimension reduction in configuration-interaction (CI) methods applied to atomic many-electron quantum systems. The algorithm relies on the observation that each $L_z$ eigenstate with maximal eigenvalue is also an $L^2$ eigenstate (equivalently for $S_z$ and $S^2$), as well as the traversal of LS eigenstates using the lowering operators $L_-$ and $S_-$. Iterative application to the remaining states in $\\wedge^n V_u$ leads to an implicit simultaneous diagonalization. A detailed complexity analysis for fixed n and increasing subshell number u yields running time $O(u^{3n-2})$. A symbolic computer algebra implementation is available online.

Mendl, Christian B

2014-01-01T23:59:59.000Z

416

Depositional systems distribution of the lower Oligocene Vicksburg Formation, TX  

SciTech Connect (OSTI)

The lower Oligocene Vicksburg Formation of Texas is situated between the upper Eocene Jackson Group and the upper Oligocene Frio Formation. The paleogeography of the Texas Gulf coastal plain during the early Oligocene is typical of a progradational passive continental margin. However, a detailed regional depositional systems analysis of stratigraphic units, such as the Vicksburg, within a mature petroleum basin can yield results beneficial in both exploration and development. Stratigraphic plays are determined from the distribution of depositional systems, and reservoir characteristics are heavily influenced by conditions of sedimentation. Two primary depocenters (and exploration fairways) of the Texas Vicksburg were the Houston Embayment and the Rio Grande Embayment; they were separated by a deep-rooted structural nose in central Texas: the San Marcos arch. Within the embayments, deltaic depositional systems merged along strike with barrier/strand plain systems. Updip, fluvial systems traversed coastal plain units. On the seaward edge of the paralic systems, sand and mud deposits prograded across, and built up over, the relict Jackson shelf and shelf margin. Contemporaneous growth faulting controlled deltaic depositional patterns in the Rio Grande Embayment and, to a lesser degree, in the Houston Embayment. A barrier/strand plain system within an interdeltaic coastal bight extended across the northern flank of the San Marcos arch. Several minor wave-dominated delta complexes were interspersed within this regional setting. The southern flank of the arch was influenced by the fluvial systems of the Rio Grande Embayment that established another wave-dominated delta. Deposition of the Vicksburg progradational paralic sediments was initiated seaward of the Jackson coastal position. A brief, minor transgression interrupted the progradational pattern during middle Vicksburg deposition.

Coleman, J.; Galloway, W.E. (Univ. of Texas, Austin (USA))

1990-05-01T23:59:59.000Z

417

Deutsch-Jozsa algorithm for continuous variables  

E-Print Network [OSTI]

We present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous spectra we show that under ideal operation to infinite precision that there is an infinite reduction in number of query calls in this scheme.

Arun K. Pati; Samuel L. Braunstein

2002-07-18T23:59:59.000Z

418

Adiabatic Quantum Computation and Deutsch's Algorithm  

E-Print Network [OSTI]

We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.

Saurya Das; Randy Kobes; Gabor Kunstatter

2001-11-06T23:59:59.000Z

419

Hypergraph states in Grover's quantum search algorithm  

E-Print Network [OSTI]

We study the entanglement content of the states employed in the Grover algorithm after the first oracle call when a few searched items are concerned. We then construct a link between these initial states and hypergraphs, which provides an illustration of their entanglement properties.

M. Rossi; D. Bru; C. Macchiavello

2014-04-04T23:59:59.000Z

420

B NOTES ON LANGUAGES AND ALGORITHMS  

E-Print Network [OSTI]

B NOTES ON LANGUAGES AND ALGORITHMS B.1 DEFINING LANGUAGES WITH BACKUS­NAUR FORM (BNF) In this book-order logic (page 293), and a subset of English (page 899). A formal lan- guage is defined as a set of strings set of strings, so we need a concise way to charac- terize the set. We do that with a grammar

Russell, Stuart

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

CMPSCI 711: Really Advanced Algorithms Micah Adler  

E-Print Network [OSTI]

CMPSCI 711: Really Advanced Algorithms Micah Adler Problem Set 3 Out: April 1, 2003 Due: April 10 of this problem, as well as a rounding procedure to obtain a 2-approximation to this problem. 5. In the Set-Cover an O(log n)-approximation for the Set-Cover problem. 1-1 #12;

Adler, Micah

422

An algorithm for packing connectors J. Keijsper  

E-Print Network [OSTI]

(a set of edges covering all vertices). An S--T connector is a common spanning set of two graphic maAn algorithm for packing connectors J. Keijsper University of Amsterdam Department of MathematicsS; Tg of V , an S--T connector is a set of edges F ` E such that every component of the subgraph (V; F

Keijsper, Judith

423

An Online Algorithm for Maximizing Submodular Functions  

E-Print Network [OSTI]

SUBMODULAR COVER problem (which is a generalization of the MIN SUM SET COVER problem and the related PIPELINED SET COVER problem) and what we call BUDGETED MAXIMUM SUBMODULAR COVERAGE (which generalizesAn Online Algorithm for Maximizing Submodular Functions Matthew Streeter Daniel Golovin December 20

424

Parameterized Algorithms for Double Hypergraph Dualization with  

E-Print Network [OSTI]

as Sperner families.) The support of a hypergraph is the set of all vertices covered by edges, the remaining sets in graphs are also known as vertex covers. We consider the following two operators on hypergraphsParameterized Algorithms for Double Hypergraph Dualization with Rank Limitation and Maximum Minimal

Damaschke, Peter

425

An Online Algorithm for Maximizing Submodular Functions  

E-Print Network [OSTI]

SUM SUBMODULAR COVER problem (which is a generalization of the MIN SUM SET COVER problem and the related PIPELINED SET COVER problem) and what we call BUDGETED MAXIMUM SUBMODULAR COVERAGE (whichAn Online Algorithm for Maximizing Submodular Functions Matthew Streeter Daniel Golovin December 20

426

Advanced Algorithms Course. Lecture Notes. Part 12  

E-Print Network [OSTI]

Advanced Algorithms Course. Lecture Notes. Part 12 Set Cover on Few Elements Consider an instance of Set Cover where the ground set U has only a small number k of elements, say x1, . . . , xk. Still there may exist up to 2k different sets Si U to choose from. Set Cover is trivially an FPT problem

Damaschke, Peter

427

Advanced Algorithms Course. Lecture Notes. Part 13  

E-Print Network [OSTI]

Advanced Algorithms Course. Lecture Notes. Part 13 Set Cover on Few Elements Consider an instance of Set Cover where the ground set U has only a small number k of elements, say x1, . . . , xk. Still there may exist up to 2k different sets Si U to choose from. Set Cover is trivially an FPT problem

Damaschke, Peter

428

Optimal Security Liquidation Algorithms Sergiy Butenko  

E-Print Network [OSTI]

using a set of historical sample-paths of prices. 1. Introduction Consider the following decision making positions for several securities. Historical sequences of prices of these securities (after opening. The algorithms provide path-dependent strategies which sell some fractions of security depending upon price

Uryasev, Stanislav

429

Sampling-based robotic information gathering algorithms  

Science Journals Connector (OSTI)

We propose three sampling-based motion planning algorithms for generating informative mobile robot trajectories. The goal is to find a trajectory that maximizes an information quality metric (e.g. variance reduction, information gain, or mutual information) ... Keywords: Motion and path planning, field robotics, robotic information gathering

Geoffrey A. Hollinger, Gaurav S. Sukhatme

2014-08-01T23:59:59.000Z

430

INTERIOR-POINT ALGORITHMS, PENALTY METHODS AND ...  

E-Print Network [OSTI]

Oct 1, 2003 ... garded very favourably in the past, since nonlinear codes were not very robust, and .... on algorithmic performance (more on this later). The more general ..... the payoff to a firm if it chooses action i, and its rival chooses action ..... The problems siouxfls1,water-FL and water-net are rank-deficient even.

2003-10-01T23:59:59.000Z

431

Evolving Distributed Algorithms with Genetic Programming: Election  

E-Print Network [OSTI]

Evolving Distributed Algorithms with Genetic Programming: Election Thomas Weise Distributed Systems Group University of Kassel 34121 Kassel, Germany weise@vs.uni-kassel.de Michael Zapf Distributed Systems Group University of Kassel 34121 Kassel, Germany zapf@vs.uni-kassel.de ABSTRACT In this paper, we

Fernandez, Thomas

432

August 1988 Computers, algorithms and mathematics  

E-Print Network [OSTI]

August 1988 Computers, algorithms and mathematics L´aszl´o Lov´asz 0. Introduction The development that it has not left untouched closely related branches of science like mathematics and its education mathematics of higher value than classical, structure-oriented, theorem­proof mathemat- ics, or does it just

Lovász, László

433

Algorithmic design of self-folding polyhedra  

Science Journals Connector (OSTI)

...chosen according to an algorithm described below. Fifty samples of each net were self-folded in the experiments. We used Autodesk AutoCAD to draw nets and then printed them on transparent sheets to make photomasks. Sides of a panel measured 300 {mu...

Shivendra Pandey; Margaret Ewing; Andrew Kunas; Nghi Nguyen; David H. Gracias; Govind Menon

2011-01-01T23:59:59.000Z

434

Control algorithms for autonomous robot navigation  

SciTech Connect (OSTI)

This paper examines control algorithm requirements for autonomous robot navigation outside laboratory environments. Three aspects of navigation are considered: navigation control in explored terrain, environment interactions with robot sensors, and navigation control in unanticipated situations. Major navigation methods are presented and relevance of traditional human learning theory is discussed. A new navigation technique linking graph theory and incidental learning is introduced.

Jorgensen, C.C.

1985-09-20T23:59:59.000Z

435

High performance parallel algorithms for incompressible flows  

E-Print Network [OSTI]

innovative algorithms using solenoidal basis methods to solve the generalized Stokes problem for 3D MAC (Marker and Cell) and 2D unstructured P1-isoP1 finite element grids. It details a localized algebraic approach to construct solenoidal basis. An efficient...

Sambavaram, Sreekanth Reddy

2002-01-01T23:59:59.000Z

436

Revisiting Algorithms for Generating Surrogate Time Series  

Science Journals Connector (OSTI)

The method of surrogates is one of the key concepts of nonlinear data analysis. Here, we demonstrate that commonly used algorithms for generating surrogates often fail to generate truly linear time series. Rather, they create surrogate realizations with Fourier phase correlations leading to nondetections of nonlinearities. We argue that reliable surrogates can only be generated, if one tests separately for static and dynamic nonlinearities.

C. Rth, M. Gliozzi, I. E. Papadakis, and W. Brinkmann

2012-10-05T23:59:59.000Z

437

L. D. Davis, Handbook of Genetic Algorithms.  

E-Print Network [OSTI]

Review of L. D. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991, to fields such as molecular biology, immunology, economics, and physics. One result of this growth. There is less communication among the various groups than one might hope for. Lawrence Davis' book, Handbook

Mitchell, Melanie

438

Globally Optimal Algorithms for Stratified Autocalibration  

Science Journals Connector (OSTI)

We present practical algorithms for stratified autocalibration with theoretical guarantees of global optimality. Given a projective reconstruction, we first upgrade it to affine by estimating the position of the plane at infinity. The plane at infinity ... Keywords: Autocalibration, Convex relaxations, Global optimization, Multiple view geometry

Manmohan Chandraker; Sameer Agarwal; David Kriegman; Serge Belongie

2010-11-01T23:59:59.000Z

439

Fast Geometric Algorithms for Tomographic Nondestructive Evaluation  

E-Print Network [OSTI]

on a fundamental property of the (projection) Radon trans- form, is aimed at directly extracting geometric features International, Building 409-44 333 Ravenswood Avenue, Menlo Park, California 94025 U.S.A. Phone: (415) 859 measurements can all be interpreted in terms of tomographic projections. Hence, the algorithms described

Milanfar, Peyman

440

Optimization Algorithms in Machine Learning Stephen Wright  

E-Print Network [OSTI]

Optimization Algorithms in Machine Learning Stephen Wright University of Wisconsin-Madison NIPS Tutorial, 6 Dec 2010 Stephen Wright (UW-Madison) Optimization in Machine Learning NIPS Tutorial, 6 Dec 2010 in machine learning. Stephen Wright (UW-Madison) Optimization in Machine Learning NIPS Tutorial, 6 Dec 2010 2

Wright, Steve

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Randomized Parallel Algorithms in Optimization Stephen Wright  

E-Print Network [OSTI]

Randomized Parallel Algorithms in Optimization Stephen Wright University of Wisconsin-Madison July 2013 Wright (UW-Madison) Random Parallel Optimization July 2013 1 / 52 #12;Collaborators @ UW-Madison Victor Bittorf Ji Liu Ben Recht ( Berkeley) Chris R´e ( Stanford) Krishna Sridhar Wright (UW

442

Hyperspectral Imaging: Training Algorithms & Data Generation  

E-Print Network [OSTI]

Hyperspectral Imaging: Training Algorithms & Data Generation REU Students: Ping Fung and Carl +exp[-2(( + s))1/2 D / 3]} 1-rlSI +(rl - SI )exp[-2(( + s))1/2 D / 3] Data Generation To apply our possible parameters is impractical, so we generate approximate spectra using a physical model based

Mountziaris, T. J.

443

A pattern tracking algorithm for lossless data compression  

Science Journals Connector (OSTI)

Where digital data is costly or subject to federal law (space, seismic or medical imaging), importance of the data may lead to exclusive use of lossless encoding. We present a pattern-tracking algorithm for lossless encoding, complete with a file header. This algorithm is based upon the expectation that data contain patterns that re-occur with varying amplitudes. This algorithm is compared to standard lossless coding algorithms using 24 data sets from four signal applications. Compression ratios were 1.6 to 2.7. The pattern-tracking algorithm performed best on certain data sets, while competing algorithms performed best on other data sets.

Thomas J. Hebert; Shruti N. Karulkar

2011-01-01T23:59:59.000Z

444

Algorithms to Automate LCLS Undulator Tuning  

SciTech Connect (OSTI)

Automation of the LCLS undulator tuning offers many advantages to the project. Automation can make a substantial reduction in the amount of time the tuning takes. Undulator tuning is fairly complex and automation can make the final tuning less dependent on the skill of the operator. Also, algorithms are fixed and can be scrutinized and reviewed, as opposed to an individual doing the tuning by hand. This note presents algorithms implemented in a computer program written for LCLS undulator tuning. The LCLS undulators must meet the following specifications. The maximum trajectory walkoff must be less than 5 {micro}m over 10 m. The first field integral must be below 40 x 10{sup -6} Tm. The second field integral must be below 50 x 10{sup -6} Tm{sup 2}. The phase error between the electron motion and the radiation field must be less than 10 degrees in an undulator. The K parameter must have the value of 3.5000 {+-} 0.0005. The phase matching from the break regions into the undulator must be accurate to better than 10 degrees. A phase change of 113 x 2{pi} must take place over a distance of 3.656 m centered on the undulator. Achieving these requirements is the goal of the tuning process. Most of the tuning is done with Hall probe measurements. The field integrals are checked using long coil measurements. An analysis program written in Matlab takes the Hall probe measurements and computes the trajectories, phase errors, K value, etc. The analysis program and its calculation techniques were described in a previous note. In this note, a second Matlab program containing tuning algorithms is described. The algorithms to determine the required number and placement of the shims are discussed in detail. This note describes the operation of a computer program which was written to automate LCLS undulator tuning. The algorithms used to compute the shim sizes and locations are discussed.

Wolf, Zachary

2010-12-03T23:59:59.000Z

445

Promoter sequences and algorithmical methods for identifying them , Laurent Marsan  

E-Print Network [OSTI]

Promoter sequences and algorithmical methods for identifying them Anne Vanet a b , Laurent Marsan c available mathematical models algorithmical methods trying identify promoter sequences. The methods concern both types of organisms. survey therefore covers methods; however, emphasis placed prokaryotic promoter

Sagot, Marie-France

446

An Artificial Bee Colony Algorithm for the Set Covering Problem  

Science Journals Connector (OSTI)

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is ... solution quality with other metaheuristic approaches for t...

Rodrigo Cuesta; Broderick Crawford

2014-01-01T23:59:59.000Z

447

Two Algorithms for the Matroid Secretary Liri Finkelstein  

E-Print Network [OSTI]

Two Algorithms for the Matroid Secretary Problem Liri Finkelstein #12;Two Algorithms for the Matroid Secretary Problem Research Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Information Management Engineering Liri Finkelstein Submitted

448

A FAST ALGORITHM FOR PROVING TERMINATING HYPERGEOMETRIC IDENTITIES *  

E-Print Network [OSTI]

Gosper's algorithm for* * indefinite hypergeometric summation . A MAPLE program implementing recently by Gasper and Rahman[G-R1]. A MAPLE program implementing the algorithm is available from explicitly, in the form QA

Zeilberger, Doron

449

Approximation Algorithms for 2-Stage Stochastic Scheduling Problems  

Science Journals Connector (OSTI)

There has been a series of results deriving approximation algorithms for 2-stage discrete stochastic optimization problems, in which the probabilistic component of the input is given by means of "black box", from which the algorithm "learns" the distribution ...

David B. Shmoys; Mauro Sozio

2007-06-01T23:59:59.000Z

450

EM algorithm estimation of TCM scheme over multipath fading  

E-Print Network [OSTI]

The performance of Trellis Coded Modulation scheme via Expectation-Maximization algorithm utilizing a Kalman filter over multipath fading is presented. EM algorithm offers an easier computation than the classical ML estimation does. To get a better...

Gunawan, Wiedy

2012-06-07T23:59:59.000Z

451

Implementation and testing of a parallel layer peeling algorithm  

E-Print Network [OSTI]

implementation was considered because of the anticipated speedup in the solution of the problem under consideration. The algorithm was implemented on an NCUBE 2 machine, with a total of sixty-four processors. Two variations of the parallel algorithm were...

Gandapur, Tasneem Kausar

2012-06-07T23:59:59.000Z

452

The SFC editor a graphical tool for algorithm development  

Science Journals Connector (OSTI)

This paper describes The SFC Editor, a graphical algorithm development tool for both beginning and advanced programmers. Flowcharts have long been used by programmers as a format for designing and visualizing the logic of an algorithm. Since drawing ...

Tia Watts

2004-12-01T23:59:59.000Z

453

Protein Folding Prediction Using an Improved Genetic-Annealing Algorithm  

Science Journals Connector (OSTI)

Based on the off-lattice AB model consisting of hydrophobic and hydrophilic residues, a novel hybrid algorithm is presented for searching the ground-state conformation of the protein. This algorithm combines gene...

Xiaolong Zhang; Xiaoli Lin

2006-01-01T23:59:59.000Z

454

Optimum Algorithms for a Model of Direct Chaining  

E-Print Network [OSTI]

Direct chaining is a popular and efficient class of hashing algorithms. In this paper we study optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after ...

Vitter, Jeffrey Scott; Chen, Wen-Chin

1985-05-01T23:59:59.000Z

455

Optimization of advanced telecommunication algorithms from power and performance perspective  

E-Print Network [OSTI]

This thesis investigates optimization of advanced telecommunication algorithms from power and performance perspectives. The algorithms chosen are MIMO and LDPC. MIMO is implemented in custom ASIC for power optimization ...

Khan, Zahid

2011-11-22T23:59:59.000Z

456

On Quantum Algorithm for Binary Search and Its Computational Complexity  

E-Print Network [OSTI]

A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.

S. Iriyama; M. Ohya; I. V. Volovich

2013-06-21T23:59:59.000Z

457

Decomposition algorithms for multi-area power system analysis  

E-Print Network [OSTI]

. This dissertation investigates decomposition algorithms for multi-area power system transfer capability analysis and economic dispatch analysis. All of the proposed algorithms assume that areas do not share their network operating and economic information among...

Min, Liang

2007-09-17T23:59:59.000Z

458

Deutsch-Jozsa algorithm as a test of quantum computation  

E-Print Network [OSTI]

A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.

David Collins; K. W. Kim; W. C. Holton

1998-07-03T23:59:59.000Z

459

General heatbath algorithm for pure lattice gauge theory  

E-Print Network [OSTI]

A heatbath algorithm is proposed for pure SU(N) lattice gauge theory based on the Manton action of the plaquette element for general gauge group N. Comparison is made to the Metropolis thermalization algorithm using both the Wilson and Manton actions. The heatbath algorithm is found to outperform the Metropolis algorithm in both execution speed and decorrelation rate. Results, mostly in D=3, for N=2 through 5 at several values for the inverse coupling are presented.

Robert W. Johnson

2010-11-24T23:59:59.000Z

460

On Strategy Improvement Algorithms for Simple Stochastic Rahul Tripathia,  

E-Print Network [OSTI]

of Discrete Algorithms March 17, 2011 #12;VMAX is the set of vertices controlled by MAX, VMIN is the set

Tripathi, Rahul

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Integrated network design and scheduling problems : optimization algorithms and applications.  

SciTech Connect (OSTI)

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.; Carlson, Jeffrey J.

2014-01-01T23:59:59.000Z

462

Improved Approximation Algorithms for the Partial Vertex Cover Problem  

E-Print Network [OSTI]

Improved Approximation Algorithms for the Partial Vertex Cover Problem Eran Halperin 1? and Aravind words and phrases. Partial vertex cover, approximation algorithms, semide#12;nite programming edges are covered. Just as for the vertex cover problem, 2-approximation algorithms are known

Srinivasan, Aravind

463

A New Genetic Algorithm for Set Covering Problems  

E-Print Network [OSTI]

A New Genetic Algorithm for Set Covering Problems Annual Operational Research Conference 42, Swansea, UK, 2000. An indirect genetic algorithm for the non-unicost set covering problem is presented UK uxa@cs.nott.ac.uk #12;2 Background Aim: � Develop a Genetic Algorithm to solve Set Covering

Aickelin, Uwe

464

An Ecient Distributed Algorithm for Constructing Small Dominating Sets  

E-Print Network [OSTI]

set cover problem. We describe and analyze new randomized distributed algorithms for the dominating (resp., set) that covers the most number of uncovered nodes (resp., elements). The greedy algorithmAn E?cient Distributed Algorithm for Constructing Small Dominating Sets Lujun Jia #3; Rajmohan

Chan, Agnes Hui

465

Algorithm Independent Properties of RNA Secondary Structure Predictions  

E-Print Network [OSTI]

energies depend strongly on both algorithms and parameter sets. Statistical properties, such as mean to the choices of parameter sets and even algorithms. Some features of RNA secondary structures, like structureAlgorithm Independent Properties of RNA Secondary Structure Predictions By Manfred Tacker d , Peter

Stadler, Peter F.

466

An Improved Approximation Algorithm For Vertex Cover with Hard Capacities  

E-Print Network [OSTI]

of this problem is at least as hard as set cover; they have also developed a 3-approximation algorithm cover problem. Key Words and Phrases: Approximation algorithms, capacitated covering, set cover, vertexAn Improved Approximation Algorithm For Vertex Cover with Hard Capacities (Extended Abstract) Rajiv

Khuller, Samir

467

Disambiguation by Association: Two Algorithms and their Assessment  

E-Print Network [OSTI]

Disambiguation by Association: Two Algorithms and their Assessment Richard F.E. Sutcliffe Bronwyn E and subtle problem than is generally assumed. Secondly, the performance of a particular algorithm is heavily a number of interesting discoveries. We report on these below. 2 The Disambiguation Algorithms 2

Sutcliffe, Richard

468

Primal-Dual Combinatorial Algorithms May 8, 2009  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Primal Dual Algorithms for Fractional Packing and Covering 9 3.1 Feasibility Problem algorithm for fractional packing and covering, which greatly outperformed previous approaches on the a largePrimal-Dual Combinatorial Algorithms Qihui Zhu May 8, 2009 #12;ABSTRACT Linear program and its

Plotkin, Joshua B.

469

A Parallel Algorithm for Approximating the Minimum Cycle Cover  

E-Print Network [OSTI]

approximation algorithm for the problem of finding a minimum cycle cover. A cycle cover is a set of cycles cover [1, 7, 8]. The basis for our approximation algorithm is a routine to find a maximal set of edgeA Parallel Algorithm for Approximating the Minimum Cycle Cover Philip Klein \\Lambda Aiken

Yang, Junfeng

470

The Assessment of Two Algorithms for Disambiguation by Association  

E-Print Network [OSTI]

The Assessment of Two Algorithms for Disambiguation by Association Richard F.E. Sutcliffe 1 Bronwyn complex and subtle problem than is generally assumed. Secondly, the performance of a particular algorithm a number of interesting discoveries. We report on these below. 2 The Disambiguation Algorithms 2

Sutcliffe, Richard

471

ORIE 6335: THE DESIGN & ANALYSIS OF SCHEDULING ALGORITHMS Spring 2009  

E-Print Network [OSTI]

of algorithms will be very useful. Course Requirements: There will be four to five problem sets; the last one. This course will cover the basic techniques in the design of efficient algorithms for scheduling problemsORIE 6335: THE DESIGN & ANALYSIS OF SCHEDULING ALGORITHMS Spring 2009 Instructor: David Shmoys

Keinan, Alon

472

An Improved Approximation Algorithm For Vertex Cover with Hard Capacities  

E-Print Network [OSTI]

as hard as set cover; they have also developed a 3-approximation algorithm for the unweighted version. We Words and Phrases: Approximation algorithms, capacitated covering, set cover, vertex cover, linearAn Improved Approximation Algorithm For Vertex Cover with Hard Capacities (Extended Abstract) Rajiv

Srinivasan, Aravind

473

A STROKE BASED ALGORITHM FOR DYNAMIC SIGNATURE VERIFICATION  

E-Print Network [OSTI]

A STROKE BASED ALGORITHM FOR DYNAMIC SIGNATURE VERIFICATION Tong Qu, Abdulmotaleb El Saddik, Andy a novel stroke-based algorithm for DSV. An algorithm is developed to convert sample signatures of individual strokes. Individual strokes are identified by finding the points where there is a 1) decrease

Adler, Andy

474

MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS  

E-Print Network [OSTI]

MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS By William Shane Sanders;MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS By William Shane Sanders Approved Title of Study: MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS Pages in Study

Ray, David

475

A cutting surface algorithm for semi-infinite convex programming ...  

E-Print Network [OSTI]

Jun 16, 2013 ... this distribution optimization method and the cutting surface algorithm yields a ... We present a novel cutting surface algorithm for general ...... in their formulation are defined through bounds on the measure, bounds on the distance from a .... in Algorithm 2, in the remainder of this section we provide a short...

2013-06-16T23:59:59.000Z

476

A Polynomial Time Incremental Algorithm for Learning DFA  

E-Print Network [OSTI]

and membership queries. This algorithm is an extension of Angluin's ID pro­ cedure to an incremental framework that the modified hypoth­ esis is consistent with all examples observed thus far. The algorithm is guaranteed a knowledgeable teacher who responds to queries generated by the learner. Angluin's ID algorithm learns the target

Honavar, Vasant

477

Feedback algorithm for simulation of multi-segmented cracks  

SciTech Connect (OSTI)

In this paper, a method for obtaining a three dimensional crack model from a radiographic image is discussed. A genetic algorithm aiming at close simulation of crack's shape is presented. Results obtained with genetic algorithm are compared to those achieved in authors' previous work. The described algorithm has been tested on both simulated and real-life cracks.

Chady, T.; Napierala, L. [Department of Electrical and Computer Engineering, Faculty of Electrical Engineering, West Pomeranian University of Technology, al. Piastow 17, 70-310 Szczecin (Poland)

2011-06-23T23:59:59.000Z

478

Bayesian Gaussian Process Classification with the EM-EP Algorithm  

E-Print Network [OSTI]

Bayesian Gaussian Process Classification with the EM-EP Algorithm Hyun-Chul Kim and Zoubin of hyperparameters to determine various aspects of the function. Recently, the expectation propagation (EP) approach an approximate EM algorithm, the EM-EP algorithm, to learn both the latent function and the hyperparameters

Ghahramani, Zoubin

479

GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT  

E-Print Network [OSTI]

GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT Dana Vrajitoru Intelligent Systems algorithms to an autonomous pilot designed for motorized single-track vehicles (motorcycles). The pilot contribute efficiently to configuring the autonomous pilot. Key Words Genetic algorithms, multi

Vrajitoru, Dana

480

Supplement to "Power Algorithms for Inverting Laplace Transforms"  

E-Print Network [OSTI]

propose a new class of algorithms for numerically inverting Laplace transforms, called power algorithmsSupplement to "Power Algorithms for Inverting Laplace Transforms" Efstathios Avdis Department, with the parameter choice being tunable to the trans- form being inverted. The powers can be advantageously chosen

Whitt, Ward

Note: This page contains sample records for the topic "nems algorithms lowering" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

On Exact Algorithms for Permutation CSP  

E-Print Network [OSTI]

In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)CSP} for arity 2 or 3 can be solved by Held-Karp type algorithms in time $O^*(2^n)$, but no algorithm is known for arity at least 4 with running time significantly better than $2^{O(n\\log{n})}$. In this paper we resolve the gap by showing that {\\sc Arity 4 Permutati...

Kim, Eun Jung

2012-01-01T23:59:59.000Z

482

Simple Denoising Algorithm Using Wavelet Transform  

E-Print Network [OSTI]

We have presented a new and alternative algorithm for noise reduction using the methods of discrete wavelet transform and numerical differentiation of the data. In our method the threshold for reducing noise comes out automatically. The algorithm has been applied to three model flow systems - Lorenz, Autocatalator, and Rossler systems - all evolving chaotically. The method is seen to work well for a wide range of noise strengths, even as large as 10% of the signal level. We have also applied the method successfully to noisy time series data obtained from the measurement of pressure fluctuations in a fluidized bed, and also to that obtained by conductivity measurement in a liquid surfactant experiment. In all the illustrations we have been able to observe that there is a clean separation in the frequencies covered by the differentiated signal and white noise.

Manojit Roy; V. Ravi Kumar; B. D. Kulkarni; John Sanderson; Martin Rhodes; Michel vander Stappen

2000-02-18T23:59:59.000Z

483

A 2-level Approach for the Set Covering Problem: Parameter Tuning of Artificial Bee Colony Algorithm by Using Genetic Algorithm  

Science Journals Connector (OSTI)

We present a novel application of the Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is ... a low-level metaheuristic and its paremeters are set

Broderick Crawford; Ricardo Soto; Wenceslao Palma

2014-01-01T23:59:59.000Z

484

LowerLower--Cost Fuel CellsCost Fuel Cells Allen J. Bard, Arumugam Manthiram,Allen J. Bard, Arumugam Manthiram,  

E-Print Network [OSTI]

density 4 Hydrogen polymer electrolyteHydrogen polymer electrolyte membrane fuel cell (PEMFC)membrane fuel1 LowerLower--Cost Fuel CellsCost Fuel Cells Allen J. Bard, Arumugam Manthiram,Allen J. BardMaterials Science and Engineering Program 2 CONVENTIONAL POWER PLANT DIRECT FUEL CELL POWER PLANT Heat

Lightsey, Glenn

485

Robust Polynomials and Quantum Algorithms Harry Buhrman  

E-Print Network [OSTI]

Robust Polynomials and Quantum Algorithms Harry Buhrman Ilan Newman Hein R¨ohrig§ Ronald de Wolf are of interest in them- selves and have been the object of study for a while. Their minimal degree is H.B., H.R., and R.d.W. supported in part by the EU fifth framework projects QAIP, IST-1999-11234, and RESQ, IST-2001

de Wolf, Ronald

486

A universal algorithm for accelerator correction  

Science Journals Connector (OSTI)

A general formalism for compensating accelerator lattice functions is described. It is applied to the special cases of orbit smoothing tune adjustment beta function compensation local and global decoupling and vertical dispersion suppression. Some of these algorithms are implemented and have performed robustly in the thin element modeling code TEAPOT analyzing the SSC circular accelerators sometimes with a few beam?position monotors assumed to be malfunctioning.

Richard Talman

1992-01-01T23:59:59.000Z

487

Languages, Algorithms, Procedures, Calculi, and Metalogic  

E-Print Network [OSTI]

Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized mathematical theories, metalogic studies theories in logic, or logics. The discipline of logic has been developed with the aim to model and study human thinking and reasoning. A more realistic understanding relates logic only to reasoning. Reasoning is a mental and verbal activity. Any activity is based on actions and operations organized by procedures and algorithms. That is why procedures and algorithms are basic for the development of different logics, their study and application. In this work, we study structures used in logic with the aim to reflect goals of logic as a discipline. The main structure is a logical calculus, which pivotal for the contemporary logic. Logical calculus is considered here as a two-tier construction with a logical language on the first level and the calculus itself on the second level. A system of interdependencies that exists between properties of deductive calculi and utilized by these calculi algorithms are explicated and studied. Here only syntactic parts of logics, namely, deductive logical calculi and corresponding languages are considered. Semantic and pragmatic parts are studied elsewhere.

Mark Burgin

2007-01-04T23:59:59.000Z

488

DOE-Sponsored IGCC Project Could Lead to Lower-Cost Carbon Capture...  

Broader source: Energy.gov (indexed) [DOE]

IGCC Project Could Lead to Lower-Cost Carbon Capture Technologies DOE-Sponsored IGCC Project Could Lead to Lower-Cost Carbon Capture Technologies May 9, 2012 - 1:00pm Addthis...

489

Vegetation and sediment characteristics of created and natural Spartina alterniflora marshes in Lower Galveston Bay, Texas  

E-Print Network [OSTI]

and sediment parameters were compared on the basis of marsh type, age, habitat zone and microhabitat type. Created marshes were characterized by consistently taller stems and greater live plant biomass, but lower densities of live and dead stems and lower...

Albertson, Andrea Kai

2012-06-07T23:59:59.000Z

490

US-ABC Collaborates to Lower Cost of Electric Drive Batteries...  

Office of Environmental Management (EM)

US-ABC Collaborates to Lower Cost of Electric Drive Batteries US-ABC Collaborates to Lower Cost of Electric Drive Batteries April 16, 2013 - 12:00am Addthis The U.S. Advanced...

491

"Mug Handles" Help Get a Grip on Lower-Cost, Controllable Fusion...  

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

"Mug Handles" Help Get a Grip on Lower-Cost, Controllable Fusion Energy American Fusion News Category: U.S. Universities Link: "Mug Handles" Help Get a Grip on Lower-Cost,...

492

Social economic factors and malaria transmission in Lower Moshi, Northern Tanzania  

Science Journals Connector (OSTI)

This study reports the impact of distance to health centres and social economic factors on health-seeking behaviour of the lower Moshi residents. Image: Rice field in lower Moshi on the footslopes of Mount Kilimanjaro.

Asanterabi Lowassa; Humphrey D Mazigo; Aneth M Mahande; Beda J Mwangonde; Shandala Msangi; Michael J Mahande; Epiphania E Kimaro; Eliapenda Elisante; Eliningaya J Kweka

2012-06-28T23:59:59.000Z

493

JOURNAL OF GEOPHYSICAL RESEARCH, VOL. , NO. , PAGES 19, Vertical diffusivity in the lower stratosphere from  

E-Print Network [OSTI]

high resolution, lower stratospheric balloon data give values of D, valid for a lifetime of few hours

Legras, Bernard

494

Content of the lecture GDRI AlgoDec Algorithmic Decision Theory Decision aiding Bibliography Algorithmic Decision Theory  

E-Print Network [OSTI]

Content of the lecture GDRI AlgoDec Algorithmic Decision Theory Decision aiding Bibliography Algorithmic Decision Theory Raymond Bisdorff Computer Science and Communications RU Faculty of Sciences'2012, Kolkata December 2012 1 / 40 Content of the lecture GDRI AlgoDec Algorithmic Decision Theory

Bisdorff, Raymond

495

A Unified Differential Evolution Algorithm for Global Optimization  

SciTech Connect (OSTI)

Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

Qiang, Ji; Mitchell, Chad

2014-06-24T23:59:59.000Z

496

Adaptive optimal control: an algorithm for direct digital control  

SciTech Connect (OSTI)

An algorithm for applying advanced control concepts in heating, ventilating, and air conditioning (HVAC) systems has been developed at the Los Alamos Scientific Laboratory (LASL). The algorithm uses optimal control and is adaptive in nature. Simulations for a solar heated and cooled building indicate that use of this algorithm can accomplish a substantial savings in auxiliary energy consumption. In this paper, the algorithm is described and its application is illustrated with a simple example. Simulation results for a more complex system are also presented. The hardware, including the digital computer, needed to implement this algorithm is briefly discussed.

Farris, D.R.; McDonald, T.E.

1980-01-01T23:59:59.000Z

497

A supernodal Cholesky factorization algorithms for shared-memory multiprocessors  

SciTech Connect (OSTI)

This paper presents a parallel sparse Cholesky factorization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm is a straightforward parallelization of the left-looking supernodal sparse Cholesky factorization algorithm. Like its sequential predecessor, it improves performance by reducing indirect addressing and memory traffic. Experimental results on a Cray Y-MP demonstrate the effectiveness of the new algorithm. On eight processors of a Cray Y-MP, the new routine performs the factorization at rates exceeding one Gflop for several test problems from the Harwell-Boeing sparse matrix collection.

Ng, Esmond; Peyton, B.W. (Oak Ridge National Lab., TN (United States))

1993-07-01T23:59:59.000Z

498

An Adaptive Unified Differential Evolution Algorithm for Global Optimization  

SciTech Connect (OSTI)

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

Qiang, Ji; Mitchell, Chad

2014-11-03T23:59:59.000Z

499

Experimental realisation of Shor's quantum factoring algorithm using qubit recycling  

E-Print Network [OSTI]

Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the international effort to realise a quantum computer. However, due to the substantial resource requirement, to date, there have been only four small-scale demonstrations. Here we address this resource demand and demonstrate a scalable version of Shor's algorithm in which the n qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol. Encoding the work register in higher-dimensional states, we implement a two-photon compiled algorithm to factor N=21. The algorithmic output is distinguishable from noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor's algorithm by harnessing scalable resource reductions applicable to all physical architectures.

Enrique Martin-Lopez; Anthony Laing; Thomas Lawson; Roberto Alvarez; Xiao-Qi Zhou; Jeremy L. O'Brien

2011-11-17T23:59:59.000Z

500

ADORE-GA: Genetic algorithm variant of the ADORE algorithm for ROP detector layout optimization in CANDU reactors  

Science Journals Connector (OSTI)

The regional overpower protection (ROP) systems protect CANDU reactors against overpower in the fuel that could reduce the safety margin-to-dryout. The overpower could originate from a localized power peaking within the core or a general increase in the global core power level. The design of the detector layout for ROP systems is a challenging discrete optimization problem. In recent years, two algorithms have been developed to find a quasi optimal solution to this detector layout optimization problem. Both of these algorithms utilize the simulated annealing (SA) algorithm as their optimization engine. In the present paper, an alternative optimization algorithm, namely the genetic algorithm (GA), has been implemented as the optimization engine. The implementation is done within the ADORE algorithm. Results from evaluating the effects of using various mutation rates and crossover parameters are presented in this paper. It has been demonstrated that the algorithm is sufficiently robust in producing similar quality solutions.

Doddy Kastanya

2012-01-01T23:59:59.000Z