Optimization Online - Lower Bounds and Exact Algorithms for the ...
Dilson Pereira
2013-12-16T23:59:59.000Z
Dec 16, 2013 ... Lower Bounds and Exact Algorithms for the Quadratic Minimum Spanning Tree Problem. Dilson Pereira(dilsonlucas ***at*** gmail.com)
NEMS industrial module documentation report
Not Available
1994-01-01T23:59:59.000Z
The NEMS Industrial Demand Model is a dynamic accounting model, bringing together the disparate industries and uses of energy in those industries, and putting them together in an understandable and cohesive framework. The Industrial Model generates mid-term (up to the year 2010) forecasts of industrial sector energy demand as a component of the NEMS integrated forecasting system. From the NEMS system, the Industrial Model receives fuel prices, employment data, and the value of output of industrial activity. Based on the values of these variables, the Industrial Model passes back to the NEMS system estimates of consumption by fuel types.
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.
Transdichotomous algorithms without multiplication some upper and lower bounds
Brodnik, Andrej "Andy"
TransÂdichotomous algorithms without multiplication Â some upper and lower bounds Andrej Brodnik 1 that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication; 1g w of wÂbit bit strings (or numbers between 0 and 2 w \\Gamma 1). An increasingly popular
Obtaining Lower Bounds from the Progressive Hedging Algorithm ...
2014-01-21T23:59:59.000Z
Oct 11, 2013 ... Note that the non-anticipativity constraints (15) define a ..... Complicating constraints are incurred by generator ... Next, we consider the interaction between PHA lower bound quality and .... for assessing wind integration.
Integrated NEMS and optoelectronics for sensor applications.
Czaplewski, David A.; Serkland, Darwin Keith; Olsson, Roy H., III; Bogart, Gregory R. (Symphony Acoustics, Rio Rancho, NM); Krishnamoorthy, Uma; Warren, Mial E.; Carr, Dustin Wade (Symphony Acoustics, Rio Rancho, NM); Okandan, Murat; Peterson, Kenneth Allen
2008-01-01T23:59:59.000Z
This work utilized advanced engineering in several fields to find solutions to the challenges presented by the integration of MEMS/NEMS with optoelectronics to realize a compact sensor system, comprised of a microfabricated sensor, VCSEL, and photodiode. By utilizing microfabrication techniques in the realization of the MEMS/NEMS component, the VCSEL and the photodiode, the system would be small in size and require less power than a macro-sized component. The work focused on two technologies, accelerometers and microphones, leveraged from other LDRD programs. The first technology was the nano-g accelerometer using a nanophotonic motion detection system (67023). This accelerometer had measured sensitivity of approximately 10 nano-g. The Integrated NEMS and optoelectronics LDRD supported the nano-g accelerometer LDRD by providing advanced designs for the accelerometers, packaging, and a detection scheme to encapsulate the accelerometer, furthering the testing capabilities beyond bench-top tests. A fully packaged and tested die was never realized, but significant packaging issues were addressed and many resolved. The second technology supported by this work was the ultrasensitive directional microphone arrays for military operations in urban terrain and future combat systems (93518). This application utilized a diffraction-based sensing technique with different optical component placement and a different detection scheme from the nano-g accelerometer. The Integrated NEMS LDRD supported the microphone array LDRD by providing custom designs, VCSELs, and measurement techniques to accelerometers that were fabricated from the same operational principles as the microphones, but contain proof masses for acceleration transduction. These devices were packaged at the end of the work.
NEMS Buildings Sector Working Group Meeting
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data CenterFranconia,(Million Barrels) Crude Oil Reserves in Nonproducing Reservoirs Year2per ThousandWellhead+WellheadMr.NEMS Buildings
How to obtain the National Energy Modeling System (NEMS)
Reports and Publications (EIA)
2013-01-01T23:59:59.000Z
The National Energy Modeling System (NEMS) NEMS is used by the modelers at the U. S. Energy Information Administration (EIA) who understand its structure and programming. NEMS has only been used by a few organizations outside of the EIA, because most people that requested NEMS found out that it was too difficult or rigid to use. NEMS is not typically used for state-level analysis and is poorly suited for application to other countries. However, many do obtain the model simply to use the data in its input files or to examine the source code.
U.S. Regional Demand Forecasts Using NEMS and GIS
Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris
2005-07-01T23:59:59.000Z
The National Energy Modeling System (NEMS) is a multi-sector, integrated model of the U.S. energy system put out by the Department of Energy's Energy Information Administration. NEMS is used to produce the annual 20-year forecast of U.S. energy use aggregated to the nine-region census division level. The research objective was to disaggregate this regional energy forecast to the county level for select forecast years, for use in a more detailed and accurate regional analysis of energy usage across the U.S. The process of disaggregation using a geographic information system (GIS) was researched and a model was created utilizing available population forecasts and climate zone data. The model's primary purpose was to generate an energy demand forecast with greater spatial resolution than what is currently produced by NEMS, and to produce a flexible model that can be used repeatedly as an add-on to NEMS in which detailed analysis can be executed exogenously with results fed back into the NEMS data flow. The methods developed were then applied to the study data to obtain residential and commercial electricity demand forecasts. The model was subjected to comparative and statistical testing to assess predictive accuracy. Forecasts using this model were robust and accurate in slow-growing, temperate regions such as the Midwest and Mountain regions. Interestingly, however, the model performed with less accuracy in the Pacific and Northwest regions of the country where population growth was more active. In the future more refined methods will be necessary to improve the accuracy of these forecasts. The disaggregation method was written into a flexible tool within the ArcGIS environment which enables the user to output the results in five year intervals over the period 2000-2025. In addition, the outputs of this tool were used to develop a time-series simulation showing the temporal changes in electricity forecasts in terms of absolute, per capita, and density of demand.
Assessment and Suggestions to Improve the Commercial Building Module of EIA-NEMS
O'Neal, D. L.; Reddy, T. A.; Sucher, B.
1996-01-01T23:59:59.000Z
The National Energy Modeling System (NEMS) is a comprehensive, computer-based, energy-economy modeling system developed and maintained by the Department of Energy's Energy Information Administration (EIA). NEMS forecasts the national production...
Price Responsiveness in the AEO2003 NEMS Residential and Commercial Buildings Sector Models
Reports and Publications (EIA)
2003-01-01T23:59:59.000Z
This paper describes the demand responses to changes in energy prices in the Annual Energy Outlook 2003 versions of the Residential and Commercial Demand Modules of the National Energy Modeling System (NEMS). It updates a similar paper completed for the Annual Energy Outlook 1999 version of the NEMS.
Nathanael, Rhesa
2012-01-01T23:59:59.000Z
Technology 3.1 Introduction Nano-electro-mechanical (NEM)improvements, a scaled nano-relay technology with optimizedNano-Electro-Mechanical (NEM) Relay Devices and Technology
A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS
Osborn, Julie G.; Wood, Frances; Richey, Cooper; Sanders, Sandy; Short, Walter; Koomey, Jonathan
2001-01-01T23:59:59.000Z
Documentation Report: Wind Energy Submodule (WES). DOE/EIA-The Economic Value of Wind Energy at High Power SystemOF THE TREATMENT OF WIND ENERGY IN THE AEO99 VERSION OF NEMS
Baker, Chris I.
Recycling Guide: Reduce, Reuse, Recycle Recycling Information Â Call 301-496-7990 or visit the NEMS in COMMINGLED bin Rinse food/beverage containers before recycling No Pyrex or Styrofoam Printer and Copier Toner Cartridges in TONER CARTRIDGE bin Recycle packaging material in appropriate bin NIH charities
Comparison of Bottom-Up and Top-Down Forecasts: Vision Industry Energy Forecasts with ITEMS and NEMS
Roop, J. M.; Dahowski, R. T
Comparisons are made of energy forecasts using results from the Industrial module of the National Energy Modeling System (NEMS) and an industrial economic-engineering model called the Industrial Technology and Energy Modeling System (ITEMS), a model...
Tucker, Stephen J.
NEM modiÂ¢cation prevents high-aÂ¤nity ATP binding to the Â¢rst nucleotide binding fold, UK Received 7 July 1999; received in revised form 11 August 1999 Abstract Pancreatic LL-cell ATP WWM 8-azido- [KK-32 P]ATP or 8-azido-[QQ-32 P]ATP was inhibited by NEM with Ki of 1.8 WWM and 2.4 WWM
Appendix E: Other NEMS-MP results for the base case and scenarios.
Plotkin, S. E.; Singh, M. K.; Energy Systems
2009-12-03T23:59:59.000Z
The NEMS-MP model generates numerous results for each run of a scenario. (This model is the integrated National Energy Modeling System [NEMS] version used for the Multi-Path Transportation Futures Study [MP].) This appendix examines additional findings beyond the primary results reported in the Multi-Path Transportation Futures Study: Vehicle Characterization and Scenario Analyses (Reference 1). These additional results are provided in order to help further illuminate some of the primary results. Specifically discussed in this appendix are: (1) Energy use results for light vehicles (LVs), including details about the underlying total vehicle miles traveled (VMT), the average vehicle fuel economy, and the volumes of the different fuels used; (2) Resource fuels and their use in the production of ethanol, hydrogen (H{sub 2}), and electricity; (3) Ethanol use in the scenarios (i.e., the ethanol consumption in E85 vs. other blends, the percent of travel by flex fuel vehicles on E85, etc.); (4) Relative availability of E85 and H2 stations; (5) Fuel prices; (6) Vehicle prices; and (7) Consumer savings. These results are discussed as follows: (1) The three scenarios (Mixed, (P)HEV & Ethanol, and H2 Success) when assuming vehicle prices developed through literature review; (2) The three scenarios with vehicle prices that incorporate the achievement of the U.S. Department of Energy (DOE) program vehicle cost goals; (3) The three scenarios with 'literature review' vehicle prices, plus vehicle subsidies; and (4) The three scenarios with 'program goals' vehicle prices, plus vehicle subsidies. The four versions or cases of each scenario are referred to as: Literature Review No Subsidies, Program Goals No Subsidies, Literature Review with Subsidies, and Program Goals with Subsidies. Two additional points must be made here. First, none of the results presented for LVs in this section include Class 2B trucks. Results for this class are included occasionally in Reference 1. They represent a small, though noticeable, segment of the 'LV plus 2B' market (e.g., a little more than 3% of today's energy use in that market). We generally do not include them in this discussion, simply because it requires additional effort to combine the NEMS-MP results for them with the results for the other LVs. (Where there is an exception, we will indicate so.) Second, where reference is made to E85, the ethanol content is actually 74%. The Energy Information Administration (EIA) assumes that, to address cold-starting issues, the percent of ethanol in E85 will vary seasonally. The EIA uses an annual average ethanol content of 74% in its forecasts. That assumption is maintained in the NEMS-MP scenario runs.
Overview of NEMS-H2, Version 1.0 | Department of Energy
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 RankCombustion | Department ofT ib l L d F SSales LLCDieselEnergy Joining ActivitiesNEMS-H2, Version 1.0
Office of Environmental Management (EM)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of EnergyEnergyENERGY TAXBalanced Scorecard Federal2Energy Second QuarterRate principles must Include
Inexact and accelerated proximal point algorithms
Saverio Salzo
2011-08-10T23:59:59.000Z
Aug 10, 2011 ... Abstract: We present inexact accelerated proximal point algorithms for minimizing a proper lower semicon- tinuous and convex function.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces and InterfacesAdministration -Lowell L. Wood, 1981 The ErnestLower Hybrid
Grefenstette, J.J.
1994-12-31T23:59:59.000Z
Genetic algorithms solve problems by using principles inspired by natural population genetics: They maintain a population of knowledge structures that represent candidate solutions, and then let that population evolve over time through competition and controlled variation. GAs are being applied to a wide range of optimization and learning problems in many domains.
Lower Cost Carbon Fiber Precursors
Broader source: Energy.gov (indexed) [DOE]
production and conversion parameters must be optimized. Lower cost fiber enable CF composite applications. Approach: 1. Complete previous effort by scaling to the CF production...
Algorithm Development & Stepwise Refinement Algorithm Development
Murphy, John
? Daylight savings time? Another required property of an algorithm is that each step can actually be carried to have no solution; algorithm asserts that a sub- problem will be solved without specifying how; etc
2011-09-22T23:59:59.000Z
Sep 22, 2011 ... chine learning community, is a simple greedy algorithm for finding a solution ... perceptron algorithm finds a solution to (1) after at most 1 ?(A)2 ...
Lower Cost Carbon Fiber Precursors
Broader source: Energy.gov (indexed) [DOE]
1 Lower Cost Carbon Fiber Precursors P.I. Name: Dave Warren Presenter: Dr. Amit K. Naskar Oak Ridge National Laboratory 05162012 Project ID LM004 This presentation does not...
Statistical Parsing Inside Algorithm
Ageno, Alicia
Parsing Â· Review Â· Statistical Parsing Â· SCFG Â· Inside Algorithm Â· Outside Algorithm NLP statistical parsing 1 Â· Outside Algorithm Â· Viterbi Algorithm Â· Learning models Â· SCFG extensions Â· Other NLP statistical parsing 2 language and is often viewed as an important prerequisite for building
Converting online algorithms to local computation algorithms
Mansour, Yishay; Vardi, Shai; Xie, Ning
2012-01-01T23:59:59.000Z
We propose a general method for converting online algorithms to local computation algorithms by selecting a random permutation of the input, and simulating running the online algorithm. We bound the number of steps of the algorithm using a query tree, which models the dependencies between queries. We improve previous analyses of query trees on graphs of bounded degree, and extend the analysis to the cases where the degrees are distributed binomially, and to a special case of bipartite graphs. Using this method, we give a local computation algorithm for maximal matching in graphs of bounded degree, which runs in time and space O(log^3 n). We also show how to convert a large family of load balancing algorithms (related to balls and bins problems) to local computation algorithms. This gives several local load balancing algorithms which achieve the same approximation ratios as the online algorithms, but run in O(log n) time and space. Finally, we modify existing local computation algorithms for hypergraph 2-color...
Lower paleozoic of Baltic Area
Haselton, T.M.; Surlyk, F.
1988-01-01T23:59:59.000Z
The Baltic Sea offers a new and exciting petroleum play in northwestern Europe. The Kaliningrad province in the Soviet Union, which borders the Baltic Sea to the east, contains an estimated 3.5 billion bbl of recoverable oil from lower Paleozoic sandstones. To the south, in Poland, oil and gas fields are present along a trend that projects offshore into the Baltic. Two recent Petrobaltic wells in the southern Baltic have tested hydrocarbons from lower Paleozoic sandstone. Minor production comes from Ordovician reefs on the Swedish island of Gotland in the western Baltic. The Baltic synclise, which began subsiding in the late Precambrian, is a depression in the East European platform. Strate dip gently to the south where the Baltic Synclise terminates against a structurally complex border zone. Depth to the metamorphosed Precambrian basement is up to 4,000 m. Overlying basement is 200-300 m of upper Precambrian arkosic sandstone. The Lower Cambrian consists of shallow marine quartzites. During Middle and Late Camnbrian, restricted circulation resulted in anoxic conditions and the deposition of Alum shale. The Lower Ordovician consists of quartzites and shale. The Upper Ordovician includes sandstones and algal reefs. The Silurian contains marginal carbonates and shales. For the last 25 years, exploration in northwest Europe has concentrated on well-known Permian sandstone, Jurassic sandstone, and Cretaceous chalk plays. Extrapolation of trends known and exploited in eastern Europe could open an entirely new oil province in the lower Paleozoic in the Baltic.
Automatic toilet seat lowering apparatus
Guerty, Harold G. (Palm Beach Gardens, FL)
1994-09-06T23:59:59.000Z
A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat. A toilet seat lowering apparatus includes a housing defining an internal cavity for receiving water from the water supply line to the toilet holding tank. A descent delay assembly of the apparatus can include a stationary dam member and a rotating dam member for dividing the internal cavity into an inlet chamber and an outlet chamber and controlling the intake and evacuation of water in a delayed fashion. A descent initiator is activated when the internal cavity is filled with pressurized water and automatically begins the lowering of the toilet seat from its upright position, which lowering is also controlled by the descent delay assembly. In an alternative embodiment, the descent initiator and the descent delay assembly can be combined in a piston linked to the rotating dam member and provided with a water channel for creating a resisting pressure to the advancing piston and thereby slowing the associated descent of the toilet seat.
A branch and bound algorithm for the global optimization of Hessian ...
2011-11-16T23:59:59.000Z
Nov 1, 2011 ... algorithm when the cubic lower bound is rather crude. ...... Goldstein-Price .... 12th European Conference on the Mathematics of Oil Recovery, ...
Catalyst for producing lower alcohols
Rathke, Jerome W. (Bolingbrook, IL); Klingler, Robert J. (Woodridge, IL); Heiberger, John J. (Glen Ellyn, IL)
1987-01-01T23:59:59.000Z
A process and system for the production of the lower alcohols such as methanol, ethanol and propanol involves the reaction of carbon monoxide and water in the presence of a lead salt and an alkali metal formate catalyst combination. The lead salt is present as solid particles such as lead titanate, lead molybdate, lead vanadate, lead zirconate, lead tantalate and lead silicates coated or in slurry within molten alkali metal formate. The reactants, carbon monoxide and steam are provided in gas form at relatively low pressures below 100 atmospheres and at temperatures of 200-400.degree. C. The resulted lower alcohols can be separated into boiling point fractions and recovered from the excess reactants by distillation.
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
Reconstruction algorithms for MRI
Bilgic?, Berkin
2013-01-01T23:59:59.000Z
This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Lower Sioux Wind Feasibility & Development
Minkel, Darin
2012-04-01T23:59:59.000Z
This report describes the process and findings of a Wind Energy Feasibility Study (Study) conducted by the Lower Sioux Indian Community (Community). The Community is evaluating the development of a wind energy project located on tribal land. The project scope was to analyze the critical issues in determining advantages and disadvantages of wind development within the Community. This analysis addresses both of the Community's wind energy development objectives: the single turbine project and the Commerical-scale multiple turbine project. The main tasks of the feasibility study are: land use and contraint analysis; wind resource evaluation; utility interconnection analysis; and project structure and economics.
Lowering Barriers | 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 Office of Inspector General Office0-72.pdfGeorgeDoesn't HappenLow-Cost Production ofModeling AssessmentLower
Office of Environmental Management (EM)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) "of EnergyEnergyENERGY TAX POLICIES7.pdfFuel2007 |KSRS25RV*)BoydLoretta RobinsonVehiclesModeling5 Lower East
Tensor rank : some lower and upper bounds
Forbes, Michael Andrew
2011-01-01T23:59:59.000Z
The results of Strassen [25] and Raz [19] show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit ...
NEMS Freight Transportation Module Improvement Study
U.S. Energy Information Administration (EIA) Indexed Site
basic shapes 33. Articles of base metal 41. Waste and scrap 3. Processed food 5. Meat, fish, seafood, and their preparations 6. Milled grain products and preparations, and bakery...
Lower hybrid wavepacket stochasticity revisited
Fuchs, V.; Krlín, L.; Pánek, R.; Preinhaelter, J.; Seidl, J.; Urban, J. [Institute of Plasma Physics AS CR, v.v.i., Prague, CZ, Association EURATOM/IPP.CR (Czech Republic); Laqua, H. P. [Max Planck Institute für Plasmaphysik, EURATOM Association, D-17491 Greifswald (Germany)
2014-02-12T23:59:59.000Z
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].
Winter Energy Savings from Lower Thermostat Settings
Reports and Publications (EIA)
2000-01-01T23:59:59.000Z
This discussion provides details on the effect of lowering thermostat settings during the winter heating months of 1997.
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,...
Lower bound and an optimal algorithm for leader election in faulty asynchronous general networks
Lateef, Mohammed Afroz
1993-01-01T23:59:59.000Z
incident on it, the size of the network, and the ID of the node. Thus a node does not know who its neighbors are and which links are unreliable. We assume that the network is asynchronous i. e. there is no global clock and global memory in the network... the leader is a loser. Each node knows its ID, the number of edges incident on it, and the number of nodes in the network, i. e. ~V) = N. The node does not know which of the links are reliable. The IDs of the uodes are unique and distinct. All the nodes...
Nonlocality improves Deutsch algorithm
Koji Nagata; Sangkyung Lee; Jaewook Ahn
2007-03-15T23:59:59.000Z
Recently, [{arXiv:0810.3134}] is accepted and published. We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered a use of entangled photon pairs to determine simultaneously and probabilistically two unknown functions. The usual Deutsch algorithm determines one unknown function and exhibits a two to one speed up in a certain computation on a quantum computer rather than on a classical computer. We found that the violation of Bell locality in the Hilbert space formalism of quantum theory predicts that the proposed {\\it probabilistic} Deutsch algorithm for computing two unknown functions exhibits at least a $2\\sqrt{2}(\\simeq 2.83)$ to one speed up.
Graph algorithms experimentation facility
Sonom, Donald George
1994-01-01T23:59:59.000Z
DRAWADJMAT 2 ~e ~l 2. ~f ~2 2 ~t ~& [g H 2 O? Z Mwd a P d ed d Aid~a sae R 2-BE& T C dbms Fig. 2. External Algorithm Handler The facility is menu driven and implemented as a client to XAGE. Our implementation follows very closely the functionality...
Space Complexity Algorithms & Complexity
Way, Andy
Space Complexity Algorithms & Complexity Space Complexity Nicolas Stroppa Patrik Lambert - plambert@computing.dcu.ie CA313@Dublin City University. 2008-2009. December 4, 2008 #12;Space Complexity Hierarchy of problems #12;Space Complexity NP-intermediate Languages If P = NP, then are there languages which neither in P
KH Computational Physics-2006 Basic Numerical Algorithms Integration
Glashausser, Charles
KH Computational Physics- 2006 Basic Numerical Algorithms Integration Numerical integration competing factors one needs to consider · speed - number of function evaluations or grid points · precision or "smart" meshes with lower order routines Kristjan Haule, 2006 1 #12;KH Computational Physics- 2006
Lower Saccharide Nanometric Materials and Methods
Schilling, Christopher H.; Tomasik, Piotr; Sikora, Marek
2004-07-13T23:59:59.000Z
A ceramic composition having at least one nanometric ceramic powder, at least one lower saccharide, and water. The composition is useful in many industrial applications, including preparation of stronger and substantially defect free green and sintered ceramic bodies.
Quantum Lower Bounds by Polynomials Robert Beals
de Wolf, Ronald
Quantum Lower Bounds by Polynomials Robert Beals University of Arizonaz Harry Buhrman CWI.O. Box 210089, 617 N. Santa Rita Ave, Tucson AZ 85721Â0089, USA. E-mail: beals@math.arizona.edu. xCWI, P
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
Shrinking Procedures and Optimal Algorithms
Saeed Ghadimi
2012-06-18T23:59:59.000Z
Jun 18, 2012 ... Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal ...
Deutsch and Jozsa's Algorithm Revisited
John W. Cooper
2006-03-27T23:59:59.000Z
A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed
Graph Algorithms Tours in Graphs
Bar-Noy, Amotz
terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path
Multipartite entanglement in quantum algorithms
Bruss, D. [Institut fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf, D-40225 Duesseldorf (Germany); Macchiavello, C. [Dipartimento di Fisica 'A. Volta' and INFN-Sezione di Pavia, Via Bassi 6, 27100 Pavia (Italy)
2011-05-15T23:59:59.000Z
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyze the multipartite entanglement properties in the Deutsch-Jozsa, Grover, and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Stability of Coupling Algorithms
Akkasale, Abhineeth
2012-07-16T23:59:59.000Z
INTRODUCTION AND MOTIVATION : : : : : : : : : : : : : 1 A. Approaches to solving a coupled system . . . . . . . . . . . 3 B. Common terminology . . . . . . . . . . . . . . . . . . . . . 5 C. Classi cation of coupling algorithms . . . . . . . . . . . . . 7 1... equal, cA = cB = mA = mB = 1 and with dissipation, = 0:5 : : : : : : : : : : : : : : : : 26 10 Conditional stability observed with cA > cB. The material prop- erties: cA = 100; cB = 1; mA = mB = 1; = 1 : : : : : : : : : : : : : 27 11 An unstable...
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01T23:59:59.000Z
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Algorithms for builder guidelines
Balcomb, J.D.; Lekov, A.B.
1989-06-01T23:59:59.000Z
The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.
A lower bound for routing on a completely connected optical communication parallel computer
Goldberg, L.A. [Sandia National Labs., Albuquerque, NM (United States); Jerrum, M. [Edinburgh Univ. (United Kingdom). Dept. of Computer Science; MacKenzie, P.D. [Texas Univ., Austin, TX (United States). Dept. of Computer Sciences
1993-08-03T23:59:59.000Z
The task of routing a 2-relation on an n-processor completely connected optical communication parallel computer (OCPC) is considered. A lower bound is presented that applies to any randomized distributed algorithm for this task: specifically, it is shown that the expected number of steps required to route a 2-relation is {Omega}({radical} log log n) in the worst case. For comparison, the best upper bound known is O(log log n).
PVT Analysis With A Deconvolution Algorithm
Kouzes, Richard T.
2011-02-01T23:59:59.000Z
Polyvinyl Toluene (PVT) plastic scintillator is the most common gamma ray detector material used for large systems when only gross counting is needed because of its low cost, robustness, and relative sensitivity. PVT does provide some energy information about the incident photons, as has been demonstrated through the development of Energy Windowing analysis. There is a more sophisticated energy analysis algorithm developed by Symetrica, Inc., and they have demonstrated the application of their deconvolution algorithm to PVT with very promising results. The thrust of such a deconvolution algorithm used with PVT is to allow for identification and rejection of naturally occurring radioactive material, reducing alarm rates, rather than the complete identification of all radionuclides, which is the goal of spectroscopic portal monitors. Under this condition, there could be a significant increase in sensitivity to threat materials. The advantage of this approach is an enhancement to the low cost, robust detection capability of PVT-based radiation portal monitor systems. The success of this method could provide an inexpensive upgrade path for a large number of deployed PVT-based systems to provide significantly improved capability at a much lower cost than deployment of NaI(Tl)-based systems of comparable sensitivity.
Prospects and Limitations of Algorithmic Cooling
Gilles Brassard; Yuval Elias; Tal Mor; Yossi Weinstein
2014-04-27T23:59:59.000Z
Heat-bath algorithmic cooling (AC) of spins is a theoretically powerful effective cooling approach, that (ideally) cools spins with low polarization exponentially better than cooling by reversible entropy manipulations alone. Here, we investigate the limitations and prospects of AC. For non-ideal and semioptimal AC, we study the impact of finite relaxation times of reset and computation spins on the achievable effective cooling. We derive, via simulations, the attainable cooling levels for given ratios of relaxation times using two semioptimal practicable algorithms. We expect this analysis to be valuable for the planning of future experiments. For ideal and optimal AC, we make use of lower bounds on the number of required reset steps, based on entropy considerations, to present important consequences of using AC as a tool for improving signal-to-noise ratio in liquid-state magnetic resonance spectroscopy. We discuss the potential use of AC for noninvasive clinical diagnosis and drug monitoring, where it may have significantly lower specific absorption rate (SAR) with respect to currently used methods.
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
THE LOWER SOLAR ATMOSPHERE ROBERT J. RUTTEN Sterrekundig Instituut, Postbus 80 000, NL3508 TA, Utrecht, The Netherlands Abstract. This "rapporteur" report discusses the solar photosphere and low does not seem to jeopardize precise determination of solar abundances in classical fashion. It is still
EQUATIONS FOR LOWER BOUNDS ON BORDER RANK
Hauenstein, Jonathan
EQUATIONS FOR LOWER BOUNDS ON BORDER RANK JONATHAN D. HAUENSTEIN, CHRISTIAN IKENMEYER, AND J of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 multiplication operator M2, which gives a new proof that the border rank of the multiplication of 2 Ã? 2 matrices
Geometric Lower Bounds for Parametric Matroid Optimization
Eppstein, David
(n)) for the special case of parametric graph minimum spanning trees. The only previous lower bound was (n logr for the sequence of minimum spanning trees in a graph with linearly varying edge weights. This parametric spanning tree problem has applications including the stochastic spanning tree problem studied by Ishii et al
Nonlinear lower hybrid modeling in tokamak plasmas
Napoli, F.; Schettini, G. [Università Roma Tre, Dipartimento di Ingegneria, Roma (Italy); Castaldo, C.; Cesario, R. [Associazione EURATOM/ENEA sulla Fusione, Centro Ricerche Frascati (Italy)
2014-02-12T23:59:59.000Z
We present here new results concerning the nonlinear mechanism underlying the observed spectral broadening produced by parametric instabilities occurring at the edge of tokamak plasmas in present day LHCD (lower hybrid current drive) experiments. Low frequency (LF) ion-sound evanescent modes (quasi-modes) are the main parametric decay channel which drives a nonlinear mode coupling of lower hybrid (LH) waves. The spectrum of the LF fluctuations is calculated here considering the beating of the launched LH wave at the radiofrequency (RF) operating line frequency (pump wave) with the noisy background of the RF power generator. This spectrum is calculated in the frame of the kinetic theory, following a perturbative approach. Numerical solutions of the nonlinear LH wave equation show the evolution of the nonlinear mode coupling in condition of a finite depletion of the pump power. The role of the presence of heavy ions in a Deuterium plasma in mitigating the nonlinear effects is analyzed.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08T23:59:59.000Z
We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Bommareddi, Anveshan
2009-01-01T23:59:59.000Z
??An oil-life algorithm to calculate the remaining percentage of oil life is presented as a means to determine the right time to change the oil… (more)
Optimization Online - Coordinate descent algorithms
Stephen Wright
2014-12-01T23:59:59.000Z
Dec 1, 2014 ... Stephen Wright(swright ***at*** cs.wisc.edu). Abstract: Coordinate descent algorithms solve optimization problems by successively minimizing ...
Shortest Path Algorithms: A Comparison
Golden, Bruce L., 1950-
In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
Arctic Lower Troposphere Observed Structure (ALTOS)
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth (AOD)ProductssondeadjustsondeadjustAbout theOFFICEAmesApplication2 (CRAC 2SSRL27 Users'weeklyJune Lower
Diagnosis of Lower Hybrid on MST
Burke, D. R.; Goetz, J. A.; Kaufman, M. C.; Almagri, A. F.; Anderson, J. K.; Forest, C. B.; Prager, S. C. [University of Wisconsin--Madison, Madison WI 53706 (United States)
2007-09-28T23:59:59.000Z
RF driven current has never been demonstrated in a Reversed Field Pinch. Recently the lower hybrid system on the Madison Symmetric Torus reached a new operating regime. This upgrade allows RF powers of up to 5% of the Ohmic input power to be injected. It is therefore anticipated that the lower hybrid system is on the threshold of producing meaningful changes to the RFP equilibrium. A diagnostic set is under development to facilitate the study of such changes and lay the foundation for near megawatt operations. Many measurements are being studied for viability. These include electron cyclotron emission, examinations of bulk ion and electron heating, surface perturbation pickup coils, magnetic probe measurements, and Langmuir probe measurements. In addition, several x-ray diagnostics are in operation: pulse height analysis is performed on detector arrays to determine the 5-200 keV spectrum. An insertable target probe is available to create x-rays from fast electrons. Tomographic inversion of 2-D Soft x-ray detectors yields equilibrium information through island structure. Results from experiments with source power up to 225 kW will be presented. Preliminary results from CQL3D Fokker-Planck simulations will also be presented.
Environmental analysis of Lower Pueblo/Lower Los Alamos Canyon, Los Alamos, New Mexico
Ferenbaugh, R.W.; Buhl, T.E.; Stoker, A.K.; Becker, N.M.; Rodgers, J.C.; Hansen, W.R.
1994-12-01T23:59:59.000Z
The radiological survey of the former radioactive waste treatment plant site (TA-45), Acid Canyon, Pueblo Canyon, and Los Alamos Canyon found residual contamination at the site itself and in the channel and banks of Acid, Pueblo, and lower Los Alamos Canyons all the way to the Rio Grande. The largest reservoir of residual radioactivity is in lower Pueblo Canyon, which is on DOE property. However, residual radioactivity does not exceed proposed cleanup criteria in either lower Pueblo or lower Los Alamos Canyons. The three alternatives proposed are (1) to take no action, (2) to construct a sediment trap in lower Pueblo Canyon to prevent further transport of residual radioactivity onto San Ildefonso Indian Pueblo land, and (3) to clean the residual radioactivity from the canyon system. Alternative 2, to cleanup the canyon system, is rejected as a viable alternative. Thousands of truckloads of sediment would have to be removed and disposed of, and this effort is unwarranted by the low levels of contamination present. Residual radioactivity levels, under either present conditions or projected future conditions, will not result in significant radiation doses to persons exposed. Modeling efforts show that future transport activity will not result in any residual radioactivity concentrations higher than those already existing. Thus, although construction of a sediment trap in lower Pueblo Canyon is a viable alternative, this effort also is unwarranted, and the no-action alternative is the preferred alternative.
Ping, Li
to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes an architecture in which-Decoding Algorithms for ReedÂSolomon Codes--Part II: Soft-Input Soft-Output Iterative Decoding Jason Bellorado with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing
Lower Snake River Subbasin Management Plan WDFW March 2004 1
Lower Granite pool and the Palouse and Tucannon Rivers join near the midpoint of Lower Monumental Ecoregion. Subbasin Land Ownership Palouse Lower Snake Tucannon Asotin Walla Walla Total Federal Lands 1 68
Light water reactor lower head failure analysis
Rempe, J.L.; Chavez, S.A.; Thinnes, G.L. [EG and G Idaho, Inc., Idaho Falls, ID (United States)] [and others
1993-10-01T23:59:59.000Z
This document presents the results from a US Nuclear Regulatory Commission-sponsored research program to investigate the mode and timing of vessel lower head failure. Major objectives of the analysis were to identify plausible failure mechanisms and to develop a method for determining which failure mode would occur first in different light water reactor designs and accident conditions. Failure mechanisms, such as tube ejection, tube rupture, global vessel failure, and localized vessel creep rupture, were studied. Newly developed models and existing models were applied to predict which failure mechanism would occur first in various severe accident scenarios. So that a broader range of conditions could be considered simultaneously, calculations relied heavily on models with closed-form or simplified numerical solution techniques. Finite element techniques-were employed for analytical model verification and examining more detailed phenomena. High-temperature creep and tensile data were obtained for predicting vessel and penetration structural response.
Lower Hybrid antennas for nuclear fusion experiments
Hillairet, Julien; Bae, Young-Soon; Bai, X; Balorin, C; Baranov, Y; Basiuk, V; Bécoulet, A; Belo, J; Berger-By, G; Brémond, S; Castaldo, C; Ceccuzzi, S; Cesario, R; Corbel, E; Courtois, X; Decker, J; Delmas, E; Delpech, L; Ding, X; Douai, D; Ekedahl, A; Goletto, C; Goniche, M; Guilhem, D; Hertout, P; Imbeaux, F; Litaudon, X; Magne, R; Mailloux, J; Mazon, D; Mirizzi, F; Mollard, P; Moreau, P; Oosako, T; Petrzilka, V; Peysson, Y; Poli, S; Preynas, M; Prou, M; Saint-Laurent, F; Samaille, F; Saoutic, B
2015-01-01T23:59:59.000Z
The nuclear fusion research goal is to demonstrate the feasibility of fusion power for peaceful purposes. In order to achieve the conditions similar to those expected in an electricity-generating fusion power plant, plasmas with a temperature of several hundreds of millions of degrees must be generated and sustained for long periods. For this purpose, RF antennas delivering multi-megawatts of power to magnetized confined plasma are commonly used in experimental tokamaks. In the gigahertz range of frequencies, high power phased arrays known as "Lower Hybrid" (LH) antennas are used to extend the plasma duration. This paper reviews some of the technological aspects of the LH antennas used in the Tore Supra tokamak and presents the current design of a proposed 20 MW LH system for the international experiment ITER.
Brain insulin lowers circulating BCAA levels by inducing hepatic...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Brain insulin lowers circulating BCAA levels by inducing hepatic BCAA catabolism. Brain insulin lowers circulating BCAA levels by inducing hepatic BCAA catabolism. Abstract:...
Standards for graph algorithm primitives
Mattson, Tim
It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...
Geometric algorithms for reconfigurable structures
Benbernou, Nadia M
2011-01-01T23:59:59.000Z
In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the ...
An Algorithm for Bootstrapping Communications
Beal, Jacob
2001-08-13T23:59:59.000Z
I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time. Communication is robust and ...
Simulations of lower-hybrid coupling in the Madison Symmetric Torus
Carlsson, Johan; Smithe, David [Tech-X Corporation, Boulder, Colorado (United States); Carter, Mark [Oak Ridge National Laboratory, Oak Ridge, Tennessee (United States); Kaufman, Mike [University of Wisconsin, Madison, Wisconsin (United States)
2009-11-26T23:59:59.000Z
Simulations of Lower Hybrid (LH) coupling in the Madison Symmetric Torus (MST) Reversed Field Pinch (RFP) will be presented. Due to the special requirements of the RFP configuration (tight-fitting conducting shell in which only minimal portholes are acceptable), an unusual interdigital line slow-wave antenna is used, mounted below the mid plane on the inboard side. A number of codes are used, including VORPAL, RANT3D/AORSA1D-H and MWS, each solving different equations and using different algorithms. Output from the different codes will be presented and compared to verify the simulation results.
A Cavity QED Implementation of Deutsch-Jozsa Algorithm
E. S. Guerra
2004-10-23T23:59:59.000Z
The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.
Frequency stabilization in nonlinear MEMS and NEMS oscillators
Lopez, Omar Daniel; Antonio, Dario
2014-09-16T23:59:59.000Z
An illustrative system includes an amplifier operably connected to a phase shifter. The amplifier is configured to amplify a voltage from an oscillator. The phase shifter is operably connected to a driving amplitude control, wherein the phase shifter is configured to phase shift the amplified voltage and is configured to set an amplitude of the phase shifted voltage. The oscillator is operably connected to the driving amplitude control. The phase shifted voltage drives the oscillator. The oscillator is at an internal resonance condition, based at least on the amplitude of the phase shifted voltage, that stabilizes frequency oscillations in the oscillator.
Appendix C: Map of NEMS Electricity Market Module Regions
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) " ,"ClickPipelinesProved Reserves (Billion CubicCubic Feet)Year Jan FebForeign Distribution66 U.S. U.S.
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary) " ,"Click worksheet9,1,50022,3,,,,6,1,,781Title: Telephone:shortOil and Natural Gas AEO2015Energy
U.S. Regional Demand Forecasts Using NEMS and GIS
Cohen, Jesse A.; Edwards, Jennifer L.; Marnay, Chris
2005-01-01T23:59:59.000Z
Administration. 2004a. Annual Energy Outlook 2004. U.S.Assumptions of the Annual Energy Outlook 2004. DOE/EIA-0554(and Definitions AEO – Annual Energy Outlook ArcGIS - ESRI
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 Office of InspectorConcentrating Solar Powerstories onFocus AreaDataBus Jump to:NSTARNamibia-UNEPProgrammesSystem
Frequency Stabilization in Nonlinear MEMS and NEMS Oscillators | Argonne
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: Vegetation ProposedUsing ZirconiaPolicyFeasibilityFieldMinds"Office | Department- Energy
NEMS Freight Transportation Module Improvement Study - Energy Information
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Opticalhttp://www.fnal.gov/directorate/nalcal/nalcal02_07_05_files/nalcal.gif Directorate - EventsNEET Benefits
EIA Buildings Analysis of Consumer Behavior in NEMS
U.S. Energy Information Administration (EIA) Indexed Site
2015 2020 2025 2030 2035 2040 0 2 4 6 8 10 12 14 16 2010 2015 2020 2025 2030 2035 2040 PV Wind Natural gas Other For more information 15 Behavioral Economics Experts Meeting,...
Albertiana 25 Report on the Lower Triassic of
Tong, Jinnan
GSSPs of the Triassic. The GSSP of the PTB is located in a protected quarry at Meishan, Changxing County the uppermost of the Lower Triassic was eroded off. Moreover, the Lower Tri- assic in Meishan area is made
Updated distribution and reintroduction of the Lower Keys marsh rabbit
Faulhaber, Craig Alan
2005-02-17T23:59:59.000Z
Listed as federally-endangered in 1990, the Lower Keys marsh rabbit (LKMR, Sylvilagus palustris hefneri) exists as a metapopulation in patches of wetland habitat in Florida?s Lower Keys. This study sought to address 2 priority actions identified...
Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge
Mazzotti, Frank
Position: Forestry Intern Location: Lower Suwannee National Wildlife Refuge Application Process: Student Conservation Association (SCA) Forestry and biological Wildlife Refuge. This forestry position will be mostly field work within the Lower
The Lower Rio Grande Valley Regional Public Transportation Coordination Plan
Lower Rio Grande Valley Development Council
2006-11-30T23:59:59.000Z
KFH GROUP, INC. THE LOWER RIO GRANDE VALLEY REGIONAL PUBLIC TRANSPORTATION COORDINATION PLAN Developed for: Lower Rio Grande Valley Regional Transportation Coordination Plan Committee By: KFH Group, Incorporated... Page BACKGROUND..............................................................................................................................1 PLAN PROCESS...
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2005 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2002 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka during the 2002 spring out-migration at migrant traps on the Snake River and Salmon River. In 2002 fish management agencies released significant numbers of hatchery Chinook salmon and steelhead trout above Lower Granite Dam that were not marked with a fin clip or coded-wire tag. Generally, these fish were distinguishable from wild fish by the occurrence of fin erosion. Total annual hatchery Chinook salmon catch at the Snake River trap was 11.4 times greater in 2002 than in 2001. The wild Chinook catch was 15.5 times greater than the previous year. Hatchery steelhead trout catch was 2.9 times greater than in 2001. Wild steelhead trout catch was 2.8 times greater than the previous year. The Snake River trap collected 3,996 age-0 Chinook salmon of unknown rearing. During 2002, the Snake River trap captured 69 hatchery and 235 wild/natural sockeye salmon and 114 hatchery coho salmon O. kisutch. Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with flow. The significant increase in catch in 2002 was due to a 3.1 fold increase in hatchery Chinook production and a more normal spring runoff. Trap operations began on March 10 and were terminated on June 7. The trap was out of operation for a total of four days due to mechanical failure or debris. Hatchery Chinook salmon catch at the Salmon River trap was 4.2 times greater and wild Chinook salmon catch was 2.4 times greater than in 2001. The hatchery steelhead trout collection in 2002 was 81% of the 2001 numbers. Wild steelhead trout collection in 2002 was 81% of the previous year's catch. Trap operations began on March 10 and were terminated on May 29 due to high flows. The trap was out of operation for four days due to high flow or debris. The increase in hatchery Chinook catch in 2002 was due to a 3.1 fold increase in hatchery production and differences in flow between years. Changes in hatchery and wild steelhead catch are probably due to differences in flow between years. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged Chinook salmon and steelhead trout marked at the Snake River trap were affected by discharge. Statistical analysis of 2002 data detected a relation between migration rate and discharge for hatchery and wild Chinook salmon. For hatchery and wild Chinook salmon there was a 4.7-fold and a 3.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. For steelhead trout tagged at the Snake River trap, statistical analysis detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge. For hatchery and wild steelhead trout, there was a 1.8-fold and a 1.7-fold increase in migration rate, respectively, between 50 and 100 kcfs. Travel time and migration rate to Lower Granite Dam for fish marked at the Salmon River trap were calculated. Statistical analysis of the 2002 data detected a significant relation between migration rate and Lower Granite Reservoir inflow discharge for wild Chinook salmon and hatchery steelhead trout. The analysis was unable to detect a relation between migration rate and discharge for hatchery Chinook salmon. The lack of a detectable relation was probably a result of the migration rate data being spread over a very narrow range of discharge. Not enough data were available to perform the analysis for wild steelhead trout. Migration rate increased 4.3-fold for wild Chinook salmon and 2.2-fold for hatchery steelhead between 50 kcfs and 100 kcfs. Fish tagged with passive integrated transponder (PIT) tags at the Snake River trap were interrogated at four dams with PIT tag detection systems (Lower Granite, Little Goose, Lower Monumental, and McNary dams). Because of the addition of the fourth interrogation site (Lower Monumental) in 1993 and the installation of the Removable Spillway Weir at
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2004 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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
Algorithmic Thermodynamics John C. Baez
Tomkins, Andrew
Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + Âµd
Adaptive protection algorithm and system
Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA
2009-04-28T23:59:59.000Z
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Parallel algorithms for inductance extraction
Mahawar, Hemant
2007-09-17T23:59:59.000Z
. . . . . . . . . . . . . . . . . . . . . . . . . 30 3. Pin Connect . . . . . . . . . . . . . . . . . . . . . . . . . 31 C. The Inductance Extraction Algorithm . . . . . . . . . . . . . . 33 ix CHAPTER Page V COMPARISON WITH EXISTING WORK . . . . . . . . . . . . . 35 A. Ground Plane... . . . . . . . . . . . . . . . . . . . . . . . 52 1. Shared Memory Parallelization . . . . . . . . . . . . . . . 53 2. Mixed Mode Parallelization . . . . . . . . . . . . . . . . . 55 3. Distributed Memory Parallelization . . . . . . . . . . . . . 56 VII CONCLUSIONS...
Flint-Garcia, Sherry
ice-surface lowering or some regional climate change induced by ice-surface lowering. If attributed solely to a change in ice-surface elevation, the 3° to 4°C warming at Siple Dome (16) would indicate 500 to 650 m of ice-surface lowering, assuming a free atmospheric lapse rate of 6°C per 1000 m
Kavcic, Aleksandar
a practical approach to the iterative decoding of Reed-Solomon (RS) codes. The presented methodology utilizes Soft Decoding Algorithms for Reed-Solomon Codes: Part II - Soft-Input-Soft-Output Iterative Decoding with the presented methodology. The complexity of the proposed algorithm is significantly lower than these existing
Optimization Online - An Approximation Algorithm for Constructing ...
Artur Pessoa
2006-09-02T23:59:59.000Z
Sep 2, 2006 ... In this paper, we propose an approximation algorithm for the 2-bit Hamming prefix code problem. Our algorithm spends $O(n \\log^3 n)$ time to ...
asexual genetic algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
for Genetic Algorithms No Author Given Andrews, Mark W. 2 A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm) CERN Preprints Summary: Context....
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09T23:59:59.000Z
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09T23:59:59.000Z
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
Implementation of the Iterative Proportion Fitting Algorithm for Geostatistical Facies Modeling
Li Yupeng, E-mail: yupeng@ualberta.ca; Deutsch, Clayton V. [University of Alberta (Canada)
2012-06-15T23:59:59.000Z
In geostatistics, most stochastic algorithm for simulation of categorical variables such as facies or rock types require a conditional probability distribution. The multivariate probability distribution of all the grouped locations including the unsampled location permits calculation of the conditional probability directly based on its definition. In this article, the iterative proportion fitting (IPF) algorithm is implemented to infer this multivariate probability. Using the IPF algorithm, the multivariate probability is obtained by iterative modification to an initial estimated multivariate probability using lower order bivariate probabilities as constraints. The imposed bivariate marginal probabilities are inferred from profiles along drill holes or wells. In the IPF process, a sparse matrix is used to calculate the marginal probabilities from the multivariate probability, which makes the iterative fitting more tractable and practical. This algorithm can be extended to higher order marginal probability constraints as used in multiple point statistics. The theoretical framework is developed and illustrated with estimation and simulation example.
Jian Jinbao, E-mail: jianjb@gxu.edu.cn; Li Jianling; Mo Xingde [College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004 (China)
2006-06-15T23:59:59.000Z
This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 2003 Annual Report.
Buettner, Edwin W.; Putnam, Scott A. [Idaho Department of Fish and Game
2009-02-18T23:59:59.000Z
This project monitored the daily passage of Chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon 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
Automated Architectural Exploration for Signal Processing Algorithms
Davis, Rhett
Automated Architectural Exploration for Signal Processing Algorithms Ramsey Hourani, Ravi Jenkal, W processing algorithms. The goal of our framework is to improve hardware architectural exploration by guiding Property (IP) cores for system level signal processing algorithms. We present our view of a framework
Fast algorithms for triangular Josephson junction arrays
Datta, S.; Sahdev, D. [Indian Institute of Technology, Kanpur (India)] [Indian Institute of Technology, Kanpur (India)
1997-04-01T23:59:59.000Z
We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket formalism is introduced in the context of such arrays. We note that triangular arrays can have both hexagonal and rectangular periodicity and develop algorithms for each. Boundaries are next introduced and fast algorithms for finite arrays are developed. 40 refs., 4 figs.
Deutsch Algorithm on Classical Circuits
Osman Kaan Erol
2008-03-21T23:59:59.000Z
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum computer can find the answer with certainty within a few steps although classical electronic systems must evaluate more iterations than quantum computer. In this paper, it is shown that a classical computation system formed by using ordinary electronic parts may perform the same task with equal performance than quantum computers. DA and DJA quantum circuits act like an analog computer, so it is unfair to compare the bit of classical digital computers with the qubit of quantum computers. An analog signal carrying wire will of course carry more information that a bit carrying wire without serial communication protocols.
Smolt Monitoring at the Head of Lower Granite Reservoir and Lower Granite Dam, 1998 Annual Report.
Buettner, Edwin W.; Brimmer, Arnold F.
2000-04-01T23:59:59.000Z
This project monitored the daily passage of chinook salmon Oncorhynchus tshawytscha, steelhead trout O. mykiss, and sockeye salmon smolts O. nerka, during the 1998 spring outmigration at migrant traps on the Snake and Salmon rivers. All hatchery chinook salmon released above Lower Granite Dam 19 1998 were marked with a fin-clip. Total annual hatchery chinook salmon catch at the Snake River trap was 226% of the 1997 number and 110% of the 1996 catch. The wild chinook catch was 120% of the 1997 catch but was only 93% of 1996. Hatchery steelhead trout catch was 501% of 1997 numbers but only 90% of the 1996 numbers. Wild steelhead trout catch was 569% of 1997 and 125% of the 1996 numbers. The Snake River trap collected 106 age-0 chinook salmon. During 1998, for the first time, the Snake River trap captured a significant number of hatchery sockeye salmon (1,552) and hatchery coho salmon O. kisutch (166). Differences in trap catch between years are due to fluctuations not only in smolt production, but also differences in trap efficiency and duration of trap operation associated with high flows. Trap operations began on March 8 and were terminated for the season due to high flows on June 12. The trap was out of operation for 34 d during the season due to high flow and debris. Hatchery chinook salmon catch at the Salmon River trap was 476% and wild chinook salmon catch was 137% of 1997 numbers and 175% and 82% of 1996 catch, respectively. The hatchery steelhead trout collection in 1998 was 96% of the 1997 catch and 13% of the 1996 numbers. Wild steelhead trout collection in 1998 was 170% of the 1997 catch and 37% of the 1996 numbers. Travel time (d) and migration rate (km/d) through Lower Granite Reservoir for PIT-tagged chinook salmon and steelhead trout, marked at the head of the reservoir were affected by discharge. For fish tagged at the Snake River trap, statistical analysis of 1998 detected a significant relation between migration rate and discharge. For hatchery and wild chinook salmon there was a 2.0- and 2.6-fold increase in migration rate, respectively, between 50 and 100 thousands of cubic feet per second (kcfs). For hatchery steelhead trout there was a 2.6-fold increase in migration rate between 50 kcfs and 100 kcfs. For fish marked at the Salmon River trap, statistical analysis of the 1998 data detected a significant relation between migration rate and discharge for hatchery and wild chinook salmon hatchery and found a 3.3- and 2.6-fold increase in migration rate, respectively, between 50 and 100 kcfs. A significant relation between migration rate and discharge was not detected for hatchery steelhead trout. Insufficient numbers of wild steelhead trout were PIT-tagged at the Salmon River trap to estimate travel time and migration rate to Lower Granite Dam.
Citrus Production in the Lower Rio Grande Valley of Texas.
Traub, Hamilton Paul; Friend, W. H. (William Heartsill)
1930-01-01T23:59:59.000Z
LIE?ARY, A t r: COLLEGE, CAvrus. TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR COLLEGE STATION, BRAZOS COUNTY, TEXAS - BULLETIN NO. 419 DIVISION OF HORTICULTURE Citrus Production in the Lower Rio Grande Valley of Texas... of Agriculture. . Citrus fruit production in the Lower Rio Grande Valley, especially grapefruit, has increased at a rather rapid rate dur- ing the past few years. More than 5,000,000 citrus trees were set in orchard form in the Lower Rio Grande Valley up...
Lower Cost Lithium Ion Batteries From Aluminum Substituted Cathode...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Lower Cost Lithium Ion Batteries From Aluminum Substituted Cathode Materials Lawrence Berkeley National Laboratory Contact LBL About This Technology Technology Marketing...
Microsoft Word - LowerJocko_Acquisition_CX_final_081310.doc
Broader source: Energy.gov (indexed) [DOE]
Salish and Kootenai Tribes (CSKT) for purchase of the Lower Jocko River Property Fish and Wildlife Project No.: 2002-003-00, Contract BPA-44646 Categorical Exclusion...
Optimization Online - Lower Bounding Procedures for the Single ...
Borzou Rostami
2014-11-30T23:59:59.000Z
Nov 30, 2014 ... Lower Bounding Procedures for the Single Allocation Hub Location Problem. Borzou Rostami(brostami ***at*** mathematik.tu-dortmund.de)
Energy Department Announces $25 Million to Lower Cost of Concentrating...
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...
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,...
Developing a Lower Cost and Higher Energy Density Alternative...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
for Advanced Batteries ADVANCED MANUFACTURING OFFICE Developing a Lower Cost and Higher Energy Density Alternative to Lithium-Ion Batteries Introduction As the world moves toward...
agaricus bisporus lowers: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
and discusses some subtleties of studying field space trajectories. Aditya Aravind; Dustin Lorshbough; Sonia Paban 2014-01-06 182 Lower bounds in the quantum cell probe model...
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation InInformation In closing, an National Carbon Capture Center at2/316 PhotovoltaicCapORNL
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
Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$
Bullo, Francesco
Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$ Vaibhav with sigmoid utilities. We merge approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmoid utilities
Microgenetic optimization algorithm for optimal wavefront shaping
Anderson, Benjamin R; Gunawidjaja, Ray; Eilers, Hergen
2015-01-01T23:59:59.000Z
One of the main limitations of utilizing optimal wavefront shaping in imaging and authentication applications is the slow speed of the optimization algorithms currently being used. To address this problem we develop a micro-genetic optimization algorithm ($\\mu$GA) for optimal wavefront shaping. We test the abilities of the $\\mu$GA and make comparisons to previous algorithms (iterative and simple-genetic) by using each algorithm to optimize transmission through an opaque medium. From our experiments we find that the $\\mu$GA is faster than both the iterative and simple-genetic algorithms and that both genetic algorithms are more resistant to noise and sample decoherence than the iterative algorithm.
Study of lower hybrid wave propagation in ionized gas by Hamiltonian theory
Casolari, A. [Università di Pisa, Pisa (Italy); Cardinali, A. [Associazione Euratom-ENEA sulla Fusione, C.P. 65 - I-00044 - Frascati, Rome (Italy)
2014-02-12T23:59:59.000Z
In order to find an approximate solution to the Vlasov-Maxwell equation system describing the lower hybrid wave propagation in magnetic confined plasmas, the use of the WKB method leads to the ray tracing equations. The Hamiltonian character of the ray tracing equations is investigated analytically and numerically in order to deduce the physical properties of the wave propagating without absorption in the confined plasma. The consequences of the Hamiltonian character of the equations on the travelling wave, in particular, on the evolution of the parallel wavenumber along the propagation path have been accounted and the chaotic diffusion of the timeaveraged parallel wave-number towards higher values has been evaluated. Numerical analysis by means of a Runge-Kutta based algorithm implemented in a ray tracing code supplies the analytical considerations. A numerical tool based on the symplectic integration of the ray trajectories has been developed.
Annual Tour Ready to Explore New Mexico's Lower Pecos River
Nebraska-Lincoln, University of
Annual Tour Ready to Explore New Mexico's Lower Pecos River By Steve Ress The itinerary is set and the seats have been filled for an early June bus tour to New Mexico's lower Pecos River basin compacts on Nebraska's Republican River and New Mexico's Pecos River to see what can be learned from
Factorization law for two lower bounds of concurrence
Mirafzali, Sayyed Yahya; Sargolzahi, Iman; Ahanj, Ali; Javidan, Kurosh; Sarbishaei, Mohsen [Department of Physics, Ferdowsi University of Mashhad, Mashhad (Iran, Islamic Republic of); Khayyam Institute of Higher Education, Mashhad, Iran and School of Physics, Institute for Research in Fundamental Science (IPM), P. O. Box 19395-5531, Tehran (Iran, Islamic Republic of); Department of Physics, Ferdowsi University of Mashhad, Mashhad (Iran, Islamic Republic of)
2010-09-15T23:59:59.000Z
We study the dynamics of two lower bounds of concurrence in bipartite quantum systems when one party goes through an arbitrary channel. We show that these lower bounds obey the factorization law similar to that of [Konrad et al., Nat. Phys. 4, 99 (2008)]. We also discuss the application of this property in an example.
Enhanced algorithms for stochastic programming
Krishna, A.S.
1993-09-01T23:59:59.000Z
In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.
Lower bounds on the absorption probability of beam splitters
Stefan Scheel
2005-08-25T23:59:59.000Z
We derive a lower limit to the amount of absorptive loss present in passive linear optical devices such as a beam splitter. We choose a particularly simple beam splitter geometry, a single planar slab surrounded by vacuum, which already reveals the important features of the theory. It is shown that, using general causality requirements and statistical arguments, the lower bound depends on the frequency of the incident light and the transverse resonance frequency of a suitably chosen single-resonance model only. For symmetric beam splitters and reasonable assumptions on the resonance frequency $\\omega_T$, the lower absorption bound is $p_{\\min}\\approx 10^{-6}(\\omega/\\omega_T)^4$.
Quantum random-walk search algorithm
Shenvi, Neil; Whaley, K. Birgitta [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Kempe, Julia [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Computer Science Division, EECS, University of California, Berkeley, California 94720 (United States); CNRS-LRI, UMR 8623, Universite de Paris-Sud, 91405 Orsay (France)
2003-05-01T23:59:59.000Z
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O({radical}(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.
An object-oriented cluster search algorithm
Silin, Dmitry; Patzek, Tad
2003-01-24T23:59:59.000Z
In this work we describe two object-oriented cluster search algorithms, which can be applied to a network of an arbitrary structure. First algorithm calculates all connected clusters, whereas the second one finds a path with the minimal number of connections. We estimate the complexity of the algorithm and infer that the number of operations has linear growth with respect to the size of the network.
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19T23:59:59.000Z
Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.
EV Community Readiness projects: New York City and Lower Hudson...
Broader source: Energy.gov (indexed) [DOE]
EV Community Readiness projects: New York City and Lower Hudson Valley Clean Communities, Inc. (NY, MA, PA); NYSERDA (ME, NH, VT, MA, RI, CT, NY, NJ, PA, DE, MD, DC) EV Community...
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Print It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
The Iron Spin Transition in the Earth's Lower Mantle
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
2008 00:00 It is now known that the iron present in minerals of the lower mantle of the Earth undergoes a pressure-induced transition with pairing of the spins of its 3d electrons....
Lower limb response to modified ankle impedance in gait
Blackburn, Bonnie Lucille
2011-01-01T23:59:59.000Z
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 ...
SUSTAINABLE COMMUNITY REDEVELOPMENT: A Plan for Detroit's Lower Eastside
Edwards, Paul N.
SUSTAINABLE COMMUNITY REDEVELOPMENT: A Plan for Detroit's Lower of Science/Master of Landscape Architecture (Natural Resources and Environment of the neighborhood. To aid JEBA in their strategic planning process, we developed a replicable model of sustainable
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...
ORIGINAL ARTICLE Hydropower development in the lower Mekong basin
Vermont, University of
ORIGINAL ARTICLE Hydropower development in the lower Mekong basin: alternative approaches to deal hydropower generation and potentially irreversible negative impacts on the ecosystems that provide hydropower generation and potentially irreversible negative impacts on the ecosystems that provide
Wild and Scenic River Acts (Lower St. Croix Riverway)
Broader source: Energy.gov [DOE]
The lower portion of the St. Croix River in Minnesota and Wisconsin is regulated under the National Wild and Scenic Rivers Program. Most new residential, commercial, and industrial uses are...
A Mobile Motion Analysis System Using Intertial Sensors for Analysis of Lower Limb Prosthetics
Mueller, John Kyle P [ORNL] [ORNL; Ericson, Milton Nance [ORNL] [ORNL; Farquhar, Ethan [ORNL] [ORNL; Lind, Randall F [ORNL] [ORNL; Evans III, Boyd Mccutchen [ORNL] [ORNL
2011-01-01T23:59:59.000Z
Soldiers returning from the global war on terror requiring lower leg prosthetics generally have different concerns and requirements than the typical lower leg amputee. These subjects are usually young, wish to remain active and often desire to return to active military duty. As such, they demand higher performance from their prosthetics, but are at risk for chronic injury and joint conditions in their unaffected limb. Motion analysis is a valuable tool in assessing the performance of new and existing prosthetic technologies as well as the methods in fitting these devices to both maximize performance and minimize risk of injury for the individual soldier. We are developing a mobile, low-cost motion analysis system using inertial measurement units (IMUs) and two custom force sensors that detect ground reaction forces and moments on both the unaffected limb and prosthesis. IMUs were tested on a robot programmed to simulate human gait motion. An algorithm which uses a kinematic model of the robot and an extended Kalman filter (EKF) was used to convert the rates and accelerations from the gyro and accelerometer into joint angles. Compared to encoder data from the robot, which was considered the ground truth in this experiment, the inertial measurement system had a RMSE of <1.0 degree. Collecting kinematic and kinetic data without the restrictions and expense of a motion analysis lab could help researchers, designers and prosthetists advance prosthesis technology and customize devices for individuals. Ultimately, these improvements will result in better prosthetic performance for the military population.
Sedimentary parameters of lower Barataria Bay, Jefferson Parish, Louisiana
Frazier, David E
1960-01-01T23:59:59.000Z
4 Tidal Influx Salinity 7 Longshore and Offshore Currents Normal W'inde and Tropical Storms . . ~. . . ~ ~ . . ~ . ~ ~ 9 Life in Lower Barataria Bay . . . 'i2 Effects of Industry on Sedimentation. . . . . . . 13 Stratigraphy 17 Effects... can generate wind waves capable of placing fine clastic sediments in suspension in the shallow areas of lower Barataria Bay (Dr, B, W. Wilson, A. and M?College ef Texas, personal communication). As shown in Table 1, winds having these velocities...
Self-consistent full wave simulations of lower hybrid waves
Wright, John C.
Self-consistent full wave simulations of lower hybrid waves John C. Wright P. T. Bonoli - MIT E .J for Simulation of Wave-Plasma Interactions L.A. Berry, D.B. Batchelor, E.F. Jaeger, E. D`Azevedo D. Green C. Milanesio #12;3 Outline Â· Introduction to Lower Hybrid waves Â· Modeling LH waves Â Ray tracing Â Full Wave
Efficient Algorithmic Techniques for Several Multidimensional ...
Mugurel
2008-10-23T23:59:59.000Z
Politehnica University of Bucharest, Romania, mugurel.andreica@cs.pub.ro. Abstract: In this paper I present several novel, efficient, algorithmic techniques for.
algorithmics: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...
algorithms: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...
Comprehensive Study of Image Restoration Algorithms.
Zong, Lize
2015-01-01T23:59:59.000Z
??Abstract Comprehensive Study of Image Restoration Algorithms By Lize Zong Master of Science in Electrical Engineering Image restoration is an important part of digital image-processing.… (more)
Trellis Shaping using fast search algorithms
Shee, Lih-En
1994-01-01T23:59:59.000Z
with the Viterbi Algorithm . 1. Trellis Diagram of a Convolutional Code 2. The Viterbi Algorithm . . 3. The Shaping Operation B. Shaping using the Stack Algorithm 1. The Stack Algorithm a. The Code Tree V CONCLUSIONS AND SUGGESTIONS . 12 12 13 14 14 14... of the underlying code, which usually amounts to about 3 to 4 dB. The second component is the The journal model is IEEE Transactions on Automatic Control. shaping gain which is due to the sphericity and the choice of signal constellation used to support...
AN AUGMENTED LAGRANGIAN BASED ALGORITHM FOR ...
2014-07-03T23:59:59.000Z
Let the functions fi and hi be twice continuously differentiable with the fis being strictly convex and the his being convex. If Algorithm 2 is based on constraint ...
Parallel GPU Algorithms for Mechanical CAD
Krishnamurthy, Adarsh
2010-01-01T23:59:59.000Z
of California, Berkeley, Mechanical Engineering Department,GPU Algorithms for Mechanical CAD by Adarsh Krishnamurthy Aof Philosophy in Engineering - Mechanical Engineering in the
Accelerated and Inexact forward-backward algorithms
Silvia Villa
2011-08-17T23:59:59.000Z
Aug 17, 2011 ... Accelerated and Inexact forward-backward algorithms. Silvia Villa (villa ***at*** dima.unige.it) Saverio Salzo (salzo ***at*** disi.unige.it)
Exact Algorithms for Combinatorial Optimization Problems with ...
2012-03-30T23:59:59.000Z
using stochastic objective functions. Potential investment ..... An algorithm to construct a minimum directed spanning tree in a directed network. In. Developments ...
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2014-11-17T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase the qubits' purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of 13C2-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. For example, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
Stojmenovic, Ivan
Operating Systems CSI3131 Lab 4 Winter 2011 Page Replacement Algorithms Objective To use a simulation for evaluating various page replacement algorithms studied in class. Description (Please read to compare the performance of each page replacement algorithm. The constructor of this class contains
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
CS229 Lecture notes Generative Learning algorithms
Kosecka, Jana
analysis (GDA). In this model, we'll assume that p(x|y) is distributed according to a multivariate normal discriminant analysis The first generative learning algorithm that we'll look at is Gaussian discrim- inant. In these notes, we'll talk about a different type of learning algorithm. Consider a classification problem
On Spectral Clustering: Analysis and an algorithm
Weiss, Yair
be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm the top eigenvectors of a matrix derived from the distance between points. Such algorithms have been at a time. One line of analysis makes the link to spectral graph partitioning, in which the sec- #12; ond
Generating Fast Indulgent Algorithms Dan Alistarh1
Paris-Sud XI, UniversitÃ© de
, France Abstract. Synchronous distributed algorithms are easier to design and prove cor- rect than overhead in terms of time complexity in well-behaved executions. Our technique is based on a new. This line of research inspired the introduction of indulgent algo- rithms [1], i.e. algorithms
Face Recognition Algorithms Surpass Humans Matching Faces
Abdi, HervÃ©
over humans, in light of the absolute performance levels of the algorithms, underscores the need systems for security applications. How accurate must a face recognition algorithm be to contribute to these applications? Over the last decade, academic computer vision researchers and commercial product developers have
Hard Thresholding Pursuit Algorithms: Number of Iterations
Hitczenko, Pawel
algorithms do provide alternative methods. We consider here the hard thresholding pursuit (HTP) algorithm [6 us now recall that (HTP) consists in constructing a sequence (xn) of s-sparse vectors, starting absolute entries of xn-1 + A (y - Axn-1 ),(HTP1) xn := argmin{ y - Az 2, supp(z) Sn },(HTP2) until
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
Algorithms in grid classes Ruth Hoffmann
St Andrews, University of
signs c1, . . . , cs and row signs, r1, . . . , rt and let = {(k, ) : Mk, = 0}. The map : GridAlgorithms in grid classes Ruth Hoffmann University of St Andrews, School of Computer Science Permutation Patterns 2013 UniversitÂ´e Paris Diderot 2nd July 2013 Ruth Hoffmann Algorithms in grid classes 1
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
Ris-R-Report FATIGUE EVALUATION ALGORITHMS
Algorithms: Review Division: Materials Research Division Published on the internet July 2010 Risø-R-1740(EN, WISPERX and NEW WISPER load sequences on a Glass/Epoxy multidirectional laminate typical of a wind turbine rotor blade construction. Two versions of the algorithm, the one using single-step and the other using
On Spectral Clustering: Analysis and an algorithm
Andrew Y. Ng; Michael I. Jordan; Yair Weiss
2001-01-01T23:59:59.000Z
Despite many empirical successes of spectral clustering methods -- algorithms that cluster points using eigenvectors of matrices derived from the distances between the points -- there are several unresolved issues. First, there is a wide variety of algorithms that use the eigenvectors in slightly different ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems.
Heatup of the TMI-2 lower head during core relocation
Wang, S.K.; Sienicki, J.J.; Spencer, B.W.
1989-01-01T23:59:59.000Z
An analysis has been carried out to assess the potential of a melting attack upon the reactor vessel lower head and incore instrument nozzle penetration weldments during the TMI core relocation event at 224 minutes. Calculations were performed to determine the potential for molten corium to undergo breakup into droplets which freeze and form a debris bed versus impinging upon the lower head as one or more coherent streams. The effects of thermal-hydraulic interactions between corium streams and water inside the lower plenum, the effects of the core support assembly structure upon the corium, and the consequences of corium relocation by way of the core former region were examined. 19 refs., 24 figs.
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15T23:59:59.000Z
Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.
Tomato Varieties and Fertilizers for the Lower Rio Grand Valley.
Friend, W. H. (William Heartsill)
1931-01-01T23:59:59.000Z
, 1931. **In roopc.ration with U. S. Drpartmcnt of Agriculture. Tomato production is one of the leading truck-gardening enterprises in the Lower Rio Grande VaIley. The annual pro- duction of tomatoes has increased from 946 cars in 1926-27 to 2..., 1931 TOMATO VARIETIES AND FERTILIZERS FOR THE LOWER RIO GRANDE VALLEY W. H. FRIEND The production of tomatoes during the late spring and early summer is one of the most important trucking enterprises of the irrigated por- tions of the counties...
Lower Cost, Higher Performance Carbon Fiber | 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 Office of Inspector General Office0-72.pdfGeorgeDoesn't HappenLow-Cost Production ofModeling AssessmentLower CostLower
Full wave simulations of lower hybrid wave propagation in tokamaks
Wright, John C.
Full wave simulations of lower hybrid wave propagation in tokamaks J. C. Wright , P. T. Bonoli , C hybrid (LH) waves have the attractive property of damping strongly via electron Landau resonance. Consequently these waves are well-suited to driving current in the plasma periphery where the electron
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Hernandez, Manuel
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called ?colonias...
WATER COMMODIFICATION IN THE LOWER RIO GRANDE VALLEY, TEXAS
Garcia, Bianca 1989-
2011-05-06T23:59:59.000Z
The lower Rio Grande Valley of Texas is one of the poorest regions with the largest population lacking suitable water supply in the entire United States. The region is characterized by low-income, rural and peri-urban communities called colonias...
THE DISCOVERY OF LOWER ACICULAR FERRITE 10.1 INTRODUCTION
Cambridge, University of
CHAPTER 10 THE DISCOVERY OF LOWER ACICULAR FERRITE 10.1 INTRODUCTION There is general agreement that a weld microstructure primarily containing acicu- lar ferrite will exhibit high strength and excellent of allotriomorphic ferrite, ferrite plates with aligned carbides, or grain-boundary nucleated bainite is considered
Accessibility for lower hybrid waves in PBX-M
Takahashi, H.; Bell, R.; Bernabei, S.; Chance, M.; Chu, T.K.; Gettelfinger, G.; Greenough, N.; Hatcher, R.; Ignat, D.; Jardin, S.; Kaita, R.; Kaye, S.; Kugel, H.; LeBlanc, B.; Manickam, J.; Okabayashi, M.; Ono, M.; Paul, S.; Perkins, F.; Sauthoff, N.; Sesnic, S.; Sun, Y.; Tighe, W.; Valeo, E.; von Goeler, S. (Princeton Univ., NJ (United States). Plasma Physics Lab.); Batha, S.; Levinton, F. (Fusion Physics and Technology
1993-07-01T23:59:59.000Z
Understanding the wave damping mechanism in the presence of a spectral gap' is an important issue for the current profile control using Lower Hybrid Current Drive (LHCD). The authors examine a traditional explanation based upon upshifting of the wave parallel refractive index (n[sub [parallel
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
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
Lower bounding procedure for the Asymmetric Quadratic Traveling ...
2015-02-04T23:59:59.000Z
a lower bound is to linearize the quadratic terms xijxjk for all (i, j),(j, k) ? A ..... Consider any cycle C. Since column Cp is the selected column to enter the basis we ..... some kind of subtour elimination constraint, we restrict the search to find a
Fuel Cell Tax Incentives: How Monetization Lowers the
for electricity produced and sold by a qualified facility for a 5- or 10-year period. o Currently 2.1 cent or 1Fuel Cell Tax Incentives: How Monetization Lowers the Government Outlay By: Lee J. Peterson, Esq.48-9(a)(1). 5R G Building Business Value February 19, 2009 #12;How Do Tax Credits Minimize Government
INTRODUCTION Extraction of granite from lower crust, and its
Solar, Gary S.
INTRODUCTION Extraction of granite from lower crust, and its emplacement at shallower levels, is the principal mechanism by which the continents have be- come differentiated. Thus, understanding how granite orogenic belts spatial and tem- poral relationships between granite and regional tectonic structures
Lower Granite Dam Smolt Monitoring Program, 2000 Annual Report.
Morrill, Charles; Ross, Doug; Mensik, Fred
2000-01-01T23:59:59.000Z
The 2000 fish collection season at Lower Granite was characterized by lower than average spring flows and spill, low levels of debris, cool water temperatures, increased unclipped yearling and subyearling chinook smolts, and 8,300,546 smolts collected and transported compared to 5,882,872 in 1999. With the continued release of unclipped supplementation chinook and steelhead above Lower Granite Dam, we can no longer accurately distinguish wild chinook, steelhead, and sockeye/kokanee in the sample. Although some table titles in this report still show ''wild'' column headings, the numbers in these columns for 1999 and 2000 include wild and unclipped hatchery origin smolts. The increases over previous years reflect the increased supplementation. A total of 8,300,546 juvenile salmonids were collected at Lower Granite Dam. Of these, 187,862 fish were bypassed back to the river and 7,950,648 were transported to release sites below Bonneville Dam, 7,778,853 by barge and 171,795 by truck. A total of 151,344 salmonids were examined in daily samples. Nine research projects conducted by four agencies impacted a total of 1,361,006 smolts (16.4% of the total collection).
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA
PREDICTIVE YASIR: HIGH SECURITY WITH LOWER LATENCY IN LEGACY SCADA A Thesis Submitted Technical Report TR2010-665 #12;Abstract Message authentication with low latency is necessary to ensure- tication solutions by our lab and others looked at single messages and incurred no- ticeable latency
RECOMMENDED TREES FOR MICHIGAN'S LOWER PENINSULA American Hornbeam
Isaacs, Rufus
slower to establish. Native to Michigan and eastern U.S. Pests: Prone to ice damage. Two-line chestnut bore can be a problem when plants are stressed DEPARTMENT OF HORTICULTURE Michigan State University Michigan State University #12;RECOMMENDED TREES FOR MICHIGAN'S LOWER PENINSULA DEPARTMENT OF HORTICULTURE
An evaluation of lower back support devices for females
Wilson, Kathleen Florence
1989-01-01T23:59:59.000Z
, Fleischer and Villalobos, 1989) was used to calculate the forces on the lower back. Other items included a tape recorder which was used to alert the subject when to prepare for the lift and also when to perform the lift. A sphygmomanometer measured...
Selfconsistent full wave simulations of lower hybrid waves
Wright, John C.
Selfconsistent full wave simulations of lower hybrid waves John C. Wright P. T. Bonoli MIT E .J. Porkolab Sherwood/Spring APS Denver May 2009 #12; 2 Participants in the Center for Simulation of Wave hybrid (LH) waves have the attractive property of damping strongly via electron Landau resonance
Citrus Variety Trends in the Lower Rio Grande Valley.
Alderman, D. C. (DeForest Charles)
1951-01-01T23:59:59.000Z
Citrus Variety Trends in the Lower Rio Grande Valley CONTENTS ......................................................................................................... Digest ...... 3... thousands of citrus trees and the growers were faced with a tremendous replanting program, which, in turn, had focused interest on varieties. Fruit production figures, yields per acre, and monetary returns per acre for five varieties of grapefruit...
"Eztrack": A single-vehicle deterministic tracking algorithm
Carrano, C J
2007-12-20T23:59:59.000Z
A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we designed our own simple approach in IDL which is a deterministic, motion-guided object tracker. The object tracking relies both on object features and path dynamics. The algorithm certainly has room for future improvements, but we have found it to be a useful tool in evaluating effects of frame-rate, resolution/GSD, and spectral content (eg. grayscale vs. color imaging ). A block diagram of the tracking approach is given in Figure 1. We describe each of the blocks of the diagram in the upcoming sections.
QCDLAB: Designing Lattice QCD Algorithms with MATLAB
Artan Borici
2006-10-09T23:59:59.000Z
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses the Schwinger model on the lattice, a great simplification, which shares many features and algorithms with lattice QCD. A typical computing project using QCDLAB is characterised by short codes, short run times, and the ability to make substantial changes in a few seconds. QCDLAB 1.0 can be downloaded from the QCDLAB project homepage {\\tt http://phys.fshn.edu.al/qcdlab.html}.
Algorithms for optimal dyadic decision trees
Hush, Don [Los Alamos National Laboratory; Porter, Reid [Los Alamos National Laboratory
2009-01-01T23:59:59.000Z
A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.
New Design Methods and Algorithms for Multi-component Distillation...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
New Design Methods and Algorithms for Multi-component Distillation Processes New Design Methods and Algorithms for Multi-component Distillation Processes multicomponent.pdf More...
Sandia National Laboratories: High-Resolution Computational Algorithms...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
WindHigh-Resolution Computational Algorithms for Simulating Offshore Wind Farms High-Resolution Computational Algorithms for Simulating Offshore Wind Farms This Sandia National...
New Algorithm Enables Fast Simulations of Ultrafast Processes
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
reduces the computational cost and increases the speed of the simulations. Comparing the new algorithm with the old, slower algorithm yields similar results, e.g., the predicted...
A Fast Algorithm for Total Variation Image Reconstruction from ...
2010-01-12T23:59:59.000Z
we propose, analyze, and test a fast alternating minimization algorithm for image ... The per-iteration cost of the proposed algorithm involves a linear time.
A Criterion Space Search Algorithm for Biobjective Mixed Integer ...
2015-01-08T23:59:59.000Z
We present the first criterion space search algorithm, the triangle splitting algorithm, for finding ... In this paper, we continue our pursuit of criterion space search.
a nonstandard simplex algorithm for linear programming 1.
2008-12-29T23:59:59.000Z
Ten Algorithms in the Twenty Century (IEEE2002), it is one of the most famous and ... Section 3 formulas the proposed nonstandard algorithm. Section 4 deals ...
algorithm population sizing: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
CiteSeer Summary: Deciding the appropriate population size and number of islands for distributed island-model genetic algorithms is often critical to the algorithms success. This...
alternative learning algorithms: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
(or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm...
Scheduling and allocation algorithm for an elliptic filter
Marikkannan, Sangeetha
2012-01-01T23:59:59.000Z
A new evolutionary algorithm for scheduling and allocation algorithm is developed for an elliptic filter. The elliptic filter is scheduled and allocated in the proposed work which is then compared with the different scheduling algorithms like As Soon As Possible algorithm, As Late As Possible algorithm, Mobility Based Shift algorithm, FDLS, FDS and MOGS. In this paper execution time and resource utilization is calculated using different scheduling algorithm for an Elliptic Filter and reported that proposed Scheduling and Allocation increases the speed of operation by reducing the control step. The proposed work to analyse the magnitude, phase and noise responses for different scheduling algorithm in an elliptic filter.
Dynamic Fuzzy Logic Control of GeneticAlgorithm Probabilities.
Feng, Yi
2008-01-01T23:59:59.000Z
?? Genetic algorithms are commonly used to solve combinatorial optimizationproblems. The implementation evolves using genetic operators (crossover, mutation,selection, etc.). Anyway, genetic algorithms like some other… (more)
adaptive control algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
24 25 Next Page Last Page Topic Index 1 ON AN ADAPTIVE CONTROL ALGORITHM FOR ADAPTIVE OPTICS APPLICATIONS Mathematics Websites Summary: ON AN ADAPTIVE CONTROL ALGORITHM FOR...
Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques
Boyer, Edmond
Carlo adaptatives par Jérome Lelong Adaptive Monte Carlo methods are powerful variance reduction a randomly truncated stochastic algorithm. Finally, we apply this technique to the valuation of nancial deri
Optimized quantum random-walk search algorithms
V. Potocek; A. Gabris; T. Kiss; I. Jex
2008-12-12T23:59:59.000Z
Shenvi, Kempe and Whaley's quantum random-walk search (SKW) algorithm [Phys. Rev. A 67, 052307 (2003)] is known to require $O(\\sqrt N)$ number of oracle queries to find the marked element, where $N$ is the size of the search space. The overall time complexity of the SKW algorithm differs from the best achievable on a quantum computer only by a constant factor. We present improvements to the SKW algorithm which yield significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached. We point out which improvement can be applied if there is more than one marked element to find.
IIR algorithms for adaptive line enhancement
David, R.A.; Stearns, S.D.; Elliott, G.R.; Etter, D.M.
1983-01-01T23:59:59.000Z
We introduce a simple IIR structure for the adaptive line enhancer. Two algorithms based on gradient-search techniques are presented for adapting the structure. Results from experiments which utilized real data as well as computer simulations are provided.
Jun. 6, 2013 BBM 202 -ALGORITHMS
Erdem, Erkut
that would create a clockwise turn. 11 aham scan. Choose point p with smallest (or largest) y that would create a clockwise turn. aham scan algorithm p an. e point p with smallest (or largest) y
Universality in algorithmic self-assembly.
Summers, Scott
2010-01-01T23:59:59.000Z
??Tile-based self-assembly is a model of "algorithmic crystal growth" in which square "tiles" represent molecules that bind to each other via specific and variable-strength bonds… (more)
SPEEDING UP DYNAMIC SHORTEST PATH ALGORITHMS Finding ...
2003-09-19T23:59:59.000Z
Sep 19, 2003 ... ... and Reps algorithm for updating a shortest path tree, which is a revision of ... tree, although it can be easily specialized for updating a tree [5].
Quantum Robot: Structure, Algorithms and Applications
Dao-Yi Dong; Chun-Lin Chen; Chen-Bin Zhang; Zong-Hai Chen
2005-06-18T23:59:59.000Z
A kind of brand-new robot, quantum robot, is proposed through fusing quantum theory with robot technology. Quantum robot is essentially a complex quantum system and it is generally composed of three fundamental parts: MQCU (multi quantum computing units), quantum controller/actuator, and information acquisition units. Corresponding to the system structure, several learning control algorithms including quantum searching algorithm and quantum reinforcement learning are presented for quantum robot. The theoretic results show that quantum robot can reduce the complexity of O(N^2) in traditional robot to O(N^(3/2)) using quantum searching algorithm, and the simulation results demonstrate that quantum robot is also superior to traditional robot in efficient learning by novel quantum reinforcement learning algorithm. Considering the advantages of quantum robot, its some potential important applications are also analyzed and prospected.
The Linear Complementarity Problem, Lemke Algorithm ...
2011-03-01T23:59:59.000Z
... the known cases for which the algorithm works is restricted to problems LCP(q, M) in which M belongs to ..... A directed path along solid edges leads to.
Algorithmic Decision Theory and the Smart Grid
professionals #12;8 Algorithmic Decision Theory Â·First International Conference on ADT, Venice 2009. Â·Second are borrowed from a presentation by Gil Bindewald of the Dept. of Energy to the SIAM Science Policy Committee
Large scale prediction models and algorithms
Monsch, Matthieu (Matthieu Frederic)
2013-01-01T23:59:59.000Z
Over 90% of the data available across the world has been produced over the last two years, and the trend is increasing. It has therefore become paramount to develop algorithms which are able to scale to very high dimensions. ...
subspace accelerated matrix splitting algorithms for bound ...
2011-09-28T23:59:59.000Z
Their algorithm uses a projected gradient search in the first phase ..... eration is generally superior to a projected gradient iteration in terms of identifying an optimal ..... Once the subspace step has been computed, we enter Step 3 and compute.
Implementing Shor's algorithm on Josephson charge qubits
Vartiainen, Juha J.; Salomaa, Martti M. [Materials Physics Laboratory, POB 2200 (Technical Physics), Helsinki University of Technology, FIN-02015 HUT (Finland); Niskanen, Antti O. [VTT Information Technology, Microsensing, POB 1207, 02044 VTT (Finland); Nakahara, Mikio [Materials Physics Laboratory, POB 2200 (Technical Physics), Helsinki University of Technology, FIN-02015 HUT (Finland); Department of Physics, Kinki University, Higashi-Osaka 577-8502 (Japan)
2004-07-01T23:59:59.000Z
We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits are available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.
A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
algorithm is based on a procedure whose input is a homogeneous system of linear ..... In this case s = 0 and the procedure sets the output vector yout to 0.
Advanced CHP Control Algorithms: Scope Specification
Katipamula, Srinivas; Brambley, Michael R.
2006-04-28T23:59:59.000Z
The primary objective of this multiyear project is to develop algorithms for combined heat and power systems to ensure optimal performance, increase reliability, and lead to the goal of clean, efficient, reliable and affordable next generation energy systems.
Quantum Algorithms for Element Distinctness Harry Buhrman
Magniez, FrÃ©dÃ©ric
Quantum Algorithms for Element Distinctness Harry Buhrman Christoph DÂ¨urr Mark HeiligmanÂ§ Peter, France. Email: durr@lri.fr. Â§NSA, Suite 6111, Fort George G. Meade, MD 20755, USA. Email: mheilig
Quantum Algorithms for Element Distinctness Harry Buhrman
de Wolf, Ronald
Quantum Algorithms for Element Distinctness Harry BuhrmanÂ£ Christoph DÂ¨urrÃ? Mark HeiligmanÃ? Peter, France. Email: durr@lri.fr. Ã?NSA, Suite 6111, Fort George G. Meade, MD 20755, USA. Email: mheilig
Lowering the threshold in the DAMA dark matter detector
Kelso, Chris [Department of Physics and Astronomy, University of Utah, Salt Lake City, Utah 84112 (United States)
2014-06-24T23:59:59.000Z
We look at two improvements related to the DAMA/LIBRA dark matter detector. We show how using a more optimized binning scheme of the current data can lead to significantly tighter contraints on the compatible regions of the WIMP parameter space. In addition, the PMT’s of the detector were upgraded in 2010, allowing the low energy threshold to be lowered from 2 keVee to 1 keVee. We examine the implications for the dark matter interpretion of the DAMA modulation with data in this new energy region. Specifically, we focus on how well the degeneracy between the low mass and high mass regions can be removed by this new data. We find that the lower threshold data should rule out one of the two mass ranges in the spin-independent case at a minimum of the 2.6? level in the worst case scenario.
An Algorithmic Approach to Heterotic String Phenomenology
Yang-Hui He
2010-01-14T23:59:59.000Z
We briefly review the recent programme to construct, systematically and algorithmically, large classes of heterotic vacua, as well as the search for the MSSM therein. Specifically, we outline the monad construction of vector bundles over complete intersection Calabi-Yau threefolds, their classification, stability, equivariant cohomology and subsequent relevance to string phenomenology. It is hoped that this top-down algorithmic approach will isolate special corners in the heterotic landscape.
Dynamic Algorithm for Space Weather Forecasting System
Fischer, Luke D.
2011-08-08T23:59:59.000Z
for the designation as UNDERGRADUATE RESEARCH SCHOLAR April 2010 Major: Nuclear Engineering DYNAMIC ALGORITHM FOR SPACE WEATHER FORECASTING SYSTEM A Junior Scholars Thesis by LUKE DUNCAN FISCHER Submitted to the Office of Undergraduate... 2010 Major: Nuclear Engineering iii ABSTRACT Dynamic Algorithm for Space Weather Forecasting System. (April 2010) Luke Duncan Fischer Department of Nuclear Engineering Texas A&M University Research Advisor: Dr. Stephen Guetersloh...
Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets
M. Nyfeler; F. -J. Jiang; F. Kämpfer; U. -J. Wiese
2008-03-25T23:59:59.000Z
Simulations of frustrated quantum antiferromagnets suffer from a severe sign problem. We solve the ergodicity problem of the loop-cluster algorithm in a natural way and apply a powerful strategy to address the sign problem. For the spin 1/2 Heisenberg antiferromagnet on a kagome and on a frustrated square lattice, a nested cluster algorithm eliminates the sign problem for large systems. The method is applicable to general lattice geometries but limited to moderate temperatures.
A fast indexing algorithm for sparse matrices
Nieder, Alvin Edward
1971-01-01T23:59:59.000Z
A FAST INDEXING ALGORITHM FOR SPARSE MATRICES A Thesis ALVIN EDWARD NIEDER Submitted to the Graduate College of Texas Algal University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE December 1/71 Major Subject... INDEXING ALGORITHM FOR SPARSE MATRICES (December, 1/71) Alvin Edward Nieder B. S. , Texas AEZ University Directed by: Dr. Udo Pooch A sparse matrix is defined to be a matrix con- taining a high proportion of elements that are zeros. Sparse matrices...
Oxygen enhanced switching to combustion of lower rank fuels
Kobayashi, Hisashi; Bool III, Lawrence E.; Wu, Kuang Tsai
2004-03-02T23:59:59.000Z
A furnace that combusts fuel, such as coal, of a given minimum energy content to obtain a stated minimum amount of energy per unit of time is enabled to combust fuel having a lower energy content, while still obtaining at least the stated minimum energy generation rate, by replacing a small amount of the combustion air fed to the furnace by oxygen. The replacement of oxygen for combustion air also provides reduction in the generation of NOx.
Citrus Varieties for the Lower Rio Grande Valley.
Wood, J. F. (John Fielding); Friend, W. H. (William Heartsill)
1941-01-01T23:59:59.000Z
Lf BRARY, /A & NI COLLEGE, b TEXAS AGRICULTURAL EXPERIMENT STATION A. B. CONNER, DIRECTOR, College Station, Texas CITRUS VARIETIES FOR THE LOWER RIO GRANDE VALLEY Mr. H. FRIEND AND J. F. WOOD Division of Horticulture LIBRARY \\gxict... perishable nature of this type of fruit. Limes and lemons may be grown by persons who are financially able to equip their orchards with heaters. There are many types of citrus fruits that may be grown as ornamentals or for special purposes, but none...
Nonlinear lower-hybrid oscillations in cold plasma
Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Calcutta 700 064 (India); Sengupta, Sudip [Institute of Plasma Research, Bhat, Gandhinagar 382428 (India)
2010-08-15T23:59:59.000Z
In a fluid description nonlinear lower-hybrid oscillation have been studied in a cold quasineutral magnetized plasma using Lagrangian variables. An exact analytical solution with nontrivial space and time dependence is obtained. The solution demonstrates that under well defined initial and boundary conditions the amplitude of the oscillations increases due to nonlinearity and then comes back to its initial condition again. These solutions indicate a class of nonlinear transient structures in magnetized plasma.
Lower East Fork Poplar Creek | Department of Energy
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 RankCombustion | Department of Energy Low-Temperature Combustion DemonstratorEast Fork Poplar Creek Lower
Lower Colorado River Authority LCRA | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data CenterFranconia, Virginia: Energy Resources Jump to:46 - 429Lacey,(MonasterLowell Point, Alaska: Energy Resources Jump to:Lowell,Lower
Environmental audit, Bonneville Power Administration, lower Columbia area
Not Available
1990-11-01T23:59:59.000Z
This report documents the results of the US Department of Energy's (DOE's) Environmental Audit conducted by the DOE Headquarters Office of Environmental Audit within the Bonneville Power Administration's (BPA's) Lower Columbia Area. The BPA facilities included in the Audit are the Ross Complex in Vancouver, Washington; the substations of North Bonneville, North Bonneville Annex, Camas, and Longview within the state of Washington; and the Acton and Troutdale Substations within the state of Oregon. The independent Audit was conducted by a team of professionals from DOE and contractors. The purpose of the Audit is to provide the Secretary of Energy, Admiral James D. Watkins, Ret., with the status of environmental programs within BPA's Lower Columbia Area. The Environmental Audit team identified 25 findings dealing with the lack of conformance with federal and state laws and regulations and DOE Orders, and 7 findings in which BMPs were not attained. Although all findings require corrective action, none required cessation of operations or reflect situations that present an immediate risk to public health or the environment. The Audit team noted inadequacies in PCB management included storage, labeling, reporting, and spill control. The most significant causal factors for the findings include lack of policy implementation throughout the Lower Columbia Area, inadequate training of personnel charged with environmental protection, lack of standard operating procedures for many programs, lack of reviews and appraisals, and an inaccurate perception of low risk for environmental concerns.
Lower Columbia River Terminal Fisheries Research Project : Final Environmental Assessment.
United States. Bonneville Power Administration.
1995-04-01T23:59:59.000Z
This notice announces BPA`S`s decision to fund the Oregon Department of Fish and Wildlife (ODFW), the Washington Department of Fish and Wildlife (WDFW), and the Clatsop Economic Development Committee for the Lower Columbia River Terminal Fisheries Research Project (Project). The Project will continue the testing of various species/stocks, rearing regimes, and harvest options for terminal fisheries, as a means to increase lower river sport and commercial harvest of hatchery fish, while providing both greater protection of weaker wild stocks and increasing the return of upriver salmon runs to potential Zone 6 Treaty fisheries. The Project involves relocating hatchery smolts to new, additional pen locations in three bays/sloughs in the lower Columbia River along both the Oregon and Washington sides. The sites are Blind Slough and Tongue Point in Clatsop County, Oregon, and Grays Bay/Deep River, Wahkiakum County, Washington. The smolts will be acclimated for various lengths of time in the net pens and released from these sites. The Project will expand upon an existing terminal fisheries project in Youngs Bay, Oregon. The Project may be expanded to other sites in the future, depending on the results of this initial expansion. BPA`S has determined the project is not a major Federal action significantly affecting the quality of the human environment, within the meaning of the National Environmental Policy Act (NEPA) of 1969. Therefore, the preparation of an environmental impact statement is not required, and BPA`S is issuing this FONSI.
A lower cost development path for heavy ion fusion
Hogan, W.J. [Lawrence Livermore National Lab., CA (United States); Meier, W.R. [Shafer (W.J.) Associates, Inc., Wakefield, MA (United States)
1993-05-19T23:59:59.000Z
If two features of the inertial fusion process are exploited successfully, they can lead to significantly lower costs for demonstrating the feasibility of commercial electric power production from this source of energy. First, fusion capsule ignition and burn physics is independent of reaction chamber size and hydrodynamically-equivalent capsules can be designed to perform at small yield, exactly as they do at large yield. This means that an integrated test of all power plant components and feasibility tests of various reaction chamber concepts can be done at much smaller sizes (about 1--2 m first wall radius) and much lower powers (tens of MWs) than magnetic fusion development facilities such as ITER. Second, the driver, which is the most expensive component of currently conceived IFE development facilities, can be used to support more than one experiment target chamber/reactor (simultaneously and/or sequentially). These two factors lead to lower development facility costs, modular facilities, and the planning flexibility to spread costs over time or do several things in parallel and thus shorten the total time needed for development of Inertial Fusion Energy (IFE). In this paper the authors describe the general feature of a heavy ion fusion development plan that takes advantage of upgradable accelerators and the ability to test chambers and reactor systems at small scale in order to reduce development time and costs.
A Real-Time Soft Shadow Volume Algorithm
Assarsson, Ulf
algorithm to generate the hard shadows (umbra). The second pass compensates to provide the softness (penum
An Energy Complexity Model for Algorithms Swapnoneel Roy
Rudra,, Atri
An Energy Complexity Model for Algorithms Swapnoneel Roy Department of CSE University at Buffalo by the importance of energy and algorithmic complexity models do not capture the energy consumed by an algorithm. In this paper, we propose a new complexity model to ac- count for the energy used by an algorithm. Based
A GENERALIZATION OF THE DEUTSCH-JOZSA QUANTUM ALGORITHM
Tam, Tin-Yau
A GENERALIZATION OF THE DEUTSCH-JOZSA QUANTUM ALGORITHM Randall R. Holmes and Frederic Texier of functions on a finite abelian group. The algorithm is patterned after and generalizes one due to Deutsch of the integers modulo two. The Deutsch-Jozsa algorithm is a quantum algorithm for distinguishing between two
Nonlinear lower hybrid oscillations in a cold viscous plasma
Maity, Chandan; Chakrabarti, Nikhil [Saha Institute of Nuclear Physics, 1/AF Bidhannagar, Kolkata-700064 (India)
2011-12-15T23:59:59.000Z
An analytical description of nonlinear lower hybrid oscillations in a cold quasi-neutral plasma in the presence of viscosity is presented in one spatial dimension by using Lagrangian variables. By treating viscosity coefficients of the electron and ion fluids as inversely proportional to their respective densities, an exact solution is obtained. It is found that the damping rate of such oscillations is directly proportional to the effective viscosity coefficients of electron and ion fluids. A possible implication of such solutions is briefly outlined.
Lower Cost Carbon Fiber Precursors | 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 Office of Inspector General Office0-72.pdfGeorgeDoesn't HappenLow-Cost Production ofModeling AssessmentLower Cost
ARM - Field Campaign - Lower Atmospheric Boundary Layer Experiment
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLasDeliveredÂ‰PNGExperience4AJ01)3,CloudgovCampaignsIR CloudgovCampaignsLower Atmospheric
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces and InterfacesAdministration -Lowell L. Wood, 1981 The ErnestLower
Vietnam-Lowering Emissions in Asia's Forests (LEAF) | Open 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 Office of InspectorConcentrating SolarElectric Coop,Save Energy NowNew HampshireValeroTransInformation Lowering
Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore's Law
Palem, Krishna V.
Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore opportunities for being energy-aware, the most fundamental limits are truly rooted in the physics of energy of models of computing for energy-aware al- gorithm design and analysis, culminating in establishing
Paris-Sud XI, UniversitÃ© de
Bayesian Policy Gradient and Actor-Critic Algorithms Bayesian Policy Gradient and Actor Yaakov Engel yakiengel@gmail.com Editor: Abstract Policy gradient methods are reinforcement learning algorithms that adapt a param- eterized policy by following a performance gradient estimate. Many
High rate pulse processing algorithms for microcalorimeters
Rabin, Michael [Los Alamos National Laboratory; Hoover, Andrew S [Los Alamos National Laboratory; Bacrania, Mnesh K [Los Alamos National Laboratory; Tan, Hui [XIA-LLC; Breus, Dimitry [XIA-LLC; Henning, Wolfgang [XIA-LLC; Sabourov, Konstantin [XIA-LLC; Collins, Jeff [XAI-LLC; Warburton, William K [XIA-LLC; Dorise, Bertrand [NIST; Ullom, Joel N [NIST; [NON LANL
2009-01-01T23:59:59.000Z
It has been demonstrated that microcalorimeter spectrometers based on superconducting transition-edge-sensor can readily achieve sub-100 eV energy resolution near 100 keV. However, the active volume of a single microcalorimeter has to be small to maintain good energy resolution, and pulse decay times are normally in the order of milliseconds due to slow thermal relaxation. Consequently, spectrometers are typically built with an array of microcalorimeters to increase detection efficiency and count rate. Large arrays, however, require as much pulse processing as possible to be performed at the front end of the readout electronics to avoid transferring large amounts of waveform data to a host computer for processing. In this paper, they present digital filtering algorithms for processing microcalorimeter pulses in real time at high count rates. The goal for these algorithms, which are being implemented in the readout electronics that they are also currently developing, is to achieve sufficiently good energy resolution for most applications while being (a) simple enough to be implemented in the readout electronics and (b) capable of processing overlapping pulses and thus achieving much higher output count rates than the rates that existing algorithms are currently achieving. Details of these algorithms are presented, and their performance was compared to that of the 'optimal filter' that is the dominant pulse processing algorithm in the cryogenic-detector community.
Adaptive Scheduling Algorithms for Planet Searches
Eric B. Ford
2007-12-17T23:59:59.000Z
High-precision radial velocity planet searches have surveyed over ~2000 nearby stars and detected over ~200 planets. While these same stars likely harbor many additional planets, they will become increasingly challenging to detect, as they tend to have relatively small masses and/or relatively long orbital periods. Therefore, observers are increasing the precision of their observations, continuing to monitor stars over decade timescales, and also preparing to survey thousands more stars. Given the considerable amounts of telescope time required for such observing programs, it is important use the available resources as efficiently as possible. Previous studies have found that a wide range of predetermined scheduling algorithms result in planet searches with similar sensitivities. We have developed adaptive scheduling algorithms which have a solid basis in Bayesian inference and information theory and also are computationally feasible for modern planet searches. We have performed Monte Carlo simulations of plausible planet searches to test the power of adaptive scheduling algorithms. Our simulations demonstrate that planet searches performed with adaptive scheduling algorithms can simultaneously detect more planets, detect less massive planets, and measure orbital parameters more accurately than comparable surveys using a non-adaptive scheduling algorithm. We expect that these techniques will be particularly valuable for the N2K radial velocity planet search for short-period planets as well as future astrometric planet searches with the Space Interferometry Mission which aim to detect terrestrial mass planets.
Axiomatic Tools versus Constructive approach to Unconventional Algorithms
Gordana Dodig-Crnkovic; Mark Burgin
2012-07-03T23:59:59.000Z
In this paper, we analyze axiomatic issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms changed the algorithmic universe, making it open and allowing increased flexibility and creativity. However, the greater power of new types of algorithms also brought the greater complexity of the algorithmic universe, demanding new tools for its study. That is why we analyze new powerful tools brought forth by the axiomatic theory of algorithms, automata and computation.
Penetration of lower hybrid current drive waves in tokamaks
Horton, W. [The University of Texas at Austin, Austin, Texas 78712 (United States) [The University of Texas at Austin, Austin, Texas 78712 (United States); Aix-Marseille University, 58, Bd Charles Livon, 13284 Marseille (France); Goniche, M.; Peysson, Y.; Decker, J.; Ekedahl, A.; Litaudon, X. [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France)] [CEA, IRFM, F-13108 Saint-Paul-Lez Durance (France)
2013-11-15T23:59:59.000Z
Lower hybrid (LH) ray propagation in toroidal plasma is shown to be controlled by combination of the azimuthal spectrum launched by the antenna, the poloidal variation of the magnetic field, and the scattering of the waves by the drift wave fluctuations. The width of the poloidal and radial radio frequency wave spectrum increases rapidly as the rays penetrate into higher density and scatter from the drift waves. The electron temperature gradient (ETG) spectrum is particularly effective in scattering the LH waves due to its comparable wavelengths and phase velocities. ETG turbulence is also driven by the radial gradient of the electron current profile giving rise to an anomalous viscosity spreading the LH driven plasma currents. The LH wave scattering is derived from a Fokker-Planck equation for the distribution of the ray trajectories with diffusivities derived from the drift wave fluctuations. The condition for chaotic diffusion for the rays is derived. The evolution of the poloidal and radial mode number spectrum of the lower hybrid waves are both on the antenna spectrum and the spectrum of the drift waves. Antennas launching higher poloidal mode number spectra drive off-axis current density profiles producing negative central shear [RS] plasmas with improved thermal confinement from ETG transport. Core plasma current drive requires antennas with low azimuthal mode spectra peaked at m = 0 azimuthal mode numbers.
Conjugate gradient algorithms using multiple recursions
Barth, T.; Manteuffel, T.
1996-12-31T23:59:59.000Z
Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.
MATLAB tensor classes for fast algorithm prototyping.
Bader, Brett William; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)
2004-10-01T23:59:59.000Z
Tensors (also known as mutidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to psychometrics. We describe four MATLAB classes for tensor manipulations that can be used for fast algorithm prototyping. The tensor class extends the functionality of MATLAB's multidimensional arrays by supporting additional operations such as tensor multiplication. The tensor as matrix class supports the 'matricization' of a tensor, i.e., the conversion of a tensor to a matrix (and vice versa), a commonly used operation in many algorithms. Two additional classes represent tensors stored in decomposed formats: cp tensor and tucker tensor. We descibe all of these classes and then demonstrate their use by showing how to implement several tensor algorithms that have appeared in the literature.
Quantum search algorithms on the hypercube
Birgit Hein; Gregor Tanner
2009-06-17T23:59:59.000Z
We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi, Kempe and Whaley. We show that there exists a whole class of quantum search algorithms in the symmetry reduced space which perform a search of a marked vertex in time of order $\\sqrt{N}$ where $N = 2^n$, the number of vertices. In analogy to Grover's algorithm, the spatial search is effectively facilitated through a rotation in a two-level sub-space of the full Hilbert space. In the hypercube, these two-level systems are introduced through avoided crossings. We give estimates on the quantum states forming the 2-level sub-spaces at the avoided crossings and derive improved estimates on the search times.
Pinning impulsive control algorithms for complex network
Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China)] [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); Lü, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)] [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China)] [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)] [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)
2014-03-15T23:59:59.000Z
In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.
The Georgi Algorithms of Jet Clustering
Shao-Feng Ge
2014-08-30T23:59:59.000Z
We reveal the direct link between the jet clustering algorithms recently proposed by Howard Georgi and parton shower kinematics, providing sound support from the theoretical side. The kinematics of this class of elegant algorithms is explored systematically and the jet function is generalized to $J^{(n)}_\\beta$ with a jet function index $n$. Based on three basic requirements that the result of jet clustering is process-independent, for softer subjets the inclusion cone is larger, and that the cone size cannot be too large in order to avoid mixing different jets, we derive constraints on the jet function index $n$ and the jet function parameter $\\beta$ which are closely related to phase space boundaries. Finally, we demonstrate that the jet algorithm is boost invariant.
http://www.energy.gov/media/F...Biofuels_Lower_Gas_Prices.pdf...
Broader source: Energy.gov (indexed) [DOE]
http:www.energy.govmediaF...BiofuelsLowerGasPrices.pdf http:www.energy.govmediaF...BiofuelsLowerGasPrices.pdf http:www.energy.govmediaF...BiofuelsLowerGasPrice...
An Invitation to Algorithmic Information Theory
G. J. Chaitin
1996-09-17T23:59:59.000Z
I'll outline the latest version of my limits of math course. The purpose of this course is to illustrate the proofs of the key information-theoretic incompleteness theorems of algorithmic information theory by means of algorithms written in a specially designed version of LISP. The course is now written in HTML with Java applets, and is available at http://www.research.ibm.com/people/c/chaitin/lm . The LISP now used is much friendlier than before, and because its interpreter is a Java applet it will run in the Netscape browser as you browse my limits of math Web site.
Graph algorithms in the titan toolkit.
McLendon, William Clarence, III; Wylie, Brian Neil
2009-10-01T23:59:59.000Z
Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.
Pathway to a lower cost high repetition rate ignition facility
Obenschain, S.P.; Colombant, D.G.; Schmitt, A.J.; Sethian, J.D.; McGeoch, M. W. [Plasma Physics Division, U.S. Naval Research Laboratory, Washington, D.C. 20375 (United States); Plex LLC, Brookline, Massachusetts 02446-5478 (United States)
2006-05-15T23:59:59.000Z
An approach to a high-repetition ignition facility based on direct drive with the krypton-fluoride laser is presented. The objective is development of a 'Fusion Test Facility' that has sufficient fusion power to be useful as a development test bed for power plant materials and components. Calculations with modern pellet designs indicate that laser energies well below a megajoule may be sufficient. A smaller driver would result in an overall smaller, less complex and lower cost facility. While this facility might appear to have most direct utility to inertial fusion energy, the high flux of neutrons would also be able to address important issues concerning materials and components for other approaches to fusion energy. The physics and technological basis for the Fusion Test Facility are presented along with a discussion of its applications.
Accessibility for lower hybrid waves in PBX-M
Takahashi, H.; Bell, R.; Bernabei, S.; Chance, M.; Chu, T.K.; Gettelfinger, G.; Greenough, N.; Hatcher, R.; Ignat, D.; Jardin, S.; Kaita, R.; Kaye, S.; Kugel, H.; LeBlanc, B.; Manickam, J.; Okabayashi, M.; Ono, M.; Paul, S.; Perkins, F.; Sauthoff, N.; Sesnic, S.; Sun, Y.; Tighe, W.; Valeo, E.; von Goeler, S. [Princeton Univ., NJ (US). Plasma Physics Lab.; Batha, S.; Levinton, F. [Fusion Physics and Technology, Torrance, CA (US); Dunlap, J.; England, A.; Harris, J.; Hirshman, S.; Isler, R.; Post-Zwicker, A. [Oak Ridge National Lab., TN (US); Jones, S.; Kesner, J.; Luckhardt, S.; Paoletti, F. [Massachusetts Inst. of Tech., Cambridge, MA (US); Schmitz, L.; Tynan, G. [Univ. of California, Los Angeles, CA (US)
1993-07-01T23:59:59.000Z
Understanding the wave damping mechanism in the presence of a `spectral gap` is an important issue for the current profile control using Lower Hybrid Current Drive (LHCD). The authors examine a traditional explanation based upon upshifting of the wave parallel refractive index (n{sub {parallel}}) and find that there can be an upper bound in the n{sub {parallel}} upshift. The amount of upshift is not sufficient to bridge the spectral gap completely under some PBX-M LHCD conditions. There is experimental evidence, however, that current was driven even under such conditions. Another mechanism is also considered, based upon the 2-D velocity space dynamics coupled with a compound wave spectrum, here consisting of forward- and backward-running waves. The runaway critical speed relative to the phase speeds of these waves plays an important role in this model.
Effect of lower feedstock prices on economics of MTBE complex
Rahman, F.; Hamid, S.H.; Ali, M.A. [King Fahd Univ. of Petroleum and Minerals, Dhahran (Saudi Arabia)
1996-01-01T23:59:59.000Z
Economic evaluation of the methyl tertiary butyl ether (MTBE) complex was carried out starting from n-butane and by captive production of methanol from natural gas. The processing steps consist of isomerization of n-butane to isobutane, dehydrogenation of isobutane to make isobutene, and finally, the reaction of isobutene with methanol to produce MTBE. Two different plant sizes were considered, and the effect of 30% lower feedback prices on profitability was studied. It was found that the raw materials cost is a dominant component, composing about 55% of the total production cost. An internal rate of return of 19% could be realized for 500,000 tons per annum MTBE complex based on economic data in mid-1993. The payback period estimated at this capacity was 3.8 years, and the break-even capacity was 36.6%.
Separation and concentration of lower alcohols from dilute aqueous solutions
Moore, Raymond H. (Richland, WA); Eakin, David E. (Kennewick, WA); Baker, Eddie G. (Richland, WA); Hallen, Richard T. (Richland, WA)
1991-01-01T23:59:59.000Z
A process for producing, from a dilute aqueous solution of a lower (C.sub.1 -C.sub.5) alcohol, a concentrated liquid solution of the alcohol in an aromatic organic solvent is disclosed. Most of the water is removed from the dilute aqueous solution of alcohol by chilling sufficiently to form ice crystals. Simultaneously, the remaining liquid is extracted at substantially the same low temperature with a liquid organic solvent that is substantially immiscible in aqueous liquids and has an affinity for the alcohol at that temperature, causing the alcohol to transfer to the organic phase. After separating the organic liquid from the ice crystals, the organic liquid can be distilled to enrich the concentration of alcohol therein. Ethanol so separated from water and concentrated in an organic solvent such as toluene is useful as an anti-knock additive for gasoline.
Lower bounds to the spectral gap of Davies generators
Temme, Kristan [Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)] [Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)
2013-12-15T23:59:59.000Z
We construct lower bounds to the spectral gap of a family of Lindblad generators known as Davies maps. These maps describe the thermalization of quantum systems weakly coupled to a heat bath. The steady state of these systems is given by the Gibbs distribution with respect to the system Hamiltonian. The bounds can be evaluated explicitly, when the eigenbasis and the spectrum of the Hamiltonian is known. A crucial assumption is that the spectrum of the Hamiltonian is non-degenerate. Furthermore, we provide a counterexample to the conjecture, that the convergence rate is always determined by the gap of the associated Pauli master equation. We conclude that the full dynamics of the Lindblad generator has to be considered. Finally, we present several physical example systems for which the bound to the spectral gap is evaluated.
Damping of lower hybrid waves in large spectral gap configurations
Decker, J.; Peysson, Y.; Artaud, J.-F.; Nilsson, E.; Ekedahl, A.; Goniche, M.; Hillairet, J.; Mazon, D. [CEA, IRFM, F-13108 Saint Paul lez Durance (France)
2014-02-12T23:59:59.000Z
Extensive experimental data support reliable power deposition and current drive by lower-hybrid (LH) waves in conditions where a large spectral gap exists between the nominal parallel index of refraction prescribed by the antenna characteristics and phasing, and that required for significant Landau damping to take place. We argue that only a significant modification of the initial spectrum at the plasma edge could explain experimental observations. Based on this assumption, a new prescription for reliable simulations of LH current drive using ray-tracing and Fokker-Planck modelling is proposed. A remarkable agreement between experimental observations in the Tore Supra tokamak and simulations is obtained for relevant parametric scans, including electron density and LH waveguide phasing. In an effort to investigate the possible role of fluctuations, it is shown that the spectral gap can be bridged dynamically in the presence of a fluctuating LH spectrum.
Lower cost offshore field development utilizing autonomous vehicles
Frisbie, F.R.; Vie, K.J.; Welch, D.W.
1996-12-31T23:59:59.000Z
The offshore oil and gas industry has the requirement to inspect offshore oil and gas pipelines for scour, corrosion and damage as well as inspect and intervene on satellite production facilities. This task is currently performed with Remotely Operated Vehicles (ROV) operated from dynamically positioned (DP) offshore supply or diving support boats. Currently, these tasks are expensive due to the high day rates for DP ships and the slow, umbilical impeded, 1 knot inspection rates of the tethered ROVs, Emerging Autonomous Undersea Vehicle (AUV) technologies offer opportunities to perform these same inspection tasks for 50--75% lower cost, with comparable or improved quality. The new generation LAPV (Linked Autonomous Power Vehicles) will operate from fixed facilities such as TLPs or FPFs and cover an operating field 10 kms in diameter.
Lower-Energy Energy Storage System (LEESS) Component Evaluation
Gonder, J.; Cosgrove, J.; Shi, Y.; Saxon, A.; Pesaran, A.
2014-10-01T23:59:59.000Z
Alternate hybrid electric vehicle (HEV) energy storage systems (ESS) such as lithium-ion capacitors (LICs) and electrochemical double-layer capacitor (EDLC) modules have the potential for improved life, superior cold temperature performance, and lower long-term cost projections relative to traditional battery storage systems. If such lower-energy ESS (LEESS) devices can also be shown to maintain high HEV fuel savings, future HEVs designed with these devices could have an increased value proposition relative to conventional vehicles. NREL's vehicle test platform is helping validate the in-vehicle performance capability of alternative LEESS devices and identify unforeseen issues. NREL created the Ford Fusion Hybrid test platform for in-vehicle evaluation of such alternative LEESS devices, bench testing of the initial LIC pack, integration and testing of the LIC pack in the test vehicle, and bench testing and installation of an EDLC module pack. EDLC pack testing will continue in FY15. The in-vehicle LIC testing results suggest technical viability of LEESS devices to support HEV operation. Several LIC configurations tested demonstrated equivalent fuel economy and acceleration performance as the production nickel-metal-hydride ESS configuration across all tests conducted. The lowest energy LIC scenario demonstrated equivalent performance over several tests, although slightly higher fuel consumption on the US06 cycle and slightly slower acceleration performance. More extensive vehicle-level calibration may be able to reduce or eliminate these performance differences. The overall results indicate that as long as critical attributes such as engine start under worst case conditions can be retained, considerable ESS downsizing may minimally impact HEV fuel savings.
High performance parallel algorithms for incompressible flows
Sambavaram, Sreekanth Reddy
2002-01-01T23:59:59.000Z
innovative algorithms using solenoidal basis methods to solve the generalized Stokes problem for 3D MAC (Marker and Cell) and 2D unstructured P1-isoP1 finite element grids. It details a localized algebraic approach to construct solenoidal basis. An efficient...
The Elliptic Curve Digital Signature Algorithm (ECDSA)
). It was accepted in 1999 as an ANSI standard, and was accepted in 2000 as IEEE and NIST standards. It was also-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the ANSI X9.62 ECDSA Standards Organization) standard (ISO 14888-3), accepted in 1999 as an ANSI (American National Standards
Stochastic Distributed Algorithms for Target Surveillance
Crespi, Valentino
4 . Infor- mally, we want to deploy a number of ying UAV's (Unmanned Autonomous Vehicles of the performance of a system of autonomous agents. To this purpose we propose a class of semi-distributed stochastic navigation algorithms, that drive swarms of autonomous scouts to the surveillance of grounded
INTERIOR-POINT ALGORITHMS, PENALTY METHODS AND ...
2003-10-01T23:59:59.000Z
Oct 1, 2003 ... garded very favourably in the past, since nonlinear codes were not very robust, and .... on algorithmic performance (more on this later). The more general ..... the payoff to a firm if it chooses action i, and its rival chooses action ..... The problems siouxfls1,water-FL and water-net are rank-deficient even.
Evolving Distributed Algorithms with Genetic Programming: Election
Fernandez, Thomas
Evolving Distributed Algorithms with Genetic Programming: Election Thomas Weise Distributed Systems Group University of Kassel 34121 Kassel, Germany weise@vs.uni-kassel.de Michael Zapf Distributed Systems Group University of Kassel 34121 Kassel, Germany zapf@vs.uni-kassel.de ABSTRACT In this paper, we
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
Wind Mill Pattern Optimization using Evolutionary Algorithms
Wind Mill Pattern Optimization using Evolutionary Algorithms Charlie Vanaret ENAC , IRIT 7 av Ed 31062 Toulouse Cedex 9, France jean-marc.alliot@irit.fr ABSTRACT When designing a wind farm layout, we a grid, we can gain up to 3% of energy output on simple exam- ples of wind farms dealing with many
Optimal Security Liquidation Algorithms Sergiy Butenko
Uryasev, Stanislav
using a set of historical sample-paths of prices. 1. Introduction Consider the following decision making positions for several securities. Historical sequences of prices of these securities (after opening. The algorithms provide path-dependent strategies which sell some fractions of security depending upon price
Min Morse Matching: Algorithms and Applications
Abhishek Rathore
2015-03-11T23:59:59.000Z
described in Algorithm 3 (i.e. the identification of sets A and B ..... That said, for a reader wishes a more indepth understanding of the material at hand, a reading of ... be a prespecified arbitrarily small positive number s.t. we would be content to.
Blind Channel Equalization and -Approximation Algorithms
Ye, Yinyu
Blind Channel Equalization and #15;-Approximation Algorithms #3; Qingyu Li 1 , Er-Wei Bai 1 University of Iowa Iowa City, IA 52242 Abstract In this paper, we show that a blind equalizer can be obtained without using any sta- tistical information on the input by formulating the blind channel equalization
Distributed Probabilistic Model-Building Genetic Algorithm
Dongarra, Jack
is considered by Principal Component Analysis (PCA) when the off- springs are generated. The island modelDistributed Probabilistic Model-Building Genetic Algorithm Tomoyuki Hiroyasu1 , Mitsunori Miki1), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design variables
DISTRIBUTED EVENT LOCALIZATION AND TRACKING ALGORITHM (DELTA)
Braun, Torsten
in a distributed event localization and tracking algorithm (DELTA). DELTA is extended with energy-efficient network management, event classification functionality and an energy based source localization. The energy;#12;Abstract Different approaches to do event detection, tracking, localization and classification have been
Perturbation Resilience and Superiorization of Iterative Algorithms
2010-04-20T23:59:59.000Z
shown to be the case for various projection algorithms for solving the consistent ... Computational tractability with limited computing resources is a major barrier for ..... Data were collected by calculating line integrals across the digitized image for 82 ... tomography would be considered a variant of the algebraic reconstruction ...
Optimization Algorithms in Machine Learning Stephen Wright
Wright, Steve
Optimization Algorithms in Machine Learning Stephen Wright University of Wisconsin-Madison NIPS Tutorial, 6 Dec 2010 Stephen Wright (UW-Madison) Optimization in Machine Learning NIPS Tutorial, 6 Dec 2010 in machine learning. Stephen Wright (UW-Madison) Optimization in Machine Learning NIPS Tutorial, 6 Dec 2010 2
Randomized Parallel Algorithms in Optimization Stephen Wright
Randomized Parallel Algorithms in Optimization Stephen Wright University of Wisconsin-Madison July 2013 Wright (UW-Madison) Random Parallel Optimization July 2013 1 / 52 #12;Collaborators @ UW-Madison Victor Bittorf Ji Liu Ben Recht ( Berkeley) Chris RÂ´e ( Stanford) Krishna Sridhar Wright (UW
Deutsch-Jozsa algorithm for continuous variables
Arun K. Pati; Samuel L. Braunstein
2002-07-18T23:59:59.000Z
We present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous spectra we show that under ideal operation to infinite precision that there is an infinite reduction in number of query calls in this scheme.
Adiabatic Quantum Computation and Deutsch's Algorithm
Saurya Das; Randy Kobes; Gabor Kunstatter
2001-11-06T23:59:59.000Z
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.
Multicriteria Inventory Classification Using A Genetic Algorithm
GÃ¼venir, H. Altay
Multicriteria Inventory Classification Using A Genetic Algorithm H. Altay Guvenir a;1 , and Erdal. The new crossover technique is applied to the probÂ lem of multicriteria inventory classification. The results are compared with the classical inventory classification technique using Analytical Hierarchy
IPIANO: INERTIAL PROXIMAL ALGORITHM FOR NONCONVEX ...
2014-06-28T23:59:59.000Z
†Department of Computer Science and with the BIOSS Centre for Biological Sig- ...... Natural image denoising by using student-t regularized MRF model (MRF-l2). The ..... Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H.H. .... Computational Mathematics and Mathematical Physics, 4 (1964), pp.
ZART: A Multifunctional Itemset Mining Algorithm
Boyer, Edmond
independent, multi-purposed data mining platform, incorporating a rich collection of data mining algorithms, allowing a number of auxiliary operations for preparing and filtering data, and, for interpreting in data mining today. Generating strong association rules from frequent itemsets often results in a huge
Groundwater Remediation Strategy Using Global Optimization Algorithms
Neumaier, Arnold
as decision variables. Groundwater flow and particle-tracking models MODFLOW and MODPATH and a GO tool GLOBE; Algorithms; Ground-water management. Introduction The contamination of groundwater is a widespread problem, the simulation is carried out with available groundwater models for flow and transport, and the op- timization
Hyperspectral Imaging: Training Algorithms & Data Generation
Mountziaris, T. J.
Hyperspectral Imaging: Training Algorithms & Data Generation REU Students: Ping Fung and Carl +exp[-2(( + s))1/2 D / 3]} 1-rlSI +(rl - SI )exp[-2(( + s))1/2 D / 3] Data Generation To apply our possible parameters is impractical, so we generate approximate spectra using a physical model based
Algorithms to Automate LCLS Undulator Tuning
Wolf, Zachary
2010-12-03T23:59:59.000Z
Automation of the LCLS undulator tuning offers many advantages to the project. Automation can make a substantial reduction in the amount of time the tuning takes. Undulator tuning is fairly complex and automation can make the final tuning less dependent on the skill of the operator. Also, algorithms are fixed and can be scrutinized and reviewed, as opposed to an individual doing the tuning by hand. This note presents algorithms implemented in a computer program written for LCLS undulator tuning. The LCLS undulators must meet the following specifications. The maximum trajectory walkoff must be less than 5 {micro}m over 10 m. The first field integral must be below 40 x 10{sup -6} Tm. The second field integral must be below 50 x 10{sup -6} Tm{sup 2}. The phase error between the electron motion and the radiation field must be less than 10 degrees in an undulator. The K parameter must have the value of 3.5000 {+-} 0.0005. The phase matching from the break regions into the undulator must be accurate to better than 10 degrees. A phase change of 113 x 2{pi} must take place over a distance of 3.656 m centered on the undulator. Achieving these requirements is the goal of the tuning process. Most of the tuning is done with Hall probe measurements. The field integrals are checked using long coil measurements. An analysis program written in Matlab takes the Hall probe measurements and computes the trajectories, phase errors, K value, etc. The analysis program and its calculation techniques were described in a previous note. In this note, a second Matlab program containing tuning algorithms is described. The algorithms to determine the required number and placement of the shims are discussed in detail. This note describes the operation of a computer program which was written to automate LCLS undulator tuning. The algorithms used to compute the shim sizes and locations are discussed.
Lower Three Runs Remediation Safety Preparation Strategy - 13318
Mackay, Alexander; Fryar, Scotty; Doane, Alan [United States Department of Energy, Building 730-B, Aiken, SC 29808 (United States)] [United States Department of Energy, Building 730-B, Aiken, SC 29808 (United States)
2013-07-01T23:59:59.000Z
The Savannah River Site (SRS) is a 310-square-mile United States Department of Energy (US DOE) nuclear facility located along the Savannah River near Aiken, South Carolina that contains six primary stream/river systems. The Lower Three Runs Stream (LTR) is one of the primary streams within the site that is located in the southeast portion of the Savannah River Site. It is a large blackwater stream system that originates in the northeast portion of SRS and follows a southerly direction before it enters the Savannah River. During reactor operations, secondary reactor cooling water, storm sewer discharges, and miscellaneous wastewater was discharged and contaminated a 20 mile stretch of Lower Three Runs Stream that narrows and provides a limited buffer of US DOE property along the stream and flood-plain. Based on data collected during the years 2009 and 2010 under American Recovery and Re-investment Act funding, the stream was determined to be contaminated with cesium-137 at levels that exceeded acceptable risk based limits. In agreement with the Environmental Protection Agency and the South Carolina Department of Health and Environmental Control, three areas were identified for remediation [1] (SRNS April 2012). A comprehensive safety preparation strategy was developed for safe execution of the LTR remediation project. Contract incentives for safety encouraged the contractor to perform a complete evaluation of the work and develop an implementation plan to perform the work. The safety coverage was controlled to ensure all work was observed and assessed by one person per work area within the project. This was necessary due to the distances between the fence work and three transects being worked, approximately 20 miles. Contractor Management field observations were performed along with DOE assessments to ensure contractor focus on safe performance of the work. Dedicated ambulance coverage for remote worker work activities was provided. This effort was augmented with access to medical evacuation services. The areas where the work was performed were remote and difficult to get emergency vehicles to in a timely manner in case of an accident. Satellite phones were utilized due to intermittent phone coverage. High visibility vests were utilized to enable any hunters in the area to see the workers; due to the limited buffer areas along the stream route. An innovative approach to providing the necessary protection for workers during periods of extreme heat and humidity was also employed, which included the use of 'heat islands' with fans and crew trailers and ice vests for workers. (authors)
Recovery Act: Electrochromic Glazing Technology: Improved Performance, Lower Price
Burdis, Mark; Sbar, Neil
2012-06-30T23:59:59.000Z
The growing dependency of the US on energy imports and anticipated further increases in energy prices reinforce the concerns about meeting the energy demand in the future and one element of a secure energy future is conservation. It is estimated that the buildings sector represents 40% of the US's total energy consumption. And buildings produce as much as one third of the greenhouse gas emissions primarily through fossil fuel usage during their operational phase. A significant fraction of this energy usage is simply due to inefficient window technology. Electrochromic (EC) windows allow electronic control of their optical properties so that the transparency to light can be adjusted from clear to dark. This ability to control the amount of solar energy allowed into the building can be advantageously used to minimize lighting, heating and air conditioning costs. Currently, the penetration of EC windows into the marketplace is extremely small, and consequently there is a huge opportunity for energy savings if this market can be expanded. In order to increase the potential energy savings it is necessary to increase the quantity of EC windows in operation. Additionally, any incremental improvement in the energy performance of each window will add to the potential energy savings. The overall goals of this project were therefore to improve the energy performance and lower the cost of dynamic (EC) smart windows for residential and commercial building applications. This project is obviously of benefit to the public by addressing two major areas: lowering the cost and improving the energy performance of EC glazings. The high level goals for these activities were: (i) to improve the range between the clear and the tinted state, (ii) reduce the price of EC windows by utilizing lower cost materials, (iii) lowering the U-Value1 SAGE Electrochromics Inc. is the only company in the US which has a track record of producing EC windows, and presently has a small operational factory in Faribault MN which is shipping products throughout the world. There is a much larger factory currently under construction close by. This project was targeted specifically to address the issues outlined above, with a view to implementation on the new high volume manufacturing facility. Each of the Tasks which were addressed in this project is relatively straightforward to implement in this new facility and so the benefits of the work will be realized quickly. , and (iv) ensure the proposed changes have no detrimental effect to the proven durability of the window. The research described here has helped to understand and provide solutions to several interesting and previously unresolved issues of the technology as well as make progress in areas which will have a significant impact on energy saving. In particular several materials improvements have been made, and tasks related to throughput and yield improvements have been completed. All of this has been accomplished without any detrimental effect on the proven durability of the SageGlass EC device. The project was divided into four main areas: 1. Improvement of the Properties of the EC device by material enhancements (Task 2); 2. Reduce the cost of production by improving the efficiency and yields of some key manufacturing processes (Task 3); 3. Further reduce the cost by significant modifications to the structure of the device (Task 4); 4. Ensure the durability of the EC device is not affected by any of the changes resulting from these activities (Task 5). A detailed description of the activities carried out in these areas is given in the following report, along with the aims and goals of the work. We will see that we have completed Tasks 2 and 3 fully, and the durability of the resulting device structure has been unaffected. Some of Task 4 was not carried out because of difficulties with integrating the installation of the required targets into the production coater due to external constraints not related to this project. We will also see that the durability of the devices produced as a result of this work was
Operation of the Lower Granite Dam Adult Trap, 2008.
Harmon, Jerrel R.
2009-01-01T23:59:59.000Z
During 2008 we operated the adult salmonid trap at Lower Granite Dam from 7 March through 25 November, except during a short summer period when water temperatures were too high to safely handle fish. We collected and handled a total of 20,463 steelhead Oncorhynchus mykiss and radio-tagged 34 of the hatchery steelhead. We took scale samples from 3,724 spring/summer Chinook salmon O. tshawytscha for age and genetic analysis. We collected and handled a total of 8,254 fall Chinook salmon. Of those fish, 2,520 adults and 942 jacks were transported to Lyons Ferry Hatchery on the Snake River in Washington. In addition, 961 adults and 107 jacks were transported to the Nez Perce Tribal Hatchery on the Clearwater River in Idaho. The remaining 3,724 fall Chinook salmon were passed upstream. Scales samples were taken from 780 fall Chinook salmon tagged with passive integrated transponder (PIT) tags and collected by the sort-by-code system.
Penetration and scattering of lower hybrid waves by density fluctuations
Horton, W. [Institute for Fusion Studies, University of Texas at Austin (United States); Goniche, M.; Peysson, Y.; Decker, J.; Ekedahl, A.; Litaudon, X. [CEA, IRFM, F-13108 St-Paul-Lez-Durance (France)
2014-02-12T23:59:59.000Z
Lower Hybrid [LH] ray propagation in toroidal plasma is controlled by a combination of the azimuthal spectrum launched from the antenna, the poloidal variation of the magnetic field, and the scattering of the waves by the density fluctuations. The width of the poloidal and radial RF wave spectrum increases rapidly as the rays penetrate into higher density and scatter from the turbulence. The electron temperature gradient [ETG] spectrum is particularly effective in scattering the LH waves due to its comparable wavelengths and parallel phase velocities. ETG turbulence is also driven by the radial gradient of the electron current density giving rise to an anomalous viscosity spreading the LH-driven plasma currents. The scattered LH spectrum is derived from a Fokker-Planck equation for the distribution of the ray trajectories with a diffusivity proportional to the fluctuations. The LH ray diffusivity is large giving transport in the poloidal and radial wavenumber spectrum in one - or a few passes - of the rays through the core plasma.
A multiscale approximation algorithm for the cardinality constrained knapsack problem
Krishnan, Bharath Kumar
2006-01-01T23:59:59.000Z
I develop a multiscale approximation algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ...
Implementation and testing of a parallel layer peeling algorithm
Gandapur, Tasneem Kausar
2012-06-07T23:59:59.000Z
implementation was considered because of the anticipated speedup in the solution of the problem under consideration. The algorithm was implemented on an NCUBE 2 machine, with a total of sixty-four processors. Two variations of the parallel algorithm were...
Blind Block Synchronization Algorithms in Cyclic Prefix Systems
Vaidyanathan, P. P.
Blind Block Synchronization Algorithms in Cyclic Prefix Systems Borching Su Department to solving the problem blindly, that is, where training symbols are not available. Blind symbol synchronization problem is especially important in many blind channel estimation algorithms in the literature
Statistical Image Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission
Fessler, Jeffrey A.
Statistical Image Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission Reconstruction Algorithms Using Paraboloidal Surrogates for PET Transmission Scans by Hakan Erdogan Chair: Jeffrey A. Fessler Positron Emission Tomography (PET) is a diagnostic imaging tool that provides images
Decomposition algorithms for multi-area power system analysis
Min, Liang
2007-09-17T23:59:59.000Z
. This dissertation investigates decomposition algorithms for multi-area power system transfer capability analysis and economic dispatch analysis. All of the proposed algorithms assume that areas do not share their network operating and economic information among...
Optimization of advanced telecommunication algorithms from power and performance perspective
Khan, Zahid
2011-11-22T23:59:59.000Z
This thesis investigates optimization of advanced telecommunication algorithms from power and performance perspectives. The algorithms chosen are MIMO and LDPC. MIMO is implemented in custom ASIC for power optimization ...
A practical acceleration algorithm for real-time imaging
Sumbul, Uygar
A practical acceleration algorithm for real-time magnetic resonance imaging (MRI) is presented. Neither separate training scans nor embedded training samples are used. The Kalman filter based algorithm provides a fast and ...
LONG TERM FILE MIGRATION - PART II: FILE REPLACEMENT ALGORITHMS
Jay Smith, Alan
2011-01-01T23:59:59.000Z
MIGRATION· PART II: FILE REPLACEMENT ALGORITHMS Alan Jaymay vary even though replacement fi~~d the pa~ameter value PIe N - P ;, RT I r:. fILE REPLACEMENT ALGORITHMS. I.lan ~1ar
A FAST ALGORITHM FOR PROVING TERMINATING HYPERGEOMETRIC IDENTITIES *
Zeilberger, Doron
Gosper's algorithm for* * indefinite hypergeometric summation . A MAPLE program implementing recently by Gasper and Rahman[G-R1]. A MAPLE program implementing the algorithm is available from explicitly, in the form QA
EM algorithm estimation of TCM scheme over multipath fading
Gunawan, Wiedy
1997-01-01T23:59:59.000Z
The performance of Trellis Coded Modulation scheme via Expectation-Maximization algorithm utilizing a Kalman filter over multipath fading is presented. EM algorithm offers an easier computation than the classical ML estimation does. To get a better...
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1 Distributed Algorithms for Constructing
Khan, Maleq
distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction, Energy-Efficient Algorithms, Minimum Spanning Tree, Wireless Networks, Sensor Network. I. OVERVIEW A
Eigenvalue Problems and the LTSA Algorithm for Nonlinear ...
Eigenvalue Problems and the LTSA Algorithm for Nonlinear Dimensionality Reduction Qiang Ye Department of Mathematics University of Kentucky Lexington, ...
Fast and Robust Recursive Algorithms for Separable Nonnegative ...
2012-08-10T23:59:59.000Z
... incremental gradient descent algorithm using a parallel architecture is imple- ...... torization for sustainability adopting the principle of opposites, Data Mining ...
General heatbath algorithm for pure lattice gauge theory
Robert W. Johnson
2010-11-24T23:59:59.000Z
A heatbath algorithm is proposed for pure SU(N) lattice gauge theory based on the Manton action of the plaquette element for general gauge group N. Comparison is made to the Metropolis thermalization algorithm using both the Wilson and Manton actions. The heatbath algorithm is found to outperform the Metropolis algorithm in both execution speed and decorrelation rate. Results, mostly in D=3, for N=2 through 5 at several values for the inverse coupling are presented.
Algorithm for anisotropic diffusion in hydrogen-bonded networks
Edoardo Milotti
2007-04-04T23:59:59.000Z
In this paper I describe a specialized algorithm for anisotropic diffusion determined by a field of transition rates. The algorithm can be used to describe some interesting forms of diffusion that occur in the study of proton motion in a network of hydrogen bonds. The algorithm produces data that require a nonstandard method of spectral analysis which is also developed here. Finally, I apply the algorithm to a simple specific example.
Deutsch-Jozsa algorithm as a test of quantum computation
David Collins; K. W. Kim; W. C. Holton
1998-07-03T23:59:59.000Z
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.
Integrated network design and scheduling problems : optimization algorithms and applications.
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01T23:59:59.000Z
We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.
A STROKE BASED ALGORITHM FOR DYNAMIC SIGNATURE VERIFICATION
Adler, Andy
A STROKE BASED ALGORITHM FOR DYNAMIC SIGNATURE VERIFICATION Tong Qu, Abdulmotaleb El Saddik, Andy a novel stroke-based algorithm for DSV. An algorithm is developed to convert sample signatures of individual strokes. Individual strokes are identified by finding the points where there is a 1) decrease
MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS
Ray, David
MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS By William Shane Sanders;MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS By William Shane Sanders Approved Title of Study: MACHINE LEARNING AND MAPPING ALGORITHMS APPLIED TO PROTEOMICS PROBLEMS Pages in Study
A cutting surface algorithm for semi-infinite convex programming ...
2013-06-16T23:59:59.000Z
Jun 16, 2013 ... this distribution optimization method and the cutting surface algorithm yields a ... We present a novel cutting surface algorithm for general ...... in their formulation are defined through bounds on the measure, bounds on the distance from a .... in Algorithm 2, in the remainder of this section we provide a short ...
A Polynomial Time Incremental Algorithm for Learning DFA
Honavar, Vasant
and membership queries. This algorithm is an extension of Angluin's ID proÂ cedure to an incremental framework that the modified hypothÂ esis is consistent with all examples observed thus far. The algorithm is guaranteed a knowledgeable teacher who responds to queries generated by the learner. Angluin's ID algorithm learns the target
Bayesian Gaussian Process Classification with the EM-EP Algorithm
Ghahramani, Zoubin
Bayesian Gaussian Process Classification with the EM-EP Algorithm Hyun-Chul Kim and Zoubin of hyperparameters to determine various aspects of the function. Recently, the expectation propagation (EP) approach an approximate EM algorithm, the EM-EP algorithm, to learn both the latent function and the hyperparameters
WorstCase Analysis of Weber's GCD Algorithm
Lavault, Christian
WorstÂCase Analysis of Weber's GCD Algorithm Christian Lavault a;1 , S. Mohamed Sedjelmaci a a LIPN, Universit'e ParisÂNord, 93430 Villetaneuse, France Abstract Recently, Ken Weber introduced an algorithm for N(k), the maximal number of iterations in the loop of Weber's GCD algorithm. Key words: Integer
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
2006-10-09T23:59:59.000Z
The main difficulty is in identifying a constraint that is violated by more than a fixed threshold by the current ..... setting. Table 1 contains a description of our algorithm, which is a structural extension of the algorithm in [4]. ..... this phenomenon in other algorithms yet to be developed. .... collection of rank-1 matrices vvT , and.
GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT
Vrajitoru, Dana
GENETIC ALGORITHMS FOR A SINGLE-TRACK VEHICLE AUTONOMOUS PILOT Dana Vrajitoru Intelligent Systems algorithms to an autonomous pilot designed for motorized single-track vehicles (motorcycles). The pilot contribute efficiently to configuring the autonomous pilot. Key Words Genetic algorithms, multi
Supplement to "Power Algorithms for Inverting Laplace Transforms"
Whitt, Ward
propose a new class of algorithms for numerically inverting Laplace transforms, called power algorithmsSupplement to "Power Algorithms for Inverting Laplace Transforms" Efstathios Avdis Department, with the parameter choice being tunable to the trans- form being inverted. The powers can be advantageously chosen
A Pareto Frontier for Full Stern Submarines via Genetic Algorithm
Coello, Carlos A. Coello
A Pareto Frontier for Full Stern Submarines via Genetic Algorithm by Mark W. Thomas B.S. Electrical by : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : Kim Vandiver Chairman, Committee on Graduate Students #12; #12; A Pareto Frontier for Full Stern genetic algorithm. The algorithm seeks the code's Pareto (nonÂdominated) frontier in terms of usable hull
ICE Algorithm for the Shocktube Problem Oren E. Livne
Utah, University of
1 ICE Algorithm for the Shocktube Problem Oren E. Livne UUSCI-2006-007 Scientific Computing the main ICE advection algorithm for scalar advection problems (advection and Burg- ers step in this original Kashiwa ICE algorithm [Kas00], and its relation of both the Davis scheme [Dav87
A Fast Algorithm for Data Mining CS 297 Report
Pollett, Chris
A Fast Algorithm for Data Mining CS 297 Report Aarathi Raghu Advisor: Dr.Chris Pollett December 2005 #12;A Fast Algorithm For Data Mining Abstract This report describes the data mining algorithms implemented and lessons learned during the course of my CS 297. Data Mining is a growing field and a plethora
Fast computation algorithms for speckle pattern simulation
Nascov, Victor; Samoil?, Cornel; Ursu?iu, Doru [Transylvania University of Braov (Romania)
2013-11-13T23:59:59.000Z
We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.
Approximation algorithms for QMA-complete problems
Sevag Gharibian; Julia Kempe
2011-01-20T23:59:59.000Z
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.
Abstract A Hierarchical Algorithm for Radiosity Daylighting
Gonzalo Besuievsky; Ignacio Martin
A new daylight simulation method for radiosity environments is presented. Daylight illumination is transported in a first step where sun and sky are represented as a set of directional sources. Light is transported using parallel projections of these sources. The scene mesh is adaptively subdivided using energy and visibility criteria obtained from a extended scan-line algorithm that computes a layered depth image for each projection. In a second step, diffuse intereflection is computed through a hierarchical Monte Carlo radiosity algorithm. The method is feasible for it extension for environments containing specular surfaces. Relative short time view-independent global illumination results can be obtained with the proposed method, which make it suitable for daylight building design and analysis applications for both indoors and outdoors environments. 1
On Exact Algorithms for Permutation CSP
Kim, Eun Jung
2012-01-01T23:59:59.000Z
In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)CSP} for arity 2 or 3 can be solved by Held-Karp type algorithms in time $O^*(2^n)$, but no algorithm is known for arity at least 4 with running time significantly better than $2^{O(n\\log{n})}$. In this paper we resolve the gap by showing that {\\sc Arity 4 Permutati...
Robust Polynomials and Quantum Algorithms Harry Buhrman
de Wolf, Ronald
Robust Polynomials and Quantum Algorithms Harry Buhrman Ilan Newman Hein RÂ¨ohrigÂ§ Ronald de Wolf are of interest in them- selves and have been the object of study for a while. Their minimal degree is H.B., H.R., and R.d.W. supported in part by the EU fifth framework projects QAIP, IST-1999-11234, and RESQ, IST-2001
PID Parameters Optimization by Using Genetic Algorithm
Mirzal, Andri; Furukawa, Masashi
2012-01-01T23:59:59.000Z
Time delays are components that make time-lag in systems response. They arise in physical, chemical, biological and economic systems, as well as in the process of measurement and computation. In this work, we implement Genetic Algorithm (GA) in determining PID controller parameters to compensate the delay in First Order Lag plus Time Delay (FOLPD) and compare the results with Iterative Method and Ziegler-Nichols rule results.
The Deng algorithm in higher dimensions
Y. Nyonyi; S. D. Maharaj; K. S. Govinder
2014-12-28T23:59:59.000Z
We extend an algorithm of Deng in spherically symmetric spacetimes to higher dimensions. We show that it is possible to integrate the generalised condition of pressure isotropy and generate exact solutions to the Einstein field equations for a shear-free cosmological model with heat flow in higher dimensions. Three new metrics are identified which contain results of four dimensions as special cases. We show graphically that the matter variables are well behaved and the speed of sound is causal.
Automated Algorithm for MFRSR Data Analysis
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth (AOD)ProductssondeadjustsondeadjustAboutScience Program Cumulus Humilis, 2014Automated Algorithm for MFRSR
C. Lobo; A. Iovino; D. Lazzati; G. Chincarini
2000-06-29T23:59:59.000Z
We present a new algorithm to search for distant clusters of galaxies on catalogues deriving from imaging data, as those of the ESO Imaging Survey. Our algorithm is a matched filter one, similar to that adopted by Postman et al. (1996), aiming at identifying cluster candidates by using positional and photometric data simultaneously. The main novelty of our approach is that spatial and luminosity filter are run separately on the catalogue and no assumption is made on the typical size nor on the typical M* for clusters, as these parameters intervene in our algorithm as typical angular scale (sigma) and typical apparent magnitude m*. Moreover we estimate the background locally for each candidate, allowing us to overcome the hazards of inhomogeneous datasets. As a consequence our algorithm has a lower contamination rate - without loss of completeness - in comparison to other techniques, as tested through extensive simulations. We provide catalogues of galaxy cluster candidates as the result of applying our algorithm to the I-band data of the EIS-wide patches A and B.
Languages, Algorithms, Procedures, Calculi, and Metalogic
Mark Burgin
2007-01-04T23:59:59.000Z
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.
McHugh, P.R.
1995-10-01T23:59:59.000Z
Fully coupled, Newton-Krylov algorithms are investigated for solving strongly coupled, nonlinear systems of partial differential equations arising in the field of computational fluid dynamics. Primitive variable forms of the steady incompressible and compressible Navier-Stokes and energy equations that describe the flow of a laminar Newtonian fluid in two-dimensions are specifically considered. Numerical solutions are obtained by first integrating over discrete finite volumes that compose the computational mesh. The resulting system of nonlinear algebraic equations are linearized using Newton`s method. Preconditioned Krylov subspace based iterative algorithms then solve these linear systems on each Newton iteration. Selected Krylov algorithms include the Arnoldi-based Generalized Minimal RESidual (GMRES) algorithm, and the Lanczos-based Conjugate Gradients Squared (CGS), Bi-CGSTAB, and Transpose-Free Quasi-Minimal Residual (TFQMR) algorithms. Both Incomplete Lower-Upper (ILU) factorization and domain-based additive and multiplicative Schwarz preconditioning strategies are studied. Numerical techniques such as mesh sequencing, adaptive damping, pseudo-transient relaxation, and parameter continuation are used to improve the solution efficiency, while algorithm implementation is simplified using a numerical Jacobian evaluation. The capabilities of standard Newton-Krylov algorithms are demonstrated via solutions to both incompressible and compressible flow problems. Incompressible flow problems include natural convection in an enclosed cavity, and mixed/forced convection past a backward facing step.
A Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-06-24T23:59:59.000Z
Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.
Adaptive optimal control: an algorithm for direct digital control
Farris, D.R.; McDonald, T.E.
1980-01-01T23:59:59.000Z
An algorithm for applying advanced control concepts in heating, ventilating, and air conditioning (HVAC) systems has been developed at the Los Alamos Scientific Laboratory (LASL). The algorithm uses optimal control and is adaptive in nature. Simulations for a solar heated and cooled building indicate that use of this algorithm can accomplish a substantial savings in auxiliary energy consumption. In this paper, the algorithm is described and its application is illustrated with a simple example. Simulation results for a more complex system are also presented. The hardware, including the digital computer, needed to implement this algorithm is briefly discussed.
A 1:52-Approximation Algorithm for the Uncapacitated Facility Location Problem
Ye, Yinyu
A 1:52-Approximation Algorithm for the Uncapacitated Facility Location Problem Mohammad Mahdian #3: Approximation Algorithms for UFLP 2 Algorithm In [5], Jain, Mahdian, and Saberi proposed a greedy algorithm
An Adaptive Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-11-03T23:59:59.000Z
In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.
Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
Enrique Martin-Lopez; Anthony Laing; Thomas Lawson; Roberto Alvarez; Xiao-Qi Zhou; Jeremy L. O'Brien
2012-10-24T23:59:59.000Z
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the international effort to realise a quantum computer. However, due to the substantial resource requirement, to date, there have been only four small-scale demonstrations. Here we address this resource demand and demonstrate a scalable version of Shor's algorithm in which the n qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol. Encoding the work register in higher-dimensional states, we implement a two-photon compiled algorithm to factor N=21. The algorithmic output is distinguishable from noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor's algorithm by harnessing scalable resource reductions applicable to all physical architectures.
Lightsey, Glenn
density 4 Hydrogen polymer electrolyteHydrogen polymer electrolyte membrane fuel cell (PEMFC)membrane fuel1 LowerLower--Cost Fuel CellsCost Fuel Cells Allen J. Bard, Arumugam Manthiram,Allen J. BardMaterials Science and Engineering Program 2 CONVENTIONAL POWER PLANT DIRECT FUEL CELL POWER PLANT Heat
US-ABC Collaborates to Lower Cost of Electric Drive Batteries...
Office of Environmental Management (EM)
US-ABC Collaborates to Lower Cost of Electric Drive Batteries US-ABC Collaborates to Lower Cost of Electric Drive Batteries April 16, 2013 - 12:00am Addthis The U.S. Advanced...
Constraints on the composition of the Aleutian arc lower crust from
Shillington, Donna J.
Determining the bulk composition of island arc lower crust is essential for distinguishing between competing models for arc magmatism and assessing the stability of arc lower crust. We present new constraints on the ...
Impact of Lower PM from Multimode Operation on Fuel Penalty from...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Regeneration Low engine-out PM emissions from HECC result in lower pressure drop rise rates across the DPF, less frequent DPF regeneration, and lower de-soot fuel penalty...
Ten Ways to Lower Perceived Risk and Finance Rates within Utility...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Ten Ways to Lower Perceived Risk and Finance Rates within Utility Contract Ten Ways to Lower Perceived Risk and Finance Rates within Utility Contract Federal agencies can use the...
A Novel Algorithm for Solving the LPN Problem and its Application to Security Evaluation of the
algorithm appears as more powerful than the best one previously reported known as the BKW algorithm. In fact the BKW algorithm is shown to be a special instance of the proposed algorithm, but without optimized. The proposed algorithm has been compared with the best previously reported one, namely the BKW algorithm
A Monte Carlo algorithm for degenerate plasmas
Turrell, A.E., E-mail: a.turrell09@imperial.ac.uk; Sherlock, M.; Rose, S.J.
2013-09-15T23:59:59.000Z
A procedure for performing Monte Carlo calculations of plasmas with an arbitrary level of degeneracy is outlined. It has possible applications in inertial confinement fusion and astrophysics. Degenerate particles are initialised according to the 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.
Light Glueball masses using the Multilevel Algorithm
Sourav Mondal; Pushan Majumdar; Nilmani Mathur
2014-11-13T23:59:59.000Z
Following the multilevel scheme we present an error reduction algorithm for extracting glueball masses from monte-carlo simulations of pure SU(3) lattice gauge theory. We look at the two lightest states viz. the $0^{++}$ and $2^{++}$. Our method involves looking at correlations between large Wilson loops and does not require any smearing of links. The error bars we obtain are at the moment comparable to those obtained using smeared operators. We also present a comparison of our method with the naive method.
Some algorithmic results in graph imbeddings
Joshi, Sanjay
1990-01-01T23:59:59.000Z
new technique called double bar amalgamation is developed. The second problem deals with constructing graph imbeddings on a sur- face of genus c (where c is an integer) less than the marimum genus 7, (G) the given graph G. We develop a polynomial... time algorithm that constructs an imbedding of a given upper imbbedable graph G with even Betti number, on an orientable surface of genus (7, (G) ? 1). TABLE OF CONTENTS CHAPTER Page I INTRODUCTION 1. 1 Overview 1. 2 Graphs and Relationships Used...
A quadratic algorithm for road coloring
Béal, Marie-Pierre
2008-01-01T23:59:59.000Z
The road coloring theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the road coloring problem before being settled by A. Trahtman. Trahtman's proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction with a worst-case complexity which is quadratic in time and linear in space. We also extend the road coloring theorem to the periodic case.
Testing the Accuracy of Redshift Space Group Finding Algorithms
James J. Frederic
1994-09-07T23:59:59.000Z
Using simulated redshift surveys generated from a high resolution N-body cosmological structure simulation, we study algorithms used to identify groups of galaxies in redshift space. Two algorithms are investigated; both are friends-of-friends schemes with variable linking lengths in the radial and transverse dimensions. The chief difference between the algorithms is in the redshift linking length. The algorithm proposed by Huchra \\& Geller (1982) uses a generous linking length designed to find ``fingers of god'' while that of Nolthenius \\& White (1987) uses a smaller linking length to minimize contamination by projection. We find that neither of the algorithms studied is intrinsically superior to the other; rather, the ideal algorithm as well as the ideal algorithm parameters depend on the purpose for which groups are to be studied. The Huchra/Geller algorithm misses few real groups, at the cost of including some spurious groups and members, while the Nolthenius/White algorithm misses high velocity dispersion groups and members but is less likely to include interlopers in its group assignments. In a companion paper we investigate the accuracy of virial mass estimates and clustering properties of groups identified using these algorithms.
Localized overlap algorithm for unexpanded dispersion energies
Rob, Fazle; Szalewicz, Krzysztof [Department of Physics and Astronomy, University of Delaware, Newark, Delaware 19716 (United States)] [Department of Physics and Astronomy, University of Delaware, Newark, Delaware 19716 (United States); Misquitta, Alston J. [School of Physics and Astronomy, Queen Mary, University of London, London E1 4NS (United Kingdom)] [School of Physics and Astronomy, Queen Mary, University of London, London E1 4NS (United Kingdom); Podeszwa, Rafa? [Institute of Chemistry, University of Silesia, Szkolna 9, 40-006 Katowice (Poland)] [Institute of Chemistry, University of Silesia, Szkolna 9, 40-006 Katowice (Poland)
2014-03-21T23:59:59.000Z
First-principles-based, linearly scaling algorithm has been developed for calculations of dispersion energies from frequency-dependent density susceptibility (FDDS) functions with account of charge-overlap effects. The transition densities in FDDSs are fitted by a set of auxiliary atom-centered functions. The terms in the dispersion energy expression involving products of such functions are computed using either the unexpanded (exact) formula or from inexpensive asymptotic expansions, depending on the location of these functions relative to the dimer configuration. This approach leads to significant savings of computational resources. In particular, for a dimer consisting of two elongated monomers with 81 atoms each in a head-to-head configuration, the most favorable case for our algorithm, a 43-fold speedup has been achieved while the approximate dispersion energy differs by less than 1% from that computed using the standard unexpanded approach. In contrast, the dispersion energy computed from the distributed asymptotic expansion differs by dozens of percent in the van der Waals minimum region. A further increase of the size of each monomer would result in only small increased costs since all the additional terms would be computed from the asymptotic expansion.
Predicting Polymeric Crystal Structures by Evolutionary Algorithms
Qiang Zhu; Vinit Sharma; Artem R Oganov; Rampi Ramprasad
2014-06-05T23:59:59.000Z
The recently developed evolutionary algorithm USPEX proved to be a tool that enables accurate and reliable prediction of structures for a given chemical composition. Here we extend this method to predict the crystal structure of polymers by performing constrained evolutionary search, where each monomeric unit is treated as one or several building blocks with fixed connectivity. This greatly reduces the search space and allows the initial structure generation with different sequences and packings using these blocks. The new constrained evolutionary algorithm is successfully tested and validated on a diverse range of experimentally known polymers, namely polyethylene (PE), polyacetylene (PA), poly(glycolic acid) (PGA), poly(vinyl chloride) (PVC), poly(oxymethylene) (POM), poly(phenylene oxide) (PPO), and poly (p-phenylene sulfide) (PPS). By fixing the orientation of polymeric chains, this method can be further extended to predict all polymorphs of poly(vinylidene fluoride) (PVDF), and the complex linear polymer crystals, such as nylon-6 and cellulose. The excellent agreement between predicted crystal structures and experimentally known structures assures a major role of this approach in the efficient design of the future polymeric materials.
Nonextensive lattice gauge theories: algorithms and methods
Rafael B. Frigori
2014-04-26T23:59:59.000Z
High-energy phenomena presenting strong dynamical correlations, long-range interactions and microscopic memory effects are well described by nonextensive versions of the canonical Boltzmann-Gibbs statistical mechanics. After a brief theoretical review, we introduce a class of generalized heat-bath algorithms that enable Monte Carlo lattice simulations of gauge fields on the nonextensive statistical ensemble of Tsallis. The algorithmic performance is evaluated as a function of the Tsallis parameter q in equilibrium and nonequilibrium setups. Then, we revisit short-time dynamic techniques, which in contrast to usual simulations in equilibrium present negligible finite-size effects and no critical slowing down. As an application, we investigate the short-time critical behaviour of the nonextensive hot Yang-Mills theory at q- values obtained from heavy-ion collision experiments. Our results imply that, when the equivalence of statistical ensembles is obeyed, the long-standing universality arguments relating gauge theories and spin systems hold also for the nonextensive framework.
Efficient algorithm to compute mutually connected components in interconnected networks
Hwang, S; Lee, Deokjae; Kahng, B
2014-01-01T23:59:59.000Z
Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interconnected networks. Despite their importance, an efficient algorithm to obtain physical properties of all MCCs during the removals of links is not available. Here, using a well-known fully-dynamic graph algorithm, we propose an efficient algorithm to accomplish this. We show that the time complexity of this algorithm is approximately $\\mathcal{O}(N^{1.2})$, which is more efficient than the brute-force algorithm with complexity $\\mathcal{O}(N^{2})$. We anticipate this algorithm to allow simulations with complex dynamic rules to research a size regime that was not permitted before.
algorithm based descriptor: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Algorithm Computer Technologies and Information Sciences Websites Summary: for LTSA in a special case. 1 Introduction Manifold learning (ML) methods have attracted...
Solar Position Algorithm for Solar Radiation Applications (Revised...
Office of Scientific and Technical Information (OSTI)
Revised January 2008 * NRELTP-560-34302 Solar Position Algorithm for Solar Radiation Applications Ibrahim Reda and Afshin Andreas National Renewable Energy Laboratory 1617 Cole...
Optimization Online - A Polynomial Time Algorithm to Solve a Class ...
Hadi Charkhgard
2014-12-28T23:59:59.000Z
Dec 28, 2014 ... ... linear Fisher markets, and Kelly capacity allocation markets, but has applications in other fields of study as well. The algorithm computes an ...
A Retrospective Filter Trust Region Algorithm For Unconstrained ...
2010-01-05T23:59:59.000Z
In this paper, we propose a retrospective filter trust re- gion algorithm for .... [33] present the self-adaptive trust region methods and give some discussions about
algorithms restabelecimento otimo: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...
algorithm providing scan: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Algorithm Uncertainty Principles Mathematical Physics (arXiv) Summary: Previously, Bennet and Feynman asked if Heisenberg's uncertainty principle puts a limitation on a quantum...
algorithm based feature: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
feature level fusion framework using two well- known biometric cryptosystems, namely, fuzzy vault 60 A stochastic algorithm for feature selection in pattern recognition...
analytical anisotropic algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
THE EFFECTIVENESS OF ANISOTROPIC ANALYTICAL ALGORITHM IN FLATTENED AND FLATTENING-FILTER-FREE BEAMS FOR HIGH ENERGY LUNG DOSE DELIVERY USING THE RADIOLOGICAL PHYSICS CENTER LUNG...
anisotropic analytical algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
THE EFFECTIVENESS OF ANISOTROPIC ANALYTICAL ALGORITHM IN FLATTENED AND FLATTENING-FILTER-FREE BEAMS FOR HIGH ENERGY LUNG DOSE DELIVERY USING THE RADIOLOGICAL PHYSICS CENTER LUNG...
A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic ...
2011-11-07T23:59:59.000Z
is of course important to conduct numerical experiments to observe the behavior of the algorithms. ... of Operations Research, vol. ... Mathematics of Operations.
Application of the Difference Map Algorithm to Protein Folding .
Rankenburg, Ivan
2007-01-01T23:59:59.000Z
??This dissertation focuses on the application of a new search algorithm, the difference map, to the problem of protein structure prediction. First a short review… (more)
A polynomial relaxation-type algorithm for linear programming
2011-02-06T23:59:59.000Z
Feb 6, 2011 ... The paper proposes a polynomial algorithm for solving systems of ... a polynomial relaxation-type procedure which either finds a solution for.
Optimization Online - An LP-based Algorithm to Test Copositivity
Akihiro Tanaka
2014-04-26T23:59:59.000Z
Apr 26, 2014 ... Among others, several branch and bound type algorithms have been provided to test copositivity in the context of the fact that deciding whether ...
Efficient Block-coordinate Descent Algorithms for the Group Lasso
2012-02-20T23:59:59.000Z
general version of the Block Coordinate Descent (BCD) algorithm for the Group ...... 3. van den Berg, E., Friedlander, M.: Joint-sparse recovery from multiple ...
Exact algorithms for the Traveling Salesman Problem with Draft Limits
Maria Battarra
2013-02-25T23:59:59.000Z
Feb 25, 2013 ... In this recently proposed problem, draft limits are imposed due to restrictions on the port infrastructures. Exact algorithms based on three ...
Applying a global optimisation algorithm to Fund of Hedge Funds ...
rthapar
2009-09-01T23:59:59.000Z
Aug 1, 2009 ... 1 International Asset Management Ltd, 7 Clifford Street, London W1S 2FT ...... Genetic Algorithm for Global Optimisation of Water Environmental ...
D-ADMM: A Communication-Efficient Distributed Algorithm For ...
2012-02-13T23:59:59.000Z
graph, In is the identity matrix in Rn, and ? is the Kronecker product. Each column ...... program, which we solve with Matlab's quadprog function. Algorithm 3 was ...
Optimisation of distribution network design using a hybrid genetic algorithm.
Akararungruangkul, Raknoi
2006-01-01T23:59:59.000Z
??This thesis presents an integrated methodology developed for the modelling and optimisation of distribution networks based on a Hybrid Genetic Algorithm. This work focuses on… (more)
a preconditioned conjugate gradient based algorithm for coupling ...
F. DAÏM
2002-11-12T23:59:59.000Z
Oil & Gas Science and Technology – Rev. ... fields in Venezuela also illustrate the importance of the ..... It is well known that Gauss-Seidel type algorithms.
A multi-population genetic algorithm for a constrained two ...
2008-12-10T23:59:59.000Z
tree search algorithm for solving the d-dimensional knapsack problem. ...... PH A population heuristic, proposed by Beasley (2004), where a population of.
Contributions to computational phylogenetics and algorithmic self-assembly.
Shutters, Brad
2013-01-01T23:59:59.000Z
??This dissertation addresses some of the algorithmic and combinatorial problems at the interface between biology and computation. In particular, it focuses on problems in both… (more)
An accelerated proximal gradient algorithm for nuclear norm ...
Kim-Chuan Toh
2009-03-27T23:59:59.000Z
Mar 27, 2009 ... An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Kim-Chuan Toh (mattohkc ***at*** nus.edu.sg)
Generalized vector-valued proximal point algorithm in multi ...
2013-05-06T23:59:59.000Z
May 6, 2013 ... eas ranging from engineering design to medical treatments. .... economic interpretation of our algorithm applied to economy-related ...
Optimization Online - Use of a Direct Search Algorithm in the ...
Aïmen E. Gheribi
2014-12-02T23:59:59.000Z
Dec 2, 2014 ... Use of a Direct Search Algorithm in the Process Design of Material Science ... It includes advanced constraints handling, treatment of two ...
Geothermal: Sponsored by OSTI -- FORTRAN algorithm for correcting...
Office of Scientific and Technical Information (OSTI)
FORTRAN algorithm for correcting normal resistivity logs for borehold diameter and mud resistivity Geothermal Technologies Legacy Collection HelpFAQ | Site Map | Contact Us Home...
Feasible and accurate algorithms for covering semidefinite programs
Garud Iyengar
2010-07-02T23:59:59.000Z
Jul 2, 2010 ... Abstract: In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs.
Integrating Reinforcement Learning, Bidding and Genetic Algorithms Lamar University
Varela, Carlos
Integrating Reinforcement Learning, Bidding and Genetic Algorithms Dehu Qi Lamar University Computer Science Department PO Box 10056 Beaumont, Texas, USA dqi@cs.lamar.edu Ron Sun University
Global linear convergence of an augmented Lagrangian algorithm ...
2004-02-25T23:59:59.000Z
section 5 by relating some numerical experiments on a seismic tomography problem and by a discussion on algorithmic consequences. Notation. We denote the ...
A three phase load flow algorithm for Shipboard Power Systems
Medina-Calder?on, M?onica M
2003-01-01T23:59:59.000Z
. . . . . . . . . . . . . . . . . . . , . . . . . . . . . . . 3, 5 Network Representation 3. 6 Component Modeling. 3. 7 Integration of Methodology and Component Modeling . . . 3. 8 Chapter Summary. IV Load Flow Algorithm. . 4. 1 Introduction. 4. 2 Load Flow Algorithm. 4. 3 Application of Load Flow... Algorithm. . 4. 4 Summary of Load Flow Algorithm. 4. 5 Chapter Summary. . nl V1 vn 1X 1 3 5 5 8 15 16 16 18 23 26 27 50 53 54 54 54 69 79 79 CHAPTER V RESULTS AND CONCLUSIONS . . 5. 1 Introduction . . 5. 2 IEEE 37 Bus Radial...
ant colony algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
22 23 24 25 Next Page Last Page Topic Index 1 Learning Fuzzy Rules Using Ant Colony Optimization Algorithms 1 Computer Technologies and Information Sciences Websites Summary:...
algorithm identifies community: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
computer introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based by Martin Karplus provides evidence that the partition...
algorithm stochastic test: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
algorithms are often metaheuristic, and they are very promising in solving NP-hard optimization problems. In this paper, we show how to use the recently developed Firefly...
application genetic algorithms: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Learning mode generates hypotheses Evolution Model, Genetic Algorithms, Function Optimization, Symbolic Learning, AQ18, Digital Filters. 1An Experimental Application of...
algorithm na ordenacao: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
21 22 23 24 25 Next Page Last Page Topic Index 1 Elementary algorithms for convex optimization Javier Pena Computer Technologies and Information Sciences Websites Summary: ....
ant system algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Libre de Bruxelles IRIDIA Brussels, Belgium Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking Problem. To show that Ant...
adaptive genetic algorithm: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
a xed crossover Emmerich, Michael 2 Self-Adaptive Genetic Algorithm for Constrained Optimization. Open Access Theses and Dissertations Summary: ??This study proposes a...
Optimization Online - A Feasible Direction Algorithm for Nonlinear ...
Alfredo Canelas
2014-08-21T23:59:59.000Z
Aug 21, 2014 ... Abstract: In this work we present a new feasible direction algorithm for solving smooth nonlinear second-order cone programs. These problems ...
algorithm based differential: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Bandwidth Allocation Algorithms for Differentiated Services enabled Ethernet Passive support the in- creasing demands for high speed connections. One of the new technologies that...
An elementary derivation of the Deutsch-Jozsa algorithm
Neda Amin; Patrick Labelle
2008-10-13T23:59:59.000Z
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm illustrating this power. Unfortunately, the standard derivation involves several ingenious steps which usually leave students feeling that they could never have figured out the algorithm by themselves. We present here a different formulation of the problem which allows students to derive the algorithm using only basic knowledge of quantum mechanics and linear algebra.
Discrimination of unitary transformations in the Deutsch-Jozsa algorithm
David Collins
2010-02-23T23:59:59.000Z
We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form. We also use this to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution state NMR can only succeed with greater probability than a classical algorithm when the problem size exceeds $n \\sim 10^5.$
A renormalization group decoding algorithm for topological quantum codes
Guillaume Duclos-Cianci; David Poulin
2010-06-07T23:59:59.000Z
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be efficiently decoded. To improve this approximation, additional consistency conditions are imposed between the blocks, and are solved by a belief propagation algorithm.
A Q-LEARNING ALGORITHM WITH CONTINUOUS STATE SPACE ...
2006-09-22T23:59:59.000Z
Sep 22, 2006 ... stochastic approximation. Then, in section 3, we solve the mountain car task with the newly presented algorithm. 2. Theoretical Framework. 2.1.
An improved algorithm for computing Steiner minimal trees in ...
2006-04-17T23:59:59.000Z
We describe improvements to Smith's branch-and-bound (B&B) algorithm for the ... Computational results demonstrate substantial gains compared to Smith's ...
A hybrid genetic algorithm for manufacturing cell formation
José F. Gonçalves
... in cellular manufacturing is the formation of product families and machine cells. ... Computational experience with the algorithm on a set of group technology ...
Daylighting simulation: methods, algorithms, and resources
Carroll, William L.
1999-12-01T23:59:59.000Z
This document presents work conducted as part of Subtask C, ''Daylighting Design Tools'', Subgroup C2, ''New Daylight Algorithms'', of the IEA SHC Task 21 and the ECBCS Program Annex 29 ''Daylight in Buildings''. The search for and collection of daylighting analysis methods and algorithms led to two important observations. First, there is a wide range of needs for different types of methods to produce a complete analysis tool. These include: Geometry; Light modeling; Characterization of the natural illumination resource; Materials and components properties, representations; and Usability issues (interfaces, interoperability, representation of analysis results, etc). Second, very advantageously, there have been rapid advances in many basic methods in these areas, due to other forces. They are in part driven by: The commercial computer graphics community (commerce, entertainment); The lighting industry; Architectural rendering and visualization for projects; and Academia: Course materials, research. This has led to a very rich set of information resources that have direct applicability to the small daylighting analysis community. Furthermore, much of this information is in fact available online. Because much of the information about methods and algorithms is now online, an innovative reporting strategy was used: the core formats are electronic, and used to produce a printed form only secondarily. The electronic forms include both online WWW pages and a downloadable .PDF file with the same appearance and content. Both electronic forms include live primary and indirect links to actual information sources on the WWW. In most cases, little additional commentary is provided regarding the information links or citations that are provided. This in turn allows the report to be very concise. The links are expected speak for themselves. The report consists of only about 10+ pages, with about 100+ primary links, but with potentially thousands of indirect links. For purposes of the printed version, a list of the links is explicitly provided. This document exists in HTML form at the URL address: http://eande.lbl.gov/Task21/dlalgorithms.html. An equivalent downloadable PDF version, also with live links, at the URL address: http://eande.lbl.gov/Task21/dlalgorithms.pdf. A printed report can be derived directly from either of the electronic versions by simply printing either of them. In addition to the live links in the electronic forms, all report forms, electronic and paper, also have explicitly listed link addresses so that they can be followed up or referenced manually.
Neurons to algorithms LDRD final report.
Rothganger, Fredrick H.; Aimone, James Bradley; Warrender, Christina E.; Trumbo, Derek
2013-09-01T23:59:59.000Z
Over the last three years the Neurons to Algorithms (N2A) LDRD project teams has built infrastructure to discover computational structures in the brain. This consists of a modeling language, a tool that enables model development and simulation in that language, and initial connections with the Neuroinformatics community, a group working toward similar goals. The approach of N2A is to express large complex systems like the brain as populations of a discrete part types that have specific structural relationships with each other, along with internal and structural dynamics. Such an evolving mathematical system may be able to capture the essence of neural processing, and ultimately of thought itself. This final report is a cover for the actual products of the project: the N2A Language Specification, the N2A Application, and a journal paper summarizing our methods.
Component evaluation testing and analysis algorithms.
Hart, Darren M.; Merchant, Bion John
2011-10-01T23:59:59.000Z
The Ground-Based Monitoring R&E Component Evaluation project performs testing on the hardware components that make up Seismic and Infrasound monitoring systems. The majority of the testing is focused on the Digital Waveform Recorder (DWR), Seismic Sensor, and Infrasound Sensor. In order to guarantee consistency, traceability, and visibility into the results of the testing process, it is necessary to document the test and analysis procedures that are in place. Other reports document the testing procedures that are in place (Kromer, 2007). This document serves to provide a comprehensive overview of the analysis and the algorithms that are applied to the Component Evaluation testing. A brief summary of each test is included to provide the context for the analysis that is to be performed.
Improving Quantum Algorithms for Quantum Chemistry
M. B. Hastings; D. Wecker; B. Bauer; M. Troyer
2014-03-23T23:59:59.000Z
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many operations can be parallelized, leading to a further linear decrease in the parallel depth of the circuit, at the cost of a small constant factor increase in number of qubits required. Thirdly, we modify the term order in the Trotter-Suzuki decomposition, significantly reducing the error at given Trotter-Suzuki timestep. A final improvement modifies the Hamiltonian to reduce errors introduced by the non-zero Trotter-Suzuki timestep. All of these techniques are validated using numerical simulation and detailed gate counts are given for realistic molecules.
El-Refaie, Ayman M [ORNL; Jahns, Thomas M [ORNL; Reddy, Patel [University of Wisconsin; McKeever, John W [ORNL
2008-01-01T23:59:59.000Z
This paper presents a modified vector control algorithm for a fractional-slot concentrated-winding surface permanent magnet (SPM) machine that has been developed to maximize the machine's partial-load efficiency over a wide range of operating conditions. By increasing the amplitude of the negative d-axis current, the resulting increase in the stator copper losses can be more than offset by the reduction in the iron core losses achieved by lowering the stator d-axis flux amplitude. The effectiveness of this technique has been demonstrated using both analytical models and finite element analysis for a 55-kW (peak) SPM machine design developed for a demanding set of traction drive performance requirements. For this example, the modified control strategy increases the partial-load efficiency at 20% of rated torque by > 6% at 2000 r/min compared to the maximum torque/ampere algorithm, making the machine much more attractive for its intended application.
On Accurate and Provably Efficient GARCH Option Pricing Algorithms
Lyuu, Yuh-Dauh
On Accurate and Provably Efficient GARCH Option Pricing Algorithms Yuh-Dauh Lyuu Chi-Ning Wu Abstract The GARCH model has been very successful in capturing the serial corre- lation of asset return tree-based GARCH op- tion pricing algorithms suffer from exponential running time, a cut-off maturity
An Algorithm for Nonparametric GARCH Modelling Peter Buhlmann
Buehlmann, Peter
An Algorithm for Nonparametric GARCH Modelling Peter BË?uhlmann Seminar fË?ur Statistik Federal propose a simple iterative algorithm for nonparametric firstÂorder GARCH modelling. This method o#ers an alternative to fitting one of the many di#erÂ ent parametric GARCH specifications that have been proposed
A conjugate gradient learning algorithm for recurrent neural networks
Mak, Man-Wai
]. In particular, the conjugate gradient method is commonly used in training BP networks due to its speed1 A conjugate gradient learning algorithm for recurrent neural networks (Revised Version) Wing algorithm by incorporating conjugate gradient computation into its learning procedure. The resulting
GENETIC ALGORITHMS APPLIED TO REAL TIME MULTIOBJECTIVE OPTIMIZATION PROBLEMS
Coello, Carlos A. Coello
of searching for multiple solutions concurrently in a single run. Transforming this multiobjective optimizationGENETIC ALGORITHMS APPLIED TO REAL TIME MULTIOBJECTIVE OPTIMIZATION PROBLEMS Z. BINGUL, A. S@harpo.tnstate.edu ABSTRACT Genetic algorithms are often well suited for multiobjective optimization problems. In this work
Kernel Machine Based Feature Extraction Algorithms for Regression Problems
Szepesvari, Csaba
Kernel Machine Based Feature Extraction Algorithms for Regression Problems Csaba SzepesvÂ´ari 1 and AndrÂ´as Kocsor and KornÂ´el KovÂ´acs 2 Abstract. In this paper we consider two novel kernel machine based performance of the algorithm. The second algo- rithm combines kernel machines with average derivative
Lagrangean Decomposition Algorithm for Supply Chain Redesign of Electric Motors
Grossmann, Ignacio E.
Lagrangean Decomposition Algorithm for Supply Chain Redesign of Electric Motors Industry Yongheng Redesign of Electric Motors Industry Introduction of the Supply Chain Model 3/22/13 2 Analia Rodriguez #12 Decomposition Algorithm for Supply Chain Redesign of Electric Motors Industry #12;Lagrangean Decomposition
The Distributed Stigmergic Algorithm for Multi-parameter Optimization
Silc, Jurij
Stig- mergy Algorithm (MASA) for minimizing the power losses in an electric motor by optimizing to the electric motor design in Section 5. Finally, we conclude the paper in Section 6. 2 The Ant Stigmergy the independent geometrical parameters of the ro- tor and the stator. The efficiency of the algorithm
Spatial Data Algorithm Extension To TRAKLA2 Environment
Spatial Data Algorithm Extension To TRAKLA2 Environment Jussi Nikander Department of Computer In this paper an extension that brings spatial data al- gorithm support to the TRAKLA2 system is described and ideas for better spatial data support to the system are given. Keywords Spatial Data Algorithms
Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support
Ester, Martin
- 1 - Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support Martin Ester: Spatial data mining algorithms heavily depend on the efficient processing of neighbor- hood relations of these concepts will allow a tight integration of spatial data mining algo- rithms with a spatial database
Operator Dependant Compensated Algorithms Philippe Langlois Nicolas Louvet
Louvet, Nicolas
Operator Dependant Compensated Algorithms Philippe Langlois Nicolas Louvet DALI at ELIAUS, nicolas.louvet]@univ-perp.fr Abstract Compensated algorithms improve the accuracy of a re- sult evaluating a correcting term that compensates the finite precision of the computation. The implementation core
Parallel algorithms for approximation of distance maps on parametric surfaces
Kimmel, Ron
results demonstrate up to four orders of magnitude improvement in execution time compared to the state(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n charts, parallel algorithms, GPU, SIMD 1. INTRODUCTION Approximation of geodesic distances on curved
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Pennsylvania, University of
ROCK: A Robust Clustering Algorithm for Categorical Attributes Sudipto Guha Stanford University/proximity between a pair of data points. We develop a robust hierarchical clustering algorithm ROCK that employs measures that are relevant in situations where a domain expert/similarity table is the only source
Models and Algorithms for Optical and Optoelectronic Parallel Computers
Sahni, Sartaj K.
Models and Algorithms for Optical and Optoelectronic Parallel Computers Sartaj Sahni Dept/Fremantle, Australia #12;realization leads to the concept of optoelectronic computersÂcomputers which have a mix the prespective of efficient algorithm design. The OTIS family of optoelectronic computers is a step
PHYLOGENOMICS AND POPULATION GENOMICS: MODDELS, ALGORITHMS, AND ANALYTICAL TOOLS
Rosenberg, Noah
PHYLOGENOMICS AND POPULATION GENOMICS: MODDELS, ALGORITHMS, AND ANALYTICAL TOOLS LUAY K. NAKHLEH on relationships among species themselves. The two fields share a number of overlapping tools, as well as similar analytical tools for assessing properties of the algorithms. We are pleased to present five papers
A TWO-STAGE ALGORITHM FOR ENHANCEMENT OF REVERBERANT SPEECH
Wang, DeLiang "Leon"
A TWO-STAGE ALGORITHM FOR ENHANCEMENT OF REVERBERANT SPEECH Mingyang Wu and DeLiang Wang Department, respectively. Based on this observation, we propose a two-stage algorithm that enhances reverberant speech from) and speaker recognition systems. Consequently, an effective reverberant speech enhancement system can be used
PSYCHOACOUSTICALLY CONSTRAINED AND DISTORTION MINIMIZED SPEECH ENHANCEMENT ALGORITHM
Yoo, Chang D.
PSYCHOACOUSTICALLY CONSTRAINED AND DISTORTION MINIMIZED SPEECH ENHANCEMENT ALGORITHM Seokhwan Jo minimized speech enhancement algorithm is considered. In general, noise reduction leads to speech distortion, and thus, the goal of an enhancement al- gorithm should reduce noise and speech distortion so that both
A Nystrom algorithm for electrostatics of an anisotropic composite
Helsing, Johan
A Nystrom algorithm for electrostatics of an anisotropic composite Johan Helsing Department algorithms for the electrostatics of locally anisotropic composites seems to be a poorly explored area ective properties of lo- cally anisotropic composites is a topic of importance in physics and in physical
WorstCase Analysis of Weber's GCD Algorithm
Boyer, Edmond
WorstÂCase Analysis of Weber's GCD Algorithm Christian Lavault and S. Mohamed Sedjelmaci LIPN, CNRS UPRES-A 7030 UniversitÂ´e Paris 13, F-93430 Villetaneuse Abstract Recently, Ken Weber introduced provide a formula for N(k), the maximal number of iterations in the loop of Weber's GCD algorithm
Algorithms for Selfish Agents Mechanism Design for Distributed Computation
Chen, Yiling
Algorithms for Selfish Agents Mechanism Design for Distributed Computation Noam Nisan \\Lambda mechanism design in our distributed computation setting. We do not intend here to give a balanced Abstract This paper considers algorithmic problems in a distributed setting where the participants cannot
Output-Sensitive Algorithms for Tukey Depth and Related Problems
Morin, Pat
Output-Sensitive Algorithms for Tukey Depth and Related Problems David Bremner University of New de Bruxelles Pat Morin Carleton University Abstract The Tukey depth (Tukey 1975) of a point p halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions
Reducing Facet Nucleation during Algorithmic Self-Assembly
Goel, Ashish
Reducing Facet Nucleation during Algorithmic Self-Assembly Ho-Lin Chen,, Rebecca Schulman,,Â§ Ashish; Revised Manuscript Received July 3, 2007 ABSTRACT Algorithmic self-assembly, a generalization of crystal. Molecular self-assembly is an emerging technology that will ultimately enable the fabrication of great
Global Optimization of Chemical Processes using Stochastic Algorithms
Neumaier, Arnold
of a fermentation process, to deterÂ mine multiphase equilibria, for the optimal control of a penicillin reactor of the penicillin reactor and the nonÂdifferentiable system. 1. INTRODUCTION GradientÂbased optimization algorithmsGlobal Optimization of Chemical Processes using Stochastic Algorithms JULIO R. BANGA 1 and WARREN D
AMSR-E Algorithm Theoretical Basis Document: Sea Ice Products
Waliser, Duane E.
the Arctic perennial ice regions, and the ice temperature is produced from an algorithm similar to the Nimbus1 AMSR-E Algorithm Theoretical Basis Document: Sea Ice Products Thorsten Markus and Donald J 20771 1. Overview The AMSR-E sea ice standard level 3 products include sea ice concentration, sea ice
DYNAMIC PROGRAMMING ALGORITHM FOR RATE-DISTORTION OPTIMIZED MEDIA STREAMING
Reiterer, Harald
a dynamic programming algorithm for finding optimal transmission policies for a single packet in rate the assumption as a heuris- tic principle. Simulations show that for realistic channel models, the algorithm multimedia services over the Internet [1]. In contrast to traditional video transmission systems, a video
Numerical algorithms for the computation of the Smith normal
Seberry, Jennifer
Numerical algorithms for the computation of the Smith normal form of integral matrices C of the Smith normal form of integral matrices are described. More specifically, the comÂ pound matrix method of the algorithms. AMS Subject Classification: Primary 65F30, Secondary 15A21, 15A36. Key words and phrases: Smith
Nested Loop Algorithm for Parallel Model Based Iterative Reconstruction
Nested Loop Algorithm for Parallel Model Based Iterative Reconstruction Zhou Yu, Lin Fu, Debashish. In this paper, we propose a fast converging simultaneous-update algorithm using a nested loop structure tomography, iterative reconstruction, nested loop, preconditioner. I. INTRODUCTION Recent applications
Quantum Algorithm for Generalized Deutsch-Jozsa Problem
Dong Pyo Chi; Jinsoo Kim; Soojoon Lee
2000-05-16T23:59:59.000Z
We generalize the Deutsch-Jozsa problem and present a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a given function. We discuss the initialization of an auxiliary register and present a generalized Deutsch-Jozsa algorithm that requires no initialization of an auxiliary register.
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm *
Son, Sang H.
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm * * Supported in part by NSF. In this paper, we present a feedback control realÂtime scheduling algorithm and its evaluation. Performance}@cs.virginia.edu, + gt9s@virginia.edu Abstract Despite the significant body of results in realÂtime scheduling, many real
Computing Schedules for Time-Triggered Control using Genetic Algorithms
Fainekos, Georgios E.
Computing Schedules for Time-Triggered Control using Genetic Algorithms Truong Nghiem Georgios E scheduling problem for timed-triggered controllers (OSTTC) and the time complexity of the corresponding search. Keywords: Scheduling; Digital control; Genetic algorithms; 1. INTRODUCTION Digital control theory
Top 10 Algorithms in Data Mining Xindong Wu ( )
Wu, Xindong
Learning Theory. Springer-Verlag New York, Inc. Â #6. EM: McLachlan, G. and Peel, D. (2000). Finite Mixture of Vermont, USA; #12;2 Top 10 Algorithms in Data Mining: Xindong Wu and Vipin Kumar "Top 10 Algorithms.5: Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc. Â #2. CART: L
Sequential Detection based Cooperative Spectrum Sensing Algorithms in Cognitive Radio
Sharma, Vinod
Sequential Detection based Cooperative Spectrum Sensing Algorithms in Cognitive Radio Arun considers the problem of Spectrum Sensing in Cognitive Radio Networks. For this we use a recently developed is not experienced by our algorithm. Keywords-Cognitive Radio, Cooperative Spectrum Sensing, Decentralized Sequential
Polynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste1
Chrobak, Marek
algorithm for computing the minimum energy schedule when all jobs have unit length. 1 Introduction PowerPolynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste1 , Marek Chrobak2 policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory
Law and Order in Algorithmics Maarten M. Fokkinga
Fokkinga, Maarten M.
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 5b Transformer and Law . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 5cLaw and Order in Algorithmics Maarten M. Fokkinga #12;CIP-DATA KONINKLIJKE BIBLIOTHEEK, DEN HAAG Fokkinga, Maarten M. Law and Order in Algorithmics Maarten M. Fokkinga Â [S.l.: s.n.] Thesis Enschede
Parallel Formulations of Tree-Projection-Based Sequence Mining Algorithm
Karypis, George
, database projection algorithms, data mining, parallel processing This work was supported by NSF CCR-9972519 Institute. 1 #12;1 Introduction In recent years there has been an increased interest in using data miningParallel Formulations of Tree-Projection-Based Sequence Mining Algorithm Valerie Guralnik
Biomedical Term Recognition With the Perceptron HMM Algorithm
Kondrak, Greg
Biomedical Term Recognition With the Perceptron HMM Algorithm Sittichai Jiampojamarn and Grzegorz of biomedical terms in research publications using the Perceptron HMM algorithm. Each important term is idenÂ tified and classified into a biomedical conÂ cept class. Our proposed system achieves a 68.6% F
Using Data-Focused Tools to Assess Lower Vehicle Energy Use (Presentation)
Walkowicz, K.
2013-05-01T23:59:59.000Z
This presentation, 'Using Data-Focused Tools to Assess Lower Vehicle Energy Use,' was presented at the Green Truck Summit 2013; March 5, 2013, Indianapolis, IN.
Inventory of Existing Programs and Activities in the Lower Willamette Subbasin
1 Appendix O Inventory of Existing Programs and Activities in the Lower Willamette Subbasin Within partnerships, inventories, manuals, regulations, and individual projects for the subbasin's land, streams
A geometric algorithm for efficient coincident detection of gravitational waves
C. A. K. Robinson; B. S. Sathyaprakash; Anand S. Sengupta
2008-04-30T23:59:59.000Z
Data from a network of gravitational wave detectors can be analyzed in coincidence to increase detection confidence and reduce non-stationarity of the background. We propose and explore a geometric algorithm to combine the data from a network of detectors. The algorithm makes optimal use of the variances and covariances that exist amongst the different parameters of a signal in a coincident detection of events. The new algorithm essentially associates with each trigger ellipsoidal regions in parameter space defined by the covariance matrix. Triggers from different detectors are deemed to be in coincidence if their ellipsoids have a non-zero overlap. Compared to an algorithm that uses uncorrelated windows separately for each of the signal parameters, the new algorithm greatly reduces the background rate thereby increasing detection efficiency at a given false alarm rate.
An efficient parallel algorithm for matrix-vector multiplication
Hendrickson, B.; Leland, R.; Plimpton, S.
1993-03-01T23:59:59.000Z
The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in the well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.
Maclin, Rich
for Protein Folding Richard Maclin Jude W. Shavlik Computer Sciences Dept. University of Wisconsin 1210 W learning Theory refinement Neural networks Finite-state automata Protein folding Chou-Fasman algorithm-Fasman algorithm, a method for predicting how globular proteins fold. Empirical evidence shows
Boyer, Edmond
. We consider that evolutionary systems could help to guide designers in creative directions. We were.1 Integral evolutionary design There are numerous examples of evolutionary algorithms: genetic algorithms design and evolutionary design optimization, whose overlap is usually known as "integral evolutionary
A SENSITIVITY ANALYSIS OF THE TREATMENT OF WIND ENERGY IN THE AEO99 VERSION OF NEMS
Laboratory University of California Berkeley, CA 94720 and National Renewable Energy Laboratory 1617 Cole limitations on growth in capacity; these limitations include depletion of resources, costs of rapid of the other renewable technologies, such as solar thermal and photovoltaics (PV), our findings may
tera, 4 de Outubro de 2011 Teoria de Valores Extremos: porque nem tudo Normal!
Alves, Maria Isabel Fraga
2008 e princÃpios de 2009, despoletada pela defunta Lehmann Brothers, e a turbulÃªncia dos mercados desde entÃ£o. Para o leigo tremores de terra, furacÃµes, e os episÃ³dios de crash no mercado bolsista sÃ£o)exemplo disso: esses cisnes negros podem surgir em bandos. ExistirÃ¡ um padrÃ£o escondido subjacente a todo o tipo
Overview of NEMS-H2, Version 1.0 Frances Wood
Pipeline Compr. H2 Truck Electrolysis Coal Gasification Biomass Gasification Small City Station Rural sequestration) Â· Coal Gasification (with and without sequestration) Â· Biomass Gasification Â· Electrolysis (grid
Review: Besedotvorni tematski blok na petnajstem mednarodnem slvisti?nem kongresu v Minsku (2013)
Voršic, Ines; Stramlji? Breznik, Irena
2014-06-26T23:59:59.000Z
— #20;#19;#28; — 2FHQH#15;#3;]DSLVNL#15;#3;SRURþLOD#3;±#3;5HYLHZV#15;#3;1RWHV#15;#3;5HSRUWV Y#3; HNVSUHVLRQLVWLþQR#3; VWLOQR#3; SDUDGLJPR#3; #11;#20;#28;#20;#23;±#20;#28;#21;#22;#12;#3;RSUDYLOD#3;L]MHPQR#3;]DKWHYQR#3; LQ#3; REVHåQR#3;GHOR#17;#3...;8VSHOR#3; ML#3; MH#3; ]DSROQLWL#3; YU]HO#3;PHG#3;HNVSUHVLRQLVWLþQR#3;SRH]LMR#3; LQ#3; GUDPDWLNR#15;#3; GR#3; VHGDM#3; EROM#3; UD]LVNDQLPD#3; SRGURþMHPD#17;#3; âWXGLMH#3; V#3; SRGURþMD#3;PHWD- IRULNH#3;]JRGQMH#3;HNVSUHVLRQLVWLþQH#3;NUDWNH#3; SUR]H#3;XYUãþ...
National Energy Modeling System with Hydrogen Model (NEMS-H2)
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Year in3.pdfEnergy HealthCommentsAugust 2012NEVADA SPARKSNV EnergyDepartment ofRFI
A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS
Osborn, Julie G.; Wood, Frances; Richey, Cooper; Sanders, Sandy; Short, Walter; Koomey, Jonathan
2001-01-01T23:59:59.000Z
Documentation Report: Wind Energy Submodule (WES). DOE/EIA-The Economic Value of Wind Energy at High Power Systemthe characterization of wind energy in the model as used for
A sensitivity analysis of the treatment of wind energy in the AEO99 version of NEMS
Osborn, Julie G.; Wood, Frances; Richey, Cooper; Sanders, Sandy; Short, Walter; Koomey, Jonathan
2001-01-01T23:59:59.000Z
Administration. 1998. Annual Energy Outlook 1999: WithDepartment of Energy’s Annual Energy Outlook (AEO) forecastDepartment of Energy’s Annual Energy Outlook 1999 (AEO99)
Gumerman, Etan; Marnay, Chris
2004-01-01T23:59:59.000Z
Assumptions to the Annual Energy Outlook 2001. Report#:DOE/ENDOGENOUS LEARNING IN THE ANNUAL ENERGY OUTLOOK REFERENCEDepartment of Energy’s Annual Energy Outlook (AEO), which is
Frequency Stabilization in Non-linear MEMS and NEMS Oscillators (IN-11-087)
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: Vegetation ProposedUsing ZirconiaPolicyFeasibilityFieldMinds"Office | Department- Energy Innovation
Object-oriented algorithmic laboratory for ordering sparse matrices
Kumfert, G K
2000-05-01T23:59:59.000Z
We focus on two known NP-hard problems that have applications in sparse matrix computations: the envelope/wavefront reduction problem and the fill reduction problem. Envelope/wavefront reducing orderings have a wide range of applications including profile and frontal solvers, incomplete factorization preconditioning, graph reordering for cache performance, gene sequencing, and spatial databases. Fill reducing orderings are generally limited to--but an inextricable part of--sparse matrix factorization. Our major contribution to this field is the design of new and improved heuristics for these NP-hard problems and their efficient implementation in a robust, cross-platform, object-oriented software package. In this body of research, we (1) examine current ordering algorithms, analyze their asymptotic complexity, and characterize their behavior in model problems, (2) introduce new and improved algorithms that address deficiencies found in previous heuristics, (3) implement an object-oriented library of these algorithms in a robust, modular fashion without significant loss of efficiency, and (4) extend our algorithms and software to address both generalized and constrained problems. We stress that the major contribution is the algorithms and the implementation; the whole being greater than the sum of its parts. The initial motivation for implementing our algorithms in object-oriented software was to manage the inherent complexity. During our research came the realization that the object-oriented implementation enabled new possibilities augmented algorithms that would not have been as natural to generalize from a procedural implementation. Some extensions are constructed from a family of related algorithmic components, thereby creating a poly-algorithm that can adapt its strategy to the properties of the specific problem instance dynamically. Other algorithms are tailored for special constraints by aggregating algorithmic components and having them collaboratively generate the global ordering. Our software laboratory, ''Spinole'', implements state-of-the-art ordering algorithms for sparse matrices and graphs. We have used it to examine and augment the behavior of existing algorithms and test new ones. Its 40,000+ lilies of C++ code includes a base library test drivers, sample applications, and interfaces to C, C++, Matlab, and PETSc. Spinole is freely available and can be built on a variety of UNIX platforms as well as WindowsNT.
Lower-Bound Estimation for Multi-Bitwidth Scheduling Junjuan Xu*+
Cong, Jason "Jingsheng"
the design space more efficiently, lower-bound estimation of resources, as well as performance, has been][3][4][7][8][9][10]. Since the area cost of resources is directly related to the bitwidth configuration, the objectiveLower-Bound Estimation for Multi-Bitwidth Scheduling Junjuan Xu*+ , Jason Cong+ , Xu Cheng
AN ANALYSIS OF COORDINATED OPERATION OF LAKES POWELL & MEAD UNDER LOWER RESERVOIR CONDITIONS
of documents dating as early as 1922. The hydrology of the Colorado River is highly variable and water managers the Upper and Lower Basin vulnerability to shortage and unprotected power pools. This thesis explores and reservoir-based recreation), Lower Basin and Mexico shortage frequency and magnitude and basin
Nuclear Engineering and Design 189 (1999) 757 Lower head integrity under steam explosion loads
Yuen, Walter W.
Nuclear Engineering and Design 189 (1999) 7Â57 Lower head integrity under steam explosion loads T Engineering, Building 208, Argonne National Laboratory, 9700 South Cass A6enue, Argonne, IL 60439, USA Received 24 August 1998; accepted 24 November 1998 Abstract Lower head integrity under steam explosion
Labeling energy cost on light bulbs lowers implicit discount rates Jihoon Min a
Michalek, Jeremy J.
levels that could be achieved if the most energy-efficient and cost-effective end-use technologiesAnalysis Labeling energy cost on light bulbs lowers implicit discount rates Jihoon Min a , Inês L of five, lowering barriers to adoption of energy efficient alternatives with higher up-front costs
Why Are Residential PV Prices in Germany So Much Lower Than in the United States?
Why Are Residential PV Prices in Germany So Much Lower Than in the United States? A Scoping is significantly lower in Germany than in the U.S., due primarily to differences in "soft" costs Â But relatively consultant data relevant to the cost structure of residential PV in Germany Â· Focus is the pre
Sound velocities of ferropericlase in the Earth's lower mantle Jung-Fu Lin,1
Lin, Jung-Fu "Afu"
. Introduction [2] The speed of seismic waves in the Earth's lower mantle is governed by the elastic properties a dramatic increase in the isothermal bulk modulus (KT) and bulk sound velocity (VF) at the electronic spinSound velocities of ferropericlase in the Earth's lower mantle Jung-Fu Lin,1 Steven D. Jacobsen,2
Global empirical wind model for the upper mesosphere/lower thermosphere. I. Prevailing wind
Paris-Sud XI, UniversitÃ© de
Global empirical wind model for the upper mesosphere/lower thermosphere. I. Prevailing wind Y. I. An updated empirical climatic zonally aver- aged prevailing wind model for the upper mesosphere/ lower of monthly mean winds from meteor radar and MF radar measurements at more than 40 stations, well distributed
Schaetzl, Randall
, Michigan State University, East Lansing, MI 48824-1117, USA b Department of Earth and Environmental for the MIS 2 (late Wisconsin) advance into central northern Lower Michigan. We suggest that widespread ice chronologic control on the advancing MIS 2 ice margin in this part of Lower Michigan and refine the under
Critical Fracture Stress and Fracture Strain Models for the Prediction of Lower and
Ritchie, Robert
Critical Fracture Stress and Fracture Strain Models for the Prediction of Lower and Upper Shelf fracture stress and stress modified fracture strain models are utilized to describe the variation of lower and upper shelf fracture toughness with temperature and strain rate for two alloy steels used
Evolving research directions in Surface OceanLower Atmosphere (SOLAS) science
Evolving research directions in Surface OceanÂLower Atmosphere (SOLAS) science Cliff S. Law. Understanding the exchange of energy, gases and particles at the oceanÂatmosphere interface is criticalÂLower Atmosphere Study (SOLAS) coordinates multi-disciplinary oceanÂ atmosphere research projects that quantify
Soluble Epoxide Hydrolase Inhibition Lowers Arterial Blood Pressure in Angiotensin II Hypertension
Hammock, Bruce D.
Soluble Epoxide Hydrolase Inhibition Lowers Arterial Blood Pressure in Angiotensin II HypertensionEH) would lower blood pressure in angiotensin II (Ang II) hypertension. Rat renal cortical tissue/min). Renal cortical sEH protein expression was significantly higher in Ang II hypertension compared
A new, lower value of total solar irradiance: Evidence and climate significance
data. TIM's lower solar irradiance value is not a change in the Sun's output, whose variationsA new, lower value of total solar irradiance: Evidence and climate significance Greg Kopp1 14 January 2011. [1] The most accurate value of total solar irradiance during the 2008 solar minimum
LOWER BOUNDS ON THE GLOBAL MINIMUM OF A M. GHASEMI, J.B. LASSERRE, M. MARSHALL
Marshall, Murray
LOWER BOUNDS ON THE GLOBAL MINIMUM OF A POLYNOMIAL M. GHASEMI, J.B. LASSERRE, M. MARSHALL Abstract. We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain compare this bound with the (global) lower bound fgp ob- tained by Ghasemi and Marshall, and also
Current ramp-up with lower hybrid current drive in EAST B. J. Ding,1
Current ramp-up with lower hybrid current drive in EAST B. J. Ding,1 M. H. Li,1 N. J. Fisch,2 H hybrid current drive. The first stage of cyclic operation would be to ramp up the plasma current with lower hybrid waves alone in low-density plasma. Such a current ramp-up was carried out successfully
Matrix Product States Algorithms and Continuous Systems
S. Iblisdir; R. Orus; J. I. Latorre
2007-03-28T23:59:59.000Z
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be applied to a wide variety of situations. As a first test, we show how it provides reliable results in the computation of fundamental properties of a chain of quantum harmonic oscillators achieving off-critical and critical relative errors of the order of 10^(-8) and 10^(-4) respectively. Next, we use it to study the ground state properties of the quantum rotor model in one spatial dimension, a model that can be mapped to the Mott insulator limit of the 1-dimensional Bose-Hubbard model. At the quantum critical point, the central charge associated to the underlying conformal field theory can be computed with good accuracy by measuring the finite-size corrections of the ground state energy. Examples of MPS-computations both in the finite-size regime and in the thermodynamic limit are given. The precision of our results are found to be comparable to those previously encountered in the MPS studies of, for instance, quantum spin chains. Finally, we present a spin-off application: an iterative technique to efficiently get numerical solutions of partial differential equations of many variables. We illustrate this technique by solving Poisson-like equations with precisions of the order of 10^(-7).
Polynomial Time Algorithms for Minimum Energy Scheduling
Baptiste, Philippe; Durr, Christoph
2009-01-01T23:59:59.000Z
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release times and deadlines that need to be executed on a single processor. Preemptions are allowed. The processor requires energy L to be woken up and, when it is on, it uses one unit of energy per one unit of time. It has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time. We solve this problem in positive, by providing an O(n^5)-time algorithm. In addition we pr...
Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers
Shahabi, Cyrus
Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers Ulrich Neumann rendering algorithms. This issue has not been addressed in papers describing particular parallel implementations, but is pertinent to anyone dc- signing or implementing parallel rendering algorithms. Parallel
An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems
Seal, Sudip K [ORNL] [ORNL
2014-01-01T23:59:59.000Z
Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.
A Decision Theoretic Approach to Evaluate Radiation Detection Algorithms
Nobles, Mallory A.; Sego, Landon H.; Cooley, Scott K.; Gosink, Luke J.; Anderson, Richard M.; Hays, Spencer E.; Tardiff, Mark F.
2013-07-01T23:59:59.000Z
There are a variety of sensor systems deployed at U.S. border crossings and ports of entry that scan for illicit nuclear material. In this work, we develop a framework for comparing the performance of detection algorithms that interpret the output of these scans and determine when secondary screening is needed. We optimize each algorithm to minimize its risk, or expected loss. We measure an algorithm’s risk by considering its performance over a sample, the probability distribution of threat sources, and the consequence of detection errors. While it is common to optimize algorithms by fixing one error rate and minimizing another, our framework allows one to simultaneously consider multiple types of detection errors. Our framework is flexible and easily adapted to many different assumptions regarding the probability of a vehicle containing illicit material, and the relative consequences of a false positive and false negative errors. Our methods can therefore inform decision makers of the algorithm family and parameter values which best reduce the threat from illicit nuclear material, given their understanding of the environment at any point in time. To illustrate the applicability of our methods, in this paper, we compare the risk from two families of detection algorithms and discuss the policy implications of our results.
An Algorithm for Detecting Quantum-Gravity Photon Dispersion in Gamma-Ray Bursts: DISCAN
Jeffrey D. Scargle; Jay P. Norris; Jerry T. Bonnell
2007-09-01T23:59:59.000Z
DisCan is a new algorithm implementing photon dispersion cancellation in order to measure energy-dependent delays in variable sources. This method finds the amount of reversed dispersion that optimally cancels any actual dispersion present. It applies to any time- and energy-tagged photon data, and can avoid binning in both time and energy. The primary motivation here is the search for quantum gravity based dispersion in future gamma ray burst data from the Gamma Ray Large Area Space Telescope (GLAST). Extrapolation of what is know about bursts at lower energies yields a reasonable prospect that photon dispersion effects consistent with some quantum gravity formalisms may be detected in sufficiently bright bursts. Short bursts have no or very small inherent lags, and are therefore better prospects than long ones, but even they suffer systematic error due to pulse asymmetry that may yield an irreducible uncertainty. We note that data at energies higher than about 0.1 TeV may not be useful for detecting dispersion in GRBs. Of several variants of the proposed algorithm, one based on Shannon information is consistently somewhat superior to all of the others we investigated.
A hybrid of the genetic algorithm and concurrent simplex
Randolph, David Ethan
2012-06-07T23:59:59.000Z
and Concurrent Simplex. (May 1995) David Ethan Randolph, B. A. , Stetson University Chair of Advisory Committee: Dr. John Yen The Genetic Algorithm is applied to the parameter estimation problem to opti- mize a model of the glucose cycle of an E. coli cell.... The remainder of the paper will describe the genetic algorithm, how it was applied to estimating parameters in the metabolic model and its shortcomings therewith, and a proposed improvement of the algorithm which helps it converge upon the global optimum both...
Quantum digital-to-analog conversion algorithm using decoherence
Akira SaiToh
2014-12-28T23:59:59.000Z
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
Quantum algorithms for topological and geometric analysis of big data
Seth Lloyd; Silvano Garnerone; Paolo Zanardi
2014-08-13T23:59:59.000Z
Extracting useful information from large data sets can be a daunting task. Topological methods for analyzing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying such topological features -- connected components, holes, or voids -- and for determining how such features persist as the data is viewed at different scales. This paper provides quantum algorithms for calculating Betti numbers in persistent homology, and for finding eigenvectors and eigenvalues of the combinatorial Laplacian. The algorithms provide an exponential speedup over classical algorithms for topological data analysis.
Algorithms and analysis for underwater vehicle plume tracing.
Byrne, Raymond Harry; Savage, Elizabeth L. (Texas A& M University, College Station, TX); Hurtado, John Edward (Texas A& M University, College Station, TX); Eskridge, Steven E.
2003-07-01T23:59:59.000Z
The goal of this research was to develop and demonstrate cooperative 3-D plume tracing algorithms for miniature autonomous underwater vehicles. Applications for this technology include Lost Asset and Survivor Location Systems (L-SALS) and Ship-in-Port Patrol and Protection (SP3). This research was a joint effort that included Nekton Research, LLC, Sandia National Laboratories, and Texas A&M University. Nekton Research developed the miniature autonomous underwater vehicles while Sandia and Texas A&M developed the 3-D plume tracing algorithms. This report describes the plume tracing algorithm and presents test results from successful underwater testing with pseudo-plume sources.
Lower bounds on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy
Naor, Assaf
as the basis for an efficient approximate nearest neighbor search algorithm, and has since been used mining, information retrieval, and image search, where distinctive features of the objects the nearest neighbor. One of the most versatile and efficient methods for approximate nearest neighbor search
Final Report: Algorithms for Diffractive Microscopy
Elser, Veit
2010-10-08T23:59:59.000Z
The phenomenal coherence and brightness of x-ray free-electron laser light sources, such as the LCLS at SLAC, have the potential of revolutionizing the investigation of structure and dynamics in the nano-domain. However, this potential will go unrealized without a similar revolution in the way the data are analyzed. While it is true that the ambitious design parameters of the LCLS have been achieved, the prospects of realizing the most publicized goal of this instrument — the imaging of individual bio-particles — remains daunting. Even with 10{sup 12} photons per x-ray pulse, the feebleness of the scattering process represents a fundamental limit that no amount of engineering ingenuity can overcome. Large bio-molecules will scatter on the order of only 10{sup 3} photons per pulse into a detector with 106 pixels; the diffraction “images” will be virtually indistinguishable from noise. Averaging such noisy signals over many pulses is not possible because the particle orientation cannot be controlled. Each noisy laser snapshot is thus confounded by the unknown viewpoint of the particle. Given the heavy DOE investment in LCLS and the profound technical challenges facing single-particle imaging, the final two years of this project have concentrated on this effort. We are happy to report that we succeeded in developing an extremely efficient algorithm that can reconstruct the shapes of particles at even the extremes of noise expected in future LCLS experiments with single bio-particles. Since this is the most important outcome of this project, the major part of this report documents this accomplishment. The theoretical techniques that were developed for the single-particle imaging project have proved useful in other imaging problems that are described at the end of the report.
E-Print Network 3.0 - algorithmic fault tree Sample Search Results
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
based on fault trees derived using the IFT induction algorithm. The test system is a robot arm... University College Galway, Ireland. 12;INDUCTION AND THE IFT ALGORITHM To...
E-Print Network 3.0 - algorithmic learning theory Sample Search...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
for: algorithmic learning theory Page: << < 1 2 3 4 5 > >> 1 Supervised learning for computer vision: Theory and algorithms -Introduction Summary: Supervised learning for computer...
A Primal-Dual Algorithm for Computing a Cost Allocation in the Core ...
2011-10-23T23:59:59.000Z
Oct 3, 2011 ... At every iteration, the algorithm spends O(T2) time to determine the next tight constraint and. 160 which ?t's become inactive. The algorithm ...
E-Print Network 3.0 - affine projection algorithm Sample Search...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
and Segments Lambda Summary: by functions of the affine edge detectors. The geodesic path is computed via an algorithm which allows... processing Algorithms for image...
An accelerated HPE-type algorithm for a class of composite convex ...
Yunlong He
2014-04-29T23:59:59.000Z
Apr 29, 2014 ... Abstract: This article proposes a new algorithm for solving a class of composite convex-concave saddle-point problems. The new algorithm is a ...
E-Print Network 3.0 - advanced methods algorithms Sample Search...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
algorithms Search Powered by Explorit Topic List Advanced Search Sample search results for: advanced methods algorithms Page: << < 1 2 3 4 5 > >> 1 Boston University Fall 2010 ECE...
E-Print Network 3.0 - advanced computational algorithm Sample...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
algorithm Search Powered by Explorit Topic List Advanced Search Sample search results for: advanced computational algorithm Page: << < 1 2 3 4 5 > >> 1 Boston University Fall 2010...
E-Print Network 3.0 - algorithm based method Sample Search Results
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
search results for: algorithm based method Page: << < 1 2 3 4 5 > >> 1 NUMERICAL OPTIMIZATION MAD 5420-02 Summary: method and algorithm Quadratic fit-polynomial interpolation...
algorithmes multi-etape pour: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Fort, Gersende 15 Algorithmes hybrides pour la gestion intelligente de l'nergie dans les smart grids Physics Websites Summary: Algorithmes hybrides pour la gestion intelligente de...
algorithms based multi-objective: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Estimation Evolutionary Algorithms Dirk Thierens an algorithm for multi-objective optimization using a mixture-based iterated density estimation evolutionary that constructs at...
E-Print Network 3.0 - admission control algorithm Sample Search...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
We now give the detailed algorithm for admission control... . 2. Pseudo Code of Admission Control and Scheduling Algorithm. After performing admission ... Source: Aberer, Karl -...
Simunic, Tajana
A Scheduling Algorithm for Consistent Monitoring Results with Solar Powered High but critical task for solar powered wireless high power embedded systems. Our algorithm relies on an energy
Ion-beam driven lower hybrid waves in a magnetized dusty plasma
Prakash, Ved; Vijayshri [School of Sciences, Indira Gandhi National Open University, Maidan Garhi, New Delhi 110 068 (India)] [School of Sciences, Indira Gandhi National Open University, Maidan Garhi, New Delhi 110 068 (India); Sharma, Suresh C. [Department of Applied Physics, Delhi Technological University, Shahbad Daulatpur, Bawana Road, Delhi 110 042 (India)] [Department of Applied Physics, Delhi Technological University, Shahbad Daulatpur, Bawana Road, Delhi 110 042 (India); Gupta, Ruby [Department of Physics, Swami Shraddhanand College, University of Delhi, Alipur, Delhi 110 036 (India)] [Department of Physics, Swami Shraddhanand College, University of Delhi, Alipur, Delhi 110 036 (India)
2013-06-15T23:59:59.000Z
An ion beam drives lower hybrid waves to instability in a magnetized dusty plasma via Cerenkov interaction. A dispersion relation and the growth rate of the lower hybrid waves have been derived taking into account the dust charge fluctuations. The frequency and the growth rate of the unstable wave instability increase with relative density of negatively charged dust grains. The lower hybrid modes with phase velocity comparable to the beam velocity possess a large growth rate. Moreover, the growth rate of the instability increases with beam density and scales as the one-third power of the beam density.
Machine Learning Algorithms for Cancer Diagnosis Abraham Karplus
Karplus, Kevin
Machine Learning Algorithms for Cancer Diagnosis Abraham Karplus Santa Cruz County Science Fair . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Machine Learning 5 Testing Methods Conclusion 15 Future Work 16 Acknowledgements 17 External software 18 References 19 2 #12;Overview Machine
ALTERNATING DIRECTION ALGORITHMS FOR l1-PROBLEMS IN ...
2009-11-17T23:59:59.000Z
where (A, b) can remain complex, e.g., A being a partial Fourier matrix. ..... cations are available, which are the main computation load of all algorithms to be
Quantitative Comparison of Algorithms for Tracking Single Fluorescent Particles
Guilford, William
of beads on microtubules (Gelles et al., 1988), and the myosin-driven movement of actin filaments in vitro of the method. Tracking algorithms used to date have included cross- correlation of subsequent images (Gelles et
algorithmic language scheme: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
that the same holds for n3. Sethuraman, B A 2009-01-01 389 On the Complexity of the BKW Algorithm on LWE Martin R. Albrecht1 Physics Websites Summary: On the Complexity of the...
Stochastic artificial retinas: algorithm, optoelectronic circuits, and implementation
Boyer, Edmond
Stochastic artificial retinas: algorithm, optoelectronic circuits, and implementation Philippe tasks in the presence of discontinuities, dedicated optoelectronic hardware to implement thermal motion by photodetection of speckles, and hybrid architectures that combine optoelectronic, asynchronous
The quantum walk search algorithm: Factors affecting efficiency
Neil B. Lovett; Matthew Everitt; Robert M. Heath; Viv Kendon
2011-10-21T23:59:59.000Z
We numerically study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA \\textbf{67} 052307] and the factors which affect its efficiency in finding an individual state from an unsorted set. Previous work has focused purely on the effects of the dimensionality of the dataset to be searched. Here, we consider the effects of interpolating between dimensions, connectivity of the dataset, and the possibility of disorder in the underlying substrate: all these factors affect the efficiency of the search algorithm. We show that, as well as the strong dependence on the spatial dimension of the structure to be searched, there are also secondary dependencies on the connectivity and symmetry of the lattice, with greater connectivity providing a more efficient algorithm. In addition, we also show that the algorithm can tolerate a non-trivial level of disorder in the underlying substrate.
An algorithm for recovery of distributed applications with directed dependencies
Yang, Jiantian
1996-01-01T23:59:59.000Z
recovery. The thesis proposes a distributed algorithm which coordinates management entities, called agents, to monitor the managed resources (which have directed failure and recovery dependencies among them) and perform recovery actions once failures have...
ON THE CONVERGENCE RATE OF THE CAUCHY ALGORITHM IN ...
When the Armijo search is performed it is well known that the algorithm is globally ..... Addison - Wes- ley?? ublishing Company,¨I ew Y ork, 1 ?? 6. 14. J . M . M ...
Resolution-Exact Algorithms for Link Robots Zhongdi Luo1
Chiang, Yi-Jen
Resolution-Exact Algorithms for Link Robots Zhongdi Luo1 , Yi-Jen Chiang2 , Jyh-Ming Lien3-based search strategies. The T/R idea is to give primacy to the translational (T) components, and perform
Resolution-Exact Algorithms for Link Robots Zhongdi Luo1
Chiang, Yi-Jen
Resolution-Exact Algorithms for Link Robots Zhongdi Luo1 , Yi-Jen Chiang2 , Jyh-Ming Lien3 predicates for link robots, a novel "T/R splitting method" for subdivi- sion, and feature-based search
Shor's quantum algorithm using electrons in semiconductor nanostructures
Fabrizio Buscemi
2010-12-17T23:59:59.000Z
Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the potentialities of fully coherent electron transport assisted by the surface acoustic waves. Specifically, a non standard approach is used to implement, in a simple form, the quantum circuits of the modular exponentiation execution for the simplest instance of the Shor's algorithm, that is the factorization of $N$=15. The numerical procedure is based on a time-dependent solution of the multi-particle Schr\\"odinger equation. The near-ideal algorithm performance and the large estimated fidelity indicate the efficiency of the protocol implemented, which also results to be almost unsensitive to small destabilizing effects during quantum computation.
An Approximation Algorithm for Constructing Error Detecting Prefix ...
2006-09-02T23:59:59.000Z
Sep 2, 2006 ... 2-bit Hamming prefix code problem. Our algorithm spends O(n log3 n) time to calculate a 2-bit. Hamming prefix code with an additive error of at ...
Algorithms, libraries, and development environments to process huge geoinformatic
Franklin, W. Randolph
CGAL MATLAB C++ Matrix Packages 4 Algorithm Tactics 3D Uniform Grid 5 Examples Volume of Union of Many components. Â· Some needed operations: Â· nearest point Â· boolean intersection and union Â· planar graph overlay
Stochastic Roadmap Simulation: Efficient Representation and Algorithms for
Brutlag, Doug
Stochastic Roadmap Simulation: Efficient Representation and Algorithms for the Analysis Roadmap Simulation (SRS) #12;Stochastic Roadmap Simulation (SRS) Multiple paths at once; #12;Stochastic Roadmap Simulation (SRS) Multiple paths at once; No local minimum problem; #12;Stochastic Roadmap