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.
NEMS integrating module documentation report
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.
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21T23:59:59.000Z
We consider deterministic and {\\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\\in\\{H_1,...,H_m\\}$, $H=\\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\\e$ at least have $\\Omega(t^{3/2}\\e^{-1/2})$ exponentials.
Parameterized algorithms and computational lower bounds: a structural approach
Xia, Ge
2006-10-30T23:59:59.000Z
Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ...
Investigation of residential central air conditioning load shapes in NEMS
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.
U.S. Regional Demand Forecasts Using NEMS and GIS
Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris
2005-01-01T23:59:59.000Z
Forecasts Using NEMS and GIS National Climatic Data Center.with Changing Boundaries." Use of GIS to Understand Socio-Forecasts Using NEMS and GIS Appendix A. Map Results Gallery
Integrated NEMS and optoelectronics for sensor applications.
Czaplewski, David A.; Serkland, Darwin Keith; Olsson, Roy H., III; Bogart, Gregory R. (Symphony Acoustics, Rio Rancho, NM); Krishnamoorthy, Uma; Warren, Mial E.; Carr, Dustin Wade (Symphony Acoustics, Rio Rancho, NM); Okandan, Murat; Peterson, Kenneth Allen
2008-01-01T23:59:59.000Z
This work utilized advanced engineering in several fields to find solutions to the challenges presented by the integration of MEMS/NEMS with optoelectronics to realize a compact sensor system, comprised of a microfabricated sensor, VCSEL, and photodiode. By utilizing microfabrication techniques in the realization of the MEMS/NEMS component, the VCSEL and the photodiode, the system would be small in size and require less power than a macro-sized component. The work focused on two technologies, accelerometers and microphones, leveraged from other LDRD programs. The first technology was the nano-g accelerometer using a nanophotonic motion detection system (67023). This accelerometer had measured sensitivity of approximately 10 nano-g. The Integrated NEMS and optoelectronics LDRD supported the nano-g accelerometer LDRD by providing advanced designs for the accelerometers, packaging, and a detection scheme to encapsulate the accelerometer, furthering the testing capabilities beyond bench-top tests. A fully packaged and tested die was never realized, but significant packaging issues were addressed and many resolved. The second technology supported by this work was the ultrasensitive directional microphone arrays for military operations in urban terrain and future combat systems (93518). This application utilized a diffraction-based sensing technique with different optical component placement and a different detection scheme from the nano-g accelerometer. The Integrated NEMS LDRD supported the microphone array LDRD by providing custom designs, VCSELs, and measurement techniques to accelerometers that were fabricated from the same operational principles as the microphones, but contain proof masses for acceleration transduction. These devices were packaged at the end of the work.
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.
NEMS Freight Transportation Module Improvement Study
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318Cubic Feet) Year Jan Feb Mar AprNew Field(MillionGruenspecht: But let's takeNEMS
NEMS Buildings Sector Working Group Meeting
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: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home PageSummary" ,"Click worksheet nameDomesticResidentialEstimatedCrude OilDecade894 2.319 - - - - 1984-2014Rowe:NEMS
Investigation of residential central air conditioning load shapes in NEMS
Hamachi LaCommare, Kristina; Marnay, Chris; Gumerman, Etan; Chan, Peter; Rosenquist, Greg; Osborn, Julie
2002-01-01T23:59:59.000Z
of Residential Central Air Conditioning Load Shapes in NEMSof Residential Central Air Conditioning Load Shapes in NEMSof Residential Central Air Conditioning Load Shapes in NEMS
U.S. Regional Demand Forecasts Using NEMS and GIS
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.
Lower bound and an optimal algorithm for leader election in faulty asynchronous general networks
Lateef, Mohammed Afroz
1993-01-01T23:59:59.000Z
the problem of electing a leader in faulty asynchronous general net- works. The network coritams a reliable path connecting all the nodes in the network. The type of failure the links experience is interinittent. Since thc network is asyn- chronous..., the link failures are undetectable. The size of tdic network is N nodes. We prove that the opl, imal message complexity for electing a leader in such a network is H(N E logsN) hits. We also develop an optimal algorithm of message complexity O(N. E...
Assessment and Suggestions to Improve the Commercial Building Module of EIA-NEMS
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...
Assessment and Suggestions to Improve the Commercial Building Module of EIA-NEMS
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...
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.
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
CNT-based MEMS/NEMS gas ionizers for portable mass spectrometry applications
Velasquez-Heller, Luis Fernand
We report the fabrication and experimental characterization of a carbon nanotube (CNT)-based MEMS/NEMS electron impact gas ionizer with an integrated extractor gate for portable mass spectrometry. The ionizer achieves ...
A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS
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
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
Investigation of the effects of soluble boron tracking on coupled CTF / NEM, LWR simulations
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)
Overview of NEMS-H2, Version 1.0 Frances Wood
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
H Loop shaping control for PLL-based mechanical resonance tracking in NEMS resonant mass sensors
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
MEMS/NEMS Design Automation and Synthesis Annual Report for NSF Grant # CCR-DES/CC-0306557
Agogino, Alice M.
1 MEMS/NEMS Design Automation and Synthesis Annual Report for NSF Grant # CCR-DES/CC-0306557 (2004: The goal of the project is to extend the existing SUGAR MEMS simulator into a design synthesis tool that supports the early stages of MEMS/NEMS conceptual design. We are developing a broad base of MEMS building
MEMS/NEMS Design Automation and Synthesis Annual Report for NSF Grant # CCR-DES/CC-0306557
Agogino, Alice M.
1 MEMS/NEMS Design Automation and Synthesis Annual Report for NSF Grant # CCR-DES/CC-0306557 (2005: The goal of the project is to extend the existing SUGAR MEMS simulator into a design synthesis tool that supports the early stages of MEMS/NEMS conceptual design. We are developing a broad base of MEMS building
Ultrananocrystalline and nanocrystalline diamond thin films for NEMS/MEMS applications.
Sumant, A. V.; Auciello, O.; Carpick, R. W.; Srinivasan, S.; Butler, J. E. (Center for Nanoscale Materials); ( MSD); ( PSC-USR)
2010-04-01T23:59:59.000Z
There has been a tireless quest by the designers of micro- and nanoelectro mechanical systems (MEMS/NEMS) to find a suitable material alternative to conventional silicon. This is needed to develop robust, reliable, and long-endurance MEMS/NEMS with capabilities for working under demanding conditions, including harsh environments, high stresses, or with contacting and sliding surfaces. Diamond is one of the most promising candidates for this because of its superior physical, chemical, and tribomechanical properties. Ultrananocrystalline diamond (UNCD) and nanocrystalline diamond (NCD) thin films, the two most studied forms of diamond films in the last decade, have distinct growth processes and nanostructures but complementary properties. This article reviews the fundamental and applied science performed to understand key aspects of UNCD and NCD films, including the nucleation and growth, tribomechanical properties, electronic properties, and applied studies on integration with piezoelectric materials and CMOS technology. Several emerging diamond-based MEMS/NEMS applications, including high-frequency resonators, radio frequency MEMS and photonic switches, and the first commercial diamond MEMS product - monolithic diamond atomic force microscopy probes - are discussed.
A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS
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.
Appendix E: Other NEMS-MP results for the base case and scenarios.
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.
Auciello, O.; Srinivasan, S.; Hiller, J.; Kabius, B. (Center for Nanoscale Materials); ( MSD)
2009-01-01T23:59:59.000Z
Most current micro/nanoelectromechanical systems (MEMS/NEMS) are based on silicon. However, silicon exhibits relatively poor mechanical/tribological properties, compromising applications to several projected MEMS/NEMS devices, particularly those that require materials with high Young's modulus for MEMS resonators or low surface adhesion forces for MEMS/NEMS working in conditions with extensive surface contact. Diamond films with superior mechanical/tribological properties provide an excellent alternative platform material. Ultrananocrystalline diamond (UNCD{cflx W}) in film form with 2-5 nm grains exhibits excellent properties for high-performance MEMS/NEMS devices. Concurrently, piezoelectric Pb(Zr{sub x}Ti{sub 1-x})O{sub 3} (PZT) films provide high sensitivity/low electrical noise for sensing/high-force actuation at relatively low voltages. Therefore, integration of PZT and UNCD films provides a high-performance platform for advanced MEMS/NEMS devices. This paper describes the bases of such integration and demonstration of low voltage piezoactuated hybrid PZT/UNCD cantilevers.
Not Available
1994-04-04T23:59:59.000Z
The Energy Information Administration (EIA) is developing the National Energy Modeling System (NEMS) to enhance its energy forecasting capabilities and to provide the Department of Energy with a comprehensive framework for analyzing alternative energy` futures. NEMS is designed with a multi-level modular structure that represents specific energy supply activities, conversion processes, and demand sectors as a series of self-contained units which are linked by an integrating mechanism. The NEMS International Energy Module (IEM) computes world oil prices and the resulting patterns of international trade in crude oil and refined products. This report is a reference document for energy analysts, model users, and the public that is intended to meet EIA`s legal obligation to provide adequate documentation for all statistical and forecast reports (Public Law 93-275, section 57(b)(1). Its purpose is to describe the structure of the IEM. Actual operation of the model is not discussed here. The report contains four sections summarizing the overall structure of the IEM and its interface with other NEMS modules, mathematical specifications of behavioral relationships, and data sources and estimation methods. Following a general description of the function and rationale of its key components, system and equation level information sufficient to permit independent evaluation of the model`s technical details is presented.
Comparison of Bottom-Up and Top-Down Forecasts: Vision Industry Energy Forecasts with ITEMS and NEMS
Roop, J. M.; Dahowski, R. T
description of industry, it is possible to detennine, based on economic and perfonnance data, what effect these new technologies will have as they penetrate the market (3, 5, 6). The energy savings and, possibly, emissions reductions from new... technologies can be tracked with the model, as well. The Industrial module of NEMS is a forecasting tool used by the Energy Infonnation Administration (EIA) to forecast manufacturing energy use (except for petroleum refming). At the request...
Robust Power Control of Optical Links with Time-Delay Nem Stefanovic and Lacra Pavel
Pavel, Lacra
of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada pavel-delays. Primal-dual control algorithms adjust the signal powers at the channel sources and receiver to optimize the OSNR values. The link utilization price is regularly updated and fed back to the source algorithms. We
Broader source: Energy.gov (indexed) [DOE]
- According to APS, the charge will collect 4.90 per month from a typical future rooftop solar customer. The utility says the charge is needed to defray the cost of the solar...
Michele Mosca
2008-08-04T23:59:59.000Z
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
Central Ferry Lower Monumental
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
& Reliability Projects Expand Projects Skip navigation links Line Projects Big Eddy-Knight Central Ferry Lower Monumental Grand Coulee Transmission Line Replacement...
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01T23:59:59.000Z
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm
International Association for Cryptologic Research (IACR)
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm Shaohua Zhang School of Mathematics, Shandong University, Jinan, Shandong, 250100, PRC Abstract: It is known that Euclid's algorithm, Guass' elimination and Buchberger's algorithm play important roles in algorithmic number the- ory
Lower Bounds and Exact Algorithms for the Quadratic Minimum ...
2013-12-16T23:59:59.000Z
Dec 16, 2013 ... 50. 1225. OP2. 13198. -. -. 13231. 5608. 12940.4. 189. 71. 8244. -. -. -. -. -. -. 50. 1225. OP2. 15137. -. -. 15218. 4768. 14708.5. 193. 123. 11761.
Obtaining Lower Bounds from the Progressive Hedging Algorithm ...
2014-01-21T23:59:59.000Z
Oct 11, 2013 ... Energy Network Integration (GENI) program, and by the Department of ... fied into two or more stages according to which parameter values ..... Simultaneous consideration of multiple scenarios ..... tion from unpredictable and variable sources such as wind and .... We converted the SIPLIB instances into the.
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10T23:59:59.000Z
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.
Topics in Approximation Algorithms
Khare, Monik
2012-01-01T23:59:59.000Z
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
Algorithmic issues in queueing systems and combinatorial counting problems
Katz-Rogozhnikov, Dmitriy A
2008-01-01T23:59:59.000Z
(cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms ...
A hybrid of the genetic algorithm and concurrent simplex
Randolph, David Ethan
1995-01-01T23:59:59.000Z
by drawing the genetic algorithm's attention to local optima too quickly, leading to premature con- vergence [7]. Thus, while local optimization might improve the speed of the analysis, the genetic algorithm might pay dearly with a much lower quality linal...
Nikolova, Evdokia Velinova
2009-01-01T23:59:59.000Z
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components ...
Tree Elaboration Strategies Branch and Bound Algorithms
, Elon College Terri Anne Johnson, Elon College Monique Guignard-Spielberg, The University of a sharp lower bound technique in these algorithms is one of the major difficulties. Recently, Hahn
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
Accelerating Majorization Algorithms
Leeuw, Jan de
2008-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
KIRKPATRICK, BONNIE
2011-01-01T23:59:59.000Z
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
The Simulation of Humans and Lower Animals Demetri Terzopoulos
Terzopoulos, Demetri
work on the motor control of anthropomorphically articulated dynamic models, as well as the biomechanical modeling of lower animals such as fish, including motor control algorithms that enable and Simulation, Human Simulation, Musculoskeletal Modeling, Neuro- muscular Control, Motor Control Learning 1
LOWER COLUMBIA SALMON AND STEELHEAD
Appendices Prepared By: Lower Columbia Fish Recovery Board Prepared For Northwest Power And Conservation for Recovery and Subbasin Planning prepared under direction of the Washington Lower Columbia River Fish prepared by the Fish Recovery Board. The Technical Foundation is an encyclopedia of information relating
Lower Tuscaloosa of southern Mississippi
Devery, D.M.
1980-12-01T23:59:59.000Z
The Lower Tuscaloosa Formation of the upper Cretaceous currently is producing primarily oil from more than 50 fields in the interior salt basin of Mississippi. These fields are located within an area extending from east Louisiana into SW and S.-central Mississippi (Jefferson, Adams, Franklin, Lincoln, Amite, Pike, Walthall, Lamar, Forrest, and Pearl River Counties). Stratigraphically, the Lower Tuscaloosa unconformably overlies lower Cretaceous sediments of the Dantzler Formation and underlies lower Cretaceous shales of the Middle Tuscaloosa. The formation consists of a transgressive sequence that grades upward from alluvial plain through delta to marine deposits. Prospecting for oil and gas as well as developing new fields in the Lower Tuscaloosa can be difficult. There is generally a lack of strong structural closure; accumulation of oil and gas is controlled largely by stratigraphy, with lenticular sands pinching out into shales.
A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization
Terri Anne Johnson, Clemson University Monique Guignard-Spielberg, The University of Pennsylvania-and-bound are the most successful, but the lack of sharp lower bounds in these algorithms has been one of the major
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01T23:59:59.000Z
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
Automatic toilet seat lowering apparatus
Guerty, Harold G. (Palm Beach Gardens, FL)
1994-09-06T23:59:59.000Z
A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat. A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat.
Improved Sampling Algorithms in Lattice QCD
Gambhir, Arjun Singh
2015-01-01T23:59:59.000Z
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Improved Sampling Algorithms in Lattice QCD
Arjun Singh Gambhir; Kostas Orginos
2015-06-19T23:59:59.000Z
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Catalyst for producing lower alcohols
Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)
1987-01-01T23:59:59.000Z
A process and system for the production of the lower alcohols such as methanol, ethanol and propanol involves the reaction of carbon monoxide and water in the presence of a lead salt and an alkali metal formate catalyst combination. The lead salt is present as solid particles such as lead titanate, lead molybdate, lead vanadate, lead zirconate, lead tantalate and lead silicates coated or in slurry within molten alkali metal formate. The reactants, carbon monoxide and steam are provided in gas form at relatively low pressures below 100 atmospheres and at temperatures of 200-400.degree. C. The resulted lower alcohols can be separated into boiling point fractions and recovered from the excess reactants by distillation.
Linear Programming Lower Bounds for Minimum Converter ...
generation algorithm for solving the linear relaxation of the most promising ... Keywords: Optical Networks, Wavelength Assignment, Integer Programming.
Office of Environmental Management (EM)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 of Thomas P.Oil,J. B. Cardell Smith College C.of EnergyStrategic Actionof Lower Coloradofrom5
Lower Sioux Wind Feasibility & Development
Minkel, Darin
2012-04-01T23:59:59.000Z
This report describes the process and findings of a Wind Energy Feasibility Study (Study) conducted by the Lower Sioux Indian Community (Community). The Community is evaluating the development of a wind energy project located on tribal land. The project scope was to analyze the critical issues in determining advantages and disadvantages of wind development within the Community. This analysis addresses both of the Community's wind energy development objectives: the single turbine project and the Commerical-scale multiple turbine project. The main tasks of the feasibility study are: land use and contraint analysis; wind resource evaluation; utility interconnection analysis; and project structure and economics.
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01T23:59:59.000Z
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption
California at Irvine, University of
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption Andrew Gearhart #12;Relation design use feedback to "cotune" compute kernel energy efficiency #12;Previous Work: Communication Lower-optimal" algorithms #12;Communication is energy inefficient! · On-chip/Off-chip gap isn't going to improve much Data
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
Algorithms and Problem Solving Introduction
Razak, Saquib
Unit 16 1 Algorithms and Problem Solving · Introduction · What is an Algorithm? · Algorithm Properties · Example · Exercises #12;Unit 16 2 What is an Algorithm? What is an Algorithm? · An algorithm. · The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01T23:59:59.000Z
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Reconstruction algorithms for MRI
Bilgic?, Berkin
2013-01-01T23:59:59.000Z
This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...
Rubinfeld, Ronitt
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01T23:59:59.000Z
Indigenous Optimizing Algorithm. Mathematical Anthropologythe use of maximizing algorithms in behavior is a crucialthe knowledge, rules, and algorithms that they apply. If we
Variational Algorithms for Marginal MAP
Liu, Q; Ihler, A
2013-01-01T23:59:59.000Z
2004. A. L. Yuille. CCCP algorithms to minimize the BetheA tutorial on MM algorithms. The American Statistician, 1(time approximation algorithms for the ising model. SIAM
Savings Project: Lower Water Heating Temperature | Department...
Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings 12-30 annually for each 10F...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Giorda, Paolo [Institute for Scientific Interchange, Villa Gualino Viale Settimio Severo 65, 10133 Turin (Italy); Iorio, Alfredo [Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307 (United States); INFN, Rome (Italy); Sen, Samik [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); Sen, Siddhartha [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); IACS, Jadavpur, Calcutta 700032 (India)
2004-09-01T23:59:59.000Z
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-(1/2) SU(2) generalized coherent states. Surprisingly, we find evidence that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.
Physical Algorithms Roger Wattenhofer
Physical Algorithms Roger Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07T23:59:59.000Z
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
Relation between XL algorithm and Grobner Bases Algorithms
International Association for Cryptologic Research (IACR)
Relation between XL algorithm and Gr¨obner Bases Algorithms Makoto Sugita1 , Mitsuru Kawazoe2 the XL algorithm and Gr¨obner bases algorithms. The XL algorithm was proposed to be a more efficient algorithm to solve a system of equations with a special assumption with- out trying to calculate a whole Gr
Sec$on Summary ! Properties of Algorithms
#12;Sec$on Summary ! Properties of Algorithms ! Algorithms for Searching and Sorting ! Greedy Algorithms ! Halting Problem #12;Problems and Algorithms ! In many. This procedure is called an algorithm. #12;Algorithms Definition: An algorithm
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.
Algorithms for Symmetric Linear and Integer Programs
Bödi, Richard; Joswig, Michael
2010-01-01T23:59:59.000Z
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy
Stadler, Peter F.
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy landscapes a generic, problem independent algorithm for exploration of the low- energy portion of the energy landscape of discrete systems and apply it to the energy landscape of lattice proteins. Starting from a set of optimal
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01T23:59:59.000Z
and A. Spillner. Consistency of the Neighbor-Net algorithm.Algorithms for Molecular Biology, 2:8, 2007. [10] P.D. Gusfield. Efficient algorithms for inferring evolutionary
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21T23:59:59.000Z
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Sandia National Laboratories: lowering costs associated with...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
lowering costs associated with geothermal energy production Sandia and Atlas-Copco Secoroc Advance to Phase 2 in Their Geothermal Energy Project On July 31, 2013, in Energy,...
Savings Project: Lower Water Heating Temperature | Department...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
and Energy at Home Savings Project: Lower Water Heating Temperature Tips: Booklet Distribution Save energy and more with ENERGY STAR. ENERGY STAR clothes washers use 20% less...
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01T23:59:59.000Z
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
Sandbar Dynamics of the Lower Platte
Nebraska-Lincoln, University of
Sandbar Dynamics of the Lower Platte River Pilot Study 2011 methods and initial results In cooperation with Lower Platte South Natural Resources District By Jason S. Alexander and Ron Zelt Photo credits: Nebraska Tern and Plover Conservation Partnership #12;Why does the Platte River provide excellent
CS 441T 539T: Advanced Algorithms Fall Semester, 2002 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T/539T: Advanced Algorithms Fall Semester, 2003 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
CS 441T 539T: Advanced Algorithms Fall Semester, 2003 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T 539T: Advanced Algorithms Fall Semester, 2001 Adversary Lower Bound Technique
Goldman, Sally A.
, min if candidate for only min, max if candidate for only max, neither if candidate for neither answer either way 2. max min vs neither answer max min is larger 3. min vs min answer either way 4. max is larger 7. neither vs neither answer consistently with past In the rst case the larger element is moved
CS 441T/539T: Advanced Algorithms Fall Semester, 2001 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
CS 441T/539T: Advanced Algorithms Fall Semester, 2002 Adversary Lower Bound Technique
Goldman, Sally A.
), neither (if candidate for neither). The adversary responds to the comparisons using the following strategy: Comparison Answer 1. max/min vs max/min answer either way 2. max/min vs neither answer max/min is larger 3 6. min vs ``other'' answer other is larger 7. neither vs neither answer consistently with past
Muon ID - taking care of lower momenta muons
Milstene, C.; Fisk, G.; Para, A.; /Fermilab
2005-12-01T23:59:59.000Z
In the Muon package under study, the tracks are extrapolated using an algorithm which accounts for the magnetic field and the ionization (dE/dx). We improved the calculation of the field dependent term to increase the muon detection efficiency at lower momenta using a Runge-Kutta method. The muon identification and hadron separation in b-bbar jets is reported with the improved software. In the same framework, the utilization of the Kalman filter is introduced. The principle of the Kalman filter is described in some detail with the propagation matrix, with the Runge-Kutta term included, and the effect on low momenta for low momenta single muons particles is described.
An Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid-
Powell, Warren B.
for energy policy modeling in models such as NEMS (NEMS (2003)), MARKAL (Fishbone & Abilock (1981)), MESSAGE energy sources such as wind and solar. However, it is well known (Lamont (2008)) that intermittent energy adjustments to other sources of energy in anticipation of future fluctuations in wind and solar
Ricci, Laura
D in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithmsIntroduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Epidemic Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Stochastic Ion Heating by Lower Hybrid Turbulence
Candy, J.
2010-01-01T23:59:59.000Z
of Tur b ulent S jpectrum Heating S imulations. Run 1A 2A 3ADivision Stochastic Ion Heating by Lower Hybrid Turbulenceweb development in this heating process is also discussed. I
Lower Saccharide Nanometric Materials and Methods
Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek
2004-07-13T23:59:59.000Z
A ceramic composition having at least one nanometric ceramic powder, at least one lower saccharide, and water. The composition is useful in many industrial applications, including preparation of stronger and substantially defect free green and sintered ceramic bodies.
Continental Lower Crust Bradley R. Hacker,1
Hacker, Bradley R.
Continental Lower Crust Bradley R. Hacker,1 Peter B. Kelemen,2 and Mark D. Behn3 1 Department of Earth Science, University of California, Santa Barbara, California 93106; email: hacker@geol.ucsb.edu 2
Disentangling Clustering Effects in Jet Algorithms
Randall Kelley; Jonathan R. Walsh; Saba Zuberi
2012-04-04T23:59:59.000Z
Clustering algorithms build jets though the iterative application of single particle and pairwise metrics. This leads to phase space constraints that are extremely complicated beyond the lowest orders in perturbation theory, and in practice they must be implemented numerically. This complication presents a significant barrier to gaining an analytic understanding of the perturbative structure of jet cross sections. We present a novel framework to express the jet algorithm's phase space constraints as a function of clustered groups of particles, which are the possible outcomes of the algorithm. This approach highlights the analytic properties of jet observables, rather than the explicit constraints on individual final state momenta, which can be unwieldy at higher orders. We derive the form of the n-particle phase space constraints for a jet algorithm with any measurement. We provide an expression for the measurement that makes clustering effects manifest and relates them to constraints from clustering at lower orders. The utility of this framework is demonstrated by using it to understand clustering effects for a large class of jet shape observables in the soft/collinear limit. We apply this framework to isolate divergences and analyze the logarithmic structure of the Abelian terms in the soft function, providing the all-orders form of these terms and showing that corrections from clustering start at next-to-leading logarithmic order in the exponent of the cross section.
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01T23:59:59.000Z
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \\lim_{+\\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \\lambda q, with \\lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Powell, Warren B.
for the optimal control of such power systems are critical for the deployment of reliable and more economical and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We useBenchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
Pavel, Lacra
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game Lacra Pavel Department. A Nash game is formulated between channels with channel utility related to maximizing channel optical the coupled Nash game into a lower-level Nash game with no coupled constraints, and a higher-level link
Quantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1
Salvaggio, Carl
, and quantitatively evaluate infrared contrast enhancement algorithms for use in a real-time long-wave infrared imageQuantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1 and Carl range imagery output from current sensors are compressed in a pleasing way for display on lower dynamic
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02T23:59:59.000Z
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.
Incentives and Internet Algorithms
Feigenbaum, Joan
Game Theory Internet Design #12;9 Game Theory and the Internet Â· Long history of work: Â NetworkingIncentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf Scott with selfishness? Â· Internet Architecture: robust scalability Â How to build large and robust systems? #12
Genetic Algorithms Artificial Life
Forrest, Stephanie
systems tremendously. Likewise, evolution of artificial systems is an important component of artificial) are currently the most promi nent and widely used models of evolution in artificiallife systems. GAs have beenGenetic Algorithms and Artificial Life Melanie Mitchell Santa Fe Institute 1660 Old Pecos Tr
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01T23:59:59.000Z
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01T23:59:59.000Z
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
EARTH SCIENCES Lower-Division Requirements
Constable, Steve
2012-2013 EARTH SCIENCES Lower-Division Requirements Math 20A_____ 20B_____ 20C_____ 20D (BILD 3) _____ SIO 50* _____ Group A: Earth Science Upper-Division Core Requirements (all courses _____ Introduction to Geophysics SIO 104 _____ Paleobiology and History of Life* Group B: Upper-Division Earth
THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN
Rutten, Rob
over large fields, long times and many wave- lengths (heights) simultaneously -- Judge and Peter (1998THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN Sterrekundig Instituut, Postbus 80 000, NLÂ3508 TA, Utrecht, The Netherlands Abstract. This "rapporteur" report discusses the solar photosphere and low
Lower-Dimensional Black Hole Chemistry
Antonia M. Frassino; Robert B. Mann; Jonas R. Mureika
2015-09-18T23:59:59.000Z
The connection between black hole thermodynamics and chemistry is extended to the lower-dimensional regime by considering the rotating and charged BTZ metric in the $(2+1)$-D and a $(1+1)$-D limits of Einstein gravity. The Smarr relation is naturally upheld in both BTZ cases, where those with $Q \
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23T23:59:59.000Z
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Axioms, algorithms and Hilbert's Entscheidungsproblem
Axioms, algorithms and Hilbert's Entscheidungsproblem Jan Stovicek Department of Mathematical Sciences September 9th, 2008 www.ntnu.no Jan Stovicek, Axioms & algorithms #12;2 Outline The Decision & algorithms #12;3 Outline The Decision Problem Formal Languages and Theories Incompleteness Undecidability www
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02T23:59:59.000Z
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.
Tomasz Plawski, J. Hovater
2010-09-01T23:59:59.000Z
A digital low level radio frequency (RF) system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA, and finally a transmitting DAC. This universal platform opens up the possibilities for a variety of control algorithm implementations. The foremost concern for an RF control system is cavity field stability, and to meet the required quality of regulation, the chosen control system needs to have sufficient feedback gain. In this paper we will investigate the effectiveness of the regulation for three basic control system algorithms: I&Q (In-phase and Quadrature), Amplitude & Phase and digital SEL (Self Exciting Loop) along with the example of the Jefferson Lab 12 GeV cavity field control system.
Stability of Coupling Algorithms
Akkasale, Abhineeth
2012-07-16T23:59:59.000Z
of Committee, K. B. Nakshatrala Committee Members, Steve Suh J. N. Reddy Head of Department, Dennis O?Neal May 2011 Major Subject: Mechanical Engineering iii ABSTRACT Stability of Coupling Algorithms. (May 2011) Abhineeth Akkasale, B.E., Bangalore... step. iv To Amma and Anna v ACKNOWLEDGMENTS First and foremost, I thank Dr. Kalyana B. Nakshatrala for being an incredible advisor and for his time and patience in constantly guiding me through my research. I am indebted to him for his guidance...
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01T23:59:59.000Z
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Distributed algorithms for mobile ad hoc networks
Malpani, Navneet
2001-01-01T23:59:59.000Z
We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...
Random Search Algorithms Zelda B. Zabinsky
Del Moral , Pierre
Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross
PVT Analysis With A Deconvolution Algorithm
Kouzes, Richard T.
2011-02-01T23:59:59.000Z
Polyvinyl Toluene (PVT) plastic scintillator is the most common gamma ray detector material used for large systems when only gross counting is needed because of its low cost, robustness, and relative sensitivity. PVT does provide some energy information about the incident photons, as has been demonstrated through the development of Energy Windowing analysis. There is a more sophisticated energy analysis algorithm developed by Symetrica, Inc., and they have demonstrated the application of their deconvolution algorithm to PVT with very promising results. The thrust of such a deconvolution algorithm used with PVT is to allow for identification and rejection of naturally occurring radioactive material, reducing alarm rates, rather than the complete identification of all radionuclides, which is the goal of spectroscopic portal monitors. Under this condition, there could be a significant increase in sensitivity to threat materials. The advantage of this approach is an enhancement to the low cost, robust detection capability of PVT-based radiation portal monitor systems. The success of this method could provide an inexpensive upgrade path for a large number of deployed PVT-based systems to provide significantly improved capability at a much lower cost than deployment of NaI(Tl)-based systems of comparable sensitivity.
5. Greedy and other efficient optimization algorithms
Keil, David M.
5. Greedy and other efficient optimization algorithms David Keil Analysis of Algorithms 7/14 1David Keil Analysis of Algorithms 5. Greedy algorithms 8/14 CSCI 347 Analysis of Algorithms David M. Keil, Framingham State University 5. Greedy and other fast optimization algorithms 1. When the next step is easy
EIA lowers forecast for summer gasoline prices
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production% of41.1Diesel prices increase nationally TheCold FusiongasolineEIA lowers
Lower Snake River I | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaP a gHigh Plains Wind Farm JumpKahului, Hawaii:Lempstersource HistoryLorainLoupLow-PressureInyoLower
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01T23:59:59.000Z
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
Environmental analysis of Lower Pueblo/Lower Los Alamos Canyon, Los Alamos, New Mexico
Ferenbaugh, R.W.; Buhl, T.E.; Stoker, A.K.; Becker, N.M.; Rodgers, J.C.; Hansen, W.R.
1994-12-01T23:59:59.000Z
The radiological survey of the former radioactive waste treatment plant site (TA-45), Acid Canyon, Pueblo Canyon, and Los Alamos Canyon found residual contamination at the site itself and in the channel and banks of Acid, Pueblo, and lower Los Alamos Canyons all the way to the Rio Grande. The largest reservoir of residual radioactivity is in lower Pueblo Canyon, which is on DOE property. However, residual radioactivity does not exceed proposed cleanup criteria in either lower Pueblo or lower Los Alamos Canyons. The three alternatives proposed are (1) to take no action, (2) to construct a sediment trap in lower Pueblo Canyon to prevent further transport of residual radioactivity onto San Ildefonso Indian Pueblo land, and (3) to clean the residual radioactivity from the canyon system. Alternative 2, to cleanup the canyon system, is rejected as a viable alternative. Thousands of truckloads of sediment would have to be removed and disposed of, and this effort is unwarranted by the low levels of contamination present. Residual radioactivity levels, under either present conditions or projected future conditions, will not result in significant radiation doses to persons exposed. Modeling efforts show that future transport activity will not result in any residual radioactivity concentrations higher than those already existing. Thus, although construction of a sediment trap in lower Pueblo Canyon is a viable alternative, this effort also is unwarranted, and the no-action alternative is the preferred alternative.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08T23:59:59.000Z
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06T23:59:59.000Z
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
Algorithms for dynamical overlap fermions
Stefan Schaefer
2006-09-28T23:59:59.000Z
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
Hedge Algorithm and Subgradient Methods
2010-10-05T23:59:59.000Z
standard complexity results on subgradient algorithms allows us to derive optimal parameters ...... the American Statistical Association, 58:13–30, 1963. 1In fact ...
Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms
Balasubramonian, Rajeev
1 Lecture 24: Parallel Algorithms I · Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) · At each clock, processors receive input output #12;4 Control at Each Processor · Each processor stores the minimum number it has seen
A family of lowered isothermal models
Gieles, Mark
2015-01-01T23:59:59.000Z
We present a family of self-consistent, spherical, lowered isothermal models, consisting of one or more mass components, with parameterised prescriptions for the energy truncation and for the amount of radially biased pressure anisotropy. The models are particularly suited to describe the phase-space density of stars in tidally limited, mass-segregated star clusters in all stages of their life-cycle. The models extend a family of isotropic, single-mass models by Gomez-Leyton and Velazquez, of which the well-known Woolley, King and Wilson (in the non-rotating and isotropic limit) models are members. We derive analytic expressions for the density and velocity dispersion components in terms of potential and radius, and introduce a fast model solver in PYTHON (LIMEPY), that can be used for data fitting or for generating discrete samples.
Lower Hybrid antennas for nuclear fusion experiments
Hillairet, Julien; Bae, Young-Soon; Bai, X; Balorin, C; Baranov, Y; Basiuk, V; Bécoulet, A; Belo, J; Berger-By, G; Brémond, S; Castaldo, C; Ceccuzzi, S; Cesario, R; Corbel, E; Courtois, X; Decker, J; Delmas, E; Delpech, L; Ding, X; Douai, D; Ekedahl, A; Goletto, C; Goniche, M; Guilhem, D; Hertout, P; Imbeaux, F; Litaudon, X; Magne, R; Mailloux, J; Mazon, D; Mirizzi, F; Mollard, P; Moreau, P; Oosako, T; Petrzilka, V; Peysson, Y; Poli, S; Preynas, M; Prou, M; Saint-Laurent, F; Samaille, F; Saoutic, B
2015-01-01T23:59:59.000Z
The nuclear fusion research goal is to demonstrate the feasibility of fusion power for peaceful purposes. In order to achieve the conditions similar to those expected in an electricity-generating fusion power plant, plasmas with a temperature of several hundreds of millions of degrees must be generated and sustained for long periods. For this purpose, RF antennas delivering multi-megawatts of power to magnetized confined plasma are commonly used in experimental tokamaks. In the gigahertz range of frequencies, high power phased arrays known as "Lower Hybrid" (LH) antennas are used to extend the plasma duration. This paper reviews some of the technological aspects of the LH antennas used in the Tore Supra tokamak and presents the current design of a proposed 20 MW LH system for the international experiment ITER.
Energy Department Announces $9 Million to Lower Costs, Increase...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Energy Department Announces 9 Million to Lower Costs, Increase Performance of Solar Energy Systems Energy Department Announces 9 Million to Lower Costs, Increase Performance of...
The implementation of the Lower Silver Creek watershed project
Keenan, Christina; McPherson, Mariah
2003-01-01T23:59:59.000Z
Measures on Lower Silver Creek Interim Project. San Jose,Valley Water District. May 1978. Lower Silver Creek, LakeCunningham, Thompson Creek Planning Survey consisting of
Algorithms for Supporting Compiled Communication
Yuan, Xin
Algorithms for Supporting Compiled Communication Xin Yuan Rami Melhem Rajiv Gupta Dept. We present an experimental compiler, ESUIF, that supports compiled communication for High algorithms used in ESUIF. We further demonstrate the effectiveness of compiled communication on all optical
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15T23:59:59.000Z
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.
Nonlinear evolution of lower hybrid waves Charles F. F. Karney
Karney, Charles
problem. With typical fields for lower hybrid heating of a tokamak, it is found that large reflections can occur close to the edge of the plasma. I. INTRODUCTION In typical lower hybrid heating schemes, lower hy, and determine the consequences of our results for lower hybrid heating. The plan of this paper i s a s follows
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01T23:59:59.000Z
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
The lower extremity dexterity test as a measure of lower extremity dynamical capability
Valero-Cuevas, Francisco
Angeles, CA 90089-9006, United States b Department of Biomedical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, United States c School of Applied Physiology the extent to which it is associated with lower extremity strength and anthropometry in healthy young adults
Cholesterol-Lowering Foods Tasty, functional foods help you lower cholesterol naturally.
. Morgan Griffin Reviewed by Brunilda Nazario, MD WebMD Feature Do you want a diet to lower cholesterol? We Harris, DrPH, RD, spokeswoman, American Dietetic Association. U.S. Food and Drug Administration web site. American Dietetic Association web site. National Heart, Lung, and Blood Institute web site. American Heart
Kinematics Algorithms for Tensegrity Structures
Burt, Steven James
2013-01-01T23:59:59.000Z
A kinematic notation for lower-pair mechanisms based onKinematic analysis of a translational 3-dof tensegrity mechanism.
Dynamic Algorithm for Space Weather Forecasting System
Fischer, Luke D.
2011-08-08T23:59:59.000Z
We propose to develop a dynamic algorithm that intelligently analyzes existing solar weather data and constructs an increasingly more accurate equation/algorithm for predicting solar weather accurately in real time. This dynamic algorithm analyzes a...
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01T23:59:59.000Z
Resolution QRS Detection Algorithm for Sparsely Sampled ECGShamlo. 2011. A disk-aware algorithm for time series motifJ. M. Kleinberg, 1997. Two algorithms for nearest-neighbor
End of semester project Global Optimization algorithms
Dreyfuss, Pierre
End of semester project Global Optimization algorithms Ecole Polytechnique de l'UniversitÃ© de Nice.......................................................................................................................................3 II. Simulated annealing algorithm (SA.........................................................................................................................................7 2.Principle,algorithm and choice of parameters
Minimally entangled typical thermal state algorithms
Stoudenmire, E. M.; White, Steven R.
2010-01-01T23:59:59.000Z
s 2 t 2 ? 1 )? 2 and the algorithm continued by defining R 3order indicated, this algorithm for multiplying MPOs scalestypical thermal state algorithms E M Stoudenmire 1 and
Sensor Networks: Distributed Algorithms Reloaded or Revolutions?
Sensor Networks: Distributed Algorithms Reloaded or Revolutions? Roger Wattenhofer Computer. This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why community, a sensor network essentially is a database. The distributed algorithms community should join
A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear ...
A Direct Manipulation Language for Explaining Algorithms
Scott, Jeremy
Instructors typically explain algorithms in computer science by tracing their behavior, often on blackboards, sometimes with algorithm visualizations. Using blackboards can be tedious because they do not facilitate ...
Randomized algorithms for reliable broadcast
Vaikuntanathan, Vinod
2009-01-01T23:59:59.000Z
In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...
Bayesian inference algorithm on Raw
Luong, Alda
2004-01-01T23:59:59.000Z
This work explores the performance of Raw, a parallel hardware platform developed at MIT, running a Bayesian inference algorithm. Motivation for examining this parallel system is a growing interest in creating a self-learning ...
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08T23:59:59.000Z
The paper reviews progress in imaging in radio interferometry for the period 1993-1996. Unlike an optical telescope, the basic measurements of a radio interferometer (correlations between antennas) are indirectly related to a sky brightness image. In a real sense, algorithms and computers are the lenses of a radio interferometer. In the last 20 years, whereas interferometer hardware advances have resulted in improvements of a factor of a few, algorithm and computer advances have resulted in orders of magnitude improvement in image quality. Developing these algorithms has been a fruitful and comparatively inexpensive method of improving the performance of existing telescopes, and has made some newer telescopes possible. In this paper, we review recent developments in the algorithms used in the imaging part of the reduction process. What constitutes an `imaging algorithm'? Whereas once there was a steady `forward' progression in the reduction process of editing, calibrating, transforming and, finally, deconvolving, this is no longer true. The introduction of techniques such as self-calibration, and algorithms that go directly from visibilities to final images, have made the dividing lines less clear. Although we briefly consider self-calibration, for the purposes of this paper calibration issues are generally excluded. Most attention will be directed to the steps which form final images from the calibrated visibilities.
Efficient discrete-time simulations of continuous-time quantum query algorithms
R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo
2008-11-26T23:59:59.000Z
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.
Fact Sheet - Myths & Facts about the lower Snake River dams ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Myths and facts about the lower Snake River dams MYTH: The four lower Snake River dams are low value. FACT: It costs about 5 per megawatt-hour to produce power at the dams. The...
The effects of orthotics on lower extremity variability during running
Brethauer, Samuel
2011-12-31T23:59:59.000Z
Introduction: Abnormal foot mechanics may affect kinematics of the lower extremity, predisposing individuals to injury. Foot orthotics are often used to alter lower extremity mechanics. Little research is available examining ...
Energy Department Announces $25 Million to Lower Cost of Concentrating...
Office of Environmental Management (EM)
5 Million to Lower Cost of Concentrating Solar Power Energy Department Announces 25 Million to Lower Cost of Concentrating Solar Power October 1, 2014 - 2:26pm Addthis Building on...
Fact #889: September 7, 2015 Average Diesel Price Lower than...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
9: September 7, 2015 Average Diesel Price Lower than Gasoline for the First Time in Six Years Fact 889: September 7, 2015 Average Diesel Price Lower than Gasoline for the First...
Updated distribution and reintroduction of the Lower Keys marsh rabbit
Faulhaber, Craig Alan
2005-02-17T23:59:59.000Z
Listed as federally-endangered in 1990, the Lower Keys marsh rabbit (LKMR, Sylvilagus palustris hefneri) exists as a metapopulation in patches of wetland habitat in Florida?s Lower Keys. This study sought to address 2 ...
Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques
Boyer, Edmond
. En particulier plusieurs facettes et applications des algorithmes MCO, MCOP, MCOG, ... seront mises
9. Genetic Algorithms 9.1 Introduction
Cambridge, University of
66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem
Production of highly unidirectional lower-hybrid waves
McWilliams, R.; Okubo, M.; Platt, R.C.; Sheehan, D.P.
1985-01-01T23:59:59.000Z
The development of a highly unidirectional lower-hybrid wave source would improve the electron current drive efficiency in tokamaks. Lower-hybrid waves launched from a phased wave array are shown to be reflected from a grid placed in a cold, low-density plasma. The antenna--grid combination results in highly unidirectional lower-hybrid waves.
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits
Edinburgh, University of
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits Arkadev Chattopadhyay to prove the first lower bounds on general probabilistic multi-round instance compression. We show, and strengthens results of Dubrov and Ishai [DI06]. We also show that a similar lower bound holds for Majority. We
Appendix 28 Geomorphology of the Lower Flathead River
erodible materials (e.g., sedimentary plains). Typically, rivers meander like a whip or snake acrossAppendix 28 Geomorphology of the Lower Flathead River The following description of the geomorphic processes on the lower Flathead River is excerpted from Riparian Inventory of the Lower Flathead River
Papalaskari, Mary-Angela
CSC 8301 Design and Analysis of Algorithms Lecture 1 CSC 8301CSC 8301-- Design and Analysis of AlgorithmsDesign and Analysis of Algorithms Lecture 1Lecture 1 Algorithms: OverviewAlgorithms: Overview Next time: Principles of the analysis of algorithms (2.1, 2.2) Design and Analysis of Algorithms
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 2002 spring out-migration at migrant traps on the Snake River and Salmon River. In 2002 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 11.4 times greater in 2002 than in 2001. The wild Chinook catch was 15.5 times greater than the previous year. Hatchery steelhead trout catch was 2.9 times greater than in 2001. Wild steelhead trout catch was 2.8 times greater than the previous year. The Snake River trap collected 3,996 age-0 Chinook salmon of unknown rearing. During 2002, the Snake River trap captured 69 hatchery and 235 wild/natural sockeye salmon and 114 hatchery coho salmon O. kisutch. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant increase in catch in 2002 was due to a 3.1 fold increase in hatchery Chinook production and a more normal spring runoff. Trap operations began on March 10 and were terminated on June 7. The trap was out of operation for a total of four days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 4.2 times greater and wild Chinook salmon catch was 2.4 times greater than in 2001. The hatchery steelhead trout collection in 2002 was 81% of the 2001 numbers. Wild steelhead trout collection in 2002 was 81% of the previous year's catch. Trap operations began on March 10 and were terminated on May 29 due to high flows. The trap was out of operation for four days due to high flow or debris. The increase in hatchery Chinook catch in 2002 was due to a 3.1 fold increase in hatchery production and differences in flow between years. Changes in hatchery and wild steelhead catch are probably due to differences in flow between years. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2002 data detected a relation between migration rate and discharge for hatchery and wild Chinook salmon. For hatchery and wild Chinook salmon there was a 4.7-fold and a 3.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.8-fold and a 1.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2002 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for wild Chinook salmon and hatchery steelhead trout. The analysis was unable to detect a relation between migration rate and discharge for hatchery Chinook salmon. The lack of a detectable relation was probably a result of the migration rate data being spread over a very narrow range of discharge. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 4.3-fold for wild Chinook salmon and 2.2-fold for hatchery steelhead between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River trap were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at
INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592. Theorem 5.1.2A, 26. Theorem{54. Theorem 5.1.4C, 55. Algorithm 5.1.4D, 50. Theorem 5.1.4D, 57. Algorithm 5.1.4G, 69. Algorithm 5.1.4H, 612. Theorem 5.1.4H, 60. Algorithm 5.1.4I, 49{50. Algorithm 5.1.4P, 70. Algorithm 5.1.4Q, 614. Algorithm 5.1.4S
INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4. Algorithm 1.1F, 466. Algorithm 1.2.1E, 13{14. Algorithm 1.2.1I, 11{12. Algorithm 1.2.2E, 470. Algorithm 1.2.2L, 26. Law 1.2.4A, 40. Law, 81{82. Theorem 1.2.10A, 101. Algorithm 1.2.10M, 96. Theorem 1.2.11.3A, 119. Algorithm 1.3.2E, 160
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
and California algorithm #8 using Fuzzy Logic to evaluate the new algorithm's effectiveness in detecting incidents on freeways. To test these algorithms, real data from TransGuide were run through the algorithms. Algorithm output were compared with CCTV (closed...
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent on
Santhanam, Balu
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent. Stability and convergence time issues of concern for ill- conditioned inputs. Leaky LMS AlgorithmLeaky LMS cost. Block LMS AlgorithmBlock LMS Algorithm Uses type-I polyphase components of the input u[n]: Block
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04T23:59:59.000Z
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Optimisation of Quantum Evolution Algorithms
Patel, Apoorva
2015-01-01T23:59:59.000Z
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Five Quantum Algorithms Using Quipper
Safat Siddiqui; Mohammed Jahirul Islam; Omar Shehab
2014-06-18T23:59:59.000Z
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \\ensuremath{4 \\times 4} matrix constructors for Unitary operators, we have also implemented \\ensuremath{8 \\times 8} and \\ensuremath{16 \\times 16} matrix constructors.
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05T23:59:59.000Z
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a quantum computer can induce quantum chaos and put into question the operability of a quantum computer. In this work I investigate whether already the interactions between the qubits introduced with the intention to operate the quantum computer may lead to quantum chaos. The analysis focuses on two well--known quantum algorithms, namely Grover's search algorithm and the quantum Fourier transform. I show that in both cases the same very unusual combination of signatures from chaotic and from integrable dynamics arises.
A genetic algorithm based method for docking flexible molecules
Judson, R.S. [Sandia National Labs., Livermore, CA (United States); Jaeger, E.P.; Treasurywala, A.M. [Sterling-Winthrop Inc., Collegeville, PA (United States)
1993-11-01T23:59:59.000Z
The authors describe a computational method for docking flexible molecules into protein binding sites. The method uses a genetic algorithm (GA) to search the combined conformation/orientation space of the molecule to find low energy conformation. Several techniques are described that increase the efficiency of the basic search method. These include the use of several interacting GA subpopulations or niches; the use of a growing algorithm that initially docks only a small part of the molecule; and the use of gradient minimization during the search. To illustrate the method, they dock Cbz-GlyP-Leu-Leu (ZGLL) into thermolysin. This system was chosen because a well refined crystal structure is available and because another docking method had previously been tested on this system. Their method is able to find conformations that lie physically close to and in some cases lower in energy than the crystal conformation in reasonable periods of time on readily available hardware.
R. Guerraoui 1 Distributed algorithms
Guerraoui, Rachid
and then algorithms 7 Best-effort broadcast (beb) Events Request: bebBroadcast, m> Indication: bebDeliver, src, m> Â· Properties: BEB1, BEB2, BEB3 8 Best-effort broadcast (beb) Properties BEB1. Validity: If pi and pj are correct, then every message broadcast by pi is eventually delivered by pj BEB2. No duplication: No message
Adaptive protection algorithm and system
Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA
2009-04-28T23:59:59.000Z
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Algorithmic Aspects of Risk Management
Gehani, Ashish
Algorithmic Aspects of Risk Management Ashish Gehani1 , Lee Zaniewski2 , and K. Subramani2 1 SRI International 2 West Virginia University Abstract. Risk analysis has been used to manage the security of sys configuration. This allows risk management to occur in real time and reduces the window of exposure to attack
Machine Learning: Foundations and Algorithms
Ben-David, Shai
with accident prevention systems that are built using machine learning algorithms. Machine learning is also to us). Machine learning tools are concerned with endowing programs with the ability to "learn if the learning process succeeded or failed? The second goal of this book is to present several key machine
Algorithmic + Geometric characterization of CAR
Gill, Richard D.
Algorithmic + Geometric characterization of CAR (Coarsening at Random) Richard Gill - Utrecht but independent) CCAR 3 door problem X=door with car behind Y=two doors still closed = {your first choice, other door left closed} 3 door problem X=door with car behind Y=(your first choice, other door left closed
GEET DUGGAL Algorithms for Determining
Relationship to Gene Regulation Final Public Oral Examination Doctor of Philosophy Recent genome sequencing. Analyses from them have shown that the 3D structure of DNA may be closely linked to genome functions structure of DNA and genome function on the scale of the whole genome. Specifically, we designed algorithms
Hierarchical Correctness Proofs Distributed Algorithms
Tuttle, Mark R.
distributed networks. With this model we are able to construct modular, hierarchical correct- ness proofs these messages and process variables can be extremely di cult, and the resulting proofs of correct- ness of the full algorithm's correct- ness. Some time ago, we began to consider this approach of proof by re nement
Algorithmic Thermodynamics John C. Baez
Tomkins, Andrew
Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + Âµd
Lower Valley Energy- Residential Energy Efficiency Rebate Program
Broader source: Energy.gov [DOE]
Lower Valley Energy offers numerous rebates for residential customers who wish to increase the energy efficiency of eligible homes. Rebates are available for weatherization measures, water heaters,...
Energy Department Announces $3 Million to Lower Cost of Geothermal...
Broader source: Energy.gov (indexed) [DOE]
and development projects to advance technologies that could lower the cost of geothermal energy production while diversifying and stabilizing the supply of critical materials for...
Lowering Drilling Cost, Improving Operational Safety, and Reducing
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
in the Marcellus Shale." DEA Technology Forum. Houston, TX: DEA, 2013. -. "Lowering Drilling Cost, Improving Operational Safety, and Reducing Environmental Impact through...
Innovative, Lower Cost Sensors and Controls Yield Better Energy...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Yield Better Energy Efficiency Innovative, Lower Cost Sensors and Controls Yield Better Energy Efficiency March 23, 2015 - 1:05pm Addthis ORNL researchers are experimenting with...
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journalhttp://www.fnal.gov/directorate/nalcal/nalcal02_07_05_files/nalcal.gif Directorate - Events - Fermilab atBasis Document forB O
Frequency stabilization in nonlinear MEMS and NEMS oscillators
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.
National Energy Modeling System (NEMS) | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaP a g eWorks -09-0018-CX JumpShunMontpelier,Nantong BIOLUX Bioenergy ProteinNational Energy Modeling
Analysis and Representation of Miscellaneous Electric Loads in NEMS -
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41cloth Documentation DataDepartment of EnergyOn-Farm Biofuelin HawaiiNaturalAdvancedintegratedTransportation
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 Data Center Home Page on DeliciousPlasma | Department ofEnergy 9 LehmanDepartment ofTribalChapterAdvancedLightweight Materials Overview
NEM Interpolant for Fourth-Order PDEs Internal Report
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
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318Cubic Feet) YearSalesNew FieldDetailed Tables ToGas)Year Introduction The4464 U.S.4 1
Frequency Stabilization in Nonlinear MEMS and NEMS Oscillators | Argonne
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaiiEnergyFlorida July 9,DepartmentCharge rater.NT opFrequency
Learning Motor Skills: From Algorithms to Robot
Learning Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu Roboter-Experimenten Zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01T23:59:59.000Z
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...
Constant time algorithms in sparse graph model
Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology
2010-01-01T23:59:59.000Z
We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...
A distributed K-mutual exclusion algorithm
Bulgannawar, Shailaja Gurupad
1994-01-01T23:59:59.000Z
This thesis presents a new token-based K-mutual exclusion algorithm for distributed systems. The proposed algorithm uses K tokens to achieve K-mutual exclusion. The system of N nodes is organized as a logical forest, with ...
On Learning Algorithms for Nash Equilibria
Daskalakis, Constantinos
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising games, and thus results on the convergence or ...
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01T23:59:59.000Z
2.2 Graph Search Algorithms . . . . . . . . . . . . .an Efficient Algorithm . . . . . . 4.6.4 RestrictionAn O(r)-Approximation Algorithm for GTSPP . . . . . . . .
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek; Hurand, Mathilde; Sgall, Ji?í
2009-01-01T23:59:59.000Z
5th European symposium on algorithms (ESA) (pp. 296–307).· Real-time systems · Algorithms 1 Introduction Ghosh etfault-tolerance testing algorithm, under the restriction
Algorithms for tandem mass spectrometry-based proteomics
Frank, Ari Michael
2008-01-01T23:59:59.000Z
4. MS-Clustering Algorithm . . . . . . . . . . C.De Novo Sequencing Algorithm . . . . . . C. Experimental2. The RankBoost Algorithm (Freund et al. , 2003) B.
Approximation Algorithms for the Fault-Tolerant Facility Placement Problem
Yan, Li
2013-01-01T23:59:59.000Z
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
MAX-PLANCK-INSTITUT.. ( Lower Bounds for Set Intersection
. Mehlhorn R. Raman C. Uhrig MPI- I-92-127 October 1992 o mPD_ _ _ _ _ _ _ IN F 0 R M AT I K _ _ _ _ __ Im Stadtwald 66123 Saarbrücken Germany #12;Lower Bounds for Set Intersection Queries P. Dietz K. Mehlhorn R. Raman C. Uhrig MPI-I-92-127 October 1992 #12;Lower Bounds for Set Intersection Queries PAUL DIETZ KURT
NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN
Waste Management Zone" (AMZ) as defined in the "Agricultural Inventory of the Lower Fraser Valley Data the data base (acquired from the B.C. Assessment Authority in 1993) in the Ministry of Health report#12;NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN DOE FRAP 1997-25 Prepared for
First satellite observations of lower tropospheric ammonia and methanol
First satellite observations of lower tropospheric ammonia and methanol Reinhard Beer,1 Mark W) and methanol (CH3OH), well above the normal background levels. This is the first time that these molecules have. Citation: Beer, R., et al. (2008), First satellite observations of lower tropospheric ammonia and methanol
Optimization Online - Efficient parallel coordinate descent algorithm ...
Ion Necoara
2012-11-02T23:59:59.000Z
Nov 2, 2012 ... Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC.
Optimization Online - Efficient Algorithmic Techniques for Several ...
Mugurel Ionut Andreica
2008-10-23T23:59:59.000Z
Oct 23, 2008 ... Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems. Mugurel Ionut ...
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09T23:59:59.000Z
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09T23:59:59.000Z
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
Generalized URV Subspace Tracking LMS Algorithm 1
Boley, Daniel
Generalized URV Subspace Tracking LMS Algorithm 1 S. Hosur and A. H. Tew k and D. Boley Dept The convergence rate of the Least Mean Squares (LMS) algorithm is poor whenever the adaptive lter input auto-correlation matrix is ill-conditioned. In this paper we propose a new LMS algorithm to alleviate this problem
Total Algorithms \\Lambda Gerard Tel y
Utrecht, Universiteit
Total Algorithms \\Lambda Gerard Tel y Department of Computer Science, University of Utrecht, P and February 1993 Abstract We define the notion of total algorithms for networks of processes. A total algorithm enforces that a ``decision'' is taken by a subset of the processes, and that participation of all
Distributed QR Factorization Based on Randomized Algorithms
Zemen, Thomas
Distributed QR Factorization Based on Randomized Algorithms Hana Strakov´a1 , Wilfried N. Gansterer of Algorithms Hana.Strakova@univie.ac.at, Wilfried.Gansterer@univie.ac.at 2 Forschungszentrum Telekommunication Wien, Austria Thomas.Zemen@ftw.at Abstract. Most parallel algorithms for matrix computations assume
Finding Algorithms in Scientific Articles Sumit Bhatia
Giles, C. Lee
Finding Algorithms in Scientific Articles Sumit Bhatia , Prasenjit Mitra and C. Lee Giles,giles}@ist.psu.edu ABSTRACT Algorithms are an integral part of computer science literature. How- ever, none of the current search engines offer specialized algorithm search facility. We describe a vertical search engine
Algorithms in pure mathematics G. Stroth
Stroth, Gernot
Algorithms in pure mathematics G. Stroth 1 Introduction In this article, we will discuss algorithmic group theory from the point of view of pure, and where one might be surprised that there is no algorithmic solution. The two most developed areas
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
A DISTRIBUTED POWER CONTROL ALGORITHM FOR
Mitra, Debasis
A DISTRIBUTED POWER CONTROL ALGORITHM FOR BURSTY TRANSMISSIONS ON CELLULAR, SPREAD SPECTRUM, USA ABSTRACT We propose a distributed algorithm for power control in cellular, wideband networks, although its parameters are different from data. We propose a distributed algorithm for power control
university-logo Intro Algorithm Results Concl.
Aarts, Gert
university-logo Intro Algorithm Results Concl. Strong coupling lattice QCD at finite temperature Ph. de Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. QCD Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. Motivation (1
Equivalence of Learning Algorithms Julien Audiffren1
Equivalence of Learning Algorithms Julien Audiffren1 and Hachem Kadri2 1 CMLA, ENS Cachan is to introduce a concept of equivalence between machine learn- ing algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01T23:59:59.000Z
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close proximity in the phase space to each other. We show the performance of our algorithm in the case of magnetic shower.
The Observer Algorithm for Visibility Approximation
Doherty, Patrick
, with dif- ferent view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm or more sentries while moving to a goal position. Algorithms for finding a covert paths in the presence of stationary and moving sentries has been devised by [5] [6]. An approximate visibility algorithm was devised
Study of Proposed Internet Congestion Control Algorithms*
Study of Proposed Internet Congestion Control Algorithms* Kevin L. Mills, NIST (joint work with D Y Algorithms Mills et al. Innovations in Measurement Science More information @ http;Study of Proposed Internet Congestion Control Algorithms Mills et al. OutlineOutline Technical
Partitioned algorithms for maximum likelihood and
Smyth, Gordon K.
Partitioned algorithms for maximum likelihood and other nonlinear estimation Gordon K. Smyth There are a variety of methods in the literature which seek to make iterative estimation algorithms more manageable by breaking the iterations into a greater number of simpler or faster steps. Those algorithms which deal
Algorithms and Theory of Computation Handbook, Second
Algorithms and Theory of Computation Handbook, Second Edition CRC PRESS Boca Raton Ann Arbor London Parameterized Algorithms 1 Rodney G. Downey and Catherine McCartin School of Mathematical and Computing Sciences.2 The Main Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Practical FPT Algorithms
Minimum-Flip Supertrees: Complexity and Algorithms
Sanderson, Michael J.
Minimum-Flip Supertrees: Complexity and Algorithms Duhong Chen, Oliver Eulenstein, David Ferna that it is fixed-parameter tractable and give approximation algorithms for special cases. Index Terms assembled from all species in the study. Because the conventional algorithms to solve these problems
Tuning bandit algorithms in stochastic environments
Szepesvari, Csaba
Tuning bandit algorithms in stochastic environments Jean-Yves Audibert1 and R´emi Munos2 and Csaba@cs.ualberta.ca Abstract. Algorithms based on upper-confidence bounds for balancing exploration and exploitation a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account
A Genetic Algorithm Approach for Technology Characterization
Galvan, Edgar
2012-10-19T23:59:59.000Z
A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY CHARACTERIZATION A Thesis by EDGAR GALVAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE August 2012 Major Subject: Mechanical Engineering A Genetic Algorithm Approach for Technology Characterization Copyright 2012 Edgar Galvan A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY...
Algorithmic proof of Barnette's Conjecture
I. Cahit
2009-04-22T23:59:59.000Z
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the operation of opening disjoint chambers, bu using spiral-chain like movement of the outer-cycle elastic-sticky edges of the cubic planar graph. In fact we have shown that in hamiltonicity of Barnette graph a single-chamber or double-chamber with a bridge face is enough to transform the problem into finding specific hamiltonian path in the cubic bipartite graph reduced. In the last part of the paper we have demonstrated that, if the given cubic planar graph is non-hamiltonian then the algorithm which constructs spiral-chain (or double-spiral chain) like chamber shows that except one vertex there exists (n-1)-vertex cycle.
Santhanam, Balu
LMS Algorithm: MotivationLMS Algorithm: Motivation Only a single realization of observations : delay in tap-weight adjustment. Simplicity: real-time applications possible. LMS AlgorithmLMS Algorithm Use instantaneous estimates for statistics: Filter output: Estimation error: Tap-weight update: LMS
Logo-like Learning of Basic Concepts of Algorithms -Having Fun with Algorithms
Logo-like Learning of Basic Concepts of Algorithms - Having Fun with Algorithms Gerald Futschek are not primarily interested in programming the way of learning is highly influenced by the Logo style of learning to design efficient algorithms. Keywords Logo-like learning, algorithms, group learning 1 2 3 4 5 n ... 1
On the relation between the MXL family of algorithms and Grobner basis algorithms
International Association for Cryptologic Research (IACR)
On the relation between the MXL family of algorithms and Gr¨obner basis algorithms Martin R Solving (PoSSo) problem. The most efficient known algorithms reduce the Gr¨obner basis computation", on which a new family of algorithms is based (MXL, MXL2 and MXL3). By studying and de- scribing
Improved algorithms for reaction path following: Higher-order implicit algorithms
Schlegel, H. Bernhard
Improved algorithms for reaction path following: Higher-order implicit algorithms Carlos Gonzaleza (Received 13May 1991;accepted17June 1991) Eight new algorithms for reaction path following are presented or if accurate propertiessuch ascurvature and frequenciesare needed.3*4 Numerous algorithms exist for following
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23T23:59:59.000Z
We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the Hybrid R Algorithm, RHMC is reversible, admitting a Metropolis accept/reject step that eliminates the $\\mathcal{O}(\\delta t^2)$ errors inherent in the R Algorithm. We also employ several algorithmic speed-ups, including multiple time scales, the use of a more efficient numerical integrator, and Hasenbusch pre-conditioning of the fermion force.
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23TribalInformation Access toTen Problems in ExperimentalUnitarityOrganic lightCap plasticity 'ORNL
Distributed Approaches for Determination of Reconfiguration Algorithm Termination
Lai, Hong-jian
Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard
on the complexity of some hierarchical structured matrix algorithms
2012-05-17T23:59:59.000Z
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
Big and Small Ideas: How to Lower Solar Financing Costs
Broader source: Energy.gov [DOE]
DOE hosted the "Big & Small Ideas: How to Lower Solar Financing Costs" breakout session during the SunShot Grand Challenge Summit and Technology Forum. This session explored a range of...
Wild and Scenic River Acts (Lower St. Croix Riverway)
Broader source: Energy.gov [DOE]
The lower portion of the St. Croix River in Minnesota and Wisconsin is regulated under the National Wild and Scenic Rivers Program. Most new residential, commercial, and industrial uses are...
Several new lower bounds for football pool systems
Litsyn, Simon
Several new lower bounds for football pool systems Uri Blass and Simon Litsyn TelAviv University a big deal of attention due to its equivalence to constructing systems for football pools. A survey
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA A Thesis Submitted Institute for providing the SCADA trace and to Andrew K. Wright for suggesting semi-embedded devices. I
Optimization Online - Lower Bounds on Complexity of Lyapunov ...
Amir Ali Ahmadi
2015-04-14T23:59:59.000Z
Apr 14, 2015 ... Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems ... of the optimal product, generalizing a result of Lagarias and Wang. ... belonging to some of the most popular function classes in controls.
A Tight Lower Bound for the Adjacent Quadratic Assignment Problem
Borzou Rostami
2014-09-23T23:59:59.000Z
Sep 23, 2014 ... A Tight Lower Bound for the Adjacent Quadratic Assignment Problem ... The first is based on a ``flow'' formulation whose linear relaxation can be solved very efficiently ... Category 2: Integer Programming (0-1 Programming ).
Are independent directors effective in lowering earnings management in China?
Lai, Liona Hoi Yan
2006-10-30T23:59:59.000Z
investigate: (i) whether voluntary adoption of board independence prior to the China Regulatory Securities Commission (CSRC) regulation on board independence is associated with lower earnings management; and (ii) the extent to which the CSRC regulation...
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Print It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
2008 00:00 It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
Lower bounds for the earliness-tardiness scheduling problem on ...
2004-10-27T23:59:59.000Z
and show that the gap between upper and lower bounds is about 1%. ..... n jobs and the supply of source i is at most pi. There are T sinks with a demand.
Oxygen enhanced switching to combustion of lower rank fuels ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
enhanced switching to combustion of lower rank fuels Re-direct Destination: A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum...
The coolability limits of a reactor pressure vessel lower head
Theofanous, T.G.; Syri, S. [Univ. of California, Santa Barbara, CA (United States)
1995-09-01T23:59:59.000Z
Configuration II of the ULPU experimental facility is described, and from a comprehensive set of experiments are provided. The facility affords full-scale simulations of the boiling crisis phenomenon on the hemispherical lower head of a reactor pressure vessel submerged in water, and heated internally. Whereas Configuration I experiments (published previously) established the lower limits of coolability under low submergence, pool-boiling conditions, with Configuration II we investigate coolability under conditions more appropriate to practical interest in severe accident management; that is, heat flux shapes (as functions of angular position) representative of a core melt contained by the lower head, full submergence of the reactor pressure vessel, and natural circulation. Critical heat fluxes as a function of the angular position on the lower head are reported and related the observed two-phase flow regimes.
Woody vegetation of the lower Navasota River watershed
Allen, Harriet Louise Gell
1974-01-01T23:59:59.000Z
WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by DIl 5~ HARRIET ?GELL ALLEN Submitted to the Graduate College of Texas A&M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE December... 1974 Major Subject: Range Science WOODY VEGETATION OF THE LOWER NAVASOTA RIVER WATERSHED A Thesis by HARRIET GELL ALLEN Approved as to style and content by: (Chairman of Committee) (Head of Department) (Member) (Member) December 1974...
A Mobile Motion Analysis System Using Intertial Sensors for Analysis of Lower Limb Prosthetics
Mueller, John Kyle P [ORNL] [ORNL; Ericson, Milton Nance [ORNL] [ORNL; Farquhar, Ethan [ORNL] [ORNL; Lind, Randall F [ORNL] [ORNL; Evans III, Boyd Mccutchen [ORNL] [ORNL
2011-01-01T23:59:59.000Z
Soldiers returning from the global war on terror requiring lower leg prosthetics generally have different concerns and requirements than the typical lower leg amputee. These subjects are usually young, wish to remain active and often desire to return to active military duty. As such, they demand higher performance from their prosthetics, but are at risk for chronic injury and joint conditions in their unaffected limb. Motion analysis is a valuable tool in assessing the performance of new and existing prosthetic technologies as well as the methods in fitting these devices to both maximize performance and minimize risk of injury for the individual soldier. We are developing a mobile, low-cost motion analysis system using inertial measurement units (IMUs) and two custom force sensors that detect ground reaction forces and moments on both the unaffected limb and prosthesis. IMUs were tested on a robot programmed to simulate human gait motion. An algorithm which uses a kinematic model of the robot and an extended Kalman filter (EKF) was used to convert the rates and accelerations from the gyro and accelerometer into joint angles. Compared to encoder data from the robot, which was considered the ground truth in this experiment, the inertial measurement system had a RMSE of <1.0 degree. Collecting kinematic and kinetic data without the restrictions and expense of a motion analysis lab could help researchers, designers and prosthetists advance prosthesis technology and customize devices for individuals. Ultimately, these improvements will result in better prosthetic performance for the military population.
Hero, Alfred O.
Background Basic methods Model-based algorithms Model-free algorithms RTI Perspectives Conclusions 23, 2015 1 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI Coates (McGill) 2 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17T23:59:59.000Z
The model of laminated wave turbulence puts forth a novel computational problem - construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order $10^{12}$ and more. The equations to be solved in integers are resonant conditions for nonlinearly interacting waves and their form is defined by the wave dispersion. It is established that for the most common dispersion as an arbitrary function of a wave-vector length two different generic algorithms are necessary: (1) one-class-case algorithm for waves interacting through scales, and (2) two-class-case algorithm for waves interacting through phases. In our previous paper we described the one-class-case generic algorithm and in our present paper we present the two-class-case generic algorithm.
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19T23:59:59.000Z
Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.
Geometric lower bound for a quantum coherence measure
Diego Paiva Pires; Lucas C. Céleri; Diogo O. Soares-Pinto
2015-04-23T23:59:59.000Z
Nowadays, geometric tools are being used to treat a huge class of problems of quantum information science. By understanding the interplay between the geometry of the state space and information-theoretic quantities, it is possible to obtain less trivial and more robust physical constraints on quantum systems. In this sense, here we establish a geometric lower bound for the Wigner-Yanase skew information (WYSI), a well-known information theoretic quantity recently recognized as a proper quantum coherence measure. Starting from a mixed state evolving under unitary dynamics, while WYSI is a constant of motion, the lower bound indicates the rate of change of quantum statistical distinguishability between initial and final states. Our result shows that, since WYSI fits in the class of Petz metrics, this lower bound is the change rate of its respective geodesic distance on quantum state space. The geometric approach is advantageous because raises several physical interpretations of this inequality under the same theoretical umbrella.
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2014-11-17T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase the qubits' purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of 13C2-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. For example, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
LO, NLO, LO* and jet algorithms
J. Huston
2010-01-14T23:59:59.000Z
The impact of NLO corrections, and in particular, the role of jet algorithms, is examined for a variety of processes at the Tevatron and LHC.
Optimization Online - Efficient Heuristic Algorithms for Maximum ...
T. G. J. Myklebust
2012-11-19T23:59:59.000Z
Nov 19, 2012 ... Efficient Heuristic Algorithms for Maximum Utility Product Pricing Problems. T. G. J. Myklebust(tmyklebu ***at*** csclub.uwaterloo.ca)
Efficient Algorithmic Techniques for Several Multidimensional ...
Mugurel
2008-10-23T23:59:59.000Z
Politehnica University of Bucharest, Romania, mugurel.andreica@cs.pub.ro. Abstract: In this paper I present several novel, efficient, algorithmic techniques for.
Parallel Interval Continuous Global Optimization Algorithms
abdeljalil benyoub
2002-07-19T23:59:59.000Z
Jul 19, 2002 ... Abstract: We theorically study, on a distributed memory architecture, the parallelization of Hansen's algorithm for the continuous global ...
High-Performance Engineering Optimization: Applications, Algorithms...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
High-Performance Engineering Optimization: Applications, Algorithms, and Adoption Event Sponsor: Mathematics and Computer Science Division Start Date: Aug 19 2015 - 10:30am...
Design and Analysis of Algorithms Course Page
Design and Analysis of Algorithms. TTR 3:05- 4:25, IC 109. OFFICE HOURS: Wed 11-12 or by appointment (Rm: Skiles, 116).
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
Lowering On-Road Fuel Use: A Component Approach
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Department ofFormerCommittee: Notice ofJoshuaviiof Lower Colorado River Authority'sLowering On-Road
Lower and upper probabilities in the distributive lattice of subsystems
A. Vourdas
2014-10-08T23:59:59.000Z
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m) is the projector to) obeys a supermodularity inequality, and it is interpreted as a lower probability in the sense of the Dempster-Shafer theory, and not as a Kolmogorov probability. It is shown that the basic concepts of the Dempster-Shafer theory (lower and upper probabilities and the Dempster multivaluedness) are pertinent to the quantum formalism of finite systems.
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . , . Event Scan Algorithm . Neural Network . . . . . . . . . . . . . . . , . . . . . . California Algorithm ?8 with Fuzzy Logic Selected Algorithms Page 20 21 22 24 24 25 26 27 28 28 30 32 32 33 33 33 33... 7 California Algorithm ?10 Decision Tree 12 14 15 8 Speed/Flow Curve 9 McMaster Algorithm Template 15 25 10 Traffic Flow Relationships Applied in the Dynamic Model Algorithm. . . 26 11 Multi-Layer Feed-Forward Neural Network 12 Membership...
St Andrews, University of
The Need for Language Repair The Reformation Algorithm Discussion Reformation: A Domain of Edinburgh University of St Andrews, 27th November 2013 #12;The Need for Language Repair The Reformation Algorithm Discussion Outline 1 The Need for Language Repair 2 The Reformation Algorithm 3 Discussion #12;The
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL Mehdi-NN search in large scale image databases, based on top-k multi-criteria search tech- niques. The method retrieval, stor- age requirements and update cost. The search algorithm delivers ap- proximate results
Vaze, Rahul
2011-01-01T23:59:59.000Z
We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of...
Investigation of Newton-Krylov algorithms for low Mach number compressible flow
McHugh, P.R.; Knoll, D.A.; Mousseau, V.A.; Hansen, G.A.
1995-10-01T23:59:59.000Z
Fully coupled Newton-Krylov algorithms are used to solve steady speed compressible flow past a backward facing step flow Mach and Reynolds numbers. Various preconditioned Krylov iterative methods are used to solve the linear systems that arise on each Newton step, specifically Lanczos-based and Arnoldi-based algorithms. Several preconditioning strategies are considered to improve the performance of these iterative techniques, including incomplete lower-upper factorization with various levels of fill-in [ILU(k)] and domain based additive and multiplicative Schwarz type preconditioning both with and without overlapping domains. The ILU(K) preconditioners were generally less reliable for lower values of the flow Mach number, and exhibited strong sensitivity to cell ordering. In addition, the parallel nature of the domain based preconditioners is exploited on both a shared memory computer and a distributed system of workstations. Important aspects of the numerical solutions are discussed.
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948-
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948- With particular reference to the Willamette River, intended to aid or direct management or utilization praotices and as gi.\\ides for administrative POLLUTION IN THE LOTOR COLIMRIA BASIN IN 1948 WITH PARTI CirW.R REFERENCE TO THE WTLLAJTETTE BASIN
Lower bounding procedure for the Asymmetric Quadratic Traveling ...
2015-02-04T23:59:59.000Z
a lower bound is to linearize the quadratic terms xijxjk for all (i, j),(j, k) ? A ..... Consider any cycle C. Since column Cp is the selected column to enter the basis we ..... some kind of subtour elimination constraint, we restrict the search to find a
Surface OceanLower Atmosphere Processes Geophysical Research Series 187
Kohfeld, Karen
, British Columbia, Canada Andy Ridgwell Bristol Research Initiative for the Dynamic Global Environment251 Surface OceanLower Atmosphere Processes Geophysical Research Series 187 Copyright 2009, and processes have been identified that have improved our understanding of the modern and future carbon cycle
A lower bound of quantum conditional mutual information
Lin Zhang; Junde Wu
2014-09-29T23:59:59.000Z
In this paper, a lower bound of quantum conditional mutual information is obtained by employing the Peierls-Bogoliubov inequality and Golden Thompson inequality. Comparison with the bounds obtained by other researchers indicates that our result is independent of any measurements. It may give some new insights over squashed entanglement and perturbations of Markov chain states.
Lower Oil Prices: A Reason to Give Thanks GENE EPSTEIN
California at Davis, University of
Lower Oil Prices: A Reason to Give Thanks By GENE EPSTEIN Nov. 29, 2014 1:31 a.m. ET I give thanks thanks for an oil price that fell below $70 a barrel Friday, mainly because it bodes well for general early this year ("Here Comes $75 Oil," March 31). Amy Jaffe, executive director of energy
Citrus Varieties for the Lower Rio Grande Valley.
Wood, J. F. (John Fielding); Friend, W. H. (William Heartsill)
1941-01-01T23:59:59.000Z
of juice, 191.0 cc.; per cent juice by wt., 48.4; CITRUS VARIETIES FOR THE LOWER RIO GRANDE VALLEY 11 typical seed 15 x 9 mm.; total solids, 10.15; acid, 1.68; solids to acid ratio, 6.0:l. Ripening season, October 15 to December 1. Cecily Seedless...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Hernandez, Manuel
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
New Lower Bounds for Online k-Server Routing Problems
Krumke, Sven O.
New Lower Bounds for Online k-Server Routing Problems Irene Fink a Sven O. Krumke a Stephan, 67653 Kaiserslautern, Germany. {fink,krumke,westphal}@mathematik.uni-kl.de Abstract In a k-server routing problem k 1 servers move in a metric space in order to visit specified points or carry objects
Is there Lower Limit to Velocity or Velocity Change?
B. N. Sreenath; Kenath Arun; C. Sivaram
2013-06-19T23:59:59.000Z
Here we explore the possibility of a lower limit to velocity or velocity change which is 20 orders of magnitude smaller than the speed of light and explore the various observable signatures including those in cosmic rays and gamma ray bursts.
Lower Bounds on Testing Membership to a Polyhedron by
Grigoriev, Dima
Email:imilar question was ope* *n for algebraic decision dima@cse.psu.edu. Supported in part by the Volkswagen and ECUS030, and by the Volkswagen-Stiftung.oEmail:btaining lower bounds f* *or the complexity of test
DEVELOPMENTS IN LARGE BLADES FOR LOWER COST WIND TURBINES
DEVELOPMENTS IN LARGE BLADES FOR LOWER COST WIND TURBINES by Thomas D. Ashwill Sandia National of the WindPACT project, the Blade System Design Studies developed innovations in manufacturing, materials capacity is a companion drop in the cost of wind energy (COE). The current cost of wind-produced power
Traversal, Case Analysis, and Lowering for C++ Program Analysis
Wagner, Luke A.
2010-01-14T23:59:59.000Z
++. This extension, named Filter, assists the tool builder in traversal, case analysis, and lowering of the data structure representing C++ programs. Comparisons described in the thesis show a 2-4x code reduction when solving basic problems (e.g., searching for uses...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Hernandez, Manuel
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC-TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES
Paris-Sud XI, Université de
MUSIC-TYPE ALGORITHM FOR EDDY-CURRENT NONDESTRUC- TIVE EVALUATION OF SMALL DEFECTS IN METAL PLATES Eddy-Current nondestructive evaluation of metal plates is of interest in a wide range of applications in the lower frequency band (kHz) for eddy-current testing, to retrieve small void defects inside a conducting
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11T23:59:59.000Z
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of number fields to an open conjecture from elementary number theory.
On the Potential of Automatic Algorithm Configuration
Hutter, Frank
.g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well lead to enormous speed-ups of tree search algorithms for SAT for solving SAT-encoded software The problem of setting an algorithm's free parameters for maximal performance on a class of problem instances
Quadruped Gait Learning Using Cyclic Genetic Algorithms
Hickey, Timothy J.
and in particular, Genetic Algorithms, have previously been used to develop gaits for legged (primarily hexapod]. In a previous work Parker made use of cyclic genetic algorithms to develop walking gaits for a hexapod robot [5]. Each of the six legs of this hexapod robot could only move vertically and horizontally and the number
Enhancing Smart Home Algorithms Using Temporal Relations
Cook, Diane J.
Enhancing Smart Home Algorithms Using Temporal Relations Vikramaditya R. JAKKULA1 and Diane J COOK School of Electrical Engineering and Computer Science Abstract. Smart homes offer a potential benefit improves the performance of these algorithms and thus enhances the ability of smart homes to monitor
Virtual Scanning Algorithm for Road Network Surveillance
Jeong, Jaehoon "Paul"
Virtual Scanning Algorithm for Road Network Surveillance Jaehoon Jeong, Student Member, IEEE, Yu Gu a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design roadways and 2) the road network maps are normally known. We guarantee the detection of moving targets
Communication and Computation in Distributed CSP Algorithms
Krishnamachari, Bhaskar
Communication and Computation in Distributed CSP Algorithms C`esar Fern`andez1 , Ram´on B´ejar1 in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
Power Control Algorithms in Wireless Communications
Power Control Algorithms in Wireless Communications Judd Rohwer , Chaouki T. Abdallah , Aly El-Osery 1 Abstract This paper presents a comprehensive review of the published algorithms on power control) and Time Division Multiple Access (TDMA). 2 Introduction Power control in cellular systems is applied
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
A Faster Primal Network Simplex Algorithm
Aggarwal, Charu C.
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...
ASYNPLEX, an asynchronous parallel revised simplex algorithm
Hall, Julian
ASYNPLEX, an asynchronous parallel revised simplex algorithm J.A.J. Hall K.I.M. McKinnon February, an asynchronous parallel revised simplex algorithm J. A. J. Hall K. I. M. McKinnon 27th February 1998 Abstract This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable
Buffer assignment algorithms for data driven architectures
Chatterjee, Mitrajit
1994-01-01T23:59:59.000Z
algorithms have been shown to be O(V x E) and O(V'xlogV) re spectively; an improvement over the existing strategies. A novel buffer distribution algorithm to maximize the pipelining and throughput has also been proposed. The number of buffers obtained...
Stochastic Search for Signal Processing Algorithm Optimization
Stochastic Search for Signal Processing Algorithm Optimization Bryan Singer Manuela Veloso May address the complex task of signal processing optimization. We first introduce and discuss the complexities of this domain. In general, a single signal processing algorithm can be represented by a very
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05T23:59:59.000Z
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08T23:59:59.000Z
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15T23:59:59.000Z
We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.
Energy Aware Algorithmic Engineering Swapnoneel Roy
Rudra,, Atri
Energy Aware Algorithmic Engineering Swapnoneel Roy School of Computing University of North Florida: akshat.verma@in.ibm.com Abstract--In this work, we argue that energy management should be a guiding are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number
Algorithmic Problems in Power Management Sandy Irani
Pruhs, Kirk
Algorithmic Problems in Power Management Sandy Irani School of Information and Computer Science on algorithmic problems related to power management. We will try to highlight some open problems that we feel are interesting. This survey places more concentration on lines of research of the authors: managing power using
Algorithmic cooling and scalable NMR quantum computers
Mor, Tal
Algorithmic cooling and scalable NMR quantum computers P. Oscar Boykin*, Tal MorÂ§ , Vwani cooling (via polarization heat bath)--a powerful method for obtaining a large number of highly polarized (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression
EM Algorithms from a Non-Stochastic Perspective Charles Byrne
Byrne, Charles
EM Algorithms from a Non-Stochastic Perspective Charles Byrne Charles Byrne@uml.edu Department The EM algorithm is not a single algorithm, but a template for the con- struction of iterative algorithms a method for estimat- ing parameters in statistics, the essence of the EM algorithm is not stochastic
A Visualization System for Correctness Proofs of Graph Algorithms
Metaxas, Takis
A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm
QRlike Algorithms---An Overview of Convergence Theory and Practice
QRÂlike Algorithms--- An Overview of Convergence Theory and Practice David S. Watkins Abstract. The family of GR algorithms is discussed. This includes the stanÂ dard and multishift QR and LR algorithms, the Hamiltonian QR algorithm, divideÂandÂconquer algorithms such as the matrix sign function method, and many
Sketching, streaming, and sub-linear space algorithms
Reif, Rafael
Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) #12 algorithms are approximate · We assume worst-case input stream Adversaries do exist General algorithms Modular composition · Randomized algorithms OK (often necessary) Randomness in the algorithm
Discrimination of Unitary Transformations and Quantum Algorithms
David Collins
2008-11-09T23:59:59.000Z
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the sequence with others remaining fixed. For oracle query algorithms, the input determines the oracle unitary transformation. Such algorithms can be regarded as devices for discriminating amongst a set of unitary transformations. The question arises: "Given a set of known oracle unitary transformations, to what extent is it possible to discriminate amongst them?" We investigate this for the Deutsch-Jozsa problem. The task of discriminating amongst the admissible oracle unitary transformations results in an exhaustive collection of algorithms which can solve the problem with certainty.
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15T23:59:59.000Z
Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.
An improved spectral graph partitioning algorithm for mapping parallel computations
Hendrickson, B.; Leland, R.
1992-09-01T23:59:59.000Z
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.
Electron heating using lower hybrid waves in the PLT tokamak
Bell, R.E.; Bernabei, S.; Cavallo, A.; Chu, T.K.; Luce, T.; Motley, R.; Ono, M.; Stevens, J.; von Goeler, S.
1987-06-01T23:59:59.000Z
Lower hybrid waves with a narrow high velocity wave spectrum have been used to achieve high central electron temperatures in a tokamak plasma. Waves with a frequency of 2.45 GHz launched by a 16-waveguide grill at a power level less than 600 kW were used to increase the central electron temperature of the PLT plasma from 2.2 keV to 5 keV. The magnitude of the temperature increase depends strongly on the phase difference between the waveguides and on the direction of the launched wave. A reduction in the central electron thermal diffusivity is associated with the peaked electron temperature profiles of lower hybrid current-driven plasmas. 16 refs.
Oxygen enhanced switching to combustion of lower rank fuels
Kobayashi, Hisashi; Bool III, Lawrence E.; Wu, Kuang Tsai
2004-03-02T23:59:59.000Z
A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum amount of energy per unit of time is enabled to combust fuel having a lower energy content, while still obtaining at least the stated minimum energy generation rate, by replacing a small amount of the combustion air fed to the furnace by oxygen. The replacement of oxygen for combustion air also provides reduction in the generation of NOx.
Chitinozoans in the subsurface Lower Paleozoic of West Texas
Kauffman, A. E.
1971-10-22T23:59:59.000Z
THE UNIVERSITY OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS October 22, 1971 Paper 54 CHITINOZOANS IN THE SUBSURFACE LOWER PALEOZOIC OF WEST TEXAS A. E. KAUFFMAN Humble Oil & Refining Company, Midland, Texas ABSTRACT Studies based on both comprehensive... are found throughout the West Texas area. As generally accepted by operational petroleum geologists, the Simpson Group comprises the Joins Formation (limestone and dolomite); Oil Creek Formation (sandstone, shale, and limestone); McLish Formation (sand...
Lower Colorado River Authority LCRA | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaPLawrence County, Pennsylvania: EnergyInformation Louisiana'sInformationLowell, Michigan:Lower
Nonlinear lower-hybrid oscillations in cold plasma
Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Calcutta 700 064 (India); Sengupta, Sudip [Institute of Plasma Research, Bhat, Gandhinagar 382428 (India)
2010-08-15T23:59:59.000Z
In a fluid description nonlinear lower-hybrid oscillation have been studied in a cold quasineutral magnetized plasma using Lagrangian variables. An exact analytical solution with nontrivial space and time dependence is obtained. The solution demonstrates that under well defined initial and boundary conditions the amplitude of the oscillations increases due to nonlinearity and then comes back to its initial condition again. These solutions indicate a class of nonlinear transient structures in magnetized plasma.
Lower Metal Enrichment of Virialized Gas in Minihalos
Renyue Cen; Mario A. Riquelme
2007-04-26T23:59:59.000Z
We differentiate between the metal enrichment of the gas in virialized minihalos and that of the intergalactic medium at high redshift, pertinent to cosmological reionization, with the initial expectation that gas in the high density regions within formed dark matter halos may be more robust thus resistant to mixing with lower density intergalactic medium. Using detailed hydrodynamic simulations of gas clouds in minihalos subject to destructive processes associated with the encompassing intergalactic shocks carrying metal-enriched gas, we find, as an example, that, for realistic shocks of velocities of 10-100km/s, more than (90%,65%) of the high density gas with rho>500 rhob inside a minihalo virialized at z=10 of mass (10^7,10^6)Msun remains at a metallicity lower than 3% of that of the intergalactic medium by redshift z=6. It may be expected that the high density gas in minihalos becomes fuel for subsequent star formation, when they are incorporated into larger halos where efficient atomic cooling can induce gas condensation hence star formation. Since minihalos virialize at high redshift when the universe is not expected to have been significantly reionized, the implication is that gas in virialized minihalos may provide an abundant reservoir of primordial gas to possibly allow for the formation of Population-III metal-free stars to extend to much lower redshift than otherwise expected based on the enrichment of intergalactic medium.
Lower Columbia River Terminal Fisheries Research Project : Final Environmental Assessment.
United States. Bonneville Power Administration.
1995-04-01T23:59:59.000Z
This notice announces BPA`S`s decision to fund the Oregon Department of Fish and Wildlife (ODFW), the Washington Department of Fish and Wildlife (WDFW), and the Clatsop Economic Development Committee for the Lower Columbia River Terminal Fisheries Research Project (Project). The Project will continue the testing of various species/stocks, rearing regimes, and harvest options for terminal fisheries, as a means to increase lower river sport and commercial harvest of hatchery fish, while providing both greater protection of weaker wild stocks and increasing the return of upriver salmon runs to potential Zone 6 Treaty fisheries. The Project involves relocating hatchery smolts to new, additional pen locations in three bays/sloughs in the lower Columbia River along both the Oregon and Washington sides. The sites are Blind Slough and Tongue Point in Clatsop County, Oregon, and Grays Bay/Deep River, Wahkiakum County, Washington. The smolts will be acclimated for various lengths of time in the net pens and released from these sites. The Project will expand upon an existing terminal fisheries project in Youngs Bay, Oregon. The Project may be expanded to other sites in the future, depending on the results of this initial expansion. BPA`S has determined the project is not a major Federal action significantly affecting the quality of the human environment, within the meaning of the National Environmental Policy Act (NEPA) of 1969. Therefore, the preparation of an environmental impact statement is not required, and BPA`S is issuing this FONSI.
Public policy implications of deepening the lower Mississippi
Cocchiara, J.G.
1983-11-01T23:59:59.000Z
The Mississippi River and its tributary system serves the industrial and agricultural heartland of the United States. In terms of total tonnage, the deep water channel of the lower Mississippi, stretching 253 miles from the Gulf of Mexico to Baton Rouge, is the largest port complex in the world. The vast majority of the cargo carried on the river is carried in bulk, a major portion of which could benefit from a deeper river channel. The Corps of Engineers has recommended a 55 foot channel to Baton Rouge, but the Reagan administration has insisted that the federal government will no longer fully fund such projects. In response, the State of Louisiana, under the direction of Governor David C. Treen, has conducted its own independent in-depth evaluation of providing deeper draft access to the lower Mississippi. A special task force established for this purpose recently concluded a year long investigation. On September 2, it issued a recommendation for a phased deepening project, at a significantly lower cost than the Corps recommended plan, in combination with private development of offshore topping-off facilities.
Environmental audit, Bonneville Power Administration, lower Columbia area
Not Available
1990-11-01T23:59:59.000Z
This report documents the results of the US Department of Energy's (DOE's) Environmental Audit conducted by the DOE Headquarters Office of Environmental Audit within the Bonneville Power Administration's (BPA's) Lower Columbia Area. The BPA facilities included in the Audit are the Ross Complex in Vancouver, Washington; the substations of North Bonneville, North Bonneville Annex, Camas, and Longview within the state of Washington; and the Acton and Troutdale Substations within the state of Oregon. The independent Audit was conducted by a team of professionals from DOE and contractors. The purpose of the Audit is to provide the Secretary of Energy, Admiral James D. Watkins, Ret., with the status of environmental programs within BPA's Lower Columbia Area. The Environmental Audit team identified 25 findings dealing with the lack of conformance with federal and state laws and regulations and DOE Orders, and 7 findings in which BMPs were not attained. Although all findings require corrective action, none required cessation of operations or reflect situations that present an immediate risk to public health or the environment. The Audit team noted inadequacies in PCB management included storage, labeling, reporting, and spill control. The most significant causal factors for the findings include lack of policy implementation throughout the Lower Columbia Area, inadequate training of personnel charged with environmental protection, lack of standard operating procedures for many programs, lack of reviews and appraisals, and an inaccurate perception of low risk for environmental concerns.
Advanced algorithms for information science
Argo, P.; Brislawn, C.; Fitzgerald, T.J.; Kelley, B.; Kim, W.H.; Mazieres, B.; Roeder, H.; Strottman, D.
1998-12-31T23:59:59.000Z
This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). In a modern information-controlled society the importance of fast computational algorithms facilitating data compression and image analysis cannot be overemphasized. Feature extraction and pattern recognition are key to many LANL projects and the same types of dimensionality reduction and compression used in source coding are also applicable to image understanding. The authors have begun developing wavelet coding which decomposes data into different length-scale and frequency bands. New transform-based source-coding techniques offer potential for achieving better, combined source-channel coding performance by using joint-optimization techniques. They initiated work on a system that compresses the video stream in real time, and which also takes the additional step of analyzing the video stream concurrently. By using object-based compression schemes (where an object is an identifiable feature of the video signal, repeatable in time or space), they believe that the analysis is directly related to the efficiency of the compression.
Statistical algorithms in the study of mammalian DNA methylation
Singer, Meromit
2012-01-01T23:59:59.000Z
non-overlapping CCGIs: the algorithm 2.2.6 Running time andI Statistical algorithms in the study of mammalian DNAof the result of the CCGI algorithm. Nodes marked along the
Two Strategies to Speed up Connected Component Labeling Algorithms
Wu, Kesheng; Otoo, Ekow; Suzuki, Kenji
2008-01-01T23:59:59.000Z
but not linear set union algorithm,” J. ACM, vol. 22, no. 2,analysis of set union algorithms,” J. ACM, vol. 31, no. 2,An improved equivalence algorithm,” Commun. ACM, vol. 7, no.
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions
Troina, Angelo
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions Roberto Barbuti, Andrea introduce a probabilistic algorithm for the simulation of chemical reactions, which can be used evolution of chemical reactive systems described by Gillespie. Moreover, we use our algorithm
Comparison of generality based algorithm variants for automatic taxonomy generation
Madnick, Stuart E.
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...
System engineering approach to GPM retrieval algorithms
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.
Recent Developments in Dual Lattice Algorithms
J. Wade Cherrington
2008-10-02T23:59:59.000Z
We review recent progress in numerical simulations with dually transformed SU(2) LGT, starting with a discussion of explicit dual amplitudes and algorithms for SU(2) pure Yang Mills in D=3 and D=4. In the D=3 case, we discuss results that validate the dual algorithm against conventional simulations. We also review how a local, exact dynamical fermion algorithm can naturally be incorporated into the dual framework. We conclude with an outlook for this technique and a look at some of the current challenges we've encountered with this method, specifically critical slowing down and the sign problem.
An Overview of LISA Data Analysis Algorithms
Edward K. Porter
2009-10-02T23:59:59.000Z
The development of search algorithms for gravitational wave sources in the LISA data stream is currently a very active area of research. It has become clear that not only does difficulty lie in searching for the individual sources, but in the case of galactic binaries, evaluating the fidelity of resolved sources also turns out to be a major challenge in itself. In this article we review the current status of developed algorithms for galactic binary, non-spinning supermassive black hole binary and extreme mass ratio inspiral sources. While covering the vast majority of algorithms, we will highlight those that represent the state of the art in terms of speed and accuracy.
A new loop-reducing routing algorithm
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...
QCDLAB: Designing Lattice QCD Algorithms with MATLAB
Artan Borici
2006-10-09T23:59:59.000Z
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses the Schwinger model on the lattice, a great simplification, which shares many features and algorithms with lattice QCD. A typical computing project using QCDLAB is characterised by short codes, short run times, and the ability to make substantial changes in a few seconds. QCDLAB 1.0 can be downloaded from the QCDLAB project homepage {\\tt http://phys.fshn.edu.al/qcdlab.html}.
A proximal point algorithm for sequential feature extraction ...
2011-08-03T23:59:59.000Z
We propose a proximal point algorithm to solve LAROS problem, that is the ... We also develop a new stopping criterion for the proximal point algorithm, which.
A new Search via Probability Algorithm for solving Engineering ...
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.
Efficient Heuristic Algorithms for Maximum Utility Product Pricing ...
2012-11-19T23:59:59.000Z
Nov 19, 2012 ... We provide very efficient implementations of the algorithms of ... cases of related optimal pricing problems admit efficient algorithms, see for ...
An Efficient Algorithm for Computing Robust Minimum Capacity st Cuts
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 ...
New Design Methods and Algorithms for Multi-component Distillation...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Design Methods and Algorithms for Multi-component Distillation Processes New Design Methods and Algorithms for Multi-component Distillation Processes multicomponent.pdf More...
Lower Flathead System Fisheries Study, 1984 Annual Report.
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.
Lower East Fork Poplar Creek | 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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334Department ofEnergy FYIntegratedBerkeleyLivermore ATTACHMENTS AttachmentLowLower East Fork
Lower hybrid heating and current drive on PLT
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.
D0 Silicon Upgrade: Lower Cleanroom Roof Quick Load Analysis
Rucinski, Russ; /Fermilab
1995-11-17T23:59:59.000Z
This engineering note documents calculations done to determine the margin of safety for the lower clean room roof. The analysis was done to give me a feeling of what the loads, stresses and capacity of the roof is prior to installation and installation work to be done for the helium refrigerator upgrade. The result of this quick look showed that the calculated loads produce stress values and loads at about half the allowables. Based on this result, I do not think that special precautions above personal judgement are required for the installation work.
ARM - Field Campaign - 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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) |govInstrumentsmfrirtA Journey InsideMicroBooNEAugust 20132, 2006 [FacilitygovCampaignsAerosolgovCampaignsArctic Lower
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 of Thomas P. D'Agostino2015CaliforniaExecutive,Sellers |AccessEnergy's Energy EfficiencyLower
Consumer Tips for Lowering Your Utility Bill | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousPlasmaP a g eWorks - AsTorrington, Wyoming (UtilityMeasuresPage Edit History Consumer Tips for Lowering Your
ARM - Field Campaign - Lower Atmospheric Boundary Layer Experiment
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) |govInstrumentsmfrirtA Journey InsideMicroBooNEAugustClouds govCampaignsLASIC: Layered Atlantic SmokegovCampaignsLower
Nonlinear lower hybrid oscillations in a cold viscous plasma
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.
Advanced CHP Control Algorithms: Scope Specification
Katipamula, Srinivas; Brambley, Michael R.
2006-04-28T23:59:59.000Z
The primary objective of this multiyear project is to develop algorithms for combined heat and power systems to ensure optimal performance, increase reliability, and lead to the goal of clean, efficient, reliable and affordable next generation energy systems.
An algorithmic approach to social networks
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 ...
Patterns hidden from simple algorithms Madhu Sudan
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
A Distributed Pool Architecture for Genetic Algorithms
Roy, Gautam
2011-02-22T23:59:59.000Z
The genetic algorithm paradigm is a well-known heuristic for solving many problems in science and engineering in which candidate solutions, or “individuals”, are manipulated in ways analogous to biological evolution, to ...
Benchmarking Derivative-Free Optimization Algorithms
2008-05-13T23:59:59.000Z
has encouraged a new wave of theory and algorithms. ... the solver that delivers the largest reduction within a given computational budget. ..... cost per iteration. ..... expensive optimization problems that arise in DOE's SciDAC initiative.
Five-dimensional Janis-Newman algorithm
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.
Hanson's Cement Plant 0.02 0 Lower Guadalupe River 0.03 0
Hanson's Cement Plant 0.02 0 Lower Guadalupe River 0.03 0 Mills Creek 0.06 0 Lower Coyote Creek 0PabloCk SanFelipeCk LowerWalkerCk MuddyHollow LagunitasCk MillsCk SimasCk LowerCoyoteCk LowerGuadalupeR Hanson'sCement
Algorithms for Large-Scale Internet Measurements
Leonard, Derek Anthony
2012-02-14T23:59:59.000Z
-1 ALGORITHMS FOR LARGE-SCALE INTERNET MEASUREMENTS A Dissertation by DEREK ANTHONY LEONARD Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY December... 2010 Major Subject: Computer Science ALGORITHMS FOR LARGE-SCALE INTERNET MEASUREMENTS A Dissertation by DEREK ANTHONY LEONARD Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements...
Spectral Representations of Uncertainty: Algorithms and Applications
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.
Algorithms for revenue metering and their evaluation
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...
A fast indexing algorithm for sparse matrices
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...
Texas A&M scheduling algorithm
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...
Realization of a scalable Shor algorithm
Thomas Monz; Daniel Nigg; Esteban A. Martinez; Matthias F. Brandl; Philipp Schindler; Richard Rines; Shannon X. Wang; Isaac L. Chuang; Rainer Blatt
2015-07-31T23:59:59.000Z
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in 1994 that Peter Shor came up with an algorithm that is able to calculate the prime factors of a large number vastly more efficiently than known possible with a classical computer. This paradigmatic algorithm stimulated the flourishing research in quantum information processing and the quest for an actual implementation of a quantum computer. Over the last fifteen years, using skillful optimizations, several instances of a Shor algorithm have been implemented on various platforms and clearly proved the feasibility of quantum factoring. For general scalability, though, a different approach has to be pursued. Here, we report the realization of a fully scalable Shor algorithm as proposed by Kitaev. For this, we demonstrate factoring the number fifteen by effectively employing and controlling seven qubits and four "cache-qubits", together with the implementation of generalized arithmetic operations, known as modular multipliers. The scalable algorithm has been realized with an ion-trap quantum computer exhibiting success probabilities in excess of 90%.
A New Algorithm for Linear Programming
Dhananjay P. Mehendale
2015-03-28T23:59:59.000Z
In this paper we propose two types of new algorithms for linear programming. The first type of these new algorithms uses algebraic methods while the second type of these new algorithms uses geometric methods. The first type of algorithms is based on treating the objective function as a parameter. In this method, we form a matrix using coefficients in the system of equations consisting objective equation and equations obtained from inequalities defining constraint by introducing slack/surplus variables. We obtain reduced row echelon form for this matrix containing only one variable, namely, the objective function itself as an unknown parameter. We analyse this matrix in the reduced row echelon form and develop a clear cut method to find the optimal solution for the problem at hand, if and when it exists. We see that the entire optimization process can be developed through the proper analysis of the said matrix in the reduced row echelon form. The second type of algorithms that we propose for linear programming are inspired by geometrical considerations. All these algorithms pursue common aim of approaching closer and closer to centroid or some centrally located interior point for speeding up the process of reaching an optimal solution! We then proceed to show that the algebraic method developed above for linear programming naturally extends to non-linear and integer programming problems. For non-linear and integer programming problems we use the technique of Grobner bases and the methods of solving linear Diophantine equations respectively.
Penetration of lower hybrid current drive waves in tokamaks
Horton, W. [The University of Texas at Austin, Austin, Texas 78712 (United States) [The University of Texas at Austin, Austin, Texas 78712 (United States); Aix-Marseille University, 58, Bd Charles Livon, 13284 Marseille (France); Goniche, M.; Peysson, Y.; Decker, J.; Ekedahl, A.; Litaudon, X. [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France)] [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France)
2013-11-15T23:59:59.000Z
Lower hybrid (LH) ray propagation in toroidal plasma is shown to be controlled by combination of the azimuthal spectrum launched by the antenna, the poloidal variation of the magnetic field, and the scattering of the waves by the drift wave fluctuations. The width of the poloidal and radial radio frequency wave spectrum increases rapidly as the rays penetrate into higher density and scatter from the drift waves. The electron temperature gradient (ETG) spectrum is particularly effective in scattering the LH waves due to its comparable wavelengths and phase velocities. ETG turbulence is also driven by the radial gradient of the electron current profile giving rise to an anomalous viscosity spreading the LH driven plasma currents. The LH wave scattering is derived from a Fokker-Planck equation for the distribution of the ray trajectories with diffusivities derived from the drift wave fluctuations. The condition for chaotic diffusion for the rays is derived. The evolution of the poloidal and radial mode number spectrum of the lower hybrid waves are both on the antenna spectrum and the spectrum of the drift waves. Antennas launching higher poloidal mode number spectra drive off-axis current density profiles producing negative central shear [RS] plasmas with improved thermal confinement from ETG transport. Core plasma current drive requires antennas with low azimuthal mode spectra peaked at m = 0 azimuthal mode numbers.
Lower-Temperature Subsurface Layout and Ventilation Concepts
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.
Performance Evaluation of Binary Negative-Exponential Backoff Algorithm
Lee, Tae-Jin
algorithm in the presence of transmission error and com- pare the performance of the DCF with the BEB. In [6], the results showed that the BNEB had better performance than the DCF with the BEB algorithm and compare the throughput of the DCF with the BNEB algorithm to that with BEB algorithm. Finally, we conclude
On the Statistical Efficiency of LMS Algorithms Bernard Widrow
Widrow, Bernard
On the Statistical Efficiency of LMS Algorithms Bernard Widrow ISL, Department of Electrical performance. In this work, two gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS is simple and practical, and is used in many applications worldwide. LMS
2003 Special issue Statistical efficiency of adaptive algorithms
Widrow, Bernard
gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS is simple and practical, and is used in many applications worldwide. LMS/Newton is based on Newton's method and the LMS algorithm. LMS/Newton is optimal in the least squares sense. It maximizes the quality of its
Algorithms for first-order model checking Daniel Kral' (Warwick)
Banaji,. Murad
Algorithms for first-order model checking Daniel Kral' (Warwick) Meta-algorithms for deciding time algorithm of Frick and Grohe which applies to graphs with locally bounded tree- width. In this talk, we first survey commonly applied techniques to design FPT algorithms for FO properties. We
Just: Data requirements Data requirements of reverse-engineering algorithms
Just, Winfried
Just: Data requirements Data requirements of reverse-engineering algorithms Winfried Just vastly underdetermined. It is therefore important to estimate the probability that a given algorithm of different algorithms can be made. We also give an example of how expected algorithm performance can
On the Education of GIS Algorithm Design Marc van Kreveld
Utrecht, Universiteit
On the Education of GIS Algorithm Design Marc van Kreveld institute of information and computing Algorithm Design Marc van Kreveld Institute of Information and Computing Sciences Utrecht University E-mail: marc@cs.uu.nl Abstract To teach the design of algorithms in an algorithmic GIS course, it is suggested
On equivalence relationships between classification and ranking algorithms
Ertekin, Seyda
We demonstrate that there are machine learning algorithms that can achieve success for two separate
An introduction to genetic algorithms for neural networks
Cambridge, University of
An introduction to genetic algorithms for neural networks Richard Kemp 1 Introduction Once a neural can use a genetic algorithm to try and solve the problem. What are genetic algorithms? Genetic algorithms (GAs) are search algo- rithms based on the mechanics of natural selection and genetics as observed
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
Szepesvari, Csaba
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results Csaba Szepesv characterize some common properties of sound SPD algorithms, propose a partic- ular algorithm that is shown of the approach whereas the pro- posed algorithm is shown to yield a substantial speed-up of the recognition
Title of dissertation: Advanced Lagrangian Simulation Algorithms for Magnetized
Anlage, Steven
ABSTRACT Title of dissertation: Advanced Lagrangian Simulation Algorithms for Magnetized Plasma algorithms for problems such as these are derived and implemented. The algorithms are tested for multiple/toroidal). The advances presented here address two major shortcomings of conventional gyrokinetic PIC algorithms
An Objective Method of Evaluating and Devising Storm Tracking Algorithms
Lakshmanan, Valliappa
An Objective Method of Evaluating and Devising Storm Tracking Algorithms Valliappa Lakshmanan1 tracking algorithms are a key ingredient of nowcasting sys- tems, evaluation of storm tracking algorithms computable bulk statis- tics that can be used to directly evaluate the performance of tracking algorithms
Bounds On Contention Management Algorithms Johannes Schneider1
Bounds On Contention Management Algorithms Johannes Schneider1 , Roger Wattenhofer1 Computer algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algo- rithm RandomizedRounds. Our randomized algorithm is efficient: in some noto- rious problem
Software News and Updates SHARPEN--Systematic Hierarchical Algorithms for
Snow, Christopher
Software News and Updates SHARPEN--Systematic Hierarchical Algorithms for Rotamers and Proteins.interscience.wiley.com). Abstract: Algorithms for discrete optimization of proteins play a central role in recent advances biologists to rapidly proto- type such algorithms and to easily scale these algorithms to many processors
KH Computational Physics-2015 Basic Numerical Algorithms Ordinary differential equations
Gustafsson, Torgny
KH Computational Physics- 2015 Basic Numerical Algorithms Ordinary differential equations The set(xl) at certain points xl. Kristjan Haule, 2015 1 #12;KH Computational Physics- 2015 Basic Numerical Algorithms purpose routine · Numerov's algorithm: ¨y = f(t)y(t) ( for Schroedinger equation) · Verlet algorithm: ¨y
Normal Basis Multiplication Algorithms for GF(2n ) (Full Version)
International Association for Cryptologic Research (IACR)
1 Normal Basis Multiplication Algorithms for GF(2n ) (Full Version) Haining Fan, Duo Liu and Yiqi. fan_haining@yahoo.com Abstract - In this paper, we propose a new normal basis multiplication algorithm for GF(2n ). This algorithm can be used to design not only fast software algorithms but also low
Evaluation of Jet Algorithms in the Search for Sources of
Erdmann, Martin
Evaluation of Jet Algorithms in the Search for Sources of Ultra-High-Energy Cosmic Rays von-Energy-Correlations . . . . . . . . . . . . . . . . . . . 5 2 Jet Algorithms 7 2.1 Jet Algorithms in High-Energy Physics . . . . . . . . . . . . . . . . . 7 2.2 The SISCone-Jet-Algorithm . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 The Search for Stable Cones
Particle Physics Phenomenology 8. QCD jets and jet algorithms
Sjöstrand, Torbjörn
Particle Physics Phenomenology 8. QCD jets and jet algorithms Torbj¨orn Sj¨ostrand Department Sphericity and Thrust families. Second solution: clustering algorithms, e.g. LUCLUS, JADE, Durham k. All algorithms, increasingly messy. LHC: return of clustering with new safer and faster algorithms. Anti-k "is
Separation and concentration of lower alcohols from dilute aqueous solutions
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.
Optical measurements of winds in the lower thermosphere
Wiens, R.H.; Shepherd, G.G.; Gault, W.A. (York Univ., Toronto, Ontario (Canada)); Kosteniuk, P.R. (Univ. of Saskatchewan, Saskatoon (Canada))
1988-06-01T23:59:59.000Z
WAMDII, the wide-angle Michelson Doppler imaging interferometer, was used to measure the neutral wind in the lower thermosphere by the Doppler shift of the O I 557-nm line. Observations were made at Saskatoon (60.5{degree} N invariant) around the spring equinox of 1985 with WAMDII coupled to an all-sky lens. With dopplergrams averaged over 3 to 30 min, no evidence was found for persistent highly localized winds on either of the two nights studied, one viewing only aurora and one viewing only airglow. The nocturnal variation was determined for both nights using average horizontal wind for the whole all-sky image. The pattern for the auroral case shows winds parallel to the aurora orientation in the evening but substantial crosswinds near midnight. High latitude general circulation models seem to represent this case better than local auroral generation models. The airglow case showed eastward winds in the morning sector.
Pathway to a lower cost high repetition rate ignition facility
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.
Efficient Interpolation in the Guruswami-Sudan Algorithm
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.
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
International Association for Cryptologic Research (IACR)
Statistical weaknesses in 20 RC4-like algorithms and (probably) the simplest algorithm free from statistical weaknesses in 20 RC4-like algorithms including the original RC4, RC4A, PC-RC4 and others. This is achieved using a simple statistical test. We found only one algorithm which was able to pass the test
Axiomatic Tools versus Constructive approach to Unconventional Algorithms
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.
Electrochromic Windows: Process and Fabrication Improvements for Lower Total Costs
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.
Lower Three Runs Remediation Safety Preparation Strategy - 13318
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)
Parallelism of the SANDstorm hash algorithm.
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.
Density equalizing map projections: A new algorithm
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.
Density equalizing map projections: A new algorithm
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.
Particle Merging Algorithm for PIC Codes
Vranic, Marija; Martins, Joana L; Fonseca, Ricardo A; Silva, Luis O
2014-01-01T23:59:59.000Z
Particle-in-cell merging algorithms aim to resample dynamically the six-dimensional phase space occupied by particles without distorting substantially the physical description of the system. Whereas various approaches have been proposed in previous works, none of them seemed to be able to conserve fully charge, momentum, energy and their associated distributions. We describe here an alternative algorithm based on the coalescence of N massive or massless particles, considered to be close enough in phase space, into two new macro-particles. The local conservation of charge, momentum and energy are ensured by the resolution of a system of scalar equations. Various simulation comparisons have been carried out with and without the merging algorithm, from classical plasma physics problems to extreme scenarios where quantum electrodynamics is taken into account, showing in addition to the conservation of local quantities, the good reproducibility of the particle distributions. In case where the number of particles o...
Pinning impulsive control algorithms for complex network
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.
An Invitation to Algorithmic Information Theory
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.
Graph algorithms in the titan toolkit.
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.
Lower Flathead River Fisheries Study, 1983 Annual Report.
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.
Recovery Act: Electrochromic Glazing Technology: Improved Performance, Lower Price
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
Penetration and scattering of lower hybrid waves by density fluctuations
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.
A background correction algorithm for Van Allen Probes MagEIS electron flux measurements
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Claudepierre, S. G.; O'Brien, T. P.; Blake, J. B.; Fennell, J. F.; Roeder, J. L.; Clemmons, J. H.; Looper, M. D.; Mazur, J. E.; Mulligan, T. M.; Spence, H. E.; et al
2015-07-14T23:59:59.000Z
We describe an automated computer algorithm designed to remove background contamination from the Van Allen Probes Magnetic Electron Ion Spectrometer (MagEIS) electron flux measurements. We provide a detailed description of the algorithm with illustrative examples from on-orbit data. We find two primary sources of background contamination in the MagEIS electron data: inner zone protons and bremsstrahlung X-rays generated by energetic electrons interacting with the spacecraft material. Bremsstrahlung X-rays primarily produce contamination in the lower energy MagEIS electron channels (~30–500 keV) and in regions of geospace where multi-M eV electrons are present. Inner zone protons produce contamination in all MagEIS energymore »channels at roughly L « less
Efficient upper and lower bounds for global mixed-integer optimal ...
2013-11-07T23:59:59.000Z
operated in two discrete modes, leading either to acceleration and energy consump- .... For this procedure asymptotic bounds and very efficient algorithms.
Implementation of the Trigonometric LMS Algorithm using Original Cordic Rotation
Akhter, Nasrin; Fersouse, Lilatul; Khandaker, Faria
2010-01-01T23:59:59.000Z
The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter tap weights so that the error signal is minimized in the mean square sense. In Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS), two new versions of LMS algorithms, same formulations are performed as in the LMS algorithm with the exception that filter tap weights are now expressed using trigonometric and hyperbolic formulations, in cases for TLMS and HLMS respectively. Hence appears the CORDIC algorithm as it can efficiently perform trigonometric, hyperbolic, linear and logarithmic functions. While hardware-efficient algorithms often exist, the dominance of the software systems has kept those algorithms out of the spotlight. Among these hardware- efficient algorithms, CORDIC is an iterative solution for trigonometric and other transcendental functions. Former researches wor...
Data-flow algorithms for parallel matrix computations
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.
STORAGE CAPACITY ALLOCATION ALGORITHMS FOR HIERARCHICAL
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
Wind Mill Pattern Optimization using Evolutionary Algorithms
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
Third Progress Report Algorithms and Complexity
Brodal, Gerth Stølting
-14186 January 2004 #12;Summary This is the third progress report for the ALCOM-FT project, supportedThird Progress Report ALCOM-FT Algorithms and Complexity Future Technologies Project No. IST-1999 by the European Com- mission as project number IST-1999-14186 under the Future and Emerging Technologies part
Third Progress Report Algorithms and Complexity
Brodal, Gerth Stølting
14186 January 2004 #12; Summary This is the third progress report for the ALCOMFT project, supportedThird Progress Report ALCOMFT Algorithms and Complexity Future Technologies Project No. IST1999 by the European Com mission as project number IST199914186 under the Future and Emerging Technologies part
A Fast Algorithm for Chebyshev, Fourier & Sinc
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
Multivariate Statistical Tests for Comparing Classification Algorithms
AlpaydÃ½n, Ethem
Multivariate Statistical Tests for Comparing Classification Algorithms Olcay Taner Yildiz1 , Â¨Ozlem these in a single number, we propose to collect multivariate statistics and use multivariate tests on them rate (tpr) and false positive rate (fpr) and a multivariate test can also use such two values instead
Evolutionary Algorithms for Definition Extraction Claudia Borg
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
Fast Algorithm for Partial Covers in Words
Lonardi, Stefano
Fast Algorithm for Partial Covers in Words Tomasz Kociumaka1 , Solon P. Pissis2,3 , Jakub Bad Herrenalb, June 17, 2013 T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, T. Wale Fast are aligned. a a a a a a a a a a a ab b b b T. Kociumaka, S. Pissis, J. Radoszewski, W. Rytter, T. Wale Fast
Groundwater Remediation Strategy Using Global Optimization Algorithms
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
EFFICIENT SCALABLE ALGORITHMS FOR HIERARCHICALLY SEMISEPARABLE MATRICES
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
Theory of Genetic Algorithms ---extended abstract---
de Graaf, Jeannette
, Joost N. Kok and Walter A. Kosters Leiden University, Department of Computer Science P.O. Box 9512, 2300 some methods for examining the fundamental properties of genetic algorithms ([Hol75, Jon75, Gol89, Mit computation. For a good overview of evolutionary computation one may consult the Handbook of Evolutionary
High performance parallel algorithms for incompressible flows
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...
Empirical Analysis of Transmission Power Control Algorithms
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
Distributed Power Control Algorithms for Wireless Networks
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
A Treecode Algorithm for Regularized Particle Interactions
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
LOCAL CONVERGENCE OF AN ALGORITHM FOR SUBSPACE ...
2014-07-01T23:59:59.000Z
algorithm for identifying a linear subspace of Rn from data consisting of partial observations of random vectors from that ..... Concepts of incoherence have been well studied .... Let us now write the update formula (1.2) as follows. Ut+1 := Ut +.
Algorithms for GPS operation indoors and downtown
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
Section Notes 3 The Simplex Algorithm
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
Section Notes 3 The Simplex Algorithm
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
Section Notes 3 The Simplex Algorithm
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
ALGORITHMS IN REAL ALGEBRAIC GEOMETRY: A SURVEY ...
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.
Radio Network Planning with Combinatorial Optimisation Algorithms
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
Algorithms for Pure Nash Equilibria in Weighted
Conati, Cristina
Algorithms for Pure Nash Equilibria in Weighted Congestion Games Panagopoulou and Spirakis Review strategies. Â· This paper only deals with pure strategies. #12;Game Theory Â· A Nash Equilibrium is where players stay fixed. #12;Game Theory Â· A Nash equilibrium is guaranteed to exist when players can use mixed
Helium isotopes: Lower geyser basin, Yellowstone National Park
Kennedy, B.M.; Reynolds, J.H.; Smith, S.P.; Truesdell, A.H.
1987-11-10T23:59:59.000Z
High /sup 3/He//sup 4/He ratios associated with the Yellowstone caldera reflect the presence of a magmatic helium component. This component is ultimately derived from a mantle plume capped by a cooling batholith underlying the caldera. In surface hot springs, fumaroles, etc., the /sup 3/He//sup 4/He ratio varies from approx.1 to 16 tims the air ratio. The variations are produced by varying degrees of dilution of the magmatic component with radiogenic helium. The radiogenic helium is crustal-derived and is thought to be scavenged from aquifers in which the hydrothermal fluids circulate. We determined the helium iosotopic composition in 12 different springs from the Lower Geyser Basin, a large hydrothermal basin with the caldera. The /sup 3/He//sup 4/He ratio was found to vary from approx.2.7 to 7.7 times the air ratio. The variations correlate with variations in water chemistry. Specifically, the /sup 3/He//sup 4/He ratio increased with total bicarbonate concentration. The dissolved bicarbonate is from gas-water-rock interactions involving CO/sub 2/ and Na silicates. The concentration of bicarbonate is a function of the availability of dissolved CO/sub 2/, which, in turn, is a function of deep boiling with phase separation prior to CO/sub 2/-bicarbonate conversion. The correlation of high /sup 3/He//sup 4/He ratios with high bicarbonate is interpreted as the result of deep dilution of a single thermal fluid with cooler water during ascent to the surface. The dilution and cooling deters deep boiling, and therefore both CO/sub 2/ and /sup 3/He are retained in the rising fluid. Fluids that are not diluted with boil to a greater extent, losing a large proportion of /sup 3/He, as well as CO/sub 2/, leaving a helium-poor residual fluid in which the isotopic composition of helium will be strongly affected by the addition of radiogenic helium.
Lower hybrid current drive favoured by electron cyclotron radiofrequency heating
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.3×10{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.
A multiscale approximation algorithm for the cardinality constrained knapsack problem
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 ...
Dynamic and fault tolerant three-dimensional cellular genetic algorithms
Al Naqi, Asmaa
2012-11-29T23:59:59.000Z
In the area of artificial intelligence, the development of Evolutionary Algorithms (EAs) has been very active, especially in the last decade. These algorithms started to evolve when scientists from various regions of the ...
Applications/Algorithms Roadmapping Activity. First Stage Final Report
Higham, Nicholas J.
Applications/Algorithms Roadmapping Activity. First Stage Final Report Anne Trefethen, Nicholas J ISSN 1749-9097 #12; Applications/Algorithms Roadmapping Activity First Stage Final Report June ..................................................................................................................................... 9 The HPC/NA Roadmap Activity
Comparison of Generality Based Algorithm Variants for Automatic Taxonomy Generation
Henschel, Andreas
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymannalgorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...
Adaptive Algorithms for the Rejection of Sinusoidal Disturbances
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
A fast butterfly algorithm for the hyperbolic Radon transform
Hu, Jingwei
2012-01-01T23:59:59.000Z
We introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N[superscript 2] logN), where N is representative ...
On the Convergence of Classical Variational Inequality Algorithms
Magnanti, Thomas L.
In this paper, we establish global convergence results for projection and relaxation algorithms for solving variational inequality problems, and for the Frank-Wolfe algorithm for solving convex optimization problems defined ...
Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms
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...
Optimization of advanced telecommunication algorithms from power and performance perspective
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 ...
Adaptive Control of Third Harmonic Generation via Genetic Algorithm
Hua, Xia
2010-10-12T23:59:59.000Z
. We use genetic algorithm to optimize third harmonic generation (THG), and investigate various pulse shaper options. We test our setup by running the experiment with varied initial conditions and study factors that affect convergence of the algorithm...
Understanding how Knowledge is exploited in Ant Algorithms
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 ...
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
Fernau, H.; Manlove, D.F.
Fernau,H. Manlove,D.F. Proceedings of ACiD 2006: the 2nd Algorithms and Complexity in Durham workshop, volume 7 of Texts in Algorithmics, College Publications pp 69-84
Design algorithms for parallel transmission in magnetic resonance imaging
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 ...
Optimum Algorithms for a Model of Direct Chaining
Vitter, Jeffrey Scott; Chen, Wen-Chin
1985-05-01T23:59:59.000Z
Direct chaining is a popular and efficient class of hashing algorithms. In this paper we study optimum algorithms among direct chaining methods, under the restrictions that the records in the hash table are not moved after ...
Provably Efficient Algorithms for Numerical Tensor Edgar Solomonik
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
Parallel Algorithms for Medical Informatics on Data-Parallel Many-Core Processors
Moazeni, Maryam
2013-01-01T23:59:59.000Z
and analysis of parallel algorithms." , Prentice Hall, Newsymposium on Discrete algorithms, pp. 271-280. Society forintroduction to parallel algorithms. Addison Wesley Longman
Algorithms for the closest and shortest vector problems on general lattices
Voulgaris, Panagiotis
2011-01-01T23:59:59.000Z
viii List of Algorithms . . . . . . . . . . . .Our Results . . . . . . . . 1.3.1 Sieving Algorithms 1.3.2Voronoi Algorithms 1.4 Related Work . . . . . . . 1.5 Open
On the fixed-point analysis and architecture design of FFT algorithms
Chang, Wei-Hsin
2007-01-01T23:59:59.000Z
2.2 FFT Algorithms . . . . . . . . . . . . . . . . . .2.2.1 Radix-2 FFT Algorithm . . . . . . . . .2.2.2 Radix-4 FFT Algorithm . . . . .
6.854J / 18.415J Advanced Algorithms, Fall 2001
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.854J / 18.415J Advanced Algorithms, Fall 1999
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 ...
Integrated network design and scheduling problems : optimization algorithms and applications.
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.
Statistical Algorithms for High-throughput Biological Data /
Jeong, Kyowon
2013-01-01T23:59:59.000Z
Statistical Algorithms for High-throughput Biological Data by Kyowon Jeong Doctor of Philosophy in Electrical Engineering (Communication Theory
A Flexible Reservation Algorithm for Advance Network Provisioning
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,
Version 2 total ozone mapping spectrometer ultraviolet algorithm: problems and
of UV-absorbing aerosols. The improved (Version 2) algorithm can be applied to reprocess the existing
Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...
Saugata Basu
Introduction. Ideas behind ETR and computing Euler-Poincaré Characteristic. Algorithm for Computing the Euler-Poincaré characteristic. Deciding Connectivity.
Quantum amplitude amplification algorithm: an explanation of availability bias
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.
An Empirical Evaluation of Genetic Algorithms on Noisy Objective Functions
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
Algorithm-Architecture Codesign for Structured Matrix Operations on
Pitsianis, Nikos P.
Algorithm-Architecture Codesign for Structured Matrix Operations on Reconfigurable Systems J. Kim;#12;Algorithm-Architecture Codesign for Structured Matrix Operations on Reconfigurable Systems J. Kim, P 14, 2006 Abstract This article introduces the new ideas and techniques of algorithm-architecture
Modified LMS Algorithm for Unbiased Impulse Response Estimation
So, Hing-Cheung
Modified LMS Algorithm for Unbiased Impulse Response Estimation in Nonstationary Noise H. C. So and a modified least mean squares (LMS) algorithm is then developed for accurate system identification in noise, the least mean squares (LMS) algorithm [2], which is based on the minimum mean squared error (MMSE) crite
Manuscript Number:2098 Improvements to Platt's SMO Algorithm for
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
Jitter-based analysis and discussion of burst assembly algorithms
Aracil, Javier
Jitter-based analysis and discussion of burst assembly algorithms Javier Aracil, Jos´e 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
Global Optimization of Chemical Processes using Stochastic Algorithms
Neumaier, Arnold
Global Optimization of Chemical Processes using Stochastic Algorithms JULIO R. BANGA 1 and WARREN D engineering are difficult to optimize using gradientÂbased algorithms. These include process models with multimodalobjective functions and discontinuities. Herein, a stochastic algorithm is applied for the optimal design
SIMULATION OF GENERIC MULTIPROCESSOR CONFIGURATIONS FOR ASYNCHRONOUS ALGORITHMS
Conrad, James M.
SIMULATION OF GENERIC MULTIPROCESSOR CONFIGURATIONS FOR ASYNCHRONOUS ALGORITHMS James M. Conrad is a useful tool to predict a parallel algorithm's behavior. Most existing parallel system simulators assume a particular architecture or simulate algorithms at a machine instruction level. This paper describes a simple
Algorithms and Experiments: The New (and Old) Methodology
Moret, Bernard
Algorithms and Experiments: The New (and Old) Methodology Bernard M.E. Moret Department of Computer twenty years have seen enormous progress in the design of algorithms, but little of it has been put into practice. Because many recently developed algorithms are hard to characterize theoretically and have large
Chaining Algorithms for Alignment of Draft Sequence Mukund Sundararajan1
Chaining Algorithms for Alignment of Draft Sequence Mukund Sundararajan1 , Michael Brudno1 , Kerrin that the resulting procedure more accurately penalizes the various biological rearrangements. The algorithm is tested on a whole genome alignment of seven yeast species. We also demonstrate a variation on the algorithm that can
General Algorithms for Testing the Ambiguity of Finite Automata
Cortes, Corinna
General Algorithms for Testing the Ambiguity of Finite Automata Cyril Allauzen1, , Mehryar Mohri2 algorithms for testing the fi- nite, polynomial, and exponential ambiguity of finite automata with - transitions. It gives an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|2 E
Priority Algorithms for Graph Optimization Problems Allan Borodin
Larsen, Kim Skak
Priority Algorithms for Graph Optimization Problems Allan Borodin University of Toronto bor of priority or "greedy-like" algorithms as initiated in [10] and as extended to graph theoretic problems, there are several natural input formulations for a given problem and we show that priority algorithm bounds
Algorithms for Determining Network Robustness Heath J. LeBlanc
Koutsoukos, Xenofon D.
Algorithms for Determining Network Robustness Heath J. LeBlanc Department of Electrical & Computer.koutsoukos@vanderbilt.edu ABSTRACT In this paper, we study algorithms for determining the robustness of a network. Network robustness algorithms that use purely local strategies are able to succeed in the presence of adversary nodes. Therefore
Visualizing Algorithms over the Web with the Publicationdriven Approach \\Lambda
Demetrescu, Camil
Visualizing Algorithms over the Web with the Publicationdriven Approach \\Lambda Camil Demetrescu x@istel.ing.unipg.it Abstract Algorithm animation over the Web is usually realized by designing adhoc Java applets that provide both the implementation and the visualization of specific algorithms. This approach has several
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS
van de Geijn, Robert A.
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS PAOLO BIENTINESI AND ROBERT A. VAN DE GEIJN Abstract. We present a notation that allows a dense linear algebra algorithm subvectors and submatrices allowing the details of the algorithm to be the focus while hiding the intricate
Modeling the model Characteristics and behavior of genetic algorithms
Modeling the model Characteristics and behavior of genetic algorithms Author. Janeen Neri Progress in data files containing the fitness distribution and genetic algorithm specifications to be tested, and normalizes the fitness data for easier manipulation. A de- tailed pseudocode outline of the genetic algorithm
BULL: a Library for Learning Algorithms of Boolean Functions
Wang, Bow-Yaw
BULL: a Library for Learning Algorithms of Boolean Functions Yu-Fang Chen and Bow-Yaw Wang Academia publicly available implementation of learning algorithms for Boolean functions. The tool is implemented in the library. The classical CDNF algorithm infers Boolean functions over a fixed number of variables
A quantum algorithm for Viterbi decoding of classical convolutional codes
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.
The Fast Multipole Algorithm on the Cell Broadband Engine Architecture
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
GREIT: towards a consensus EIT algorithm for lung images
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
Simplex Algorithm Math 364: Principles of Optimization, Lecture 8
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
Indoor positioning algorithm using light-emitting diode visible light
Kavehrad, Mohsen
Indoor positioning algorithm using light- emitting diode visible light communications Zhou Zhou of Use: http://spiedl.org/terms #12;Indoor positioning algorithm using light-emitting diode visible light. This paper proposes a novel indoor positioning algorithm using visible light communications (VLC
A low memory, highly concurrent multigrid algorithm Mark F. Adams
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
Fast and Simple Algorithms for Weighted Perfect Matching
Fast and Simple Algorithms for Weighted Perfect Matching Mirjam Wattenhofer, Roger Wattenhofer Abstract We present two fast and simple combinatorial approximation algorithms for con- structing a minimum algorithm runs in O(n2 log n) time and is at most a factor log n worse than an optimal solution
Decision Trees: More Theoretical Justification for Practical Algorithms
Fiat, Amos
Decision Trees: More Theoretical Justification for Practical Algorithms Amos Fiat and Dmitry,pechyony}@tau.ac.il Abstract. We study impuritybased decision tree algorithms such as CART, C4.5, etc., so as to better understand their theoretical under pinnings. We consider such algorithms on special forms of functions
Particle Physics Phenomenology 8. QCD jets and jet algorithms
Sjöstrand, Torbjörn
Particle Physics Phenomenology 8. QCD jets and jet algorithms Torbj¨orn Sj¨ostrand Department: extend Sphericity and Thrust families. Second solution: clustering algorithms, e.g. LUCLUS, JADE, Durham, but in (, ).) Tevatron (Fermilab): cone algorithms, increasingly messy. LHC: return of clustering with new safer
Algorithms for Protein Comparative Modelling and Some Evolutionary
Moreira, Bruno Contreras
1 Algorithms for Protein Comparative Modelling and Some Evolutionary Implications BRUNO CONTRERAS applicability. In this work different algorithms and approaches were tested with this aim, particularly to help problem, a new modelling approach is designed and tested. This algorithm uses crossover, mutation
Comparing VM-Placement Algorithms for On-Demand Clouds
Comparing VM-Placement Algorithms for On-Demand Clouds Feb. 14, 2012 NIST Presentation to LSN Kevin. Dabrowski, "Comparing VM-Placement Algorithms for On-Demand Clouds", Proceedings of IEEE CloudCom 2011, Nov VM- placement algorithms through simulation of large, on-demand infrastructure clouds. Demonstrate
A Comparison of Perfect Table Cryptanalytic Tradeoff Algorithms
International Association for Cryptologic Research (IACR)
A Comparison of Perfect Table Cryptanalytic Tradeoff Algorithms Ga Won Lee and Jin Hong Department Abstract The performances of three major time memory tradeoff algorithms were com- pared in a recent paper. The algorithms considered there were the classical Hell- man tradeoff and the non-perfect table versions
EVALUATING CLOUD RETRIEVAL ALGORITHMS WITH THE ARM BBHRP FRAMEWORK
EVALUATING CLOUD RETRIEVAL ALGORITHMS WITH THE ARM BBHRP FRAMEWORK E. Mlawer, T. Shippert, K. L closure analyses has been the evaluation of cloud microphysical retrieval algorithms. This evaluation for modeling studies. This poster details the continued effort to evaluate cloud property retrieval algorithms
PHYLOGENOMICS AND POPULATION GENOMICS: MODDELS, ALGORITHMS, AND ANALYTICAL TOOLS
Rosenberg, Noah
PHYLOGENOMICS AND POPULATION GENOMICS: MODDELS, ALGORITHMS, AND ANALYTICAL TOOLS LUAY K. NAKHLEH analytical tools for assessing properties of the algorithms. We are pleased to present five papers of ways in which models, algorithms, and analytical tools can be used to advance the subject. The papers
Behavioral syndromes versus darwinian algorithms Bryan D. Neff1
Neff, Bryan D.
Letters Behavioral syndromes versus darwinian algorithms Bryan D. Neff1 and Paul W. Sherman2 1 they occur, represent adaptive darwinian algorithms as opposed to nonadaptive genetic constraints. [1], many animals use situation-dependent darwinian algorithms to adjust behavior adaptively
Kernel Machine Based Feature Extraction Algorithms for Regression Problems
Szepesvari, Csaba
Kernel Machine Based Feature Extraction Algorithms for Regression Problems Csaba Szepesv´ari 1 feature extraction algorithms in a regression settings. The first method is derived based. However, here it is shown that the orthogonalization principle employed by the original MMDA algorithm can
Control Algorithms for Grid-Scale Battery Energy Storage Systems
Control Algorithms for Grid-Scale Battery Energy Storage Systems This report describes development and installation of the control algorithms for frequency-regulation and wind-smoothing for a 1-MW grid Algorithms for Grid-scale Battery Energy Storage Systems Prepared for the U.S. Department of Energy Office
On the consistency of Prony's method and related algorithms
Smyth, Gordon K.
On the consistency of Prony's method and related algorithms M.H. Kahn M.S.Mackisack M.R.Osborne§ G and of related algorithms based on maximum likelihood is discussed as the number of observations n are obtained for the frequency estimation problem. However, the algorithms considered are all scaling dependent
Some Efficient Algorithms for the Final Exponentiation of T Pairing
International Association for Cryptologic Research (IACR)
Some Efficient Algorithms for the Final Exponentiation of T Pairing Masaaki Shirase1 , Tsuyoshi by the recent improvements, e.g., the Duursma-Lee algorithm and T pairing. In this paper we discuss how propose some efficient algorithms using the torus T2(F33n ) that can efficiently compute an inversion
"Reconstructing high quality images using models and algorithms."
Zhigilei, Leonid V.
"Reconstructing high quality images using models and algorithms." Daniel S. Weller Assistant Theory and Algorithms Laboratory Increasing quality and resolution requirements in scientific and medical cost. Both trends drive the development of novel signal and image processing algorithms that are faster
BUILDING BETTER CONE JET ALGORITHMS S.D. Ellis,1
Huston, Joey
BUILDING BETTER CONE JET ALGORITHMS S.D. Ellis,1 J. Huston,2 and M. Tönnesmann3 1 Seattle, WA 98195, such as jet algorithms, to more reliably bridge the gap between theory and experiment. We present recent results on the development of better cone jet algorithms. I. INTRODUCTION A common facet of essentially
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
US-ABC Collaborates to Lower Cost of Electric Drive Batteries...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
US-ABC Collaborates to Lower Cost of Electric Drive Batteries US-ABC Collaborates to Lower Cost of Electric Drive Batteries April 16, 2013 - 12:00am Addthis The U.S. Advanced...
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...
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...
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...
DOE-Sponsored IGCC Project Could Lead to Lower-Cost Carbon Capture...
IGCC Project Could Lead to Lower-Cost Carbon Capture Technologies DOE-Sponsored IGCC Project Could Lead to Lower-Cost Carbon Capture Technologies May 9, 2012 - 1:00pm Addthis...
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...
Constraints on the composition of the Aleutian arc lower crust from
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 ...
Fast computation algorithms for speckle pattern simulation
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.
The Complex Gaussian Kernel LMS algorithm
Bouboulis, Pantelis
2010-01-01T23:59:59.000Z
Although the real reproducing kernels are used in an increasing number of machine learning problems, complex kernels have not, yet, been used, in spite of their potential interest in applications such as communications. In this work, we focus our attention on the complex gaussian kernel and its possible application in the complex Kernel LMS algorithm. In order to derive the gradients needed to develop the complex kernel LMS (CKLMS), we employ the powerful tool of Wirtinger's Calculus, which has recently attracted much attention in the signal processing community. Writinger's calculus simplifies computations and offers an elegant tool for treating complex signals. To this end, the notion of Writinger's calculus is extended to include complex RKHSs. Experiments verify that the CKLMS offers significant performance improvements over the traditional complex LMS or Widely Linear complex LMS (WL-LMS) algorithms, when dealing with nonlinearities.
Simple Denoising Algorithm Using Wavelet Transform
Manojit Roy; V. Ravi Kumar; B. D. Kulkarni; John Sanderson; Martin Rhodes; Michel vander Stappen
2000-02-18T23:59:59.000Z
We have presented a new and alternative algorithm for noise reduction using the methods of discrete wavelet transform and numerical differentiation of the data. In our method the threshold for reducing noise comes out automatically. The algorithm has been applied to three model flow systems - Lorenz, Autocatalator, and Rossler systems - all evolving chaotically. The method is seen to work well for a wide range of noise strengths, even as large as 10% of the signal level. We have also applied the method successfully to noisy time series data obtained from the measurement of pressure fluctuations in a fluidized bed, and also to that obtained by conductivity measurement in a liquid surfactant experiment. In all the illustrations we have been able to observe that there is a clean separation in the frequencies covered by the differentiated signal and white noise.
CAST: Contraction Algorithm for Symmetric Tensors
Rajbhandari, Samyam; NIkam, Akshay; Lai, Pai-Wei; Stock, Kevin; Krishnamoorthy, Sriram; Sadayappan, Ponnuswamy
2014-09-22T23:59:59.000Z
Tensor contractions represent the most compute-intensive core kernels in ab initio computational quantum chemistry and nuclear physics. Symmetries in these tensor contractions makes them difficult to load balance and scale to large distributed systems. In this paper, we develop an efficient and scalable algorithm to contract symmetric tensors. We introduce a novel approach that avoids data redistribution in contracting symmetric tensors while also avoiding redundant storage and maintaining load balance. We present experimental results on two parallel supercomputers for several symmetric contractions that appear in the CCSD quantum chemistry method. We also present a novel approach to tensor redistribution that can take advantage of parallel hyperplanes when the initial distribution has replicated dimensions, and use collective broadcast when the final distribution has replicated dimensions, making the algorithm very efficient.