International Energy Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
Summarizes the overall structure of the International Energy Model and its interface with other NEMS modules, mathematical specifications of behavioral relationships, and data sources and estimation methods.
Residential Demand Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
Model Documentation - Documents the objectives, analytical approach, and development of the National Energy Modeling System (NEMS) Residential Sector Demand Module. The report catalogues and describes the model assumptions, computational methodology, parameter estimation techniques, and FORTRAN source code.
Renewable Fuels Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
This report documents the objectives, analytical approach, and design of the National Energy Modeling System (NEMS) Renewable Fuels Module (RFM) as it relates to the production of the Annual Energy Outlook forecasts.
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-14
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.
Macroeconomic Activity Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
Documents the objectives, analytical approach, and development of the National Energy Modeling System (NEMS) Macroeconomic Activity Module (MAM) used to develop the Annual Energy Outlook for 2014 (AEO2014). The report catalogues and describes the module assumptions, computations, methodology, parameter estimation techniques, and mainframe source code
Coal Market Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
Documents the objectives and the conceptual and methodological approach used in the development of the National Energy Modeling System's (NEMS) Coal Market Module (CMM) used to develop the Annual Energy Outlook 2014 (AEO2014). This report catalogues and describes the assumptions, methodology, estimation techniques, and source code of CMM's two submodules. These are the Coal Production Submodule (CPS) and the Coal Distribution Submodule (CDS).
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21
We consider deterministic and {\\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\\in\\{H_1,...,H_m\\}$, $H=\\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\\e$ at least have $\\Omega(t^{3/2}\\e^{-1/2})$ exponentials.
IEEE TRANSACTIONS ON COMMUNICATIONS 1 An Efficient Algorithmic Lower Bound for the
Wehlau, David
IEEE TRANSACTIONS ON COMMUNICATIONS 1 An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes Firouz Behnamfar, Member, IEEE, Fady Alajaji, Senior Member, IEEE, and Tam´as Linder, Senior Member, IEEE Abstract We present an efficient algorithmic lower bound for the block error rate
Parameterized algorithms and computational lower bounds: a structural approach
Xia, Ge
2006-10-30
Many problems of practical significance are known to be NP-hard, and hence, are unlikely to be solved by polynomial-time algorithms. There are several ways to cope with the NP-hardness of a certain problem. The most popular ...
U.S. Regional Demand Forecasts Using NEMS and GIS
Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris
2005-01-01
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-01
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-01
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
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)DecadeYear Jan Feb Mar AprThousand Cubic Feet) DecadeYear2CubicfromCubicNEMS
NEMS Buildings Sector Working Group Meeting
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming963Residential2, 2014ProvedYear Jan Feb Mar AprCubic Feet)Rowe: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-01
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-01
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.
Assessment and Suggestions to Improve the Commercial Building Module of EIA-NEMS
O'Neal, D. L.; Reddy, T. A.; Sucher, B.
1996-01-01
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...
Floating-point unit (FPU) designs with nano-electromechanical (NEM) relays
Dutta, Sumit, S.M. Massachusetts Institute of Technology
2013-01-01
Nano-electromechanical (NEM) relays are an alternative to CMOS transistors as the fabric of digital circuits. Circuits with NEM relays offer energy-efficiency benefits over CMOS since they have zero leakage power and are ...
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 Delicious RankADVANCED MANUFACTURINGEnergy Bills andOrder 422.1, CONDUCT OFER-B-00-020 DOEProgramNEMS-H2, Version 1.0
Price Responsiveness in the AEO2003 NEMS Residential and Commercial Buildings Sector Models
Reports and Publications (EIA)
2003-01-01
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.
The Practical Applications of Net Energy Metering (NEM) By: Ken Linder and Katie Noland
Maxwell, Bruce D.
Applications of Net Energy Metering (NEM) By: Ken Linder and Katie Noland Recommendations: Currently the Net Energy Metering (NEM) law in accordance to Montana state policy caps the amount of energy reimbursable by utility companies for personal production of energy. The goal of the capstone class policy group is to put
A 2D/1D coupling neutron transport method based on the matrix MOC and NEM methods
Zhang, H.; Zheng, Y.; Wu, H.; Cao, L.
2013-07-01
A new 2D/1D coupling method based on the matrix MOC method (MMOC) and nodal expansion method (NEM) is proposed for solving the three-dimensional heterogeneous neutron transport problem. The MMOC method, used for radial two-dimensional calculation, constructs a response matrix between source and flux with only one sweep and then solves the linear system by using the restarted GMRES algorithm instead of the traditional trajectory sweeping process during within-group iteration for angular flux update. Long characteristics are generated by using the customization of commercial software AutoCAD. A one-dimensional diffusion calculation is carried out in the axial direction by employing the NEM method. The 2D and ID solutions are coupled through the transverse leakage items. The 3D CMFD method is used to ensure the global neutron balance and adjust the different convergence properties of the radial and axial solvers. A computational code is developed based on these theories. Two benchmarks are calculated to verify the coupling method and the code. It is observed that the corresponding numerical results agree well with references, which indicates that the new method is capable of solving the 3D heterogeneous neutron transport problem directly. (authors)
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-01
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
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 ...
Investigation of the effects of soluble boron tracking on coupled CTF / NEM, LWR simulations
Biery, M.; Avramova, M.; Ivanov, K.
2013-07-01
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)
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-01
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.
Comparison of Bottom-Up and Top-Down Forecasts: Vision Industry Energy Forecasts with ITEMS and NEMS
Roop, J. M.; Dahowski, R. T
2000-01-01
Comparisons are made of energy forecasts using results from the Industrial module of the National Energy Modeling System (NEMS) and an industrial economic-engineering model called the Industrial Technology and Energy Modeling System (ITEMS), a model...
Appendix E: Other NEMS-MP results for the base case and scenarios.
Plotkin, S. E.; Singh, M. K.; Energy Systems
2009-12-03
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.
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-01
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.
Auciello, O.; Srinivasan, S.; Hiller, J.; Kabius, B. (Center for Nanoscale Materials); ( MSD)
2009-01-01
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-04
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.
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
Algorithms Demands and Bounds Applications of Flow
Kabanets, Valentine
2/28/2014 1 Algorithms Demands and Bounds Applications of Flow Networks Design and Analysis of Algorithms Andrei Bulatov Algorithms Demands and Bounds 12-2 Lower Bounds The problem can be generalized) capacities (ii) demands (iii) lower bounds A circulation f is feasible if (Capacity condition) For each e E
Broader source: Energy.gov (indexed) [DOE]
facilities on the military installation does not exceed 50% of the highest daily peak demand for electricity at that military installation over the course of the preceding...
NEMS International Energy Module
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 PageMonthly","10/2015"4,"Ames5 Tables July 1996 Energy Information Administration Office of Coal, Nuclear,Decade Year-03.82 (MillionandIndustrialYear137
Michele Mosca
2008-08-04
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
Central Ferry Lower Monumental
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
& Reliability Projects Expand Projects Skip navigation links Line Projects Big Eddy-Knight Central Ferry Lower Monumental Grand Coulee Transmission Line Replacement...
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
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.
Obtaining Lower Bounds from the Progressive Hedging Algorithm ...
2014-01-21
Oct 11, 2013 ... Energy Network Integration (GENI) program, and by the Department of Energy's Office ... sizing [18], electricity generation unit commitment [32], supply chain design ...... Ela, E., Milligan, M., O'Malley, M.: A flexible power system operations simulation model ... etration in a transmission constrained network.
Lower Bounds and Exact Algorithms for the Quadratic Minimum ...
2013-12-16
Dec 16, 2013 ... 50. 1225. OP2. 13198. -. -. 13231. 5608. 12940.4. 189. 71. 8244. -. -. -. -. -. -. 50. 1225. OP2. 15137. -. -. 15218. 4768. 14708.5. 193. 123. 11761.
Topics in Approximation Algorithms
Khare, Monik
2012-01-01
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
Nikolova, Evdokia Velinova
2009-01-01
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components ...
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
Accelerating Majorization Algorithms
Leeuw, Jan de
2008-01-01
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
KIRKPATRICK, BONNIE
2011-01-01
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
LOWER COLUMBIA SALMON AND STEELHEAD
Appendices Prepared By: Lower Columbia Fish Recovery Board Prepared For Northwest Power And Conservation for Recovery and Subbasin Planning prepared under direction of the Washington Lower Columbia River Fish prepared by the Fish Recovery Board. The Technical Foundation is an encyclopedia of information relating
Improved Sampling Algorithms in Lattice QCD
Gambhir, Arjun Singh
2015-01-01
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Improved Sampling Algorithms in Lattice QCD
Arjun Singh Gambhir; Kostas Orginos
2015-06-19
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Automatic toilet seat lowering apparatus
Guerty, Harold G. (Palm Beach Gardens, FL)
1994-09-06
A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat. A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat.
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
Algorithms and Problem Solving Introduction
Razak, Saquib
Unit 16 1 Algorithms and Problem Solving · Introduction · What is an Algorithm? · Algorithm Properties · Example · Exercises #12;Unit 16 2 What is an Algorithm? What is an Algorithm? · An algorithm. · The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption
California at Irvine, University of
How Efficient Can We Be?: Bounds on Algorithm Energy Consumption Andrew Gearhart #12;Relation design use feedback to "cotune" compute kernel energy efficiency #12;Previous Work: Communication Lower-optimal" algorithms #12;Communication is energy inefficient! · On-chip/Off-chip gap isn't going to improve much Data
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Rubinfeld, Ronitt
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can ...
Algorithms for strategic agents
Weinberg, S. Matthew (Seth Matthew)
2014-01-01
In traditional algorithm design, no incentives come into play: the input is given, and your algorithm must produce a correct output. How much harder is it to solve the same problem when the input is not given directly, but ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01
Indigenous Optimizing Algorithm. Mathematical Anthropologythe use of maximizing algorithms in behavior is a crucialthe knowledge, rules, and algorithms that they apply. If we
Variational Algorithms for Marginal MAP
Liu, Q; Ihler, A
2013-01-01
2004. A. L. Yuille. CCCP algorithms to minimize the BetheA tutorial on MM algorithms. The American Statistician, 1(time approximation algorithms for the ising model. SIAM
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Catalyst for producing lower alcohols
Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)
1987-01-01
A process and system for the production of the lower alcohols such as methanol, ethanol and propanol involves the reaction of carbon monoxide and water in the presence of a lead salt and an alkali metal formate catalyst combination. The lead salt is present as solid particles such as lead titanate, lead molybdate, lead vanadate, lead zirconate, lead tantalate and lead silicates coated or in slurry within molten alkali metal formate. The reactants, carbon monoxide and steam are provided in gas form at relatively low pressures below 100 atmospheres and at temperatures of 200-400.degree. C. The resulted lower alcohols can be separated into boiling point fractions and recovered from the excess reactants by distillation.
Physical Algorithms Roger Wattenhofer
Physical Algorithms Roger Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
Relation between XL algorithm and Grobner Bases Algorithms
International Association for Cryptologic Research (IACR)
Relation between XL algorithm and Gr¨obner Bases Algorithms Makoto Sugita1 , Mitsuru Kawazoe2 the XL algorithm and Gr¨obner bases algorithms. The XL algorithm was proposed to be a more efficient algorithm to solve a system of equations with a special assumption with- out trying to calculate a whole Gr
Lower Sioux Wind Feasibility & Development
Minkel, Darin
2012-04-01
This report describes the process and findings of a Wind Energy Feasibility Study (Study) conducted by the Lower Sioux Indian Community (Community). The Community is evaluating the development of a wind energy project located on tribal land. The project scope was to analyze the critical issues in determining advantages and disadvantages of wind development within the Community. This analysis addresses both of the Community's wind energy development objectives: the single turbine project and the Commerical-scale multiple turbine project. The main tasks of the feasibility study are: land use and contraint analysis; wind resource evaluation; utility interconnection analysis; and project structure and economics.
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
Savings Project: Lower Water Heating Temperature | Department...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Savings Project: Lower Water Heating Temperature Savings Project: Lower Water Heating Temperature Addthis Project Level Easy Energy Savings 12-30 annually for each 10F...
Lower hybrid wavepacket stochasticity revisited
Fuchs, V.; Krlín, L.; Pánek, R.; Preinhaelter, J.; Seidl, J.; Urban, J.
2014-02-12
Analysis is presented in support of the explanation in Ref. [1] for the observation of relativistic electrons during Lower Hybrid (LH) operation in EC pre-heated plasma at the WEGA stellarator [1,2]. LH power from the WEGA TE11 circular waveguide, 9 cm diameter, un-phased, 2.45 GHz antenna, is radiated into a B?0.5 T, Ðœ„n{sub e}?5×10{sup 17} 1/m{sup 3} plasma at T{sub e}?10 eV bulk temperature with an EC generated 50 keV component [1]. The fast electrons cycle around flux or drift surfaces with few collisions, sufficient for randomizing phases but insufficient for slowing fast electrons down, and thus repeatedly interact with the rf field close to the antenna mouth, gaining energy in the process. Our antenna calculations reveal a standing electric field pattern at the antenna mouth, with which we formulate the electron dynamics via a relativistic Hamiltonian. A simple approximation of the equations of motion leads to a relativistic generalization of the area-preserving Fermi-Ulam (F-U) map [3], allowing phase-space global stochasticity analysis. At typical WEGA plasma and antenna conditions, the F-U map predicts an LH driven current of about 230 A, at about 225 W of dissipated power, in good agreement with the measurements and analysis reported in [1].
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01
and A. Spillner. Consistency of the Neighbor-Net algorithm.Algorithms for Molecular Biology, 2:8, 2007. [10] P.D. Gusfield. Efficient algorithms for inferring evolutionary
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
Optimized Algorithms Boost Combustion Research
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Optimized Algorithms Boost Combustion Research Optimized Algorithms Boost Combustion Research Methane Flame Simulations Run 6x Faster on NERSC's Hopper Supercomputer November 25,...
Winter Energy Savings from Lower Thermostat Settings
Reports and Publications (EIA)
2000-01-01
This discussion provides details on the effect of lowering thermostat settings during the winter heating months of 1997.
MANAGEMENT OF AGRICULTURAL WASTES LOWER FRASER VALLEY
#12;MANAGEMENT OF AGRICULTURAL WASTES IN THE LOWER FRASER VALLEY SUMMARY REPORT - A WORKING DOCUMENT Presented on Behalf of: The Management of Agricultural Wastes in the Lower Fraser Valley Program of the Agricultural Nutrient Management in the Lower Fraser Valley program. The ideas and opinions expressed herein do
Nagurney, Anna
Transformation, Appears in Transportation Research D 11, 171-190. Dmytro Matsypura Electric Power Supply Chain Markets Transmission Service Providers Power SupplIntroduction The Model The Algorithm Modeling of Electric Power Supply Chain Networks with Fuel
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
A lower bound for the tree-width of planar graphs with vital linkages
Adler, Isolde
A lower bound for the tree-width of planar graphs with vital linkages Isolde Adler, Philipp Klaus implementable. The algorithm uses a bound on the tree- width of graphs with vital linkages, and deletion with vital linkages, and for the size of the grid necessary for finding irrelevant vertices. 1 Introduction
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy
Stadler, Peter F.
Europhysics Letters PREPRINT Exploring the lower part of discrete polymer model energy landscapes a generic, problem independent algorithm for exploration of the low- energy portion of the energy landscape of discrete systems and apply it to the energy landscape of lattice proteins. Starting from a set of optimal
New Effective Multithreaded Matching Algorithms
Manne, Fredrik; Halappanavar, Mahantesh
2014-05-19
Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.
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
Ricci, Laura
Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms EpidemicD in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \\lim_{+\\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \\lambda q, with \\lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.
Displacing Natural Gas Consumption and Lowering Emissions
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
for Refinery and Chemical Plant Process Heaters ADVANCED MANUFACTURING OFFICE Displacing Natural Gas Consumption and Lowering Emissions By enabling process heaters to utilize...
Savings Project: Lower Water Heating Temperature | Department...
Broader source: Energy.gov (indexed) [DOE]
Thermostats Savings Project: Lower Water Heating Temperature Tips: Passive Solar Heating and Cooling Where to insulate. Adding insulation in the areas shown here may be...
Liquid Fuels Market Module - NEMS Documentation
Reports and Publications (EIA)
2014-01-01
Defines the objectives of the Liquid Fuels Market Model (LFMM), describes its basic approach, and provides detail on how it works. This report is intended as a reference document for model analysts, users, and the public.
Disentangling Clustering Effects in Jet Algorithms
Randall Kelley; Jonathan R. Walsh; Saba Zuberi
2012-04-04
Clustering algorithms build jets though the iterative application of single particle and pairwise metrics. This leads to phase space constraints that are extremely complicated beyond the lowest orders in perturbation theory, and in practice they must be implemented numerically. This complication presents a significant barrier to gaining an analytic understanding of the perturbative structure of jet cross sections. We present a novel framework to express the jet algorithm's phase space constraints as a function of clustered groups of particles, which are the possible outcomes of the algorithm. This approach highlights the analytic properties of jet observables, rather than the explicit constraints on individual final state momenta, which can be unwieldy at higher orders. We derive the form of the n-particle phase space constraints for a jet algorithm with any measurement. We provide an expression for the measurement that makes clustering effects manifest and relates them to constraints from clustering at lower orders. The utility of this framework is demonstrated by using it to understand clustering effects for a large class of jet shape observables in the soft/collinear limit. We apply this framework to isolate divergences and analyze the logarithmic structure of the Abelian terms in the soft function, providing the all-orders form of these terms and showing that corrections from clustering start at next-to-leading logarithmic order in the exponent of the cross section.
Incentives and Internet Algorithms
Feigenbaum, Joan
Game Theory Internet Design #12;9 Game Theory and the Internet Â· Long history of work: Â NetworkingIncentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf Scott with selfishness? Â· Internet Architecture: robust scalability Â How to build large and robust systems? #12
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Powell, Warren B.
wind supply, demand and electricity prices may evolve stochastically. We found that the algorithm and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We use received significant attention as a way to increase the efficiency of the electrical grid by smoothing
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
Pavel, Lacra
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game Lacra Pavel Department. A Nash game is formulated between channels with channel utility related to maximizing channel optical the coupled Nash game into a lower-level Nash game with no coupled constraints, and a higher-level link
Quantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1
Salvaggio, Carl
, and quantitatively evaluate infrared contrast enhancement algorithms for use in a real-time long-wave infrared imageQuantitative analysis of infrared contrast enhancement algorithms Seth Weith-Glushko1 and Carl range imagery output from current sensors are compressed in a pleasing way for display on lower dynamic
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
The optimization problem Genetic Algorithm
Giménez, Domingo
The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
CERTIFICATION REGARDING LOBBYING LOWER TIER COVERED TRANSACTIONS
Kurapov, Alexander
, or an employee of a Member of Congress in connection with this commitment providing for the United StatesCERTIFICATION REGARDING LOBBYING LOWER TIER COVERED TRANSACTIONS Applicants should review
Lower Saccharide Nanometric Materials and Methods
Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek
2004-07-13
A ceramic composition having at least one nanometric ceramic powder, at least one lower saccharide, and water. The composition is useful in many industrial applications, including preparation of stronger and substantially defect free green and sintered ceramic bodies.
Capturing Waste Gas: Saves Energy, Lower Costs
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Capturing Waste Gas: Saves Energy, Lowers Costs ArcelorMittal's Indiana Harbor plant in East Chicago, Indiana, is the largest steel mill in the Western Hemisphere. It operates five...
Continental Lower Crust Bradley R. Hacker,1
Hacker, Bradley R.
Continental Lower Crust Bradley R. Hacker,1 Peter B. Kelemen,2 and Mark D. Behn3 1 Department of Earth Science, University of California, Santa Barbara, California 93106; email: hacker@geol.ucsb.edu 2
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Axioms, algorithms and Hilbert's Entscheidungsproblem
Axioms, algorithms and Hilbert's Entscheidungsproblem Jan Stovicek Department of Mathematical Sciences September 9th, 2008 www.ntnu.no Jan Stovicek, Axioms & algorithms #12;2 Outline The Decision & algorithms #12;3 Outline The Decision Problem Formal Languages and Theories Incompleteness Undecidability www
Algorithms for builder guidelines
Balcomb, J.D.; Lekov, A.B.
1989-06-01
The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
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
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
EARTH SCIENCES Lower-Division Requirements
Constable, Steve
2012-2013 EARTH SCIENCES Lower-Division Requirements Math 20A_____ 20B_____ 20C_____ 20D (BILD 3) _____ SIO 50* _____ Group A: Earth Science Upper-Division Core Requirements (all courses _____ Introduction to Geophysics SIO 104 _____ Paleobiology and History of Life* Group B: Upper-Division Earth
THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN
Rutten, Rob
over large fields, long times and many wave- lengths (heights) simultaneously -- Judge and Peter (1998THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN Sterrekundig Instituut, Postbus 80 000, NLÂ3508 TA, Utrecht, The Netherlands Abstract. This "rapporteur" report discusses the solar photosphere and low
Lower-Dimensional Black Hole Chemistry
Antonia M. Frassino; Robert B. Mann; Jonas R. Mureika
2015-09-18
The connection between black hole thermodynamics and chemistry is extended to the lower-dimensional regime by considering the rotating and charged BTZ metric in the $(2+1)$-D and a $(1+1)$-D limits of Einstein gravity. The Smarr relation is naturally upheld in both BTZ cases, where those with $Q \
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
Algorithms for dynamical overlap fermions
Stefan Schaefer
2006-09-28
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
A bridge to lower overhead quantum computation
Austin G. Fowler; Simon J. Devitt
2013-04-09
Two primary challenges stand in the way of practical large-scale quantum computation, namely achieving sufficiently low error rate quantum gates and implementing interesting quantum algorithms with a physically reasonable number of qubits. In this work we address the second challenge, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code. The surface code has a number of highly desirable properties, including the ability to achieve arbitrarily reliable computation given sufficient qubits and quantum gate error rates below approximately 1%, and the use of only a 2-D array of qubits with nearest neighbor interactions. As such, our compression technique is of great practical relevance.
Algorithms for Supporting Compiled Communication
Yuan, Xin
Algorithms for Supporting Compiled Communication Xin Yuan Rami Melhem Rajiv Gupta Dept. We present an experimental compiler, ESUIF, that supports compiled communication for High algorithms used in ESUIF. We further demonstrate the effectiveness of compiled communication on all optical
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.
Arctic Lower Troposphere Observed Structure (ALTOS)
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsiclouddenDVA N C E D B L O O D SFederal8823 Revision 02August 1, Lower Troposphere
Lower Snake River I | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsource HistoryScenarios Towards 2050 Jump to: navigation, search ToolWells andLower
Lower Colorado River Authority | Department of Energy
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on DeliciousMathematicsEnergyInterested Parties - WAPA PublicLED1,400 Jobs |Inc. | DepartmentModeling AssessmentLower
EIA lowers forecast for summer gasoline prices
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming Dry Natural GasNatural GasEIA lowers forecast for summer gasoline prices
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
Environmental analysis of Lower Pueblo/Lower Los Alamos Canyon, Los Alamos, New Mexico
Ferenbaugh, R.W.; Buhl, T.E.; Stoker, A.K.; Becker, N.M.; Rodgers, J.C.; Hansen, W.R.
1994-12-01
The radiological survey of the former radioactive waste treatment plant site (TA-45), Acid Canyon, Pueblo Canyon, and Los Alamos Canyon found residual contamination at the site itself and in the channel and banks of Acid, Pueblo, and lower Los Alamos Canyons all the way to the Rio Grande. The largest reservoir of residual radioactivity is in lower Pueblo Canyon, which is on DOE property. However, residual radioactivity does not exceed proposed cleanup criteria in either lower Pueblo or lower Los Alamos Canyons. The three alternatives proposed are (1) to take no action, (2) to construct a sediment trap in lower Pueblo Canyon to prevent further transport of residual radioactivity onto San Ildefonso Indian Pueblo land, and (3) to clean the residual radioactivity from the canyon system. Alternative 2, to cleanup the canyon system, is rejected as a viable alternative. Thousands of truckloads of sediment would have to be removed and disposed of, and this effort is unwarranted by the low levels of contamination present. Residual radioactivity levels, under either present conditions or projected future conditions, will not result in significant radiation doses to persons exposed. Modeling efforts show that future transport activity will not result in any residual radioactivity concentrations higher than those already existing. Thus, although construction of a sediment trap in lower Pueblo Canyon is a viable alternative, this effort also is unwarranted, and the no-action alternative is the preferred alternative.
Sensor Networks: Distributed Algorithms Reloaded or Revolutions?
Sensor Networks: Distributed Algorithms Reloaded or Revolutions? Roger Wattenhofer Computer. This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why community, a sensor network essentially is a database. The distributed algorithms community should join
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01
Resolution QRS Detection Algorithm for Sparsely Sampled ECGShamlo. 2011. A disk-aware algorithm for time series motifJ. M. Kleinberg, 1997. Two algorithms for nearest-neighbor
End of semester project Global Optimization algorithms
Dreyfuss, Pierre
End of semester project Global Optimization algorithms Ecole Polytechnique de l'UniversitÃ© de Nice.......................................................................................................................................3 II. Simulated annealing algorithm (SA.........................................................................................................................................7 2.Principle,algorithm and choice of parameters
Minimally entangled typical thermal state algorithms
Stoudenmire, E. M.; White, Steven R.
2010-01-01
s 2 t 2 ? 1 )? 2 and the algorithm continued by defining R 3order indicated, this algorithm for multiplying MPOs scalestypical thermal state algorithms E M Stoudenmire 1 and
Kinematics Algorithms for Tensegrity Structures
Burt, Steven James
2013-01-01
A kinematic notation for lower-pair mechanisms based onKinematic analysis of a translational 3-dof tensegrity mechanism.
A Direct Manipulation Language for Explaining Algorithms
Scott, Jeremy
Instructors typically explain algorithms in computer science by tracing their behavior, often on blackboards, sometimes with algorithm visualizations. Using blackboards can be tedious because they do not facilitate ...
A family of lowered isothermal models
Gieles, Mark
2015-01-01
We present a family of self-consistent, spherical, lowered isothermal models, consisting of one or more mass components, with parameterised prescriptions for the energy truncation and for the amount of radially biased pressure anisotropy. The models are particularly suited to describe the phase-space density of stars in tidally limited, mass-segregated star clusters in all stages of their life-cycle. The models extend a family of isotropic, single-mass models by Gomez-Leyton and Velazquez, of which the well-known Woolley, King and Wilson (in the non-rotating and isotropic limit) models are members. We derive analytic expressions for the density and velocity dispersion components in terms of potential and radius, and introduce a fast model solver in PYTHON (LIMEPY), that can be used for data fitting or for generating discrete samples.
Lower Hybrid antennas for nuclear fusion experiments
Hillairet, Julien; Bae, Young-Soon; Bai, X; Balorin, C; Baranov, Y; Basiuk, V; Bécoulet, A; Belo, J; Berger-By, G; Brémond, S; Castaldo, C; Ceccuzzi, S; Cesario, R; Corbel, E; Courtois, X; Decker, J; Delmas, E; Delpech, L; Ding, X; Douai, D; Ekedahl, A; Goletto, C; Goniche, M; Guilhem, D; Hertout, P; Imbeaux, F; Litaudon, X; Magne, R; Mailloux, J; Mazon, D; Mirizzi, F; Mollard, P; Moreau, P; Oosako, T; Petrzilka, V; Peysson, Y; Poli, S; Preynas, M; Prou, M; Saint-Laurent, F; Samaille, F; Saoutic, B
2015-01-01
The nuclear fusion research goal is to demonstrate the feasibility of fusion power for peaceful purposes. In order to achieve the conditions similar to those expected in an electricity-generating fusion power plant, plasmas with a temperature of several hundreds of millions of degrees must be generated and sustained for long periods. For this purpose, RF antennas delivering multi-megawatts of power to magnetized confined plasma are commonly used in experimental tokamaks. In the gigahertz range of frequencies, high power phased arrays known as "Lower Hybrid" (LH) antennas are used to extend the plasma duration. This paper reviews some of the technological aspects of the LH antennas used in the Tore Supra tokamak and presents the current design of a proposed 20 MW LH system for the international experiment ITER.
Machine History Pertinent to Lower Hybird Coupler Analysis
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
82005 History Pertinent to Lower Hybird Coupler Analysis 0104 lower hybrid fwg installed and flange leaktight 0113 first pumpdown following up-to-air 0120 start magnet cooldown...
Energy Department Announces $9 Million to Lower Costs, Increase...
Office of Environmental Management (EM)
9 Million to Lower Costs, Increase Performance of Solar Energy Systems Energy Department Announces 9 Million to Lower Costs, Increase Performance of Solar Energy Systems December...
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08
The paper reviews progress in imaging in radio interferometry for the period 1993-1996. Unlike an optical telescope, the basic measurements of a radio interferometer (correlations between antennas) are indirectly related to a sky brightness image. In a real sense, algorithms and computers are the lenses of a radio interferometer. In the last 20 years, whereas interferometer hardware advances have resulted in improvements of a factor of a few, algorithm and computer advances have resulted in orders of magnitude improvement in image quality. Developing these algorithms has been a fruitful and comparatively inexpensive method of improving the performance of existing telescopes, and has made some newer telescopes possible. In this paper, we review recent developments in the algorithms used in the imaging part of the reduction process. What constitutes an `imaging algorithm'? Whereas once there was a steady `forward' progression in the reduction process of editing, calibrating, transforming and, finally, deconvolving, this is no longer true. The introduction of techniques such as self-calibration, and algorithms that go directly from visibilities to final images, have made the dividing lines less clear. Although we briefly consider self-calibration, for the purposes of this paper calibration issues are generally excluded. Most attention will be directed to the steps which form final images from the calibrated visibilities.
Nonlinear evolution of lower hybrid waves Charles F. F. Karney
Karney, Charles
problem. With typical fields for lower hybrid heating of a tokamak, it is found that large reflections can occur close to the edge of the plasma. I. INTRODUCTION In typical lower hybrid heating schemes, lower hy, and determine the consequences of our results for lower hybrid heating. The plan of this paper i s a s follows
Efficient discrete-time simulations of continuous-time quantum query algorithms
R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo
2008-11-26
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.
Cholesterol-Lowering Foods Tasty, functional foods help you lower cholesterol naturally.
. Morgan Griffin Reviewed by Brunilda Nazario, MD WebMD Feature Do you want a diet to lower cholesterol? We Harris, DrPH, RD, spokeswoman, American Dietetic Association. U.S. Food and Drug Administration web site. American Dietetic Association web site. National Heart, Lung, and Blood Institute web site. American Heart
The lower extremity dexterity test as a measure of lower extremity dynamical capability
Valero-Cuevas, Francisco
Angeles, CA 90089-9006, United States b Department of Biomedical Engineering, Viterbi School of Engineering, University of Southern California, Los Angeles, CA, United States c School of Applied Physiology the extent to which it is associated with lower extremity strength and anthropometry in healthy young adults
Designing a Computational Geometry Algorithms Library \\Lambda
Waldmann, Uwe
for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM, Udine, Italy, September
9. Genetic Algorithms 9.1 Introduction
Cambridge, University of
66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem
Papalaskari, Mary-Angela
CSC 8301 Design and Analysis of Algorithms Lecture 1 CSC 8301CSC 8301-- Design and Analysis of AlgorithmsDesign and Analysis of Algorithms Lecture 1Lecture 1 Algorithms: OverviewAlgorithms: Overview Next time: Principles of the analysis of algorithms (2.1, 2.2) Design and Analysis of Algorithms
INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592. Theorem 5.1.2A, 26. Theorem{54. Theorem 5.1.4C, 55. Algorithm 5.1.4D, 50. Theorem 5.1.4D, 57. Algorithm 5.1.4G, 69. Algorithm 5.1.4H, 612. Theorem 5.1.4H, 60. Algorithm 5.1.4I, 49{50. Algorithm 5.1.4P, 70. Algorithm 5.1.4Q, 614. Algorithm 5.1.4S
INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4. Algorithm 1.1F, 466. Algorithm 1.2.1E, 13{14. Algorithm 1.2.1I, 11{12. Algorithm 1.2.2E, 470. Algorithm 1.2.2L, 26. Law 1.2.4A, 40. Law, 81{82. Theorem 1.2.10A, 101. Algorithm 1.2.10M, 96. Theorem 1.2.11.3A, 119. Algorithm 1.3.2E, 160
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01
and California algorithm #8 using Fuzzy Logic to evaluate the new algorithm's effectiveness in detecting incidents on freeways. To test these algorithms, real data from TransGuide were run through the algorithms. Algorithm output were compared with CCTV (closed...
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent on
Santhanam, Balu
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent. Stability and convergence time issues of concern for ill- conditioned inputs. Leaky LMS AlgorithmLeaky LMS cost. Block LMS AlgorithmBlock LMS Algorithm Uses type-I polyphase components of the input u[n]: Block
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a quantum computer can induce quantum chaos and put into question the operability of a quantum computer. In this work I investigate whether already the interactions between the qubits introduced with the intention to operate the quantum computer may lead to quantum chaos. The analysis focuses on two well--known quantum algorithms, namely Grover's search algorithm and the quantum Fourier transform. I show that in both cases the same very unusual combination of signatures from chaotic and from integrable dynamics arises.
A genetic algorithm based method for docking flexible molecules
Judson, R.S. [Sandia National Labs., Livermore, CA (United States); Jaeger, E.P.; Treasurywala, A.M. [Sterling-Winthrop Inc., Collegeville, PA (United States)
1993-11-01
The authors describe a computational method for docking flexible molecules into protein binding sites. The method uses a genetic algorithm (GA) to search the combined conformation/orientation space of the molecule to find low energy conformation. Several techniques are described that increase the efficiency of the basic search method. These include the use of several interacting GA subpopulations or niches; the use of a growing algorithm that initially docks only a small part of the molecule; and the use of gradient minimization during the search. To illustrate the method, they dock Cbz-GlyP-Leu-Leu (ZGLL) into thermolysin. This system was chosen because a well refined crystal structure is available and because another docking method had previously been tested on this system. Their method is able to find conformations that lie physically close to and in some cases lower in energy than the crystal conformation in reasonable periods of time on readily available hardware.
Fact #889: September 7, 2015 Average Diesel Price Lower than...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
9: September 7, 2015 Average Diesel Price Lower than Gasoline for the First Time in Six Years Fact 889: September 7, 2015 Average Diesel Price Lower than Gasoline for the First...
Energy Department Helping Lower Biofuel Costs for the Nation...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Energy Department Helping Lower Biofuel Costs for the Nation Energy Department Helping Lower Biofuel Costs for the Nation January 29, 2015 - 9:31am Addthis Biofuels are produced in...
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Transition in the Earth's Lower Mantle Print It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing...
Protecting Public Health through Cleaner Fuels and Lower Emissions...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Protecting Public Health through Cleaner Fuels and Lower Emissions Protecting Public Health through Cleaner Fuels and Lower Emissions December 14, 2015 1:00PM to 2:00PM EST 385...
Algorithmic Aspects of Risk Management
Gehani, Ashish
Algorithmic Aspects of Risk Management Ashish Gehani1 , Lee Zaniewski2 , and K. Subramani2 1 SRI International 2 West Virginia University Abstract. Risk analysis has been used to manage the security of sys configuration. This allows risk management to occur in real time and reduces the window of exposure to attack
Algorithmic + Geometric characterization of CAR
Gill, Richard D.
Algorithmic + Geometric characterization of CAR (Coarsening at Random) Richard Gill - Utrecht but independent) CCAR 3 door problem X=door with car behind Y=two doors still closed = {your first choice, other door left closed} 3 door problem X=door with car behind Y=(your first choice, other door left closed
GEET DUGGAL Algorithms for Determining
Relationship to Gene Regulation Final Public Oral Examination Doctor of Philosophy Recent genome sequencing. Analyses from them have shown that the 3D structure of DNA may be closely linked to genome functions structure of DNA and genome function on the scale of the whole genome. Specifically, we designed algorithms
Adaptive protection algorithm and system
Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Digitales Video Scanline Algorithms -1 -
that exploits simplifications in digital filtering and memory access. The geometric transformations a special class of geometric transformation techniques that operate only along rows and columns. The purpose be resampled independently of the other. Separable algorithms spatially transform 2-D images by decomposing
R. Guerraoui 1 Distributed algorithms
Guerraoui, Rachid
and then algorithms 7 Best-effort broadcast (beb) Events Request: bebBroadcast, m> Indication: bebDeliver, src, m> Â· Properties: BEB1, BEB2, BEB3 8 Best-effort broadcast (beb) Properties BEB1. Validity: If pi and pj are correct, then every message broadcast by pi is eventually delivered by pj BEB2. No duplication: No message
Algorithmic Thermodynamics John C. Baez
Cortes, Corinna
Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + Âµd
Hierarchical Correctness Proofs Distributed Algorithms
Tuttle, Mark R.
distributed networks. With this model we are able to construct modular, hierarchical correct- ness proofs these messages and process variables can be extremely di cult, and the resulting proofs of correct- ness of the full algorithm's correct- ness. Some time ago, we began to consider this approach of proof by re nement
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2005 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2005 spring out-migration at migrant traps on the Snake River and Salmon River. In 2005 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, the age-1 and older fish were distinguishable from wild fish by the occurrence of fin erosion. Age-0 Chinook salmon are more difficult to distinguish between wild and non-adclipped hatchery fish and therefore classified as unknown rearing. The total annual hatchery spring/summer Chinook salmon catch at the Snake River trap was 0.34 times greater in 2005 than in 2004. The wild spring/summer Chinook catch was 0.34 times less than the previous year. Hatchery steelhead trout catch was 0.67 times less than in 2004. Wild steelhead trout catch was 0.72 times less than the previous year. The Snake River trap collected 1,152 age-0 Chinook salmon of unknown rearing. During 2005, the Snake River trap captured 219 hatchery and 44 wild/natural sockeye salmon and 110 coho salmon O. kisutch of unknown rearing. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. Trap operations began on March 6 and were terminated on June 3. The trap was out of operation for a total of one day due to heavy debris. FPC requested that the trap be restarted on June 15 through June 22 to collect and PIT tag age-0 Chinook salmon. Hatchery Chinook salmon catch at the Salmon River trap was 1.06 times greater and wild Chinook salmon catch was 1.26 times greater than in 2004. The hatchery steelhead trout collection in 2005 was 1.41 times greater and wild steelhead trout collection was 1.27 times greater than the previous year. Trap operations began on March 6 and were terminated on May 17 due to high flows. There were two days when the trap was taken out of service because of mechanical failure. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for passive integrated transponder (PIT) tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2005 data detected a relation between migration rate and discharge for hatchery Chinook but was unable to detect a relation for wild Chinook. The inability to detect a migration rate discharge relation for wild Chinook salmon was caused by a lack of data. For hatchery Chinook salmon there was a 1.8-fold increase in migration rate between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 2.2-fold and a 2.2-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2005 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon, hatchery steelhead trout, and wild steelhead trout. Migration rate increased 4.2-fold for hatchery Chinook salmon, 2.9-fold for wild Chinook salmon and 2.5-fold for hatchery steelhead, and 1.7-fold for wild steelhead as discharge increased between 50 kcfs and 100 kcfs. Fish tagged with PIT tags at the Snake River and Salmon River traps were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at Lower Granite Dam in 2001, caution must be used in comparing cumulative interrogation data. Cumulative interrogations at the fo
Investigating jets in the lower-to-mid solar atmosphere
, in the lower-to-mid solar atmosphere, remains one of the biggest unanswered questions in solar physics today reconnection driven processes. Spicules are one of the most common features in the lower-to-mid solarInvestigating jets in the lower-to-mid solar atmosphere: Observations & Numerical Simulations Eamon
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Radziszowski, Stanislaw P.
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers Xu Xiaodong and Xie Zheng studies lower bounds for classical multicolor Ramsey numbers, #12;rst by giving a short overview of past diagonal and o#11;-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for R
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits
Edinburgh, University of
Lower Bounds on Interactive Compressibility by Constant-Depth Circuits Arkadev Chattopadhyay to prove the first lower bounds on general probabilistic multi-round instance compression. We show, and strengthens results of Dubrov and Ishai [DI06]. We also show that a similar lower bound holds for Majority. We
BATTERY -FRIENDLY DESIGN OF SIGNAL PROCESSING ALGORITHMS Praveen Raghavan & Chaitali Chakrabarti
Kambhampati, Subbarao
BATTERY - FRIENDLY DESIGN OF SIGNAL PROCESSING ALGORITHMS Praveen Raghavan & Chaitali Chakrabarti metric. This is unfortunate since maximizing battery lifetime is a more appropriate inetric, and lowering energy does not necessarily mean improving battery lifetime. In this paper we first show how to design
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 2002 spring out-migration at migrant traps on the Snake River and Salmon River. In 2002 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 11.4 times greater in 2002 than in 2001. The wild Chinook catch was 15.5 times greater than the previous year. Hatchery steelhead trout catch was 2.9 times greater than in 2001. Wild steelhead trout catch was 2.8 times greater than the previous year. The Snake River trap collected 3,996 age-0 Chinook salmon of unknown rearing. During 2002, the Snake River trap captured 69 hatchery and 235 wild/natural sockeye salmon and 114 hatchery coho salmon O. kisutch. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant increase in catch in 2002 was due to a 3.1 fold increase in hatchery Chinook production and a more normal spring runoff. Trap operations began on March 10 and were terminated on June 7. The trap was out of operation for a total of four days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 4.2 times greater and wild Chinook salmon catch was 2.4 times greater than in 2001. The hatchery steelhead trout collection in 2002 was 81% of the 2001 numbers. Wild steelhead trout collection in 2002 was 81% of the previous year's catch. Trap operations began on March 10 and were terminated on May 29 due to high flows. The trap was out of operation for four days due to high flow or debris. The increase in hatchery Chinook catch in 2002 was due to a 3.1 fold increase in hatchery production and differences in flow between years. Changes in hatchery and wild steelhead catch are probably due to differences in flow between years. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2002 data detected a relation between migration rate and discharge for hatchery and wild Chinook salmon. For hatchery and wild Chinook salmon there was a 4.7-fold and a 3.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.8-fold and a 1.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2002 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for wild Chinook salmon and hatchery steelhead trout. The analysis was unable to detect a relation between migration rate and discharge for hatchery Chinook salmon. The lack of a detectable relation was probably a result of the migration rate data being spread over a very narrow range of discharge. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 4.3-fold for wild Chinook salmon and 2.2-fold for hatchery steelhead between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River trap were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2004 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2004 spring out-migration at migrant traps on the Snake River and Salmon River. In 2004 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 1.1 times greater in 2004 than in 2003. The wild Chinook catch was 1.1 times greater than the previous year. Hatchery steelhead trout catch was 1.2 times greater than in 2003. Wild steelhead trout catch was 1.6 times greater than the previous year. The Snake River trap collected 978 age-0 Chinook salmon of unknown rearing. During 2004, the Snake River trap captured 23 hatchery and 18 wild/natural sockeye salmon and 60 coho salmon O. kisutch of unknown rearing. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. Trap operations began on March 7 and were terminated on June 4. The trap was out of operation for a total of zero days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 10.8% less and wild Chinook salmon catch was 19.0% less than in 2003. The hatchery steelhead trout collection in 2004 was 20.0% less and wild steelhead trout collection was 22.3% less than the previous year. Trap operations began on March 7 and were terminated on May 28 due to high flows. There were two days when the trap was taken out of service because wild Chinook catch was very low, hatchery Chinook catch was very high, and the weekly quota of PIT tagged hatchery Chinook had been met. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2004 data detected a relation between migration rate and discharge for wild Chinook salmon but was unable to detect a relation for hatchery Chinook. The inability to detect a migration rate discharge relation for hatchery Chinook salmon was caused by age-0 fall Chinook being mixed in with the age 1 Chinook. Age-0 fall Chinook migrate much slower than age-1 Chinook, which would confuse the ability to detect the migration rate discharge relation. When several groups, which consisted of significant numbers of age-0 Chinook salmon, were removed from the analysis a relation was detected. For hatchery and wild Chinook salmon there was a 2.8-fold and a 2.4-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 2.3-fold and a 2.0-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2004 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon and hatchery steelhead trout. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 7.0-fold for hatchery Chinook salmon, 4.7-fold for wild Chinook salmon and 3.8-fold for hatchery steelhead as discharge increased between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River and Salmon River traps were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monume
Tight Lower Bound for Linear Sketches of Moments
Andoni, Alexandr
2013-01-01
The problem of estimating frequency moments of a data stream has attracted a lot of attention since the onset of streaming algorithms [AMS99]. While the space complexity for approximately computing the p [superscript th] ...
On Learning Algorithms for Nash Equilibria
Daskalakis, Constantinos
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising games, and thus results on the convergence or ...
Convergence Conditions for Variational Inequality Algorithms
Magnanti, Thomas L.
Within the extensive variational inequality literature, researchers have developed many algorithms. Depending upon the problem setting, these algorithms ensure the convergence of (i) the entire sequence of iterates, (ii) ...
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...
Bayesian Algorithmic Mechanism Design [Extended Abstract
Hartline, Jason D.
Bayesian Algorithmic Mechanism Design [Extended Abstract] Jason D. Hartline Northwestern, Canada blucier@cs.toronto.edu ABSTRACT The principal problem in algorithmic mechanism design approach for designing incen- tive compatible mechanisms, namely that of Vickrey, Clarke, and Groves
Learning Motor Skills: From Algorithms to Robot
Learning Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu Roboter-Experimenten Zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01
2.2 Graph Search Algorithms . . . . . . . . . . . . .an Efficient Algorithm . . . . . . 4.6.4 RestrictionAn O(r)-Approximation Algorithm for GTSPP . . . . . . . .
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek; Hurand, Mathilde; Sgall, Ji?í
2009-01-01
5th European symposium on algorithms (ESA) (pp. 296–307).· Real-time systems · Algorithms 1 Introduction Ghosh etfault-tolerance testing algorithm, under the restriction
Algorithms for tandem mass spectrometry-based proteomics
Frank, Ari Michael
2008-01-01
4. MS-Clustering Algorithm . . . . . . . . . . C.De Novo Sequencing Algorithm . . . . . . C. Experimental2. The RankBoost Algorithm (Freund et al. , 2003) B.
Approximation Algorithms for the Fault-Tolerant Facility Placement Problem
Yan, Li
2013-01-01
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
Evaluating Las Vegas Algorithms ---Pitfalls and Remedies
Hoos, Holger H.
cism regarding the empirical testing of algorithms (Hooker, 1994; Hooker, 1996; McGeoch, 1996). It has
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
A Fast Algorithm for Nonstationary Delay Estimation
So, Hing-Cheung
to the explicit time delay estimator (ETDE) algorithm 4] but it is more computationally e cient and provides more
Energy Management in Microgrids: Algorithms and System
Shi, Wenbo
2015-01-01
study the supply-demand balancing problem in microgrids under more realistic conditions and pro- pose algorithms for microgrid
Tuning bandit algorithms in stochastic environments
Szepesvari, Csaba
Tuning bandit algorithms in stochastic environments Jean-Yves Audibert1 and R´emi Munos2 and Csaba@cs.ualberta.ca Abstract. Algorithms based on upper-confidence bounds for balancing exploration and exploitation a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING Dong Jia Post-Doctoral Research Associate vehicles (UAVs). Premature convergence prevents evolutionary-based algorithms from reaching global optimal. To overcome this problem, this paper presents a framework of parallel evolutionary algorithms for UAV path
Generalized URV Subspace Tracking LMS Algorithm 1
Boley, Daniel
Generalized URV Subspace Tracking LMS Algorithm 1 S. Hosur and A. H. Tew k and D. Boley Dept The convergence rate of the Least Mean Squares (LMS) algorithm is poor whenever the adaptive lter input auto-correlation matrix is ill-conditioned. In this paper we propose a new LMS algorithm to alleviate this problem
The Observer Algorithm for Visibility Approximation
Doherty, Patrick
, with dif- ferent view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm or more sentries while moving to a goal position. Algorithms for finding a covert paths in the presence of stationary and moving sentries has been devised by [5] [6]. An approximate visibility algorithm was devised
Partitioned algorithms for maximum likelihood and
Smyth, Gordon K.
Partitioned algorithms for maximum likelihood and other nonlinear estimation Gordon K. Smyth There are a variety of methods in the literature which seek to make iterative estimation algorithms more manageable by breaking the iterations into a greater number of simpler or faster steps. Those algorithms which deal
Total Algorithms \\Lambda Gerard Tel y
Utrecht, Universiteit
Total Algorithms \\Lambda Gerard Tel y Department of Computer Science, University of Utrecht, P and February 1993 Abstract We define the notion of total algorithms for networks of processes. A total algorithm enforces that a ``decision'' is taken by a subset of the processes, and that participation of all
Distributed QR Factorization Based on Randomized Algorithms
Zemen, Thomas
Distributed QR Factorization Based on Randomized Algorithms Hana Strakov´a1 , Wilfried N. Gansterer of Algorithms Hana.Strakova@univie.ac.at, Wilfried.Gansterer@univie.ac.at 2 Forschungszentrum Telekommunication Wien, Austria Thomas.Zemen@ftw.at Abstract. Most parallel algorithms for matrix computations assume
Minimum-Flip Supertrees: Complexity and Algorithms
Sanderson, Michael J.
Minimum-Flip Supertrees: Complexity and Algorithms Duhong Chen, Oliver Eulenstein, David Ferna that it is fixed-parameter tractable and give approximation algorithms for special cases. Index Terms assembled from all species in the study. Because the conventional algorithms to solve these problems
Algorithms and Theory of Computation Handbook, Second
Algorithms and Theory of Computation Handbook, Second Edition CRC PRESS Boca Raton Ann Arbor London Parameterized Algorithms 1 Rodney G. Downey and Catherine McCartin School of Mathematical and Computing Sciences.2 The Main Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Practical FPT Algorithms
Finding Algorithms in Scientific Articles Sumit Bhatia
Giles, C. Lee
Finding Algorithms in Scientific Articles Sumit Bhatia , Prasenjit Mitra and C. Lee Giles,giles}@ist.psu.edu ABSTRACT Algorithms are an integral part of computer science literature. How- ever, none of the current search engines offer specialized algorithm search facility. We describe a vertical search engine
Algorithms in pure mathematics G. Stroth
Stroth, Gernot
Algorithms in pure mathematics G. Stroth 1 Introduction In this article, we will discuss algorithmic group theory from the point of view of pure, and where one might be surprised that there is no algorithmic solution. The two most developed areas
Study of Proposed Internet Congestion Control Algorithms*
Study of Proposed Internet Congestion Control Algorithms* Kevin L. Mills, NIST (joint work with D Y Algorithms Mills et al. Innovations in Measurement Science More information @ http;Study of Proposed Internet Congestion Control Algorithms Mills et al. OutlineOutline Technical
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close proximity in the phase space to each other. We show the performance of our algorithm in the case of magnetic shower.
Algorithmic proof of Barnette's Conjecture
I. Cahit
2009-04-22
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the operation of opening disjoint chambers, bu using spiral-chain like movement of the outer-cycle elastic-sticky edges of the cubic planar graph. In fact we have shown that in hamiltonicity of Barnette graph a single-chamber or double-chamber with a bridge face is enough to transform the problem into finding specific hamiltonian path in the cubic bipartite graph reduced. In the last part of the paper we have demonstrated that, if the given cubic planar graph is non-hamiltonian then the algorithm which constructs spiral-chain (or double-spiral chain) like chamber shows that except one vertex there exists (n-1)-vertex cycle.
Santhanam, Balu
LMS Algorithm: MotivationLMS Algorithm: Motivation Only a single realization of observations : delay in tap-weight adjustment. Simplicity: real-time applications possible. LMS AlgorithmLMS Algorithm Use instantaneous estimates for statistics: Filter output: Estimation error: Tap-weight update: LMS
On the relation between the MXL family of algorithms and Grobner basis algorithms
International Association for Cryptologic Research (IACR)
On the relation between the MXL family of algorithms and Gr¨obner basis algorithms Martin R Solving (PoSSo) problem. The most efficient known algorithms reduce the Gr¨obner basis computation", on which a new family of algorithms is based (MXL, MXL2 and MXL3). By studying and de- scribing
Improved algorithms for reaction path following: Higher-order implicit algorithms
Schlegel, H. Bernhard
Improved algorithms for reaction path following: Higher-order implicit algorithms Carlos Gonzaleza (Received 13May 1991;accepted17June 1991) Eight new algorithms for reaction path following are presented or if accurate propertiessuch ascurvature and frequenciesare needed.3*4 Numerous algorithms exist for following
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas2195
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas21958524
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield MunicipalTechnicalInformation4563 LLNL Small-scale Friction Sensitivityv b W r88fracturing
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2003 Annual Report.
Buettner, Edwin W.; Putnam, Scott A.
2009-02-18
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon O. nerka smolts during the 2003 spring out-migration at migrant traps on the Snake River and Salmon River. In 2003 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 2.1 times less in 2003 than in 2002. The wild Chinook catch was 1.1 times less than the previous year. Hatchery steelhead trout catch was 1.7 times less than in 2002. Wild steelhead trout catch was 2.1 times less than the previous year. The Snake River trap collected 579 age-0 Chinook salmon of unknown rearing. During 2003, the Snake River trap captured five hatchery and 13 wild/natural sockeye salmon and 36 coho salmon O. kisutch of unknown rearing. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant differences in catch between 2003 and the previous year were due mainly to low flows during much of the trapping season and then very high flows at the end of the season, which terminated the trapping season 12 days earlier than in 2002. Trap operations began on March 9 and were terminated on May 27. The trap was out of operation for a total of zero days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 16.8% less and wild Chinook salmon catch was 1.7 times greater than in 2002. The hatchery steelhead trout collection in 2003 was 5.6% less than in 2002. Wild steelhead trout collection was 19.2% less than the previous year. Trap operations began on March 9 and were terminated on May 24 due to high flows. There were zero days when the trap was out of operation due to high flow or debris. The decrease in hatchery Chinook catch in 2003 was partially due to differences in flow between years because there was a 5.9% increase in hatchery production in the Salmon River drainage in 2003. The decrease in hatchery steelhead catch may be partially due to a 13% decrease in hatchery production in the Salmon River drainage in 2003. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2003 data detected a relation between migration rate and discharge for wild Chinook salmon but was unable to detect a relation for hatchery Chinook. The inability to detect a migration rate discharge relation for hatchery Chinook was probably caused by age 0 fall Chinook being mixed in with the age 1 Chinook. Age 0 fall Chinook migrate much slower than age 1 Chinook, which would confuse the ability to detect the migration rate discharge relation. For wild Chinook salmon there was a 1.4-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.7-fold and a 1.9-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2003 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for hatchery Chinook salmon, wild Chinook salmon and hatchery steelhead trout. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 14-fold for hatchery Chinook salmon, 8.3-fold for wild Chinook salmon and 2.4-fold for hatchery steelhead as discharge increased between 50 kcfs and
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23
We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the Hybrid R Algorithm, RHMC is reversible, admitting a Metropolis accept/reject step that eliminates the $\\mathcal{O}(\\delta t^2)$ errors inherent in the R Algorithm. We also employ several algorithmic speed-ups, including multiple time scales, the use of a more efficient numerical integrator, and Hasenbusch pre-conditioning of the fermion force.
Citrus Production in the Lower Rio Grande Valley of Texas.
Traub, Hamilton Paul; Friend, W. H. (William Heartsill)
1930-01-01
. TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR COLLEGE STATION, BRAZOS COUNTY, TEXAS - BULLETIN NO. 419 DIVISION OF HORTICULTURE Citrus Production in the Lower Rio Grande Valley of Texas AGRICULTURAL AND MECHANICAL COLLEGE OF TEXAS.... . Citrus fruit production in the Lower Rio Grande Valley, especially grapefruit, has increased at a rather rapid rate dur- ing the past few years. More than 5,000,000 citrus trees were set in orchard form in the Lower Rio Grande Valley up to July, 1929...
Distributed Approaches for Determination of Reconfiguration Algorithm Termination
Lai, Hong-jian
Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard
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...
Energy Department Announces $25 Million to Lower Cost of Concentrating...
Broader source: Energy.gov (indexed) [DOE]
clean and renewable energy, even at night, by storing the heat generated by the sun. "Investments to improve the efficiency and lower the costs of concentrating solar...
Optimization Online - Lower Bounds on Complexity of Lyapunov ...
Amir Ali Ahmadi
2015-04-14
Apr 14, 2015 ... Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems. Amir Ali Ahmadi(a_a_a ***at*** princeton.edu) Raphael ...
Project Reports for Lower Sioux Indian Community- 2010 Project
Office of Energy Efficiency and Renewable Energy (EERE)
Lower Sioux intends to continue its efforts to develop wind projects on its lands as a continuation of efforts begun roughly 20 years ago.
Lower Valley Energy- Residential Energy Efficiency Rebate Program
Broader source: Energy.gov [DOE]
Lower Valley Energy offers numerous rebates for residential customers who wish to increase the energy efficiency of eligible homes. Rebates are available for weatherization measures, water heaters,...
on the complexity of some hierarchical structured matrix algorithms
2012-05-17
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
Study of lower hybrid wave propagation in ionized gas by Hamiltonian theory
Casolari, A.; Cardinali, A.
2014-02-12
In order to find an approximate solution to the Vlasov-Maxwell equation system describing the lower hybrid wave propagation in magnetic confined plasmas, the use of the WKB method leads to the ray tracing equations. The Hamiltonian character of the ray tracing equations is investigated analytically and numerically in order to deduce the physical properties of the wave propagating without absorption in the confined plasma. The consequences of the Hamiltonian character of the equations on the travelling wave, in particular, on the evolution of the parallel wavenumber along the propagation path have been accounted and the chaotic diffusion of the timeaveraged parallel wave-number towards higher values has been evaluated. Numerical analysis by means of a Runge-Kutta based algorithm implemented in a ray tracing code supplies the analytical considerations. A numerical tool based on the symplectic integration of the ray trajectories has been developed.
Yao, Jinping; Jia, Xinyan; Hao, Xiaolei; Zeng, Bin; Jing, Chenrui; Chu, Wei; Ni, Jielei; Zhang, Haisu; Xie, Hongqiang; Zhang, Chaojin; Zhao, Zengxiu; Chen, Jing; Liu, Xiaojun; Cheng, Ya; Xu, Zhizhan
2013-01-01
We show that fluorescence emission induced by strong field tunnel ionization of carbon dioxide from its lower-lying orbitals exhibits a peculiar molecular alignment dependence. The experimentally measured alignment-dependence of the fluorescence agrees with the alignment-dependence of the ionization probability calculated in the framework of the strong field approximation. Our results demonstrate the feasibility of an all-optical approach for shedding more light on the ionization mechanisms of molecules from their lower-lying orbitals in tunnel ionization regime.
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
.F. Kalama Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind by recovery and subbasin planning. Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
.F. Kalama Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind by recovery and subbasin planning Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Lower Columbia Salmon Recovery Fish & Wildlife Subbasin Plan
Subbasin II.G. Lewis Subbasin II.H. Lower Columbia Tributaries II.I. Washougal Subbasin II.J. Wind Subbasin by recovery and subbasin planning. Appdx. D Economic Framework Potential costs and economic considerations;Lower Columbia Recovery Plan Steering Committee Mark Bagdovitz, US Fish and Wildlife Service John
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Radziszowski, Stanislaw P.
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers Xu Xiaodong and Xie Zheng bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for Rk(4) and Rk(5) for some small
More Constructive Lower Bounds on Classical Ramsey Numbers
Radziszowski, Stanislaw P.
More Constructive Lower Bounds on Classical Ramsey Numbers Xiaodong Xu Guangxi Academy of Sciences Abstract. We present several new constructive lower bounds for classical Ramsey numbers. In particular that for all integers k, l, with k 5 and l 3, the connectivity of any Ramsey-critical (k, l
NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN
Waste Management Zone" (AMZ) as defined in the "Agricultural Inventory of the Lower Fraser Valley Data the data base (acquired from the B.C. Assessment Authority in 1993) in the Ministry of Health report#12;NITROGEN LOADINGS FROM SEPTIC SYSTEMS IN THE LOWER FRASER BASIN DOE FRAP 1997-25 Prepared for
Biomechanical Considerations in the Design of Lower Limb Exoskeletons
Haller, Gary L.
Biomechanical Considerations in the Design of Lower Limb Exoskeletons Massimo Cenciarini and Aaron of the human biomechanical considerations related to the development of lower limb exoskeletons. Factors biomechanical considerations. The exoskeletons we consider in this review are those that act in parallel
First satellite observations of lower tropospheric ammonia and methanol
First satellite observations of lower tropospheric ammonia and methanol Reinhard Beer,1 Mark W) and methanol (CH3OH), well above the normal background levels. This is the first time that these molecules have. Citation: Beer, R., et al. (2008), First satellite observations of lower tropospheric ammonia and methanol
Paleoecology and paleontology of the Lower Cretaceous Kiowa Formation, Kansas
Scott, R. W.
1970-01-15
OF KANSAS PALEONTOLOGICAL CONTRIBUTIONS ARTICLE 52 (CRETACEOUS 1) PALEOECOLOGY AND PALEONTOLOGY OF THE LOWER CRETACEOUS KIOWA FORMATION, KANSAS ROBERT W. SCOTT Department of Geology, University of Kansas, Lawrence Present address: Waynesburg College... PALEOECOLOGY AND PALEONTOLOGY OF THE LOWER CRETACEOUS KIOWA FORMATION, KANSAS ROBERT W. SCOTT Department of Geology, University of Kansas, Lawrence Present address: Waynesburg College, Waynesburg, Pennsylvania CONTENTS PAGE ABSTRACT 5 Interspecific...
MAX-PLANCK-INSTITUT.. ( Lower Bounds for Set Intersection
. Mehlhorn R. Raman C. Uhrig MPI- I-92-127 October 1992 o mPD_ _ _ _ _ _ _ IN F 0 R M AT I K _ _ _ _ __ Im Stadtwald 66123 Saarbrücken Germany #12;Lower Bounds for Set Intersection Queries P. Dietz K. Mehlhorn R. Raman C. Uhrig MPI-I-92-127 October 1992 #12;Lower Bounds for Set Intersection Queries PAUL DIETZ KURT
Hero, Alfred O.
Background Basic methods Model-based algorithms Model-free algorithms RTI Perspectives Conclusions 23, 2015 1 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI Coates (McGill) 2 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17
The model of laminated wave turbulence puts forth a novel computational problem - construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order $10^{12}$ and more. The equations to be solved in integers are resonant conditions for nonlinearly interacting waves and their form is defined by the wave dispersion. It is established that for the most common dispersion as an arbitrary function of a wave-vector length two different generic algorithms are necessary: (1) one-class-case algorithm for waves interacting through scales, and (2) two-class-case algorithm for waves interacting through phases. In our previous paper we described the one-class-case generic algorithm and in our present paper we present the two-class-case generic algorithm.
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19
Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.
Theoretical Analysis and Efficient Algorithms for Crowdsourcing
Li, Hongwei
2015-01-01
algorithm to solve it efficiently. Empirical results on bothto solve problems efficiently by online game players. Foralgorithm is proposed to efficiently infer the true labels
Design and Analysis of Algorithms Course Page
Design and Analysis of Algorithms. TTR 3:05- 4:25, IC 109. OFFICE HOURS: Wed 11-12 or by appointment (Rm: Skiles, 116).
Parallel GPU Algorithms for Mechanical CAD
Krishnamurthy, Adarsh
2010-01-01
of California, Berkeley, Mechanical Engineering Department,GPU Algorithms for Mechanical CAD by Adarsh Krishnamurthy Aof Philosophy in Engineering - Mechanical Engineering in the
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
High-Performance Engineering Optimization: Applications, Algorithms...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
High-Performance Engineering Optimization: Applications, Algorithms, and Adoption Event Sponsor: Mathematics and Computer Science Division Start Date: Aug 19 2015 - 10:30am...
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-11-08
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
LO, NLO, LO* and jet algorithms
J. Huston
2010-01-14
The impact of NLO corrections, and in particular, the role of jet algorithms, is examined for a variety of processes at the Tevatron and LHC.
A Mobile Motion Analysis System Using Intertial Sensors for Analysis of Lower Limb Prosthetics
Mueller, John Kyle P [ORNL] [ORNL; Ericson, Milton Nance [ORNL] [ORNL; Farquhar, Ethan [ORNL] [ORNL; Lind, Randall F [ORNL] [ORNL; Evans III, Boyd Mccutchen [ORNL] [ORNL
2011-01-01
Soldiers returning from the global war on terror requiring lower leg prosthetics generally have different concerns and requirements than the typical lower leg amputee. These subjects are usually young, wish to remain active and often desire to return to active military duty. As such, they demand higher performance from their prosthetics, but are at risk for chronic injury and joint conditions in their unaffected limb. Motion analysis is a valuable tool in assessing the performance of new and existing prosthetic technologies as well as the methods in fitting these devices to both maximize performance and minimize risk of injury for the individual soldier. We are developing a mobile, low-cost motion analysis system using inertial measurement units (IMUs) and two custom force sensors that detect ground reaction forces and moments on both the unaffected limb and prosthesis. IMUs were tested on a robot programmed to simulate human gait motion. An algorithm which uses a kinematic model of the robot and an extended Kalman filter (EKF) was used to convert the rates and accelerations from the gyro and accelerometer into joint angles. Compared to encoder data from the robot, which was considered the ground truth in this experiment, the inertial measurement system had a RMSE of <1.0 degree. Collecting kinematic and kinetic data without the restrictions and expense of a motion analysis lab could help researchers, designers and prosthetists advance prosthesis technology and customize devices for individuals. Ultimately, these improvements will result in better prosthetic performance for the military population.
Lower bounds for the earliness-tardiness scheduling problem on ...
2004-10-27
and show that the gap between upper and lower bounds is about 1%. ..... n jobs and the supply of source i is at most pi. There are T sinks with a demand.
Flow Of Mantle Fluids Through The Ductile Lower Crust- Helium...
Flow Of Mantle Fluids Through The Ductile Lower Crust- Helium Isotope Trends Jump to: navigation, search OpenEI Reference LibraryAdd to library Journal Article: Flow Of Mantle...
Particle simulation of lower hybrid waves in tokamak plasmas
Bao, J; Kuley, A; Wang, Z X; Lu, Z X
2014-01-01
Global particle simulations of the lower hybrid waves have been carried out using fully kinetic ions and drift kinetic electrons with a realistic electron-to-ion mass ratio. The lower hybrid wave frequency, mode structure, and electron Landau damping from the electrostatic simulations agree very well with the analytic theory. Linear simulation of the propagation of a lower hybrid wave-packet in the toroidal geometry shows that the wave propagates faster in the high field side than the low field side, in agreement with a ray tracing calculation. Electromagnetic benchmarks of lower hybrid wave dispersion relation are also carried out. Electromagnetic mode conversion are observed in toroidal geometry, slow waves are launched at the plasma boundary and converts to fast waves at the mode conversion layer, which is consistent with linear theory.
A new lower hybrid launcher built in collaboration with PPPL...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
for its approximate thermal expansion match to the alumina material used for the vacuum windows. Since plasma operation resumed in February, over 200 kW of lower hybrid power...
Sandia National Laboratories: Dirt-cheap catalyst may lower fuel...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Twitter YouTube Flickr RSS News Dirt-cheap catalyst may lower fuel costs for H2-powered cars By Neal Singer Photography By Randy Montoya Thursday, October 15, 2015 Dirt Cheap...
The coolability limits of a reactor pressure vessel lower head
Theofanous, T.G.; Syri, S. [Univ. of California, Santa Barbara, CA (United States)
1995-09-01
Configuration II of the ULPU experimental facility is described, and from a comprehensive set of experiments are provided. The facility affords full-scale simulations of the boiling crisis phenomenon on the hemispherical lower head of a reactor pressure vessel submerged in water, and heated internally. Whereas Configuration I experiments (published previously) established the lower limits of coolability under low submergence, pool-boiling conditions, with Configuration II we investigate coolability under conditions more appropriate to practical interest in severe accident management; that is, heat flux shapes (as functions of angular position) representative of a core melt contained by the lower head, full submergence of the reactor pressure vessel, and natural circulation. Critical heat fluxes as a function of the angular position on the lower head are reported and related the observed two-phase flow regimes.
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Print It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
SRS Recovery Act Completes Major Lower Three Runs Project Cleanup
Office of Environmental Management (EM)
Pope, "The EPA is pleased with the cleanup of hot spots of contaminated soil and sediment along Lower Three Runs. EPA worked closely with the Department of Energy, South...
Several new lower bounds for football pool systems
Litsyn, Simon
Several new lower bounds for football pool systems Uri Blass and Simon Litsyn TelAviv University a big deal of attention due to its equivalence to constructing systems for football pools. A survey
Lower limb response to modified ankle impedance in gait
Blackburn, Bonnie Lucille
2011-01-01
This project used an exoskeletal robot to increase and decrease the stiffness of the ankle joint during treadmill walking to measure the effect of ankle impedance on lower limb joint kinematics. By quantifying the effect ...
Big and Small Ideas: How to Lower Solar Financing Costs
Broader source: Energy.gov [DOE]
DOE hosted the "Big & Small Ideas: How to Lower Solar Financing Costs" breakout session during the SunShot Grand Challenge Summit and Technology Forum. This session explored a range of...
Pika Energy Develops Innovative Manufacturing Process and Lowers...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
CIP is to help U.S. manufacturers that produce distributed wind systems to lower the cost of energy from their turbines and increase their market competitiveness. By focusing on...
Fact #889: September 7, 2015 Average Diesel Price Lower than...
Broader source: Energy.gov (indexed) [DOE]
Average Diesel Price Lower than Gasoline for the First Time in Six Years fotw889web.xlsx More Documents & Publications Fact 859 February 9, 2015 Excess Supply is the Most Recent...
EV Community Readiness projects: New York City and Lower Hudson...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
EV Community Readiness projects: New York City and Lower Hudson Valley Clean Communities, Inc. (NY, MA, PA); NYSERDA (ME, NH, VT, MA, RI, CT, NY, NJ, PA, DE, MD, DC) EV Community...
Modeling Distributed Electricity Generation in the NEMS Buildings Models
Reports and Publications (EIA)
2011-01-01
This paper presents the modeling methodology, projected market penetration, and impact of distributed generation with respect to offsetting future electricity needs and carbon dioxide emissions in the residential and commercial buildings sector in the Annual Energy Outlook 2000 (AEO2000) reference case.
Frequency stabilization in nonlinear MEMS and NEMS oscillators
Lopez, Omar Daniel; Antonio, Dario
2014-09-16
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 QA:QAsource History ViewMayo, Maryland:NPI Ventures Ltd Jump to: navigation,Naples,Development and
NEMS Freight Transportation Module Improvement Study - Energy Information
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming963Residential2, 2014ProvedYear Jan Feb Mar AprCubic
Appendix C: Map of NEMS Electricity Market Module Regions
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)Decade Year-0ProvedDecade2,948 2,724 2,570Month PreviousDry4,645 8244420 U.S.
Energy Information Administration NEMS Macroeconomic Activity Module Documentation Report
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)DecadeYear Jan Feb Mar Apr May Jun2003 Detailed Tablesof1998 and 2002
Energy Information Administration NEMS Petroleum Market Model Documentation
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)DecadeYear Jan Feb Mar Apr May Jun2003 Detailed Tablesof1998 and 20027)
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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would likeUniverse (Journal Article)Forthcoming Upgrades toFreezing a Droplet to Stop-
Analysis and Representation of Miscellaneous Electric Loads in NEMS -
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet) Wyoming Dry NaturalPrices1 Table 1.10 CoolingNotesShaleOil andEnergy Information
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
Algorithmic cooling and scalable NMR quantum computers
Mor, Tal
Algorithmic cooling and scalable NMR quantum computers P. Oscar Boykin*, Tal MorÂ§ , Vwani cooling (via polarization heat bath)--a powerful method for obtaining a large number of highly polarized (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression
Energy Aware Algorithmic Engineering Swapnoneel Roy
Rudra,, Atri
Energy Aware Algorithmic Engineering Swapnoneel Roy School of Computing University of North Florida: akshat.verma@in.ibm.com Abstract--In this work, we argue that energy management should be a guiding are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number
Enhancing Smart Home Algorithms Using Temporal Relations
Cook, Diane J.
Enhancing Smart Home Algorithms Using Temporal Relations Vikramaditya R. JAKKULA1 and Diane J COOK School of Electrical Engineering and Computer Science Abstract. Smart homes offer a potential benefit improves the performance of these algorithms and thus enhances the ability of smart homes to monitor
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of number fields to an open conjecture from elementary number theory.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
Algorithmic Aspects of Proportional Symbol Sergio Cabello
Utrecht, Universiteit
Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello Herman Haverkort Marc van Kreveld-CS-2008-008 www.cs.uu.nl ISSN: 0924-3275 #12;Algorithmic Aspects of Proportional Symbol Maps Sergio@cs.uu.nl Abstract Proportional symbol maps visualize numerical data associated with point locations by plac- ing
Quadruped Gait Learning Using Cyclic Genetic Algorithms
Hickey, Timothy J.
and in particular, Genetic Algorithms, have previously been used to develop gaits for legged (primarily hexapod]. In a previous work Parker made use of cyclic genetic algorithms to develop walking gaits for a hexapod robot [5]. Each of the six legs of this hexapod robot could only move vertically and horizontally and the number
Stochastic Search for Signal Processing Algorithm Optimization
Stochastic Search for Signal Processing Algorithm Optimization Bryan Singer Manuela Veloso May address the complex task of signal processing optimization. We first introduce and discuss the complexities of this domain. In general, a single signal processing algorithm can be represented by a very
Communication and Computation in Distributed CSP Algorithms
Krishnamachari, Bhaskar
Communication and Computation in Distributed CSP Algorithms C`esar Fern`andez1 , Ram´on B´ejar1 in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment
Virtual Scanning Algorithm for Road Network Surveillance
Jeong, Jaehoon "Paul"
Virtual Scanning Algorithm for Road Network Surveillance Jaehoon Jeong, Student Member, IEEE, Yu Gu a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design roadways and 2) the road network maps are normally known. We guarantee the detection of moving targets
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15
We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.
Pole Placement Algorithms ROBERT MAHONY~ UWE
Moore, John Barratt
Pole Placement Algorithms ROBERT MAHONY~ UWE for Symmetric Realisations HELMKE$ JOHN MOORE a numerical algorithm for deter- mining optimal output feedback gains for the pole place- ment task is well defined even when an exact solution to the pole placement task does not exist. Thus, the proposed
Vaze, Rahul
2011-01-01
We consider the optimal online packet scheduling problem in a single-user energy harvesting wireless communication system, where energy is harvested from natural renewable sources, making future energy arrivals instants and amounts random in nature. The most general case of arbitrary energy arrivals is considered where neither the future energy arrival instants or amount, nor their distribution is known. The problem considered is to adaptively change the transmission rate according to the causal energy arrival information, such that the time by which all packets are delivered is minimized. We assume that all bits have arrived and are ready at the source before the transmission begins. For a minimization problem, the utility of an online algorithm is tested by finding its competitive ratio or competitiveness that is defined to be the maximum of the ratio of the gain of the online algorithm with the optimal offline algorithm over all input sequences. We derive a lower and upper bound on the competitive ratio of...
Investigation of Newton-Krylov algorithms for low Mach number compressible flow
McHugh, P.R.; Knoll, D.A.; Mousseau, V.A.; Hansen, G.A.
1995-10-01
Fully coupled Newton-Krylov algorithms are used to solve steady speed compressible flow past a backward facing step flow Mach and Reynolds numbers. Various preconditioned Krylov iterative methods are used to solve the linear systems that arise on each Newton step, specifically Lanczos-based and Arnoldi-based algorithms. Several preconditioning strategies are considered to improve the performance of these iterative techniques, including incomplete lower-upper factorization with various levels of fill-in [ILU(k)] and domain based additive and multiplicative Schwarz type preconditioning both with and without overlapping domains. The ILU(K) preconditioners were generally less reliable for lower values of the flow Mach number, and exhibited strong sensitivity to cell ordering. In addition, the parallel nature of the domain based preconditioners is exploited on both a shared memory computer and a distributed system of workstations. Important aspects of the numerical solutions are discussed.
Discrimination of Unitary Transformations and Quantum Algorithms
David Collins
2008-11-09
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the sequence with others remaining fixed. For oracle query algorithms, the input determines the oracle unitary transformation. Such algorithms can be regarded as devices for discriminating amongst a set of unitary transformations. The question arises: "Given a set of known oracle unitary transformations, to what extent is it possible to discriminate amongst them?" We investigate this for the Deutsch-Jozsa problem. The task of discriminating amongst the admissible oracle unitary transformations results in an exhaustive collection of algorithms which can solve the problem with certainty.
2003 Special issue Statistical efficiency of adaptive algorithms
Widrow, Bernard
2003 Special issue Statistical efficiency of adaptive algorithms Bernard Widrow*, Max Kamenetsky Serra Mall, Stanford, CA 94305, USA Abstract The statistical efficiency of a learning algorithm applied gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS
EM Algorithms from a Non-Stochastic Perspective Charles Byrne
Byrne, Charles
EM Algorithms from a Non-Stochastic Perspective Charles Byrne Charles Byrne@uml.edu Department The EM algorithm is not a single algorithm, but a template for the con- struction of iterative algorithms a method for estimat- ing parameters in statistics, the essence of the EM algorithm is not stochastic
A Visualization System for Correctness Proofs of Graph Algorithms
Metaxas, Takis
A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm
Sketching, streaming, and sub-linear space algorithms
Reif, Rafael
Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) #12 algorithms are approximate · We assume worst-case input stream Adversaries do exist General algorithms Modular composition · Randomized algorithms OK (often necessary) Randomness in the algorithm
QRlike Algorithms---An Overview of Convergence Theory and Practice
QRÂlike Algorithms--- An Overview of Convergence Theory and Practice David S. Watkins Abstract. The family of GR algorithms is discussed. This includes the stanÂ dard and multishift QR and LR algorithms, the Hamiltonian QR algorithm, divideÂandÂconquer algorithms such as the matrix sign function method, and many
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
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15
Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.
SCDAP/RELAP5 Lower Core Plate Model
Coryell, Eric Wesley; Griffin, F. P.
1999-10-01
The SCDAP/RELAP5 computer code is a best-estimate analysis tool for performing nuclear reactor severe accident simulations. This report describes the justification, theory, implementation, and testing of a new modeling capability which will refine the analysis of the movement of molten material from the core region to the vessel lower head. As molten material moves from the core region through the core support structures it may encounter conditions which will cause it to freeze in the region of the lower core plate, delaying its arrival to the vessel head. The timing of this arrival is significant to reactor safety, because during the time span for material relocation to the lower head, the core may be experiencing steam-limited oxidation. The time at which hot material arrives in a coolant-filled lower vessel head, thereby significantly increasing the steam flow rate through the core region, becomes significant to the progression and timing of a severe accident. This report is a revision of a report INEEL/EXT-00707, entitled "Preliminary Design Report for SCDAP/RELAP5 Lower Core Plate Model".
SCDAP/RELAP5 lower core plate model
Coryell, E.W.; Griffin, F.P.
1999-09-01
The SCDAP/RELAP5 computer code is a best-estimate analysis tool for performing nuclear reactor severe accident simulations. This report describes the justification, theory, implementation, and testing of a new modeling capability which will refine the analysis of the movement of molten material from the core region to the vessel lower head. As molten material moves from the core region through the core support structures it may encounter conditions which will cause it to freeze in the region of the lower core plate, delaying its arrival to the vessel head. The timing of this arrival is significant to reactor safety, because during the time span for material relocation to the lower head, the core may be experiencing steam-limited oxidation. The time at which hot material arrives in a coolant-filled lower vessel head, thereby significantly increasing the steam flow rate through the core region, becomes significant to the progression and timing of a severe accident. This report is a revision of a report INEEL/EXT-00707, entitled ``Preliminary Design Report for SCDAP/RELAP5 Lower Core Plate Model''.
Advanced algorithms for information science
Argo, P.; Brislawn, C.; Fitzgerald, T.J.; Kelley, B.; Kim, W.H.; Mazieres, B.; Roeder, H.; Strottman, D.
1998-12-31
This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). In a modern information-controlled society the importance of fast computational algorithms facilitating data compression and image analysis cannot be overemphasized. Feature extraction and pattern recognition are key to many LANL projects and the same types of dimensionality reduction and compression used in source coding are also applicable to image understanding. The authors have begun developing wavelet coding which decomposes data into different length-scale and frequency bands. New transform-based source-coding techniques offer potential for achieving better, combined source-channel coding performance by using joint-optimization techniques. They initiated work on a system that compresses the video stream in real time, and which also takes the additional step of analyzing the video stream concurrently. By using object-based compression schemes (where an object is an identifiable feature of the video signal, repeatable in time or space), they believe that the analysis is directly related to the efficiency of the compression.
An improved spectral graph partitioning algorithm for mapping parallel computations
Hendrickson, B.; Leland, R.
1992-09-01
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.
Geometric lower bound for a quantum coherence measure
Diego Paiva Pires; Lucas C. Céleri; Diogo O. Soares-Pinto
2015-04-23
Nowadays, geometric tools are being used to treat a huge class of problems of quantum information science. By understanding the interplay between the geometry of the state space and information-theoretic quantities, it is possible to obtain less trivial and more robust physical constraints on quantum systems. In this sense, here we establish a geometric lower bound for the Wigner-Yanase skew information (WYSI), a well-known information theoretic quantity recently recognized as a proper quantum coherence measure. Starting from a mixed state evolving under unitary dynamics, while WYSI is a constant of motion, the lower bound indicates the rate of change of quantum statistical distinguishability between initial and final states. Our result shows that, since WYSI fits in the class of Petz metrics, this lower bound is the change rate of its respective geodesic distance on quantum state space. The geometric approach is advantageous because raises several physical interpretations of this inequality under the same theoretical umbrella.
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Vempala, Santosh
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a homogeneous linear inequality system Ax > 0. A natural condition measure associated with this algorithm is the Euclidean ...
Statistical algorithms in the study of mammalian DNA methylation
Singer, Meromit
2012-01-01
non-overlapping CCGIs: the algorithm 2.2.6 Running time andI Statistical algorithms in the study of mammalian DNAof the result of the CCGI algorithm. Nodes marked along the
Two Strategies to Speed up Connected Component Labeling Algorithms
Wu, Kesheng; Otoo, Ekow; Suzuki, Kenji
2008-01-01
but not linear set union algorithm,” J. ACM, vol. 22, no. 2,analysis of set union algorithms,” J. ACM, vol. 31, no. 2,An improved equivalence algorithm,” Commun. ACM, vol. 7, no.
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 ...
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions
Troina, Angelo
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions Roberto Barbuti, Andrea introduce a probabilistic algorithm for the simulation of chemical reactions, which can be used evolution of chemical reactive systems described by Gillespie. Moreover, we use our algorithm
Lower and upper probabilities in the distributive lattice of subsystems
A. Vourdas
2014-10-08
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m) is the projector to) obeys a supermodularity inequality, and it is interpreted as a lower probability in the sense of the Dempster-Shafer theory, and not as a Kolmogorov probability. It is shown that the basic concepts of the Dempster-Shafer theory (lower and upper probabilities and the Dempster multivaluedness) are pertinent to the quantum formalism of finite systems.
QCDLAB: Designing Lattice QCD Algorithms with MATLAB
Artan Borici
2006-10-09
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses the Schwinger model on the lattice, a great simplification, which shares many features and algorithms with lattice QCD. A typical computing project using QCDLAB is characterised by short codes, short run times, and the ability to make substantial changes in a few seconds. QCDLAB 1.0 can be downloaded from the QCDLAB project homepage {\\tt http://phys.fshn.edu.al/qcdlab.html}.
Recent Developments in Dual Lattice Algorithms
J. Wade Cherrington
2008-10-02
We review recent progress in numerical simulations with dually transformed SU(2) LGT, starting with a discussion of explicit dual amplitudes and algorithms for SU(2) pure Yang Mills in D=3 and D=4. In the D=3 case, we discuss results that validate the dual algorithm against conventional simulations. We also review how a local, exact dynamical fermion algorithm can naturally be incorporated into the dual framework. We conclude with an outlook for this technique and a look at some of the current challenges we've encountered with this method, specifically critical slowing down and the sign problem.
An Overview of LISA Data Analysis Algorithms
Edward K. Porter
2009-10-02
The development of search algorithms for gravitational wave sources in the LISA data stream is currently a very active area of research. It has become clear that not only does difficulty lie in searching for the individual sources, but in the case of galactic binaries, evaluating the fidelity of resolved sources also turns out to be a major challenge in itself. In this article we review the current status of developed algorithms for galactic binary, non-spinning supermassive black hole binary and extreme mass ratio inspiral sources. While covering the vast majority of algorithms, we will highlight those that represent the state of the art in terms of speed and accuracy.
Environmental Assessment of the Lower Cape Fear River System, 2009
Mallin, Michael
along Cape Fear Estuary Persistent blue-green Microcystis algal bloom in Cape Fear River, fall 2009 Microcystis blue-green bloom magnified 150X #12;Executive Summary Multiparameter water sampling for the Lower as blackwater systems because of their tea colored water. The Northeast Cape Fear River often seems to be more
Lower Oil Prices: A Reason to Give Thanks GENE EPSTEIN
California at Davis, University of
Lower Oil Prices: A Reason to Give Thanks By GENE EPSTEIN Nov. 29, 2014 1:31 a.m. ET I give thanks thanks for an oil price that fell below $70 a barrel Friday, mainly because it bodes well for general early this year ("Here Comes $75 Oil," March 31). Amy Jaffe, executive director of energy
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948-
POLLUTION IN THE LOWER COLUMBIA BASIN IN 1948- With particular reference to the Willamette River, intended to aid or direct management or utilization praotices and as gi.\\ides for administrative POLLUTION IN THE LOTOR COLIMRIA BASIN IN 1948 WITH PARTI CirW.R REFERENCE TO THE WTLLAJTETTE BASIN
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
Lower Bounds on Testing Membership to a Polyhedron by
Grigoriev, Dima
Email:imilar question was ope* *n for algebraic decision dima@cse.psu.edu. Supported in part by the Volkswagen and ECUS030, and by the Volkswagen-Stiftung.oEmail:btaining lower bounds f* *or the complexity of test
Surface OceanLower Atmosphere Processes Geophysical Research Series 187
Kohfeld, Karen
, British Columbia, Canada Andy Ridgwell Bristol Research Initiative for the Dynamic Global Environment251 Surface OceanLower Atmosphere Processes Geophysical Research Series 187 Copyright 2009, and processes have been identified that have improved our understanding of the modern and future carbon cycle
Suspended sediment sources and tributary effects in the lower
Yeager, Kevin M.
Suspended sediment sources and tributary effects in the lower reaches of a coastal plain stream Abstract Characterizing the dynamics of fluvial sediment sources over space and time is often critical in identifying human impacts on fluvial systems. Upland interfluve and subsoil sources of suspended sediment
Soft Wearable Motion Sensing Suit for Lower Limb Biomechanics Measurements*
Wood, Robert
Soft Wearable Motion Sensing Suit for Lower Limb Biomechanics Measurements* Yigit Meng¨uc¸1,2, Yong of human biomechanics as well as the entertainment industry. Although existing technologies motion data in order to understand the underlying biomechanics. Simulation tools such as Open- Sim [2
DOES DUAL SOURCING LOWER PROCUREMENT COSTS? Thomas P. Lyonw
Lyon, Thomas P.
DOES DUAL SOURCING LOWER PROCUREMENT COSTS?Ã Thomas P. Lyonw U.S. defense policy encourages the use of dual sourcing to reduce government procurement costs, but recent theoretical work raises doubts about procurement costs using a panel dataset of tactical missiles. I find dual sourcing is not driven by failures
Lower bounding procedure for the Asymmetric Quadratic Traveling ...
2015-02-04
a lower bound is to linearize the quadratic terms xijxjk for all (i, j),(j, k) ? A ..... Consider any cycle C. Since column Cp is the selected column to enter the basis we ..... some kind of subtour elimination constraint, we restrict the search to find a
Lower granite GIS data description and collection guidelines
Gordon, J.L.; Evans, B.J.; Perry, E.M.
1995-12-01
The Lower Granite Geographic Information System (GIS) was developed jointly by the US Army Corps of Engineers (USCOE) Walla Walla District and the Pacific Northwest Laboratory (PNL). The goal of the project is to use GIS technology to analyze impacts of the drawdown mitigation option on the physical and biological environment of the Lower Granite Reservoir. The drawdown mitigation option is based on the hypothesis that faster juvenile salmon travel to the ocean would result in higher juvenile survival and greater smolt-to-adult return ratios; to accomplish this, reservoir elevations would be lowered to increase channel velocities. Altering the elevation of the reservoirs on the Snake River is expected to have a variety of impacts to the Physical environment including changes to water velocity, temperature, dissolved gases, and turbidity. The GIS was developed to evaluate these changes and the resulting impacts on the anadromous and resident fish of the Snake River, as well as other aquatic organisms and terrestrial wildlife residing in the adjacent riparian areas. The Lower Granite GIS was developed using commercial hardware and software and is supported by a commercial relational database. Much of the initial system development involved collecting and incorporating data describing the river channel characteristics, hydrologic properties, and aquatic ecology. Potentially meaningful data for the Lower Granite GIS were identified and an extensive data search was performed. Data were obtained from scientists who are analyzing the habitats, limnology, and hydrology of the Snake River. The next six sections of this document describe the bathymetry, fish abundance, substrate, sediment chemistry, and channel hydrology data.
Benchmarking Derivative-Free Optimization Algorithms
2008-05-13
has encouraged a new wave of theory and algorithms. ... the solver that delivers the largest reduction within a given computational budget. ..... cost per iteration. ..... expensive optimization problems that arise in DOE's SciDAC initiative.
A modified convective/stratiform partitioning algorithm
Listemaa, Steven Alan
1998-01-01
by using different radar reflectivity-rail-ate relationships. Several authors have developed their own convective-stratiform partitioning, but each had its limitations. An algorithm has been developed which partitions precipitating systems...
Large scale prediction models and algorithms
Monsch, Matthieu (Matthieu Frederic)
2013-01-01
Over 90% of the data available across the world has been produced over the last two years, and the trend is increasing. It has therefore become paramount to develop algorithms which are able to scale to very high dimensions. ...
An algorithmic approach to social networks
Liben-Nowell, David
2005-01-01
Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze ...
A Saturation Algorithm for Homogeneous Binomial Ideals
Mehta, Shashank K
A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian at computation in smaller rings is by Kesh and Mehta [7] which also requires the computation of one Gr
Greedy Algorithms Slides by Kevin Wayne.
Kosecka, Jana
. telephone, electrical, hydraulic, TV cable, computer, road Approximation algorithms for NP-hard problems. At each step, add the cheapest edge e to T that has exactly one endpoint in T. Remark. All three
Quantum algorithms for hidden nonlinear structures
Andrew M. Childs; Leonard J. Schulman; Umesh V. Vazirani
2007-05-21
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an alternative generalization, namely to problems of finding hidden nonlinear structures over finite fields. We give examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer. We also give some positive results on the quantum query complexity of finding hidden nonlinear structures.
Quantum heuristic algorithm for traveling salesman problem
Jeongho Bang; Seokwon Yoo; James Lim; Junghee Ryu; Changhyoup Lee; Jinhyoung Lee
2012-11-06
We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search.
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-31
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-28
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.
Lowering critical cooling rate for forming bulk metallic glass
Shen, T.D.; Schwarz, R.B. [MS G755, MST-8, Materials Science and Technology Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States)
2006-02-27
Small volumes of Pd{sub 44}Ni{sub 10}Cu{sub 26}P{sub 20} and Pd{sub 43.2}Ni{sub 8.8}Cu{sub 28}P{sub 20} were encapsulated in B{sub 2}O{sub 3} and thermally cycled between T{sub g}-60 deg. C and T{sub l}+60 deg. C, where T{sub g} and T{sub l} denote the alloys' glass transition and liquidus temperatures. After this thermal treatment, the critical cooling rates (CCRs) for glass formation can be lowered by an order of magnitude, resulting in a critical cooling rate significantly lower than that reported for any other glass forming alloy melt. These experiments demonstrate that the CCR is not constant but strongly dependent on the degree of heterogeneous nucleation.
Oxygen enhanced switching to combustion of lower rank fuels
Kobayashi, Hisashi; Bool, III, Lawrence E.; Wu, Kuang Tsai
2004-03-02
A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum amount of energy per unit of time is enabled to combust fuel having a lower energy content, while still obtaining at least the stated minimum energy generation rate, by replacing a small amount of the combustion air fed to the furnace by oxygen. The replacement of oxygen for combustion air also provides reduction in the generation of NOx.
Chitinozoans in the subsurface Lower Paleozoic of West Texas
Kauffman, A. E.
1971-10-22
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 Bounds for Cover-Free Families Ali Z. Abdi
Bshouty, Nader
. Cover-free families were first introduced in 1964 by Kautz and Singleton [5]. Let N(n, (w, r)) denote the minimum number of points |X| in any (w, r)- CFF having |F| = n blocks. The best known lower bound for N(n, (w, r)) N(n - 1, (w - 1, r)) + N(n - 1, (w, r - 1)). (2) They then use it with (1) to prove two
Updated distribution and reintroduction of the Lower Keys marsh rabbit
Faulhaber, Craig Alan
2005-02-17
, for their advice and interest in the project. Kim Rohrs of the Monroe County Department of Planning and Environmental Resources provided valuable spatial and tabular data on land ownership and land-use planning in the Keys. My interns, Josh Harris, Kyle........................ 29 3.1 The number of individual Lower Keys marsh rabbits captured in 13 occupied populations on 4 keys from October 2001?August 2002. Data are arranged according to sex and age class...
Environmental audit, Bonneville Power Administration, lower Columbia area
Not Available
1990-11-01
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.
Lower Columbia River Terminal Fisheries Research Project : Final Environmental Assessment.
United States. Bonneville Power Administration.
1995-04-01
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.
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
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
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
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
Staging Dynamic Programming Algorithms Kedar Swadi Walid Taha Oleg Kiselyov
Taha, Walid
Applications of dynamic programming (DP) algorithms are numerous, and include g* *enetic engineering
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
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
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
Optimal scaling of the ADMM algorithm for distributed quadratic ...
2014-12-11
Dec 11, 2014 ... algorithm for a class of distributed quadratic programming problems. ..... Here, R(i
Electronic spin state of iron in lower mantle perovskite
Li, J.; Struzhkin, V.; Mao, H.-k.; Shu, J.; Hemley, R.; Fei, Y.; Mysen, B.; Dera, P.; Parapenka, V.; Shen, G.
2010-11-16
The electronic spin state of iron in lower mantle perovskite is one of the fundamental parameters that governs the physics and chemistry of the most voluminous and massive shell in the Earth. We present experimental evidence for spin-pairing transition in aluminum-bearing silicate perovskite (Mg,Fe)(Si,Al)O{sub 3} under the lower mantle pressures. Our results demonstrate that as pressure increases, iron in perovskite transforms gradually from the initial high-spin state toward the final low-spin state. At 100 GPa, both aluminum-free and aluminum-bearing samples exhibit a mixed spin state. The residual magnetic moment in the aluminum-bearing perovskite is significantly higher than that in its aluminum-free counterpart. The observed spin evolution with pressure can be explained by the presence of multiple iron species and the occurrence of partial spin-paring transitions in the perovskite. Pressure-induced spin-pairing transitions in the perovskite would have important bearing on the magnetic, thermoelastic, and transport properties of the lower mantle, and on the distribution of iron in the Earth's interior. The lower mantle constitutes more than half of the Earth's interior by volume (1), and it is believed to consist predominantly (80-100%) of (Mg,Fe)(Si,Al)O{sub 3} perovskite (hereafter called perovskite), with up to 20% (Mg,Fe)O ferropericlase (2). The electronic spin state of iron has direct influence on the physical properties and chemical behavior of its host phase. Hence, knowledge on the spin state of iron is important for the interpretation of seismic observations, geochemical modeling, and geodynamic simulation of the Earth's deep interior (3, 4). Crystal field theory (4, 5) and band theory (6) predicted that a high-spin to low-spin transition would occur as a result of compression. To date, no experimental data exist on the spin sate of iron in Al-bearing perovskite. To detect possible spinpairing transition of iron in perovskite under the lower mantle conditions, we measured the x-ray emission spectra of an Al-bearing perovskite sample to 100 GPa. For comparison, a parallel measurement was also carried out on an Al-free perovskite sample.
A New Algorithm for Multicommodity Flow
Dhananjay P. Mehendale
2010-01-13
We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one source/sink pair among the n distinguished source/sink pairs at a time and treat the given multicommodity network as a single commodity network for such chosen source/sink pair. Then applying standard labeling algorithm, separately for each sink/source pair, the feasible flow which is max flow and the corresponding minimum cut corresponding to each source/sink pair is obtained. A record is made of these cuts and the paths flowing through the edges of these cuts. This record is then utilized to develop our algorithm to obtain max flow for multicommodity flow. In this paper we have pinpointed the difficulty behind not getting a max flow min cut type theorem for multicommodity flow and found out a remedy.
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
Möller, Torsten
ABSTRACT Splatting is a popular direct volume rendering algorithm. However, the algorithm does-casting algorithms, existing splatting algorithms do not have an equivalent mechanism for avoiding these artifacts. In this paper we propose such a mechanism, which delivers high-quality splatted images and has the potential
Axiomatic Tools versus Constructive approach to Unconventional Algorithms
Gordana Dodig-Crnkovic; Mark Burgin
2012-07-03
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.
D0 Silicon Upgrade: Lower Cleanroom Roof Quick Load Analysis
Rucinski, Russ; /Fermilab
1995-11-17
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.
Nonlinear lower hybrid oscillations in a cold viscous plasma
Maity, Chandan; Chakrabarti, Nikhil
2011-12-15
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.
Citrus Varieties for the Lower Rio Grande Valley.
Wood, J. F. (John Fielding); Friend, W. H. (William Heartsill)
1941-01-01
TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR, College Station, Texas CITRUS VARIETIES FOR THE LOWER RIO GRANDE VALLEY Mr. H. FRIEND AND J. F. WOOD Division of Horticulture LIBRARY \\gxict~!baa! % khhani~al Callep oof TsM~: Co.... Limes and lemons may be grown by persons who are financially able to equip their orchards with heaters. There are many types of citrus fruits that may be grown as ornamentals or for special purposes, but none of these are of com- mercial importance...
Floodplain River Foodwebs in the Lower Mekong Basin
Ou, Chouly
2013-11-15
Asia: China (Tibet), Myanmar, Laos, Thailand, Cambodia and Vietnam (the Mekong delta). The Mekong River Basin is divided into two main sections: the Upper Mekong, which spans from Jifu Mountains of Tibet Autonomous prefecture of China to the border... of Burma and Laos, and the Lower Mekong, which covers the area from the Burma-Laos border to the Mekong Delta in Vietnam. The Mekong River plays a crucial role in the economy of many of these countries. China benefits from the river primarily through...
Scaling of lower hybrid current drive with temperature
Harvey, R.W. ); McCoy, M.G. ); Ram, A.K.; Bers, A. ); Fuchs, V. )
1992-06-01
The 3-D Fokker-Planck/quasilinear code (CQL3D) is used to study the temperature scaling of lower hybrid current drive (LHCD) in the JET and JT-60 experiments. An offset-linear increase of current drive efficiency is obtained as a function of volume average temperature {l angle}T{sub e}{r angle} up to {approximately} 2.5, and reduced rate of efficiency increase is found at higher temperatures. The LHCD results indicate some fast wave/LH current drive synergy in the JET LH/FW experiments; however, code results discussed here show that synergy is not due to TTMP damping of the fast wave.
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:Financing Tool Fits the BillDepartmentSites | DepartmentLowering On-Road Fuel Use: A Component
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: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach HomeA Better Anode Design to Improve4AJ01)govCampaignsFIRE-Arctic-govCampaignsLower Atmospheric Boundary
Lower Valley Energy Inc (Wyoming) | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX E LISTStar2-0057-EAInvervarLeeds,Asia-Pacific DevelopingLower Valley Energy Inc Place:
Lower Ray River Geothermal Area | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsource HistoryScenarios Towards 2050 Jump to: navigation, search ToolWells andLower Ray
Lower Yellowstone R E A, Inc | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIXsource HistoryScenarios Towards 2050 Jump to: navigation, search ToolWells andLowerIncInc
Comments of the Lower Colorado River Authority | Department of Energy
Broader source: Energy.gov (indexed) [DOE]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustmentsShirleyEnergyTher i n c i p aDepartment of EnergyofDepartment ofCrowSpaceDepartment ofLower
Lower-Energy Energy Storage System (LEESS) Component Evaluation (Technical
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would likeUniverseIMPACTThousandReport) | SciTech Connect Lower-Energy Energy Storage System
Lowering Drilling Cost, Improving Operational Safety, and Reducing
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would likeUniverseIMPACTThousandReport) | SciTech Connect Lower-Energy Energy Storage
Particle Merging Algorithm for PIC Codes
Vranic, Marija; Martins, Joana L; Fonseca, Ricardo A; Silva, Luis O
2014-01-01
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...
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
Lower Flathead System Fisheries Study, 1986 Interim Report.
Bradshaw, William H.; DosSantos, Joseph M.; Darling, James M.
1986-08-01
We believe our results have clearly shown Kerr hydroelectric operations and operational constraints have negatively affected Flathead River trout and northern pike populations and the aquatic habitat which support them. Even so, it is possible to mitigate many of these impacts and develop a very important fishery. Trout abundance in the lower Flathead averaged only 19 fish per kilometer, the lowest abundance of trout for a river of this size in Montana. Little main channel spawning by trout was observed and most spawning probably occurs in tributaries. Lower river tributaries support resident populations of brook, rainbow, brown, and cutthroat trout; and a small resident population of bull trout is present in the South Fork of the Jocko River. Using weirs, spawning runs of rainbow and brown trout from the main river were monitored entering the Jocko River and the Post/Mission Creek system. Utilization of Crow Creek by main river trout stocks of trout was limited to the 6 km segment below Crow Dam. Evaluations of tributary spawning gravels showed high levels of silt which would suggest poor survival of trout eggs. Excessive harvest in the tributaries was indicated by analysis of age class structure and abundance of trout greater than 200 mm.
Lower-Temperature Subsurface Layout and Ventilation Concepts
Christine L. Linden; Edward G. Thomas
2001-06-20
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.
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-15
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.
Implementation of the Trigonometric LMS Algorithm using Original Cordic Rotation
Akhter, Nasrin; Fersouse, Lilatul; Khandaker, Faria
2010-01-01
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...
A background correction algorithm for Van Allen Probes MagEIS electron flux measurements
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Claudepierre, S. G.; O'Brien, T. P.; Blake, J. B.; Fennell, J. F.; Roeder, J. L.; Clemmons, J. H.; Looper, M. D.; Mazur, J. E.; Mulligan, T. M.; Spence, H. E.; et al
2015-07-14
We describe an automated computer algorithm designed to remove background contamination from the Van Allen Probes Magnetic Electron Ion Spectrometer (MagEIS) electron flux measurements. We provide a detailed description of the algorithm with illustrative examples from on-orbit data. We find two primary sources of background contamination in the MagEIS electron data: inner zone protons and bremsstrahlung X-rays generated by energetic electrons interacting with the spacecraft material. Bremsstrahlung X-rays primarily produce contamination in the lower energy MagEIS electron channels (~30–500 keV) and in regions of geospace where multi-M eV electrons are present. Inner zone protons produce contamination in all MagEIS energymore »channels at roughly L « less
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
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
August 1988 Computers, algorithms and mathematics
LovÃ¡sz, LÃ¡szlÃ³
August 1988 Computers, algorithms and mathematics LÂ´aszlÂ´o LovÂ´asz 0. Introduction The development that it has not left untouched closely related branches of science like mathematics and its education mathematics of higher value than classical, structure-oriented, theoremÂproof mathemat- ics, or does it just
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
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
Embodied Evolution: Distributing an Evolutionary Algorithm
Meeden, Lisa A.
The vision of embodied evolution described above is largely inspired by ex periments in Artificial Li, which makes it an interesting platform for future work in collective robotics and Artificial Life. We. Key words: Evolutionary Robotics, Artificial Life, Evolutionary Algorithms, Distributed Learning
Control algorithms for autonomous robot navigation
Jorgensen, C.C.
1985-09-20
This paper examines control algorithm requirements for autonomous robot navigation outside laboratory environments. Three aspects of navigation are considered: navigation control in explored terrain, environment interactions with robot sensors, and navigation control in unanticipated situations. Major navigation methods are presented and relevance of traditional human learning theory is discussed. A new navigation technique linking graph theory and incidental learning is introduced.
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
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
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
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
Acceleration of the Retinal Vascular Tracing Algorithm
Kepner, Jeremy
Acceleration of the Retinal Vascular Tracing Algorithm using FPGAs Direction Filter Design FPGA along with image processing results at frame rate with low latency Results MEMORY 2 Results MEMORY 3 Memory Switching Design #12;Retinal Vascular Tracing Application Goal: Detection and enhancement
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
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-01
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-01
WAMDII, the wide-angle Michelson Doppler imaging interferometer, was used to measure the neutral wind in the lower thermosphere by the Doppler shift of the O I 557-nm line. Observations were made at Saskatoon (60.5{degree} N invariant) around the spring equinox of 1985 with WAMDII coupled to an all-sky lens. With dopplergrams averaged over 3 to 30 min, no evidence was found for persistent highly localized winds on either of the two nights studied, one viewing only aurora and one viewing only airglow. The nocturnal variation was determined for both nights using average horizontal wind for the whole all-sky image. The pattern for the auroral case shows winds parallel to the aurora orientation in the evening but substantial crosswinds near midnight. High latitude general circulation models seem to represent this case better than local auroral generation models. The airglow case showed eastward winds in the morning sector.
Woody vegetation of the lower Navasota River watershed
Allen, Harriet Louise Gell
1974-01-01
in the lower Navasota River watershed. (M~Honey Mesquite, PO Post Oak, PO-8=Post Oak-Hickory, WE=Winged Elm, OC Overcup Oak, Ha-CE Hackberry-Cedar Elm, SP Swamp Privet, WaE Water Elm) 31 cs 10 Basal ares/ha g = Basal s es/slam Q = Deearly Yl 1 r. y... hover/slam 8 10 CII I Ss yl ?0 t 1 :c M PO PO-H WE CE OC HB-CE SP WBE 32 of small individual stem size (0. 04 m ). The Water Elm type had both 2 high density and large stem size (0. 4 m ) resulting in the highest 2 total basal area (44 m...
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-15
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.
Data-flow algorithms for parallel matrix computations
O'Leary, D.P.; Stewart, G.W.
1985-08-01
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.
Gupta, Satyandra K.
. Algorithms for generating multi-stage molding plans for articulated assemblies. Robotics and Computer-STAGE MOLDING PLANS FOR ARTICULATED ASSEMBLIES Alok K. Priyadarshi Satyandra K. Gupta August 31, 2007 Abstract Multi-stage molding is capable of producing better-quality articulated products at a lower cost. Dur
Motivation Problem Statement Algorithm Implementation Evaluation Wrap Up FIFO Service
Karsten, Martin
Motivation Problem Statement Algorithm Implementation Evaluation Wrap Up FIFO Service (currently on Sabbatical at University of Kaiserslautern) ANCS 2011 ANCS 2011 1/29 #12;Motivation Problem Statement Algorithm Implementation Evaluation Wrap Up Motivation residential access link Â concurrent flows
Optimum Algorithms for a Model of Direct Chaining
Vitter, Jeffrey Scott; Chen, Wen-Chin
1985-05-01
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 ...
Optimization of advanced telecommunication algorithms from power and performance perspective
Khan, Zahid
2011-11-22
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 ...
Dynamic and fault tolerant three-dimensional cellular genetic algorithms
Al Naqi, Asmaa
2012-11-29
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 ...
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
A fast butterfly algorithm for the hyperbolic Radon transform
Hu, Jingwei
2012-01-01
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 ...
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 ...
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
A New Algorithm for Learning Range Restricted Horn Expressions
Arias, Marta; Khardon, Roni
A learning algorithm for the class of range restricted Horn expressions is presented and proved correct. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some ...
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 ...
Design algorithms for parallel transmission in magnetic resonance imaging
Setsompop, Kawin
2008-01-01
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 ...
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
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 ...
Brain Derived Vision Algorithm on High Performance Architectures
2009-01-01
Granger, R. : Novel brain-derived algorithms scale linearly37:345–369 17. Brain derived vision on IBM CELL: http://10.1007/s10766-009-0106-9 Brain Derived Vision Algorithm on
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-01
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)
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 ...
Parallel Algorithms for Medical Informatics on Data-Parallel Many-Core Processors
Moazeni, Maryam
2013-01-01
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-01
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-01
2.2 FFT Algorithms . . . . . . . . . . . . . . . . . .2.2.1 Radix-2 FFT Algorithm . . . . . . . . .2.2.2 Radix-4 FFT Algorithm . . . . .
Efficient upper and lower bounds for global mixed-integer optimal ...
2013-11-07
operated in two discrete modes, leading either to acceleration and energy consump- .... For this procedure asymptotic bounds and very efficient algorithms.
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.
8 On Reconstruction Formulas and Algorithms for the
Kunyansky, Leonid
89 8 On Reconstruction Formulas and Algorithms for the Thermoacoustic Tomography Mark Agranovsky ........................................................................................................................................................................ 89 8.2 Thermoacoustic Tomography
Statistical Algorithms for High-throughput Biological Data /
Jeong, Kyowon
2013-01-01
Statistical Algorithms for High-throughput Biological Data by Kyowon Jeong Doctor of Philosophy in Electrical Engineering (Communication Theory
Modeling the model Characteristics and behavior of genetic algorithms
, and normalizes the fitness data for easier manipulation. A de- tailed pseudocode outline of the genetic algorithm
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
Quantum amplitude amplification algorithm: an explanation of availability bias
Riccardo Franco
2008-10-06
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.
Scaling Up Coordinate Descent Algorithms for Large ?1 Regularization Problems
Scherrer, Chad; Halappanavar, Mahantesh; Tewari, Ambuj; Haglin, David J.
2012-07-03
We present a generic framework for parallel coordinate descent (CD) algorithms that has as special cases the original sequential algorithms of Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm of Bradley et al. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.
Integrated network design and scheduling problems : optimization algorithms and applications.
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01
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.
Recovery Act: Electrochromic Glazing Technology: Improved Performance, Lower Price
Burdis, Mark; Sbar, Neil
2012-06-30
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
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
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
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
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
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
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
The Use of Genetic Algorithms in Multilayer Mirror Optimization
Hart, Gus
The Use of Genetic Algorithms in Multilayer Mirror Optimization Shannon Lunt R. S. Turley optimization. We have adapted the genetic algorithm to design optimal bifunctional mirrors for the IMAGE reflections from multilayers 1.2 A New Application of the GA Genetic algorithms have been used in optimization
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
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 sciences, utrecht university technical report UU-CS-2003-029 www.cs.uu.nl #12;On the Education of GIS-mail: marc@cs.uu.nl Abstract To teach the design of algorithms in an algorithmic GIS course, it is suggested
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
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
Using multiple alignments to improve seeded local alignment algorithms
Using multiple alignments to improve seeded local alignment algorithms Jason Flannick* and Serafim algorithms that index only a sequence. This suggests that when applied on a whole-genome scale, Typhon should provide improved homology searches in time comparable to existing algorithms. INTRODUCTION Sequence
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
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
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
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
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
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
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
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
"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
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
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
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
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 rotationally symmetric. SppS (CERN): need to separate beam jets from highp ones. First solution: cone jets" infrared safe return to UA1 cone algorithm. TorbjÂ¨orn SjÂ¨ostrand PPP 8: QCD jets and jet algorithms slide 2
Simple Denoising Algorithm Using Wavelet Transform
Manojit Roy; V. Ravi Kumar; B. D. Kulkarni; John Sanderson; Martin Rhodes; Michel vander Stappen
2000-02-18
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.
The Complex Gaussian Kernel LMS algorithm
Bouboulis, Pantelis
2010-01-01
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.
Fast computation algorithms for speckle pattern simulation
Nascov, Victor; Samoil?, Cornel; Ursu?iu, Doru [Transylvania University of Braov (Romania)
2013-11-13
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.
CAST: Contraction Algorithm for Symmetric Tensors
Rajbhandari, Samyam; NIkam, Akshay; Lai, Pai-Wei; Stock, Kevin; Krishnamoorthy, Sriram; Sadayappan, Ponnuswamy
2014-09-22
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.
Laminated Wave Turbulence: Generic Algorithms I
E. Kartashova; A. Kartashov
2006-09-07
The model of laminated wave turbulence presented recently unites both types of turbulent wave systems - statistical wave turbulence (introduced by Kolmogorov and brought to the present form by numerous works of Zakharov and his scientific school since nineteen sixties) and discrete wave turbulence (developed in the works of Kartashova in nineteen nineties). The main new feature described by this model is the following: discrete effects do appear not only in the long-wave part of the spectral domain (corresponding to small wave numbers) but all through the spectra thus putting forth a novel problem - construction of fast algorithms for computations in integers of order $10^{12}$ and more. In this paper we present a generic algorithm for polynomial dispersion functions and illustrate it by application to gravity and planetary waves.
Algorithms for Multiple Vehicle Routing Problems
Bae, Jung Yun
2014-06-02
require a collection of heterogeneous vehicles to visit a set of targets. This dissertation considers three fundamental rout- ing problems involving multiple vehicles that arise in these applications. The main objective of this dissertation is to develop... . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.2 Approximation algorithm for MDMTHPP . . . . . . . . . . . 8 2.1.3 Optimal constrained forest as a two matroid intersection problem 11 2.2 Single depot multiple terminal Hamiltonian path problems . . . . . . 14 2.2.1 Problem statement...
Decentralised network prediction and reconstruction algorithms
Yuan, Ye
2012-07-03
. . . . . . . . . . . . . . . . . 99 3.6 Algorithm to find a (Q,P) minimal realisation . . . . . . . . . . . . . . . . . 100 3.6.1 Discussion on assumptions . . . . . . . . . . . . . . . . . . . . . . . . . 104 3.6.2 Specific result... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 2.12 Small-world network. Average Dˆ+1 from 10000 runs (y-axis) for n = 100 versus the probability of rewiring, p (x-axis). Different curves correspond to different k. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 2...
Distributed Algorithms for Optimal Power Flow Problem
Lam, Albert Y S; Tse, David
2011-01-01
Optimal power flow (OPF) is an important problem for power generation and it is in general non-convex. With the employment of renewable energy, it will be desirable if OPF can be solved very efficiently so its solution can be used in real time. With some special network structure, e.g. trees, the problem has been shown to have a zero duality gap and the convex dual problem yields the optimal solution. In this paper, we propose a primal and a dual algorithm to coordinate the smaller subproblems decomposed from the convexified OPF. We can arrange the subproblems to be solved sequentially and cumulatively in a central node or solved in parallel in distributed nodes. We test the algorithms on IEEE radial distribution test feeders, some random tree-structured networks, and the IEEE transmission system benchmarks. Simulation results show that the computation time can be improved dramatically with our algorithms over the centralized approach of solving the problem without decomposition, especially in tree-structured...
Languages, Algorithms, Procedures, Calculi, and Metalogic
Mark Burgin
2007-01-04
Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized mathematical theories, metalogic studies theories in logic, or logics. The discipline of logic has been developed with the aim to model and study human thinking and reasoning. A more realistic understanding relates logic only to reasoning. Reasoning is a mental and verbal activity. Any activity is based on actions and operations organized by procedures and algorithms. That is why procedures and algorithms are basic for the development of different logics, their study and application. In this work, we study structures used in logic with the aim to reflect goals of logic as a discipline. The main structure is a logical calculus, which pivotal for the contemporary logic. Logical calculus is considered here as a two-tier construction with a logical language on the first level and the calculus itself on the second level. A system of interdependencies that exists between properties of deductive calculi and utilized by these calculi algorithms are explicated and studied. Here only syntactic parts of logics, namely, deductive logical calculi and corresponding languages are considered. Semantic and pragmatic parts are studied elsewhere.
Hitczenko, Pawel
2005 International Conference on Analysis of Algorithms DMTCS proc. AD, 2005, 115Â124 Cache miss analysis of WHT algorithms Mihai Furis1 and Pawel Hitczenko2 and Jeremy Johnson1 1 Dept. of Computer count in obtaining high-performance implementations of algorithms. In this work, the memory behavior
Jiang, Ming
according to their criteria and the ways for updating an intermediate image with observed data. Generally. As will be clear later, the criteria that led to these two algorithms, either explicitly or implicitly stated algorithms were designed based on the ART and EM algorithms. One remarkable advance is the order-subset (OS
A Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-06-24
Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.
Comparison of Pulsed Sinusoid Radio Frequency Interference Detection Algorithms Using Time and
Ruf, Christopher
Comparison of Pulsed Sinusoid Radio Frequency Interference Detection Algorithms Using Time of two major Radio Frequency Interference (RFI) detection algorithms is compared. The peak detection algorithm and the kurtosis detection algorithm are characterized using the receiver operating characteristic
Jackson, Daniel
2009-07-03
This paper presents a new general-purpose algorithm for exact solving of combinatorial many-objective optimization problems. We call this new algorithm the guided improvement algorithm. The algorithm is implemented on top ...
Werling, Brett William
2010-06-28
two important algorithms for decoding convo- lutional codes: the Viterbi algoritm and soft output Viterbi algorithm. 4.1 Viterbi Algorithm The most common method for decoding a convolutionally-encoded sequence is the Viterbi algorithm, which was first...
Properties and Application of Nondeterministic Quantum Query Algorithms
Alina Dubrovska Vasilieva
2006-11-07
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we demonstrate a gap of n vs. 2 between classical deterministic and dual nondeterministic quantum query complexity for a specific Boolean function.
Cooling algorithms based on the 3-bit majority
Phillip Kaye
2007-05-15
Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be practicable are those based on simple reversible polarization compression (RPC) operations acting locally on small numbers of bits. Several different algorithms using 2- and 3-bit RPC operations have appeared in the literature, and these are the algorithms I consider in this note. Specifically, I show that the RPC operation used in all these algorithms is essentially a majority vote of 3 bits, and prove the optimality of the best such algorithm. I go on to derive some theoretical bounds on the performance of these algorithms under some specific assumptions about errors.
An Adaptive Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-11-03
In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.
Helium isotopes: Lower geyser basin, Yellowstone National Park
Kennedy, B.M.; Reynolds, J.H.; Smith, S.P.; Truesdell, A.H.
1987-11-10
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.
Grant, C W; Lenderman, J S; Gansemer, J D
2011-02-24
This document is an update to the 'ADIS Algorithm Evaluation Project Plan' specified in the Statement of Work for the US-VISIT Identity Matching Algorithm Evaluation Program, as deliverable II.D.1. The original plan was delivered in August 2010. This document modifies the plan to reflect modified deliverables reflecting delays in obtaining a database refresh. This document describes the revised schedule of the program deliverables. The detailed description of the processes used, the statistical analysis processes and the results of the statistical analysis will be described fully in the program deliverables. The US-VISIT Identity Matching Algorithm Evaluation Program is work performed by Lawrence Livermore National Laboratory (LLNL) under IAA HSHQVT-07-X-00002 P00004 from the Department of Homeland Security (DHS).
A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components
Rossi, Ryan A; Gebremedhin, Assefaw H; Patwary, Md Mostofa Ali
2013-01-01
We propose a fast, parallel, maximum clique algorithm for large, sparse graphs that is designed to exploit characteristics of social and information networks. We observe roughly linear runtime scaling over graphs between 1000 vertices and 100M vertices. In a test with a 1.8 billion-edge social network, the algorithm finds the largest clique in about 20 minutes. For social networks, in particular, we found that using the core number of a vertex in combination with a good heuristic clique finder efficiently removes the vast majority of the search space. In addition, we parallelize the exploration of the search tree. In the algorithm, processes immediately communicate changes to upper and lower bounds on the size of maximum clique, which occasionally results in a super-linear speedup because vertices with especially large search spaces can be pruned by other processes. We use this clique finder to investigate the size of the largest temporal strong components in dynamic networks, which requires finding the large...
Odd orders in Shor's factoring algorithm
Thomas Lawson
2015-01-13
Shor's factoring algorithm (SFA) finds the prime factors of a number, $N=p_1 p_2$, exponentially faster than the best known classical algorithm. Responsible for the speed-up is a subroutine called the quantum order finding algorithm (QOFA) which calculates the order -- the smallest integer, $r$, satisfying $a^r \\mod N =1$, where $a$ is a randomly chosen integer coprime to $N$ (meaning their greatest common divisor is one, $\\gcd(a, N) =1$). Given $r$, and with probability not less than $1/2$, the factors are given by $p_1 = \\gcd (a^{\\frac{r}{2}} - 1, N)$ and $p_2 = \\gcd (a^{\\frac{r}{2}} + 1, N)$. For odd $r$ it is assumed the factors cannot be found (since $a^{\\frac{r}{2}}$ is not generally integer) and the QOFA is relaunched with a different value of $a$. But a recent paper [E. Martin-Lopez: Nat Photon {\\bf 6}, 773 (2012)] noted that the factors can sometimes be found from odd orders if the coprime is square. This raises the question of improving SFA's success probability by considering odd orders. We show that an improvement is possible, though it is small. We present two techniques for retrieving the order from apparently useless runs of the QOFA: not discarding odd orders; and looking out for new order finding relations in the case of failure. In terms of efficiency, using our techniques is equivalent to avoiding square coprimes and disregarding odd orders, which is simpler in practice. Even still, our techniques may be useful in the near future, while demonstrations are restricted to factoring small numbers. The most convincing demonstrations of the QOFA are those that return a non-power-of-two order, making odd orders that lead to the factors attractive to experimentalists.
Election algorithms in asynchronous mesh networks
Veeramacheneni, Ramu
1992-01-01
complexity in electing a single leader for an asynchronous square mesh network. Also, the other idea is to ensure no deadlocks. Peterson designed an election algorithm for asynchronous square meshes that uses about 100n messages in the worst case. When run... Claim 2. 3. 1 Claim 2. 3. 1-Case 2 30 31 Claim 2. 3. 1-Case 2. 2 32 10 Claim 2. 4. 1 Claim 2, 4. 1-Case 2 34 12 Lemma 3 36 13 14 Claim 4. 1 Claim 4. 2 Claim 4. 3. 1 37 38 39 Claim 4. 3, 1-Case 2. 2 40 17 Claim 4. 4. 1-Case 2 41 18 Claim...
A Monte Carlo algorithm for degenerate plasmas
Turrell, A.E. Sherlock, M.; Rose, S.J.
2013-09-15
A procedure for performing Monte Carlo calculations of plasmas with an arbitrary level of degeneracy is outlined. It has possible applications in inertial confinement fusion and astrophysics. Degenerate particles are initialised according to the Fermi–Dirac distribution function, and scattering is via a Pauli blocked binary collision approximation. The algorithm is tested against degenerate electron–ion equilibration, and the degenerate resistivity transport coefficient from unmagnetised first order transport theory. The code is applied to the cold fuel shell and alpha particle equilibration problem of inertial confinement fusion.
Hypergraph Ramsey Numbers and Adiabatic Quantum Algorithm
Ri Qu; Yan-ru Bao
2012-07-18
Gaitan and Clark [Phys. Rev. Lett. 108, 010501 (2012)] have recently presented a quantum algorithm for the computation of the Ramsey numbers R(m, n) using adiabatic quantum evolution. We consider that the two-color Ramsey numbers R(m, n; r) for r-uniform hypergraphs can be computed by using the similar ways in [Phys. Rev. Lett. 108, 010501 (2012)]. In this comment, we show how the computation of R(m, n; r) can be mapped to a combinatorial optimization problem whose solution be found using adiabatic quantum evolution.
Algorithms for Gene Clustering Analysis on Genomes
Yi, Gang Man
2012-07-16
CLUSTERING ANALYSIS ON GENOMES A Dissertation by GANG MAN YI Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment of the requirements for the degree of DOCTOR OF PHILOSOPHY May 2011 Major Subject: Computer Science... ALGORITHMS FOR GENE CLUSTERING ANALYSIS ON GENOMES A Dissertation by GANG MAN YI Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment of the requirements for the degree of DOCTOR OF PHILOSOPHY Approved by: Chair...
Algorithmic design of self-assembling structures
Henry Cohn; Abhinav Kumar
2009-06-18
We study inverse statistical mechanics: how can one design a potential function so as to produce a specified ground state? In this paper, we show that unexpectedly simple potential functions suffice for certain symmetrical configurations, and we apply techniques from coding and information theory to provide mathematical proof that the ground state has been achieved. These potential functions are required to be decreasing and convex, which rules out the use of potential wells. Furthermore, we give an algorithm for constructing a potential function with a desired ground state.
Algorithmic crystal chemistry: A cellular automata approach
Krivovichev, S. V.
2012-01-15
Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).
A Distributed Pool Architecture for Genetic Algorithms
Roy, Gautam
2011-02-22
stream_source_info ROY-THESIS.pdf.txt stream_content_type text/plain stream_size 70881 Content-Encoding ISO-8859-1 stream_name ROY-THESIS.pdf.txt Content-Type text/plain; charset=ISO-8859-1 A DISTRIBUTED POOL... ARCHITECTURE FOR GENETIC ALGORITHMS A Thesis by GAUTAM SAMARENDRA N ROY 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 December 2009 Major Subject: Computer...
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
Bower, Dan J.
increases by 510%, and vertical velocities by 1040% in the lower mantle. Advective heat transport is more to be determined. The continuous nature of the spin transition along a lower mantle geotherm [Sturhahn et al., 2005
Impact of Lower PM from Multimode Operation on Fuel Penalty from DPF Regeneration
Broader source: Energy.gov [DOE]
Low engine-out PM emissions from HECC result in lower pressure drop rise rates across the DPF, less frequent DPF regeneration, and lower de-soot fuel penalty
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...
Sims, III, Frank Wayne
2014-02-03
were gathered to create cross-sections and maps used to interpret geometries, sediment distribution, grain sizes, fauna, and internal stratigraphy of the lower Nacatoch. In the study area on the northwestern corner of Robertson County, Texas, the lower...
Cook, Billy Charles
1968-01-01
with the lower Unit being subdivided into an upper "sand and shale section" a middle "marine section", and a lower "massive sand section". The Mississippi Geological Society (1957) subdivided the subsurface Tuscaloosa Group into the Upper, Marine, and Lower...) described the Lower Tuscaloosa Formation of southern Mississippi as a unit of "rapidly alternating sands and shales of shallow marine origin, overlying a nearly unbroken sand sec- tion of still shallower marine or continental origin". Braunstein ai. so...
Temporal evolution of lower-hybrid waves in the of ponderomotivedensity fluctuations
Karney, Charles
of these results to the lower-hybrid heating experiment on Alcator-A. Nevertheless, there are indications
Laminated Wave Turbulence: Generic Algorithms III
Elena Kartashova; Alexey Kartashov
2007-01-11
Model of laminated wave turbulence allows to study statistical and discrete layers of turbulence in the frame of the same model. Statistical layer is described by Zakharov-Kolmogorov energy spectra in the case of irrational enough dispersion function. Discrete layer is covered by some system(s) of Diophantine equations while their form is determined by wave dispersion function. This presents a very special computational challenge - to solve Diophantine equations in many variables, usually 6 to 8, in high degrees, say 16, in integers of order $10^{16}$ and more. Generic algorithms for solving this problem in the case of {\\it irrational} dispersion function have been presented in our previous papers. In this paper we present a new generic algorithm for the case of {\\it rational} dispersion functions. Special importance of this case is due to the fact that in wave systems with rational dispersion the statistical layer does not exist and the general energy transport is governed by the discrete layer alone.
Algorithmic construction of static perfect fluid spheres
Damien Martin; Matt Visser
2004-03-31
Perfect fluid spheres, both Newtonian and relativistic, have attracted considerable attention as the first step in developing realistic stellar models (or models for fluid planets). Whereas there have been some early hints on how one might find general solutions to the perfect fluid constraint in the absence of a specific equation of state, explicit and fully general solutions of the perfect fluid constraint have only very recently been developed. In this article we present a version of Lake's algorithm [Phys. Rev. D 67 (2003) 104015; gr-qc/0209104] wherein: (1) we re-cast the algorithm in terms of variables with a clear physical meaning -- the average density and the locally measured acceleration due to gravity, (2) we present explicit and fully general formulae for the mass profile and pressure profile, and (3) we present an explicit closed-form expression for the central pressure. Furthermore we can then use the formalism to easily understand the pattern of inter-relationships among many of the previously known exact solutions, and generate several new exact solutions.
Nonextensive lattice gauge theories: algorithms and methods
Rafael B. Frigori
2014-04-26
High-energy phenomena presenting strong dynamical correlations, long-range interactions and microscopic memory effects are well described by nonextensive versions of the canonical Boltzmann-Gibbs statistical mechanics. After a brief theoretical review, we introduce a class of generalized heat-bath algorithms that enable Monte Carlo lattice simulations of gauge fields on the nonextensive statistical ensemble of Tsallis. The algorithmic performance is evaluated as a function of the Tsallis parameter q in equilibrium and nonequilibrium setups. Then, we revisit short-time dynamic techniques, which in contrast to usual simulations in equilibrium present negligible finite-size effects and no critical slowing down. As an application, we investigate the short-time critical behaviour of the nonextensive hot Yang-Mills theory at q- values obtained from heavy-ion collision experiments. Our results imply that, when the equivalence of statistical ensembles is obeyed, the long-standing universality arguments relating gauge theories and spin systems hold also for the nonextensive framework.
Effects of ozone cooling in the tropical lower stratosphere and upper troposphere
Effects of ozone cooling in the tropical lower stratosphere and upper troposphere Piers M. Forster lower stratosphere and upper troposphere and elucidate the key role of ozone changes in driving of tropical ozone decreases at 70 hPa and lower pressures can lead to significant cooling not only
A renormalization approach to lower-dimensional tori with Brjuno frequency vectors
# 1 , . . . ,# D . The hyper-surface p = 0, # = # = 0, contained in the level set H 0 = 0, is a lower-dimensionalA renormalization approach to lower-dimensional tori with Brjuno frequency vectors Hans Koch Ã? R m , in order to construct lower-dimensional invariant tori with Brjuno frequency vectors for near
2004July Lower Bounds for Adaptive Collect and Related Objects / Attiya, Fich and Kaplan
Attiya, Hagit
2004July Lower Bounds for Adaptive Collect and Related Objects / Attiya, Fich and Kaplan 1 Lower of Toronto Yaniv Kaplan, Technion 2004July Lower Bounds for Adaptive Collect and Related Objects / Attiya, Fich and Kaplan 2 p1 p2 p3 p4 p5 p6 p7 write read Asynchronous Shared-Memory Systems All registers
May 2004 Version Lower Snake Mainstem Subbasin Plan 102 May 28, 2004
May 2004 Version Lower Snake Mainstem Subbasin Plan 102 May 28, 2004 7. Management Plan As the core in positive or negative ways and will have social, political, and economic implications. #12;May 2004 Version Lower Snake Mainstem Subbasin Plan 103 May 28, 2004 Social, economic, and political factors in the Lower
A Mn Bipyrimidine Catalyst Predicted To Reduce CO2 at Lower Overpotential
Goddard III, William A.
solvation) of the free energies of reaction and activation, as well as reduction potentials for all), followed by dehydroxylation to 5a. Pathway b has a lower activation energy by 2.2 kcal mol-1 . Consequently to be lower by 0.25 V. This improvement is, however, achieved at the price of a lower TOFmax, and we predict
Tomescu, Alexandru MF
, lower Massanutten Sandstone, Virginia, USA ALEXANDRU M. F. TOMESCU, GAR W. ROTHWELL AND ROSMARIE in an Early Silurian (Llandovery) continental biota: Passage Creek, lower Massanutten Sandstone, Virginia, USA, in the lower Massanutten Sandstone (Virginia, USA). Filaments are predominantly multiseriate and consist
Efficient Algorithms for Computing Betti Numbers of Semi-algebraic ...
Saugata Basu
2005-11-25
Mayer-Vietoris Exact Sequence. 4. Projections. Descent Spectral Sequence. 5. Main Open Questions. Saugata Basu. Efficient Algorithms for Computing Betti ...
Development of an Outdoor Temperature-Based Control Algorithm...
Office of Scientific and Technical Information (OSTI)
Development of an Outdoor Temperature-Based Control Algorithm for Residential Mechanical Ventilation Control Citation Details In-Document Search Title: Development of an Outdoor...
An Improved Equilibrium-Kinetics Speciation Algorithm For Redox...
Speciation Algorithm For Redox Reactions In Variably Saturated Subsurface Flow Systems Jump to: navigation, search OpenEI Reference LibraryAdd to library Journal...