Sample records for nems algorithms lowering

  1. Net Energy Metering (NEM)

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

    the Arizona Public Service Co. (APS) request for a charge on future rooftop solar panel installations connected to the grid under the state's net energy metering (NEM)...

  2. NEMS industrial module documentation report

    SciTech Connect (OSTI)

    Not Available

    1994-01-01T23:59:59.000Z

    The NEMS Industrial Demand Model is a dynamic accounting model, bringing together the disparate industries and uses of energy in those industries, and putting them together in an understandable and cohesive framework. The Industrial Model generates mid-term (up to the year 2010) forecasts of industrial sector energy demand as a component of the NEMS integrated forecasting system. From the NEMS system, the Industrial Model receives fuel prices, employment data, and the value of output of industrial activity. Based on the values of these variables, the Industrial Model passes back to the NEMS system estimates of consumption by fuel types.

  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. Transdichotomous algorithms without multiplication some upper and lower bounds

    E-Print Network [OSTI]

    Brodnik, Andrej "Andy"

    Trans­dichotomous algorithms without multiplication ­ some upper and lower bounds Andrej Brodnik 1 that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication; 1g w of w­bit bit strings (or numbers between 0 and 2 w \\Gamma 1). An increasingly popular

  5. NEMS integrating module documentation report

    SciTech Connect (OSTI)

    Not Available

    1993-12-14T23:59:59.000Z

    The National Energy Modeling System (NEMS) is a computer modeling system that produces a general equilibrium solution for energy supply and demand in the US energy markets. The model achieves a supply and demand balance in the end-use demand regions, defined as the nine Census Divisions, by solving for the prices of each energy type such that the quantities producers are willing to supply equal the quantities consumers wish to consume. The system reflects market economics, industry structure, and energy policies and regulations that influence market behavior. The NEMS Integrating Module is the central integrating component of a complex modeling system. As such, a thorough understanding of its role in the modeling process can only be achieved by placing it in the proper context with respect to the other modules. To that end, this document provides an overview of the complete NEMS model, and includes brief descriptions of the modules with which the Integrating Module interacts. The emphasis and focus, however, is on the structure and function of the Integrating Module of NEMS.

  6. Investigation of residential central air conditioning load shapes in NEMS

    SciTech Connect (OSTI)

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

    2002-05-01T23:59:59.000Z

    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.

  7. How to obtain the National Energy Modeling System (NEMS)

    Reports and Publications (EIA)

    2013-01-01T23:59:59.000Z

    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.

  8. Learning and cost reductions for generating technologies in the national energy modeling system (NEMS)

    SciTech Connect (OSTI)

    Gumerman, Etan; Marnay, Chris

    2004-01-16T23:59:59.000Z

    This report describes how Learning-by-Doing (LBD) is implemented endogenously in the National Energy Modeling System (NEMS) for generating plants. LBD is experiential learning that correlates to a generating technology's capacity growth. The annual amount of Learning-by-Doing affects the annual overnight cost reduction. Currently, there is no straightforward way to integrate and make sense of all the diffuse information related to the endogenous learning calculation in NEMS. This paper organizes the relevant information from the NEMS documentation, source code, input files, and output files, in order to make the model's logic more accessible. The end results are shown in three ways: in a simple spreadsheet containing all the parameters related to endogenous learning; by an algorithm that traces how the parameters lead to cost reductions; and by examples showing how AEO 2004 forecasts the reduction of overnight costs for generating technologies over time.

  9. NEMS Buildings Sector Working Group Meeting

    Gasoline and Diesel Fuel Update (EIA)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for On-Highway4,1,50022,3,,,,6,1,9,1,50022,3,,,,6,1,Decade1 Source: Office of FossilFoot) Year JanCubicXIV.Mr.NEMS Buildings

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

  11. U.S. Regional Demand Forecasts Using NEMS and GIS

    SciTech Connect (OSTI)

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

    2005-07-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

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

    1996-01-01T23:59:59.000Z

    The National Energy Modeling System (NEMS) is a comprehensive, computer-based, energy-economy modeling system developed and maintained by the Department of Energy's Energy Information Administration (EIA). NEMS forecasts the national production...

  13. National Energy Modeling System (NEMS) | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual SiteofEvaluatingGroup |JilinLuOpen Energy Information National AllianceDayNEMS) Jump to:

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

    Reports and Publications (EIA)

    2003-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Nathanael, Rhesa

    2012-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

    2001-01-01T23:59:59.000Z

    Documentation Report: Wind Energy Submodule (WES). DOE/EIA-The Economic Value of Wind Energy at High Power SystemOF THE TREATMENT OF WIND ENERGY IN THE AEO99 VERSION OF NEMS

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

    Baker, Chris I.

    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

  18. Investigation of the effects of soluble boron tracking on coupled CTF / NEM, LWR simulations

    SciTech Connect (OSTI)

    Biery, M.; Avramova, M.; Ivanov, K. [Pennsylvania State University, Department of Mechanical and Nuclear Engineering, 331 Reber Building, University Park, PA 16802 (United States)

    2013-07-01T23:59:59.000Z

    The primary objective of this study is to evaluate the effects of introducing a boron tracking capability to the COBRA-TF / NEM code coupling. The Pennsylvania State University (PSU) versions of COBRA-TF - CTF, and Nodal Expansion Method (NEM) codes are utilized. Previous implementations of the CTF / NEM coupled code had no capability to model soluble boron feedback effects due to boron transport. This study builds upon the validation and qualification efforts of the boron tracking model implementation in CTF by modeling the boron feedback calculated by the CTF boron tracking model in NEM. The core model chosen for this study is the Purdue MOX/UO{sub 2} core model used in the 2007 OECD/NRC code benchmark study. Following the implementation of an explicit online coupling scheme and accompanying k-search routine, the newly coupled CTF / NEM code version with boron tracking is compared to prior results of the non-boron tracking CTF / NEM code version at steady-state hot full power and hot zero power conditions. It was found that the boron tracking model exhibited little influence on the hot zero power result as expected due to a smaller heat flux, which does not significantly change the moderator density and boron concentration as the moderator travels up the axial core length. Meanwhile the boron tracking model had a much greater impact on the hot full power results, predicting the critical inlet boron concentration to be 9.9 ppm below the non-boron tracking result due to greater and more rapid changes in boron concentration corresponding to the reduction in moderator density from being more rapidly heated. (authors)

  19. Overview of NEMS-H2, Version 1.0 Frances Wood

    E-Print Network [OSTI]

    ConsumptionForm/Place Transformations Electricity Generation and Transmission Hydrogen Oil and Gas ProductionOverview of NEMS-H2, Version 1.0 Frances Wood OnLocation, Inc., Energy Systems Consulting (fwood markets Focus is on economic, not engineering, aspects of hydrogen production, delivery, and consumption

  20. H Loop shaping control for PLL-based mechanical resonance tracking in NEMS resonant mass sensors

    E-Print Network [OSTI]

    Boyer, Edmond

    problem that rejects the disturbance described by the resonance frequency shift, attenuates the phase the measurement scheme to a disturbance rejection control issue which considers the resonance frequency variation--A simple dynamic detection of the resonance frequency shift in NEMS resonant mass sensors is described

  1. A SENSITIVITY ANALYSIS OF THE TREATMENT OF WIND ENERGY IN THE AEO99 VERSION OF NEMS

    E-Print Network [OSTI]

    LBNL-44070 TP-28529 A SENSITIVITY ANALYSIS OF THE TREATMENT OF WIND ENERGY IN THE AEO99 VERSION Analysis Department Environmental Energy Technologies Division Ernest Orlando Lawrence Berkeley National OF NEMS Julie Osborn, Frances Wood, Cooper Richey, Sandy Sanders, Walter Short, and Jonathan Koomey Energy

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

    E-Print Network [OSTI]

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

    Comparisons are made of energy forecasts using results from the Industrial module of the National Energy Modeling System (NEMS) and an industrial economic-engineering model called the Industrial Technology and Energy Modeling System (ITEMS), a model...

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

    SciTech Connect (OSTI)

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

    2009-12-03T23:59:59.000Z

    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.

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

    SciTech Connect (OSTI)

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

    2001-01-01T23:59:59.000Z

    Each year, the U.S. Department of Energy's Energy Information Administration (EIA) publishes a forecast of the domestic energy economy in the Annual Energy Outlook (AEO). During the forecast period of the AEO (currently through 2020), renewable energy technologies have typically not achieved significant growth. The contribution of renewable technologies as electric generators becomes more important, however, in scenarios analyzing greenhouse gas emissions reductions or significant technological advancements. We examined the economic assumptions about wind power used for producing forecasts with the National Energy Modeling System (NEMS) to determine their influence on the projected capacity expansion of this technology. This analysis should help illustrate to policymakers what types of issues may affect wind development, and improve the general understanding of the NEMS model itself. Figure 1 illustrates the model structure and factors relevant to wind deployment. We found that NEMS uses various cost multipliers and constraints to represent potential physical and economic limitations to growth in wind capacity, such as resource depletion, costs associated with rapid manufacturing expansion, and grid stability with high levels of capacity from intermittent resources. The model's flexibility allows the user to make alternative assumptions about the magnitude of these factors. While these assumptions have little effect on the Reference Case forecast for the 1999 edition of the AEO, they can make a dramatic difference when wind is more attractive, such as under a carbon permit trading system. With $100/ton carbon permits, the wind capacity projection for 2020 ranges from 15 GW in the unaltered model (AEO99 Reference Case) to 168 GW in the extreme case when all the multipliers and constraints examined in this study are removed. Furthermore, if modifications are made to the model allowing inter-regional transmission of electricity, wind capacity is forecast to reach 214 GW when all limitations are removed. The figures in the upper end of these ranges are not intended to be viewed as reasonable projections, but their magnitude illustrates the importance of the parameters governing the growth of wind capacity and resource availability in forecasts using NEMS. In addition, many uncertainties exist regarding these assumptions that potentially affect the growth of wind power. We suggest several areas in which to focus future research in order to better model the potential development of this resource. Because many of the assumptions related to wind in the model are also used for other renewable technologies, these suggestions could be applied to other renewable resources as well.

  5. Lower Bounds for the Quadratic Minimum Spanning Tree Problem ...

    E-Print Network [OSTI]

    2014-09-23T23:59:59.000Z

    URL http://www.sciencedirect.com/science/article/pii/S0166218X14002467. [6] D. Pereira, M. Gendreau, A. Cunha, Lower bounds and exact algorithms for the...

  6. Obtaining Lower Bounds from the Progressive Hedging Algorithm ...

    E-Print Network [OSTI]

    2014-01-21T23:59:59.000Z

    Oct 11, 2013 ... Energy Network Integration (GENI) program, and by the Department of ... fied into two or more stages according to which parameter values ..... Simultaneous consideration of multiple scenarios ..... tion from unpredictable and variable sources such as wind and .... We converted the SIPLIB instances into the.

  7. Lower Bounds and Exact Algorithms for the Quadratic Minimum ...

    E-Print Network [OSTI]

    2013-12-16T23:59:59.000Z

    Dec 16, 2013 ... 50. 1225. OP2. 13198. -. -. 13231. 5608. 12940.4. 189. 71. 8244. -. -. -. -. -. -. 50. 1225. OP2. 15137. -. -. 15218. 4768. 14708.5. 193. 123. 11761.

  8. Lower Hybrid Experiments

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville PowerCherries 82981-1cnHigh SchoolIn12electron 9November 6, 2014Innovation Portal Lower

  9. Algorithmic issues in queueing systems and combinatorial counting problems

    E-Print Network [OSTI]

    Katz-Rogozhnikov, Dmitriy A

    2008-01-01T23:59:59.000Z

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

  10. A hybrid of the genetic algorithm and concurrent simplex

    E-Print Network [OSTI]

    Randolph, David Ethan

    1995-01-01T23:59:59.000Z

    by drawing the genetic algorithm's attention to local optima too quickly, leading to premature con- vergence [7]. Thus, while local optimization might improve the speed of the analysis, the genetic algorithm might pay dearly with a much lower quality linal...

  11. Tree Elaboration Strategies Branch and Bound Algorithms

    E-Print Network [OSTI]

    , Elon College Terri Anne Johnson, Elon College Monique Guignard-Spielberg, The University of a sharp lower bound technique in these algorithms is one of the major difficulties. Recently, Hahn

  12. The Simulation of Humans and Lower Animals Demetri Terzopoulos

    E-Print Network [OSTI]

    Terzopoulos, Demetri

    work on the motor control of anthropomorphically articulated dynamic models, as well as the biomechanical modeling of lower animals such as fish, including motor control algorithms that enable and Simulation, Human Simulation, Musculoskeletal Modeling, Neuro- muscular Control, Motor Control Learning 1

  13. Lower Cost Carbon Fiber Precursors

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

    production and conversion parameters must be optimized. Lower cost fiber enable CF composite applications. Approach: 1. Complete previous effort by scaling to the CF production...

  14. LOWER COLUMBIA SALMON AND STEELHEAD

    E-Print Network [OSTI]

    Appendices Prepared By: Lower Columbia Fish Recovery Board Prepared For Northwest Power And Conservation for Recovery and Subbasin Planning prepared under direction of the Washington Lower Columbia River Fish prepared by the Fish Recovery Board. The Technical Foundation is an encyclopedia of information relating

  15. Lower Tuscaloosa of southern Mississippi

    SciTech Connect (OSTI)

    Devery, D.M.

    1980-12-01T23:59:59.000Z

    The Lower Tuscaloosa Formation of the upper Cretaceous currently is producing primarily oil from more than 50 fields in the interior salt basin of Mississippi. These fields are located within an area extending from east Louisiana into SW and S.-central Mississippi (Jefferson, Adams, Franklin, Lincoln, Amite, Pike, Walthall, Lamar, Forrest, and Pearl River Counties). Stratigraphically, the Lower Tuscaloosa unconformably overlies lower Cretaceous sediments of the Dantzler Formation and underlies lower Cretaceous shales of the Middle Tuscaloosa. The formation consists of a transgressive sequence that grades upward from alluvial plain through delta to marine deposits. Prospecting for oil and gas as well as developing new fields in the Lower Tuscaloosa can be difficult. There is generally a lack of strong structural closure; accumulation of oil and gas is controlled largely by stratigraphy, with lenticular sands pinching out into shales.

  16. A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization

    E-Print Network [OSTI]

    Terri Anne Johnson, Clemson University Monique Guignard-Spielberg, The University of Pennsylvania-and-bound are the most successful, but the lack of sharp lower bounds in these algorithms has been one of the major

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

  18. Lower paleozoic of Baltic Area

    SciTech Connect (OSTI)

    Haselton, T.M.; Surlyk, F.

    1988-01-01T23:59:59.000Z

    The Baltic Sea offers a new and exciting petroleum play in northwestern Europe. The Kaliningrad province in the Soviet Union, which borders the Baltic Sea to the east, contains an estimated 3.5 billion bbl of recoverable oil from lower Paleozoic sandstones. To the south, in Poland, oil and gas fields are present along a trend that projects offshore into the Baltic. Two recent Petrobaltic wells in the southern Baltic have tested hydrocarbons from lower Paleozoic sandstone. Minor production comes from Ordovician reefs on the Swedish island of Gotland in the western Baltic. The Baltic synclise, which began subsiding in the late Precambrian, is a depression in the East European platform. Strate dip gently to the south where the Baltic Synclise terminates against a structurally complex border zone. Depth to the metamorphosed Precambrian basement is up to 4,000 m. Overlying basement is 200-300 m of upper Precambrian arkosic sandstone. The Lower Cambrian consists of shallow marine quartzites. During Middle and Late Camnbrian, restricted circulation resulted in anoxic conditions and the deposition of Alum shale. The Lower Ordovician consists of quartzites and shale. The Upper Ordovician includes sandstones and algal reefs. The Silurian contains marginal carbonates and shales. For the last 25 years, exploration in northwest Europe has concentrated on well-known Permian sandstone, Jurassic sandstone, and Cretaceous chalk plays. Extrapolation of trends known and exploited in eastern Europe could open an entirely new oil province in the lower Paleozoic in the Baltic.

  19. Catalyst for producing lower alcohols

    DOE Patents [OSTI]

    Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)

    1987-01-01T23:59:59.000Z

    A process and system for the production of the lower alcohols such as methanol, ethanol and propanol involves the reaction of carbon monoxide and water in the presence of a lead salt and an alkali metal formate catalyst combination. The lead salt is present as solid particles such as lead titanate, lead molybdate, lead vanadate, lead zirconate, lead tantalate and lead silicates coated or in slurry within molten alkali metal formate. The reactants, carbon monoxide and steam are provided in gas form at relatively low pressures below 100 atmospheres and at temperatures of 200-400.degree. C. The resulted lower alcohols can be separated into boiling point fractions and recovered from the excess reactants by distillation.

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

    E-Print Network [OSTI]

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

  1. Lower Sioux Wind Feasibility & Development

    SciTech Connect (OSTI)

    Minkel, Darin

    2012-04-01T23:59:59.000Z

    This report describes the process and findings of a Wind Energy Feasibility Study (Study) conducted by the Lower Sioux Indian Community (Community). The Community is evaluating the development of a wind energy project located on tribal land. The project scope was to analyze the critical issues in determining advantages and disadvantages of wind development within the Community. This analysis addresses both of the Community's wind energy development objectives: the single turbine project and the Commerical-scale multiple turbine project. The main tasks of the feasibility study are: land use and contraint analysis; wind resource evaluation; utility interconnection analysis; and project structure and economics.

  2. Central Ferry-Lower Monumental

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625govInstrumentstdmadapInactiveVisiting the TWPSuccessAlamos Laboratory NastasiPASTCentral AirCentral Ferry Lower

  3. Lower East Fork Poplar Creek

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33Frequently Asked Questions forCheney suggesting a billVehicles | DepartmentStrategicfrom Lower15

  4. Converting online algorithms to local computation algorithms

    E-Print Network [OSTI]

    Mansour, Yishay; Vardi, Shai; Xie, Ning

    2012-01-01T23:59:59.000Z

    We propose a general method for converting online algorithms to local computation algorithms by selecting a random permutation of the input, and simulating running the online algorithm. We bound the number of steps of the algorithm using a query tree, which models the dependencies between queries. We improve previous analyses of query trees on graphs of bounded degree, and extend the analysis to the cases where the degrees are distributed binomially, and to a special case of bipartite graphs. Using this method, we give a local computation algorithm for maximal matching in graphs of bounded degree, which runs in time and space O(log^3 n). We also show how to convert a large family of load balancing algorithms (related to balls and bins problems) to local computation algorithms. This gives several local load balancing algorithms which achieve the same approximation ratios as the online algorithms, but run in O(log n) time and space. Finally, we modify existing local computation algorithms for hypergraph 2-color...

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

    E-Print Network [OSTI]

    California at Irvine, University of

    How Efficient Can We Be?: Bounds on Algorithm Energy Consumption Andrew Gearhart #12;Relation design use feedback to "cotune" compute kernel energy efficiency #12;Previous Work: Communication Lower-optimal" algorithms #12;Communication is energy inefficient! On-chip/Off-chip gap isn't going to improve much Data

  6. NEMS Freight Transportation Module Improvement Study

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

    basic shapes 33. Articles of base metal 41. Waste and scrap 3. Processed food 5. Meat, fish, seafood, and their preparations 6. Milled grain products and preparations, and bakery...

  7. Reconstruction algorithms for MRI

    E-Print Network [OSTI]

    Bilgic?, Berkin

    2013-01-01T23:59:59.000Z

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

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

  9. Semiclassical Shor algorithm

    SciTech Connect (OSTI)

    Giorda, Paolo [Institute for Scientific Interchange, Villa Gualino Viale Settimio Severo 65, 10133 Turin (Italy); Iorio, Alfredo [Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307 (United States); INFN, Rome (Italy); Sen, Samik [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); Sen, Siddhartha [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); IACS, Jadavpur, Calcutta 700032 (India)

    2004-09-01T23:59:59.000Z

    We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-(1/2) SU(2) generalized coherent states. Surprisingly, we find evidence that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.

  10. Winter Energy Savings from Lower Thermostat Settings

    Reports and Publications (EIA)

    2000-01-01T23:59:59.000Z

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

  11. Algorithms for Symmetric Linear and Integer Programs

    E-Print Network [OSTI]

    Bdi, Richard; Joswig, Michael

    2010-01-01T23:59:59.000Z

    This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.

  12. Sandbar Dynamics of the Lower Platte

    E-Print Network [OSTI]

    Nebraska-Lincoln, University of

    Sandbar Dynamics of the Lower Platte River Pilot Study 2011 methods and initial results In cooperation with Lower Platte South Natural Resources District By Jason S. Alexander and Ron Zelt Photo credits: Nebraska Tern and Plover Conservation Partnership #12;Why does the Platte River provide excellent

  13. Muon ID - taking care of lower momenta muons

    SciTech Connect (OSTI)

    Milstene, C.; Fisk, G.; Para, A.; /Fermilab

    2005-12-01T23:59:59.000Z

    In the Muon package under study, the tracks are extrapolated using an algorithm which accounts for the magnetic field and the ionization (dE/dx). We improved the calculation of the field dependent term to increase the muon detection efficiency at lower momenta using a Runge-Kutta method. The muon identification and hadron separation in b-bbar jets is reported with the improved software. In the same framework, the utilization of the Kalman filter is introduced. The principle of the Kalman filter is described in some detail with the propagation matrix, with the Runge-Kutta term included, and the effect on low momenta for low momenta single muons particles is described.

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

    E-Print Network [OSTI]

    Lateef, Mohammed Afroz

    1993-01-01T23:59:59.000Z

    incident on it, the size of the network, and the ID of the node. Thus a node does not know who its neighbors are and which links are unreliable. We assume that the network is asynchronous i. e. there is no global clock and global memory in the network... the leader is a loser. Each node knows its ID, the number of edges incident on it, and the number of nodes in the network, i. e. ~V) = N. The node does not know which of the links are reliable. The IDs of the uodes are unique and distinct. All the nodes...

  15. Stochastic Ion Heating by Lower Hybrid Turbulence

    E-Print Network [OSTI]

    Candy, J.

    2010-01-01T23:59:59.000Z

    of Tur b ulent S jpectrum Heating S imulations. Run 1A 2A 3ADivision Stochastic Ion Heating by Lower Hybrid Turbulenceweb development in this heating process is also discussed. I

  16. Lower Saccharide Nanometric Materials and Methods

    DOE Patents [OSTI]

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

    2004-07-13T23:59:59.000Z

    A ceramic composition having at least one nanometric ceramic powder, at least one lower saccharide, and water. The composition is useful in many industrial applications, including preparation of stronger and substantially defect free green and sintered ceramic bodies.

  17. Algorithms for Greechie Diagrams

    E-Print Network [OSTI]

    Brendan D. McKay; Norman D. Megill; Mladen Pavicic

    2001-01-21T23:59:59.000Z

    We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.

  18. Optimized Algorithms Boost Combustion Research

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

    Optimized Algorithms Boost Combustion Research Optimized Algorithms Boost Combustion Research Methane Flame Simulations Run 6x Faster on NERSC's Hopper Supercomputer November 25,...

  19. Algorithms incorporating concurrency and caching

    E-Print Network [OSTI]

    Fineman, Jeremy T

    2009-01-01T23:59:59.000Z

    This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...

  20. Geometric Lower Bounds for Parametric Matroid Optimization

    E-Print Network [OSTI]

    Eppstein, David

    (n)) for the special case of parametric graph minimum spanning trees. The only previous lower bound was (n logr for the sequence of minimum spanning trees in a graph with linearly varying edge weights. This parametric spanning tree problem has applications including the stochastic spanning tree problem studied by Ishii et al

  1. EARTH SCIENCES Lower-Division Requirements

    E-Print Network [OSTI]

    Constable, Steve

    2012-2013 EARTH SCIENCES Lower-Division Requirements Math 20A_____ 20B_____ 20C_____ 20D (BILD 3) _____ SIO 50* _____ Group A: Earth Science Upper-Division Core Requirements (all courses _____ Introduction to Geophysics SIO 104 _____ Paleobiology and History of Life* Group B: Upper-Division Earth

  2. THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN

    E-Print Network [OSTI]

    Rutten, Rob

    THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN Sterrekundig Instituut, Postbus 80 000, NL3508 TA, Utrecht, The Netherlands Abstract. This "rapporteur" report discusses the solar photosphere and low does not seem to jeopardize precise determination of solar abundances in classical fashion. It is still

  3. Quantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1

    E-Print Network [OSTI]

    Salvaggio, Carl

    , and quantitatively evaluate infrared contrast enhancement algorithms for use in a real-time long-wave infrared imageQuantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1 and Carl range imagery output from current sensors are compressed in a pleasing way for display on lower dynamic

  4. Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control

    E-Print Network [OSTI]

    Powell, Warren B.

    for the optimal control of such power systems are critical for the deployment of reliable and more economical and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We useBenchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control

  5. KH Computational Physics-2006 Basic Numerical Algorithms Integration

    E-Print Network [OSTI]

    Glashausser, Charles

    KH Computational Physics- 2006 Basic Numerical Algorithms Integration Numerical integration competing factors one needs to consider speed - number of function evaluations or grid points precision or "smart" meshes with lower order routines Kristjan Haule, 2006 1 #12;KH Computational Physics- 2006

  6. Genetic Algorithms Artificial Life

    E-Print Network [OSTI]

    Forrest, Stephanie

    systems tremendously. Likewise, evolution of artificial systems is an important component of artificial) are currently the most promi nent and widely used models of evolution in artificiallife systems. GAs have beenGenetic Algorithms and Artificial Life Melanie Mitchell Santa Fe Institute 1660 Old Pecos Tr

  7. Graph algorithms experimentation facility

    E-Print Network [OSTI]

    Sonom, Donald George

    1994-01-01T23:59:59.000Z

    DRAWADJMAT 2 ~e ~l 2. ~f ~2 2 ~t ~& [g H 2 O? Z Mwd a P d ed d Aid~a sae R 2-BE& T C dbms Fig. 2. External Algorithm Handler The facility is menu driven and implemented as a client to XAGE. Our implementation follows very closely the functionality...

  8. Space Complexity Algorithms & Complexity

    E-Print Network [OSTI]

    Way, Andy

    Space Complexity Algorithms & Complexity Space Complexity Nicolas Stroppa Patrik Lambert - plambert@computing.dcu.ie CA313@Dublin City University. 2008-2009. December 4, 2008 #12;Space Complexity Hierarchy of problems #12;Space Complexity NP-intermediate Languages If P = NP, then are there languages which neither in P

  9. Robust seed selection algorithm for k-means type algorithms

    E-Print Network [OSTI]

    Pavan, K Karteeka; Rao, A V Dattatreya; Sridhar, G R; 10.5121/ijcsit.2011.3513

    2012-01-01T23:59:59.000Z

    Selection of initial seeds greatly affects the quality of the clusters and in k-means type algorithms. Most of the seed selection methods result different results in different independent runs. We propose a single, optimal, outlier insensitive seed selection algorithm for k-means type algorithms as extension to k-means++. The experimental results on synthetic, real and on microarray data sets demonstrated that effectiveness of the new algorithm in producing the clustering results

  10. The optimization problem Genetic Algorithm

    E-Print Network [OSTI]

    Giménez, Domingo

    The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally

  11. High-performance combinatorial algorithms

    E-Print Network [OSTI]

    Pinar, Ali

    2003-01-01T23:59:59.000Z

    mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which

  12. Lower Valley Energy Inc | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere I Geothermal Pwer Plant Jump to:Landowners andLodgepole,Lotsee,Energy InformationMichigan:Lower

  13. Central Ferry Lower Monumental | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are beingZealand JumpConceptual Model, click here.Telluric Survey asWest, NewCenterville, Ohio:Ferry Lower Monumental

  14. Arctic Lower Troposphere Observed Structure (ALTOS)

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office511041cloth DocumentationProductsAlternativeOperational Management » HistoryAugust Lower Troposphere

  15. Lower Colorado River Authority | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnual SiteofEvaluatingGroup |Jilin ZhongdiantouLichuanInformationLoremoJobsPlans:Actions:Lower

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

    SciTech Connect (OSTI)

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

    1994-12-01T23:59:59.000Z

    The radiological survey of the former radioactive waste treatment plant site (TA-45), Acid Canyon, Pueblo Canyon, and Los Alamos Canyon found residual contamination at the site itself and in the channel and banks of Acid, Pueblo, and lower Los Alamos Canyons all the way to the Rio Grande. The largest reservoir of residual radioactivity is in lower Pueblo Canyon, which is on DOE property. However, residual radioactivity does not exceed proposed cleanup criteria in either lower Pueblo or lower Los Alamos Canyons. The three alternatives proposed are (1) to take no action, (2) to construct a sediment trap in lower Pueblo Canyon to prevent further transport of residual radioactivity onto San Ildefonso Indian Pueblo land, and (3) to clean the residual radioactivity from the canyon system. Alternative 2, to cleanup the canyon system, is rejected as a viable alternative. Thousands of truckloads of sediment would have to be removed and disposed of, and this effort is unwarranted by the low levels of contamination present. Residual radioactivity levels, under either present conditions or projected future conditions, will not result in significant radiation doses to persons exposed. Modeling efforts show that future transport activity will not result in any residual radioactivity concentrations higher than those already existing. Thus, although construction of a sediment trap in lower Pueblo Canyon is a viable alternative, this effort also is unwarranted, and the no-action alternative is the preferred alternative.

  17. CAVITY CONTROL ALGORITHM

    SciTech Connect (OSTI)

    Tomasz Plawski, J. Hovater

    2010-09-01T23:59:59.000Z

    A digital low level radio frequency (RF) system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA, and finally a transmitting DAC. This universal platform opens up the possibilities for a variety of control algorithm implementations. The foremost concern for an RF control system is cavity field stability, and to meet the required quality of regulation, the chosen control system needs to have sufficient feedback gain. In this paper we will investigate the effectiveness of the regulation for three basic control system algorithms: I&Q (In-phase and Quadrature), Amplitude & Phase and digital SEL (Self Exciting Loop) along with the example of the Jefferson Lab 12 GeV cavity field control system.

  18. Diagnosis of Lower Hybrid on MST

    SciTech Connect (OSTI)

    Burke, D. R.; Goetz, J. A.; Kaufman, M. C.; Almagri, A. F.; Anderson, J. K.; Forest, C. B.; Prager, S. C. [University of Wisconsin--Madison, Madison WI 53706 (United States)

    2007-09-28T23:59:59.000Z

    RF driven current has never been demonstrated in a Reversed Field Pinch. Recently the lower hybrid system on the Madison Symmetric Torus reached a new operating regime. This upgrade allows RF powers of up to 5% of the Ohmic input power to be injected. It is therefore anticipated that the lower hybrid system is on the threshold of producing meaningful changes to the RFP equilibrium. A diagnostic set is under development to facilitate the study of such changes and lay the foundation for near megawatt operations. Many measurements are being studied for viability. These include electron cyclotron emission, examinations of bulk ion and electron heating, surface perturbation pickup coils, magnetic probe measurements, and Langmuir probe measurements. In addition, several x-ray diagnostics are in operation: pulse height analysis is performed on detector arrays to determine the 5-200 keV spectrum. An insertable target probe is available to create x-rays from fast electrons. Tomographic inversion of 2-D Soft x-ray detectors yields equilibrium information through island structure. Results from experiments with source power up to 225 kW will be presented. Preliminary results from CQL3D Fokker-Planck simulations will also be presented.

  19. Stability of Coupling Algorithms

    E-Print Network [OSTI]

    Akkasale, Abhineeth

    2012-07-16T23:59:59.000Z

    of Committee, K. B. Nakshatrala Committee Members, Steve Suh J. N. Reddy Head of Department, Dennis O?Neal May 2011 Major Subject: Mechanical Engineering iii ABSTRACT Stability of Coupling Algorithms. (May 2011) Abhineeth Akkasale, B.E., Bangalore... step. iv To Amma and Anna v ACKNOWLEDGMENTS First and foremost, I thank Dr. Kalyana B. Nakshatrala for being an incredible advisor and for his time and patience in constantly guiding me through my research. I am indebted to him for his guidance...

  20. Lower Snake River Subbasin Management Plan WDFW March 2004 1

    E-Print Network [OSTI]

    Lower Granite pool and the Palouse and Tucannon Rivers join near the midpoint of Lower Monumental Ecoregion. Subbasin Land Ownership Palouse Lower Snake Tucannon Asotin Walla Walla Total Federal Lands 1 68

  1. PVT Analysis With A Deconvolution Algorithm

    SciTech Connect (OSTI)

    Kouzes, Richard T.

    2011-02-01T23:59:59.000Z

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

  2. Large scale tracking algorithms.

    SciTech Connect (OSTI)

    Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry

    2015-01-01T23:59:59.000Z

    Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.

  3. Algorithms for builder guidelines

    SciTech Connect (OSTI)

    Balcomb, J.D.; Lekov, A.B.

    1989-06-01T23:59:59.000Z

    The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.

  4. Distributed algorithms for mobile ad hoc networks

    E-Print Network [OSTI]

    Malpani, Navneet

    2001-01-01T23:59:59.000Z

    We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...

  5. The implementation of the Lower Silver Creek watershed project

    E-Print Network [OSTI]

    Keenan, Christina; McPherson, Mariah

    2003-01-01T23:59:59.000Z

    Measures on Lower Silver Creek Interim Project. San Jose,Valley Water District. May 1978. Lower Silver Creek, LakeCunningham, Thompson Creek Planning Survey consisting of

  6. Energy Department Announces $9 Million to Lower Costs, Increase...

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

    Lower Costs, Increase Performance of Solar Energy Systems Energy Department Announces 9 Million to Lower Costs, Increase Performance of Solar Energy Systems December 2, 2014 -...

  7. Light water reactor lower head failure analysis

    SciTech Connect (OSTI)

    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

    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.

  8. Lower Hybrid antennas for nuclear fusion experiments

    E-Print Network [OSTI]

    Hillairet, Julien; Bae, Young-Soon; Bai, X; Balorin, C; Baranov, Y; Basiuk, V; Bcoulet, A; Belo, J; Berger-By, G; Brmond, S; Castaldo, C; Ceccuzzi, S; Cesario, R; Corbel, E; Courtois, X; Decker, J; Delmas, E; Delpech, L; Ding, X; Douai, D; Ekedahl, A; Goletto, C; Goniche, M; Guilhem, D; Hertout, P; Imbeaux, F; Litaudon, X; Magne, R; Mailloux, J; Mazon, D; Mirizzi, F; Mollard, P; Moreau, P; Oosako, T; Petrzilka, V; Peysson, Y; Poli, S; Preynas, M; Prou, M; Saint-Laurent, F; Samaille, F; Saoutic, B

    2015-01-01T23:59:59.000Z

    The nuclear fusion research goal is to demonstrate the feasibility of fusion power for peaceful purposes. In order to achieve the conditions similar to those expected in an electricity-generating fusion power plant, plasmas with a temperature of several hundreds of millions of degrees must be generated and sustained for long periods. For this purpose, RF antennas delivering multi-megawatts of power to magnetized confined plasma are commonly used in experimental tokamaks. In the gigahertz range of frequencies, high power phased arrays known as "Lower Hybrid" (LH) antennas are used to extend the plasma duration. This paper reviews some of the technological aspects of the LH antennas used in the Tore Supra tokamak and presents the current design of a proposed 20 MW LH system for the international experiment ITER.

  9. Nonlinear evolution of lower hybrid waves Charles F. F. Karney

    E-Print Network [OSTI]

    Karney, Charles

    problem. With typical fields for lower hybrid heating of a tokamak, it is found that large reflections can occur close to the edge of the plasma. I. INTRODUCTION In typical lower hybrid heating schemes, lower hy, and determine the consequences of our results for lower hybrid heating. The plan of this paper i s a s follows

  10. Simulations of lower-hybrid coupling in the Madison Symmetric Torus

    SciTech Connect (OSTI)

    Carlsson, Johan; Smithe, David [Tech-X Corporation, Boulder, Colorado (United States); Carter, Mark [Oak Ridge National Laboratory, Oak Ridge, Tennessee (United States); Kaufman, Mike [University of Wisconsin, Madison, Wisconsin (United States)

    2009-11-26T23:59:59.000Z

    Simulations of Lower Hybrid (LH) coupling in the Madison Symmetric Torus (MST) Reversed Field Pinch (RFP) will be presented. Due to the special requirements of the RFP configuration (tight-fitting conducting shell in which only minimal portholes are acceptable), an unusual interdigital line slow-wave antenna is used, mounted below the mid plane on the inboard side. A number of codes are used, including VORPAL, RANT3D/AORSA1D-H and MWS, each solving different equations and using different algorithms. Output from the different codes will be presented and compared to verify the simulation results.

  11. Shortest Path Algorithms: A Comparison

    E-Print Network [OSTI]

    Golden, Bruce L., 1950-

    In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.

  12. Hedge Algorithm and Subgradient Methods

    E-Print Network [OSTI]

    2010-10-05T23:59:59.000Z

    standard complexity results on subgradient algorithms allows us to derive optimal parameters ...... the American Statistical Association, 58:1330, 1963. 1In fact...

  13. Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms

    E-Print Network [OSTI]

    Balasubramonian, Rajeev

    1 Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) At each clock, processors receive input output #12;4 Control at Each Processor Each processor stores the minimum number it has seen

  14. Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge

    E-Print Network [OSTI]

    Mazzotti, Frank

    Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge Application Process: Student Conservation Association (SCA) Forestry and biological Wildlife Refuge. This forestry position will be mostly field work within the Lower

  15. Albertiana 25 Report on the Lower Triassic of

    E-Print Network [OSTI]

    Tong, Jinnan

    GSSPs of the Triassic. The GSSP of the PTB is located in a protected quarry at Meishan, Changxing County the uppermost of the Lower Triassic was eroded off. Moreover, the Lower Tri- assic in Meishan area is made

  16. Energy Department Announces $3 Million to Lower Cost of Geothermal...

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

    Lower Cost of Geothermal Energy and Boost U.S. Supply of Critical Materials Energy Department Announces 3 Million to Lower Cost of Geothermal Energy and Boost U.S. Supply of...

  17. Fact Sheet - Myths & Facts about the lower Snake River dams ...

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

    Myths and facts about the lower Snake River dams MYTH: The four lower Snake River dams are low value. FACT: It costs about 5 per megawatt-hour to produce power at the dams. The...

  18. The effects of orthotics on lower extremity variability during running

    E-Print Network [OSTI]

    Brethauer, Samuel

    2011-12-31T23:59:59.000Z

    Introduction: Abnormal foot mechanics may affect kinematics of the lower extremity, predisposing individuals to injury. Foot orthotics are often used to alter lower extremity mechanics. Little research is available examining ...

  19. Production of highly unidirectional lower-hybrid waves

    SciTech Connect (OSTI)

    McWilliams, R.; Okubo, M.; Platt, R.C.; Sheehan, D.P.

    1985-01-01T23:59:59.000Z

    The development of a highly unidirectional lower-hybrid wave source would improve the electron current drive efficiency in tokamaks. Lower-hybrid waves launched from a phased wave array are shown to be reflected from a grid placed in a cold, low-density plasma. The antenna--grid combination results in highly unidirectional lower-hybrid waves.

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

    SciTech Connect (OSTI)

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

    2009-02-18T23:59:59.000Z

    This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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

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

    SciTech Connect (OSTI)

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

    2009-02-18T23:59:59.000Z

    This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 2002 spring out-migration at migrant traps on the Snake River and Salmon River. In 2002 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 11.4 times greater in 2002 than in 2001. The wild Chinook catch was 15.5 times greater than the previous year. Hatchery steelhead trout catch was 2.9 times greater than in 2001. Wild steelhead trout catch was 2.8 times greater than the previous year. The Snake River trap collected 3,996 age-0 Chinook salmon of unknown rearing. During 2002, the Snake River trap captured 69 hatchery and 235 wild/natural sockeye salmon and 114 hatchery coho salmon O. kisutch. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant increase in catch in 2002 was due to a 3.1 fold increase in hatchery Chinook production and a more normal spring runoff. Trap operations began on March 10 and were terminated on June 7. The trap was out of operation for a total of four days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 4.2 times greater and wild Chinook salmon catch was 2.4 times greater than in 2001. The hatchery steelhead trout collection in 2002 was 81% of the 2001 numbers. Wild steelhead trout collection in 2002 was 81% of the previous year's catch. Trap operations began on March 10 and were terminated on May 29 due to high flows. The trap was out of operation for four days due to high flow or debris. The increase in hatchery Chinook catch in 2002 was due to a 3.1 fold increase in hatchery production and differences in flow between years. Changes in hatchery and wild steelhead catch are probably due to differences in flow between years. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2002 data detected a relation between migration rate and discharge for hatchery and wild Chinook salmon. For hatchery and wild Chinook salmon there was a 4.7-fold and a 3.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.8-fold and a 1.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2002 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for wild Chinook salmon and hatchery steelhead trout. The analysis was unable to detect a relation between migration rate and discharge for hatchery Chinook salmon. The lack of a detectable relation was probably a result of the migration rate data being spread over a very narrow range of discharge. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 4.3-fold for wild Chinook salmon and 2.2-fold for hatchery steelhead between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River trap were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at

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

    SciTech Connect (OSTI)

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

    2009-02-18T23:59:59.000Z

    This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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

  3. ice-surface lowering or some regional climate change induced by ice-surface lowering. If attributed solely to a

    E-Print Network [OSTI]

    Flint-Garcia, Sherry

    ice-surface lowering or some regional climate change induced by ice-surface lowering. If attributed solely to a change in ice-surface elevation, the 3 to 4C warming at Siple Dome (16) would indicate 500 to 650 m of ice-surface lowering, assuming a free atmospheric lapse rate of 6C per 1000 m

  4. Frequency stabilization in nonlinear MEMS and NEMS oscillators

    DOE Patents [OSTI]

    Lopez, Omar Daniel; Antonio, Dario

    2014-09-16T23:59:59.000Z

    An illustrative system includes an amplifier operably connected to a phase shifter. The amplifier is configured to amplify a voltage from an oscillator. The phase shifter is operably connected to a driving amplitude control, wherein the phase shifter is configured to phase shift the amplified voltage and is configured to set an amplitude of the phase shifted voltage. The oscillator is operably connected to the driving amplitude control. The phase shifted voltage drives the oscillator. The oscillator is at an internal resonance condition, based at least on the amplitude of the phase shifted voltage, that stabilizes frequency oscillations in the oscillator.

  5. NEM Interpolant for Fourth-Order PDEs Internal Report

    E-Print Network [OSTI]

    Sukumar, N.

    Sibson's coordinate in the Bernstein-B#19;ezier representation of a cubic simplex, a C 1( interpolant and in the #12;eld of computer-aided geometric design [10]. A review article on triangular Bernstein- B#19;ezier of a simplex ? 2 R n 1 . A Bernstein-B#19;ezier surface of degree m over the simplex ? can be written

  6. U.S. Regional Demand Forecasts Using NEMS and GIS

    E-Print Network [OSTI]

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

    2005-01-01T23:59:59.000Z

    Administration. 2004a. Annual Energy Outlook 2004. U.S.Assumptions of the Annual Energy Outlook 2004. DOE/EIA-0554(and Definitions AEO Annual Energy Outlook ArcGIS - ESRI

  7. EIA Buildings Analysis of Consumer Behavior in NEMS

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

    2015 2020 2025 2030 2035 2040 0 2 4 6 8 10 12 14 16 2010 2015 2020 2025 2030 2035 2040 PV Wind Natural gas Other For more information 15 Behavioral Economics Experts Meeting,...

  8. Appendix C: Map of NEMS Electricity Market Module Regions

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 111 1,613 122 40CoalLease(Billion CubicPotentialNov-14 Dec-14 Jan-1538,469Appendix E44 Reference4

  9. Analysis and Representation of Miscellaneous Electric Loads in NEMS -

    Gasoline and Diesel Fuel Update (EIA)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for On-Highway4,1,50022,3,,,,6,1,9,1,50022,3,,,,6,1,Decade Year-0E (2001)gasoline prices4 OilU.S. OffshoreOil andEnergy

  10. Overview of NEMS-H2, Version 1.0

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels DataDepartment of Energy Your Density Isn'tOrigin of Contamination in ManyDepartmentOutreach toTransmissionProgramTechnologies

  11. NEMS Freight Transportation Module Improvement Study - Energy Information

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Saleshttp://www.fnal.gov/directorate/nalcal/nalcal02_07_05_files/nalcal.gif Directorate - Events - Fermilab

  12. Geometric algorithms for reconfigurable structures

    E-Print Network [OSTI]

    Benbernou, Nadia M

    2011-01-01T23:59:59.000Z

    In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the ...

  13. Randomized algorithms for reliable broadcast

    E-Print Network [OSTI]

    Vaikuntanathan, Vinod

    2009-01-01T23:59:59.000Z

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

  14. Bayesian inference algorithm on Raw

    E-Print Network [OSTI]

    Luong, Alda

    2004-01-01T23:59:59.000Z

    This work explores the performance of Raw, a parallel hardware platform developed at MIT, running a Bayesian inference algorithm. Motivation for examining this parallel system is a growing interest in creating a self-learning ...

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

    SciTech Connect (OSTI)

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

    2009-02-18T23:59:59.000Z

    This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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

  16. Citrus Production in the Lower Rio Grande Valley of Texas.

    E-Print Network [OSTI]

    Traub, Hamilton Paul; Friend, W. H. (William Heartsill)

    1930-01-01T23:59:59.000Z

    LIE?ARY, A t r: COLLEGE, CAvrus. TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR COLLEGE STATION, BRAZOS COUNTY, TEXAS - BULLETIN NO. 419 DIVISION OF HORTICULTURE Citrus Production in the Lower Rio Grande Valley of Texas... of Agriculture. . Citrus fruit production in the Lower Rio Grande Valley, especially grapefruit, has increased at a rather rapid rate dur- ing the past few years. More than 5,000,000 citrus trees were set in orchard form in the Lower Rio Grande Valley up...

  17. Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques

    E-Print Network [OSTI]

    Boyer, Edmond

    . En particulier plusieurs facettes et applications des algorithmes MCO, MCOP, MCOG, ... seront mises

  18. agaricus bisporus lowers: Topics by E-print Network

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

    and discusses some subtleties of studying field space trajectories. Aditya Aravind; Dustin Lorshbough; Sonia Paban 2014-01-06 182 Lower bounds in the quantum cell probe model...

  19. Microsoft Word - LowerJocko_Acquisition_CX_final_081310.doc

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

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

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

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

    Protected Lithium Electrodes for Advanced Batteries ADVANCED MANUFACTURING OFFICE Developing a Lower Cost and Higher Energy Density Alternative to Lithium-Ion Batteries...

  1. Lower Valley Energy- Residential Energy Efficiency Rebate Program

    Broader source: Energy.gov [DOE]

    Lower Valley Energy offers numerous rebates for residential customers who wish to increase the energy efficiency of eligible homes. Rebates are available for weatherization measures, water heaters,...

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

    E-Print Network [OSTI]

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

    2014-04-10T23:59:59.000Z

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

  3. First satellite observations of lower tropospheric ammonia and methanol

    E-Print Network [OSTI]

    First satellite observations of lower tropospheric ammonia and methanol Reinhard Beer,1 Mark W) and methanol (CH3OH), well above the normal background levels. This is the first time that these molecules have. Citation: Beer, R., et al. (2008), First satellite observations of lower tropospheric ammonia and methanol

  4. Annual Tour Ready to Explore New Mexico's Lower Pecos River

    E-Print Network [OSTI]

    Nebraska-Lincoln, University of

    Annual Tour Ready to Explore New Mexico's Lower Pecos River By Steve Ress The itinerary is set and the seats have been filled for an early June bus tour to New Mexico's lower Pecos River basin compacts on Nebraska's Republican River and New Mexico's Pecos River to see what can be learned from

  5. MAX-PLANCK-INSTITUT.. ( Lower Bounds for Set Intersection

    E-Print Network [OSTI]

    . Mehlhorn R. Raman C. Uhrig MPI- I-92-127 October 1992 o mPD_ _ _ _ _ _ _ IN F 0 R M AT I K _ _ _ _ __ Im Stadtwald 66123 Saarbrcken Germany #12;Lower Bounds for Set Intersection Queries P. Dietz K. Mehlhorn R. Raman C. Uhrig MPI-I-92-127 October 1992 #12;Lower Bounds for Set Intersection Queries PAUL DIETZ KURT

  6. A genetic algorithm based method for docking flexible molecules

    SciTech Connect (OSTI)

    Judson, R.S. [Sandia National Labs., Livermore, CA (United States); Jaeger, E.P.; Treasurywala, A.M. [Sterling-Winthrop Inc., Collegeville, PA (United States)

    1993-11-01T23:59:59.000Z

    The authors describe a computational method for docking flexible molecules into protein binding sites. The method uses a genetic algorithm (GA) to search the combined conformation/orientation space of the molecule to find low energy conformation. Several techniques are described that increase the efficiency of the basic search method. These include the use of several interacting GA subpopulations or niches; the use of a growing algorithm that initially docks only a small part of the molecule; and the use of gradient minimization during the search. To illustrate the method, they dock Cbz-GlyP-Leu-Leu (ZGLL) into thermolysin. This system was chosen because a well refined crystal structure is available and because another docking method had previously been tested on this system. Their method is able to find conformations that lie physically close to and in some cases lower in energy than the crystal conformation in reasonable periods of time on readily available hardware.

  7. Optimisation of Quantum Evolution Algorithms

    E-Print Network [OSTI]

    Apoorva Patel

    2015-03-04T23:59:59.000Z

    Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.

  8. Optimisation of Quantum Evolution Algorithms

    E-Print Network [OSTI]

    Patel, Apoorva

    2015-01-01T23:59:59.000Z

    Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.

  9. Five Quantum Algorithms Using Quipper

    E-Print Network [OSTI]

    Safat Siddiqui; Mohammed Jahirul Islam; Omar Shehab

    2014-06-18T23:59:59.000Z

    Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \\ensuremath{4 \\times 4} matrix constructors for Unitary operators, we have also implemented \\ensuremath{8 \\times 8} and \\ensuremath{16 \\times 16} matrix constructors.

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

    SciTech Connect (OSTI)

    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

    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.

  11. Lower bounds on the absorption probability of beam splitters

    E-Print Network [OSTI]

    Stefan Scheel

    2005-08-25T23:59:59.000Z

    We derive a lower limit to the amount of absorptive loss present in passive linear optical devices such as a beam splitter. We choose a particularly simple beam splitter geometry, a single planar slab surrounded by vacuum, which already reveals the important features of the theory. It is shown that, using general causality requirements and statistical arguments, the lower bound depends on the frequency of the incident light and the transverse resonance frequency of a suitably chosen single-resonance model only. For symmetric beam splitters and reasonable assumptions on the resonance frequency $\\omega_T$, the lower absorption bound is $p_{\\min}\\approx 10^{-6}(\\omega/\\omega_T)^4$.

  12. A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

    SciTech Connect (OSTI)

    Jian Jinbao, E-mail: jianjb@gxu.edu.cn; Li Jianling; Mo Xingde [College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004 (China)

    2006-06-15T23:59:59.000Z

    This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.

  13. Algorithmic Aspects of Risk Management

    E-Print Network [OSTI]

    Stehr, Mark-Oliver

    Algorithmic Aspects of Risk Management Ashish Gehani1 , Lee Zaniewski2 , and K. Subramani2 1 SRI International 2 West Virginia University Abstract. Risk analysis has been used to manage the security of sys configuration. This allows risk management to occur in real time and reduces the window of exposure to attack

  14. Algorithmic Thermodynamics John C. Baez

    E-Print Network [OSTI]

    Tomkins, Andrew

    Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + µd

  15. Adaptive protection algorithm and system

    DOE Patents [OSTI]

    Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA

    2009-04-28T23:59:59.000Z

    An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

  16. Machine Learning: Foundations and Algorithms

    E-Print Network [OSTI]

    Ben-David, Shai

    with accident prevention systems that are built using machine learning algorithms. Machine learning is also to us). Machine learning tools are concerned with endowing programs with the ability to "learn if the learning process succeeded or failed? The second goal of this book is to present several key machine

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

  18. Optimization Online - Lower Bounds on Complexity of Lyapunov ...

    E-Print Network [OSTI]

    Amir Ali Ahmadi

    2015-04-14T23:59:59.000Z

    Apr 14, 2015 ... Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems ... of the optimal product, generalizing a result of Lagarias and Wang. ... belonging to some of the most popular function classes in controls.

  19. Oxygen enhanced switching to combustion of lower rank fuels ...

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

    enhanced switching to combustion of lower rank fuels Re-direct Destination: A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum...

  20. ORIGINAL ARTICLE Hydropower development in the lower Mekong basin

    E-Print Network [OSTI]

    Vermont, University of

    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

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

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

  3. A Tight Lower Bound for the Adjacent Quadratic Assignment Problem

    E-Print Network [OSTI]

    Borzou Rostami

    2014-09-23T23:59:59.000Z

    Sep 23, 2014 ... A Tight Lower Bound for the Adjacent Quadratic Assignment Problem ... The first is based on a ``flow'' formulation whose linear relaxation can be solved very efficiently ... Category 2: Integer Programming (0-1 Programming ).

  4. Wild and Scenic River Acts (Lower St. Croix Riverway)

    Broader source: Energy.gov [DOE]

    The lower portion of the St. Croix River in Minnesota and Wisconsin is regulated under the National Wild and Scenic Rivers Program. Most new residential, commercial, and industrial uses are...

  5. SUSTAINABLE COMMUNITY REDEVELOPMENT: A Plan for Detroit's Lower Eastside

    E-Print Network [OSTI]

    Edwards, Paul N.

    SUSTAINABLE COMMUNITY REDEVELOPMENT: A Plan for Detroit's Lower of Science/Master of Landscape Architecture (Natural Resources and Environment of the neighborhood. To aid JEBA in their strategic planning process, we developed a replicable model of sustainable

  6. Woody vegetation of the lower Navasota River watershed

    E-Print Network [OSTI]

    Allen, Harriet Louise Gell

    1974-01-01T23:59:59.000Z

    WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by DIl 5~ HARRIET ?GELL ALLEN Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE December... 1974 Major Subject: Range Science WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by HARRIET GELL ALLEN Approved as to style and content by: (Chairman of Committee) (Head of Department) (Member) (Member) December 1974...

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

    SciTech Connect (OSTI)

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

    2011-01-01T23:59:59.000Z

    Soldiers returning from the global war on terror requiring lower leg prosthetics generally have different concerns and requirements than the typical lower leg amputee. These subjects are usually young, wish to remain active and often desire to return to active military duty. As such, they demand higher performance from their prosthetics, but are at risk for chronic injury and joint conditions in their unaffected limb. Motion analysis is a valuable tool in assessing the performance of new and existing prosthetic technologies as well as the methods in fitting these devices to both maximize performance and minimize risk of injury for the individual soldier. We are developing a mobile, low-cost motion analysis system using inertial measurement units (IMUs) and two custom force sensors that detect ground reaction forces and moments on both the unaffected limb and prosthesis. IMUs were tested on a robot programmed to simulate human gait motion. An algorithm which uses a kinematic model of the robot and an extended Kalman filter (EKF) was used to convert the rates and accelerations from the gyro and accelerometer into joint angles. Compared to encoder data from the robot, which was considered the ground truth in this experiment, the inertial measurement system had a RMSE of <1.0 degree. Collecting kinematic and kinetic data without the restrictions and expense of a motion analysis lab could help researchers, designers and prosthetists advance prosthesis technology and customize devices for individuals. Ultimately, these improvements will result in better prosthetic performance for the military population.

  8. asexual genetic algorithm: Topics by E-print Network

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

    for Genetic Algorithms No Author Given Andrews, Mark W. 2 A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm) CERN Preprints Summary: Context....

  9. The bidimensionality theory and its algorithmic applications

    E-Print Network [OSTI]

    Hajiaghayi, MohammadTaghi

    2005-01-01T23:59:59.000Z

    Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...

  10. Optimization Online - An Approximation Algorithm for Constructing ...

    E-Print Network [OSTI]

    Artur Pessoa

    2006-09-02T23:59:59.000Z

    Sep 2, 2006 ... In this paper, we propose an approximation algorithm for the 2-bit Hamming prefix code problem. Our algorithm spends $O(n \\log^3 n)$ time to...

  11. Constant time algorithms in sparse graph model

    E-Print Network [OSTI]

    Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology

    2010-01-01T23:59:59.000Z

    We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...

  12. Optimization Online - Efficient parallel coordinate descent algorithm ...

    E-Print Network [OSTI]

    Ion Necoara

    2012-11-02T23:59:59.000Z

    Nov 2, 2012 ... Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC.

  13. Optimization Online - Efficient Algorithmic Techniques for Several ...

    E-Print Network [OSTI]

    Mugurel Ionut Andreica

    2008-10-23T23:59:59.000Z

    Oct 23, 2008 ... Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems. Mugurel Ionut...

  14. An algorithm for minimization of quantum cost

    E-Print Network [OSTI]

    Anindita Banerjee; Anirban Pathak

    2010-04-09T23:59:59.000Z

    A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.

  15. ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular ...

    E-Print Network [OSTI]

    SOU-CHENG T. CHOI, MICHAEL A. SAUNDERS

    2013-01-12T23:59:59.000Z

    Jan 12, 2013 ... ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular Symmetric and. Hermitian Linear Equations and Least-Squares. Problems.

  16. Equivalence of Learning Algorithms Julien Audiffren1

    E-Print Network [OSTI]

    Equivalence of Learning Algorithms Julien Audiffren1 and Hachem Kadri2 1 CMLA, ENS Cachan is to introduce a concept of equivalence between machine learn- ing algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance

  17. A DISTRIBUTED POWER CONTROL ALGORITHM FOR

    E-Print Network [OSTI]

    Mitra, Debasis

    A DISTRIBUTED POWER CONTROL ALGORITHM FOR BURSTY TRANSMISSIONS ON CELLULAR, SPREAD SPECTRUM, USA ABSTRACT We propose a distributed algorithm for power control in cellular, wideband networks, although its parameters are different from data. We propose a distributed algorithm for power control

  18. A Genetic Algorithm Approach for Technology Characterization

    E-Print Network [OSTI]

    Galvan, Edgar

    2012-10-19T23:59:59.000Z

    A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY CHARACTERIZATION A Thesis by EDGAR GALVAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE August 2012 Major Subject: Mechanical Engineering A Genetic Algorithm Approach for Technology Characterization Copyright 2012 Edgar Galvan A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY...

  19. Algorithmic Decision Theory and the Smart Grid

    E-Print Network [OSTI]

    1 Algorithmic Decision Theory and the Smart Grid Fred Roberts Rutgers University #12;2 Algorithmic Conference on ADT probably Belgium in Fall 2013. #12;9 ADT and Smart Grid Many of the following ideas and planning dating at least to World War II. But: algorithms to speed up and improve real-time decision

  20. university-logo Intro Algorithm Results Concl.

    E-Print Network [OSTI]

    Aarts, Gert

    university-logo Intro Algorithm Results Concl. Strong coupling lattice QCD at finite temperature Ph. de Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. QCD Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. Motivation (1

  1. Logo-like Learning of Basic Concepts of Algorithms -Having Fun with Algorithms

    E-Print Network [OSTI]

    Logo-like Learning of Basic Concepts of Algorithms - Having Fun with Algorithms Gerald Futschek are not primarily interested in programming the way of learning is highly influenced by the Logo style of learning to design efficient algorithms. Keywords Logo-like learning, algorithms, group learning 1 2 3 4 5 n ... 1

  2. Distributed Approaches for Determination of Reconfiguration Algorithm Termination

    E-Print Network [OSTI]

    Lai, Hong-jian

    Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard

  3. Geometric lower bound for a quantum coherence measure

    E-Print Network [OSTI]

    Diego Paiva Pires; Lucas C. Cleri; Diogo O. Soares-Pinto

    2015-04-23T23:59:59.000Z

    Nowadays, geometric tools are being used to treat a huge class of problems of quantum information science. By understanding the interplay between the geometry of the state space and information-theoretic quantities, it is possible to obtain less trivial and more robust physical constraints on quantum systems. In this sense, here we establish a geometric lower bound for the Wigner-Yanase skew information (WYSI), a well-known information theoretic quantity recently recognized as a proper quantum coherence measure. Starting from a mixed state evolving under unitary dynamics, while WYSI is a constant of motion, the lower bound indicates the rate of change of quantum statistical distinguishability between initial and final states. Our result shows that, since WYSI fits in the class of Petz metrics, this lower bound is the change rate of its respective geodesic distance on quantum state space. The geometric approach is advantageous because raises several physical interpretations of this inequality under the same theoretical umbrella.

  4. Heatup of the TMI-2 lower head during core relocation

    SciTech Connect (OSTI)

    Wang, S.K.; Sienicki, J.J.; Spencer, B.W.

    1989-01-01T23:59:59.000Z

    An analysis has been carried out to assess the potential of a melting attack upon the reactor vessel lower head and incore instrument nozzle penetration weldments during the TMI core relocation event at 224 minutes. Calculations were performed to determine the potential for molten corium to undergo breakup into droplets which freeze and form a debris bed versus impinging upon the lower head as one or more coherent streams. The effects of thermal-hydraulic interactions between corium streams and water inside the lower plenum, the effects of the core support assembly structure upon the corium, and the consequences of corium relocation by way of the core former region were examined. 19 refs., 24 figs.

  5. Microgenetic optimization algorithm for optimal wavefront shaping

    E-Print Network [OSTI]

    Anderson, Benjamin R; Gunawidjaja, Ray; Eilers, Hergen

    2015-01-01T23:59:59.000Z

    One of the main limitations of utilizing optimal wavefront shaping in imaging and authentication applications is the slow speed of the optimization algorithms currently being used. To address this problem we develop a micro-genetic optimization algorithm ($\\mu$GA) for optimal wavefront shaping. We test the abilities of the $\\mu$GA and make comparisons to previous algorithms (iterative and simple-genetic) by using each algorithm to optimize transmission through an opaque medium. From our experiments we find that the $\\mu$GA is faster than both the iterative and simple-genetic algorithms and that both genetic algorithms are more resistant to noise and sample decoherence than the iterative algorithm.

  6. algorithms

    Office of Scientific and Technical Information (OSTI)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742EnergyOnItem Not FoundInformation DOEInformation Summary Big*Theea2/316Cap plasticity

  7. Citrus Variety Trends in the Lower Rio Grande Valley.

    E-Print Network [OSTI]

    Alderman, D. C. (DeForest Charles)

    1951-01-01T23:59:59.000Z

    Citrus Variety Trends in the Lower Rio Grande Valley CONTENTS ......................................................................................................... Digest ...... 3... thousands of citrus trees and the growers were faced with a tremendous replanting program, which, in turn, had focused interest on varieties. Fruit production figures, yields per acre, and monetary returns per acre for five varieties of grapefruit...

  8. Surface OceanLower Atmosphere Processes Geophysical Research Series 187

    E-Print Network [OSTI]

    Kohfeld, Karen

    , British Columbia, Canada Andy Ridgwell Bristol Research Initiative for the Dynamic Global Environment251 Surface OceanLower Atmosphere Processes Geophysical Research Series 187 Copyright 2009, and processes have been identified that have improved our understanding of the modern and future carbon cycle

  9. New Lower Bounds for Online k-Server Routing Problems

    E-Print Network [OSTI]

    Krumke, Sven O.

    New Lower Bounds for Online k-Server Routing Problems Irene Fink a Sven O. Krumke a Stephan, 67653 Kaiserslautern, Germany. {fink,krumke,westphal}@mathematik.uni-kl.de Abstract In a k-server routing problem k 1 servers move in a metric space in order to visit specified points or carry objects

  10. Fuel Cell Tax Incentives: How Monetization Lowers the

    E-Print Network [OSTI]

    for electricity produced and sold by a qualified facility for a 5- or 10-year period. o Currently 2.1 cent or 1Fuel Cell Tax Incentives: How Monetization Lowers the Government Outlay By: Lee J. Peterson, Esq.48-9(a)(1). 5R G Building Business Value February 19, 2009 #12;How Do Tax Credits Minimize Government

  11. INTRODUCTION Extraction of granite from lower crust, and its

    E-Print Network [OSTI]

    Solar, Gary S.

    INTRODUCTION Extraction of granite from lower crust, and its emplacement at shallower levels, is the principal mechanism by which the continents have be- come differentiated. Thus, understanding how granite orogenic belts spatial and tem- poral relationships between granite and regional tectonic structures

  12. Lower Granite Dam Smolt Monitoring Program, 2000 Annual Report.

    SciTech Connect (OSTI)

    Morrill, Charles; Ross, Doug; Mensik, Fred

    2000-01-01T23:59:59.000Z

    The 2000 fish collection season at Lower Granite was characterized by lower than average spring flows and spill, low levels of debris, cool water temperatures, increased unclipped yearling and subyearling chinook smolts, and 8,300,546 smolts collected and transported compared to 5,882,872 in 1999. With the continued release of unclipped supplementation chinook and steelhead above Lower Granite Dam, we can no longer accurately distinguish wild chinook, steelhead, and sockeye/kokanee in the sample. Although some table titles in this report still show ''wild'' column headings, the numbers in these columns for 1999 and 2000 include wild and unclipped hatchery origin smolts. The increases over previous years reflect the increased supplementation. A total of 8,300,546 juvenile salmonids were collected at Lower Granite Dam. Of these, 187,862 fish were bypassed back to the river and 7,950,648 were transported to release sites below Bonneville Dam, 7,778,853 by barge and 171,795 by truck. A total of 151,344 salmonids were examined in daily samples. Nine research projects conducted by four agencies impacted a total of 1,361,006 smolts (16.4% of the total collection).

  13. PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA

    E-Print Network [OSTI]

    PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA A Thesis Submitted Technical Report TR2010-665 #12;Abstract Message authentication with low latency is necessary to ensure- tication solutions by our lab and others looked at single messages and incurred no- ticeable latency

  14. Is there Lower Limit to Velocity or Velocity Change?

    E-Print Network [OSTI]

    B. N. Sreenath; Kenath Arun; C. Sivaram

    2013-06-19T23:59:59.000Z

    Here we explore the possibility of a lower limit to velocity or velocity change which is 20 orders of magnitude smaller than the speed of light and explore the various observable signatures including those in cosmic rays and gamma ray bursts.

  15. Full wave simulations of lower hybrid wave propagation in tokamaks

    E-Print Network [OSTI]

    Wright, John C.

    Full wave simulations of lower hybrid wave propagation in tokamaks J. C. Wright , P. T. Bonoli , C hybrid (LH) waves have the attractive property of damping strongly via electron Landau resonance. Consequently these waves are well-suited to driving current in the plasma periphery where the electron

  16. Traversal, Case Analysis, and Lowering for C++ Program Analysis

    E-Print Network [OSTI]

    Wagner, Luke A.

    2010-01-14T23:59:59.000Z

    ++. This extension, named Filter, assists the tool builder in traversal, case analysis, and lowering of the data structure representing C++ programs. Comparisons described in the thesis show a 2-4x code reduction when solving basic problems (e.g., searching for uses...

  17. WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS

    E-Print Network [OSTI]

    Hernandez, Manuel

    2011-05-06T23:59:59.000Z

    The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...

  18. WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS

    E-Print Network [OSTI]

    Garcia, Bianca 1989-

    2011-05-06T23:59:59.000Z

    The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...

  19. THE DISCOVERY OF LOWER ACICULAR FERRITE 10.1 INTRODUCTION

    E-Print Network [OSTI]

    Cambridge, University of

    CHAPTER 10 THE DISCOVERY OF LOWER ACICULAR FERRITE 10.1 INTRODUCTION There is general agreement that a weld microstructure primarily containing acicu- lar ferrite will exhibit high strength and excellent of allotriomorphic ferrite, ferrite plates with aligned carbides, or grain-boundary nucleated bainite is considered

  20. A lower bound of quantum conditional mutual information

    E-Print Network [OSTI]

    Lin Zhang; Junde Wu

    2014-09-29T23:59:59.000Z

    In this paper, a lower bound of quantum conditional mutual information is obtained by employing the Peierls-Bogoliubov inequality and Golden Thompson inequality. Comparison with the bounds obtained by other researchers indicates that our result is independent of any measurements. It may give some new insights over squashed entanglement and perturbations of Markov chain states.

  1. WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS

    E-Print Network [OSTI]

    Hernandez, Manuel

    2011-05-06T23:59:59.000Z

    The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...

  2. WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS

    E-Print Network [OSTI]

    Garcia, Bianca 1989-

    2011-05-06T23:59:59.000Z

    The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...

  3. RECOMMENDED TREES FOR MICHIGAN'S LOWER PENINSULA American Hornbeam

    E-Print Network [OSTI]

    Isaacs, Rufus

    slower to establish. Native to Michigan and eastern U.S. Pests: Prone to ice damage. Two-line chestnut bore can be a problem when plants are stressed DEPARTMENT OF HORTICULTURE Michigan State University Michigan State University #12;RECOMMENDED TREES FOR MICHIGAN'S LOWER PENINSULA DEPARTMENT OF HORTICULTURE

  4. Lower bounding procedure for the Asymmetric Quadratic Traveling ...

    E-Print Network [OSTI]

    2015-02-04T23:59:59.000Z

    a lower bound is to linearize the quadratic terms xijxjk for all (i, j),(j, k) ? A ..... Consider any cycle C. Since column Cp is the selected column to enter the basis we ..... some kind of subtour elimination constraint, we restrict the search to find a

  5. Lower Oil Prices: A Reason to Give Thanks GENE EPSTEIN

    E-Print Network [OSTI]

    California at Davis, University of

    Lower Oil Prices: A Reason to Give Thanks By GENE EPSTEIN Nov. 29, 2014 1:31 a.m. ET I give thanks thanks for an oil price that fell below $70 a barrel Friday, mainly because it bodes well for general early this year ("Here Comes $75 Oil," March 31). Amy Jaffe, executive director of energy

  6. Sediment Transport in the Lower Guadalupe and San Antonio Rivers

    E-Print Network [OSTI]

    Holley, Edward R.

    regions. This study was undertaken to analyze existing data and to collect field data for the lower part of the Guadalupe River and the San Antonio River. The primary sampling locations were at the U. S. Highway 59 bridges in Victoria for the Guadalupe...

  7. Fairness in optimal routing algorithms

    E-Print Network [OSTI]

    Goos, Jeffrey Alan

    1988-01-01T23:59:59.000Z

    Member) Alberto Garcia-Diaz (Member) J. W. Howze (Head of Department) December 1988 ABSTRACT Fairness in Optimal Routing Algorithms (December- 1988) JefFrey Alan Goos, B. S. , University of Missouri Co ? Chairmen of Advisory Committee: Dr. Wei K... appreciation to my committee co-chairmen, Drs. hei K. Tsai and Pierce E. Cantrell, f' or their support and advice. In addition, I would like to thank Drs. Jerry D. Gibson and Alberto Garcia-Diaz for their time and usef'ul comments in reviewing this document...

  8. Quantum random-walk search algorithm

    SciTech Connect (OSTI)

    Shenvi, Neil; Whaley, K. Birgitta [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Kempe, Julia [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Computer Science Division, EECS, University of California, Berkeley, California 94720 (United States); CNRS-LRI, UMR 8623, Universite de Paris-Sud, 91405 Orsay (France)

    2003-05-01T23:59:59.000Z

    Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O({radical}(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

  9. Enhanced algorithms for stochastic programming

    SciTech Connect (OSTI)

    Krishna, A.S.

    1993-09-01T23:59:59.000Z

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

  10. Algorithm for a microfluidic assembly line

    E-Print Network [OSTI]

    Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner

    2011-01-19T23:59:59.000Z

    Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.

  11. Electron heating using lower hybrid waves in the PLT tokamak

    SciTech Connect (OSTI)

    Bell, R.E.; Bernabei, S.; Cavallo, A.; Chu, T.K.; Luce, T.; Motley, R.; Ono, M.; Stevens, J.; von Goeler, S.

    1987-06-01T23:59:59.000Z

    Lower hybrid waves with a narrow high velocity wave spectrum have been used to achieve high central electron temperatures in a tokamak plasma. Waves with a frequency of 2.45 GHz launched by a 16-waveguide grill at a power level less than 600 kW were used to increase the central electron temperature of the PLT plasma from 2.2 keV to 5 keV. The magnitude of the temperature increase depends strongly on the phase difference between the waveguides and on the direction of the launched wave. A reduction in the central electron thermal diffusivity is associated with the peaked electron temperature profiles of lower hybrid current-driven plasmas. 16 refs.

  12. Lowering the threshold in the DAMA dark matter detector

    SciTech Connect (OSTI)

    Kelso, Chris [Department of Physics and Astronomy, University of Utah, Salt Lake City, Utah 84112 (United States)

    2014-06-24T23:59:59.000Z

    We look at two improvements related to the DAMA/LIBRA dark matter detector. We show how using a more optimized binning scheme of the current data can lead to significantly tighter contraints on the compatible regions of the WIMP parameter space. In addition, the PMTs of the detector were upgraded in 2010, allowing the low energy threshold to be lowered from 2 keVee to 1 keVee. We examine the implications for the dark matter interpretion of the DAMA modulation with data in this new energy region. Specifically, we focus on how well the degeneracy between the low mass and high mass regions can be removed by this new data. We find that the lower threshold data should rule out one of the two mass ranges in the spin-independent case at a minimum of the 2.6? level in the worst case scenario.

  13. MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC-TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC- TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES Eddy-Current nondestructive evaluation of metal plates is of interest in a wide range of applications in the lower frequency band (kHz) for eddy-current testing, to retrieve small void defects inside a conducting

  14. Chitinozoans in the subsurface Lower Paleozoic of West Texas

    E-Print Network [OSTI]

    Kauffman, A. E.

    1971-10-22T23:59:59.000Z

    THE UNIVERSITY OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS October 22, 1971 Paper 54 CHITINOZOANS IN THE SUBSURFACE LOWER PALEOZOIC OF WEST TEXAS A. E. KAUFFMAN Humble Oil & Refining Company, Midland, Texas ABSTRACT Studies based on both comprehensive... are found throughout the West Texas area. As generally accepted by operational petroleum geologists, the Simpson Group comprises the Joins Formation (limestone and dolomite); Oil Creek Formation (sandstone, shale, and limestone); McLish Formation (sand...

  15. Oxygen enhanced switching to combustion of lower rank fuels

    DOE Patents [OSTI]

    Kobayashi, Hisashi; Bool III, Lawrence E.; Wu, Kuang Tsai

    2004-03-02T23:59:59.000Z

    A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum amount of energy per unit of time is enabled to combust fuel having a lower energy content, while still obtaining at least the stated minimum energy generation rate, by replacing a small amount of the combustion air fed to the furnace by oxygen. The replacement of oxygen for combustion air also provides reduction in the generation of NOx.

  16. Citrus Varieties for the Lower Rio Grande Valley.

    E-Print Network [OSTI]

    Wood, J. F. (John Fielding); Friend, W. H. (William Heartsill)

    1941-01-01T23:59:59.000Z

    Lf BRARY, /A & NI COLLEGE, b TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR, College Station, Texas CITRUS VARIETIES FOR THE LOWER RIO GRANDE VALLEY Mr. H. FRIEND AND J. F. WOOD Division of Horticulture LIBRARY \\gxict... perishable nature of this type of fruit. Limes and lemons may be grown by persons who are financially able to equip their orchards with heaters. There are many types of citrus fruits that may be grown as ornamentals or for special purposes, but none...

  17. Nonlinear lower-hybrid oscillations in cold plasma

    SciTech Connect (OSTI)

    Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Calcutta 700 064 (India); Sengupta, Sudip [Institute of Plasma Research, Bhat, Gandhinagar 382428 (India)

    2010-08-15T23:59:59.000Z

    In a fluid description nonlinear lower-hybrid oscillation have been studied in a cold quasineutral magnetized plasma using Lagrangian variables. An exact analytical solution with nontrivial space and time dependence is obtained. The solution demonstrates that under well defined initial and boundary conditions the amplitude of the oscillations increases due to nonlinearity and then comes back to its initial condition again. These solutions indicate a class of nonlinear transient structures in magnetized plasma.

  18. Optimization Online - Efficient Heuristic Algorithms for Maximum ...

    E-Print Network [OSTI]

    T. G. J. Myklebust

    2012-11-19T23:59:59.000Z

    Nov 19, 2012 ... Efficient Heuristic Algorithms for Maximum Utility Product Pricing Problems. T. G. J. Myklebust(tmyklebu ***at*** csclub.uwaterloo.ca)

  19. Efficient Algorithmic Techniques for Several Multidimensional ...

    E-Print Network [OSTI]

    Mugurel

    2008-10-23T23:59:59.000Z

    Politehnica University of Bucharest, Romania, mugurel.andreica@cs.pub.ro. Abstract: In this paper I present several novel, efficient, algorithmic techniques for.

  20. Exact Algorithms for Combinatorial Optimization Problems with ...

    E-Print Network [OSTI]

    2012-03-30T23:59:59.000Z

    using stochastic objective functions. Potential investment ..... An algorithm to construct a minimum directed spanning tree in a directed network. In. Developments...

  1. Parallel Interval Continuous Global Optimization Algorithms

    E-Print Network [OSTI]

    abdeljalil benyoub

    2002-07-19T23:59:59.000Z

    Jul 19, 2002 ... Abstract: We theorically study, on a distributed memory architecture, the parallelization of Hansen's algorithm for the continuous global...

  2. Algorithmic Cooling in Liquid State NMR

    E-Print Network [OSTI]

    Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein

    2014-11-17T23:59:59.000Z

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

  3. algorithmics: Topics by E-print Network

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

    Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...

  4. algorithms: Topics by E-print Network

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

    Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...

  5. Environmental audit, Bonneville Power Administration, lower Columbia area

    SciTech Connect (OSTI)

    Not Available

    1990-11-01T23:59:59.000Z

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

  6. Public policy implications of deepening the lower Mississippi

    SciTech Connect (OSTI)

    Cocchiara, J.G.

    1983-11-01T23:59:59.000Z

    The Mississippi River and its tributary system serves the industrial and agricultural heartland of the United States. In terms of total tonnage, the deep water channel of the lower Mississippi, stretching 253 miles from the Gulf of Mexico to Baton Rouge, is the largest port complex in the world. The vast majority of the cargo carried on the river is carried in bulk, a major portion of which could benefit from a deeper river channel. The Corps of Engineers has recommended a 55 foot channel to Baton Rouge, but the Reagan administration has insisted that the federal government will no longer fully fund such projects. In response, the State of Louisiana, under the direction of Governor David C. Treen, has conducted its own independent in-depth evaluation of providing deeper draft access to the lower Mississippi. A special task force established for this purpose recently concluded a year long investigation. On September 2, it issued a recommendation for a phased deepening project, at a significantly lower cost than the Corps recommended plan, in combination with private development of offshore topping-off facilities.

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

    SciTech Connect (OSTI)

    United States. Bonneville Power Administration.

    1995-04-01T23:59:59.000Z

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

  8. Lower Metal Enrichment of Virialized Gas in Minihalos

    E-Print Network [OSTI]

    Renyue Cen; Mario A. Riquelme

    2007-04-26T23:59:59.000Z

    We differentiate between the metal enrichment of the gas in virialized minihalos and that of the intergalactic medium at high redshift, pertinent to cosmological reionization, with the initial expectation that gas in the high density regions within formed dark matter halos may be more robust thus resistant to mixing with lower density intergalactic medium. Using detailed hydrodynamic simulations of gas clouds in minihalos subject to destructive processes associated with the encompassing intergalactic shocks carrying metal-enriched gas, we find, as an example, that, for realistic shocks of velocities of 10-100km/s, more than (90%,65%) of the high density gas with rho>500 rhob inside a minihalo virialized at z=10 of mass (10^7,10^6)Msun remains at a metallicity lower than 3% of that of the intergalactic medium by redshift z=6. It may be expected that the high density gas in minihalos becomes fuel for subsequent star formation, when they are incorporated into larger halos where efficient atomic cooling can induce gas condensation hence star formation. Since minihalos virialize at high redshift when the universe is not expected to have been significantly reionized, the implication is that gas in virialized minihalos may provide an abundant reservoir of primordial gas to possibly allow for the formation of Population-III metal-free stars to extend to much lower redshift than otherwise expected based on the enrichment of intergalactic medium.

  9. A preliminary evaluation of a speed threshold incident detection algorithm

    E-Print Network [OSTI]

    Kolb, Stephanie Lang

    1996-01-01T23:59:59.000Z

    Algorithm . . . . . . . . . . . . , . Event Scan Algorithm . Neural Network . . . . . . . . . . . . . . . , . . . . . . California Algorithm ?8 with Fuzzy Logic Selected Algorithms Page 20 21 22 24 24 25 26 27 28 28 30 32 32 33 33 33 33... 7 California Algorithm ?10 Decision Tree 12 14 15 8 Speed/Flow Curve 9 McMaster Algorithm Template 15 25 10 Traffic Flow Relationships Applied in the Dynamic Model Algorithm. . . 26 11 Multi-Layer Feed-Forward Neural Network 12 Membership...

  10. The Need for Language Repair The Reformation Algorithm Discussion Reformation: A Domain-Independent Algorithm

    E-Print Network [OSTI]

    St Andrews, University of

    The Need for Language Repair The Reformation Algorithm Discussion Reformation: A Domain of Edinburgh University of St Andrews, 27th November 2013 #12;The Need for Language Repair The Reformation Algorithm Discussion Outline 1 The Need for Language Repair 2 The Reformation Algorithm 3 Discussion #12;The

  11. MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL

    E-Print Network [OSTI]

    MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL Mehdi-NN search in large scale image databases, based on top-k multi-criteria search tech- niques. The method retrieval, stor- age requirements and update cost. The search algorithm delivers ap- proximate results

  12. Page Replacement Algorithms To use a simulation for evaluating various page replacement algorithms studied in class.

    E-Print Network [OSTI]

    Stojmenovic, Ivan

    Operating Systems CSI3131 Lab 4 Winter 2011 Page Replacement Algorithms Objective To use a simulation for evaluating various page replacement algorithms studied in class. Description (Please read to compare the performance of each page replacement algorithm. The constructor of this class contains

  13. Lower Flathead System Fisheries Study, 1984 Annual Report.

    SciTech Connect (OSTI)

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

    1984-12-01T23:59:59.000Z

    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.

  14. Face Recognition Algorithms Surpass Humans Matching Faces

    E-Print Network [OSTI]

    Abdi, Hervé

    over humans, in light of the absolute performance levels of the algorithms, underscores the need systems for security applications. How accurate must a face recognition algorithm be to contribute to these applications? Over the last decade, academic computer vision researchers and commercial product developers have

  15. Hard Thresholding Pursuit Algorithms: Number of Iterations

    E-Print Network [OSTI]

    Hitczenko, Pawel

    algorithms do provide alternative methods. We consider here the hard thresholding pursuit (HTP) algorithm [6 us now recall that (HTP) consists in constructing a sequence (xn) of s-sparse vectors, starting absolute entries of xn-1 + A (y - Axn-1 ),(HTP1) xn := argmin{ y - Az 2, supp(z) Sn },(HTP2) until

  16. On the Potential of Automatic Algorithm Configuration

    E-Print Network [OSTI]

    Hutter, Frank

    .g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well lead to enormous speed-ups of tree search algorithms for SAT for solving SAT-encoded software The problem of setting an algorithm's free parameters for maximal performance on a class of problem instances

  17. A Faster Primal Network Simplex Algorithm

    E-Print Network [OSTI]

    Aggarwal, Charu C.

    We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...

  18. ASYNPLEX, an asynchronous parallel revised simplex algorithm

    E-Print Network [OSTI]

    Hall, Julian

    ASYNPLEX, an asynchronous parallel revised simplex algorithm J.A.J. Hall K.I.M. McKinnon February, an asynchronous parallel revised simplex algorithm J. A. J. Hall K. I. M. McKinnon 27th February 1998 Abstract This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable

  19. Ris-R-Report FATIGUE EVALUATION ALGORITHMS

    E-Print Network [OSTI]

    Algorithms: Review Division: Materials Research Division Published on the internet July 2010 Ris-R-1740(EN, WISPERX and NEW WISPER load sequences on a Glass/Epoxy multidirectional laminate typical of a wind turbine rotor blade construction. Two versions of the algorithm, the one using single-step and the other using

  20. Power Control Algorithms in Wireless Communications

    E-Print Network [OSTI]

    Power Control Algorithms in Wireless Communications Judd Rohwer , Chaouki T. Abdallah , Aly El-Osery 1 Abstract This paper presents a comprehensive review of the published algorithms on power control) and Time Division Multiple Access (TDMA). 2 Introduction Power control in cellular systems is applied

  1. CS229 Lecture notes Generative Learning algorithms

    E-Print Network [OSTI]

    Kosecka, Jana

    analysis (GDA). In this model, we'll assume that p(x|y) is distributed according to a multivariate normal discriminant analysis The first generative learning algorithm that we'll look at is Gaussian discrim- inant. In these notes, we'll talk about a different type of learning algorithm. Consider a classification problem

  2. Improvements of the local bosonic algorithm

    E-Print Network [OSTI]

    B. Jegerlehner

    1996-12-15T23:59:59.000Z

    We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.

  3. Energy Aware Algorithmic Engineering Swapnoneel Roy

    E-Print Network [OSTI]

    Rudra,, Atri

    Energy Aware Algorithmic Engineering Swapnoneel Roy School of Computing University of North Florida: akshat.verma@in.ibm.com Abstract--In this work, we argue that energy management should be a guiding are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number

  4. Buffer assignment algorithms for data driven architectures

    E-Print Network [OSTI]

    Chatterjee, Mitrajit

    1994-01-01T23:59:59.000Z

    algorithms have been shown to be O(V x E) and O(V'xlogV) re spectively; an improvement over the existing strategies. A novel buffer distribution algorithm to maximize the pipelining and throughput has also been proposed. The number of buffers obtained...

  5. Communication and Computation in Distributed CSP Algorithms

    E-Print Network [OSTI]

    Krishnamachari, Bhaskar

    Communication and Computation in Distributed CSP Algorithms C`esar Fern`andez1 , Ramon Bejar1 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

  6. Algorithms in grid classes Ruth Hoffmann

    E-Print Network [OSTI]

    St Andrews, University of

    signs c1, . . . , cs and row signs, r1, . . . , rt and let = {(k, ) : Mk, = 0}. The map : GridAlgorithms in grid classes Ruth Hoffmann University of St Andrews, School of Computer Science Permutation Patterns 2013 Universit´e Paris Diderot 2nd July 2013 Ruth Hoffmann Algorithms in grid classes 1

  7. A heuristic algorithm for graph isomorphism

    E-Print Network [OSTI]

    Torres Navarro, Luz

    1999-01-01T23:59:59.000Z

    polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...

  8. Enhancing Smart Home Algorithms Using Temporal Relations

    E-Print Network [OSTI]

    Cook, Diane J.

    Enhancing Smart Home Algorithms Using Temporal Relations Vikramaditya R. JAKKULA1 and Diane J COOK School of Electrical Engineering and Computer Science Abstract. Smart homes offer a potential benefit improves the performance of these algorithms and thus enhances the ability of smart homes to monitor

  9. An improved spectral graph partitioning algorithm for mapping parallel computations

    SciTech Connect (OSTI)

    Hendrickson, B.; Leland, R.

    1992-09-01T23:59:59.000Z

    Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.

  10. Lower hybrid heating and current drive on PLT

    SciTech Connect (OSTI)

    Stevens, J.E.; Bernabei, S.; Bitter, M.

    1983-03-01T23:59:59.000Z

    800 MHz lower hybrid waves have been launched into PLT with a six waveguide coupler. Recent improvements have allowed powers up to 400 kW to be launched with good coupling (R approx. 10 to 25%). Experiments at low density (anti n/sub e/ < 7 x 10/sup 12/ cm/sup -3/, i.e., ..omega../..omega../sub LH/ > 2) have demonstrated current drive and plasma heating. Experiments at higher densities have produced hot-ion tails, but so far have shown inefficient body heating. To date, only a limited parameters space has been investigated at high power.

  11. Nonlinear lower hybrid oscillations in a cold viscous plasma

    SciTech Connect (OSTI)

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

    2011-12-15T23:59:59.000Z

    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.

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

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011AT&T, Inc.'sEnergyTexas1.Space Data Corporation Comments oftheLower Colorado River

  13. Lower Colorado River Authority LCRA | Open Energy Information

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov YouKizildere I Geothermal Pwer Plant Jump to:Landowners andLodgepole,Lotsee,Energy InformationMichigan:Lower Colorado

  14. Savings Project: Lower Water Heating Temperature | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of ScienceandMesa del Sol HomeFacebook Twitter Principal InvestigatorsSave Energy onof EnergyLower

  15. Lower Cost, Nanoporous Block Copolymer Battery Separator - Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville PowerCherries 82981-1cnHigh SchoolIn12electron 9November 6, 2014Innovation Portal Lower Cost,

  16. Lower 48 States Natural Gas Working Underground Storage (Billion Cubic

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5 Tables July 1996 Energy Information Administration Office of Coal,Cubic Feet)FuelDecade Year-0InputYear44Feet) Lower 48 States

  17. The Iron Spin Transition in the Earth's Lower Mantle

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over OurThe Iron Spin Transition in the Earth's Lower Mantle Print It is now known that

  18. The Iron Spin Transition in the Earth's Lower Mantle

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over OurThe Iron Spin Transition in the Earth's Lower Mantle Print It is now known

  19. The Iron Spin Transition in the Earth's Lower Mantle

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over OurThe Iron Spin Transition in the Earth's Lower Mantle Print It is now knownThe

  20. The Iron Spin Transition in the Earth's Lower Mantle

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over OurThe Iron Spin Transition in the Earth's Lower Mantle Print It is now knownTheThe

  1. The Iron Spin Transition in the Earth's Lower Mantle

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over OurThe Iron Spin Transition in the Earth's Lower Mantle Print It is now

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

    Open Energy Info (EERE)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directedAnnualProperty Edit withTianlin BaxinUmwelt ManagementVeraInformation LEAF[1] "Lowering

  3. "Eztrack": A single-vehicle deterministic tracking algorithm

    SciTech Connect (OSTI)

    Carrano, C J

    2007-12-20T23:59:59.000Z

    A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we designed our own simple approach in IDL which is a deterministic, motion-guided object tracker. The object tracking relies both on object features and path dynamics. The algorithm certainly has room for future improvements, but we have found it to be a useful tool in evaluating effects of frame-rate, resolution/GSD, and spectral content (eg. grayscale vs. color imaging ). A block diagram of the tracking approach is given in Figure 1. We describe each of the blocks of the diagram in the upcoming sections.

  4. Lower-Temperature Subsurface Layout and Ventilation Concepts

    SciTech Connect (OSTI)

    Christine L. Linden; Edward G. Thomas

    2001-06-20T23:59:59.000Z

    This analysis combines work scope identified as subsurface facility (SSF) low temperature (LT) Facilities System and SSF LT Ventilation System in the Technical Work Plan for Subsurface Design Section FY 01 Work Activities (CRWMS M&O 2001b, pp. 6 and 7, and pp. 13 and 14). In accordance with this technical work plan (TWP), this analysis is performed using AP-3.10Q, Analyses and Models. It also incorporates the procedure AP-SI.1Q, Software Management. The purpose of this analysis is to develop an overall subsurface layout system and the overall ventilation system concepts that address a lower-temperature operating mode for the Monitored Geologic Repository (MGR). The objective of this analysis is to provide a technical design product that supports the lower-temperature operating mode concept for the revision of the system description documents and to provide a basis for the system description document design descriptions. The overall subsurface layout analysis develops and describes the overall subsurface layout, including performance confirmation facilities (also referred to as Test and Evaluation Facilities) for the Site Recommendation design. This analysis also incorporates current program directives for thermal management.

  5. Comparison of generality based algorithm variants for automatic taxonomy generation

    E-Print Network [OSTI]

    Madnick, Stuart E.

    We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...

  6. Advanced algorithms for information science

    SciTech Connect (OSTI)

    Argo, P.; Brislawn, C.; Fitzgerald, T.J.; Kelley, B.; Kim, W.H.; Mazieres, B.; Roeder, H.; Strottman, D.

    1998-12-31T23:59:59.000Z

    This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). In a modern information-controlled society the importance of fast computational algorithms facilitating data compression and image analysis cannot be overemphasized. Feature extraction and pattern recognition are key to many LANL projects and the same types of dimensionality reduction and compression used in source coding are also applicable to image understanding. The authors have begun developing wavelet coding which decomposes data into different length-scale and frequency bands. New transform-based source-coding techniques offer potential for achieving better, combined source-channel coding performance by using joint-optimization techniques. They initiated work on a system that compresses the video stream in real time, and which also takes the additional step of analyzing the video stream concurrently. By using object-based compression schemes (where an object is an identifiable feature of the video signal, repeatable in time or space), they believe that the analysis is directly related to the efficiency of the compression.

  7. Effect of lower feedstock prices on economics of MTBE complex

    SciTech Connect (OSTI)

    Rahman, F.; Hamid, S.H.; Ali, M.A. [King Fahd Univ. of Petroleum and Minerals, Dhahran (Saudi Arabia)

    1996-01-01T23:59:59.000Z

    Economic evaluation of the methyl tertiary butyl ether (MTBE) complex was carried out starting from n-butane and by captive production of methanol from natural gas. The processing steps consist of isomerization of n-butane to isobutane, dehydrogenation of isobutane to make isobutene, and finally, the reaction of isobutene with methanol to produce MTBE. Two different plant sizes were considered, and the effect of 30% lower feedback prices on profitability was studied. It was found that the raw materials cost is a dominant component, composing about 55% of the total production cost. An internal rate of return of 19% could be realized for 500,000 tons per annum MTBE complex based on economic data in mid-1993. The payback period estimated at this capacity was 3.8 years, and the break-even capacity was 36.6%.

  8. Separation and concentration of lower alcohols from dilute aqueous solutions

    DOE Patents [OSTI]

    Moore, Raymond H. (Richland, WA); Eakin, David E. (Kennewick, WA); Baker, Eddie G. (Richland, WA); Hallen, Richard T. (Richland, WA)

    1991-01-01T23:59:59.000Z

    A process for producing, from a dilute aqueous solution of a lower (C.sub.1 -C.sub.5) alcohol, a concentrated liquid solution of the alcohol in an aromatic organic solvent is disclosed. Most of the water is removed from the dilute aqueous solution of alcohol by chilling sufficiently to form ice crystals. Simultaneously, the remaining liquid is extracted at substantially the same low temperature with a liquid organic solvent that is substantially immiscible in aqueous liquids and has an affinity for the alcohol at that temperature, causing the alcohol to transfer to the organic phase. After separating the organic liquid from the ice crystals, the organic liquid can be distilled to enrich the concentration of alcohol therein. Ethanol so separated from water and concentrated in an organic solvent such as toluene is useful as an anti-knock additive for gasoline.

  9. Lower cost offshore field development utilizing autonomous vehicles

    SciTech Connect (OSTI)

    Frisbie, F.R.; Vie, K.J.; Welch, D.W.

    1996-12-31T23:59:59.000Z

    The offshore oil and gas industry has the requirement to inspect offshore oil and gas pipelines for scour, corrosion and damage as well as inspect and intervene on satellite production facilities. This task is currently performed with Remotely Operated Vehicles (ROV) operated from dynamically positioned (DP) offshore supply or diving support boats. Currently, these tasks are expensive due to the high day rates for DP ships and the slow, umbilical impeded, 1 knot inspection rates of the tethered ROVs, Emerging Autonomous Undersea Vehicle (AUV) technologies offer opportunities to perform these same inspection tasks for 50--75% lower cost, with comparable or improved quality. The new generation LAPV (Linked Autonomous Power Vehicles) will operate from fixed facilities such as TLPs or FPFs and cover an operating field 10 kms in diameter.

  10. Pathway to a lower cost high repetition rate ignition facility

    SciTech Connect (OSTI)

    Obenschain, S.P.; Colombant, D.G.; Schmitt, A.J.; Sethian, J.D.; McGeoch, M. W. [Plasma Physics Division, U.S. Naval Research Laboratory, Washington, D.C. 20375 (United States); Plex LLC, Brookline, Massachusetts 02446-5478 (United States)

    2006-05-15T23:59:59.000Z

    An approach to a high-repetition ignition facility based on direct drive with the krypton-fluoride laser is presented. The objective is development of a 'Fusion Test Facility' that has sufficient fusion power to be useful as a development test bed for power plant materials and components. Calculations with modern pellet designs indicate that laser energies well below a megajoule may be sufficient. A smaller driver would result in an overall smaller, less complex and lower cost facility. While this facility might appear to have most direct utility to inertial fusion energy, the high flux of neutrons would also be able to address important issues concerning materials and components for other approaches to fusion energy. The physics and technological basis for the Fusion Test Facility are presented along with a discussion of its applications.

  11. Introduction Group Sequencing The Best-Case Completion Time Lower Bounds Experiments Conclusion Best-Case Lower Bounds in a Group Sequence for

    E-Print Network [OSTI]

    Recanati, Catherine

    Introduction Group Sequencing The Best-Case Completion Time Lower Bounds Experiments Conclusion Best-Case Lower Bounds in a Group Sequence for the Job Shop Problem Guillaume Pinot Nasser Mebarki Pinot, Nasser Mebarki Best-Case Lower Bounds in a Group Sequence 1/24 #12;Introduction Group Sequencing

  12. A new loop-reducing routing algorithm

    E-Print Network [OSTI]

    Park, Sung-Woo

    1989-01-01T23:59:59.000Z

    Coming-up VI. Three Links Failed Page 51 51 52 52 53 53 . 54 54 55 Figure 5. 6. 7. 8. LIST OF FIGURES Bellman-Ford Algorithm Update Tables of Distributed Bellman-Ford Algorithm Two Types of a. Loop Two-Node Loop Multi-Node Loop... distances for all pairs of nodes in the subnet, and distributes updated routing information to all the nodes. The centralized algorithm, however, is vulnerable to a. single node failure ? if the NRC fails, all nodes in the network must stop their rout...

  13. System engineering approach to GPM retrieval algorithms

    SciTech Connect (OSTI)

    Rose, C. R. (Chris R.); Chandrasekar, V.

    2004-01-01T23:59:59.000Z

    System engineering principles and methods are very useful in large-scale complex systems for developing the engineering requirements from end-user needs. Integrating research into system engineering is a challenging task. The proposed Global Precipitation Mission (GPM) satellite will use a dual-wavelength precipitation radar to measure and map global precipitation with unprecedented accuracy, resolution and areal coverage. The satellite vehicle, precipitation radars, retrieval algorithms, and ground validation (GV) functions are all critical subsystems of the overall GPM system and each contributes to the success of the mission. Errors in the radar measurements and models can adversely affect the retrieved output values. Ground validation (GV) systems are intended to provide timely feedback to the satellite and retrieval algorithms based on measured data. These GV sites will consist of radars and DSD measurement systems and also have intrinsic constraints. One of the retrieval algorithms being studied for use with GPM is the dual-wavelength DSD algorithm that does not use the surface reference technique (SRT). The underlying microphysics of precipitation structures and drop-size distributions (DSDs) dictate the types of models and retrieval algorithms that can be used to estimate precipitation. Many types of dual-wavelength algorithms have been studied. Meneghini (2002) analyzed the performance of single-pass dual-wavelength surface-reference-technique (SRT) based algorithms. Mardiana (2003) demonstrated that a dual-wavelength retrieval algorithm could be successfully used without the use of the SRT. It uses an iterative approach based on measured reflectivities at both wavelengths and complex microphysical models to estimate both No and Do at each range bin. More recently, Liao (2004) proposed a solution to the Do ambiguity problem in rain within the dual-wavelength algorithm and showed a possible melting layer model based on stratified spheres. With the No and Do calculated at each bin, the rain rate can then be calculated based on a suitable rain-rate model. This paper develops a system engineering interface to the retrieval algorithms while remaining cognizant of system engineering issues so that it can be used to bridge the divide between algorithm physics an d overall mission requirements. Additionally, in line with the systems approach, a methodology is developed such that the measurement requirements pass through the retrieval model and other subsystems and manifest themselves as measurement and other system constraints. A systems model has been developed for the retrieval algorithm that can be evaluated through system-analysis tools such as MATLAB/Simulink.

  14. Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...

    E-Print Network [OSTI]

    Saugata Basu

    Definition of Roadmaps. Properties of pseudo-critical values. Roadmap Algorithm for a bounded algebraic set. Saugata Basu. Efficient Algorithms for Computing...

  15. An Efficient Algorithm for Computing Robust Minimum Capacity st Cuts

    E-Print Network [OSTI]

    Doug Altner

    2008-03-20T23:59:59.000Z

    Mar 20, 2008 ... In this paper, we present an efficient algorithm for computing minimum capacity s-t cuts under a polyhedral model of robustness. Our algorithm...

  16. algorithm population sizing: Topics by E-print Network

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

    CiteSeer Summary: Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithms success. This...

  17. adaptive control algorithm: Topics by E-print Network

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

    24 25 Next Page Last Page Topic Index 1 ON AN ADAPTIVE CONTROL ALGORITHM FOR ADAPTIVE OPTICS APPLICATIONS Mathematics Websites Summary: ON AN ADAPTIVE CONTROL ALGORITHM FOR...

  18. advanced methods algorithms: Topics by E-print Network

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

    CS 3172, 0203: Advanced Algorithms, Part I Jrgen Dix 12;Chapter 1: Turing Zachmann, Gabriel 9 Advanced Algorithms Course. Lecture Notes. Part 9 Computer Technologies...

  19. advanced fitting algorithms: Topics by E-print Network

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

    CS 3172, 0203: Advanced Algorithms, Part I Jrgen Dix 12;Chapter 1: Turing Zachmann, Gabriel 15 Advanced Algorithms Course. Lecture Notes. Part 9 Computer Technologies...

  20. New Algorithm Enables Fast Simulations of Ultrafast Processes

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

    reduces the computational cost and increases the speed of the simulations. Comparing the new algorithm with the old, slower algorithm yields similar results, e.g., the predicted...

  1. A new Search via Probability Algorithm for solving Engineering ...

    E-Print Network [OSTI]

    Admin

    2012-08-08T23:59:59.000Z

    Without loss of generality, we design an algorithm to solve the problem (I), the .... Statistics of 30 times by running ESVP algorithm for Three-Bar Truss Design.

  2. annealing genetic algorithm: Topics by E-print Network

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

    25 Next Page Last Page Topic Index 1 Annealing a Genetic Algorithm for Constrained Optimization1 Mathematics Websites Summary: Annealing a Genetic Algorithm for Constrained...

  3. alternative learning algorithms: Topics by E-print Network

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

    (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm...

  4. SPEEDING UP DYNAMIC SHORTEST PATH ALGORITHMS Finding ...

    E-Print Network [OSTI]

    2003-09-19T23:59:59.000Z

    Sep 19, 2003 ... ... and Reps algorithm for updating a shortest path tree, which is a revision of ... tree, although it can be easily specialized for updating a tree [5].

  5. Quantum Robot: Structure, Algorithms and Applications

    E-Print Network [OSTI]

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

    2005-06-18T23:59:59.000Z

    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.

  6. Advanced CHP Control Algorithms: Scope Specification

    SciTech Connect (OSTI)

    Katipamula, Srinivas; Brambley, Michael R.

    2006-04-28T23:59:59.000Z

    The primary objective of this multiyear project is to develop algorithms for combined heat and power systems to ensure optimal performance, increase reliability, and lead to the goal of clean, efficient, reliable and affordable next generation energy systems.

  7. A polynomial projection algorithm for linear programming

    E-Print Network [OSTI]

    2013-05-03T23:59:59.000Z

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

  8. Optimized quantum random-walk search algorithms

    E-Print Network [OSTI]

    V. Potocek; A. Gabris; T. Kiss; I. Jex

    2008-12-12T23:59:59.000Z

    Shenvi, Kempe and Whaley's quantum random-walk search (SKW) algorithm [Phys. Rev. A 67, 052307 (2003)] is known to require $O(\\sqrt N)$ number of oracle queries to find the marked element, where $N$ is the size of the search space. The overall time complexity of the SKW algorithm differs from the best achievable on a quantum computer only by a constant factor. We present improvements to the SKW algorithm which yield significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached. We point out which improvement can be applied if there is more than one marked element to find.

  9. IIR algorithms for adaptive line enhancement

    SciTech Connect (OSTI)

    David, R.A.; Stearns, S.D.; Elliott, G.R.; Etter, D.M.

    1983-01-01T23:59:59.000Z

    We introduce a simple IIR structure for the adaptive line enhancer. Two algorithms based on gradient-search techniques are presented for adapting the structure. Results from experiments which utilized real data as well as computer simulations are provided.

  10. EFFICIENT ALGORITHMS FOR MINING ARBITRARY SHAPED CLUSTERS

    E-Print Network [OSTI]

    Zaki, Mohammed Javeed

    . . . . . . . . . . . . . . . . . . . . . . . . . 32 3.2 Phase 1 Kmeans Algorithm . . . . . . . . . . . . . . . . . . . . . . 33 3.2.1 Kmeans . . . . . . . . . . . . . . . . . . . . . . 49 3.6.2 Comparison of Kmeans Initialization Methods . . . . . . . . . 50 3.6.3 Results on

  11. Five-dimensional Janis-Newman algorithm

    E-Print Network [OSTI]

    Harold Erbin; Lucien Heurtier

    2014-11-07T23:59:59.000Z

    The Janis-Newman algorithm has been shown to be successful in finding new sta- tionary solutions of four-dimensional gravity. Attempts for a generalization to higher dimensions have already been found for the restricted cases with only one angular mo- mentum. In this paper we propose an extension of this algorithm to five dimensions with two angular momenta - using the prescription of G. Giampieri - through two specific examples, that are the Myers-Perry and BMPV black holes. We also discuss possible enlargements of our prescriptions to other dimensions and maximal number of angular momenta, and show how dimensions higher than six appear to be much more challenging to treat within this framework. Nonetheless this general algorithm provides a unification of the formulation in d = 3, 4, 5 of the Janis-Newman algorithm, from which which expose several examples including the BTZ black hole.

  12. Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques

    E-Print Network [OSTI]

    Boyer, Edmond

    Carlo adaptatives par Jrome Lelong Adaptive Monte Carlo methods are powerful variance reduction a randomly truncated stochastic algorithm. Finally, we apply this technique to the valuation of nancial deri

  13. Jun. 6, 2013 BBM 202 -ALGORITHMS

    E-Print Network [OSTI]

    Erdem, Erkut

    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

  14. Patterns hidden from simple algorithms Madhu Sudan

    E-Print Network [OSTI]

    Sudan, Madhu

    Patterns hidden from simple algorithms Madhu Sudan February 7, 2011 Is the number the most notorious example. Madhu Sudan (madhu@mit.edu) is a Principal Researcher at Microsoft Research

  15. Large scale prediction models and algorithms

    E-Print Network [OSTI]

    Monsch, Matthieu (Matthieu Frederic)

    2013-01-01T23:59:59.000Z

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

  16. An algorithmic approach to social networks

    E-Print Network [OSTI]

    Liben-Nowell, David

    2005-01-01T23:59:59.000Z

    Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze ...

  17. Spectral Representations of Uncertainty: Algorithms and Applications

    SciTech Connect (OSTI)

    George Em Karniadakis

    2005-04-24T23:59:59.000Z

    The objectives of this project were: (1) Develop a general algorithmic framework for stochastic ordinary and partial differential equations. (2) Set polynomial chaos method and its generalization on firm theoretical ground. (3) Quantify uncertainty in large-scale simulations involving CFD, MHD and microflows. The overall goal of this project was to provide DOE with an algorithmic capability that is more accurate and three to five orders of magnitude more efficient than the Monte Carlo simulation.

  18. Algorithms for revenue metering and their evaluation

    E-Print Network [OSTI]

    Martinez-Lagunes, Rodrigo

    2000-01-01T23:59:59.000Z

    ALGORITHMS FOR REVENUE METERING AND THEIR EVALUATION A Thesis by RODRIGO MARTINEZ-LAGUNES Submitted to the Office of Graduate Studies of Texas AdcM University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May... 2000 Major Subject: Electrical Engineering ALGORITHMS FOR REVENUE METERING AND THEIR EVALUATION A Thesis By RODRIGO MARTINEZ-LAGUNES Submitted to Texas A&M University in partial fulfillment of the requirements for the degree of MASTER...

  19. A fast indexing algorithm for sparse matrices

    E-Print Network [OSTI]

    Nieder, Alvin Edward

    1971-01-01T23:59:59.000Z

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

  20. Texas A&M scheduling algorithm

    E-Print Network [OSTI]

    Payne, Eugene Edgar

    1966-01-01T23:59:59.000Z

    TEXAS A6 M SCHEDULING ALGORITHM A Thesis By EUGENE EDGAR PAYNE Submitted to the Graduate College of the Texas AF M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE January 1966 Major Subject...: Computer Science TEXAS A&M SCHEDULING ALGORITHM A Thesis By EUGENE EDGAR PAYNE Ch trman of Committee) (Head of Department) (M ember) (M ember) January 1966 ACKNOWLEDGMENTS The author would like to express his indebtedness to Mr. James M. Nash...

  1. Lower Three Runs Remediation Safety Preparation Strategy - 13318

    SciTech Connect (OSTI)

    Mackay, Alexander; Fryar, Scotty; Doane, Alan [United States Department of Energy, Building 730-B, Aiken, SC 29808 (United States)] [United States Department of Energy, Building 730-B, Aiken, SC 29808 (United States)

    2013-07-01T23:59:59.000Z

    The Savannah River Site (SRS) is a 310-square-mile United States Department of Energy (US DOE) nuclear facility located along the Savannah River near Aiken, South Carolina that contains six primary stream/river systems. The Lower Three Runs Stream (LTR) is one of the primary streams within the site that is located in the southeast portion of the Savannah River Site. It is a large blackwater stream system that originates in the northeast portion of SRS and follows a southerly direction before it enters the Savannah River. During reactor operations, secondary reactor cooling water, storm sewer discharges, and miscellaneous wastewater was discharged and contaminated a 20 mile stretch of Lower Three Runs Stream that narrows and provides a limited buffer of US DOE property along the stream and flood-plain. Based on data collected during the years 2009 and 2010 under American Recovery and Re-investment Act funding, the stream was determined to be contaminated with cesium-137 at levels that exceeded acceptable risk based limits. In agreement with the Environmental Protection Agency and the South Carolina Department of Health and Environmental Control, three areas were identified for remediation [1] (SRNS April 2012). A comprehensive safety preparation strategy was developed for safe execution of the LTR remediation project. Contract incentives for safety encouraged the contractor to perform a complete evaluation of the work and develop an implementation plan to perform the work. The safety coverage was controlled to ensure all work was observed and assessed by one person per work area within the project. This was necessary due to the distances between the fence work and three transects being worked, approximately 20 miles. Contractor Management field observations were performed along with DOE assessments to ensure contractor focus on safe performance of the work. Dedicated ambulance coverage for remote worker work activities was provided. This effort was augmented with access to medical evacuation services. The areas where the work was performed were remote and difficult to get emergency vehicles to in a timely manner in case of an accident. Satellite phones were utilized due to intermittent phone coverage. High visibility vests were utilized to enable any hunters in the area to see the workers; due to the limited buffer areas along the stream route. An innovative approach to providing the necessary protection for workers during periods of extreme heat and humidity was also employed, which included the use of 'heat islands' with fans and crew trailers and ice vests for workers. (authors)

  2. Electrochromic Windows: Process and Fabrication Improvements for Lower Total Costs

    SciTech Connect (OSTI)

    Mark Burdis; Neil Sbar

    2007-03-31T23:59:59.000Z

    The overall goal with respect to the U.S. Department of Energy (DOE) is to achieve significant national energy savings through maximized penetration of EC windows into existing markets so that the largest cumulative energy reduction can be realized. The speed with which EC windows can be introduced and replace current IGU's (and current glazings) is clearly a strong function of cost. Therefore, the aim of this project was to investigate possible improvements to the SageGlass{reg_sign} EC glazing products to facilitate both process and fabrication improvements resulting in lower overall costs. The project was split into four major areas dealing with improvements to the electrochromic layer, the capping layer, defect elimination and general product improvements. Significant advancements have been made in each of the four areas. These can be summarized as follows: (1) Plasma assisted deposition for the electrochromic layer was pursued, and several improvements made to the technology for producing a plasma beam were made. Functional EC devices were produced using the new technology, but there are still questions to be answered regarding the intrinsic properties of the electrochromic films produced by this method. (2) The capping layer work was successfully implemented into the existing SageGlass{reg_sign} product, thereby providing a higher level of transparency and somewhat lower reflectivity than the 'standard' product. (3) Defect elimination is an ongoing effort, but this project spurred some major defect reduction programs, which led to significant improvements in yield, with all the implicit benefits afforded. In particular, major advances were made in the development of a new bus bar application process aimed at reducing the numbers of 'shorts' developed in the finished product, as well as making dramatic improvements in the methods used for tempering the glass, which had previously been seen to produce a defect which appeared as a pinhole. (4) Improvements have also been made to the overall product to enhance the appearance and market acceptability. These include: (i) increasing the active electrochromic area to enable window manufacturers to install the SageGlass{reg_sign} IGU's into a variety of different framing systems, (ii) implementing a Pb free solder system for the electrical interconnections, (iii) development of a wire routing scheme to allow installation of SageGlass{reg_sign} units into a variety of different framing systems. This project has advanced the development of electrochromic glazing significantly, thereby advancing the introduction of the product and all the benefits of such a technology.

  3. Lower Flathead River Fisheries Study, 1983 Annual Report.

    SciTech Connect (OSTI)

    DosSantos, Joseph M.; Darling, James E.; Cross, Paul D.

    1986-07-01T23:59:59.000Z

    In January of 1983 a two-phase study of the lower Flathead River was initiated by the Confederated Salish and Kootenai Tribes with funding provided by the Bonneville Power Administration. The study fulfills program measure 804 (a) (3) of the Columbia River Basin Fish and Wildlife Program. During 1983 Phase I of the study was completed resulting in a detailed study plan for the next four years and the methods to be employed during the study. Preliminary observations suggest the present operation of Kerr hydroelectric facility and land use practices within the drainage have combined to significantly reduce spawning success of salmonids and northern pike, and thus recruitment to the fisheries of the main river and tributaries. Main river spawning marshes were observed to be drained frequently during the northern pike spawning season which would result in desiccation of eggs and loss of attached fry. Water level fluctuations also caused trapping of juvenile fish and may be an important source of juvenile mortality.

  4. Operation of the Lower Granite Dam Adult Trap, 2008.

    SciTech Connect (OSTI)

    Harmon, Jerrel R.

    2009-01-01T23:59:59.000Z

    During 2008 we operated the adult salmonid trap at Lower Granite Dam from 7 March through 25 November, except during a short summer period when water temperatures were too high to safely handle fish. We collected and handled a total of 20,463 steelhead Oncorhynchus mykiss and radio-tagged 34 of the hatchery steelhead. We took scale samples from 3,724 spring/summer Chinook salmon O. tshawytscha for age and genetic analysis. We collected and handled a total of 8,254 fall Chinook salmon. Of those fish, 2,520 adults and 942 jacks were transported to Lyons Ferry Hatchery on the Snake River in Washington. In addition, 961 adults and 107 jacks were transported to the Nez Perce Tribal Hatchery on the Clearwater River in Idaho. The remaining 3,724 fall Chinook salmon were passed upstream. Scales samples were taken from 780 fall Chinook salmon tagged with passive integrated transponder (PIT) tags and collected by the sort-by-code system.

  5. Penetration and scattering of lower hybrid waves by density fluctuations

    SciTech Connect (OSTI)

    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

    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.

  6. Recovery Act: Electrochromic Glazing Technology: Improved Performance, Lower Price

    SciTech Connect (OSTI)

    Burdis, Mark; Sbar, Neil

    2012-06-30T23:59:59.000Z

    The growing dependency of the US on energy imports and anticipated further increases in energy prices reinforce the concerns about meeting the energy demand in the future and one element of a secure energy future is conservation. It is estimated that the buildings sector represents 40% of the US's total energy consumption. And buildings produce as much as one third of the greenhouse gas emissions primarily through fossil fuel usage during their operational phase. A significant fraction of this energy usage is simply due to inefficient window technology. Electrochromic (EC) windows allow electronic control of their optical properties so that the transparency to light can be adjusted from clear to dark. This ability to control the amount of solar energy allowed into the building can be advantageously used to minimize lighting, heating and air conditioning costs. Currently, the penetration of EC windows into the marketplace is extremely small, and consequently there is a huge opportunity for energy savings if this market can be expanded. In order to increase the potential energy savings it is necessary to increase the quantity of EC windows in operation. Additionally, any incremental improvement in the energy performance of each window will add to the potential energy savings. The overall goals of this project were therefore to improve the energy performance and lower the cost of dynamic (EC) smart windows for residential and commercial building applications. This project is obviously of benefit to the public by addressing two major areas: lowering the cost and improving the energy performance of EC glazings. The high level goals for these activities were: (i) to improve the range between the clear and the tinted state, (ii) reduce the price of EC windows by utilizing lower cost materials, (iii) lowering the U-Value1 SAGE Electrochromics Inc. is the only company in the US which has a track record of producing EC windows, and presently has a small operational factory in Faribault MN which is shipping products throughout the world. There is a much larger factory currently under construction close by. This project was targeted specifically to address the issues outlined above, with a view to implementation on the new high volume manufacturing facility. Each of the Tasks which were addressed in this project is relatively straightforward to implement in this new facility and so the benefits of the work will be realized quickly. , and (iv) ensure the proposed changes have no detrimental effect to the proven durability of the window. The research described here has helped to understand and provide solutions to several interesting and previously unresolved issues of the technology as well as make progress in areas which will have a significant impact on energy saving. In particular several materials improvements have been made, and tasks related to throughput and yield improvements have been completed. All of this has been accomplished without any detrimental effect on the proven durability of the SageGlass EC device. The project was divided into four main areas: 1. Improvement of the Properties of the EC device by material enhancements (Task 2); 2. Reduce the cost of production by improving the efficiency and yields of some key manufacturing processes (Task 3); 3. Further reduce the cost by significant modifications to the structure of the device (Task 4); 4. Ensure the durability of the EC device is not affected by any of the changes resulting from these activities (Task 5). A detailed description of the activities carried out in these areas is given in the following report, along with the aims and goals of the work. We will see that we have completed Tasks 2 and 3 fully, and the durability of the resulting device structure has been unaffected. Some of Task 4 was not carried out because of difficulties with integrating the installation of the required targets into the production coater due to external constraints not related to this project. We will also see that the durability of the devices produced as a result of this work was

  7. On equivalence relationships between classification and ranking algorithms

    E-Print Network [OSTI]

    Ertekin, Seyda

    We demonstrate that there are machine learning algorithms that can achieve success for two separate

  8. A Real-Time Soft Shadow Volume Algorithm

    E-Print Network [OSTI]

    Assarsson, Ulf

    algorithm to generate the hard shadows (umbra). The second pass compensates to provide the softness (penum

  9. Efficient Interpolation in the Guruswami-Sudan Algorithm

    E-Print Network [OSTI]

    Trifonov, Peter

    2010-01-01T23:59:59.000Z

    A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered as an extension of the Lee-O'Sullivan algorithm. The algorithm is shown to achieve both asymptotical and practical performance gain compared to the case of iterative interpolation algorithm. Further complexity reduction is achieved by integrating the proposed method with re-encoding. The key contribution of the paper, which enables the complexity reduction, is a novel randomized ideal multiplication algorithm.

  10. Axiomatic Tools versus Constructive approach to Unconventional Algorithms

    E-Print Network [OSTI]

    Gordana Dodig-Crnkovic; Mark Burgin

    2012-07-03T23:59:59.000Z

    In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the greater power of new types of algorithms also brought the greater complexity of the algorithmic universe, demanding new tools for its study. That is why we analyze new powerful tools brought forth by the axiomatic theory of algorithms, automata and computation.

  11. Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore's Law

    E-Print Network [OSTI]

    Palem, Krishna V.

    Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore opportunities for being energy-aware, the most fundamental limits are truly rooted in the physics of energy of models of computing for energy-aware al- gorithm design and analysis, culminating in establishing

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

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    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

  13. Adaptive Scheduling Algorithms for Planet Searches

    E-Print Network [OSTI]

    Eric B. Ford

    2007-12-17T23:59:59.000Z

    High-precision radial velocity planet searches have surveyed over ~2000 nearby stars and detected over ~200 planets. While these same stars likely harbor many additional planets, they will become increasingly challenging to detect, as they tend to have relatively small masses and/or relatively long orbital periods. Therefore, observers are increasing the precision of their observations, continuing to monitor stars over decade timescales, and also preparing to survey thousands more stars. Given the considerable amounts of telescope time required for such observing programs, it is important use the available resources as efficiently as possible. Previous studies have found that a wide range of predetermined scheduling algorithms result in planet searches with similar sensitivities. We have developed adaptive scheduling algorithms which have a solid basis in Bayesian inference and information theory and also are computationally feasible for modern planet searches. We have performed Monte Carlo simulations of plausible planet searches to test the power of adaptive scheduling algorithms. Our simulations demonstrate that planet searches performed with adaptive scheduling algorithms can simultaneously detect more planets, detect less massive planets, and measure orbital parameters more accurately than comparable surveys using a non-adaptive scheduling algorithm. We expect that these techniques will be particularly valuable for the N2K radial velocity planet search for short-period planets as well as future astrometric planet searches with the Space Interferometry Mission which aim to detect terrestrial mass planets.

  14. Lower hybrid current drive favoured by electron cyclotron radiofrequency heating

    SciTech Connect (OSTI)

    Cesario, R.; Cardinali, A.; Castaldo, C.; Marinucci, M.; Tuccillo, A. A. [Associazione EURATOM/ENEA sulla Fusione, Centro Ricerche Frascati, 00044, Frascati (Italy); Amicucci, L.; Galli, A. [Universit di Roma Sapienza, Dipartimento Ingegneria Elettronica, Rome (Italy); Giruzzi, G. [CEA, IRFM, F-13108 Saint-Paul-lez-Durance (France); Napoli, F.; Schettini, G. [Universit di Roma Tre, Dipartimento Ingegneria Elettronica, Rome (Italy)

    2014-02-12T23:59:59.000Z

    The important goal of adding to the bootstrap a fraction of non-inductive plasma current, which would be controlled for obtaining and optimizing steady-state profiles, can be reached by using the Current Drive produced by Lower Hybrid waves (LHCD). FTU (Frascati Tokamak Upgrade) experiments demonstrated, indeed, that LHCD is effective at reactor-graded high plasma density, and the LH spectral broadening is reduced, operating with higher electron temperature in the outer region of plasma column (T{sub e-periphery}). This method was obtained following the guidelines of theoretical predictions indicating that the broadening of launched spectrum produced by parametric instability (PI) should be reduced, and the LHCD effect at high density consequently enabled, under higher (T{sub e-periphery}). In FTU, the temperature increase in the outer plasma region was obtained by operating with reduced particle recycling, lithized walls and deep gas fuelling by means of fast pellet. Heating plasma periphery with electron cyclotron resonant waves (ECRH) will provide a further tool for achieving steady-state operations. New FTU experimental results are presented here, demonstrating that temperature effect at the plasma periphery, affecting LH penetration, occurs in a range of plasma parameters broader than in previous work. New information is also shown on the modelling assessing frequencies and growth rates of the PI coupled modes responsible of spectral broadening. Finally, we present the design of an experiment scheduled on FTU next campaign, where ECRH power is used to slightly increase the electron temperature in the outer plasma region of a high-density discharge aiming at restoring LHCD. Consequent to model results, by operating with a toroidal magnetic field of 6.3 T, useful for locating the electron cyclotron resonant layer at the periphery of the plasma column (r/a?0.8, f{sub 0}=144 GHz), an increase of T{sub e} in the outer plasma (from 40 eV to 80 eV at r/a?0.8) is expected by the JETTO code, sufficient for recovering LHCD. An ECRH power of 0.8 MW, and the standard FTU regime at high plasma density (n{sub eav}?1.310{sup 20}m{sup ?3} and plasma current of 0.5 MA) have been considered. The code has been set with transport modelling to reproduce the evolution of FTU kinetic profiles.

  15. Parallelism of the SANDstorm hash algorithm.

    SciTech Connect (OSTI)

    Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree

    2009-09-01T23:59:59.000Z

    Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.

  16. Quantum search algorithms on the hypercube

    E-Print Network [OSTI]

    Birgit Hein; Gregor Tanner

    2009-06-17T23:59:59.000Z

    We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi, Kempe and Whaley. We show that there exists a whole class of quantum search algorithms in the symmetry reduced space which perform a search of a marked vertex in time of order $\\sqrt{N}$ where $N = 2^n$, the number of vertices. In analogy to Grover's algorithm, the spatial search is effectively facilitated through a rotation in a two-level sub-space of the full Hilbert space. In the hypercube, these two-level systems are introduced through avoided crossings. We give estimates on the quantum states forming the 2-level sub-spaces at the avoided crossings and derive improved estimates on the search times.

  17. Conjugate gradient algorithms using multiple recursions

    SciTech Connect (OSTI)

    Barth, T.; Manteuffel, T.

    1996-12-31T23:59:59.000Z

    Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

  18. Pinning impulsive control algorithms for complex network

    SciTech Connect (OSTI)

    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

    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.

  19. Density equalizing map projections: A new algorithm

    SciTech Connect (OSTI)

    Merrill, D.W.; Selvin, S.; Mohr, M.S.

    1992-02-01T23:59:59.000Z

    In the study of geographic disease clusters, an alternative to traditional methods based on rates is to analyze case locations on a transformed map in which population density is everywhere equal. Although the analyst`s task is thereby simplified, the specification of the density equalizing map projection (DEMP) itself is not simple and continues to be the subject of considerable research. Here a new DEMP algorithm is described, which avoids some of the difficulties of earlier approaches. The new algorithm (a) avoids illegal overlapping of transformed polygons; (b) finds the unique solution that minimizes map distortion; (c) provides constant magnification over each map polygon; (d) defines a continuous transformation over the entire map domain; (e) defines an inverse transformation; (f) can accept optional constraints such as fixed boundaries; and (g) can use commercially supported minimization software. Work is continuing to improve computing efficiency and improve the algorithm.

  20. Density equalizing map projections: A new algorithm

    SciTech Connect (OSTI)

    Merrill, D.W.; Selvin, S.; Mohr, M.S.

    1992-02-01T23:59:59.000Z

    In the study of geographic disease clusters, an alternative to traditional methods based on rates is to analyze case locations on a transformed map in which population density is everywhere equal. Although the analyst's task is thereby simplified, the specification of the density equalizing map projection (DEMP) itself is not simple and continues to be the subject of considerable research. Here a new DEMP algorithm is described, which avoids some of the difficulties of earlier approaches. The new algorithm (a) avoids illegal overlapping of transformed polygons; (b) finds the unique solution that minimizes map distortion; (c) provides constant magnification over each map polygon; (d) defines a continuous transformation over the entire map domain; (e) defines an inverse transformation; (f) can accept optional constraints such as fixed boundaries; and (g) can use commercially supported minimization software. Work is continuing to improve computing efficiency and improve the algorithm.

  1. An Invitation to Algorithmic Information Theory

    E-Print Network [OSTI]

    G. J. Chaitin

    1996-09-17T23:59:59.000Z

    I'll outline the latest version of my limits of math course. The purpose of this course is to illustrate the proofs of the key information-theoretic incompleteness theorems of algorithmic information theory by means of algorithms written in a specially designed version of LISP. The course is now written in HTML with Java applets, and is available at http://www.research.ibm.com/people/c/chaitin/lm . The LISP now used is much friendlier than before, and because its interpreter is a Java applet it will run in the Netscape browser as you browse my limits of math Web site.

  2. Graph algorithms in the titan toolkit.

    SciTech Connect (OSTI)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01T23:59:59.000Z

    Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

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

    E-Print Network [OSTI]

    Lightsey, Glenn

    1 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 power PEMFC: H2 fuel DMFC: Methanol fuel Fuel cells vs. conventional #12;2 3 Fuel cells could change

  4. Impact of Lower PM from Multimode Operation on Fuel Penalty from...

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

    Regeneration Low engine-out PM emissions from HECC result in lower pressure drop rise rates across the DPF, less frequent DPF regeneration, and lower de-soot fuel penalty...

  5. FE's Advanced Combustion R&D Seeks Innovative Ways to Lower Cost...

    Office of Environmental Management (EM)

    Combustion R&D Seeks Innovative Ways to Lower Cost of Capturing Carbon Emissions from Coal Fired Power Plants FE's Advanced Combustion R&D Seeks Innovative Ways to Lower Cost of...

  6. Constraints on the composition of the Aleutian arc lower crust from

    E-Print Network [OSTI]

    Shillington, Donna J.

    Determining the bulk composition of island arc lower crust is essential for distinguishing between competing models for arc magmatism and assessing the stability of arc lower crust. We present new constraints on the ...

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

    E-Print Network [OSTI]

    Albertson, Andrea Kai

    1998-01-01T23:59:59.000Z

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

  8. Ten Ways to Lower Perceived Risk and Finance Rates within Utility...

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

    Ten Ways to Lower Perceived Risk and Finance Rates within Utility Contract Ten Ways to Lower Perceived Risk and Finance Rates within Utility Contract Federal agencies can use the...

  9. Temporal evolution of lower-hybrid waves in the of ponderomotivedensity fluctuations

    E-Print Network [OSTI]

    Karney, Charles

    of these results to the lower-hybrid heating experiment on Alcator-A. Nevertheless, there are indications

  10. Depositional environment of the "stringer sand" member, Lower Tuscaloosa Formation (Cretaceous), Mallalieu field, Mississippi

    E-Print Network [OSTI]

    Cook, Billy Charles

    1968-01-01T23:59:59.000Z

    with the lower Unit being subdivided into an upper "sand and shale section" a middle "marine section", and a lower "massive sand section". The Mississippi Geological Society (1957) subdivided the subsurface Tuscaloosa Group into the Upper, Marine, and Lower...) described the Lower Tuscaloosa Formation of southern Mississippi as a unit of "rapidly alternating sands and shales of shallow marine origin, overlying a nearly unbroken sand sec- tion of still shallower marine or continental origin". Braunstein ai. so...

  11. Effects of ozone cooling in the tropical lower stratosphere and upper troposphere

    E-Print Network [OSTI]

    Effects of ozone cooling in the tropical lower stratosphere and upper troposphere Piers M. Forster lower stratosphere and upper troposphere and elucidate the key role of ozone changes in driving of tropical ozone decreases at 70 hPa and lower pressures can lead to significant cooling not only

  12. Tube foot preservation in the Devonian crinoid Codiacrinus from the Lower Devonian Hunsruck Slate, Germany

    E-Print Network [OSTI]

    Kammer, Thomas

    Tube foot preservation in the Devonian crinoid Codiacrinus from the Lower Devonian Hunsruck Slate.W. 2013: Tube foot preservation in the Devonian crinoid Codiacrinus from the Lower Devonian Hunsruck Slate Follmann from the Lower Devonian Hunsruck Slate of Germany. This is the first definitive proof of tube feet

  13. Lower Bounds for Bounded Depth Frege Proofs via Pudlak-Buss Games

    E-Print Network [OSTI]

    Harsha, Prahladh

    19 Lower Bounds for Bounded Depth Frege Proofs via Pudlak-Buss Games ELI BEN-SASSON Technion. Our method uses the interpretation of proofs as two player games given by Pudlak and Buss. Our lower. 2010. Lower bounds for bounded depth Frege proofs via Pudlak- Buss games. ACM Trans. Comput. Logic, 11

  14. Data-flow algorithms for parallel matrix computations

    SciTech Connect (OSTI)

    O'Leary, D.P.; Stewart, G.W.

    1985-08-01T23:59:59.000Z

    This document develops some algorithms and tools for solving matrix problems on parallel-processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, the authors present algorithms that form the main modules for solving Liapounov matrix equations. They compare this approach to wave-front array processors and systolic arrays, and note its advantages in handling mis-sized problems, in evaluating variations of algorithms or architectures, in moving algorithms from system to system, and in debugging parallel algorithms on sequential machines.

  15. Blind Channel Equalization and -Approximation Algorithms

    E-Print Network [OSTI]

    Ye, Yinyu

    Blind Channel Equalization and #15;-Approximation Algorithms #3; Qingyu Li 1 , Er-Wei Bai 1 University of Iowa Iowa City, IA 52242 Abstract In this paper, we show that a blind equalizer can be obtained without using any sta- tistical information on the input by formulating the blind channel equalization

  16. Distributed Probabilistic Model-Building Genetic Algorithm

    E-Print Network [OSTI]

    Dongarra, Jack

    is considered by Principal Component Analysis (PCA) when the off- springs are generated. The island modelDistributed Probabilistic Model-Building Genetic Algorithm Tomoyuki Hiroyasu1 , Mitsunori Miki1), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design variables

  17. DISTRIBUTED EVENT LOCALIZATION AND TRACKING ALGORITHM (DELTA)

    E-Print Network [OSTI]

    Braun, Torsten

    in a distributed event localization and tracking algorithm (DELTA). DELTA is extended with energy-efficient network management, event classification functionality and an energy based source localization. The energy;#12;Abstract Different approaches to do event detection, tracking, localization and classification have been

  18. EFFICIENT SCALABLE ALGORITHMS FOR HIERARCHICALLY SEMISEPARABLE MATRICES

    E-Print Network [OSTI]

    Xia, Jianlin

    - tional accuracy can be limited, namely, in concert with the accuracy of the data. HSS Center of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Center for Computational and AppliedEFFICIENT SCALABLE ALGORITHMS FOR HIERARCHICALLY SEMISEPARABLE MATRICES SHEN WANG, XIAOYE S. LI

  19. Section Notes 3 The Simplex Algorithm

    E-Print Network [OSTI]

    Chen, Yiling

    Section Notes 3 The Simplex Algorithm Applied Math 121 Week of September 22, 2014 Goals for the week · understand how to get from an LP to a simplex tableau. · be familiar with reduced costs, optimal solutions, different types of variables and their roles. · understand the steps of simplex phases I and II

  20. Section Notes 3 The Simplex Algorithm

    E-Print Network [OSTI]

    Chen, Yiling

    Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week · understand how to get from an LP to a simplex tableau. · be familiar with reduced costs, optimal solutions, different types of variables and their roles. · understand the steps of simplex phases I and II. · be able

  1. Section Notes 3 The Simplex Algorithm

    E-Print Network [OSTI]

    Chen, Yiling

    Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 17, 2014 Goals for the week · understand how to get from an LP to a simplex tableau. · be familiar with reduced costs, optimal solutions, different types of variables and their roles. · understand the steps of simplex phases I and II. · be able

  2. STORAGE CAPACITY ALLOCATION ALGORITHMS FOR HIERARCHICAL

    E-Print Network [OSTI]

    Stavrakakis, Ioannis

    STORAGE CAPACITY ALLOCATION ALGORITHMS FOR HIERARCHICAL CONTENT DISTRIBUTION Nikolaos Laoutaris of Athens, 15784 Athens, Greece {laoutaris,vassilis,istavrak}@di.uoa.gr Abstract The addition of storage storage budget to the nodes of a hierarchical con- tent distribution system is formulated; optimal

  3. Wind Mill Pattern Optimization using Evolutionary Algorithms

    E-Print Network [OSTI]

    Wind Mill Pattern Optimization using Evolutionary Algorithms Charlie Vanaret ENAC , IRIT 7 av Ed 31062 Toulouse Cedex 9, France jean-marc.alliot@irit.fr ABSTRACT When designing a wind farm layout, we a grid, we can gain up to 3% of energy output on simple exam- ples of wind farms dealing with many

  4. Multicriteria Inventory Classification Using A Genetic Algorithm

    E-Print Network [OSTI]

    Güvenir, H. Altay

    Multicriteria Inventory Classification Using A Genetic Algorithm H. Altay Guvenir a;1 , and Erdal. The new crossover technique is applied to the prob­ lem of multicriteria inventory classification. The results are compared with the classical inventory classification technique using Analytical Hierarchy

  5. IPIANO: INERTIAL PROXIMAL ALGORITHM FOR NONCONVEX ...

    E-Print Network [OSTI]

    2014-06-28T23:59:59.000Z

    Department of Computer Science and with the BIOSS Centre for Biological Sig- ...... Natural image denoising by using student-t regularized MRF model (MRF-l2). The ..... Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H.H. .... Computational Mathematics and Mathematical Physics, 4 (1964), pp.

  6. Empirical Analysis of Transmission Power Control Algorithms

    E-Print Network [OSTI]

    Culler, David E.

    Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks Jaein Power saving techniques in WSN Duty-cycling, TX-power control, clustering We study effect of TX-power transmission. End-to-end delivery rate TX Power Control Best of Fixed TX Power El Batt [1] 36.5% 35.5% PCBL [6

  7. Distributed Power Control Algorithms for Wireless Networks

    E-Print Network [OSTI]

    Bertsekas, Dimitri

    Distributed Power Control Algorithms for Wireless Networks Cynara C. Wu Dimitri P. Bertsekas cynara Cambridge, MA 02139, USA Abstract Power control has been shown to be an e ective way to increase capacity in wireless systems. In previous work on power control, it has been assumed that power levels can be assigned

  8. A Treecode Algorithm for Regularized Particle Interactions

    E-Print Network [OSTI]

    Maryland at College Park, University of

    A Treecode Algorithm for Regularized Particle Interactions Robert Krasny University of Michigan = 400 Krasny (1986) 0.275 -0.275 y 0 2x t =0 t =1 t =2 t =3 t =4 #12;t = 1 , 0 = 0.2 = 0.15 = 0.1 = 0.05 #12;closeup , = 0.05 #12;comparison : experiment / simulation Didden (1979) Nitsche & Krasny

  9. Dynamic Algorithm for Space Weather Forecasting System

    E-Print Network [OSTI]

    Fischer, Luke D.

    2011-08-08T23:59:59.000Z

    /effective forecasts, and we have performed preliminary benchmarks on this algorithm. The preliminary benchmarks yield surprisingly effective results thus far?forecasts have been made 8-16 hours into the future with significant magnitude and trend accuracy, which is a...

  10. Radio Network Planning with Combinatorial Optimisation Algorithms

    E-Print Network [OSTI]

    Boyer, Edmond

    Radio Network Planning with Combinatorial Optimisation Algorithms P. Calégari, F. Guidec, P. Kuonen@c2r.tdf.fr Group: Software tools Abstract: Future UMTS radio planning engineers will face difficult, a software for the optimisation of the radio network is under development. Two mathematical models

  11. PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND

    E-Print Network [OSTI]

    Bader, David A.

    Chapter 5 PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND David A. Bader Department of Electrical & Computer Engineering, University of New Mexico dbader@ece.unm.edu William E. Hart Discrete Mathematics communication net- work enables synchronous inter-processor communication. Grid com- pute platforms exemplify

  12. A Fast Algorithm for Chebyshev, Fourier & Sinc

    E-Print Network [OSTI]

    Boyd, John P.

    A Fast Algorithm for Chebyshev, Fourier & Sinc Interpolation Onto an Irregular Grid John P. Boyd or Fourier series may be evaluated on the standard collocation grid by the Fast Fourier Transform (FFT with the interpolation points {xj}. The cardinal functions Cj(x) are linear combinations of the underlying Fourier

  13. Stochastic Distributed Algorithms for Target Surveillance

    E-Print Network [OSTI]

    Crespi, Valentino

    4 . Infor- mally, we want to deploy a number of ying UAV's (Unmanned Autonomous Vehicles of the performance of a system of autonomous agents. To this purpose we propose a class of semi-distributed stochastic navigation algorithms, that drive swarms of autonomous scouts to the surveillance of grounded

  14. Groundwater Remediation Strategy Using Global Optimization Algorithms

    E-Print Network [OSTI]

    Neumaier, Arnold

    Groundwater Remediation Strategy Using Global Optimization Algorithms Shreedhar Maskey1 ; Andreja Jonoski2 ; and Dimitri P. Solomatine3 Abstract: The remediation of groundwater contamination by pumping as decision variables. Groundwater flow and particle-tracking models MODFLOW and MODPATH and a GO tool GLOBE

  15. ALGORITHMS IN REAL ALGEBRAIC GEOMETRY: A SURVEY ...

    E-Print Network [OSTI]

    2014-09-07T23:59:59.000Z

    Sep 4, 2014 ... Even though the mathematical ideas behind cylindrical algebraic decom- position were .... It is a straightforward exercise to verify that the field of all Puiseux series in ? ...... However, one should keep in mind that even if one .... A probabilistic algorithm based on a similar divide-and-conquer strategy which.

  16. Evolutionary Algorithms for Definition Extraction Claudia Borg

    E-Print Network [OSTI]

    Pace, Gordon J.

    Evolutionary Algorithms for Definition Extraction Claudia Borg Dept. of I.C.S. University of Malta claudia.borg@um.edu.mt Mike Rosner Dept. of I.C.S. University of Malta mike.rosner@um.edu.mt Gordon Pace Dept. of Computer Science University of Malta gordon.pace@um.edu.mt Abstract Books and other text

  17. High performance parallel algorithms for incompressible flows

    E-Print Network [OSTI]

    Sambavaram, Sreekanth Reddy

    2002-01-01T23:59:59.000Z

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

  18. ZART: A Multifunctional Itemset Mining Algorithm

    E-Print Network [OSTI]

    Boyer, Edmond

    independent, multi-purposed data mining platform, incorporating a rich collection of data mining algorithms, allowing a number of auxiliary operations for preparing and filtering data, and, for interpreting in data mining today. Generating strong association rules from frequent itemsets often results in a huge

  19. Algorithms for GPS operation indoors and downtown

    E-Print Network [OSTI]

    Sahai, Anant

    Algorithms for GPS operation indoors and downtown Nainesh Agarwal Julien Basch Paul Beckmann Piyush Bharti Scott Bloebaum Stefano Casadei Andrew Chou Per Enge Wungkum Fong Neesha Hathi. Casadei A. Chou P. Enge W. Fong N. Hathi W. Mann J. Stone J. Tsitsiklis B. Van Roy

  20. Algorithms to Automate LCLS Undulator Tuning

    SciTech Connect (OSTI)

    Wolf, Zachary

    2010-12-03T23:59:59.000Z

    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.

  1. EISily looking for distant clusters of galaxies - - a new algorithm and its application to the EIS-wide data

    E-Print Network [OSTI]

    C. Lobo; A. Iovino; D. Lazzati; G. Chincarini

    2000-06-29T23:59:59.000Z

    We present a new algorithm to search for distant clusters of galaxies on catalogues deriving from imaging data, as those of the ESO Imaging Survey. Our algorithm is a matched filter one, similar to that adopted by Postman et al. (1996), aiming at identifying cluster candidates by using positional and photometric data simultaneously. The main novelty of our approach is that spatial and luminosity filter are run separately on the catalogue and no assumption is made on the typical size nor on the typical M* for clusters, as these parameters intervene in our algorithm as typical angular scale (sigma) and typical apparent magnitude m*. Moreover we estimate the background locally for each candidate, allowing us to overcome the hazards of inhomogeneous datasets. As a consequence our algorithm has a lower contamination rate - without loss of completeness - in comparison to other techniques, as tested through extensive simulations. We provide catalogues of galaxy cluster candidates as the result of applying our algorithm to the I-band data of the EIS-wide patches A and B.

  2. An investigation of Newton-Krylov algorithms for solving incompressible and low Mach number compressible fluid flow and heat transfer problems using finite volume discretization

    SciTech Connect (OSTI)

    McHugh, P.R.

    1995-10-01T23:59:59.000Z

    Fully coupled, Newton-Krylov algorithms are investigated for solving strongly coupled, nonlinear systems of partial differential equations arising in the field of computational fluid dynamics. Primitive variable forms of the steady incompressible and compressible Navier-Stokes and energy equations that describe the flow of a laminar Newtonian fluid in two-dimensions are specifically considered. Numerical solutions are obtained by first integrating over discrete finite volumes that compose the computational mesh. The resulting system of nonlinear algebraic equations are linearized using Newton`s method. Preconditioned Krylov subspace based iterative algorithms then solve these linear systems on each Newton iteration. Selected Krylov algorithms include the Arnoldi-based Generalized Minimal RESidual (GMRES) algorithm, and the Lanczos-based Conjugate Gradients Squared (CGS), Bi-CGSTAB, and Transpose-Free Quasi-Minimal Residual (TFQMR) algorithms. Both Incomplete Lower-Upper (ILU) factorization and domain-based additive and multiplicative Schwarz preconditioning strategies are studied. Numerical techniques such as mesh sequencing, adaptive damping, pseudo-transient relaxation, and parameter continuation are used to improve the solution efficiency, while algorithm implementation is simplified using a numerical Jacobian evaluation. The capabilities of standard Newton-Krylov algorithms are demonstrated via solutions to both incompressible and compressible flow problems. Incompressible flow problems include natural convection in an enclosed cavity, and mixed/forced convection past a backward facing step.

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

    SciTech Connect (OSTI)

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01T23:59:59.000Z

    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.

  4. Une dmonstration de la dcomposition de Dunford inspir de l'algorithme de Newton.

    E-Print Network [OSTI]

    Ressayre, Nicolas

    algorithme qui a le bon gout d'être très rapide). 2 Algorithme de Newton L'algorithme de Newton est un

  5. 6.854J / 18.415J Advanced Algorithms, Fall 2001

    E-Print Network [OSTI]

    Goemans, Michel

    A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...

  6. 6.854J / 18.415J Advanced Algorithms, Fall 1999

    E-Print Network [OSTI]

    Karger, David

    A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...

  7. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Distributed Algorithms for Constructing

    E-Print Network [OSTI]

    Khan, Maleq

    distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction, Energy-Efficient Algorithms, Minimum Spanning Tree, Wireless Networks, Sensor Network. I. OVERVIEW A

  8. Design algorithms for parallel transmission in magnetic resonance imaging

    E-Print Network [OSTI]

    Setsompop, Kawin

    2008-01-01T23:59:59.000Z

    The focus of this dissertation is on the algorithm design, implementation, and validation of parallel transmission technology in Magnetic Resonance Imaging (MRI). Novel algorithms are proposed which yield excellent excitation ...

  9. Blind Block Synchronization Algorithms in Cyclic Prefix Systems

    E-Print Network [OSTI]

    Vaidyanathan, P. P.

    Blind Block Synchronization Algorithms in Cyclic Prefix Systems Borching Su Department to solving the problem blindly, that is, where training symbols are not available. Blind symbol synchronization problem is especially important in many blind channel estimation algorithms in the literature

  10. Statistical Image Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission

    E-Print Network [OSTI]

    Fessler, Jeffrey A.

    Statistical Image Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission Scans by Hakan Erdogan Chair: Jeffrey A. Fessler Positron Emission Tomography (PET) is a diagnostic imaging tool that provides images

  11. LONG TERM FILE MIGRATION - PART II: FILE REPLACEMENT ALGORITHMS

    E-Print Network [OSTI]

    Jay Smith, Alan

    2011-01-01T23:59:59.000Z

    MIGRATION PART II: FILE REPLACEMENT ALGORITHMS Alan Jaymay vary even though replacement fi~~d the pa~ameter value PIe N - P ;, RT I r:. fILE REPLACEMENT ALGORITHMS. I.lan ~1ar

  12. Comparison of Generality Based Algorithm Variants for Automatic Taxonomy Generation

    E-Print Network [OSTI]

    Henschel, Andreas

    We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymannalgorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...

  13. Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms

    E-Print Network [OSTI]

    Gibbs, Trevor Howard

    2011-08-08T23:59:59.000Z

    of the genetic algorithm was analyzed through five different case scenarios, one involving a vertical well and four involving horizontal wells. The genetic algorithm approach is used to evaluate the effect of well placement in heterogeneous and anisotropic...

  14. Consensus Clustering Algorithms: Comparison and Refinement Andrey Goder

    E-Print Network [OSTI]

    Filkov, Vladimir

    -deterministic clustering algorithms, e.g. K-means, are sensitive to the choice of the initial seed clusters; running K-meansConsensus Clustering Algorithms: Comparison and Refinement Andrey Goder Vladimir Filkov Computer

  15. Provably Efficient Algorithms for Numerical Tensor Edgar Solomonik

    E-Print Network [OSTI]

    California at Berkeley, University of

    Provably Efficient Algorithms for Numerical Tensor Algebra Edgar Solomonik Electrical Engineering for Numerical Tensor Algebra by Edgar Solomonik A dissertation submitted in partial satisfaction-Gordon Fall 2014 #12;Provably Efficient Algorithms for Numerical Tensor Algebra Copyright 2014 by Edgar

  16. A multiscale approximation algorithm for the cardinality constrained knapsack problem

    E-Print Network [OSTI]

    Krishnan, Bharath Kumar

    2006-01-01T23:59:59.000Z

    I develop a multiscale approximation algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ...

  17. Understanding how Knowledge is exploited in Ant Algorithms

    E-Print Network [OSTI]

    McCallum, Thomas Edward Reid

    Ant algorithms were first written about in 1991 and since then they have been applied to many problems with great success. During these years the algorithms themselves have been modified for improved performance and also ...

  18. Adaptive Algorithms for the Rejection of Sinusoidal Disturbances

    E-Print Network [OSTI]

    Douglas, Scott C.

    Adaptive Algorithms for the Rejection of Sinusoidal Disturbances with Unknown Frequency Marc Bodson Abstract Two algorithms are presented for the rejection of sinusoidal disturbances with un known frequency presented in which frequency estimation and disturbance cancellation are performed simultaneously. Ap

  19. Optimization of advanced telecommunication algorithms from power and performance perspective

    E-Print Network [OSTI]

    Khan, Zahid

    2011-11-22T23:59:59.000Z

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

  20. A practical acceleration algorithm for real-time imaging

    E-Print Network [OSTI]

    Sumbul, Uygar

    A practical acceleration algorithm for real-time magnetic resonance imaging (MRI) is presented. Neither separate training scans nor embedded training samples are used. The Kalman filter based algorithm provides a fast and ...

  1. EM algorithm estimation of TCM scheme over multipath fading

    E-Print Network [OSTI]

    Gunawan, Wiedy

    1997-01-01T23:59:59.000Z

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

  2. Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...

    E-Print Network [OSTI]

    Saugata Basu

    2005-09-07T23:59:59.000Z

    Computing Covering by Contractible sets. Quadratic Case. Mayer-Vietoris Exact Sequence. Saugata Basu. Efficient Algorithms for Computing Betti Numbers...

  3. Quantum amplitude amplification algorithm: an explanation of availability bias

    E-Print Network [OSTI]

    Riccardo Franco

    2008-10-06T23:59:59.000Z

    In this article, I show that a recent family of quantum algorithms, based on the quantum amplitude amplification algorithm, can be used to describe a cognitive heuristic called availability bias. The amplitude amplification algorithm is used to define quantitatively the ease of a memory task, while the quantum amplitude estimation and the quantum counting algorithms to describe cognitive tasks such as estimating probability or approximate counting.

  4. Eigenvalue Problems and the LTSA Algorithm for Nonlinear ...

    E-Print Network [OSTI]

    Eigenvalue Problems and the LTSA Algorithm for Nonlinear Dimensionality Reduction Qiang Ye Department of Mathematics University of Kentucky Lexington,...

  5. Algorithm for anisotropic diffusion in hydrogen-bonded networks

    E-Print Network [OSTI]

    Edoardo Milotti

    2007-04-04T23:59:59.000Z

    In this paper I describe a specialized algorithm for anisotropic diffusion determined by a field of transition rates. The algorithm can be used to describe some interesting forms of diffusion that occur in the study of proton motion in a network of hydrogen bonds. The algorithm produces data that require a nonstandard method of spectral analysis which is also developed here. Finally, I apply the algorithm to a simple specific example.

  6. On the convergence of the expected improvement algorithm

    E-Print Network [OSTI]

    Vazquez, Emmanuel

    2007-01-01T23:59:59.000Z

    This note deals with the convergence of the Expected Improvement (EI) algorithm. Several interesting open problems raised.

  7. A Flexible Reservation Algorithm for Advance Network Provisioning

    E-Print Network [OSTI]

    Balman, Mehmet

    2010-01-01T23:59:59.000Z

    A Flexible Reservation Algorithm for Advance Networkusers requirements. Flexible Network Reservation: Wea new service, called Flexible Network Reservation Service,

  8. Simplex Algorithm Math 364: Principles of Optimization, Lecture 8

    E-Print Network [OSTI]

    Li, Haijun

    Simplex Algorithm Math 364: Principles of Optimization, Lecture 8 Haijun Li lih of Optimization, Lecture 8 Spring 2012 1 / 16 #12;Simplex Algorithm Standard Form Convert an LP problem with m 2012 2 / 16 #12;Simplex Algorithm Standard Form Convert an LP problem with m constraints into standard

  9. Manuscript Number:2098 Improvements to Platt's SMO Algorithm for

    E-Print Network [OSTI]

    Keerthi, S. Sathiya

    Manuscript Number:2098 Improvements to Platt's SMO Algorithm for SVM Classi#12;er Design S; Improvements to Platt's SMO Algorithm for SVM Classi#12;er Design S.S. Keerthi, S.K. Shevade, C. Bhattacharyya?ciency in Platt's Sequential Minimal Optimization (SMO) algorithm that is caused by the use of a single threshold

  10. ICE Algorithm for the Shocktube Problem Oren E. Livne

    E-Print Network [OSTI]

    Utah, University of

    1 ICE Algorithm for the Shocktube Problem Oren E. Livne UUSCI-2006-007 Scientific Computing the main ICE advection algorithm for scalar advection problems (advection and Burg- ers step in this original Kashiwa ICE algorithm [Kas00], and its relation of both the Davis scheme [Dav87

  11. The Fast Multipole Algorithm on the Cell Broadband Engine Architecture

    E-Print Network [OSTI]

    McCreath, Eric Charles

    The Fast Multipole Algorithm on the Cell Broadband Engine Architecture Christopher Fraser (u4395190 capability. One such algorithm is Greengard and Rohklin's Fast Multipole Algorithm (FMA), which computes potentials for groups of particles via multipole approximations. In this way, the number of computations

  12. A low memory, highly concurrent multigrid algorithm Mark F. Adams

    E-Print Network [OSTI]

    Adams, Mark

    A low memory, highly concurrent multigrid algorithm Mark F. Adams Abstract We examine what., the continued increase in the number of transistors on a chip, requires that algorithms be highly concurrent;engineers and may require that we develop algorithms for radically different machine models with respect

  13. WorstCase Analysis of Weber's GCD Algorithm

    E-Print Network [OSTI]

    Lavault, Christian

    Worst­Case Analysis of Weber's GCD Algorithm Christian Lavault a;1 , S. Mohamed Sedjelmaci a a LIPN, Universit'e Paris­Nord, 93430 Villetaneuse, France Abstract Recently, Ken Weber introduced an algorithm for N(k), the maximal number of iterations in the loop of Weber's GCD algorithm. Key words: Integer

  14. The global k-means clustering algorithm Aristidis Likasa,

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    The global k-means clustering algorithm Aristidis Likasa, Nikos Vlassisb Jakob J. Verbeekb,jverbeek}@science.uva.nl Abstract We present the global k-means algorithm which is an incremental approach to clustering (with N being the size of the data set) executions of the k-means algorithm from suitable initial

  15. An Empirical Evaluation of Genetic Algorithms on Noisy Objective Functions

    E-Print Network [OSTI]

    Whitley, Darrell

    combined with a local search algorithm were carried out for a seismic data interpretation problem known specifically designed for the seismic data interpretation problem. Seismic reflection surveys are used seismic data imaging problem. Keywords: genetic algorithms, delta coding, CHC adaptive search algorithm

  16. Jitter-based analysis and discussion of burst assembly algorithms

    E-Print Network [OSTI]

    Aracil, Javier

    Jitter-based analysis and discussion of burst assembly algorithms Javier Aracil, Jose Alberto Hern a jitter analysis of size-based burst assembly algorithms and also discusses other burst assem- bly algorithms that use the packet delay as the assembly threshold to provide a bound on jitter. Index Terms

  17. A quantum algorithm for Viterbi decoding of classical convolutional codes

    E-Print Network [OSTI]

    Jon R. Grice; David A. Meyer

    2014-05-29T23:59:59.000Z

    We present a quantum Viterbi algorithm with better than classical performance under certain conditions (for decoding convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$). The algorithm exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm.

  18. A Fast Algorithm for Data Mining CS 297 Report

    E-Print Network [OSTI]

    Pollett, Chris

    A Fast Algorithm for Data Mining CS 297 Report Aarathi Raghu Advisor: Dr.Chris Pollett December 2005 #12;A Fast Algorithm For Data Mining Abstract This report describes the data mining algorithms implemented and lessons learned during the course of my CS 297. Data Mining is a growing field and a plethora

  19. GREIT: towards a consensus EIT algorithm for lung images

    E-Print Network [OSTI]

    Adler, Andy

    GREIT: towards a consensus EIT algorithm for lung images Andy Adler1 , John Arnold2 , Richard in the patient's lungs. However, most clinical and physiological research in lung EIT is done using older reconstruction algorithm for lung EIT, called GREIT (Graz consensus Reconstruc- tion algorithm for EIT

  20. Fast computation algorithms for speckle pattern simulation

    SciTech Connect (OSTI)

    Nascov, Victor; Samoil?, Cornel; Ursu?iu, Doru [Transylvania University of Braov (Romania)

    2013-11-13T23:59:59.000Z

    We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.

  1. Approximation algorithms for QMA-complete problems

    E-Print Network [OSTI]

    Sevag Gharibian; Julia Kempe

    2011-01-20T23:59:59.000Z

    Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.

  2. Abstract A Hierarchical Algorithm for Radiosity Daylighting

    E-Print Network [OSTI]

    Gonzalo Besuievsky; Ignacio Martin

    A new daylight simulation method for radiosity environments is presented. Daylight illumination is transported in a first step where sun and sky are represented as a set of directional sources. Light is transported using parallel projections of these sources. The scene mesh is adaptively subdivided using energy and visibility criteria obtained from a extended scan-line algorithm that computes a layered depth image for each projection. In a second step, diffuse intereflection is computed through a hierarchical Monte Carlo radiosity algorithm. The method is feasible for it extension for environments containing specular surfaces. Relative short time view-independent global illumination results can be obtained with the proposed method, which make it suitable for daylight building design and analysis applications for both indoors and outdoors environments. 1

  3. The Deng algorithm in higher dimensions

    E-Print Network [OSTI]

    Y. Nyonyi; S. D. Maharaj; K. S. Govinder

    2014-12-28T23:59:59.000Z

    We extend an algorithm of Deng in spherically symmetric spacetimes to higher dimensions. We show that it is possible to integrate the generalised condition of pressure isotropy and generate exact solutions to the Einstein field equations for a shear-free cosmological model with heat flow in higher dimensions. Three new metrics are identified which contain results of four dimensions as special cases. We show graphically that the matter variables are well behaved and the speed of sound is causal.

  4. PID Parameters Optimization by Using Genetic Algorithm

    E-Print Network [OSTI]

    Mirzal, Andri; Furukawa, Masashi

    2012-01-01T23:59:59.000Z

    Time delays are components that make time-lag in systems response. They arise in physical, chemical, biological and economic systems, as well as in the process of measurement and computation. In this work, we implement Genetic Algorithm (GA) in determining PID controller parameters to compensate the delay in First Order Lag plus Time Delay (FOLPD) and compare the results with Iterative Method and Ziegler-Nichols rule results.

  5. Search for gravitational wave bursts by wavelet packet decomposition: The detection algorithm

    SciTech Connect (OSTI)

    Camarda, M.; Ortolan, A. [Dipartimento di Ingegneria dell'Informazione, Via Gradenigo, 6/B, 35131 Padova (Italy); INFN Laboratori Nazionali di Legnaro, I-35020 Legnaro, Padova (Italy); INFN Laboratori Nazionali di Legnaro, I-35020 Legnaro, Padova (Italy)

    2006-09-15T23:59:59.000Z

    We present a novel method based on wavelet packet transformation for detection of gravitational wave (gw) bursts embedded in additive Gaussian noise. The method exploits a wavelet packet decomposition of observed data and performs detection of bursts at multiple time-frequency resolutions by the extreme value statistics. We discuss the performances of detection algorithms (efficiency and robustness) in the general framework of hypothesis testing. In particular, we compare the performances of wavelet packet (WP), matched filter (MF), and power filter (PF) algorithms by means of a complete Monte Carlo simulation of the output of a gw detector, with the detection efficiencies of MF and PF playing the role of upper and lower bounds, respectively. Moreover, the performances of impulsive filter (IF) algorithm, widely used in the data analysis of resonant gw detectors, have been investigated. Results we get by injecting chirplet signals confirm the expected performances in terms of efficiency and robustness. To illustrate the application of the new method to real data, we analyzed a few data sets of the resonant gw detector AURIGA.

  6. Efficient scalable algorithms for hierarchically semiseparable matrices

    SciTech Connect (OSTI)

    Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de

    2011-09-14T23:59:59.000Z

    Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the #12;ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the #12;first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.

  7. Depositional environment of lower cretaceous Mitchell sandstone, St. Mary and Duty fields, Lafayette County, Arkansas

    E-Print Network [OSTI]

    Mazzullo, Elsa Kapitan

    1983-01-01T23:59:59.000Z

    County, Arkansas. Series Group Subgroup Formation Field Number Washita Fredericksburg Paluxy Mooringsport Ferry Lake Comanchean Trinity Glen Rose Shale and limestone First lower anhydrite stringer Hill Sandstone Rodessa Second lower...DEPOSITIONAL ENVIRONMENT OF LOWER CRETACEOUS MITCHELL SANDSTONE, ST. MARY AND DUTY FIELDS, LAFAYETTE COUNTY, ARKANSAS A Thesis by ELSA KAPITAN MAZZULLO Submitted to the Graduate College of Texas A&M University in partial fulfillment...

  8. A 1:52-Approximation Algorithm for the Uncapacitated Facility Location Problem

    E-Print Network [OSTI]

    Ye, Yinyu

    A 1:52-Approximation Algorithm for the Uncapacitated Facility Location Problem Mohammad Mahdian #3: Approximation Algorithms for UFLP 2 Algorithm In [5], Jain, Mahdian, and Saberi proposed a greedy algorithm

  9. A Unified Differential Evolution Algorithm for Global Optimization

    SciTech Connect (OSTI)

    Qiang, Ji; Mitchell, Chad

    2014-06-24T23:59:59.000Z

    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.

  10. An investigation of two network flow optimization algorithms

    E-Print Network [OSTI]

    Steelquist, John Anders

    1973-01-01T23:59:59.000Z

    in Chapter V. The program listing for the Out-of-Kilter algorithm and the SUP ERKIL algorithm can be found in Appendix B and Appendix C. These algorithms are applied to network flow problems. Network flow problems are solved through the application... applications. [ [4 5 12 161 Some of these have clarified and extended the range of applications of the Out-of-Kilter algorithm. Several computer codes have been written to apply the Out-of- Kilter algorithm to actual problems. The code used...

  11. Adaptive optimal control: an algorithm for direct digital control

    SciTech Connect (OSTI)

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

    1980-01-01T23:59:59.000Z

    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.

  12. Lower Bound of Concurrence and Distillation for Arbitrary Dimensional Bipartite Quantum States

    E-Print Network [OSTI]

    Zhao, Ming-Jing; Fei, Shao-Ming; Li-Jost, Xianqing; 10.1103/PhysRevA.84.062322

    2011-01-01T23:59:59.000Z

    We present a lower bound of concurrence for arbitrary dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method, and by showing the distillability of mixed states that can not be recognized by other distillability criteria.

  13. Lower Bound of Concurrence and Distillation for Arbitrary Dimensional Bipartite Quantum States

    E-Print Network [OSTI]

    Ming-Jing Zhao; Xue-Na Zhu; Shao-Ming Fei; Xianqing Li-Jost

    2011-12-23T23:59:59.000Z

    We present a lower bound of concurrence for arbitrary dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient criterion of distillability of quantum entanglement. The significance of our result is illustrated by quantitative evaluation of entanglement for entangled states that fail to be identified by the usual concurrence estimation method, and by showing the distillability of mixed states that can not be recognized by other distillability criteria.

  14. Inventory of Existing Programs and Activities in the Lower Willamette Subbasin

    E-Print Network [OSTI]

    1 Appendix O Inventory of Existing Programs and Activities in the Lower Willamette Subbasin Within partnerships, inventories, manuals, regulations, and individual projects for the subbasin's land, streams

  15. Using Data-Focused Tools to Assess Lower Vehicle Energy Use (Presentation)

    SciTech Connect (OSTI)

    Walkowicz, K.

    2013-05-01T23:59:59.000Z

    This presentation, 'Using Data-Focused Tools to Assess Lower Vehicle Energy Use,' was presented at the Green Truck Summit 2013; March 5, 2013, Indianapolis, IN.

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

    E-Print Network [OSTI]

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

    2012-10-24T23:59:59.000Z

    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.

  17. An Adaptive Unified Differential Evolution Algorithm for Global Optimization

    SciTech Connect (OSTI)

    Qiang, Ji; Mitchell, Chad

    2014-11-03T23:59:59.000Z

    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.

  18. A Novel Algorithm for Solving the LPN Problem and its Application to Security Evaluation of the

    E-Print Network [OSTI]

    algorithm appears as more powerful than the best one previously reported known as the BKW algorithm. In fact the BKW algorithm is shown to be a special instance of the proposed algorithm, but without optimized. The proposed algorithm has been compared with the best previously reported one, namely the BKW algorithm

  19. Why Are Residential PV Prices in Germany So Much Lower Than in the United States?

    E-Print Network [OSTI]

    Why Are Residential PV Prices in Germany So Much Lower Than in the United States? A Scoping is significantly lower in Germany than in the U.S., due primarily to differences in "soft" costs But relatively consultant data relevant to the cost structure of residential PV in Germany Focus is the pre

  20. Distribution of Clay Minerals in Lower Cook Inlet and Kodiak Shelf Sediment, Alaska

    E-Print Network [OSTI]

    Distribution of Clay Minerals in Lower Cook Inlet and Kodiak Shelf Sediment, Alaska James R. llein-five surface samples from lower Cook Inlet and forty-three from Kodiak shelf, Alaska, were analyzed for clay percentages of clay minerals. This is because modern ocean currents vigorously rework surficial sediment

  1. Evolving research directions in Surface OceanLower Atmosphere (SOLAS) science

    E-Print Network [OSTI]

    Evolving research directions in Surface OceanLower Atmosphere (SOLAS) science Cliff S. LawLower Atmosphere Study (SOLAS) coordinates multi-disciplinary ocean atmosphere research projects that quantify and characterise this exchange. This article details five new SOLAS research strategies upwellings and associated

  2. Pricing the American Put Using A New Class of Tight Lower Bounds Malik Magdon-Ismail

    E-Print Network [OSTI]

    Magdon-Ismail, Malik

    , and an important issue is the trade off between the pricing accuracy and the computational cost. Our approachPricing the American Put Using A New Class of Tight Lower Bounds Malik Magdon-Ismail Department of lower bounds for the price of the American put option on a dividend paying stock when the stock follows

  3. Soluble Epoxide Hydrolase Inhibition Lowers Arterial Blood Pressure in Angiotensin II Hypertension

    E-Print Network [OSTI]

    Hammock, Bruce D.

    Soluble Epoxide Hydrolase Inhibition Lowers Arterial Blood Pressure in Angiotensin II HypertensionEH) would lower blood pressure in angiotensin II (Ang II) hypertension. Rat renal cortical tissue/min). Renal cortical sEH protein expression was significantly higher in Ang II hypertension compared

  4. Global empirical wind model for the upper mesosphere/lower thermosphere. I. Prevailing wind

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    Global empirical wind model for the upper mesosphere/lower thermosphere. I. Prevailing wind Y. I. An updated empirical climatic zonally aver- aged prevailing wind model for the upper mesosphere/ lower of monthly mean winds from meteor radar and MF radar measurements at more than 40 stations, well distributed

  5. LOWER BOUNDS ON THE GLOBAL MINIMUM OF A M. GHASEMI, J.B. LASSERRE, M. MARSHALL

    E-Print Network [OSTI]

    Marshall, Murray

    LOWER BOUNDS ON THE GLOBAL MINIMUM OF A POLYNOMIAL M. GHASEMI, J.B. LASSERRE, M. MARSHALL Abstract. We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain compare this bound with the (global) lower bound fgp ob- tained by Ghasemi and Marshall, and also

  6. Sound velocities of ferropericlase in the Earth's lower mantle Jung-Fu Lin,1

    E-Print Network [OSTI]

    Lin, Jung-Fu "Afu"

    . Introduction [2] The speed of seismic waves in the Earth's lower mantle is governed by the elastic properties a dramatic increase in the isothermal bulk modulus (KT) and bulk sound velocity (VF) at the electronic spinSound velocities of ferropericlase in the Earth's lower mantle Jung-Fu Lin,1 Steven D. Jacobsen,2

  7. Current ramp-up with lower hybrid current drive in EAST B. J. Ding,1

    E-Print Network [OSTI]

    Current ramp-up with lower hybrid current drive in EAST B. J. Ding,1 M. H. Li,1 N. J. Fisch,2 H hybrid current drive. The first stage of cyclic operation would be to ramp up the plasma current with lower hybrid waves alone in low-density plasma. Such a current ramp-up was carried out successfully

  8. Lower-Bound Estimation for Multi-Bitwidth Scheduling Junjuan Xu*+

    E-Print Network [OSTI]

    Cong, Jason "Jingsheng"

    the design space more efficiently, lower-bound estimation of resources, as well as performance, has been][3][4][7][8][9][10]. Since the area cost of resources is directly related to the bitwidth configuration, the objectiveLower-Bound Estimation for Multi-Bitwidth Scheduling Junjuan Xu*+ , Jason Cong+ , Xu Cheng

  9. AN ANALYSIS OF COORDINATED OPERATION OF LAKES POWELL & MEAD UNDER LOWER RESERVOIR CONDITIONS

    E-Print Network [OSTI]

    of documents dating as early as 1922. The hydrology of the Colorado River is highly variable and water managers the Upper and Lower Basin vulnerability to shortage and unprotected power pools. This thesis explores and reservoir-based recreation), Lower Basin and Mexico shortage frequency and magnitude and basin

  10. The viscosity of Earth's lower mantle inferred from sinking speed of subducted lithosphere

    E-Print Network [OSTI]

    Cizkova, Hana

    The viscosity of Earth's lower mantle inferred from sinking speed of subducted lithosphere Hana 2012 Available online 20 February 2012 Keywords: Lower mantle viscosity Slab sinking velocity a b s t r a c t The viscosity of the mantle is indispensable for predicting Earth's mechanical behavior

  11. OSL ages on glaciofluvial sediment in northern Lower Michigan constrain expansion of the Laurentide ice sheet

    E-Print Network [OSTI]

    Schaetzl, Randall

    , Michigan State University, East Lansing, MI 48824-1117, USA b Department of Earth and Environmental for the MIS 2 (late Wisconsin) advance into central northern Lower Michigan. We suggest that widespread ice chronologic control on the advancing MIS 2 ice margin in this part of Lower Michigan and refine the under

  12. A new, lower value of total solar irradiance: Evidence and climate significance

    E-Print Network [OSTI]

    data. TIM's lower solar irradiance value is not a change in the Sun's output, whose variationsA new, lower value of total solar irradiance: Evidence and climate significance Greg Kopp1 14 January 2011. [1] The most accurate value of total solar irradiance during the 2008 solar minimum

  13. Status and Plans for C-Mod Lower Hybrid and Advanced Tokamak Program

    E-Print Network [OSTI]

    Control: Lower Hybrid Current Drive system Designed for well controlled spectrum. Each antennaAlcator C-Mod Status and Plans for C-Mod Lower Hybrid and Advanced Tokamak Program ITPA topical fuelling or momentum drive. All RF heating and CD. C-Mod (5 s) JT60-U (10 s) JET (50 s) ITER (1000s) DIII

  14. Historical Ecology of the lower santa clara river, Ventura river, and oxnard Plain

    E-Print Network [OSTI]

    Historical Ecology of the lower santa clara river, Ventura river, and oxnard Plain: an analysis. Historical ecology of the lower Santa Clara River,Ventura River, and Oxnard Plain: an analysis of terrestrial layers are available on SFEI's website, at www.sfei.org/projects/VenturaHE. Permissions rights for images

  15. Nuclear Engineering and Design 189 (1999) 757 Lower head integrity under steam explosion loads

    E-Print Network [OSTI]

    Yuen, Walter W.

    Nuclear Engineering and Design 189 (1999) 7­57 Lower head integrity under steam explosion loads T Received 24 August 1998; accepted 24 November 1998 Abstract Lower head integrity under steam explosion is `physically unreasonable'. © 1999 Elsevier Science S.A. All rights reserved. Keywords: Steam explosions

  16. Testing the Accuracy of Redshift Space Group Finding Algorithms

    E-Print Network [OSTI]

    James J. Frederic

    1994-09-07T23:59:59.000Z

    Using simulated redshift surveys generated from a high resolution N-body cosmological structure simulation, we study algorithms used to identify groups of galaxies in redshift space. Two algorithms are investigated; both are friends-of-friends schemes with variable linking lengths in the radial and transverse dimensions. The chief difference between the algorithms is in the redshift linking length. The algorithm proposed by Huchra \\& Geller (1982) uses a generous linking length designed to find ``fingers of god'' while that of Nolthenius \\& White (1987) uses a smaller linking length to minimize contamination by projection. We find that neither of the algorithms studied is intrinsically superior to the other; rather, the ideal algorithm as well as the ideal algorithm parameters depend on the purpose for which groups are to be studied. The Huchra/Geller algorithm misses few real groups, at the cost of including some spurious groups and members, while the Nolthenius/White algorithm misses high velocity dispersion groups and members but is less likely to include interlopers in its group assignments. In a companion paper we investigate the accuracy of virial mass estimates and clustering properties of groups identified using these algorithms.

  17. Odd orders in Shor's factoring algorithm

    E-Print Network [OSTI]

    Thomas Lawson

    2015-01-13T23:59:59.000Z

    Shor's factoring algorithm (SFA) finds the prime factors of a number, $N=p_1 p_2$, exponentially faster than the best known classical algorithm. Responsible for the speed-up is a subroutine called the quantum order finding algorithm (QOFA) which calculates the order -- the smallest integer, $r$, satisfying $a^r \\mod N =1$, where $a$ is a randomly chosen integer coprime to $N$ (meaning their greatest common divisor is one, $\\gcd(a, N) =1$). Given $r$, and with probability not less than $1/2$, the factors are given by $p_1 = \\gcd (a^{\\frac{r}{2}} - 1, N)$ and $p_2 = \\gcd (a^{\\frac{r}{2}} + 1, N)$. For odd $r$ it is assumed the factors cannot be found (since $a^{\\frac{r}{2}}$ is not generally integer) and the QOFA is relaunched with a different value of $a$. But a recent paper [E. Martin-Lopez: Nat Photon {\\bf 6}, 773 (2012)] noted that the factors can sometimes be found from odd orders if the coprime is square. This raises the question of improving SFA's success probability by considering odd orders. We show that an improvement is possible, though it is small. We present two techniques for retrieving the order from apparently useless runs of the QOFA: not discarding odd orders; and looking out for new order finding relations in the case of failure. In terms of efficiency, using our techniques is equivalent to avoiding square coprimes and disregarding odd orders, which is simpler in practice. Even still, our techniques may be useful in the near future, while demonstrations are restricted to factoring small numbers. The most convincing demonstrations of the QOFA are those that return a non-power-of-two order, making odd orders that lead to the factors attractive to experimentalists.

  18. Light Glueball masses using the Multilevel Algorithm

    E-Print Network [OSTI]

    Sourav Mondal; Pushan Majumdar; Nilmani Mathur

    2014-11-13T23:59:59.000Z

    Following the multilevel scheme we present an error reduction algorithm for extracting glueball masses from monte-carlo simulations of pure SU(3) lattice gauge theory. We look at the two lightest states viz. the $0^{++}$ and $2^{++}$. Our method involves looking at correlations between large Wilson loops and does not require any smearing of links. The error bars we obtain are at the moment comparable to those obtained using smeared operators. We also present a comparison of our method with the naive method.

  19. Election algorithms in asynchronous mesh networks

    E-Print Network [OSTI]

    Veeramacheneni, Ramu

    1992-01-01T23:59:59.000Z

    complexity in electing a single leader for an asynchronous square mesh network. Also, the other idea is to ensure no deadlocks. Peterson designed an election algorithm for asynchronous square meshes that uses about 100n messages in the worst case. When run... Claim 2. 3. 1 Claim 2. 3. 1-Case 2 30 31 Claim 2. 3. 1-Case 2. 2 32 10 Claim 2. 4. 1 Claim 2, 4. 1-Case 2 34 12 Lemma 3 36 13 14 Claim 4. 1 Claim 4. 2 Claim 4. 3. 1 37 38 39 Claim 4. 3, 1-Case 2. 2 40 17 Claim 4. 4. 1-Case 2 41 18 Claim...

  20. A Monte Carlo algorithm for degenerate plasmas

    SciTech Connect (OSTI)

    Turrell, A.E., E-mail: a.turrell09@imperial.ac.uk; Sherlock, M.; Rose, S.J.

    2013-09-15T23:59:59.000Z

    A procedure for performing Monte Carlo calculations of plasmas with an arbitrary level of degeneracy is outlined. It has possible applications in inertial confinement fusion and astrophysics. Degenerate particles are initialised according to the FermiDirac distribution function, and scattering is via a Pauli blocked binary collision approximation. The algorithm is tested against degenerate electronion equilibration, and the degenerate resistivity transport coefficient from unmagnetised first order transport theory. The code is applied to the cold fuel shell and alpha particle equilibration problem of inertial confinement fusion.

  1. Student's algorithm solves real-world problem

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of ScienceandMesa del SolStrengthening a solid ... Strengthening aStructureStudentStudent's algorithm

  2. An algorithm for recognising the exterior square of a matrix Keywords: matrix, exterior square, algorithm

    E-Print Network [OSTI]

    Greenhill, Catherine

    vector space, with respect to a canonical basis, is called the exterior square of X. Note that all vectorAn algorithm for recognising the exterior square of a matrix Keywords: matrix, exterior square the exterior square of a matrix. The approach involves manipulation of the equations which relate the entries

  3. Predicting Polymeric Crystal Structures by Evolutionary Algorithms

    E-Print Network [OSTI]

    Qiang Zhu; Vinit Sharma; Artem R Oganov; Rampi Ramprasad

    2014-06-05T23:59:59.000Z

    The recently developed evolutionary algorithm USPEX proved to be a tool that enables accurate and reliable prediction of structures for a given chemical composition. Here we extend this method to predict the crystal structure of polymers by performing constrained evolutionary search, where each monomeric unit is treated as one or several building blocks with fixed connectivity. This greatly reduces the search space and allows the initial structure generation with different sequences and packings using these blocks. The new constrained evolutionary algorithm is successfully tested and validated on a diverse range of experimentally known polymers, namely polyethylene (PE), polyacetylene (PA), poly(glycolic acid) (PGA), poly(vinyl chloride) (PVC), poly(oxymethylene) (POM), poly(phenylene oxide) (PPO), and poly (p-phenylene sulfide) (PPS). By fixing the orientation of polymeric chains, this method can be further extended to predict all polymorphs of poly(vinylidene fluoride) (PVDF), and the complex linear polymer crystals, such as nylon-6 and cellulose. The excellent agreement between predicted crystal structures and experimentally known structures assures a major role of this approach in the efficient design of the future polymeric materials.

  4. Fast k-means algorithm clustering

    E-Print Network [OSTI]

    Salman, Raied; Li, Qi; Strack, Robert; Test, Erik

    2011-01-01T23:59:59.000Z

    k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is large (for example more than 500millions of points). We propose a two stage algorithm to reduce the time cost of distance calculation for huge datasets. The first stage is a fast distance calculation using only a small portion of the data to produce the best possible location of the centers. The second stage is a slow distance calculation in which the initial centers used are taken from the first stage. The fast and slow stages represent the speed of the movement of the centers. In the slow stage, the whole dataset can be used to get the exact location of the centers. The time cost of the distance calculation for the fast stage is very low due to the small size of the training data chosen. The time cost of the distance calculation for the slow stage is also mi...

  5. Nonextensive lattice gauge theories: algorithms and methods

    E-Print Network [OSTI]

    Rafael B. Frigori

    2014-04-26T23:59:59.000Z

    High-energy phenomena presenting strong dynamical correlations, long-range interactions and microscopic memory effects are well described by nonextensive versions of the canonical Boltzmann-Gibbs statistical mechanics. After a brief theoretical review, we introduce a class of generalized heat-bath algorithms that enable Monte Carlo lattice simulations of gauge fields on the nonextensive statistical ensemble of Tsallis. The algorithmic performance is evaluated as a function of the Tsallis parameter q in equilibrium and nonequilibrium setups. Then, we revisit short-time dynamic techniques, which in contrast to usual simulations in equilibrium present negligible finite-size effects and no critical slowing down. As an application, we investigate the short-time critical behaviour of the nonextensive hot Yang-Mills theory at q- values obtained from heavy-ion collision experiments. Our results imply that, when the equivalence of statistical ensembles is obeyed, the long-standing universality arguments relating gauge theories and spin systems hold also for the nonextensive framework.

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

    E-Print Network [OSTI]

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

    2001-01-01T23:59:59.000Z

    Documentation Report: Wind Energy Submodule (WES). DOE/EIA-The Economic Value of Wind Energy at High Power Systemthe characterization of wind energy in the model as used for

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

    E-Print Network [OSTI]

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

    2001-01-01T23:59:59.000Z

    Administration. 1998. Annual Energy Outlook 1999: WithDepartment of Energys Annual Energy Outlook (AEO) forecastDepartment of Energys Annual Energy Outlook 1999 (AEO99)

  8. Learning and cost reductions for generating technologies in the national energy modeling system (NEMS)

    E-Print Network [OSTI]

    Gumerman, Etan; Marnay, Chris

    2004-01-01T23:59:59.000Z

    Assumptions to the Annual Energy Outlook 2001. Report#:DOE/ENDOGENOUS LEARNING IN THE ANNUAL ENERGY OUTLOOK REFERENCEDepartment of Energys Annual Energy Outlook (AEO), which is

  9. enski pari mokih poimenovanj v slovenskem knjinem jeziku 16. stoletja

    E-Print Network [OSTI]

    Mere, Majda

    2008-02-01T23:59:59.000Z

    , inu Neverni zhlovik dobre priatele smoti (DB 1584: II, 164a) Denn ein zorniger Mensch zndet hadder an / vnd der Gottlose verwirret gute Freunde (LB 1545: 1791). 1.1.4 Med parnimi izsamostalnikimi tvorjenkami so tudi take, ki ozna?u- jejo...

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

    E-Print Network [OSTI]

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

    2001-01-01T23:59:59.000Z

    Energy Information Administration (EIA) National Energy Modeling System (Energy Information Administrations (EIA) National Energy Modeling System (

  11. Review: Besedotvorni tematski blok na petnajstem mednarodnem slvisti?nem kongresu v Minsku (2013)

    E-Print Network [OSTI]

    Vori?, Ines; Breznik, Irena Stramlji?

    2014-06-26T23:59:59.000Z

    #20;#19;#28; 2FHQH#15;#3;]DSLVNL#15;#3;SRURLOD#3;#3;5HYLHZV#15;#3;1RWHV#15;#3;5HSRUWV Y#3; HNVSUHVLRQLVWLQR#3; VWLOQR#3; SDUDGLJPR#3; #11;#20;#28;#20;#23;#20;#28;#21;#22;#12;#3;RSUDYLOD#3;L]MHPQR#3;]DKWHYQR#3; LQ#3; REVHQR#3;GHOR#17;#3...;8VSHOR#3; ML#3; MH#3; ]DSROQLWL#3; YU]HO#3;PHG#3;HNVSUHVLRQLVWLQR#3;SRH]LMR#3; LQ#3; GUDPDWLNR#15;#3; GR#3; VHGDM#3; EROM#3; UD]LVNDQLPD#3; SRGURMHPD#17;#3; WXGLMH#3; V#3; SRGURMD#3;PHWD- IRULNH#3;]JRGQMH#3;HNVSUHVLRQLVWLQH#3;NUDWNH#3; SUR]H#3;XYU...

  12. Learning and cost reductions for generating technologies in the national energy modeling system (NEMS)

    E-Print Network [OSTI]

    Gumerman, Etan; Marnay, Chris

    2004-01-01T23:59:59.000Z

    of International Learning on Technology Cost. In Issues ofbetween initial new technology cost estimates and actualthe revolutionary technologies have cost reductions beyond

  13. Frequency Stabilization in Non-linear MEMS and NEMS Oscillators (IN-11-087)

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField8,Dist.Newof Energy Forrestal NT oFF DepaPhysics Lab- Energy

  14. National Energy Modeling System with Hydrogen Model (NEMS-H2)

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page onYouTube YouTube Note: Since the.pdfBreaking ofOilNEW HAMPSHIRE BUILDS OFFNanolens WindowDepartmentRFI |Energy

  15. Vector Quantization: L'algorithme k-Means Frank NIELSEN

    E-Print Network [OSTI]

    Nielsen, Frank

    INF555 TD5 Vector Quantization: L'algorithme k-Means Frank NIELSEN nielsen@lix.polytechnique.fr 13 pixel en un point 3D ´equivalent (r, g, b) dans l'espace des couleurs. · Implanter l'algorithme k-means points 3D des couleurs des pixels et les diff´erentes it´erations de l'algorithme k-means. · Utiliser l

  16. Vector Quantization: L'algorithme k-Means Frank NIELSEN

    E-Print Network [OSTI]

    Nielsen, Frank

    INF555 TD5 Vector Quantization: L'algorithme k-Means Frank NIELSEN nielsen@lix.polytechnique.fr 12) dans l'espace des couleurs. · Implanter l'algorithme k-means pour trouver une table des couleurs couleurs des pixels et les diff´erentes it´erations de l'algorithme k-means. · Utiliser l'initialisation de

  17. Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms

    E-Print Network [OSTI]

    Gibbs, Trevor Howard

    2011-08-08T23:59:59.000Z

    algorithm, the problem results in computation intensive, wasting time and money, which are not viable options in a real- world environment. The algorithm must also be able to find global optima, while avoiding local extrema. This requires a stochastic..., as opposed to a deterministic, approach to the problem. The global optima requirement generally cancels out all calculus-based, hill-climbing methods as the main solvers. Also, the algorithm must be a generalized answer to the problem to allow usage over...

  18. Modified vector control algorithm for increasing partial-load efficiency of fractional-slot concentrated-winding surface PM machines

    SciTech Connect (OSTI)

    El-Refaie, Ayman M [ORNL; Jahns, Thomas M [ORNL; Reddy, Patel [University of Wisconsin; McKeever, John W [ORNL

    2008-01-01T23:59:59.000Z

    This paper presents a modified vector control algorithm for a fractional-slot concentrated-winding surface permanent magnet (SPM) machine that has been developed to maximize the machine's partial-load efficiency over a wide range of operating conditions. By increasing the amplitude of the negative d-axis current, the resulting increase in the stator copper losses can be more than offset by the reduction in the iron core losses achieved by lowering the stator d-axis flux amplitude. The effectiveness of this technique has been demonstrated using both analytical models and finite element analysis for a 55-kW (peak) SPM machine design developed for a demanding set of traction drive performance requirements. For this example, the modified control strategy increases the partial-load efficiency at 20% of rated torque by > 6% at 2000 r/min compared to the maximum torque/ampere algorithm, making the machine much more attractive for its intended application.

  19. Fuzzy Control of Stochastic Global Optimization Algorithms and Very ...

    E-Print Network [OSTI]

    1. Abstract. This paper presents a fuzzy control approach for improving convergence time in stochastic global minimization algorithms .We show concrete results.

  20. Algorithm for Lot Sizing with Inventory Bounds and Fixed Costs

    E-Print Network [OSTI]

    Alper Atamturk

    2007-06-26T23:59:59.000Z

    Jun 26, 2007 ... An O(n^2) Algorithm for Lot Sizing with Inventory Bounds and Fixed Costs. Alper Atamturk (atamturk ***at*** berkeley.edu) Simge Kucukyavuz...

  1. Global linear convergence of an augmented Lagrangian algorithm ...

    E-Print Network [OSTI]

    2004-02-25T23:59:59.000Z

    section 5 by relating some numerical experiments on a seismic tomography problem and by a discussion on algorithmic consequences. Notation. We denote the...

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

    E-Print Network [OSTI]

    Ping-Qi Pan

    2015-04-27T23:59:59.000Z

    Apr 27, 2015 ... ``ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING''. Ping-Qi Pan(panpq ***at*** seu.edu.cn).

  3. Optimization Online - A Simple and Efficient Algorithm For Solving ...

    E-Print Network [OSTI]

    Natashia Boland

    2014-09-11T23:59:59.000Z

    Sep 11, 2014 ... A Simple and Efficient Algorithm For Solving Three Objective Integer Programs. Natashia Boland(Natashia.Boland ***at*** newcastle.edu.au)

  4. Efficient random coordinate descent algorithms for large-scale ...

    E-Print Network [OSTI]

    2013-05-04T23:59:59.000Z

    (will be inserted by the editor). Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. Andrei Patrascu Ion Necoara.

  5. Optimization Online - An Efficient Gauss-Newton Algorithm for ...

    E-Print Network [OSTI]

    XIN LIU

    2014-06-02T23:59:59.000Z

    Jun 2, 2014 ... An Efficient Gauss-Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations. XIN LIU (liuxin ***at*** lsec.cc.ac.cn) ZAIWEN...

  6. Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...

    E-Print Network [OSTI]

    Saugata Basu

    2005-11-24T23:59:59.000Z

    Nov 24, 2005 ... 3. Double complexes associated to certain coverings. Inductive Construction of a Double Complex. Saugata Basu. Efficient Algorithms for...

  7. An efficient algorithm for the earliness-tardiness scheduling problem

    E-Print Network [OSTI]

    Francis Sourd

    2005-09-07T23:59:59.000Z

    Sep 7, 2005 ... An efficient algorithm for the earliness-tardiness scheduling problem. Francis Sourd (Francis.Sourd ***at*** lip6.fr) Safia Kedad-Sidhoum (Safia.

  8. Efficient Block-coordinate Descent Algorithms for the Group Lasso

    E-Print Network [OSTI]

    Zhiwei (Tony) Qin

    2010-11-10T23:59:59.000Z

    Nov 10, 2010 ... First, we propose a general version of the Block Coordinate Descent (BCD) algorithm for the Group Lasso that employs an efficient approach...

  9. Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...

    E-Print Network [OSTI]

    Saugata Basu

    2005-11-25T23:59:59.000Z

    Mayer-Vietoris Exact Sequence. 4. Projections. Descent Spectral Sequence. 5. Main Open Questions. Saugata Basu. Efficient Algorithms for Computing Betti...

  10. A Near Maximum Likelihood Decoding Algorithm for MIMO Systems ...

    E-Print Network [OSTI]

    Amin Mobasher

    2005-10-03T23:59:59.000Z

    Oct 3, 2005 ... A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based ... models are also used for soft output decoding in MIMO systems.

  11. Feasible and accurate algorithms for covering semidefinite programs

    E-Print Network [OSTI]

    Garud Iyengar

    2010-07-02T23:59:59.000Z

    Jul 2, 2010 ... Abstract: In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs.

  12. Integrating Reinforcement Learning, Bidding and Genetic Algorithms Lamar University

    E-Print Network [OSTI]

    Varela, Carlos

    Integrating Reinforcement Learning, Bidding and Genetic Algorithms Dehu Qi Lamar University Computer Science Department PO Box 10056 Beaumont, Texas, USA dqi@cs.lamar.edu Ron Sun University

  13. A Near Maximum Likelihood Decoding Algorithm for MIMO Systems ...

    E-Print Network [OSTI]

    2005-10-05T23:59:59.000Z

    Jul 30, 2005 ... Graphic representation for the proposed randomization algorithm ..... to solve relaxation (34), we formulate the SDP model as a standard linear...

  14. Building Algorithm-Based Energy Efficient High Performance Computing...

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

    Building Algorithm-Based Energy Efficient High Performance Computing Systems with Resilience Event Sponsor: Mathematics and Computing Science Seminar Start Date: May 12 2015 -...

  15. algorithm based differential: Topics by E-print Network

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

    Bandwidth Allocation Algorithms for Differentiated Services enabled Ethernet Passive support the in- creasing demands for high speed connections. One of the new technologies that...

  16. Dynamic Protocol Tuning Algorithms for High Performance Data...

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

    Dynamic Protocol Tuning Algorithms for High Performance Data Transfers Event Sponsor: Mathematics and Computing Science Seminar Start Date: Apr 3 2015 - 2:00pm BuildingRoom:...

  17. A renormalization group decoding algorithm for topological quantum codes

    E-Print Network [OSTI]

    Guillaume Duclos-Cianci; David Poulin

    2010-06-07T23:59:59.000Z

    Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be efficiently decoded. To improve this approximation, additional consistency conditions are imposed between the blocks, and are solved by a belief propagation algorithm.

  18. An improved algorithm for computing Steiner minimal trees in ...

    E-Print Network [OSTI]

    2006-04-17T23:59:59.000Z

    We describe improvements to Smith's branch-and-bound (B&B) algorithm for the ... Computational results demonstrate substantial gains compared to Smith's...

  19. Optimization Online - An LP-based Algorithm to Test Copositivity

    E-Print Network [OSTI]

    Akihiro Tanaka

    2014-04-26T23:59:59.000Z

    Apr 26, 2014 ... Among others, several branch and bound type algorithms have been provided to test copositivity in the context of the fact that deciding whether...

  20. HIPAD - A Hybrid Interior-Point Alternating Direction algorithm for ...

    E-Print Network [OSTI]

    2014-07-19T23:59:59.000Z

    phase. Both SVM formulations are adapted to knowledge incorporation. ...... Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pages.

  1. Kolmogorov Algorithmic Complexity and its Probability Interpretation in Quantum Gravity

    E-Print Network [OSTI]

    V. D. Dzhunushaliev

    1997-04-16T23:59:59.000Z

    The quantum gravity has great difficulties with application of the probability notion. In given article this problem is analyzed according to algorithmic viewpoint. According to A.N. Kolmogorov, the probability notion can be connected with algorithmic complexity of given object. The paper proposes an interpretation of quantum gravity, according to which an appearance of something corresponds to its Kolmogorov's algorithmic complexity. By this viewpoint the following questions are considered: the quantum transition with supplementary coordinates splitting off, the algorithmic complexity of the Schwarzschild black hole is estimated, the redefinition of the Feynman path integral, the quantum birth of the Euclidean Universe with the following changing of the metric signature.

  2. IESP Exascale Challenge: Co-Design of Architectures and Algorithms

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

    Performance Computing Applications Al Geist and Sudip Dosanjh IESP Exascale Challenge: Co-Design of Architectures and Algorithms Published by: http:www.sagepublications.com can...

  3. A Q-LEARNING ALGORITHM WITH CONTINUOUS STATE SPACE ...

    E-Print Network [OSTI]

    2006-09-22T23:59:59.000Z

    Sep 22, 2006 ... stochastic approximation. Then, in section 3, we solve the mountain car task with the newly presented algorithm. 2. Theoretical Framework. 2.1.

  4. Sandia Energy - High-Resolution Computational Algorithms for...

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

    High-Resolution Computational Algorithms for Simulating Offshore Wind Farms Home Stationary Power Energy Conversion Efficiency Wind Energy Offshore Wind High-Resolution...

  5. algorithm based method: Topics by E-print Network

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

    Algorithm Computer Technologies and Information Sciences Websites Summary: for LTSA in a special case. 1 Introduction Manifold learning (ML) methods have attracted...

  6. assessment algorithms based: Topics by E-print Network

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

    Algorithm Computer Technologies and Information Sciences Websites Summary: for LTSA in a special case. 1 Introduction Manifold learning (ML) methods have attracted...

  7. algorithm based descriptor: Topics by E-print Network

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

    Algorithm Computer Technologies and Information Sciences Websites Summary: for LTSA in a special case. 1 Introduction Manifold learning (ML) methods have attracted...

  8. Algorithms over Arc-time Indexed Formulations for Single and ...

    E-Print Network [OSTI]

    2008-06-26T23:59:59.000Z

    This paper presents algorithms for single and parallel identical machine ...... In this case, we also report the average number of changes of the stability center.

  9. An Improved Algorithm for the Generalized Quadratic Assignment ...

    E-Print Network [OSTI]

    artur

    2008-05-15T23:59:59.000Z

    presented a special-purpose branch-and-bound algorithm that utilizes linear programming cuts, feasible solution generators, Lagrangean relaxation, and...

  10. A Retrospective Filter Trust Region Algorithm For Unconstrained ...

    E-Print Network [OSTI]

    2010-01-05T23:59:59.000Z

    algorithm gives a good estimation of trust region radius, relaxes the condition of accepting a trial step for the usual trust region methods. Under reasonable...

  11. A Facial Reduction Algorithm for Finding Sparse SOS Representations

    E-Print Network [OSTI]

    2009-11-06T23:59:59.000Z

    facial reduction algorithm and the elimination method for a sparse. SOS polynomial. ... reduce the size of the SDP obtained from a sparse SOS polynomial.

  12. Feasible and accurate algorithms for covering semidefinite programs

    E-Print Network [OSTI]

    2010-07-02T23:59:59.000Z

    The running times of our algorithm and previous works, applied to .... denote the complex vector that models the propagation loss and the phase shift from.

  13. Efficient algorithm for computing the Euler-Poincare characteristic of ...

    E-Print Network [OSTI]

    2005-10-30T23:59:59.000Z

    SEMI-ALGEBRAIC SET DEFINED BY FEW. QUADRATIC INEQUALITIES. Saugata Basu. Abstract. We present an algorithm which takes as input a closed semi-.

  14. algorithms restabelecimento otimo: Topics by E-print Network

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

    Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...

  15. algorithms mejora del: Topics by E-print Network

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

    Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...

  16. algorithm providing scan: Topics by E-print Network

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

    Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...

  17. algorithm based feature: Topics by E-print Network

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

    feature level fusion framework using two well- known biometric cryptosystems, namely, fuzzy vault 60 A stochastic algorithm for feature selection in pattern recognition...

  18. analytical anisotropic algorithm: Topics by E-print Network

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

    THE EFFECTIVENESS OF ANISOTROPIC ANALYTICAL ALGORITHM IN FLATTENED AND FLATTENING-FILTER-FREE BEAMS FOR HIGH ENERGY LUNG DOSE DELIVERY USING THE RADIOLOGICAL PHYSICS CENTER LUNG...

  19. anisotropic analytical algorithm: Topics by E-print Network

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

    THE EFFECTIVENESS OF ANISOTROPIC ANALYTICAL ALGORITHM IN FLATTENED AND FLATTENING-FILTER-FREE BEAMS FOR HIGH ENERGY LUNG DOSE DELIVERY USING THE RADIOLOGICAL PHYSICS CENTER LUNG...

  20. Optimization Online - A branch and bound algorithm for the global ...

    E-Print Network [OSTI]

    Jaroslav Fowkes

    2011-12-05T23:59:59.000Z

    Dec 5, 2011 ... A branch and bound algorithm for the global optimization of Hessian ... with a Lipschitz continuous Hessian over a compact, convex set.

  1. Optimization Online - A genetic algorithm for a global optimization ...

    E-Print Network [OSTI]

    Daniela di Serafino

    2008-11-05T23:59:59.000Z

    Nov 5, 2008 ... A genetic algorithm for a global optimization problem arising in the ... emitted by coalescing binary systems of compact objects (neutron stars...

  2. algorithm ga technique: Topics by E-print Network

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

    are investigated. Using a traditional method of harmonic Itoh, Tatsuo 7 Algorithm Design Techniques, including Dynamic Programming Environmental Sciences and Ecology Websites...

  3. An accelerated proximal gradient algorithm for nuclear norm ...

    E-Print Network [OSTI]

    Kim-Chuan Toh

    2009-03-27T23:59:59.000Z

    Mar 27, 2009 ... An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Kim-Chuan Toh (mattohkc ***at*** nus.edu.sg)

  4. Bounds and Algorithms for the Knapsack Problem with Conflict Graph

    E-Print Network [OSTI]

    2014-06-19T23:59:59.000Z

    called load in the following, which corresponds to the item weight wi. The goal ..... formance profile for an algorithm is the cumulative distribution function for a.

  5. ant colony algorithm: Topics by E-print Network

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

    22 23 24 25 Next Page Last Page Topic Index 1 Learning Fuzzy Rules Using Ant Colony Optimization Algorithms 1 Computer Technologies and Information Sciences Websites Summary:...

  6. algorithm identifies community: Topics by E-print Network

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

    computer introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based by Martin Karplus provides evidence that the partition...

  7. algorithm stochastic test: Topics by E-print Network

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

    algorithms are often metaheuristic, and they are very promising in solving NP-hard optimization problems. In this paper, we show how to use the recently developed Firefly...

  8. application genetic algorithms: Topics by E-print Network

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

    Learning mode generates hypotheses Evolution Model, Genetic Algorithms, Function Optimization, Symbolic Learning, AQ18, Digital Filters. 1An Experimental Application of...

  9. algorithm na ordenacao: Topics by E-print Network

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

    21 22 23 24 25 Next Page Last Page Topic Index 1 Elementary algorithms for convex optimization Javier Pena Computer Technologies and Information Sciences Websites Summary: ....

  10. ant system algorithm: Topics by E-print Network

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

    Libre de Bruxelles IRIDIA Brussels, Belgium Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking Problem. To show that Ant...

  11. adaptive genetic algorithm: Topics by E-print Network

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

    a xed crossover Emmerich, Michael 2 Self-Adaptive Genetic Algorithm for Constrained Optimization. Open Access Theses and Dissertations Summary: ??This study proposes a...

  12. A Proximal Point Algorithm with ?-Divergence to Quasiconvex ...

    E-Print Network [OSTI]

    2006-07-19T23:59:59.000Z

    ... of applications in several fields of sciences and engineering such as: economic ... In section 3, we state our algorithm, introduce the basic assumptions and...

  13. Optimization Online - A Constraint-Reduced Algorithm for ...

    E-Print Network [OSTI]

    Sungwoo Park

    2015-05-21T23:59:59.000Z

    May 21, 2015 ... Park and O'Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global...

  14. Mechanical Verification of Hypercube Algorithms Eric Gascard, Laurence Pierre

    E-Print Network [OSTI]

    Pierre, Laurence

    Mechanical Verification of Hypercube Algorithms Eric Gascard, Laurence Pierre LIM CMI in the development of parallel programs, rather few results have been reported re garding solutions for formally

  15. A hybrid genetic algorithm for manufacturing cell formation

    E-Print Network [OSTI]

    Jos F. Gonalves

    ... in cellular manufacturing is the formation of product families and machine cells. ... Computational experience with the algorithm on a set of group technology...

  16. A WELL-POSED SHOOTING ALGORITHM FOR OPTIMAL ...

    E-Print Network [OSTI]

    2011-10-17T23:59:59.000Z

    bations and the well-posedness of the shooting algorithm for the perturbed problem. .... tion under small perturbation of the data, as well as the well-

  17. A COMPUTATIONAL ALGORITHM FOR COMPUTING NONLINEAR AUDITORY FREQUENCY SELECTIVITY

    E-Print Network [OSTI]

    Allen, Jont

    published chinchilla and guinea-pig observations of basilar membrane and Reissner's membrane motion made Introduction Using observations in chinchilla and guinea pig preparations, we evaluate an algorithm

  18. Lower bounds on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy

    E-Print Network [OSTI]

    Naor, Assaf

    as the basis for an efficient approximate nearest neighbor search algorithm, and has since been used mining, information retrieval, and image search, where distinctive features of the objects the nearest neighbor. One of the most versatile and efficient methods for approximate nearest neighbor search

  19. Computational modeling of trabecular bone in lower extremity injuries due to impact

    E-Print Network [OSTI]

    Pino, Wendy

    2013-01-01T23:59:59.000Z

    Lower extremity injuries resulting from improvised explosive devices (IEDs) pose a serious threat to the safety of military troops. Reports from Operation Iraqi Freedom and Operation Enduring Freedom identify IEDs as the ...

  20. Why Are Resiential PV Prices in Germany So Much Lower Than in the United States?

    Broader source: Energy.gov [DOE]

    The U.S. Department of Energy (DOE) SunShot Initiative, in conjunction with the Lawrence Berkeley National Laboratory (LBNL) discusses the installed price of residential PV being significantly lower in Germany than in the United States.