Sample records for usd2 staffing approximately

  1. Staffing Model | Department of Energy

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed offOCHCO Overview OCHCO OverviewRepositoryManagement |SolarSpecialStaffing Model Staffing Model

  2. Audit of staffing requirements for the Strategic Petroleum Reserve

    SciTech Connect (OSTI)

    NONE

    1995-03-29T23:59:59.000Z

    The Department of Energy`s (Department) Strategic Petroleum Reserve (Reserve) is responsible for storing large quantities of crude oil, currently about 592 million barrels, to reduce the impact of any future supply disruptions. The Reserve facilities consist of a marine terminal and five underground storage sites located in Louisiana and Texas, and program and administrative offices in New Orleans and Washington, DC. At May 31, 1994, 1,692 Departmental and contractor personnel were employed in the operation, maintenance, and administration of Reserve activities and the Fiscal Year 1994 Congressional Appropriation was about $207 million. The audit was requested by the Deputy Secretary of Energy to assist Departmental management in evaluating the human resources required to meet Reserve program requirements. Specifically, the objective of the audit was to determine whether current staffing levels for the Reserve were necessary to effectively and efficiently accomplish current and future anticipated mission requirements. The Secretary`s goal of having the Department and its contractors embrace the best management practices in other Government agencies and industry to improve processes and eliminate waste has not been fully realized by Reserve management. We identified industry performance levels and staffing practices that, if achieved by the Reserve, could enable the Reserve to eliminate approximately 329 positions in eight functional areas with potential annual savings of about $16 million. Our analysis indicated that additional staffing reductions are possible over the long term through further application of industry practices and decreases in the number of managers. However, such staffing reductions will require further analysis by management to determine the specific number of staffing reductions that are attainable. The actual staffing reductions realized by the Reserve will be heavily influenced by several factors.

  3. Staffing Formula Worksheet: How to Choose a Staffing Formula for Your Class Staffing Formulas, also known as Course Classifications, determine the character and size of your class.

    E-Print Network [OSTI]

    de Lijser, Peter

    1 Staffing Formula Worksheet: How to Choose a Staffing Formula for Your Class Staffing Formulas the choice of Staffing Formula also has consequences for faculty workload, be sure to consult with the chair of your department before submitting your course proposal. The most commonly used Staffing Formulas

  4. Safety System Oversight Staffing Analysis (Instructions, Blank...

    Office of Environmental Management (EM)

    modifications since changes to the worksheet format may inadvertently change included formula referenced cells. SSO Alternate Staffing Analysis - Instructions SSO Alternate...

  5. 2013 Annual Workforce Analysis and Staffing Plan Report - Office...

    Office of Environmental Management (EM)

    3 Annual Workforce Analysis and Staffing Plan Report - Office of River Protection 2013 Annual Workforce Analysis and Staffing Plan Report - Office of River Protection Managers...

  6. 2013 Annual Workforce Analysis and Staffing Plan Report - Portsmouth...

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

    2013 Annual Workforce Analysis and Staffing Plan Report - Portsmouth Paducah Project Office 2013 Annual Workforce Analysis and Staffing Plan Report - Portsmouth Paducah Project...

  7. 2011 Annual Workforce Analysis and Staffing Plan Report - Office...

    Office of Environmental Management (EM)

    1 Annual Workforce Analysis and Staffing Plan Report - Office of River Protection 2011 Annual Workforce Analysis and Staffing Plan Report - Office of River Protection Managers...

  8. 2013 Annual Workforce Analysis and Staffing Plan Report - Oak...

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

    3 Annual Workforce Analysis and Staffing Plan Report - Oak Ridge Office of Environmental Management 2013 Annual Workforce Analysis and Staffing Plan Report - Oak Ridge Office of...

  9. 2010 Annual Workforce Analysis and Staffing Plan Report - Los...

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

    0 Annual Workforce Analysis and Staffing Plan Report - Los Alamos Site Office 2010 Annual Workforce Analysis and Staffing Plan Report - Los Alamos Site Office Managers perform an...

  10. 2012 Annual Workforce Analysis and Staffing Plan Report - Livermore...

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

    2 Annual Workforce Analysis and Staffing Plan Report - Livermore Field Office 2012 Annual Workforce Analysis and Staffing Plan Report - Livermore Field Office Managers perform an...

  11. 2013 Annual Workforce Analysis and Staffing Plan Report - Office...

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

    2013 Annual Workforce Analysis and Staffing Plan Report - Office of Science Chicago Office 2013 Annual Workforce Analysis and Staffing Plan Report - Office of Science Chicago...

  12. 2011 Annual Workforce Analysis and Staffing Plan Report - Oak...

    Energy Savers [EERE]

    Office 2012 Annual Workforce Analysis and Staffing Plan Report - Oak Ridge Office 2013 Annual Workforce Analysis and Staffing Plan Report - Nuclear Energy Oak Ridge Site Office...

  13. 2012 Annual Workforce Analysis and Staffing Plan Report - Oak...

    Office of Environmental Management (EM)

    Staffing Plan Report - Oak Ridge Office of Environmental Management 2013 Annual Workforce Analysis and Staffing Plan Report - Nuclear Energy Oak Ridge Site Office 2012 Annual...

  14. Human Resources Staffing Plan for the Tank Farm Contractor

    SciTech Connect (OSTI)

    BOSLEY, J.W.

    2000-04-22T23:59:59.000Z

    The Human Resources Staffing Plan quantified the equivalent staffing needs required for the Tank Farm Contractor (TFC) and its subcontractors to execute the readiness to proceed baseline between FY 2000-2008. The TFC staffing needs were assessed along with the staffings needs of Fluor Hanford and the privatization contractor. The plan then addressed the staffing needs and recruitment strategies required to execute the baseline.

  15. Do You Have Adequate Staffing to Keep Costs Under Control?

    E-Print Network [OSTI]

    Mergens, E. H.

    Competitive pressures have forced companies to seek reduced costs through reduced staffing. The emphasis has been on fixed cost control at the expense of some loss in variable cost control. Restructuring through reduced staffing has some pitfalls...

  16. Staffing for Electronic Resource Management: the Results of a Survey

    E-Print Network [OSTI]

    Duranceau, Ellen

    2002-01-01T23:59:59.000Z

    The authors offer the results of an informal survey of library staffing trends related to the acquisition and maintenance of electronic resources. They test their hypothesis that the problem of staffing for e-resources has ...

  17. Safety System Oversight Staffing Analysis- Example

    Broader source: Energy.gov [DOE]

    This Staffing Analysis calculation is completed using an Excel worksheet. Information locations are identified by titles in column or row headings and worksheet locations based on the unmodified blank. Use caution when making worksheet modifications since changes to the worksheet format may inadvertently change included formula referenced cells.

  18. 2014 Annual Workforce Analysis and Staffing Plan Report - Portsmouth...

    Office of Environmental Management (EM)

    Portsmouth Paducah Project Office 2014 Annual Workforce Analysis and Staffing Plan Report - Portsmouth Paducah Project Office Managers perform an annual workforce analysis of...

  19. 2010 Workforce Analysis and Staffing Plan Report Memo, Guidance...

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

    Capability Order, DOE 0 426.1, requires that managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities...

  20. 2014 Annual Workforce Analysis and Staffing Plan Report - Nevada...

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

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation...

  1. 2014 Workforce Analysis and Staffing Plan Report Memo, Guidance...

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

    Capability Order, DOE O 426.1, requires that managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities...

  2. 2014 Annual Workforce Analysis and Staffing Plan Report - Sandia...

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

    Sandia Field Office 2014 Annual Workforce Analysis and Staffing Plan Report - Sandia Field Office Managers perform an annual workforce analysis of their organization and develop...

  3. 2014 Annual Workforce Analysis and Staffing Plan Report - Livermore...

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

    Livermore Field Office 2014 Annual Workforce Analysis and Staffing Plan Report - Livermore Field Office Managers perform an annual workforce analysis of their organization and...

  4. 2011 Workforce Analysis and Staffing Plan Report Memo, Guidance...

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

    0 426.1, requires that managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need...

  5. 2013 Workforce Analysis and Staffing Plan Report Memo, Guidance...

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

    Capability Order, DOE 0 426.1, requires that managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities...

  6. 2012 Workforce Analysis and Staffing Plan Report Memo, Guidance...

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

    O 426.1, requires that managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need...

  7. CY 2011 Annual Workforce Analysis and Staffing Plan Report -...

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

    Workforce Analysis and Staffing Plan Report As of December 31, 2011 Reporting Office: NNSA NA-40 Section One - Current Mission (s) of the Organization and Potential Changes 1....

  8. 2010 Annual Workforce Analysis and Staffing Plan Report- NNSA HQ

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  9. 2011 Annual Workforce Analysis and Staffing Plan Report- NNSA HQ

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  10. 2014 Annual Workforce Analysis and Staffing Plan Report- NNSA HQ

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  11. 2011 Annual Workforce Analysis and Staffing Plan Report - NNSA...

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

    Workforce Analysis and Staffing Plan Report As of December 31, 2011 Reporting Office: NNSA NA-10 HQ (including NA-15 inputs) Section One: Current Mission(s) of the Organization...

  12. 2011 Annual Workforce Analysis and Staffing Plan Report - NNSA...

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

    Workforce Analysis and Staffing Plan Report As of December 31, 2011 Reporting Office: NNSA NA-SH Section One: Current Mission(s) of the Organization and Potential Changes The...

  13. 2011 Annual Workforce Analysis and Staffing Plan Report - NNSA...

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

    Workforce Analysis and Staffing Plan Report As of December 31, 2011 Reporting Office: NNSA NA-70 Section One: Current Mission(s) of the Organization and Potential Changes 1. DNS...

  14. 2013 Annual Workforce Analysis and Staffing Plan Report- Office of Health, Safety and Security

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  15. 2014 Annual Workforce Analysis and Staffing Plan Report- Richland Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  16. 2013 Annual Workforce Analysis and Staffing Plan Report- Chief of Nuclear Safety

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  17. 2014 Annual Workforce Analysis and Staffing Plan Report- Chief of Nuclear Safety

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  18. 2012 Annual Workforce Analysis and Staffing Plan Report- Chief of Nuclear Safety

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  19. ‘Jack Be Nimble…Quick’, and Communicative: Flexible Staffing Positions for Changing Technical Services Workflows

    E-Print Network [OSTI]

    Rathmel, Angela

    2011-11-04T23:59:59.000Z

    As library purchases for their collections move to predominantly electronic and patron-driven, acquisitions staffing has been changing to meet demands of fast paced and more complex workflows. For large academic institutions ...

  20. 2014 Annual Workforce Analysis and Staffing Plan Report- Office of Science

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  1. 2012 Annual Workforce Analysis and Staffing Plan Report- Sandia Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  2. 2010 Annual Workforce Analysis and Staffing Plan Report- Savannah River Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  3. 2013 Annual Workforce Analysis and Staffing Plan Report- Los Alamos Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  4. 2013 Annual Workforce Analysis and Staffing Plan Report- Pacific Northwest Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  5. 2011 Annual Workforce Analysis and Staffing Plan Report- Idaho Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  6. 2010 Annual Workforce Analysis and Staffing Plan Report- Idaho Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  7. 2010 Annual Workforce Analysis and Staffing Plan Report- NNSA Service Center

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  8. 2013 Annual Workforce Analysis and Staffing Plan Report- Portsmouth Paducah Project Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  9. 2011 Annual Workforce Analysis and Staffing Plan Report- Savannah River Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  10. 2011 Annual Workforce Analysis and Staffing Plan Report- Office of Science

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  11. 2012 Annual Workforce Analysis and Staffing Plan Report- Idaho Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  12. 2012 Annual Workforce Analysis and Staffing Plan Report- Portsmouth Paducah Project Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  13. 2010 Annual Workforce Analysis and Staffing Plan Report- Richland Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  14. 2013 Annual Workforce Analysis and Staffing Plan Report- Sandia Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  15. 2010 Annual Workforce Analysis and Staffing Plan Report- Livermore Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  16. 2011 Annual Workforce Analysis and Staffing Plan Report- Pantex Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  17. 2012 Annual Workforce Analysis and Staffing Plan Report- Office of Environmental Management

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  18. 2011 Annual Workforce Analysis and Staffing Plan Report- Office of Environmental Management

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  19. 2012 Annual Workforce Analysis and Staffing Plan Report- Oak Ridge Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  20. 2014 Annual Workforce Analysis and Staffing Plan Report- NNSA Production Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  1. 2014 Annual Workforce Analysis and Staffing Plan Report- Carlsbad Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  2. 2013 Annual Workforce Analysis and Staffing Plan Report- Carlsbad Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  3. 2014 Annual Workforce Analysis and Staffing Plan Report- Los Alamos Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  4. 2012 Annual Workforce Analysis and Staffing Plan Report- Carlsbad Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  5. 2014 Annual Workforce Analysis and Staffing Plan Report- Savannah River Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  6. 2014 Annual Workforce Analysis and Staffing Plan Report- Savannah River Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  7. 2013 Annual Workforce Analysis and Staffing Plan Report- Savannah River Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  8. 2012 Annual Workforce Analysis and Staffing Plan Report- Savannah River Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  9. 2010 Annual Workforce Analysis and Staffing Plan Report- Carlsbad Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  10. 2010 Annual Workforce Analysis and Staffing Plan Report- Savannah River Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  11. 2011 Annual Workforce Analysis and Staffing Plan Report- Savannah River Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  12. 2012 Annual Workforce Analysis and Staffing Plan Report- NNSA Production Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  13. 2013 Annual Workforce Analysis and Staffing Plan Report- NNSA Production Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  14. 2010 Annual Workforce Analysis and Staffing Plan Report- Y-12 Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  15. 2011 Annual Workforce Analysis and Staffing Plan Report- Portsmouth Paducah Project Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  16. 2010 Annual Workforce Analysis and Staffing Plan Report- Portsmouth Paducah Project Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  17. 2011 Annual Workforce Analysis and Staffing Plan Report- Pacific Northwest Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  18. 2010 Annual Workforce Analysis and Staffing Plan Report- Pacific Northwest Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  19. 2012 Annual Workforce Analysis and Staffing Plan Report- Pacific Northwest Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  20. 2010 Annual Workforce Analysis and Staffing Plan Report- EM Consolidated Business Center

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  1. 2011 Annual Workforce Analysis and Staffing Plan Report- EM Consolidated Business Center

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  2. 2012 Annual Workforce Analysis and Staffing Plan Report- EM Consolidated Business Center

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  3. 2010 Annual Workforce Analysis and Staffing Plan Report- Office of Science

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  4. 2012 Annual Workforce Analysis and Staffing Plan Report- Office of Science

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  5. 2013 Annual Workforce Analysis and Staffing Plan Report- Office of Science

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  6. 2011 Annual Workforce Analysis and Staffing Plan Report- Carlsbad Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  7. 2014 Annual Workforce Analysis and Staffing Plan Report- Office of Environmental Management

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  8. 2014 Annual Workforce Analysis and Staffing Plan Report- Idaho Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  9. 2014 Annual Workforce Analysis and Staffing Plan Report- Pacific Northwest Site Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  10. 2013 Annual Workforce Analysis and Staffing Plan Report- Office of Environmental Management

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  11. 2013 Annual Workforce Analysis and Staffing Plan Report- Savannah River Field Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  12. 2012 Annual Workforce Analysis and Staffing Plan Report- West Valley Demonstration Project

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  13. 2011 Annual Workforce Analysis and Staffing Plan Report- Office of Health, Safety and Security

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  14. 2013 Annual Workforce Analysis and Staffing Plan Report- Idaho Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  15. 2013 Annual Workforce Analysis and Staffing Plan Report- Richland Operations Office

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  16. 2010 Annual Workforce Analysis and Staffing Plan Report- Office of Health, Safety and Security

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  17. 2012 Annual Workforce Analysis and Staffing Plan Report- Office of Health, Safety and Security

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  18. 2014 Annual Workforce Analysis and Staffing Plan Report- Office of Environment, Health, Safety and Security

    Broader source: Energy.gov [DOE]

    Managers perform an annual workforce analysis of their organization and develop staffing plans that identify technical capabilities and positions they need to ensure safe operation of defense nuclear facilities.

  19. Fast Approximate Convex Decomposition 

    E-Print Network [OSTI]

    Ghosh, Mukulika

    2012-10-19T23:59:59.000Z

    Approximate convex decomposition (ACD) is a technique that partitions an input object into "approximately convex" components. Decomposition into approximately convex pieces is both more efficient to compute than exact ...

  20. Approximate Maximum Principle for Discrete Approximations of ...

    E-Print Network [OSTI]

    2012-03-20T23:59:59.000Z

    Approximations of Optimal Control Systems with. Nonsmooth .... of any endpoint constraints on trajectories of linear one-dimensional control systems in (PN ).

  1. Approximation of Stochastic Process

    E-Print Network [OSTI]

    Alois Pichler

    2012-05-08T23:59:59.000Z

    May 8, 2012 ... The approximation of stochastic processes by trees is an important topic in ... process ? is replaced by a finitely valued stochastic scenario ...

  2. Multicriteria approximation through decomposition

    SciTech Connect (OSTI)

    Burch, C. [Carnegie Mellon Univ., Pittsburgh, PA (United States). School of Computer Sciences]|[Sandia National Labs., Albuquerque, NM (United States); Krumke, S. [Univ. of Wuerzburg (Germany). Dept. of Computer Science; Marathe, M. [Los Alamos National Lab., NM (United States); Phillips, C. [Sandia National Labs., Albuquerque, NM (United States). Applied Mathematics Dept.; Sundberg, E. [Rutgers Univ., NJ (United States). Dept. of Computer Science]|[Sandia National Labs., Albuquerque, NM (United States)

    1997-12-01T23:59:59.000Z

    The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of the technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. The method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximation algorithms with provable guarantees for a number of new problems. The particular results obtained in this paper include the following: (1) The authors demonstrate how the technique can be used to provide more understanding of previous results and new algorithms for classical problems such as Multicriteria Spanning Trees, and Suitcase Packing. (2) They show how the ideas can be extended to apply to multicriteria optimization problems, in which they wish to minimize a certain objective function subject to one or more budget constraints. As corollaries they obtain first non-trivial multicriteria approximation algorithms for problems including the k-Hurdle and the Network Inhibition problems.

  3. Multicriteria approximation through decomposition

    SciTech Connect (OSTI)

    Burch, C. [Carnegie Mellon Univ., Pittsburgh, PA (United States). School of Computer Science; Krumke, S. [Univ. of Wuerzburg (Germany). Dept. of Computer Science; Marathe, M. [Los Alamos National Lab., NM (United States); Phillips, C. [Sandia National Labs., Albuquerque, NM (United States). Applied Mathematics Dept.; Sundberg, E. [Rutgers Univ., NJ (United States). Dept. of Computer Science

    1998-06-01T23:59:59.000Z

    The authors propose a general technique called solution decomposition to devise approximation algorithms with provable performance guarantees. The technique is applicable to a large class of combinatorial optimization problems that can be formulated as integer linear programs. Two key ingredients of their technique involve finding a decomposition of a fractional solution into a convex combination of feasible integral solutions and devising generic approximation algorithms based on calls to such decompositions as oracles. The technique is closely related to randomized rounding. Their method yields as corollaries unified solutions to a number of well studied problems and it provides the first approximation algorithms with provable guarantees for a number of new problems. The particular results obtained in this paper include the following: (1) the authors demonstrate how the technique can be used to provide more understanding of previous results and new algorithms for classical problems such as Multicriteria Spanning Trees, and Suitcase Packing; (2) they also show how the ideas can be extended to apply to multicriteria optimization problems, in which they wish to minimize a certain objective function subject to one or more budget constraints. As corollaries they obtain first non-trivial multicriteria approximation algorithms for problems including the k-Hurdle and the Network Inhibition problems.

  4. Uniform asymptotic approximations of integrals 

    E-Print Network [OSTI]

    Khwaja, Sarah Farid

    2014-07-01T23:59:59.000Z

    In this thesis uniform asymptotic approximations of integrals are discussed. In order to derive these approximations, two well-known methods are used i.e., the saddle point method and the Bleistein method. To start with ...

  5. Supporting Text Approximation of the Multinomial. Using Stirling's approximation

    E-Print Network [OSTI]

    Peterson, Carsten

    Supporting Text Approximation of the Multinomial. Using Stirling's approximation n! (n/e)n 2n! . [S12] To calculate B L (^n) limN BN L (^n), we apply Stirling's formula to N!, n0!, and n1!, which that r Stirling's formula

  6. Mechanism design with approximate types

    E-Print Network [OSTI]

    Zhu, Zeyuan Allen

    2012-01-01T23:59:59.000Z

    In mechanism design, we replace the strong assumption that each player knows his own payoff type exactly with the more realistic assumption that he knows it only approximately: each player i only knows that his true type ...

  7. Transient approximations in queueing networks

    E-Print Network [OSTI]

    Andrewartha, John Michael

    1989-01-01T23:59:59.000Z

    TRANSIENT APPROXIMATIONS IN QUEUEING NETWORKS A Thesis by JOHN MICHAEL ANDREWARTHA Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE May 1989... Major Subject: Electrical Engineering TRANSIENT APPROXIMATIONS IN QUEUEING NETWORKS A Thesis JOHN MICHAEL ANDREWARTHA Approved as to style and content by: P. E. Cantrell (Chair of Committee) m P7~ W. K. Tsai (Member) J. D. Gibson (Member) R...

  8. Convex approximations in stochastic programming by semidefinite ...

    E-Print Network [OSTI]

    2010-04-19T23:59:59.000Z

    This experience leads us to force the convexity of the approximating quadratic ..... As we can see, the least-squares approximation works well only if the data ...

  9. Approximating Metal-Insulator Transitions

    E-Print Network [OSTI]

    C. Danieli; K. Rayanov; B. Pavlov; G. Martin; S. Flach

    2014-05-06T23:59:59.000Z

    We consider quantum wave propagation in one-dimensional quasiperiodic lattices. We propose an iterative construction of quasiperiodic potentials from sequences of potentials with increasing spatial period. At each finite iteration step the eigenstates reflect the properties of the limiting quasiperiodic potential properties up to a controlled maximum system size. We then observe approximate metal-insulator transitions (MIT) at the finite iteration steps. We also report evidence on mobility edges which are at variance to the celebrated Aubry-Andre model. The dynamics near the MIT shows a critical slowing down of the ballistic group velocity in the metallic phase similar to the divergence of the localization length in the insulating phase.

  10. Reflectance Function Approximation for Material Classification

    E-Print Network [OSTI]

    Dyer, Charles R.

    Reflectance Function Approximation for Material Classification Edward Wild CS 766 Final Project This report summarizes the results of a project to approximate reflectance functions and classify materials to classify materials. Classification algorithms are proposed to deal with unseen materials. Experimental

  11. Kinetic Modeling and Thermodynamic Closure Approximation of ...

    E-Print Network [OSTI]

    2007-10-03T23:59:59.000Z

    Oct 5, 2007 ... Kinetic Modeling and Thermodynamic Closure. Approximation of Liquid Crystal Polymers. Haijun Yu. Program in Applied and Computational ...

  12. Fast Local Approximation to Global Illumination

    E-Print Network [OSTI]

    Wyman, Chris

    based technique #12;Approach to Shadows · Assume: ­ Approximate shadow umbra with hard shadow ­ Object

  13. Staffing Guide for Project Management

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2010-06-03T23:59:59.000Z

    This Guide provides an approach to determining the appropriate level and type of federal personnel needed to effectively plan, direct, and oversee project execution. Admin Chg 1, dated 10-12-11, cancels DOE G 413.3-19.

  14. Finite element approximation of coupled seismic and ...

    E-Print Network [OSTI]

    zyserman

    layer, having a thickness of about 10 nm. Finite element approximation of coupled seismic and electromagnetic waves in gas hydrate-bearing sediments – p.

  15. Optimization Online - Equivalence of an Approximate Linear ...

    E-Print Network [OSTI]

    Alejandro Toriello

    2013-02-07T23:59:59.000Z

    Feb 7, 2013 ... Equivalence of an Approximate Linear Programming Bound with the Held-Karp Bound for the Traveling Salesman Problem. Alejandro Toriello ...

  16. Optimization Online - Probabilistic optimization via approximate p ...

    E-Print Network [OSTI]

    W. van vAckooij

    2015-05-27T23:59:59.000Z

    May 27, 2015 ... Probabilistic optimization via approximate p-efficient points and bundle methods. W. van vAckooij(wim.van-ackooij ***at*** edf.fr )

  17. Successive Convex Approximations to Cardinality-Constrained ...

    E-Print Network [OSTI]

    2012-04-16T23:59:59.000Z

    Replacing the ?0-norm (car- dinality) constraint in (P) by the above DC approximation ?(x, t), we obtain the following quadratic program with a DC constraint: (Pt).

  18. Approximations by Orthonormal Mapped Chebyshev Functions for ...

    E-Print Network [OSTI]

    2014-03-12T23:59:59.000Z

    a School of Mathematical Science, Xiamen University, 361005 Xiamen, China .... suitable mapping can be used to approximate functions on the whole line R (cf.

  19. Section 2.5: Approximations Using Increments

    E-Print Network [OSTI]

    2014-04-05T23:59:59.000Z

    Feb 26, 2014 ... Lesson 19. Definition. Examples. In this lesson we will discuss a method for approximating the value of a function at a specified point.

  20. Blood Management Using Approximate Linear Programming

    E-Print Network [OSTI]

    Shenoy, Prashant

    Blood Management Using Approximate Linear Programming Marek Petrik and Shlomo Zilberstein January 13th, 2009 Marek Petrik and Shlomo Zilberstein () Blood Management Using Approximate Linear ProgrammingJanuary 13th, 2009 1 / 36 #12;Blood Inventory Management Problem Regional blood banks: Aggregate

  1. Approximate error conjugation gradient minimization methods

    DOE Patents [OSTI]

    Kallman, Jeffrey S

    2013-05-21T23:59:59.000Z

    In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

  2. Wave-mechanics and the adhesion approximation

    E-Print Network [OSTI]

    C. J. Short; P. Coles

    2006-11-22T23:59:59.000Z

    The dynamical equations describing the evolution of a self-gravitating fluid of cold dark matter (CDM) can be written in the form of a Schrodinger equation coupled to a Poisson equation describing Newtonian gravity. It has recently been shown that, in the quasi-linear regime, the Schrodinger equation can be reduced to the exactly solvable free-particle Schrodinger equation. The free-particle Schrodinger equation forms the basis of a new approximation scheme -the free-particle approximation - that is capable of evolving cosmological density perturbations into the quasi-linear regime. The free-particle approximation is essentially an alternative to the adhesion model in which the artificial viscosity term in Burgers' equation is replaced by a non-linear term known as the quantum pressure. Simple one-dimensional tests of the free-particle method have yielded encouraging results. In this paper we comprehensively test the free-particle approximation in a more cosmologically relevant scenario by appealing to an N-body simulation. We compare our results with those obtained from two established methods: the linearized fluid approach and the Zeldovich approximation. We find that the free-particle approximation comprehensively out-performs both of these approximation schemes in all tests carried out and thus provides another useful analytical tool for studying structure formation on cosmological scales.

  3. Optimization of Multibody Systems using Approximation Concepts

    E-Print Network [OSTI]

    Etman, L.F. Pascal

    UNIVERSITEIT EINDHOVEN Optimization of multibody systems using approximation concepts / Lodewijk Franciscus Pascal Etman. - Eindhoven : Technische Universiteit Eindhoven, 1997. - XVIII, 140 p. - With ref concepts / crashworthiness design / vehicle suspension Druk: Universiteitsdrukkerij TU Eindhoven Support

  4. Hardness of approximation for quantum problems

    E-Print Network [OSTI]

    Sevag Gharibian; Julia Kempe

    2012-09-05T23:59:59.000Z

    The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using these techniques, we also obtain hardness of approximation for the class QCMA. Our approach is based on the use of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomial hierarchy [Umans, FOCS 1999]. The problems for which we prove hardness of approximation for include, among others, a quantum version of the Succinct Set Cover problem, and a variant of the local Hamiltonian problem with hybrid classical-quantum ground states.

  5. Approximation algorithms for QMA-complete problems

    E-Print Network [OSTI]

    Sevag Gharibian; Julia Kempe

    2011-01-20T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Artur Pessoa

    2006-09-02T23:59:59.000Z

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

  7. RESTRICTED-TRACE APPROXIMATION FOR NUCLEAR ANTIFERROMAGNETISM

    E-Print Network [OSTI]

    Boyer, Edmond

    1353 RESTRICTED-TRACE APPROXIMATION FOR NUCLEAR ANTIFERROMAGNETISM M. GOLDMAN and G. SARMA Service to predict several properties of nuclear antiferromagnetic structures : sublattice magnetization of nuclear dipolar magnetic ordering, either antiferromagnetic or ferromagnetic, has been reported

  8. Approximate Bivariate Factorization, a Geometric Andre Galligo

    E-Print Network [OSTI]

    Hoeij, Mark van

    INRIA) Laboratoire de Mathematiques Parc Valrose 06108 Nice cedex 02, France galligo@unice.fr Mark van, Maple Code 1. INTRODUCTION 1.1 Approximate algebra Over the past ten years symbolic-numeric algorithms

  9. Optimization in Geometric Graphs: Complexity and Approximation

    E-Print Network [OSTI]

    Kahruman-Anderoglu, Sera

    2011-02-22T23:59:59.000Z

    We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact...

  10. Polymer state approximations of Schroedinger wave functions

    E-Print Network [OSTI]

    Klaus Fredenhagen; Felix Reszewski

    2006-08-25T23:59:59.000Z

    It is shown how states of a quantum mechanical particle in the Schroedinger representation can be approximated by states in the so-called polymer representation. The result may shed some light on the semiclassical limit of loop quantum gravity.

  11. A fresh look at the adhesion approximation

    E-Print Network [OSTI]

    Thomas Buchert

    1997-11-04T23:59:59.000Z

    I report on a systematic derivation of the phenomenological ``adhesion approximation'' from gravitational instability together with a brief evaluation of the related status of analytical modeling of large-scale structure.

  12. Linear source approximation in CASMO5

    SciTech Connect (OSTI)

    Ferrer, R.; Rhodes, J. [Studsvik Scandpower, Inc., 504 Shoup Ave., Idaho Falls, ID 83402 (United States); Smith, K. [Dept. of Nuclear Science and Engineering, Massachusetts Inst. of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139 (United States)

    2012-07-01T23:59:59.000Z

    A Linear Source (LS) approximation has been implemented in the two-dimensional Method of Characteristics (MOC) transport solver in a prototype version of CASMO5. The LS approximation, which relies on the computation of trajectory-based spatial moments over source regions to obtain the linear source expansion coefficients, improves the solution accuracy relative to the 'flat' or constant source approximation. In addition, the LS formulation is capable of treating arbitrarily-shaped source regions and is compatible with standard Coarse-Mesh Finite Difference (CMFD) acceleration. Numerical tests presented in this paper for the C5G7 MOX benchmark show that, for comparable accuracy with respect to the reference solution, the LS approximation can reduce the run time by a factor of four and the memory requirements by a factor often relative to the FS scheme. (authors)

  13. Approximate inference in Gaussian graphical models

    E-Print Network [OSTI]

    Malioutov, Dmitry M., 1981-

    2008-01-01T23:59:59.000Z

    The focus of this thesis is approximate inference in Gaussian graphical models. A graphical model is a family of probability distributions in which the structure of interactions among the random variables is captured by a ...

  14. Harmonic Wavelet Transform and Image Approximation

    E-Print Network [OSTI]

    Zhang, Zhihua; Saito, Naoki

    2010-01-01T23:59:59.000Z

    DOI 10.1007/s10851-010-0202-x Harmonic Wavelet Transform andwe approximate f by a harmonic function u such that thebanks. We call this the Harmonic Wavelet Transform (HWT).

  15. Transient queueing approximations for computer networks

    E-Print Network [OSTI]

    Baker, William A.

    1986-01-01T23:59:59.000Z

    for just the mean. Rothkopf/Oren's and Chang/Wang's methods obtained mean and variance values, and Clark's method produced several quantities which were used to find mean and variance statistics. For the M/M/1 case, the approximations by Gark and Chang... were very ac- curate over a wide range of input patterns and initial conditions. Rothkopf's was accurate over sll conditions but never as accurate as Chang or Clark. Johnston's and Rider's approximations performed acceptably only over some...

  16. Approximate Killing Fields as an Eigenvalue Problem

    E-Print Network [OSTI]

    Christopher Beetle

    2008-08-12T23:59:59.000Z

    Approximate Killing vector fields are expected to help define physically meaningful spins for non-symmetric black holes in general relativity. However, it is not obvious how such fields should be defined geometrically. This paper relates a definition suggested recently by Cook and Whiting to an older proposal by Matzner, which seems to have been overlooked in the recent literature. It also describes how to calculate approximate Killing fields based on these proposals using an efficient scheme that could be of immediate practical use in numerical relativity.

  17. Extending the Eikonal Approximation to Low Energy

    E-Print Network [OSTI]

    Pierre Capel; Tokuro Fukui; Kazuyuki Ogata

    2014-11-21T23:59:59.000Z

    E-CDCC and DEA, two eikonal-based reaction models are compared to CDCC at low energy (e.g. 20AMeV) to study their behaviour in the regime at which the eikonal approximation is supposed to fail. We confirm that these models lack the Coulomb deflection of the projectile by the target. We show that a hybrid model, built on the CDCC framework at low angular momenta and the eikonal approximation at larger angular momenta gives a perfect agreement with CDCC. An empirical shift in impact parameter can also be used reliably to simulate this missing Coulomb deflection.

  18. Realizing Physical Approximation of the Partial Transpose

    E-Print Network [OSTI]

    Hyang-Tag Lim; Yong-Su Kim; Young-Sik Ra; Joonwoo Bae; Yoon-Ho Kim

    2011-04-18T23:59:59.000Z

    The partial transpose by which a subsystem's quantum state is solely transposed is of unique importance in quantum information processing from both fundamental and practical point of view. In this work, we present a practical scheme to realize a physical approximation to the partial transpose using local measurements on individual quantum systems and classical communication. We then report its linear optical realization and show that the scheme works with no dependence on local basis of given quantum states. A proof-of-principle demonstration of entanglement detection using the physical approximation of the partial transpose is also reported.

  19. Approximate initial data for binary black holes

    E-Print Network [OSTI]

    Kenneth A. Dennison; Thomas W. Baumgarte; Harald P. Pfeiffer

    2006-08-26T23:59:59.000Z

    We construct approximate analytical solutions to the constraint equations of general relativity for binary black holes of arbitrary mass ratio in quasicircular orbit. We adopt the puncture method to solve the constraint equations in the transverse-traceless decomposition and consider perturbations of Schwarzschild black holes caused by boosts and the presence of a binary companion. A superposition of these two perturbations then yields approximate, but fully analytic binary black hole initial data that are accurate to first order in the inverse of the binary separation and the square of the black holes' momenta.

  20. Blind Channel Equalization and -Approximation Algorithms

    E-Print Network [OSTI]

    Ye, Yinyu

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

  1. FRACTAL APPROXIMATION AND COMPRESSION USING PROJECTED IFS

    E-Print Network [OSTI]

    Baskurt, Atilla

    FRACTAL APPROXIMATION AND COMPRESSION USING PROJECTED IFS �ric Guérin, �ric Tosan and Atilla, or images) with fractal models is an important center of interest for research. The general inverse problem.The most known of them is the fractal image compression method introduced by Jacquin. Generally speaking

  2. Approximate Inference and Protein-Folding

    E-Print Network [OSTI]

    Weiss, Yair

    Approximate Inference and Protein-Folding Chen Yanover and Yair Weiss School of Computer Science Side-chain prediction is an important subtask in the protein-folding problem. We show that #12;nding algorithms, including a widely used protein-folding software (SCWRL). 1 Introduction Inference in graphical

  3. APPROXIMATION ALGORITHMS FOR SCHEDULING a dissertation

    E-Print Network [OSTI]

    Chekuri, Chandra

    Approved for the University Committee on Graduate Studies: iii #12; iv #12; Abstract This thesis describes instance of the problem, returns a solution whose value is within some guaranteed multiplicative factor ff release dates only we obtain an e e\\Gamma1 ' 1:58 approximation. For the parallel machine case we obtain

  4. Polynomial Approximations for Continuous Linear Programs

    E-Print Network [OSTI]

    2012-04-05T23:59:59.000Z

    where the cost rate c(t), the right hand side vector b(t) as well as the matrices. G(t) and H(t, ... dual approximations, respectively, estimates the degree of suboptimality of the ...... the matrix of capital coefficients, where Bij defines the stock of good i required per unit of ...... In Optimization methods for resource allocation (Proc.

  5. Symbolic Test Selection Based on Approximate Analysis

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Symbolic Test Selection Based on Approximate Analysis Bertrand Jeannet, Thierry J´eron, Vlad Rusu}@irisa.fr Abstract. This paper addresses the problem of generating symbolic test cases for testing the conformance. The challenge we consider is the selection of test cases according to a test purpose, which is here a set

  6. Approximating Power Indices --Theoretical and Empirical Analysis

    E-Print Network [OSTI]

    Rosenschein, Jeff

    , by providing lower bounds for both deter- ministic and randomized algorithms for calculating power indices. WeApproximating Power Indices -- Theoretical and Empirical Analysis Yoram Bachrach School and Computer Science, The Hebrew University, Jerusalem, Israel Amin Saberi Department of Management Science

  7. Kirchhoff approximation for diffusive waves Jorge Ripoll*

    E-Print Network [OSTI]

    Lorenzo, Jorge Ripoll

    Laboratoire d'Energetique Moleculaire et Macroscopique, Combustion, Ecole Centrale Paris, Centre National de for accurately solving the direct scattering problem 17,18,23 for arbitrary geometries, but these methods,26 . This approximation is a linear method that does not involve matrix inversion while solving the forward problem

  8. IMPROVING THE APPROXIMATION AND CONVERGENCE CAPABILITIES OF

    E-Print Network [OSTI]

    Yeung, Dit-Yan

    ­dimensional data. Projection pursuit learning (PPL) formulates PPR in a neural network framework. One major difference between PPR and PPL is that the smoothers in PPR are nonparametric, whereas those in PPL are based known, we demonstrate that PPL networks do not have the universal approximation and strong convergence

  9. Approximating Human Reaching Volumes Using Inverse Kinematics

    E-Print Network [OSTI]

    Rodríguez, Inmaculada

    of reach: standing reach, which is useful in computer animation where virtual humans have to interact. Introduction Virtual Humans are a valuable medium for gaining knowledge and understanding about the human bodyApproximating Human Reaching Volumes Using Inverse Kinematics I. Rodrígueza , M. Peinadoa , R

  10. Orthogonal Polynomial Approximation in Higher Dimensions: Applications in Astrodynamics

    E-Print Network [OSTI]

    Bani Younes, Ahmad H.

    2013-08-05T23:59:59.000Z

    harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to...

  11. VISCOSITY AND RELAXATION APPROXIMATIONS FOR HYPERBOLIC SYSTEMS OF CONSERVATION LAWS

    E-Print Network [OSTI]

    Tzavaras, Athanasios E.

    VISCOSITY AND RELAXATION APPROXIMATIONS FOR HYPERBOLIC SYSTEMS deal with the approximation of conservation * *laws via viscosity or relaxation. The following topics are covered: The general structure of viscosity and relaxation approximations is discu

  12. A numerical approximation to distribution function

    E-Print Network [OSTI]

    Tuttle, Keith Allan

    1977-01-01T23:59:59.000Z

    then is to approximate F(Y) numerically. We sub- divide the unit cube Q into N cubes eqch of length h I/N on a n n side. Within each individual subcube Q , we will define an affine approximation to f, W = g(x , . . . , x ), which requires the gradient of 1' ' 'n our... & h/2, k k i + 1/2 2 n k k = 1, 2, . . . , n]. Let f(x) f C [Q ] the space of twice continuously n differentiable functions on Q , and define the auxiliary function g(x) as the tangent to f at x. i + 1 2 for x f Q. . That is, if x I Q i (x) f (x1 2...

  13. Compressed Indexes for Approximate String Matching

    E-Print Network [OSTI]

    Sung, Wing-Kin Ken"

    Compressed Indexes for Approximate String Matching Ho-Leung Chan1 Tak-Wah Lam1, Wing-Kin Sung2 Siu the index space to O(n log n). Huynh et al. [10] and Lam et al. [11] further compressed the index to O,wongss}@comp.nus.edu.sg Abstract. We revisit the problem of indexing a string S[1..n] to support searching all substrings

  14. Approximating spheroid inductive responses using spheres

    SciTech Connect (OSTI)

    Smith, J. Torquil; Morrison, H. Frank

    2003-12-12T23:59:59.000Z

    The response of high permeability ({mu}{sub r} {ge} 50) conductive spheroids of moderate aspect ratios (0.25 to 4) to excitation by uniform magnetic fields in the axial or transverse directions is approximated by the response of spheres of appropriate diameters, of the same conductivity and permeability, with magnitude rescaled based on the differing volumes, D.C. magnetizations, and high frequency limit responses of the spheres and modeled spheroids.

  15. BLOCK DIAGONALLY DOMINANT POSITIVE DEFINITE APPROXIMATE FILTERS AND SMOOTHERS

    E-Print Network [OSTI]

    BLOCK DIAGONALLY DOMINANT POSITIVE DEFINITE APPROXIMATE FILTERS AND SMOOTHERS Running title: BLOCKÆciently small as to preclude the loss of positive de#12;niteness in the approximate equations. Therefore

  16. BLOCK DIAGONALLY DOMINANT POSITIVE DEFINITE APPROXIMATE FILTERS AND SMOOTHERS

    E-Print Network [OSTI]

    BLOCK DIAGONALLY DOMINANT POSITIVE DEFINITE APPROXIMATE FILTERS AND SMOOTHERS Running title: BLOCK the loss of positive definiteness in the approximate equations. Therefore previous analyses have

  17. Verified integrity properties for safe approximate program transformations

    E-Print Network [OSTI]

    Kim, Deokhwan

    Approximate computations (for example, video, audio, and image processing, machine learning, and many scientific computations) have the freedom to generate a range of acceptable results. Approximate program transformations ...

  18. Relativistic Random Phase Approximation At Finite Temperature

    SciTech Connect (OSTI)

    Niu, Y. F. [State Key Laboratory for Nuclear Physics and Technology, School of Physics, Peking University, Beijing 100871 (China); Physics Department, Faculty of Science, University of Zagreb (Croatia); Paar, N.; Vretenar, D. [Physics Department, Faculty of Science, University of Zagreb (Croatia); Meng, J. [State Key Laboratory for Nuclear Physics and Technology, School of Physics, Peking University, Beijing 100871 (China)

    2009-08-26T23:59:59.000Z

    The fully self-consistent finite temperature relativistic random phase approximation (FTRRPA) has been established in the single-nucleon basis of the temperature dependent Dirac-Hartree model (FTDH) based on effective Lagrangian with density dependent meson-nucleon couplings. Illustrative calculations in the FTRRPA framework show the evolution of multipole responses of {sup 132}Sn with temperature. With increased temperature, in both monopole and dipole strength distributions additional transitions appear in the low energy region due to the new opened particle-particle and hole-hole transition channels.

  19. Entangled games are hard to approximate

    E-Print Network [OSTI]

    Julia Kempe; Hirotada Kobayashi; Keiji Matsumoto; Ben Toner; Thomas Vidick

    2007-11-21T23:59:59.000Z

    We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) quantum verifier and two entangled provers or (ii) classical verifier and three entangled provers. Previously it was not even known if computing the value exactly is NP-hard. We also describe a mathematical conjecture, which, if true, would imply hardness of approximation to within a constant. We start our proof by describing two ways to modify classical multi-prover games to make them resistant to entangled provers. We then show that a strategy for the modified game that uses entanglement can be ``rounded'' to one that does not. The results then follow from classical inapproximability bounds. Our work implies that, unless P=NP, the values of entangled-prover games cannot be computed by semidefinite programs that are polynomial in the size of the verifier's system, a method that has been successful for more restricted quantum games.

  20. Analytic approximate radiation effects due to Bremsstrahlung

    SciTech Connect (OSTI)

    Ben-Zvi I.

    2012-02-01T23:59:59.000Z

    The purpose of this note is to provide analytic approximate expressions that can provide quick estimates of the various effects of the Bremsstrahlung radiation produced relatively low energy electrons, such as the dumping of the beam into the beam stop at the ERL or field emission in superconducting cavities. The purpose of this work is not to replace a dependable calculation or, better yet, a measurement under real conditions, but to provide a quick but approximate estimate for guidance purposes only. These effects include dose to personnel, ozone generation in the air volume exposed to the radiation, hydrogen generation in the beam dump water cooling system and radiation damage to near-by magnets. These expressions can be used for other purposes, but one should note that the electron beam energy range is limited. In these calculations the good range is from about 0.5 MeV to 10 MeV. To help in the application of this note, calculations are presented as a worked out example for the beam dump of the R&D Energy Recovery Linac.

  1. VISCOSITY AND RELAXATION APPROXIMATIONS FOR HYPERBOLIC SYSTEMS OF CONSERVATION LAWS

    E-Print Network [OSTI]

    Tzavaras, Athanasios E.

    VISCOSITY AND RELAXATION APPROXIMATIONS FOR HYPERBOLIC SYSTEMS OF CONSERVATION LAWS Athanasios E. Tzavaras Abstract. These lecture notes deal with the approximation of conservation laws via viscosity or relaxation. The following topics are covered: The general structure of viscosity and relaxation

  2. Adaptive approximation of higher order posterior statistics

    SciTech Connect (OSTI)

    Lee, Wonjung, E-mail: leew@maths.ox.ac.uk

    2014-02-01T23:59:59.000Z

    Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively.

  3. Regular Type III and Type N Approximate Solutions

    E-Print Network [OSTI]

    Philip Downes; Paul MacAllevey; Bogdan Nita; Ivor Robinson

    2001-05-18T23:59:59.000Z

    New type III and type N approximate solutions which are regular in the linear approximation are shown to exist. For that, we use complex transformations on self-dual Robinson-Trautman metrics rather then the classical approach. The regularity criterion is the boundedness and vanishing at infinity of a scalar obtained by saturating the Bel-Robinson tensor of the first approximation by a time-like vector which is constant with respect to the zeroth approximation.

  4. Optimization Online - Approximation of rank function and its ...

    E-Print Network [OSTI]

    shujun Bi

    2011-07-10T23:59:59.000Z

    Jul 10, 2011 ... Particularly, with two families of approximation functions, we ... Citation: Department of Mathematics, South China University of Technology, ...

  5. BUILDING SURROGATE MODELS BASED ON DETAILED AND APPROXIMATE SIMULATIONS

    E-Print Network [OSTI]

    Seepersad, Carolyn Conner

    - Page 1 - BUILDING SURROGATE MODELS BASED ON DETAILED AND APPROXIMATE SIMULATIONS Zhiguang Qian is taken to integrate data from approximate and detailed simulations to build a surrogate model approximate simulations form the bulk of the data, and they are used to build a model based on a Gaussian

  6. Smoluchowski-Kramers approximation in the case of variable friction

    E-Print Network [OSTI]

    Mark Freidlin; Wenqing Hu

    2012-03-03T23:59:59.000Z

    We consider the small mass asymptotics (Smoluchowski-Kramers approximation) for the Langevin equation with a variable friction coefficient. The limit of the solution in the classical sense does not exist in this case. We study a modification of the Smoluchowski-Kramers approximation. Some applications of the Smoluchowski-Kramers approximation to problems with fast oscillating or discontinuous coefficients are considered.

  7. Technical Note Variational free energy and the Laplace approximation

    E-Print Network [OSTI]

    Daunizeau, Jean

    Technical Note Variational free energy and the Laplace approximation Karl Friston,a, Jérémie October 2006 This note derives the variational free energy under the Laplace approximation, with a focus. This is relevant when using the free energy as an approximation to the log-evidence in Bayesian model averaging

  8. Viscosity and Relaxation Approximation for Hyperbolic Systems of Conservation Laws

    E-Print Network [OSTI]

    Tzavaras, Athanasios E.

    Viscosity and Relaxation Approximation for Hyperbolic Systems of Conservation Laws Athanasios E with the approximation of conservation laws via viscosity or relaxation. The following topics are covered: The general structure of viscosity and relaxation approximations is discussed, as suggested by the second law

  9. Modulated power-law behaviour in Stirling's approximation

    E-Print Network [OSTI]

    Hatton, Les

    Modulated power-law behaviour in Stirling's approximation Les Hatton CISM, University of Kingston. This argument used Stirling's approximation which limits its relevance to larger component sizes. Although power to broaden Stirling's approximation to see if it corresponds with the departures from power-law observed

  10. Bond selective chemistry beyond the adiabatic approximation

    SciTech Connect (OSTI)

    Butler, L.J. [Univ. of Chicago, IL (United States)

    1993-12-01T23:59:59.000Z

    One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.

  11. Federal Staffing Guide for Project Management

    Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

    2010-06-03T23:59:59.000Z

    This Guide provides an approach to determining the appropriate level and type of federal personnel needed to effectively plan, direct, and oversee project execution. Superseded by DOE G 413.3-19 Admin Chg 1.

  12. Employment and Staffing | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33Frequently20,000 Russian NuclearandJunetrackEllen O'Kane Tauscher -The OCHO provides policy and

  13. Vehicle routing and staffing for sedan service

    E-Print Network [OSTI]

    routing the fleet throughout the day to satisfy customer demands within tight time ... response to single a new input, this yields a system in which the car service provider ..... Instead of building a graph separately for each subproblem, we build a ...

  14. Workforce Analysis and Staffing | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment of EnergyThePatricia Hoffman isThe MetalsNewslettersWorkforce

  15. approximately constrained elastic: Topics by E-print Network

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

    systems. The method approximates the distribution of the system state using a finite number of particles. By expressing these particles in terms of the control variables, we are...

  16. approximate distributed dynamic: Topics by E-print Network

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

    2 The Relation between Approximation in Distribution and Shadowing in Molecular Dynamics Mathematics Websites Summary: analysis is to explain the apparent reliabil- ity of...

  17. approximate dynamic programming: Topics by E-print Network

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

    STOCK Paris-Sud XI, Universit de 10 Approximate dynamic programming using model-free Bellman Residual Elimination MIT - DSpace Summary: This paper presents an...

  18. Approximating K-means-type clustering via semidefinite programming

    E-Print Network [OSTI]

    Jiming Peng

    2005-04-22T23:59:59.000Z

    Apr 22, 2005 ... Approximating K-means-type clustering via semidefinite ... Abstract: One of the fundamental clustering problems is to assign $n$ points into $k$ ...

  19. Outcome-Space Outer Approximation Algorithm for Linear ...

    E-Print Network [OSTI]

    2007-07-20T23:59:59.000Z

    Jul 20, 2007 ... This paper presents an outcome-space outer approximation algo- rithm for globally solving the linear multiplicative programming prob- lem.

  20. approximate analytical structural: Topics by E-print Network

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

    developed method has been extended to a nonlocal equation arising in steady water wave propagation in two dimensions. We obtain analyic approximation of steady water wave...

  1. Finding approximately rank-one submatrices with the nuclear norm ...

    E-Print Network [OSTI]

    2010-11-08T23:59:59.000Z

    We propose a convex optimization formulation with the nuclear norm and l1-norm to find a large approximately rank-one submatrix of a given nonnegative matrix ...

  2. Finding approximately rank-one submatrices with the nuclear norm ...

    E-Print Network [OSTI]

    Xuan Vinh Doan

    2010-11-08T23:59:59.000Z

    Nov 8, 2010 ... Abstract: We propose a convex optimization formulation with the nuclear norm and $\\ell_1$-norm to find a large approximately rank-one ...

  3. aerodynamic response approximation: Topics by E-print Network

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

    Page Topic Index 1 Managing Approximate Models in Evolutionary Aerodynamic Design Optimization Computer Technologies and Information Sciences Websites Summary: algorithm to a...

  4. approximate entropy based: Topics by E-print Network

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

    equation (1) nt + div n n Jngel, Ansgar 7 Regularization with Approximated L2 Maximum Entropy Method Physics Websites Summary: of a generalized moment of defined...

  5. approximate block newton: Topics by E-print Network

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

    Abstract An extended product-form approximation, based on the principle of maximum entropy (ME), is characterised Ould-Khaoua, Mohamed 28 Low-lying dipole response...

  6. ON LEAST SQUARES EUCLIDEAN DISTANCE MATRIX APPROXIMATION AND COMPLETION

    E-Print Network [OSTI]

    in biological or engineering applications, including molecular structure analysis, protein folding problem. distance geometry, least squares approximation, matrix completion, molecular structure, protein folding

  7. ON LEAST SQUARES EUCLIDEAN DISTANCE MATRIX APPROXIMATION AND COMPLETION

    E-Print Network [OSTI]

    in biological or engineering applications, including molecular structure analysis, protein folding problem approximation, matrix completion, molecular structure, protein folding, conformational analysis. 1. Introduction

  8. An Approximate Inference Approach to Temporal Optimization in Optimal Control

    E-Print Network [OSTI]

    Vijayakumar, Sethu

    on iterative local approximations present a practical approach to optimal control in robotic systems. However the optimal control framework. The proposed approach, which is applicable to plants with non-linear dynamicsAn Approximate Inference Approach to Temporal Optimization in Optimal Control Konrad C. Rawlik

  9. THE DIFFUSION APPROXIMATION FOR THE LINEAR BOLTZMANN EQUATION

    E-Print Network [OSTI]

    THE DIFFUSION APPROXIMATION FOR THE LINEAR BOLTZMANN EQUATION WITH VANISHING SCATTERING COEFFICIENT equation, Diffusion approximation, Neutron transport equation, Radiative transfer equation subject, 23], neutron transport theory [27]. A typical model linear Boltzmann equation is (t +· x)f(t,x,)= 1

  10. Uncertainty, Performance, and Model Dependency in Approximate Adaptive Nonlinear Control

    E-Print Network [OSTI]

    Szepesvari, Csaba

    Uncertainty, Performance, and Model Dependency in Approximate Adaptive Nonlinear Control M. French, and the performance of a class of approximate model based adaptive controllers is studied. An upper performance bound uncertainty model; control effort bounds require both L 2 and L 1 uncertainty models), and various structural

  11. Technical Note Variational free energy and the Laplace approximation

    E-Print Network [OSTI]

    Penny, Will

    Technical Note Variational free energy and the Laplace approximation Karl Friston,a, Jérémie the variational free energy under the Laplace approximation, with a focus on accounting for additional model complexity induced by increasing the number of model parameters. This is relevant when using the free energy

  12. Energy Content of Colliding Plane Waves using Approximate Noether Symmetries

    E-Print Network [OSTI]

    M. Sharif; Saira Waheed

    2011-09-19T23:59:59.000Z

    This paper is devoted to study the energy content of colliding plane waves using approximate Noether symmetries. For this purpose, we use approximate Lie symmetry method of Lagrangian for differential equations. We formulate the first-order perturbed Lagrangian for colliding plane electromagnetic and gravitational waves. It is shown that in both cases, there does not exist

  13. Approximate Dynamic Programming for Networks: Fluid Models and Constraint Reduction

    E-Print Network [OSTI]

    Veatch, Michael H.

    of approximating functions for the differential cost. The first contribution of this paper is identifying new or piece-wise quadratic. Fluid cost has been used to initialize the value iteration algorithm [5Approximate Dynamic Programming for Networks: Fluid Models and Constraint Reduction Michael H

  14. Approximation of Axisymmetric Darcy Flow V.J. Ervin

    E-Print Network [OSTI]

    Ervin, Vincent J.

    approximation of the Darcy equations in an ax- isymmetric domain, subject to axisymmetric data. Rewriting of convergence for the RT and BDM approximations. Key words. axisymmetric flow; Darcy equation, LBB condition AMSApproximation of Axisymmetric Darcy Flow V.J. Ervin Department of Mathematical Sciences Clemson

  15. Parametric Optimization of Artificial Neural Networks for Signal Approximation Applications

    E-Print Network [OSTI]

    Parametric Optimization of Artificial Neural Networks for Signal Approximation Applications J. Lane.thames@gatech.edu randal.abler@gatech.edu dirk.schaefer@me.gatech.edu ABSTRACT Artificial neural networks are used to solve set of configuration parameters for artificial neural networks such that the network's approximation

  16. Pixelcuts: Scalable Approximate Illumination from Many Point Lights

    E-Print Network [OSTI]

    Keinan, Alon

    Pixelcuts: Scalable Approximate Illumination from Many Point Lights Pramook Khungurn, Thatchaphol approximate low-frequency illumination from many point lights. Its running time is O(n+mk) where n is the number of pixels, m is the number of point lights, and k is a constant the user specifies. Our algorithm

  17. L^p Bernstein Inequalities and Radial Basis Function Approximation

    E-Print Network [OSTI]

    Ward, John P.

    2012-10-19T23:59:59.000Z

    proving Bernstein inequalites for the RBF approximants, we will be able to use them to derive corresponding inverse theorems. Direct theorems concerning approximation by RBFs will be the focus of Section 4 3. The abilty of Green’s functions to invert di...

  18. Fresnel approximations for acoustic fields of rectangularly symmetric sources

    E-Print Network [OSTI]

    Mast, T. Douglas

    Fresnel approximations for acoustic fields of rectangularly symmetric sources T. Douglas Masta for determining the acoustic fields of rectangularly symmetric, baffled, time-harmonic sources under the Fresnel. The expressions presented are generalized to three different Fresnel approximations that correspond, respectively

  19. Approximation of Harmonic Maps and Wave Maps Soren Bartels

    E-Print Network [OSTI]

    Bartels, Soeren

    Approximation of Harmonic Maps and Wave Maps S¨oren Bartels Partial differential equations to certain boundary condtions. If X = then critical points u : N are called harmonic maps into N, ·) = u0, tu(0, ·) = v0. To approximate harmonic maps or wave maps we consider a regular triangula- tion

  20. New approximation for free surface flow of groundwater: capillarity correction

    E-Print Network [OSTI]

    Walter, M.Todd

    capillarity correction for free surface groundwater flow as modelled by the Boussinesq equation is re; Shallow flow expansion; Simplified approximation 1. Introduction Groundwater heads in coastal aquifersNew approximation for free surface flow of groundwater: capillarity correction D.-S. Jeng a,*, B

  1. Properties of the Boltzmann equation in the classical approximation

    DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)

    Tanji, Naoto; Epelbaum, Thomas; Gelis, Francois; Wu, Bin

    2014-12-01T23:59:59.000Z

    We study the Boltzmann equation with elastic point-like scalar interactions in two different versions of the the classical approximation. Although solving numerically the Boltzmann equation with the unapproximated collision term poses no problem, this allows one to study the effect of the ultraviolet cutoff in these approximations. This cutoff dependence in the classical approximations of the Boltzmann equation is closely related to the non-renormalizability of the classical statistical approximation of the underlying quantum field theory. The kinetic theory setup that we consider here allows one to study in a much simpler way the dependence on the ultraviolet cutoff, since onemore »has also access to the non-approximated result for comparison.« less

  2. Properties of the Boltzmann equation in the classical approximation

    SciTech Connect (OSTI)

    Tanji, Naoto [Nishina Center, RIKEN, Wako (Japan). Theoretical Research Division; Brookhaven National Lab. (BNL), Upton, NY (United States); Epelbaum, Thomas [Institut de Physique Theorique (France); Gelis, Francois [Institut de Physique Theorique (France); Wu, Bin [Institut de Physique Theorique (France)

    2014-12-01T23:59:59.000Z

    We study the Boltzmann equation with elastic point-like scalar interactions in two different versions of the the classical approximation. Although solving numerically the Boltzmann equation with the unapproximated collision term poses no problem, this allows one to study the effect of the ultraviolet cutoff in these approximations. This cutoff dependence in the classical approximations of the Boltzmann equation is closely related to the non-renormalizability of the classical statistical approximation of the underlying quantum field theory. The kinetic theory setup that we consider here allows one to study in a much simpler way the dependence on the ultraviolet cutoff, since one has also access to the non-approximated result for comparison.

  3. Usefulness of bound-state approximations in reaction theory

    SciTech Connect (OSTI)

    Adhikari, S.K.

    1981-08-01T23:59:59.000Z

    A bound-state approximation when applied to certain operators, such as the many-body resolvent operator for a two-body fragmentation channel, in many-body scattering equations, reduces such equations to equivalent two-body scattering equations which are supposed to provide a good description of the underlying physical process. In this paper we test several variants of bound-state approximations in the soluble three-boson Amado model and find that such approximations lead to weak and unacceptable kernels for the equivalent two-body scattering equations and hence to a poor description of the underlying many-body process.

  4. Approximating the Minimum Spanning Tree Weight in Sublinear Time

    E-Print Network [OSTI]

    Trevisan, Luca

    Approximating the Minimum Spanning Tree Weight in Sublinear Time Bernard Chazelle #3; Ronitt a parameter 0 minimum spanning tree- components algorithm picks O(1=#15; 2 ) vertices in the graph and then grows \\local spanning trees" whose

  5. Approximate dynamic programming with applications in multi-agent systems

    E-Print Network [OSTI]

    Valenti, Mario J. (Mario James), 1976-

    2007-01-01T23:59:59.000Z

    This thesis presents the development and implementation of approximate dynamic programming methods used to manage multi-agent systems. The purpose of this thesis is to develop an architectural framework and theoretical ...

  6. PLASMA Approximate Dynamic Programming finally cracks the locomotive optimization problem

    E-Print Network [OSTI]

    Powell, Warren B.

    PLASMA ­ Approximate Dynamic Programming finally cracks the locomotive optimization problem schedules and new operating policies. PLASMA is currently running at Norfolk Southern for strategic of PLASMA: Each locomotive is modeled individually, making it possible to capture both horsepower

  7. Fast Approximations for Online Scheduling of Outpatient Procedure ...

    E-Print Network [OSTI]

    2014-06-18T23:59:59.000Z

    Jun 18, 2014 ... ? > SmU , any permutation of items to bins that uses the full amount of ... approximation solution value will both tend to cf mU + cv(? ? SmU ).

  8. SPLITTING MANIFOLD APPROXIMATE FIBRATIONS J. L. BRYANT AND P. KIRBY

    E-Print Network [OSTI]

    Aluffi, Paolo

    SPLITTING MANIFOLD APPROXIMATE FIBRATIONS J. L. BRYANT AND P. KIRBY Abstract. Suppose M, embeddings. Partially supported by NSF grant DMS-9626624. 1 #12; 2 J. L. BRYANT AND P. KIRBY 2. Definitions

  9. Numerical Approximations of Stochastic Optimal Stopping and Control Problems 

    E-Print Network [OSTI]

    Siska, David

    2007-01-01T23:59:59.000Z

    We study numerical approximations for the payoff function of the stochastic optimal stopping and control problem. It is known that the payoff function of the optimal stopping and control problem corresponds to the solution ...

  10. Approximate inference : decomposition methods with applications to networks

    E-Print Network [OSTI]

    Jung, Kyomin

    2009-01-01T23:59:59.000Z

    Markov random field (MRF) model provides an elegant probabilistic framework to formulate inter-dependency between a large number of random variables. In this thesis, we present a new approximation algorithm for computing ...

  11. Approximate translation : media, narrative, and experience in urban design

    E-Print Network [OSTI]

    Crisman, Jonathan

    2013-01-01T23:59:59.000Z

    Approximate translation is developed as a design process through which the place-embedded history of an urban environment can be understood, allowing for better design and intervention in that urban environment. Generally, ...

  12. Non-ideal boson system in the Gaussian approximation

    SciTech Connect (OSTI)

    Tommasini, P.R. [Institute for Theoretical Atomic and Molecular Physics, Harvard-Smithsonian Center for Astrophysics, Cambridge, Massachusetts 02138 (United States)] [Institute for Theoretical Atomic and Molecular Physics, Harvard-Smithsonian Center for Astrophysics, Cambridge, Massachusetts 02138 (United States); de Toledo Piza, A.F. [Instituto de Fisica, Universidade de Sao Paulo, C.P. 66318, 05389-970 Sao Paulo, SP, (Brasil)] [Instituto de Fisica, Universidade de Sao Paulo, C.P. 66318, 05389-970 Sao Paulo, SP, (Brasil)

    1997-01-01T23:59:59.000Z

    We investigate ground-state and thermal properties of a system of non-relativistic bosons interacting through repulsive, two-body interactions in a self-consistent Gaussian mean-field approximation which consists in writing the variationally determined density operator as the most general Gaussian functional of the quantized field operators. Finite temperature results are obtained in a grand canonical framework. Contact is made with the results of Lee, Yang, and Huang in terms of particular truncations of the Gaussian approximation. The full Gaussian approximation supports a free phase or a thermodynamically unstable phase when contact forces and a standard renormalization scheme are used. When applied to a Hamiltonian with zero range forces interpreted as an effective theory with a high momentum cutoff, the full Gaussian approximation generates a quasi-particle spectrum having an energy gap, in conflict with perturbation theory results. {copyright} 1997 Academic Press, Inc.

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

    E-Print Network [OSTI]

    Krishnan, Bharath Kumar

    2006-01-01T23:59:59.000Z

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

  14. Generalized eikonal approximation for strong-field ionization

    E-Print Network [OSTI]

    Vélez, F Cajiao; Kami?ski, J Z

    2015-01-01T23:59:59.000Z

    We develop the eikonal perturbation theory to describe the strong-field ionization by finite laser pulses. This approach in the first order with respect to the binding potential (the so-called generalized eikonal approximation) avoids a singularity at the potential center. Thus, in contrast to the ordinary eikonal approximation, it allows to treat rescattering phenomena in terms of quantum trajectories. We demonstrate how the first Born approximation and its domain of validity follow from eikonal perturbation theory. Using this approach, we study the coherent diffraction patterns in photoelectron energy spectra and their modifications induced by the interaction of photoelectrons with the atomic potential. Along with these first results, we discuss the prospects of using the generalized eikonal approximation to study strong-field ionization from multi-centered atomic systems and to study other strong-field phenomena.

  15. Approximate Associative Memristive Memory for Energy-Efficient GPUs

    E-Print Network [OSTI]

    Liebling, Michael

    Approximate Associative Memristive Memory for Energy-Efficient GPUs Abbas Rahimi, Amirali Ghofrani at the architectural and algorithmic levels. At the hardware level, energy-efficiency techniques that employ voltage

  16. Penumbra Maps: Approximate Soft Shadows in Real-Time

    E-Print Network [OSTI]

    Wyman, Chris

    ;Penumbra Map Assumptions · A hard shadow is a reasonable approximation for a shadow's umbra · Object silhouettes remain constant over light's surface #12;Key Insight · When using a hard shadow as the umbra, all

  17. Shorter Tours by Nicer Ears 7/5-approximation for graphic TSP,

    E-Print Network [OSTI]

    Vygen, Jens

    case called Graphic TSP: approximation ratio 1.5 - (Gharan, Saberi, Singh [2011]) approximation ratio 1, Saberi, Singh [2011]) approximation ratio 1.461 (M¨omke, Svensson [2011]) approximation ratio 1

  18. Approximation of linear partial differential equations on spheres 

    E-Print Network [OSTI]

    Le Gia, Quoc Thong

    2004-09-30T23:59:59.000Z

    Subject: Mathematics iii ABSTRACT Approximation of Linear Partial Di®erential Equations on Spheres. (August 2003) Quoc Thong Le Gia, B.S., University of New South Wales; M.S., Texas A&M University Co{Chairs of Advisory Committee: Dr. Joseph D. Ward Dr... . . . . . . . . . . . . . . . . . 15 II INTERPOLATION ON SPHERES BY DILATED SBFs : : : : 16 A. Approximation theorems . . . . . . . . . . . . . . . . . . . 16 B. Locally supported basis functions on Rn+1 and Sn . . . . . 18 1. Compactly supported strictly positive de¯nite func- tions...

  19. Mean field approximation for noisy delay coupled excitable neurons

    E-Print Network [OSTI]

    Nikola Buric; Dragana Rankovic; Kristina Todorovic; Nebojsa Vasovic

    2010-03-26T23:59:59.000Z

    Mean field approximation of a large collection of FitzHugh-Nagumo excitable neurons with noise and all-to-all coupling with explicit time-delays, modelled by $N\\gg 1$ stochastic delay-differential equations is derived. The resulting approximation contains only two deterministic delay-differential equations but provides excellent predictions concerning the stability and bifurcations of the averaged global variables of the exact large system.

  20. Anisotropic Homogeneous Cosmologies in the Post-Newtonian Approximation

    E-Print Network [OSTI]

    Tamath Rainsford

    2000-07-23T23:59:59.000Z

    In this paper we explore how far the post-Newtonian theory goes in overcoming the difficulties associated with anisotropic homogeneous cosmologies in the Newtonian approximation. It will be shown that, unlike in the Newtonian case, the cosmological equations of the post-Newtonian approximation are much more in the spirit of general relativity with regard to the nine Bianchi types and issues of singularities. The situations of vanishing rotation and vanishing shear are treated separately. The homogeneous Bianchi I model is considered as an example of a rotation-free cosmology with anisotropy. It is found in the Newtonian approximation that there are arbitrary functions that need to be given for all time if the initial value problem is to be well-posed, while in the post-Newtonian case there is no such need. For the general case of a perfect fluid only the post-Newtonian theory can satisfactorily describe the effects of pressure. This is in accordance with findings in an earlier paper where the post-Newtonian approximation was applied to homogeneous cosmologies. For a shear-free anisotropic homogeneous cosmology the Newtonian theory of Heckmann and Sch\\"ucking is explored. Comparisons with its relativistic and post-Newtonian counterparts are made. In the Newtonian theory solutions exist to which there are no analogues in general relativity. The post-Newtonian approximation may provide a way out.

  1. Variational principles with Padé approximants for tearing mode analysis

    SciTech Connect (OSTI)

    Cole, Andrew J. [Department of Applied Physics and Applied Mathematics, Columbia University, New York, New York 10027 (United States)] [Department of Applied Physics and Applied Mathematics, Columbia University, New York, New York 10027 (United States); Finn, John M. [Applied Mathematics and Plasma Physics, Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87544 (United States)] [Applied Mathematics and Plasma Physics, Theoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87544 (United States)

    2014-03-15T23:59:59.000Z

    Tearing modes occur in several distinct physical regimes, and it is often important to compute the inner layer response for these modes with various effects. There is a need for an approximate and efficient method of solving the inner layer equations in all these regimes. In this paper, we introduce a method of solving the inner layer equations based on using a variational principle with Padé approximants. For all the regimes considered, the main layer equations to be solved are inhomogeneous, and Padé approximants give a convenient and efficient method of satisfying the correct asymptotic behavior at the edge of the layer. Results using this variational principle—Padé approximant method in three of these regimes is presented. These regimes are the constant-? resistive-inertial (RI) regime, the constant-? viscoresistive regime, and the non-constant-? inviscid tearing regime. The last regime includes the constant-? RI regime and the inertial regime. The results show that reasonable accuracy can be obtained very efficiently with Padé approximants having a small number of parameters.

  2. Approximations by gravitational fields due to restricted unit point masses

    E-Print Network [OSTI]

    Shull, Carolyn Sue Flowers

    1973-01-01T23:59:59.000Z

    approximations by Chui (1, 3, 4j and D. J. Newman $12$. Some open problems will be discussed including a conjecture by Chui f2]. I ht th ' th ~Pdl f~hA 1 Mth i I ~gociet is used as a pattern for format, CHAPTER I UNIFORM APPROXIMATION ON COMPACT SETS Let C... free analytic functions in D are not approximable. Also the following result was obtained in fgj . THEOREM 1. 4. A closed set R dis oint from a domain D which lies in som h lf- 1 ne H is ol omial a roximation set relative t b~fl fRt~tbf th I t f3d...

  3. Non-perturbative QCD amplitudes in quenched and eikonal approximations

    SciTech Connect (OSTI)

    Fried, H.M. [Physics Department, Brown University, Providence, RI 02912 (United States); Grandou, T., E-mail: Thierry.Grandou@inln.cnrs.fr [Université de Nice-Sophia Antipolis, Institut Non Linéaire de Nice, UMR 6618 CNRS 7335, 1361 routes des Lucioles, 06560 Valbonne (France); Sheu, Y.-M., E-mail: ymsheu@alumni.brown.edu [Université de Nice-Sophia Antipolis, Institut Non Linéaire de Nice, UMR 6618 CNRS 7335, 1361 routes des Lucioles, 06560 Valbonne (France)

    2014-05-15T23:59:59.000Z

    Even though approximated, strong coupling non-perturbative QCD amplitudes remain very difficult to obtain. In this article, in eikonal and quenched approximations at least, physical insights are presented that rely on the newly-discovered property of effective locality. The present article also provides a more rigorous mathematical basis for the crude approximations used in the previous derivation of the binding potential of quarks and nucleons. Furthermore, the techniques of Random Matrix calculus along with Meijer G-functions are applied to analyze the generic structure of fermionic amplitudes in QCD. - Highlights: • We discuss the physical insight of effective locality to QCD fermionic amplitudes. • We show that an unavoidable delta function goes along with the effective locality property. • The generic structure of QCD fermion amplitudes is obtained through Random Matrix calculus.

  4. Analytical approximations for x-ray cross sections III

    SciTech Connect (OSTI)

    Biggs, F; Lighthill, R

    1988-08-01T23:59:59.000Z

    This report updates our previous work that provided analytical approximations to cross sections for both photoelectric absorption of photons by atoms and incoherent scattering of photons by atoms. This representation is convenient for use in programmable calculators and in computer programs to evaluate these cross sections numerically. The results apply to atoms of atomic numbers between 1 and 100 and for photon energiesgreater than or equal to10 eV. The photoelectric cross sections are again approximated by four-term polynomials in reciprocal powers of the photon energy. There are now more fitting intervals, however, than were used previously. The incoherent-scattering cross sections are based on the Klein-Nishina relation, but use simpler approximate equations for efficient computer evaluation. We describe the averaging scheme for applying these atomic results to any composite material. The fitting coefficients are included in tables, and the cross sections are shown graphically. 100 graphs, 1 tab.

  5. On the approximation of crack shapes found during inservice inspection

    SciTech Connect (OSTI)

    Bhate, S.R.; Chawla, D.S.; Kushwaha, H.S. [Bhabha Atomic Research Centre, Bombay (India)] [and others

    1997-04-01T23:59:59.000Z

    This paper addresses the characterization of axial internal flaw found during inservice inspection of a pipe. J-integral distribution for various flaw shapes is obtained using line spring finite, element method. The peak J-value and its distribution across the crack is found to be characteristic feature of each shape. The triangular shape yields peak J-value away from the center, the point of depth. The elliptic approximation results in large overestimate of J-value for unsymmetric flaws. Triangular approximation is recommended for such flaws so that further service can be obtained from the component.

  6. Perturbative stability of the approximate Killing field eigenvalue problem

    E-Print Network [OSTI]

    Christopher Beetle; Shawn Wilder

    2013-12-31T23:59:59.000Z

    An approximate Killing field may be defined on a compact, Riemannian geometry by solving an eigenvalue problem for a certain elliptic operator. This paper studies the effect of small perturbations in the Riemannian metric on the resulting vector field. It shows that small metric perturbations, as measured using a Sobolev-type supremum norm on the space of Riemannian geometries on a fixed manifold, yield small perturbations in the approximate Killing field, as measured using a Hilbert-type square integral norm. It also discusses applications to the problem of computing the spin of a generic black hole in general relativity.

  7. Dynamical entanglement versus symmetry and dynamics of classical approximations

    SciTech Connect (OSTI)

    Buric, Nikola [Department of Physics and Mathematics, Faculty of Pharmacy, University of Beograd, Vojvode Stepe 450, 11000 Belgrade (Serbia and Montenegro)

    2006-05-15T23:59:59.000Z

    It is shown that dynamical entanglement between two qubits depends on the symmetry of the quantum model. On the other hand, the latter is reflected in the qualitative properties of the dynamics of a classical approximation of the quantum system. For generic separable pure initial states, the dynamical entanglement is larger if the system is less symmetric and its classical approximation is chaotic. The influence of different types of Markov environments on the established relation between the dynamical entanglement, symmetry and the classical dynamics is also studied.

  8. August and September Approximately 29 percent from husks

    E-Print Network [OSTI]

    minutes. Cool promptly in several changes of cold water and drain. Whole-kernel corn: Cut kernels from. Scrape the cobs with the back of the knife to remove the juice and the hearts of the kernels. Pack corn for approximately the same length of time the corn was blanched) and drain well. Tightly ',vrap ears individually

  9. Fractal Inverse Problem: Approximation Formulation and Differential Methods

    E-Print Network [OSTI]

    Guérin, Eric

    Fractal Inverse Problem: Approximation Formulation and Differential Methods ´Eric Gu´erin1 Introduction 1.1 Fractal Inverse Problem The fractal inverse problem is an important research area with a great number of potential application fields. It consists in finding a fractal model or code that generates

  10. Approximating the Minimum Spanning Tree Weight in Sublinear Time

    E-Print Network [OSTI]

    Goldwasser, Shafi

    Approximating the Minimum Spanning Tree Weight in Sublinear Time #3; Bernard Chazelle y Ronitt a parameter 0 minimum span- ning tree in the graph and then grows \\local spanning trees" whose sizes are speci#12;ed by a stochastic process. From

  11. Boundary approximate controllability of some linear parabolic April 5, 2013

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Boundary approximate controllability of some linear parabolic systems April 5, 2013 Guillaume Olive controllability of two classes of linear parabolic systems, namely a system of n heat equations coupled through are the only ones concerning the boundary controllability of linear parabolic systems of heat-type. For more

  12. Exact and Approximate Sampling by Systematic Stochastic Search

    E-Print Network [OSTI]

    Tenenbaum, Josh

    Exact and Approximate Sampling by Systematic Stochastic Search Vikash Mansinghka MIT BCS & CSAIL exact samples over high-dimensional spaces from exact sam- ples over lower-dimensional subspaces. Our do this by generalizing ideas from classic AI search to the stochastic setting. Just as systematic

  13. An Equivalence Between Sparse Approximation and Support Vector Machines 1

    E-Print Network [OSTI]

    Poggio, Tomaso

    An Equivalence Between Sparse Approximation and Support Vector Machines 1 Federico Girosi Center is equivalent to SVM in the following sense: if applied to the same data set the two techniques give the same; Chen, Donoho and Saunders, 1995), are actually equivalent, in the case of noiseless data. By equivalent

  14. Calculating reactor transfer functions by Pade approximation via Lanczos algorithm

    E-Print Network [OSTI]

    Pázsit, Imre

    Calculating reactor transfer functions by PadeÃ? approximation via Lanczos algorithm Zhifeng Kuang a function of a reactor, i.e. the neutron noise induced by a localised perturbation is calculated in one, *,1 , Imre PaÃ? zsit a , Axel Ruhe b a Department of Reactor Physics, Chalmers University of Technology

  15. Non-linear regression models for Approximate Bayesian Computation

    E-Print Network [OSTI]

    Robert, Christian P.

    Non-linear regression models for Approximate Bayesian Computation (ABC) Michael Blum Olivier ABC #12;Blum and OF (2009) suggest the use of non-linear conditional heteroscedastic regression models) Linear regression-based ABC can sometimes be improved #12;abc of ABC Using stochastic simulations

  16. Sensitivity, Approximation and Uncertainty in Power System Dynamic Simulation

    E-Print Network [OSTI]

    1 Sensitivity, Approximation and Uncertainty in Power System Dynamic Simulation Ian A. Hiskens, Fellow, IEEE Jassim Alseddiqui Student Member, IEEE Abstract-- Parameters of power system models the influence of uncertainty in simulations of power system dynamic behaviour. It is shown that trajectory

  17. Geometric Wavelet Approximations and Abdourrahmane M. Atto1

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    1 Geometric Wavelet Approximations and Dierencing Abdourrahmane M. Atto1 , Emmanuel Trouve2 Jean-Marie Nicolas3 , Abstract--The paper introduces the concept of ge- ometric wavelets defined from multiplicative algebras. These wavelets perform generalized geometric approx- imations and differencing. The paper also

  18. A Study of Approximate Data Management Techniques for Sensor Networks

    E-Print Network [OSTI]

    Martin, Ralph R.

    the monitoring operation of sensor nodes by efficiently using their limited energy, bandwidth and computation. The network can therefore be treated as a distributed sensor data management system. Sensor networks differA Study of Approximate Data Management Techniques for Sensor Networks Adonis Skordylis, Niki

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

    E-Print Network [OSTI]

    Powell, Warren B.

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

  20. Introduction Approximately 40% of rural Ethiopia (WaterAid, 2010)

    E-Print Network [OSTI]

    Walter, M.Todd

    Introduction Approximately 40% of rural Ethiopia (WaterAid, 2010) lacks access to clean water for water pumping is one alternative in the rural areas of Ethiopia since most of the population has technologies for water pumping in Ethiopia and especially in Amhara Region is limited. The promotion

  1. Combining Conjugate Direction Methods with Stochastic Approximation of Gradients

    E-Print Network [OSTI]

    Schraudolph, Nicol N.

    Combining Conjugate Direction Methods with Stochastic Approximation of Gradients #3; Nicol N-8092 Zurich, Switzerland http://www.icos.ethz.ch/ Abstract The method of conjugate directions provides from conjugate gra- dient in the stochastic (online) setting, us- ing fast Hessian-gradient products

  2. Combining Conjugate Direction Methods with Stochastic Approximation of Gradients

    E-Print Network [OSTI]

    Schraudolph, Nicol N.

    Combining Conjugate Direction Methods with Stochastic Approximation of Gradients Nicol N-8092 Z¨urich, Switzerland http://www.icos.ethz.ch/ Abstract The method of conjugate directions provides conjugate gra- dient in the stochastic (online) setting, us- ing fast Hessian-gradient products to set up

  3. APPROXIMATE INVERSE PRECONDITIONING FOR THE CONJUGATE GRADIENT METHOD

    E-Print Network [OSTI]

    Tùma, Miroslav

    APPROXIMATE INVERSE PRECONDITIONING FOR THE CONJUGATE GRADIENT METHOD ON A VECTOR COMPUTER Michele definite matrix, by the preconditioned conjugate gradient method (PCG) (see, e.g., [4]). It is well of the conjugate gradient method reduces to computing a matrix­ vector product with G, an operation which offers

  4. Fast approximation of the bootstrap for model selection

    E-Print Network [OSTI]

    Verleysen, Michel

    Fast approximation of the bootstrap for model selection G. Simon1 , A. Lendasse2 , V. Wertz2 , M. The bootstrap resampling method may be efficiently used to estimate the generalization error of a family with the bootstrap in real-world applications is the high computation load. In this paper we propose a simple

  5. Bootstrap for model selection: linear approximation of the optimism

    E-Print Network [OSTI]

    Verleysen, Michel

    Bootstrap for model selection: linear approximation of the optimism G. Simon1 , A. Lendasse2 , M. Lemaître 4, B-1348 Louvain-la-Neuve, Belgium, lendasse@auto.ucl.ac.be Abstract. The bootstrap resampling, as artificial neural networks. Nevertheless, the use of the bootstrap implies a high computational load

  6. Approximating many-body induction to efficiently describe molecular liquids

    E-Print Network [OSTI]

    Herbert, John

    on the structure and solvation dynamics of the excess electron (in the ground state) but does have a large impact as the structures and properties of molecular systems. This study focuses on approximating many-body electronic methods in order to allow "on-the-fly" energy and force evaluations in dynamical calculations

  7. 3-D cinematography with approximate and no geometry

    E-Print Network [OSTI]

    Magnor, Marcus

    3-D cinematography with approximate and no geometry Martin Eisemann, Timo Stich and Marcus Magnor Abstract 3-D cinematography is a new step towards full immersive video, allow- ing complete control of the book Image and Geometry Processing for 3-D Cinematography published by Springer. 1 Introduction

  8. A COMPUTATONAL METHOD FOR APPROXIMATING A DARCY-STOKES SYSTEM

    E-Print Network [OSTI]

    Arbogast, Todd

    of a second order elliptic (i.e., Darcy) equation on part of the domain coupled to a Stokes equation equation representing Darcy's law and mass conservation, and in the vugs s = \\ ¯d by the Stokes equationA COMPUTATONAL METHOD FOR APPROXIMATING A DARCY-STOKES SYSTEM GOVERNING A VUGGY POROUS MEDIUM TODD

  9. Accelerating Search of Approximate Match on Large Protein Sequence Databases

    E-Print Network [OSTI]

    Wang, Wei

    of supporting indexed search on large biological sequence databases since the construction cost of the index Yang 2 , Yi Xia 3 , Philip Yu 4 Keywords: protein sequence index, approximate match. Due. Building an appropriate index structure is one of the possibilities to achieve such a goal, which

  10. Local RBF Approximation for Scattered Data Fitting with Bivariate Splines

    E-Print Network [OSTI]

    Davydov, Oleg

    and large scale optimization problems arising if the interpolating, smoothing or minimal energy spline in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations of radial basis functions, so defining hybrid approximations which are still computed by discrete least

  11. How Synchronisation Strategy Approximation in PEPA Implementations affects Passage Time

    E-Print Network [OSTI]

    Imperial College, London

    time densities and dis- tributions from stochastic models defined in PEPA, a stochastic process algebra. In stochastic process algebras, the synchronisation policy is important for defin- ing how different system;good approximation to underlying aggregate complex but deterministic dynamics or genuine random

  12. How Synchronisation Strategy Approximation in PEPA Implementations affects Passage Time

    E-Print Network [OSTI]

    Bradley, Jeremy

    passage time densities and dis­ tributions from stochastic models defined in PEPA, a stochastic process algebra. In stochastic process algebras, the synchronisation policy is important for defin­ ing how, or a #12; good approximation to underlying aggregate complex but deterministic dynamics or genuine random

  13. Aqua: A Fast Decision Support System Using Approximate Query Answers

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    commercial relational DBMS. Aqua precomputes synopses (special sta- tistical summaries) of the original data and stores them in the DBMS. It provides approximate an- swers (with quality guarantees) by rewriting on top of any SQL- compliant DBMS managing a data warehouse. Aqua pre- computes statistical summaries

  14. Jitter-Approximation Tradeoff for Periodic Scheduling Zvika Brakerski

    E-Print Network [OSTI]

    Patt-Shamir, Boaz

    Jitter-Approximation Tradeoff for Periodic Scheduling Zvika Brakerski Dept. of Electrical the average period of a job in the schedule is blown up w.r.t. its requested period, and the jitter ratio with low jitter ratio allow the mobile devices to save power by hav- ing their receivers switched off

  15. NUMERICAL APPROXIMATION OF P-SYSTEMS WITH COULOMB FRICTIONAL DAMPING

    E-Print Network [OSTI]

    to the precise nature of the dissipation. Dry (Coulomb) friction is a limit case that has not been fully analyzed in the presence of dry ­ Coulomb­ friction. A model is described in detail in Section 2. A discretizationNUMERICAL APPROXIMATION OF P-SYSTEMS WITH COULOMB FRICTIONAL DAMPING KRISTY COFFEY AND PIERRE A

  16. Successive Rank-One Approximations of Nearly Orthogonally ...

    E-Print Network [OSTI]

    2015-03-01T23:59:59.000Z

    Mar 1, 2015 ... approximating SROA based on the power iteration method of [DLDMV00]. There ... perturbation E is sufficiently small (roughly on the order of 1/n under a natural measure). ... A real p-th order n-dimensional tensor ? ? ? p. R.

  17. Clustering With or Without the Approximation Frans Schalekamp

    E-Print Network [OSTI]

    Schalekamp, Frans

    Clustering With or Without the Approximation Frans Schalekamp ITCS, Tsinghua University Michael Yu MIT Anke van Zuylen ITCS, Tsinghua University Abstract We study algorithms for clustering data if we do not know values of and for which the assumption holds. Finally, we implement these methods

  18. Approximate Inference in Probabilistic Models Manfred Opper1

    E-Print Network [OSTI]

    of Electronics and Computer Science University of Southampton SO17 1BJ, United Kingdom mo@ecs.soton.ac.uk 2 on free energies. The free energy is constructed from two approximating distributions which encode differ Energy (GFE), an entropic quantity which (originally developed in Statistical Physics) allows us

  19. The Exemplar Breakpoint Distance for nontrivial genomes cannot be approximated

    E-Print Network [OSTI]

    Fertin, Guillaume

    The Exemplar Breakpoint Distance for non­trivial genomes cannot be approximated Guillaume Blin 1 ­ France guillaume.fertin@univ­nantes.fr Abstract. A promising and active field of comparative genomics con­ sists in comparing two genomes by establishing a one­to­one correspon­ dence (i.e., a matching) between

  20. Self-similar and charged spheres in the diffusion approximation

    E-Print Network [OSTI]

    W. Barreto; A. Da Silva

    2005-08-12T23:59:59.000Z

    We study spherical, charged and self--similar distributions of matter in the diffusion approximation. We propose a simple, dynamic but physically meaningful solution. For such a solution we obtain a model in which the distribution becomes static and changes to dust. The collapse is halted with damped mass oscillations about the absolute value of the total charge.

  1. Securely Computing an Approximate Median in Wireless Sensor Networks

    E-Print Network [OSTI]

    Setia, Sanjeev

    Securely Computing an Approximate Median in Wireless Sensor Networks Sankardas Roy 1 sroy1@gmu and the unattended nature of sensor nodes, sensor network protocols need to be designed with security in mind and efficient. Categories and Subject Descriptors C.2.0 [Computer-Communication Networks]: General- Security

  2. Quantum optimal control within the rotating wave approximation

    E-Print Network [OSTI]

    Maximilian Keck; Matthias M. Müller; Tommaso Calarco; Simone Montangero

    2015-03-06T23:59:59.000Z

    We study the interplay between rotating wave approximation and optimal control. In particular, we show that for a wide class of optimal control problems one can choose the control field such that the Hamiltonian becomes time-independent under the rotating wave approximation. Thus, we show how to recast the functional minimization defined by the optimal control problem into a simpler multi-variable function minimization. We provide the analytic solution to the state-to-state transfer of the paradigmatic two-level system and to the more general star configuration of an $N$-level system. We demonstrate numerically the usefulness of this approach in the more general class of connected acyclic $N$-level systems with random spectra. Finally, we use it to design a protocol to entangle Rydberg via constant laser pulses atoms in an experimentally relevant range of parameters.

  3. On approximate controllability of generalized KdV solitons

    E-Print Network [OSTI]

    Claudio Muñoz

    2014-05-24T23:59:59.000Z

    We consider the approximate control of solitons in generalized Korteweg-de Vries equations. By introducing a suitable internal bilinear control on the equation, we prove that any soliton is locally null controllable, and moreover, any soliton can be accelerated to any particular positive velocity, after a suitable large amount of time. Precise estimates on the error terms and the rate of decay in the approximate null controllability result are also given. Our method introduces a new insight on the control of nonlinear objects, from the point of view of interaction and collision problems for nonlinear dispersive equations, recently developed by Y. Martel and F. Merle. It can be applied in principle, to several other models with soliton solutions.

  4. Quasielastic electron-deuteron scattering in the weak binding approximation

    SciTech Connect (OSTI)

    Ethier, Jacob J. [William and Mary College, JLAB; Doshi, Nidhi P. [Carnegie Mellon University; Malace, Simona P. [JLAB; Melnitchouk, Wally [JLAB

    2014-06-01T23:59:59.000Z

    We perform a global analysis of all available electron-deuteron quasielastic scattering data using Q^2-dependent smearing functions that describe inclusive inelastic e-d scattering within the weak binding approximation. We study the dependence of the cross sections on the deuteron wave function and the off-shell extrapolation of the elastic electron-nucleon cross section, which show particular sensitivity at x >> 1. The excellent overall agreement with data over a large range of Q^2 and x suggest a limited need for effects beyond the impulse approximation, with the exception of the very high-x or very low-Q^2 regions, where short-distance effects in the deuteron become more relevant.

  5. Exploring approximations to the GW self-energy ionic gradients

    E-Print Network [OSTI]

    Faber, C; Attaccalite, C; Cannuccia, E; Duchemin, I; Deutsch, T; Blase, X

    2015-01-01T23:59:59.000Z

    The accuracy of the many-body perturbation theory GW formalism to calculate electron-phonon coupling matrix elements has been recently demonstrated in the case of a few important systems. However, the related computational costs are high and thus represent strong limitations to its widespread application. In the present study, we explore two less demanding alternatives for the calculation of electron-phonon coupling matrix elements on the many-body perturbation theory level. Namely, we test the accuracy of the static Coulomb-hole plus screened-exchange (COHSEX) approximation and further of the constant screening approach, where variations of the screened Coulomb potential W upon small changes of the atomic positions along the vibrational eigenmodes are neglected. We find this latter approximation to be the most reliable, whereas the static COHSEX ansatz leads to substantial errors. Our conclusions are validated in a few paradigmatic cases: diamond, graphene and the C60 fullerene. These findings open the way f...

  6. On the Peterlin approximation for turbulent flows of polymer solutions

    E-Print Network [OSTI]

    Dario Vincenzi; Prasad Perlekar; Luca Biferale; Federico Toschi

    2015-05-26T23:59:59.000Z

    We study the impact of the Peterlin approximation on the statistics of the end-to-end separation of poly- mers in a turbulent flow. The FENE and FENE-P models are numerically integrated along a large number of Lagrangian trajectories resulting from a direct numerical simulation of three-dimensional homogeneous isotropic turbulence. Although the FENE-P model yields results in qualitative agreement with those of the FENE model, quantitative differences emerge. The steady-state probability of large extensions is overesti- mated by the FENE-P model. The alignment of polymers with the eigenvectors of the rate-of-strain tensor and with the direction of vorticity is weaker when the Peterlin approximation is used. At large Weissenberg numbers, both the correlation times of the extension and of the orientation of polymers are underestimated by the FENE-P model.

  7. On the Peterlin approximation for turbulent flows of polymer solutions

    E-Print Network [OSTI]

    Vincenzi, Dario; Biferale, Luca; Toschi, Federico

    2015-01-01T23:59:59.000Z

    We study the impact of the Peterlin approximation on the statistics of the end-to-end separation of poly- mers in a turbulent flow. The FENE and FENE-P models are numerically integrated along a large number of Lagrangian trajectories resulting from a direct numerical simulation of three-dimensional homogeneous isotropic turbulence. Although the FENE-P model yields results in qualitative agreement with those of the FENE model, quantitative differences emerge. The steady-state probability of large extensions is overesti- mated by the FENE-P model. The alignment of polymers with the eigenvectors of the rate-of-strain tensor and with the direction of vorticity is weaker when the Peterlin approximation is used. At large Weissenberg numbers, both the correlation times of the extension and of the orientation of polymers are underestimated by the FENE-P model.

  8. New Algorithms for Finding Approximate Frequent Item Sets

    E-Print Network [OSTI]

    Berthold, Michael R.

    New Algorithms for Finding Approximate Frequent Item Sets Christian Borgelt1 , Christian Braune1,2 , Tobias K¨otter3 and Sonja Gr¨un4,5 1 European Centre for Soft Computing c/ Gonzalo Guti´errez Quir´os s/n.borgelt@softcomputing.es, christian.braune@st.ovgu.de, tobias.koetter@uni-konstanz.de, s.gruen@fz-juelich.de Abstract. In standard

  9. Product-state Approximations to Quantum Ground States

    E-Print Network [OSTI]

    Fernando G. S. L. Brandão; Aram W. Harrow

    2014-12-15T23:59:59.000Z

    The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of 2-local Hamiltonians with one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state with sublinear entanglement with respect to some partition into small pieces. The approximation based on degree is a surprising difference between quantum Hamiltonians and classical CSPs (constraint satisfaction problems), since in the classical setting, higher degree is usually associated with harder CSPs. The approximation based on low entanglement, in turn, was previously known only in the regime where the entanglement was close to zero. Since the existence of a low-energy product state can be checked in NP, the result implies that any Hamiltonian used for a quantum PCP theorem should have: (1) constant degree, (2) constant expansion, (3) a "volume law" for entanglement with respect to any partition into small parts. Second, we show that in several cases, good product-state approximations not only exist, but can be found in polynomial time: (1) 2-local Hamiltonians on any planar graph, solving an open problem of Bansal, Bravyi, and Terhal, (2) dense k-local Hamiltonians for any constant k, solving an open problem of Gharibian and Kempe, and (3) 2-local Hamiltonians on graphs with low threshold rank, via a quantum generalization of a recent result of Barak, Raghavendra and Steurer. Our work introduces two new tools which may be of independent interest. First, we prove a new quantum version of the de Finetti theorem which does not require the usual assumption of symmetry. Second, we describe a way to analyze the application of the Lasserre/Parrilo SDP hierarchy to local quantum Hamiltonians.

  10. Studies in Interpolation and Approximation of Multivariate Bandlimited Functions 

    E-Print Network [OSTI]

    Bailey, Benjamin Aaron

    2012-10-19T23:59:59.000Z

    &M University in partial ful llment of the requirements for the degree of DOCTOR OF PHILOSOPHY Approved by: Co-Chairs of Committee, Thomas Schlumprecht N. Sivakumar Committee Members, Joel Zinn William Johnson Fred Dahm Head of Department, Albert...{Chairs of Advisory Committee: Dr. Thomas Schlumprecht Dr. N. Sivakumar The focus of this dissertation is the interpolation and approximation of multi- variate bandlimited functions via sampled (function) values. The rst set of results investigates polynomial...

  11. Automating efficiency-targeted approximations in modelling and simulation tools: dynamic decoupling and mixed-mode

    E-Print Network [OSTI]

    Como, Giacomo

    Automating efficiency-targeted approximations in modelling and simulation tools: dynamic decoupling (classical) efficiency-targeted approximation tech- niques, within a unified framework. Some application

  12. Corrections to Eikonal Approximation for Nuclear Scattering at Medium Energies

    E-Print Network [OSTI]

    Micah Buuck; Gerald A. Miller

    2014-06-12T23:59:59.000Z

    The upcoming Facility for Rare Isotope Beams (FRIB) at the National Superconducting Cyclotron Laboratory (NSCL) at Michigan State University has reemphasized the importance of accurate modeling of low energy nucleus-nucleus scattering. Such calculations have been simplified by using the eikonal approximation. As a high energy approximation, however, its accuracy suffers for the medium energy beams that are of current experimental interest. A prescription developed by Wallace \\cite{Wallace:1971zz,Wallace:1973iu} that obtains the scattering propagator as an expansion around the eikonal propagator (Glauber approach) has the potential to extend the range of validity of the approximation to lower energies. Here we examine the properties of this expansion, and calculate the first-, second-, and third-order corrections for the scattering of a spinless particle off of a ${}^{40}$Ca nucleus, and for nuclear breakup reactions involving ${}^{11}$Be. We find that, including these corrections extends the lower bound of the range of validity of the down to energies of 40 MeV. At that energy the corrections provide as much as a 15\\% correction to certain processes.

  13. The periodic standing-wave approximation: post-Minkowski computation

    E-Print Network [OSTI]

    Christopher Beetle; Benjamin Bromley; Napoleón Hernández; Richard H. Price

    2007-08-08T23:59:59.000Z

    The periodic standing wave method studies circular orbits of compact objects coupled to helically symmetric standing wave gravitational fields. From this solution an approximation is extracted for the strong field, slowly inspiralling motion of black holes and binary stars. Previous work on this model has dealt with nonlinear scalar models, and with linearized general relativity. Here we present the results of the method for the post-Minkowski (PM) approximation to general relativity, the first step beyond linearized gravity. We compute the PM approximation in two ways: first, via the standard approach of computing linearized gravitational fields and constructing from them quadratic driving sources for second-order fields, and second, by solving the second-order equations as an ``exact'' nonlinear system. The results of these computations have two distinct applications: (i) The computational infrastructure for the ``exact'' PM solution will be directly applicable to full general relativity. (ii) The results will allow us to begin supplying initial data to collaborators running general relativistic evolution codes.

  14. Formalising the Slow-Roll Approximation in Inflation

    E-Print Network [OSTI]

    Andrew R. Liddle; Paul Parsons; John D. Barrow

    1994-08-04T23:59:59.000Z

    The meaning of the inflationary slow-roll approximation is formalised. Comparisons are made between an approach based on the Hamilton-Jacobi equations, governing the evolution of the Hubble parameter, and the usual scenario based on the evolution of the potential energy density. The vital role of the inflationary attractor solution is emphasised, and some of its properties described. We propose a new measure of inflation, based upon contraction of the comoving Hubble length as opposed to the usual e-foldings of physical expansion, and derive relevant formulae. We introduce an infinite hierarchy of slow-roll parameters, and show that only a finite number of them are required to produce results to a given order. The extension of the slow-roll approximation into an analytic slow-roll expansion, converging on the exact solution, is provided. Its role in calculations of inflationary dynamics is discussed. We explore rational-approximants as a method of extending the range of convergence of the slow-roll expansion up to, and beyond, the end of inflation.

  15. Dynamics of false vacuum bubbles: beyond the thin shell approximation

    E-Print Network [OSTI]

    Jakob Hansen; Dong-il Hwang; Dong-han Yeom

    2009-11-08T23:59:59.000Z

    We numerically study the dynamics of false vacuum bubbles which are inside an almost flat background; we assumed spherical symmetry and the size of the bubble is smaller than the size of the background horizon. According to the thin shell approximation and the null energy condition, if the bubble is outside of a Schwarzschild black hole, unless we assume Farhi-Guth-Guven tunneling, expanding and inflating solutions are impossible. In this paper, we extend our method to beyond the thin shell approximation: we include the dynamics of fields and assume that the transition layer between a true vacuum and a false vacuum has non-zero thickness. If a shell has sufficiently low energy, as expected from the thin shell approximation, it collapses (Type 1). However, if the shell has sufficiently large energy, it tends to expand. Here, via the field dynamics, field values of inside of the shell slowly roll down to the true vacuum and hence the shell does not inflate (Type 2). If we add sufficient exotic matters to regularize the curvature near the shell, inflation may be possible without assuming Farhi-Guth-Guven tunneling. In this case, a wormhole is dynamically generated around the shell (Type 3). By tuning our simulation parameters, we could find transitions between Type 1 and Type 2, as well as between Type 2 and Type 3. Between Type 2 and Type 3, we could find another class of solutions (Type 4). Finally, we discuss the generation of a bubble universe and the violation of unitarity. We conclude that the existence of a certain combination of exotic matter fields violates unitarity.

  16. Compton scattering from positronium and validity of the impulse approximation

    SciTech Connect (OSTI)

    Kaliman, Z.; Pisk, K.; Pratt, R. H. [Department of Physics, University of Rijeka, Rijeka (Croatia); Rudjer Boskovic Institute, P. O. Box 180, Zagreb (Croatia) and University of Dubrovnik, Dubrovnik (Croatia); Department of Physics and Astronomy, University of Pittsburgh, Pittsburgh, Pennsylvania 15260 (United States)

    2011-05-15T23:59:59.000Z

    The cross sections for Compton scattering from positronium are calculated in the range from 1 to 100 keV incident photon energy. The calculations are based on the A{sup 2} term of the photon-electron or photon-positron interaction. Unlike in hydrogen, the scattering occurs from two centers and the interference effect plays an important role for energies below 8 keV. Because of the interference, the criterion for validity of the impulse approximation for positronium is more restrictive compared to that for hydrogen.

  17. Dark Energy Regulation with Approximate Emergent Conformal Symmetry

    E-Print Network [OSTI]

    Yongsung Yoon

    2013-08-28T23:59:59.000Z

    A cosmic potential which can relax the vacuum energy is proposed in a framework of scalar-tensor gravity. In the phase of the gravity scalar field around the evolution with an approximate emergent conformal symmetry, we have obtained a set of cosmological equations with the dark energy regulated to the order of a conformal anomaly parameter. Through a role of the cosmic potential, the vacuum energy which could be generated in matter Lagrangian does not contribute to the dark energy in the phase.

  18. Gaussian approximation to the condensation of the interacting Bose gas

    E-Print Network [OSTI]

    Anna Okopi?ska

    2003-09-29T23:59:59.000Z

    The effective action formalism of quantum field theory is used to study the properties of the non-relativistic interacting Bose gas. The Gaussian approximation is formulated by calculating the effective action to the first order of the optimized expansion. In the homogeneous limit the method respects the Hughenholz-Pines theorem, leading to the gapless spectrum both for excitations and for density fluctuations. Renormalization is carried out by adopting dimensional regularization. The results for critical temperature are compared with that obtained in the loop expansion.

  19. Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami Johan Hastad y Madhu Sudan z

    E-Print Network [OSTI]

    Guruswami, Venkatesan

    Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami #3; Johan HÅ¡astad y Madhu Sudan #3

  20. Approximation Theorems Related to the Coupon Collector's Problem

    E-Print Network [OSTI]

    Pósfai, Anna

    2010-01-01T23:59:59.000Z

    This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same probability $1/n$. For a fixed integer $m\\in\\{0,1,\\ldots,n-1\\}$, the coupon collector's waiting time $W_{n,m}$ is the random number of draws the collector performs until he acquires $n-m$ distinct coupons for the first time. The basic goal of the thesis is to approximate the distribution of the coupon collector's appropriately centered and normalized waiting time with well-known measures with high accuracy, and in many cases prove asymptotic expansions for the related probability distribution functions and mass functions. The approximating measures are chosen from five different measure families. Three of them -- the Poisson distributions, the normal distributions and the Gumbel-like distributions -- are probability measure families whose members occur as limiting laws in the limit...

  1. Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates

    E-Print Network [OSTI]

    Kesselheim, Thomas

    2012-01-01T23:59:59.000Z

    We consider scheduling problems in wireless networks with respect to flexible data rates. That is, more or less data can be transmitted per time depending on the signal quality, which is determined by the signal-to-interference-plus-noise ratio (SINR). Each wireless link has a utility function mapping SINR values to the respective data rates. We have to decide which transmissions are performed simultaneously and (depending on the problem variant) also which transmission powers are used. In the capacity-maximization problem, one strives to maximize the overall network throughput, i.e., the summed utility of all links. For arbitrary utility functions (not necessarily continuous ones), we present an O(log n)-approximation when having n communication requests. This algorithm is built on a constant-factor approximation for the special case of the respective problem where utility functions only consist of a single step. In other words, each link has an individual threshold and we aim at maximizing the number of lin...

  2. 1.85 Approximation for Min-Power Strong Connectivity

    E-Print Network [OSTI]

    Calinescu, Gruia

    2012-01-01T23:59:59.000Z

    Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H exiting u. The power of H is the sum of the power of its vertices. Power Assignment seeks to minimize the power of H while H satisfies some connectivity constraint. In this paper, we assume E is bidirected (for every directed edge e in E, the opposite edge exists and has the same cost), while H is required to be strongly connected. This is the original power assignment problem introduced by Chen and Huang in 1989, who proved that bidirected minimum spanning tree has approximation ratio at most 2 (this is tight). In Approx 2010, we introduced a Greedy approximation algorithm and claimed a ratio of 1.992. Here we improve the analysis to 1.85. The proof also shows that a natural linear programming relaxation, introduced by us in 2012, has the same 1.85 integrality gap.

  3. Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing

    E-Print Network [OSTI]

    Treuille, Adrien

    )-approximate with O(log4 n) congestion. This translates back to a O(log4+3 n)-approximation for the multicast energy-minimization)-approximate with O(log12 n) congestion, which translates back to a O(log12+5 n)-approximation for the unicast energy-minimizationCluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient

  4. Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

    SciTech Connect (OSTI)

    Halappanavar, Mahantesh; Feo, John T.; Villa, Oreste; Tumeo, Antonino; Pothen, Alex

    2012-11-30T23:59:59.000Z

    Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

  5. Approximate Message Passing with Restricted Boltzmann Machine Priors

    E-Print Network [OSTI]

    Tramel, Eric W; Krzakala, Florent

    2015-01-01T23:59:59.000Z

    Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernouilli prior which utilizes a Restricted Boltzmann Machine (RBM) trained on the signal support to push reconstruction performance beyond that of simple iid priors for signals whose support can be well represented by a trained binary RBM. We present and analyze two methods of RBM factorization and demonstrate how these affect signal reconstruction performance within our proposed algorithm. Finally, using the MNIST handwritten digit dataset, we show experimentally that using an RBM allows AMP to approach oracle-support performance.

  6. Fast quantum algorithms for approximating some irreducible representations of groups

    E-Print Network [OSTI]

    Stephen P. Jordan

    2009-04-21T23:59:59.000Z

    We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this problem. Furthermore, quantum Schur transforms yield efficient solutions for certain irreducible representations of the unitary group. Beyond this, we obtain poly(n)-time quantum algorithms for approximating matrix elements from all the irreducible representations of the alternating group A_n, and all the irreducible representations of polynomial highest weight of U(n), SU(n), and SO(n). These quantum algorithms offer exponential speedup in worst case complexity over the fastest known classical algorithms. On the other hand, we show that average case instances are classically easy, and that the techniques analyzed here do not offer a speedup over classical computation for the estimation of group characters.

  7. Particle-particle random phase approximation applied to Beryllium isotopes

    E-Print Network [OSTI]

    Guillaume Blanchon; Nicole Vinh Mau; Angela Bonaccorso; Marc Dupuis; Nathalie Pillet

    2010-07-16T23:59:59.000Z

    This work is dedicated to the study of even-even 8-14 Be isotopes using the particle-particle Random Phase Approximation that accounts for two-body correlations in the core nucleus. A better description of energies and two-particle amplitudes is obtained in comparison with models assuming a neutron closed-shell (or subshell) core. A Wood-Saxon potential corrected by a phenomenological particle-vibration coupling term has been used for the neutron-core interaction and the D1S Gogny force for the neutron-neutron interaction. Calculated ground state properties as well as excited state ones are discussed and compared to experimental data. In particular, results suggest the same 2s_1/2-1p_1/2 shell inversion in 13Be as in 11Be.

  8. Pion - Nucleon Bremsstrahlung beyond the Soft-Photon approximation

    E-Print Network [OSTI]

    A. Mariano

    2000-04-06T23:59:59.000Z

    A dynamical model based on effective Lagrangians is proposed to describe the bremsstrahlung reaction $ \\pi N \\to \\pi N \\gamma$ at low energies. The $\\Delta(1232)$ degrees of freedom are incorporated in a way consistent with both, electromagnetic gauge invariance and invariance under contact transformations. The model also includes the initial and final state rescattering of hadrons via a T-matrix with off the momentum-shell effects. The double differential distribution of photons is computed for three different T-matrix models and the results are compared with the soft photon approximation, and with experimental data. The aim of this analysis is to test the off-shell behaviour of the different T-matrices under consideration. Finally an alternative simpler dynamical model that incorporates the unstable character of the isobar-$\\Delta(1232)$ through a complex mass, is presented. As we will see it is suitable for the study of the magnetic moment of the resonance.

  9. Shear Viscosity in the Post-quasistatic Approximation

    E-Print Network [OSTI]

    C. Peralta; L. Rosales; B. Rodrí guez-Mueller; W. Barreto

    2010-04-20T23:59:59.000Z

    We apply the post-quasi--static approximation, an iterative method for the evolution of self-gravitating spheres of matter, to study the evolution of anisotropic non-adiabatic radiating and dissipative distributions in General Relativity. Dissipation is described by viscosity and free-streaming radiation, assuming an equation of state to model anisotropy induced by the shear viscosity. We match the interior solution, in non-comoving coordinates, with the Vaidya exterior solution. Two simple models are presented, based on the Schwarzschild and Tolman VI solutions, in the non--adiabatic and adiabatic limit. In both cases the eventual collapse or expansion of the distribution is mainly controlled by the anisotropy induced by the viscosity.

  10. Relativistic Coulomb excitation within Time Dependent Superfluid Local Density Approximation

    E-Print Network [OSTI]

    I. Stetcu; C. Bertulani; A. Bulgac; P. Magierski; K. J. Roche

    2015-01-13T23:59:59.000Z

    Within the framework of the unrestricted time-dependent density functional theory, we present for the first time an analysis of the relativistic Coulomb excitation of the heavy deformed open shell nucleus $^{238}$U. The approach is based on Superfluid Local Density Approximation (SLDA) formulated on a spatial lattice that can take into account coupling to the continuum, enabling self-consistent studies of superfluid dynamics of any nuclear shape. We have computed the energy deposited in the target nucleus as a function of the impact parameter, finding it to be significantly larger than the estimate using the Goldhaber-Teller model. The isovector giant dipole resonance, the dipole pygmy resonance and giant quadrupole modes were excited during the process. The one body dissipation of collective dipole modes is shown to lead a damping width $\\Gamma_\\downarrow \\approx 0.4$ MeV and the number of pre-equilibrium neutrons emitted has been quantified.

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

    E-Print Network [OSTI]

    Ye, Yinyu

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

  12. Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors

    E-Print Network [OSTI]

    Chetverikov, Denis

    We derive a Gaussian approximation result for the maximum of a sum of high-dimensional random vectors. Specifically, we establish conditions under which the distribution of the maximum is approximated by that of the maximum ...

  13. Moment Closure Approximations in a Genetic Negative Feedback Circuit

    E-Print Network [OSTI]

    Mohammad Soltani; Cesar Vargas; Niraj Kumar; Rahul Kulkarni; Abhyudai Singh

    2014-05-15T23:59:59.000Z

    Auto-regulation, a process wherein a protein negatively regulates its own production, is a common motif in gene expression networks. Negative feedback in gene expression plays a critical role in buffering intracellular fluctuations in protein concentrations around optimal value. Due to the nonlinearities present in these feedbacks, moment dynamics are typically not closed, in the sense that the time derivative of the lower-order statistical moments of the protein copy number depends on high-order moments. Moment equations are closed by expressing higher-order moments as nonlinear functions of lower-order moments, a technique commonly referred to as moment closure. Here, we compare the performance of different moment closure techniques. Our results show that the commonly used closure method, which assumes a priori that the protein population counts are normally distributed, performs poorly. In contrast, conditional derivative matching, a novel closure scheme proposed here provides a good approximation to the exact moments across different parameter regimes. In summary our study provides a new moment closure method for studying stochastic dynamics of genetic negative feedback circuits, and can be extended to probe noise in more complex gene networks.

  14. Energy loss and (de)coherence effects beyond eikonal approximation

    E-Print Network [OSTI]

    Liliana Apolinário; Néstor Armesto; Guilherme Milhano; Carlos A. Salgado

    2014-10-21T23:59:59.000Z

    The parton branching process is known to be modified in the presence of a medium. Colour decoherence processes are known to determine the process of energy loss when the density of the medium is large enough to break the correlations between partons emitted from the same parent. In order to improve existing calculations that consider eikonal trajectories for both the emitter and the hardest emitted parton, we provide in this work, the calculation of all finite energy corrections for the gluon radiation off a quark in a QCD medium that exist in the small angle approximation and for static scattering centres. Using the path integral formalism, all particles are allowed to undergo Brownian motion in the transverse plane and the offspring allowed to carry an arbitrary fraction of the initial energy. The result is a general expression that contains both coherence and decoherence regimes that are controlled by the density of the medium and by the amount of broadening that each parton acquires independently.

  15. 3D Scattered Data Approximation with Adaptive Compactly Supported Radial Basis Functions

    E-Print Network [OSTI]

    Kazhdan, Michael

    ¾ ¼ ½ indicating the confidence of � . Our aim is to construct a function Ý ´�µ such that its zero level-set ´�µ , � �, we construct ´�µ approximating � in the follow- ing form suggested in [27] ¾ ´�µ · ´ � µ approximation of �. For each approximation center , we construct ´�µ as a local quadratic approximation of �

  16. Matrix multiplication over word-size prime fields using Bini's approximate formula

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Matrix multiplication over word-size prime fields using Bini's approximate formula Brice Boyer Jean-Guillaume Dumas Abstract Bini's approximate formula (or border rank) for matrix multiplication achieves a better the approximate formula in the special case where the ring is Z/pZ. Besides, we show an implemen- tation à la

  17. PD Dr. Martin Stetter, Siemens AG 1 Lernen von Datenmodellen: Approximation

    E-Print Network [OSTI]

    Popeea, Corneliu - Chair for Foundations of Software Reliability and Theoretical Computer Science

    PD Dr. Martin Stetter, Siemens AG 1 Lernen von Datenmodellen: Approximation · Bayes`sches Schließen: Approximation #12;PD Dr. Martin Stetter, Siemens AG 2 Ziel maschinellen Lernens (=statistische Inferenz) · Man Datenmodellen: Approximation #12;PD Dr. Martin Stetter, Siemens AG 3 Bayes`sches Schließen · Es gilt, die Daten

  18. Motivation Green's functions The GW Approximation The Bethe-Salpeter Equation Introduction to Green's functions

    E-Print Network [OSTI]

    Botti, Silvana

    Motivation Green's functions The GW Approximation The Bethe-Salpeter Equation Introduction to Green=whiteMotivation Green's functions The GW Approximation The Bethe-Salpeter Equation Outline 1 Motivation 2 Green's functions 3 The GW Approximation 4 The Bethe-Salpeter Equation #12;bg=whiteMotivation Green's functions

  19. Convergence of the Approximation Scheme to American Option Pricing via the Discrete Morse Semiflow

    SciTech Connect (OSTI)

    Ishii, Katsuyuki, E-mail: ishii@maritime.kobe-u.ac.jp [Kobe University, Graduate School of Maritime Sciences (Japan); Omata, Seiro, E-mail: omata@kenroku.kanazawa-u.ac.jp [Kanazawa University, School of Mathematics and Physics, Institute of Science and Engineering (Japan)

    2011-12-15T23:59:59.000Z

    We consider the approximation scheme to the American call option via the discrete Morse semiflow, which is a minimizing scheme of a time semi-discretized variational functional. In this paper we obtain a rate of convergence of approximate solutions and the convergence of approximate free boundaries. We mainly apply the theory of variational inequalities and that of viscosity solutions to prove our results.

  20. Markov Jump Processes Approximating a Non-Symmetric Generalized Diffusion

    SciTech Connect (OSTI)

    Limic, Nedzad, E-mail: nlimic@math.hr [University of Zagreb, Dept. of Mathematics (Croatia)

    2011-08-15T23:59:59.000Z

    Consider a non-symmetric generalized diffusion X( Dot-Operator ) in Double-Struck-Capital-R {sup d} determined by the differential operator A(x) = -{Sigma}{sub ij} {partial_derivative}{sub i}a{sub ij}(x){partial_derivative}{sub j} + {Sigma}{sub i} b{sub i}(x){partial_derivative}{sub i}. In this paper the diffusion process is approximated by Markov jump processes X{sub n}( Dot-Operator ), in homogeneous and isotropic grids G{sub n} Subset-Of Double-Struck-Capital-R {sup d}, which converge in distribution in the Skorokhod space D([0,{infinity}), Double-Struck-Capital-R {sup d}) to the diffusion X( Dot-Operator ). The generators of X{sub n}( Dot-Operator ) are constructed explicitly. Due to the homogeneity and isotropy of grids, the proposed method for d{>=}3 can be applied to processes for which the diffusion tensor {l_brace}a{sub ij}(x){r_brace}{sub 11}{sup dd} fulfills an additional condition. The proposed construction offers a simple method for simulation of sample paths of non-symmetric generalized diffusion. Simulations are carried out in terms of jump processes X{sub n}( Dot-Operator ). For piece-wise constant functions a{sub ij} on Double-Struck-Capital-R {sup d} and piece-wise continuous functions a{sub ij} on Double-Struck-Capital-R {sup 2} the construction and principal algorithm are described enabling an easy implementation into a computer code.

  1. A quasi-Gaussian approximation for the probability distribution of correlation functions

    E-Print Network [OSTI]

    Wilking, Philipp

    2013-01-01T23:59:59.000Z

    Context. Whenever correlation functions are used for inference about cosmological parameters in the context of a Bayesian analysis, the likelihood function of correlation functions needs to be known. Usually, it is approximated as a multivariate Gaussian, though this is not necessarily a good approximation. Aims. We show how to calculate a better approximation for the probability distribution of correlation functions, which we call "quasi-Gaussian". Methods. Using the exact univariate PDF as well as constraints on correlation functions previously derived, we transform the correlation functions to an unconstrained variable for which the Gaussian approximation is well justified. From this Gaussian in the transformed space, we obtain the quasi-Gaussian PDF. The two approximations for the probability distributions are compared to the "true" distribution as obtained from simulations. Additionally, we test how the new approximation performs when used as likelihood in a toy-model Bayesian analysis. Results. The quas...

  2. A comparison of networked approximators in parallel mode identification of a bioreactor

    E-Print Network [OSTI]

    Efe, Mehmet Önder

    A comparison of networked approximators in parallel mode identification of a bioreactor Mehmet 2010 Keywords: Bioreactor Identification Multilayer perceptron ANFIS Support vector machine Chemical

  3. A complete analytic inversion of supernova lines in the Sobolev approximation

    E-Print Network [OSTI]

    Kasen, Daniel; Branch, David; Baron, E.; Jeffery, David

    2001-01-01T23:59:59.000Z

    D . & Branch, D . 1990, in Supernovae, ed. J . C . Wheeler &radia­ tive transfer — supernovae Lawrence Berkeley Nationalgradients, such as supernovae. The Sobolev approximation has

  4. 2012 Annual Workforce Analysis and Staffing Plan Report - TEMPLATE...

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

    Systems NNSA Packaging Cert. Engineer Nuclear Explosive Nuclear Safety Specialist 2.5 2.5 total of 3 NSS's; one is also QA qualified Occupational Safety Quality Assurance 0.5 0.5...

  5. Funding and Federal Staffing Requirements Funding Summary (Energy Supply)

    E-Print Network [OSTI]

    ,000 +11,214 +234.3% Education and Cross-Cutting Analysis . . . . . . . . . . . . . . . . . . . 1,437 2.8% Total, Intergovernmental Activities . . . 5,680 14,807 12,500 -2,307 -15.6% Electricity Reliability High.0% Electricity Restructuring . . . . . . . . 2,840 2,059 2,059 0 0.0% Total, Electricity Reliability

  6. Optimizing Call Center Staffing using Simulation and Analytic Center ...

    E-Print Network [OSTI]

    2005-07-20T23:59:59.000Z

    an effect on the reliability of each method as the other parameters did, so we do not include different settings of it ..... Optim., 10(4):1212–1227 (electronic), 2000.

  7. 2010 Annual Workforce Analysis and Staffing Plan Report - SRSO

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

    f 1325 8 United States Government National Nuclear Security Administration (NNSA) Savannah River Site Office (SRSO) Memorandum DATE: January 20, 2011 REPLY TO AITN OF: sv...

  8. Parameter Shortest Path Algorithms with an Application to Cyclic Staffing

    E-Print Network [OSTI]

    Karp, Richard M.

    Let G = (V,E) be a digraph with n vertices including a special vertex s. Let E' C E be a designated subset of edges. For each e E E there is an associated real number fl(e). Furthermore, let 1 if e E E' f2(e): 0 if e E-E' ...

  9. Y-12 selects small businesses to assist with staffing needs ...

    National Nuclear Security Administration (NNSA)

    more than 50 existing subcontracts to better serve the site with respect to efficiency and overall cost savings. The two companies' focus on meeting Y-12 needs,...

  10. Multiple roles for the zebrafish transcriptional activator SBF/Staf

    E-Print Network [OSTI]

    Halbig, Kari Michele

    2009-05-15T23:59:59.000Z

    protein that enables it to activate the transcription of genes encoding tyrosinase and other proteins of the melanin- formation pathway (71). The FGFR1 gene contains an SPH element in the promoter of the human gene (60) and also has an SPH element...

  11. 2013 Annual Workforce Analysis and Staffing Plan Report - Livermore...

    Energy Savers [EERE]

    year are a basis for DOE Federal Technical Capability Panel reporting to the Secretary of Energy summarizing DOE's federal technical capabilities for defense nuclear facility...

  12. 2012 Annual Workforce Analysis and Staffing Plan Report - Nevada...

    Energy Savers [EERE]

    a basis for DOE Federal Technical Capability Panel (FTCP) reporting to the Secretary of Energy summarizing DOE's federal technical capabilities for defense nuclear facility...

  13. DOE Executive Staffing and Recruitment | Department of Energy

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011AT&T,Office of Policy, OAPM |TRU Waste Cleanup at BettisEMERGENCYTravel

  14. Staffing Guide for Project Management - DOE Directives, Delegations, and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What'sis Taking Over Our Instagram Secretary900 Special Report:Spotlight: Bryantis

  15. Safety System Oversight Staffing Analysis (Instructions, Blank Sheet and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels DataDepartment of Energy Your Density Isn'tOrigin ofEnergy atLLC - FE DKT. 10-160-LNG - ORDERSTATE0-1of Energy Safety

  16. Policy Guidance Memorandum #36 SES Competitive Staffing Procedures |

    Office of Environmental Management (EM)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742 33 1112011 Strategic2 OPAM615_CostNSAR - T enAmount for Individual Executive4 - Class

  17. 2012 Annual Workforce Analysis and Staffing Plan Report - Livermore Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) | Department1The

  18. 2012 Annual Workforce Analysis and Staffing Plan Report - NNSA HQ |

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) | Department1TheDepartment of Energy

  19. 2012 Annual Workforce Analysis and Staffing Plan Report - Nevada Site

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) | Department1TheDepartment of EnergyOffice |

  20. 2012 Workforce Analysis and Staffing Plan Report Memo, Guidance and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) |2 National EnergyDepartment of|2

  1. 2013 Annual Workforce Analysis and Staffing Plan Report - Livermore Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) |2Department of Energy SavannahDepartment

  2. 2013 Annual Workforce Analysis and Staffing Plan Report - NNSA HQ |

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) |2Department of Energy

  3. 2013 Workforce Analysis and Staffing Plan Report Memo, Guidance and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE) |2Department ofDepartmentDepartment3Template |

  4. 2014 Annual Workforce Analysis and Staffing Plan Report - Livermore Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE)Department of Energy

  5. 2014 Annual Workforce Analysis and Staffing Plan Report - Nevada Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE)Department of EnergyOffice | Department of

  6. 2014 Annual Workforce Analysis and Staffing Plan Report - Sandia Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE)Department of EnergyOffice | DepartmentOffice

  7. 2014 Workforce Analysis and Staffing Plan Report Memo, Guidance and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742Energy China 2015ofDepartment ofCBFO-13-3322(EE)Department ofNow

  8. 2012 Annual Workforce Analysis and Staffing Plan Report - Nevada Site

    Energy Savers [EERE]

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page onYou are now leaving Energy.gov You are now leaving Energy.gov You are being directed off Energy.gov. Are you0 ARRA Newsletters 2010 ARRA Newsletters American

  9. 2013 Annual Workforce Analysis and Staffing Plan Report - Livermore Field

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page onYouTube YouTube Note: Since the YouTube platform is always evolving, soFuel Cell2 - FederalFuel20123 -DepartmentOffice |

  10. 2014 Annual Workforce Analysis and Staffing Plan Report - Portsmouth

    Office of Environmental Management (EM)

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

  11. 2010 Workforce Analysis and Staffing Plan Report Memo, Guidance and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels DataDepartment of Energy Your Density Isn't Your Destiny: The Future of BadTHE U.S.Energy Two Afternoon Presentations2010 U.S.2010

  12. 2011 Workforce Analysis and Staffing Plan Report Memo, Guidance and

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels DataDepartment of Energy Your Density Isn't Your Destiny: The Future of BadTHE U.S.Energy

  13. Microsoft Word - DOE_Staffing_Study_Cover.doc

    Office of Environmental Management (EM)

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

  14. Staffing for Clean Energy Financing Programs | Department of Energy

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625 1,006 492 742EnergyOn April 23, 2014,Zaleski - PolicyWorkSunShotBelowThe Saint-Gobain NOVA InnovationSt.Any

  15. A New Approximation Scheme for the Group Steiner Problem C. S. Helvig Gabriel Robins Alexander Zelikovsky

    E-Print Network [OSTI]

    Zelikovsky, Alexander

    correspond to a group of up to eight nodes in the Group #3; This work was supported by a Packard Foundation a group of up to eight virtual positions (c). The only existing approximation algorithms for the GroupA New Approximation Scheme for the Group Steiner Problem #3; C. S. Helvig Gabriel Robins Alexander

  16. Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic

    E-Print Network [OSTI]

    Grossmann, Ignacio E.

    In this work we present an extension of the Logic Outer-Approximation algorithm for deal- ing with disjunctive.e. the control actions) may involve logic decisions that can be modeled as disjunctions [16], [17] giving riseLogic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization

  17. LOW DIMENSIONAL POLYTOPE APPROXIMATION AND ITS APPLICATIONS TO NONNEGATIVE MATRIX FACTORIZATION

    E-Print Network [OSTI]

    factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on the probability simplex has the advantage that data are limited, polytope approximation, probability simplex, supporting hyper- plane, Hahn-Banach theorem 1. Introduction

  18. On Computation of Approximate Joint Block-Diagonalization using Ordinary AJD

    E-Print Network [OSTI]

    Yeredor, Arie

    On Computation of Approximate Joint Block-Diagonalization using Ordinary AJD Petr Tichavský 1 2, 461 17 Liberec, Czech Republic Abstract. Approximate joint block diagonalization (AJBD) of a set, we prove that when the set is exactly jointly block-diagonalizable, perfect block

  19. 24 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 16, NO. 1, JANUARY 2005 Smooth Function Approximation Using

    E-Print Network [OSTI]

    Ferrari, Silvia

    , have become standard tools in regression and signal analysis involving input spaces with up to three di dimensional spaces [7]. For example, the majority of spline-based solutions for multivariate approximation- mensions [3]­[6]. However, much of univariate approximation theory does not generalize well to higher

  20. Wavelet-Based Piecewise Approximation of Steady-State Waveforms for

    E-Print Network [OSTI]

    Tse, Chi K. "Michael"

    Wavelet-Based Piecewise Approximation of Steady-State Waveforms for Power Electronics Circuits Kam Kong Polytechnic University, Hong Kong http://chaos.eie.polyu.edu.hk Abstract-- Wavelet transform has to maximize computational efficiency. In this paper, instead of applying one wavelet approximation

  1. What is Concurrent Programming? Course Outline (Approximate) Evaluation & Deadlines Engineering 9869

    E-Print Network [OSTI]

    Peters, Dennis

    What is Concurrent Programming? Course Outline (Approximate) Evaluation & Deadlines Engineering 9869 Advanced Concurrent Programming Introduction Dennis Peters1 Fall 2007 1 Throughout this course I will be borrowing from Dr. Theo Norvell #12;What is Concurrent Programming? Course Outline (Approximate) Evaluation

  2. Green's function approximation from cross-correlations of 20100 Hz noise during a tropical storm

    E-Print Network [OSTI]

    Gerstoft, Peter

    Green's function approximation from cross-correlations of 20­100 Hz noise during a tropical storm Approximation of Green's functions through cross-correlation of acoustic signals in the ocean, a method referred-bottom-reflected interarray hydrophone travel times. The extracted Green's function depends on the propagating noise

  3. Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem 1

    E-Print Network [OSTI]

    Morin, Pat

    Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem 1 Prosenjit Bose) time deterministic and O(n) time randomized #15;-approximation algorithm for the so called Fermat-Weber numbers [1]. A famous problem related to the function w is the Fermat-Weber problem [4] which asks

  4. A Simple Linear Time (1 + )-Approximation Algorithm for k-Means Clustering in Any Dimensions

    E-Print Network [OSTI]

    Sen, Sandeep

    A Simple Linear Time (1 + )-Approximation Algorithm for k-Means Clustering in Any Dimensions Amit@cse.iitd.ernet.in Abstract We present the first linear time (1+)-approximation al- gorithm for the k-means problem for fixed of the most popular definitions of cluster- ing is the k-means clustering problem. Given a set of points P

  5. Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage

    E-Print Network [OSTI]

    Sadeh, Norman M.

    Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage in practice. Focusing on commodity storage, we identify a deficiency of approximate linear programming, which their corresponding ALPs. Applied to existing natural gas storage instances, our ALP relaxations significantly

  6. Approximate Hierarchies of Linear Control Systems Antoine Girard and George J. Pappas

    E-Print Network [OSTI]

    Pappas, George J.

    . In Section II, we briefly present some existing results [11], [16] on abstraction using exact simulation to an approximate simulation relation. The main contributions of the paper are in Sections IV and V. In Section IV-- Recently, a hierarchical control approach based on the notion of approximate simulation relations has been

  7. Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller

    E-Print Network [OSTI]

    Boyer, Edmond

    conditions, see also [9]. Convex polytopic inner approximations were also obtained in [16], for discrete-time stability, using reflection coefficients. Convex inner approximations make it possible to design stabiliz- ing controllers with the help of convex optimization techniques, at the price of loosing optimality w

  8. Improved approximation of the Brinkman equation using a lattice Boltzmann method

    E-Print Network [OSTI]

    Bentz, Dale P.

    conditions. The Brinkman equation3 is a generalization of Darcy's law that facilitates the matchingImproved approximation of the Brinkman equation using a lattice Boltzmann method by Nicos S. Martys;Improved approximation of the Brinkman equation using a lattice Boltzmann method Nicos S. Martys Building

  9. Semi-analytic approximations for production of atmospheric muons and neutrinos

    E-Print Network [OSTI]

    Thomas K. Gaisser

    2001-04-19T23:59:59.000Z

    Simple approximations for fluxes of atmospheric muons and muon neutrinos are developed which display explicitly how the fluxes depend on primary cosmic ray energy and on features of pion production. For energies of approximately 10 GeV and above the results are sufficiently accurate to calculate response functions and to use for estimates of systematic uncertainties.

  10. Adiabatic approximation, Gell-Mann and Low theorem and degeneracies: A pedagogical example

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Adiabatic approximation, Gell-Mann and Low theorem and degeneracies: A pedagogical example if the evolution operator has no limit for adiabatic switchings, the Gell-Mann and Low formula allows to follow approximation (obtained by two different limiting procedures) is either useless or wrong, and the Gell

  11. Beam Propagation Method Using a [(p -1)/p] Pade Approximant of the Propagator

    E-Print Network [OSTI]

    Lu, Ya Yan

    propagation method (BPM) is developed based on a direct approximation to the propagator using the [(p - 1)/p of the BPM. 1 Introduction The beam propagation method (BPM)1­4 is widely used in numerical simulation, the governing equation is a scalar Helmholtz equation. The BPM relies on approximating the Helmholtz equation

  12. A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes

    E-Print Network [OSTI]

    Cambridge, University of

    A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes Ioannis a simple technique to approximate the performance union bound of a punctured turbo code. The bound to calculate the most significant terms of the transfer function of a turbo encoder. We demonstrate that

  13. A fast, flexible, approximate technique for computing radiative transfer in inhomogeneous cloud fields

    E-Print Network [OSTI]

    Robert, Pincus

    A fast, flexible, approximate technique for computing radiative transfer in inhomogeneous cloud.-J. Morcrette, A fast, flexible, approximate technique for computing radiative transfer in inhomogeneous cloud, which computes fluxes at each level. [3] The description of clouds in current LSMs is quite simple: Most

  14. Approximate logic circuits for low overhead, non-intrusive concurrent error detection

    E-Print Network [OSTI]

    Mohanram, Kartik

    Approximate logic circuits for low overhead, non-intrusive concurrent error detection Mihir R for the synthesis of approximate logic circuits. A low overhead, non-intrusive solution for concurrent error as proposed in this paper. A low overhead, non-intrusive solution for CED based on ap- proximate

  15. Validation of the correctness of the Hald approximation in assessing tolerance

    SciTech Connect (OSTI)

    Gurevich, M. I., E-mail: gur.m@mail.ru; Kalugin, M. A.; Chukbar, B. K. [National Research Center Kurchatov Institute (Russian Federation)

    2014-12-15T23:59:59.000Z

    An analysis was performed of the correctness of employing the approximate formula which is widely used when assessing tolerances in the results of regression analysis. The correctness of approximation with the frequently used ratio between the probability and significance level equal to 95/95 is demonstrated. Conditions of application of the formula under stricter requirements, for example, 99/99, are formulated.

  16. ROBUST VIDEO RESTORATION BY JOINT SPARSE AND LOW RANK MATRIX APPROXIMATION

    E-Print Network [OSTI]

    Shen, Zuowei

    ROBUST VIDEO RESTORATION BY JOINT SPARSE AND LOW RANK MATRIX APPROXIMATION HUI JI, SIBIN HUANG, ZUOWEI SHEN, AND YUHONG XU Abstract. This paper presents a new video restoration scheme based domain, we formulate the video restoration problem as a joint sparse and low-rank matrix approximation

  17. Approximate model checking of stochastic hybrid systems , J.-P. Katoen

    E-Print Network [OSTI]

    Abate, Alessandro

    -room heating system. 1 Introduction Stochastic hybrid systems are a broad and widely applicable classApproximate model checking of stochastic hybrid systems A. Abate , J.-P. Katoen , J. Lygeros , and M. Prandini§ Abstract A method for approximate model checking of stochastic hybrid systems

  18. Search for A Lyapunov Function through Empirical Approximation by Artificial Neural Nets: Theoretical Framework

    E-Print Network [OSTI]

    Serpen, Gursel

    Search for A Lyapunov Function through Empirical Approximation by Artificial Neural Nets approximator for empirical modeling of a Lyapunov function for a nonlinear dynamic system that projects stable of designing the so-called Lyapunov neural network, which empirically models a Lyapunov function, is described

  19. An efficient approach to approximating the pair distribution function of the inhomogeneous hard-sphere fluid

    E-Print Network [OSTI]

    Paho Lurie-Gregg; Jeff B. Schulte; David Roundy

    2014-09-24T23:59:59.000Z

    We introduce an approximation for the pair distribution function of the inhomogeneous hard sphere fluid. Our approximation makes use of our recently published averaged pair distribution function at contact which has been shown to accurately reproduce the averaged pair distribution function at contact for inhomogeneous density distributions. This approach achieves greater computational efficiency than previous approaches by enabling the use of exclusively fixed-kernel convolutions and thus allowing an implementation using fast Fourier transforms. We compare results for our pair distribution approximation with two previously published works and Monte-Carlo simulation, showing favorable results.

  20. On the use of consistent approximations for the optimal design of beams

    SciTech Connect (OSTI)

    Polak, E.; Neto, C.K.

    1994-12-31T23:59:59.000Z

    Most optimal design problems can only be solved through discretization. One solution strategy is to expand the original problem into an infinite sequence of finite dimensional, approximating nonlinear programming problems, which can be solved using standard algorithms. In this paper, an expansion strategy based on the concept of consistent approximations is proposed for certain optimal beam design problems, where the beam is modelled using Euler-Bernoulli beam theory. It is shown that any accumulation point of the sequence of the stationary points of the family of approximating problems is a stationary point of the original, infinite-dimensional problem. Numerical results are presented for problems of optimal design of fixed beams.

  1. Statistical mechanics of the nonlinear Schroedinger equation. II. Mean field approximation

    SciTech Connect (OSTI)

    Lebowitz, J.L.; Rose, H.A.; Speer, E.R.

    1989-01-01T23:59:59.000Z

    The authors investigate a mean field approximation to the statistical mechanics of complex fields with dynamics governed by the nonlinear Schroedinger equation. Such fields, whose Hamiltonian is unbounded below, may model plasmas, lasers, and other physical systems. Restricting themselves to one-dimensional systems with periodic boundary conditions, we find in the mean field approximation a phase transition from a uniform regime to a regime in which the system is dominated by solitons. They compute explicitly, as a function of temperature and density (L/sup 2/ norm), the transition point at which the uniform configuration becomes unstable to local perturbations; static and dynamic mean field approximations yield the same result.

  2. First and second order approximations to stage numbers in multicomponent enrichment cascades

    SciTech Connect (OSTI)

    Scopatz, A. [University of Chicago, 5754 S. Ellis Ave, Chicago, IL, 60637 (United States)

    2013-07-01T23:59:59.000Z

    This paper describes closed form, Taylor series approximations to the number product stages in a multicomponent enrichment cascade. Such closed form approximations are required when a symbolic, rather than a numeric, algorithm is used to compute the optimal cascade state. Both first and second order approximations were implemented. The first order solution was found to be grossly incorrect, having the wrong functional form over the entire domain. On the other hand, the second order solution shows excellent agreement with the 'true' solution over the domain of interest. An implementation of the symbolic, second order solver is available in the free and open source PyNE library. (authors)

  3. Approximations Exponential

    E-Print Network [OSTI]

    Bröcker, Jochen

    , probability theory and statistics have experienced fruitful appli- cation in many #12;elds of engineering on the necessity of statistics in science. Progress in science is often ascribed to experimentation. The research, in 7 #12; 8 Chapter 1. Introduction physics, statistics and probability theory has become a central

  4. Gyrokinetic Approximation

    E-Print Network [OSTI]

    Frénod, Emmanuel

    , , , W , J, ) r t = (EDr + MCDr ), t = W q(r)R + ED + MCD r , t = W R , W t = (E0 + E1 ) - J |B| + W

  5. THE NUMERICAL APPROXIMATION FOR THE INTEGRABILITY PROBLEM AND THE MEASURE OF WELFARE CHANGES, AND ITS APPLICATIONS

    E-Print Network [OSTI]

    Lim, Sung Jin

    2012-01-01T23:59:59.000Z

    This dissertation mainly studied on numerical approximation methods as a solution of the integrability problem and the measure of welfare changes, and demonstrated how numerical algorithms can be applied in empirical studies ...

  6. Value Function Approximation on Non-Linear Manifolds for Robot Motor Control 

    E-Print Network [OSTI]

    Sugiyama, Masashi; Hachiya, Hirotaka; Towell, Christopher; Vijayakumar, Sethu

    The least squares approach works efficiently in value function approximation, given appropriate basis functions. Because of its smoothness, the Gaussian kernel is a popular and useful choice as a basis function. However, ...

  7. Higher order global differentiability local approximations for 2-D and 3-D distorted element geometries

    E-Print Network [OSTI]

    Maduri, Rajesh Kumar

    2008-02-01T23:59:59.000Z

    The primary focus of this thesis is to present a framework to develop higher order global differentiability local approximations for 2-D and 3-D distorted element geometries. The necessity and superiority of higher order global differentiability...

  8. Far-Field Approximation in the Generalized Geometry Holdup (GGH) Model

    SciTech Connect (OSTI)

    Oberer, R. B.; Gunn, C. A.; Chiang, L.G.

    2006-09-07T23:59:59.000Z

    Quantitative gamma spectrometry measurements of uranium frequently require corrections for attenuation by an equipment or container layer and by the uranium bearing material itself. It is common to correct for attenuation using the ''far-field approximation''. Under this approximation, the minimum thickness of equipment or material is used for the correction rather than an average thickness over the detector field-of-view. In reality this aspect of the far-field approximation is really a narrow field-of-view approximation. The price of this simplification is the introduction of a bias. This bias will be investigated in this paper. In addition, there is a distance dependence of the radial response of a detector. This dependence will also be investigated.

  9. PerformancePreserving Controller Approximation P.J. Goddard \\Lambda and K. Glover.

    E-Print Network [OSTI]

    Cambridge, University of

    Performance­Preserving Controller Approximation P.J. Goddard \\Lambda and K. Glover. (Corresponding Author: K. Glover) Department of Engineering University of Cambridge Trumpington Street Cambridge CB2 1PZ

  10. An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods

    E-Print Network [OSTI]

    Saberi, Amin

    Saberi Abstract In this paper, we give the first approximation algorithm for the problem of max-min fair 94305. Email:{asadpour,saberi}@stanford.edu. 1 #12;1 Introduction Fair division, also known as the cake

  11. EISENSTEIN SERIES AND APPROXIMATIONS TO Bruce C. Berndt and Heng Huat Chan

    E-Print Network [OSTI]

    Berndt, Bruce C.

    EISENSTEIN SERIES AND APPROXIMATIONS TO Bruce C. Berndt and Heng Huat Chan Dedicated to K AND HENG HUAT CHAN Chap. 5]. As will be seen, this page in the lost notebook is closely connected

  12. EISENSTEIN SERIES AND APPROXIMATIONS TO # Bruce C. Berndt and Heng Huat Chan

    E-Print Network [OSTI]

    Berndt, Bruce C.

    EISENSTEIN SERIES AND APPROXIMATIONS TO # Bruce C. Berndt and Heng Huat Chan Dedicated to K; 2 BRUCE C. BERNDT AND HENG HUAT CHAN Chap. 5]. As will be seen, this page in the lost notebook

  13. A fast algorithm for approximating the ground state energy on a quantum computer Anargyros Papageorgiou,1,

    E-Print Network [OSTI]

    , Columbia University, New York, NY 10027, USA. (Dated: May 11, 2011) Estimating the ground state energy#12;A fast algorithm for approximating the ground state energy on a quantum computer Anargyros

  14. Error Analysis of Free Probability Approximations to the Density of States of Disordered Systems

    E-Print Network [OSTI]

    Chen, Jiahao

    Theoretical studies of localization, anomalous diffusion and ergodicity breaking require solving the electronic structure of disordered systems. We use free probability to approximate the ensemble-averaged density of states ...

  15. Combining Strategies for Parallel Stochastic Approximation Monte Carlo Algorithm of Big Data

    E-Print Network [OSTI]

    Lin, Fang-Yu

    2014-10-15T23:59:59.000Z

    of iterations and is prone to get trapped into local optima. On the other hand, Stochastic Approximation in Monte Carlo algorithm (SAMC), a very sophisticated algorithm in theory and applications, can avoid getting trapped into local optima and produce more...

  16. Direction-Preserving and Schur-Monotonic Semi-Separable Approximations of Symmetric Positive Definite Matrices}

    SciTech Connect (OSTI)

    Gu, M; Li, X S; Vassilevski, P S

    2010-03-16T23:59:59.000Z

    For a given symmetric positive definite matrix A {element_of} R{sup N x N}, we develop a fast and backward stable algorithm to approximate A by a symmetric positive-definite semi-separable matrix, accurate to a constant multiple of any prescribed tolerance. In addition, this algorithm preserves the product, AZ, for a given matrix Z {element_of} R{sup N x d}, where d << N. Our algorithm guarantees the positive-definiteness of the semi-separable matrix by embedding an approximation strategy inside a Cholesky factorization procedure to ensure that the Schur complements during the Cholesky factorization all remain positive definite after approximation. It uses a robust direction-preserving approximation scheme to ensure the preservation of AZ. We present numerical experiments and discuss potential implications of our work.

  17. Direction-preserving and Schur-monotonic Semi-separable Approximations of Symmetric Positive Definite Matrices

    SciTech Connect (OSTI)

    Gu, Ming; Li, Xiaoye Sherry; Vassilevski, Panayot S.

    2009-10-20T23:59:59.000Z

    For a given symmetric positive definite matrix A {element_of} R{sup nxn}, we develop a fast and backward stable algorithm to approximate A by a symmetric positive-definite semi-separable matrix, accurate to any prescribed tolerance. In addition, this algorithm preserves the product, AZ, for a given matrix Z {element_of} R{sup nxd}, where d << n. Our algorithm guarantees the positive-definiteness of the semi-separable matrix by embedding an approximation strategy inside a Cholesky factorization procedure to ensure that the Schur complements during the Cholesky factorization all remain positive definite after approximation. It uses a robust direction-preserving approximation scheme to ensure the preservation of AZ. We present numerical experiments and discuss potential implications of our work.

  18. Efficient and private distance approximation in the communication and streaming models

    E-Print Network [OSTI]

    Woodruff, David Paul, 1980-

    2007-01-01T23:59:59.000Z

    This thesis studies distance approximation in two closely related models - the streaming model and the two-party communication model. In the streaming model, a massive data stream is presented in an arbitrary order to a ...

  19. NUMERICAL ANALYSIS OF A FINITE ELEMENT SCHEME FOR THE APPROXIMATION OF HARMONIC MAPS INTO SURFACES

    E-Print Network [OSTI]

    Bartels, Soeren

    NUMERICAL ANALYSIS OF A FINITE ELEMENT SCHEME FOR THE APPROXIMATION OF HARMONIC MAPS INTO SURFACES Geometric partial differential equations and their analysis as well as numerical simulation have recently

  20. A Simple Linear Time (1 + #)Approximation Algorithm for kMeans Clustering in Any Dimensions

    E-Print Network [OSTI]

    Kumar, Amit

    A Simple Linear Time (1 + #)­Approximation Algorithm for k­Means Clustering in Any Dimensions Amit@cse.iitd.ernet.in Abstract We present the first linear time (1+#)­approximation al­ gorithm for the k­means problem for fixed of the most popular definitions of cluster­ ing is the k­means clustering problem. Given a set of points P

  1. Bayesian model selection using exact and approximated posterior probabilities with applications to Star Data

    E-Print Network [OSTI]

    Pokta, Suriani

    2004-11-15T23:59:59.000Z

    of the requirements for the degree of DOCTOR OF PHILOSOPHY August 2004 Major Subject: Statistics BAYESIAN MODEL SELECTION USING EXACT AND APPROXIMATED POSTERIOR PROBABILITIES WITH APPLICATIONS TO STAR DATA A Dissertation by SURIANI POKTA Submitted to Texas A.... Longnecker (Head of Department) August 2004 Major Subject: Statistics iii ABSTRACT Bayesian Model Selection Using Exact and Approximated Posterior Probabilities with Applications to Star Data. (August 2004) Suriani Pokta, B.S., Mathematics, University...

  2. Quasiparticle and Optical Excitations in Solid Ne and Ar: GW and BSE Approximations

    SciTech Connect (OSTI)

    Patterson, Charles H.; Galamic-Mulaomerovic, S. [School of Physics, Trinity College Dublin, Dublin 2 (Ireland)

    2007-12-26T23:59:59.000Z

    The GW approximation and the Bethe-Salpeter equation (BSE) have been used to calculate quasiparticle and optical excitations in solid Ne and Ar. Absolute positions of quasiparticle and quasihole energies are found to be in very good agreement with experimental values. Binding energies of Frenkel excitons for these systems calculated using the BSE are also in good agreement with experiment. Splitting of excitons into longitudinal and transverse modes is calculated and found to be approximately twice the experimentally measured value.

  3. Development of iteration strategies for a practical implementation of a higher order transverse leakage approximation

    SciTech Connect (OSTI)

    Prinsloo, R. H.; Tomasevic, D. I. [Necsa, PO Box 582, Pretoria, 0001 (South Africa)

    2012-07-01T23:59:59.000Z

    Transverse integrated nodal diffusion methods currently represent the standard in full core neutronic simulation. The primary shortcoming in this approach is the utilization of the quadratic transverse leakage approximation. This approach, although proven to work well for typical LWR problems, is not consistent with the formulation of nodal methods and can cause accuracy and convergence problems. In previous work, an improved, consistent quadratic leakage approximation was formulated, which derived from the class of higher order nodal methods developed some years ago. In this paper a number of iteration schemes are developed around this consistent quadratic leakage approximation which yield accurate node average results in much improved calculational times. The developed consistent leakage approximation is extended in this work via a number of numerical schemes, the most promising of which results from utilizing the consistent leakage approximation as a correction method to the standard quadratic leakage approximation. Numerical results are demonstrated on a set of benchmark problems, such as the 3D IAEA LWR and MOX C5 problems. (authors)

  4. Universal resources for approximate and stochastic measurement-based quantum computation

    E-Print Network [OSTI]

    C. E. Mora; M. Piani; A. Miyake; M. Van den Nest; W. Dür; H. J. Briegel

    2010-05-10T23:59:59.000Z

    We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting e.g. from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained for the exact, deterministic case can be lifted to the much more general approximate, stochastic case, moving from the idealized situation considered in previous works, to the practically relevant context of non-perfect state preparation. We find that any entanglement measure fulfilling some basic requirements needs to reach its maximum value on some element of an approximate, stochastic universal family of resource states, as the resource size grows. This allows us to rule out various families of states as being approximate, stochastic universal. We provide examples of resources that are efficient approximate universal, but not exact deterministic universal. We also study the robustness of universal resources for measurement-based quantum computation under realistic assumptions about the (imperfect) generation and manipulation of entangled states, giving an explicit expression for the impact that errors made in the preparation of the resource have on the possibility to use it for universal approximate and stochastic state preparation. Finally, we discuss the relation between our entanglement-based criteria and recent results regarding the uselessness of states with a high degree of geometric entanglement as universal resources.

  5. Nonequilibrium molecular vibrons: An approach based on the nonequilibrium Green function technique and the self-consistent Born approximation

    E-Print Network [OSTI]

    Cuniberti, Gianaurelio

    an analytical theory for this case. This theory is based on the self-consistent Born approximation SCBA , which

  6. Stress-energy tensor in colliding plane wave space-times: An approximation procedure

    E-Print Network [OSTI]

    Miquel Dorca

    1997-11-07T23:59:59.000Z

    In a recent work on the quantization of a massless scalar field in a particular colliding plane wave space-time, we computed the vacuum expectation value of the stress-energy tensor on the physical state which corresponds to the Minkowski vacuum before the collision of the waves. We did such a calculation in a region close to both the Killing-Cauchy horizon and the folding singularities that such a space-time contains. In the present paper, we give a suitable approximation procedure to compute this expectation value, in the conformal coupling case, throughout the causal past of the center of the collision. This will allow us to approximately study the evolution of such an expectation value from the beginning of the collision until the formation of the Killing-Cauchy horizon. We start with a null expectation value before the arrival of the waves, which then acquires nonzero values at the beginning of the collision and grows unbounded towards the Killing-Cauchy horizon. The value near the horizon is compatible with our previous result, which means that such an approximation may be applied to other colliding plane wave space-times. Even with this approximation, the initial modes propagated into the interaction region contain a function which cannot be calculated exactly and to ensure the correct regularization of the stress-energy tensor with the point-splitting technique, this function must be given up to adiabatic order four of approximation.

  7. Improved master equation approach to quantum transport: From Born to self-consistent Born approximation

    E-Print Network [OSTI]

    Jun Li; Jinshuang Jin; Xin-Qi Li; YiJing Yan

    2014-06-26T23:59:59.000Z

    Beyond the second-order Born approximation, we develop an improved master equation approach to quantum transport by virtue of a self-consistent Born approximation. The basic idea is replacing the free Green's function in the tunneling self-energy by an effective reduced propagator under the Born approximation. We found that the effect of this simple improvement is remarkable, for instance, it can not only recover the exact result of noninteracting transport under arbitrary voltages, but also predict the challenging nonequilibrium Kondo effect. In addition to having an elegant structure, the application convenience and accuracy of the proposed scheme, as demonstrated by the examples in this work, may suggest it a useful tool for quantum transports.

  8. AN EFFICIENT APPROXIMATION TO THE LIKELIHOOD FOR GRAVITATIONAL WAVE STOCHASTIC BACKGROUND DETECTION USING PULSAR TIMING DATA

    SciTech Connect (OSTI)

    Ellis, J. A.; Siemens, X. [Center for Gravitation, Cosmology and Astrophysics, University of Wisconsin Milwaukee, Milwaukee, WI 53211 (United States); Van Haasteren, R. [Max-Planck-Institut fuer Gravitationphysik (Albert-Einstein-Institut), D-30167 Hanover (Germany)

    2013-05-20T23:59:59.000Z

    Direct detection of gravitational waves by pulsar timing arrays will become feasible over the next few years. In the low frequency regime (10{sup -7} Hz-10{sup -9} Hz), we expect that a superposition of gravitational waves from many sources will manifest itself as an isotropic stochastic gravitational wave background. Currently, a number of techniques exist to detect such a signal; however, many detection methods are computationally challenging. Here we introduce an approximation to the full likelihood function for a pulsar timing array that results in computational savings proportional to the square of the number of pulsars in the array. Through a series of simulations we show that the approximate likelihood function reproduces results obtained from the full likelihood function. We further show, both analytically and through simulations, that, on average, this approximate likelihood function gives unbiased parameter estimates for astrophysically realistic stochastic background amplitudes.

  9. An improved approximation scheme for the centrifugal term and the Hulthen potential

    E-Print Network [OSTI]

    Sameer M. Ikhdair

    2009-01-07T23:59:59.000Z

    We present a new approximation scheme for the centrifugal term to solve the Schrodinger equation with the Hulthen potential for any arbitrary l state by means of a mathematical Nikiforov-Uvarov (NU) method. We obtain the bound state energy eigenvalues and the normalized corresponding eigenfunctions expressed in terms of the Jacobi polynomials or hypergeometric functions for a particle exposed to this potential field. Our numerical results of the energy eigenvalues are found to be in high agreement with those results obtained by using the program based on a numerical integration procedure. The s-wave (l=0) analytic solution for the binding energies and eigenfunctions of a particle are also calculated. The physical meaning of the approximate analytical solution is discussed. The present approximation scheme is systematic and accurate.

  10. On Lossless Approximations, the Fluctuation-Dissipation Theorem, and Limitations of Measurements

    E-Print Network [OSTI]

    Sandberg, Henrik; Doyle, John C

    2010-01-01T23:59:59.000Z

    In this paper, we take a control-theoretic approach to answering some standard questions in statistical mechanics, and use the results to derive limitations of classical measurements. A central problem is the relation between systems which appear macroscopically dissipative but are microscopically lossless. We show that a linear system is dissipative if, and only if, it can be approximated by a linear lossless system over arbitrarily long time intervals. Hence lossless systems are in this sense dense in dissipative systems. A linear active system can be approximated by a nonlinear lossless system that is charged with initial energy. As a by-product, we obtain mechanisms explaining the Onsager relations from time-reversible lossless approximations, and the fluctuation-dissipation theorem from uncertainty in the initial state of the lossless system. The results are applied to measurement devices and are used to quantify limits on the so-called observer effect, also called back action, which is the impact the me...

  11. Relativistic equation of state at subnuclear densities in the Thomas-Fermi approximation

    SciTech Connect (OSTI)

    Zhang, Z. W.; Shen, H., E-mail: shennankai@gmail.com [School of Physics, Nankai University, Tianjin 300071 (China)

    2014-06-20T23:59:59.000Z

    We study the non-uniform nuclear matter using the self-consistent Thomas-Fermi approximation with a relativistic mean-field model. The non-uniform matter is assumed to be composed of a lattice of heavy nuclei surrounded by dripped nucleons. At each temperature T, proton fraction Y{sub p} , and baryon mass density ? {sub B}, we determine the thermodynamically favored state by minimizing the free energy with respect to the radius of the Wigner-Seitz cell, while the nucleon distribution in the cell can be determined self-consistently in the Thomas-Fermi approximation. A detailed comparison is made between the present results and previous calculations in the Thomas-Fermi approximation with a parameterized nucleon distribution that has been adopted in the widely used Shen equation of state.

  12. Approximate inference on planar graphs using loop calculus and belief progagation

    SciTech Connect (OSTI)

    Chertkov, Michael [Los Alamos National Laboratory; Gomez, Vicenc [RADBOUD UNIV; Kappen, Hilbert [RADBOUD UNIV

    2009-01-01T23:59:59.000Z

    We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a finite sum of terms that can be evaluated once the belief propagation (BP) solution is known. In general, full summation over all correction terms is intractable. We develop an algorithm for the approach presented in Chertkov et al. (2008) which represents an efficient truncation scheme on planar graphs and a new representation of the series in terms of Pfaffians of matrices. We analyze in detail both the loop series and the Pfaffian series for models with binary variables and pairwise interactions, and show that the first term of the Pfaffian series can provide very accurate approximations. The algorithm outperforms previous truncation schemes of the loop series and is competitive with other state-of-the-art methods for approximate inference.

  13. Simulating higher-dimensional geometries in GADRAS using approximate one-dimensional solutions.

    SciTech Connect (OSTI)

    Thoreson, Gregory G.; Mitchell, Dean James; Harding, Lee T.

    2013-02-01T23:59:59.000Z

    The Gamma Detector Response and Analysis Software (GADRAS) software package is capable of simulating the radiation transport physics for one-dimensional models. Spherical shells are naturally one-dimensional, and have been the focus of development and benchmarking. However, some objects are not spherical in shape, such as cylinders and boxes. These are not one-dimensional. Simulating the radiation transport in two or three dimensions is unattractive because of the extra computation time required. To maintain computational efficiency, higher-dimensional geometries require approximations to simulate them in one-dimension. This report summarizes the theory behind these approximations, tests the theory against other simulations, and compares the results to experimental data. Based on the results, it is recommended that GADRAS users always attempt to approximate reality using spherical shells. However, if fissile material is present, it is imperative that the shape of the one-dimensional model matches the fissile material, including the use of slab and cylinder geometry.

  14. Mesoscale asymptotic approximations to solutions of mixed boundary value problems in perforated domains

    E-Print Network [OSTI]

    Vladimir Maz'ya; Alexander Movchan; Michael Nieves

    2010-05-24T23:59:59.000Z

    We describe a method of asymptotic approximations to solutions of mixed boundary value problems for the Laplacian in a three-dimensional domain with many perforations of arbitrary shape, with the Neumann boundary conditions being prescribed on the surfaces of small voids. The only assumption made on the geometry is that the diameter of a void is assumed to be smaller compared to the distance to the nearest neighbour. The asymptotic approximation, obtained here, involves a linear combination of dipole fields constructed for individual voids, with the coefficients, which are determined by solving a linear algebraic system. We prove the solvability of this system and derive an estimate for its solution. The energy estimate is obtained for the remainder term of the asymptotic approximation.

  15. On approximations of the Schr\\"odinger-Newton equation by harmonic potentials

    E-Print Network [OSTI]

    Großardt, André

    2015-01-01T23:59:59.000Z

    The evolution of the, initially Gaussian, centre-of-mass wave-function for a homogeneous, spherical particle according to the Schr\\"odinger-Newton equation can be approximated by a harmonic potential, if the wave-function is narrow compared to the size of the particle. Here, the validity of a previously proposed approximation of the Schr\\"odinger-Newton equation is studied, where this is extended beyond the regime of narrow wave-functions, replacing the coupling constant of the harmonic potential by a function of the wave-function width. It turns out that such an extension beyond the narrow wave-function regime is not a good approximation for the self-gravitational evolution according to the Schr\\"odinger-Newton equation.

  16. Power Spectra beyond the Slow Roll Approximation in Theories with Non-Canonical Kinetic Terms

    E-Print Network [OSTI]

    Carsten van de Bruck; Mathew Robinson

    2014-07-23T23:59:59.000Z

    We derive analytical expressions for the power spectra at the end of inflation in theories with two inflaton fields and non-canonical kinetic terms. We find that going beyond the slow-roll approximation is necessary and that the nature of the non-canonical terms have an important impact on the final power spectra at the end of inflation. We study five models numerically and find excellent agreement with our analytical results. Our results emphasise the fact that going beyond the slow-roll approximation is important in times of high-precision data coming from cosmological observations.

  17. The justification of 'Two-Level Approximation' in strong light-matter interaction

    E-Print Network [OSTI]

    Faheel Ather Hashmi; Shi-Yao Zhu

    2014-06-02T23:59:59.000Z

    We investigate the influence of the additional third level on the dynamic evolution of a Two-Level system interacting with a coherent field in the strong coupling regime where Rotating Wave Approximation is not valid. We find that the additional level has great influence on the evolution of the system population. Our results show that the Two-Level model is not a good approximation in this strong light-matter coupling regime. We further investigate the parameter space where the Two-Level model can still be justified.

  18. Approximate Symmetry Analysis of a Class of Perturbed Nonlinear Reaction-Diffusion Equations

    E-Print Network [OSTI]

    Mehdi Nadjafikhah; Abolhassan Mahdavi

    2014-05-11T23:59:59.000Z

    In this paper, the problem of approximate symmetries of a class of non-linear reaction-diffusion equations called Kolmogorov-Petrovsky-Piskounov (KPP) equation is comprehensively analyzed. In order to compute the approximate symmetries, we have applied the method which was proposed by Fushchich and Shtelen [8] and fundamentally based on the expansion of the dependent variables in a perturbation series. Particularly, an optimal system of one dimensional subalgebras is constructed and some invariant solutions corresponding to the resulted symmetries are obtained.

  19. Polynomial Approximants for the Calculation of Polarization Profiles in the \\ion{He}{1} 10830 ÅMultiplet

    E-Print Network [OSTI]

    H. Socas-Navarro; J. Trujillo Bueno; E. Landi Degl'Innocenti

    2005-05-16T23:59:59.000Z

    The \\ion{He}{1} multiplet at 10830 \\AA is formed in the incomplete Paschen-Back regime for typical conditions found in solar and stellar atmospheres. The positions and strengths of the various components that form the Zeeman structure of this multiplet in the Paschen-Back regime are approximated here by polynomials. The fitting errors are smaller than $\\sim10^{-2}$ m\\AA in the component positions and $\\sim10^{-3}$ in the relative strengths. The approximant polynomials allow for a very fast implementation of the incomplete Paschen-Back regime in numerical codes for the synthesis and inversion of polarization profiles in this important multiplet.

  20. On the approximations of the distribution function of fusion alpha particles

    SciTech Connect (OSTI)

    Bilato, R., E-mail: roberto.bilato@ipp.mpg.de; Brambilla, M.; Poli, E. [Max Planck Institute for Plasma Physics, EURATOM Association, Boltzmannstr. 2, 85748 Garching (Germany)

    2014-10-15T23:59:59.000Z

    The solution of the drift-kinetic equation for fusion-born alpha particles is derived in the limit of dominant parallel streaming, and it is related to the usual slowing-down distribution function. The typical approximations of the fast tail of fusion-born alpha particles are briefly compared and discussed. In particular, approximating the distribution function of fast-alpha particles with an “equivalent” Maxwellian is inaccurate to describe absorption of radio-frequency waves in the ion-cyclotron range of frequencies.

  1. New Sampling-Based Summary Statistics for Improving Approximate Query Answers

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    techniques for their fast incremental maintenance regardless of the data distribution. We quantify mining [GM95, HHW97]. Moreover, as discussed by Faloutsos er al. [FJS97], sometimes the base data available. Techniques for fast approximate answers can also be used in a more traditional role within

  2. Improved Steiner Tree Approximation in Graphs Gabriel Robins \\Lambda Alexander Zelikovsky y

    E-Print Network [OSTI]

    Zelikovsky, Alexander

    ). In quasi­bipartite graphs our heuristic achieves an approximation ratio of ß 1:28 in time O(mn 2 ), where m also show \\Lambda Department of Computer Science, University of Virginia, Thornton Hall, Charlottesville, VA, 22903, robins@cs.virginia.edu y Department of Computer Science, Georgia State University

  3. Blind Equalization via Approximate Maximum Likelihood Source Seungjin CHOI x1 and Andrzej CICHOCKI y

    E-Print Network [OSTI]

    Choi, Seungjin

    Blind Equalization via Approximate Maximum Likelihood Source Separation Seungjin CHOI x1, RIKEN 2-1 Hirosawa, Wako-shi Saitama 351-0198, JAPAN Abstract Blind equalization of single input multiple output (SIMO) FIR channels can be refor- mulated as the problem of blind source separation

  4. COMBINING BLIND SOURCE EXTRACTION WITH JOINT APPROXIMATE DIAGONALIZATION: THIN ALGORITHMS FOR ICA

    E-Print Network [OSTI]

    Cichocki, Andrzej

    COMBINING BLIND SOURCE EXTRACTION WITH JOINT APPROXIMATE DIAGONALIZATION: THIN ALGORITHMS FOR ICA contrast function is proposed for the blind signal extraction of a subset of the indepen- dent components- tion techniques with the flexibility of the methods for blind signal extraction. Its maximization leads

  5. BLIND BACKSCATTERING EXPERIMENTAL DATA COLLECTED IN THE FIELD AND AN APPROXIMATELY GLOBALLY CONVERGENT INVERSE ALGORITHM

    E-Print Network [OSTI]

    1 BLIND BACKSCATTERING EXPERIMENTAL DATA COLLECTED IN THE FIELD AND AN APPROXIMATELY GLOBALLY of targets from blind experimental data. The data were collected in the field by the Forward Looking Radar process. The UNCC/ChalmersGU team has worked only with the most challenging case of blind experimen- tal

  6. A New Approximate Matrix Factorization for Implicit Time Integration in Air Pollution

    E-Print Network [OSTI]

    Botchev, Mike

    A New Approximate Matrix Factorization for Implicit Time Integration in Air Pollution Modeling M on the one hand and its efficiency on the other hand. For example, in air pollution modeling, AMF has been factorization, large sparse linear systems, stiff ODEs, method of lines, Rosenbrock methods, air pollution

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

    E-Print Network [OSTI]

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

  8. Causal Belief Decomposition for Planning with Sensing: Completeness Results and Practical Approximation

    E-Print Network [OSTI]

    Bonet, Blai

    variables that are all relevant to a given precondition or goal. In this work, we extend this result both, and powerful approximation that trades completeness by speed, and is both time and space exponential yields state-of-the-art real-time performance in domains with high widths but low causal widths

  9. Power and Effective Study Size Based on Approximations to the Expected Likelihood Ratio

    E-Print Network [OSTI]

    Washington at Seattle, University of

    Power and Effective Study Size Based on Approximations to the Expected Likelihood Ratio Test statistical power and precision of heritability estimates can be difficult particularly in complex pedigrees. Previous work focused on the power to detect heritability by using the expectation of the likelihood ratio

  10. Efficient MAP approximation for dense energy functions Marius Leordeanu mleordea@andrew.cmu.edu

    E-Print Network [OSTI]

    Shamos, Michael I.

    Efficient MAP approximation for dense energy functions Marius Leordeanu mleordea Abstract We present an efficient method for maximiz- ing energy functions with first and second order energy obtained has a certain optimal bound. Starting from this energy we follow an efficient coordinate

  11. Toward Off-Policy Learning Control with Function Approximation Hamid Reza Maei,

    E-Print Network [OSTI]

    Sutton, Richard S.

    -560012, India Abstract We present the first temporal-difference learning algorithm for off-policy controlToward Off-Policy Learning Control with Function Approximation Hamid Reza Maei, Csaba Szepesv, which has hitherto been restricted to a prediction (policy evaluation) setting, to a control set- ting

  12. TIME-VARYING LINEAR MODEL APPROXIMATION: APPLICATION TO THERMAL AND AIRFLOW BUILDING SIMULATION

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    TIME-VARYING LINEAR MODEL APPROXIMATION: APPLICATION TO THERMAL AND AIRFLOW BUILDING SIMULATION Nowadays, most of the numerical tools dedicated to simulating the thermal behavior of buildings, consider is demonstrated by its application to the simulation of a multi-zones building. THERMAL AND AIRFLOW MODELS

  13. Programs in Mathematica relevant to Phase Integral Approximation for coupled ODEs of the Schrödinger type

    E-Print Network [OSTI]

    Andrzej A. Skorupski

    2007-11-06T23:59:59.000Z

    Three programs in Mathematica are presented, which produce expressions for the lowest order and the higher order corrections of the Phase Integral Approximation. First program is pertinent to one ordinary differential equation of the Schr\\"odinger type. The remaining two refer to a set of two such equations.

  14. Application as new OSMC Organizational Member [An organizational OSMC membership application should contain approximately the following:

    E-Print Network [OSTI]

    Zhao, Yuxiao

    should contain approximately the following:] Date. yyyy-month-day To: Open Source Modelica Consortium number or equivalent if available Application for Organizational Membership in the Open Source Modelica Consortium (OSMC) Organization-name hereby applies for membership in the Open Source Modelica Consortium

  15. Weighted Radon transforms for which the Chang approximate inversion formula is precise

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Weighted Radon transforms for which the Chang approximate inversion formula is precise R.G. Novikov formula is precise. Some subsequent results, including the Cormack type inversion for these transforms, are also given. 1.Introduction We consider the weighted ray transformation PW defined by the formula PW f

  16. Using the Wavenet for function approximation Alexander Ypma and Robert P. W. Duin

    E-Print Network [OSTI]

    Duin, Robert P.W.

    Using the Wavenet for function approximation Alexander Ypma and Robert P. W. Duin Pattern are known to be a suitable technique. The Wavenet combines them with the wavelet transform, enabling a multi of the Wavenet are investigated and an outlook to application in machinery monitoring is provided. 1 Introduction

  17. Approximate Conditional Least Squares Estimation of a Nonlinear State-Space Model via Unscented Kalman

    E-Print Network [OSTI]

    Chan, Kung-Sik

    Kalman Filter Kwang Woo Ahn Division of Biostatistics Medical College of Wisconsin, Milwaukee, WI 53226 function computed approximately via unscented Kalman filter (UKF). We derive conditions 1 #12;under which. ---------------------------- Keywords: Nonlinear time series; State-space model; Unscented Kalman filter; SIR model. 1. INTRODUCTION

  18. Approximations to wave propagation through doubly-periodic arrays of scatterers

    E-Print Network [OSTI]

    Approximations to wave propagation through doubly-periodic arrays of scatterers P. Mc Abstract The propagation of waves through a doubly-periodic array of identical rigid scatterers of matched asymptotic expansions is used to obtain the dispersion relation corresponding to wave propagation

  19. Large Scale Approximate Inference and Experimental Design for Sparse Linear Models

    E-Print Network [OSTI]

    Seeger, Matthias

    Large Scale Approximate Inference and Experimental Design for Sparse Linear Models Matthias W.kyb.tuebingen.mpg.de/bs/people/seeger/ 27 June 2008 Matthias W. Seeger (MPI BioCyb) Large Scale Bayesian Experimental Design 27/6/08 1 / 27 Algorithms 4 Magnetic Resonance Imaging Sequences Matthias W. Seeger (MPI BioCyb) Large Scale Bayesian

  20. Join Synopses for Approximate Query Answering Swarup Acharya Phillip B. Gibbons Viswanath Poosala Sridhar Ramaswamy

    E-Print Network [OSTI]

    Gibbons, Phillip B.

    optimizer to estimate plan costs; such an application demands very fast response times but not exact answers to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full solely on providing exact answers to queries, in a manner that seeks to minimize response time

  1. 1808 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 4, NOVEMBER 2006 Sensitivity, Approximation, and Uncertainty

    E-Print Network [OSTI]

    Hiskens, Ian A.

    , and Uncertainty in Power System Dynamic Simulation Ian A. Hiskens, Fellow, IEEE, and Jassim Alseddiqui, Student1808 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 4, NOVEMBER 2006 Sensitivity, Approximation Member, IEEE Abstract--Parameters of power system models, in particular load models, are seldom known

  2. An Approximate Method to Assess the Peaking Capability of the NW Hydroelectric System

    E-Print Network [OSTI]

    DRAFT 1 An Approximate Method to Assess the Peaking Capability of the NW Hydroelectric System September 26, 2005 The best way to assess the hydroelectric system's peaking capability is to simulate its. This is an ominous task and requires the use of sophisticated simulation software. The Bonneville Power

  3. A Note on Euler Approximations for Stochastic Differential Equations with Delay

    SciTech Connect (OSTI)

    Gyöngy, Istvan; Sabanis, Sotirios, E-mail: s.sabanis@ed.ac.uk [University of Edinburgh, Maxwell Institute for Mathematical Sciences and School of Mathematics (United Kingdom)

    2013-12-15T23:59:59.000Z

    An existence and uniqueness theorem for a class of stochastic delay differential equations is presented, and the convergence of Euler approximations for these equations is proved under general conditions. Moreover, the rate of almost sure convergence is obtained under local Lipschitz and also under monotonicity conditions.

  4. Spatially-discretized high-temperature approximations and theirO(N) implementation on a grid

    SciTech Connect (OSTI)

    Predescu, Cristian

    2006-10-01T23:59:59.000Z

    We consider the problem of performing imaginary-time propagation of wavefunctions on a grid. We demonstrate that spatially-continuous high-temperature approximations can be discretized in such a way that their convergence order is preserved. Requirements of minimal computational work and reutilization of data then uniquely determine the optimal grid, quadrature technique, and propagation method. It is shown that the optimal propagation technique is O(N) with respect to the grid size. The grid technique is utilized to compare the Monte Carlo efficiency of the Trotter-Suzuki approximation against a recently introduced fourth-order high-temperature approximation, while circumventing the issue of statistical noise, which usually prevents such comparisons from being carried out. We document the appearance of a systematic bias in the Monte Carlo estimators that involve temperature differentiation of the density matrix, bias that is due to the dependence of the eigenvalues on the inverse temperature. This bias is negotiated more successfully by the short-time approximations having higher convergence order, leading to non-trivial computational savings.

  5. Karhunen-Lo`eve Approximation of Random Fields by Generalized Fast Multipole Methods

    E-Print Network [OSTI]

    Lang, Annika

    Karhunen-Lo`eve Approximation of Random Fields by Generalized Fast Multipole Methods C. Schwab by Generalized Fast Multipole Methods C. Schwab and R.A. Todor Seminar f¨ur Angewandte Mathematik Eidgen on a quasiuniform, possibly unstructured mesh of width h in D, plus a generalized Fast Multipole ac- celerated

  6. Static multipole polarizabilities of S atoms or ions using the Frozen-Core approximation

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    137 Static multipole polarizabilities of S atoms or ions using the Frozen-Core approximation S. I'Hartree-Fock découplée. Abstract. 2014 Static multipole polarizabilities of S atoms or ions have been calculated by two 31.10 Recently we reported [1] a variational treatment for static multipole polarizabilities

  7. Strategie s for Walking on Potential Energy Surfaces Using Local Quadratic Approximations

    E-Print Network [OSTI]

    Simons, Jack

    Strategie s for Walking on Potential Energy Surfaces Using Local Quadratic Approximations JACK on potential energy surfaces is further analyzed. This method utilizes local gradient and Hessian (Le., fust and second energy derivative) information to generate a series of "steps" that are folIowed to the desired

  8. ON THE APPROXIMATE W-DISJOINT ORTHOGONALITY OF SPEECH Scott Rickard

    E-Print Network [OSTI]

    Yilmaz, Ozgur

    ON THE APPROXIMATE W-DISJOINT ORTHOGONALITY OF SPEECH Scott Rickard£ and ¨Ozg¨ur YilmazÝ Siemens sources, and [5], which exploited the sparsity of the short-time Fourier transform when applied to speech is with the Audio and Signal Processing Group, Siemens Corporate Research and the Program in Applied

  9. APPROXIMATELY OPTIMAL ASSIGNMENT FOR UNEQUAL LOSS Alexander E. Mohr, Richard E. Ladner

    E-Print Network [OSTI]

    Washington at Seattle, University of

    of a utility function over that data. After discussing network loss estimation, Reed­ Solomon codes are brieflyAPPROXIMATELY OPTIMAL ASSIGNMENT FOR UNEQUAL LOSS PROTECTION Alexander E. Mohr, Richard E. Ladner­2350 Eve A. Riskin Box 352500 Department of Electrical Engr. University of Washington Seattle, WA 98195

  10. APPROXIMATELY OPTIMAL ASSIGNMENT FOR UNEQUAL LOSS Alexander E. Mohr, Richard E. Ladner

    E-Print Network [OSTI]

    Mohr, Alexander E.

    of a utility function over that data. After discussing network loss estimation, Reed- Solomon codes are brieflyAPPROXIMATELY OPTIMAL ASSIGNMENT FOR UNEQUAL LOSS PROTECTION Alexander E. Mohr, Richard E. Ladner-2350 Eve A. Riskin Box 352500 Department of Electrical Engr. University of Washington Seattle, WA 98195

  11. A Wavelet-Based Approximation of Surface Coil Sensitivity Profiles for Correction of Image

    E-Print Network [OSTI]

    A Wavelet-Based Approximation of Surface Coil Sensitivity Profiles for Correction of Image, Cambridge, Massachusetts Abstract: We evaluate a wavelet-based algorithm to estimate the coil sensitivity of the coil sensitivity profile based on the wavelet transform of the original image data was found to provide

  12. Approximation Algorithms For Wireless Sensor Deployment Xiaochun Xu and Sartaj Sahni

    E-Print Network [OSTI]

    Sahni, Sartaj K.

    will be able to adequately monitor the target region. When site selection is possible, we use deterministic of the problem considered here is in the deployment of chemical and radioactive sensors so as to monitor high risk targets that may be approximated as points; the cost of a sensor may be from hundreds of dollars

  13. Green's function approximation from cross-correlation of active sources in the ocean

    E-Print Network [OSTI]

    Gerstoft, Peter

    Green's function approximation from cross-correlation of active sources in the ocean Laura A, California 92093 Received 15 January 2009; revised 1 May 2009; accepted 2 May 2009 Green's function, differences between the empirical Green's function estimates and simulated Green's functions, are explained

  14. Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem 1

    E-Print Network [OSTI]

    Bose, Prosenjit

    Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem 1 Prosenjit Bose Fermat-Weber problem in any #12;xed dimension. 1 Introduction Let S = fp 1 ; : : : ; p n g be a set roots that can be irrational numbers [1]. A famous problem related to the function w is the Fermat-Weber

  15. Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem y

    E-Print Network [OSTI]

    Bose, Prosenjit

    Fast Approximations for Sums of Distances, Clustering and the Fermat-Weber Problem y Prosenjit Bose algorithm for the so called Fermat-Weber problem in any #12;xed dimension. 1 Introduction Let S = fp 1 be irrational numbers [1]. A famous problem related to the function w is the Fermat-Weber problem [4] which asks

  16. Lockout/Tagout According to OSHA (29 CFR 1910.147), approximately 3 million workers service

    E-Print Network [OSTI]

    Lockout/Tagout According to OSHA (29 CFR 1910.147), approximately 3 million workers service equipment and if lockout/tagout (LOTO) is not properly implemented they face the risk of injury. LOTO refers. The lockout standard applies when: 1. Employee must remove or bypass a guard or other safety device during

  17. A near-optimal approximation algorithm for Asymmetric TSP1 on embedded graphs2

    E-Print Network [OSTI]

    Erickson, Jeff

    algorithm of Oveis Gharan and Saberi [SODA 2011], which applies only to graphs15 with orientable genus g and Saberi [11] described a polynomial-time9 O( g log g)-approximation algorithm when the input includes and Saberi [11] applies only to23 graphs embedded on orientable surfaces.24 Chekuri and Sidiropoulos [3

  18. Approximating Market Equilibria Kamal Jain 1 , Mohammad Mahdian 2 , and Amin Saberi 3

    E-Print Network [OSTI]

    Saberi, Amin

    Approximating Market Equilibria Kamal Jain 1 , Mohammad Mahdian 2 , and Amin Saberi 3 1 Microsoft, USA. saberi@cc.gatech.edu Abstract. In this paper we consider the classic problem of finding by placing di#erent assumptions #12; 2 Kamal Jain, Mohammad Mahdian, and Amin Saberi on the endowment

  19. An improved thin film approximation to accurately determine the optical conductivity of graphene from infrared transmittance

    SciTech Connect (OSTI)

    Weber, J. W.; Bol, A. A. [Department of Applied Physics, Eindhoven University of Technology, Den Dolech 2, P.O. Box 513, 5600 MB Eindhoven (Netherlands); Sanden, M. C. M. van de [Department of Applied Physics, Eindhoven University of Technology, Den Dolech 2, P.O. Box 513, 5600 MB Eindhoven (Netherlands); Dutch Institute for Fundamental Energy Research (DIFFER), Nieuwegein (Netherlands)

    2014-07-07T23:59:59.000Z

    This work presents an improved thin film approximation to extract the optical conductivity from infrared transmittance in a simple yet accurate way. This approximation takes into account the incoherent reflections from the backside of the substrate. These reflections are shown to have a significant effect on the extracted optical conductivity and hence on derived parameters as carrier mobility and density. By excluding the backside reflections, the error for these parameters for typical chemical vapor deposited (CVD) graphene on a silicon substrate can be as high as 17% and 45% for the carrier mobility and density, respectively. For the mid- and near-infrared, the approximation can be simplified such that the real part of the optical conductivity is extracted without the need for a parameterization of the optical conductivity. This direct extraction is shown for Fourier transform infrared (FTIR) transmittance measurements of CVD graphene on silicon in the photon energy range of 370–7000?cm{sup ?1}. From the real part of the optical conductivity, the carrier density, mobility, and number of graphene layers are determined but also residue, originating from the graphene transfer, is detected. FTIR transmittance analyzed with the improved thin film approximation is shown to be a non-invasive, easy, and accurate measurement and analysis method for assessing the quality of graphene and can be used for other 2-D materials.

  20. Approximation of Subnetwork Models using Frequency-Domain Data Henrik Sandberg and Richard M. Murray

    E-Print Network [OSTI]

    Murray, Richard M.

    for decentralized control design. The suggested approach is based on approximation of so-called subnetwork models. Applications for this research are, for example, automated highway systems, vehicle formation control, power systems, sensor/actuator networks, and cross-directional control in paper machines. In an interconnected

  1. Level-Set Variational Implicit-Solvent Modeling of Biomolecules with the Coulomb-Field Approximation

    E-Print Network [OSTI]

    Li, Bo

    (2006) and J. Chem. Phys., 124, 084905 (2006))] of molecular sol- vation is a mean-field free-energy of the electrostatic free energy. Such an approximation is a volume integral over an arbitrary shaped solvent region approach by calculating solvation free energies and potentials of mean force for small and large molecules

  2. On the approximation of local and linear radiative damping in the middle

    E-Print Network [OSTI]

    Wirosoetisno, Djoko

    atmosphere. In general, this damping is a nonlocal process in which heat is transferred to and from remote form 13 November 2009) ABSTRACT The validity of approximating radiative heating rates in the middle'') is investigated. Using radiative heating rate and temperature output from a chemistry­climate model with realistic

  3. The Proof: and The approximate and of crude circuits CC(X) and

    E-Print Network [OSTI]

    Lyuu, Yuh-Dauh

    The Proof: and · The approximate and of crude circuits CC(X) and CC(Y) is CC(pluck({Xi Yj : Xi X that the resulting crude circuit has "a lot" of false positives or false negatives. c 2008 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 718 #12;The Final Crude Circuit Lemma 93 Every final crude circuit either

  4. Vision Research 40 (2000) 16951709 Texture luminance judgments are approximately veridical

    E-Print Network [OSTI]

    California at Irvine, University of

    2000-01-01T23:59:59.000Z

    Vision Research 40 (2000) 1695­1709 Texture luminance judgments are approximately veridical Jong. Specifically, we address the following question: how do different luminances influence the perceived total luminance of a composite image? We investigate this question using a paradigm in which the observer attempts

  5. Approximate Response Time for Fixed Priority Real-Time Systems with Energy-Harvesting

    E-Print Network [OSTI]

    Boyer, Edmond

    Approximate Response Time for Fixed Priority Real-Time Systems with Energy-Harvesting Yasmina sufficient schedulability tests for fixed-priority pre-emptive scheduling of a real-time system under energy constraints. In this problem, energy is harvested from the ambient environment and used to replenish a storage

  6. Numerical approximation of the Schrödinger equation with the electromagnetic field by the Hagedorn wave packets

    SciTech Connect (OSTI)

    Zhou, Zhennan, E-mail: zhou@math.wisc.edu

    2014-09-01T23:59:59.000Z

    In this paper, we approximate the semi-classical Schrödinger equation in the presence of electromagnetic field by the Hagedorn wave packets approach. By operator splitting, the Hamiltonian is divided into the modified part and the residual part. The modified Hamiltonian, which is the main new idea of this paper, is chosen by the fact that Hagedorn wave packets are localized both in space and momentum so that a crucial correction term is added to the truncated Hamiltonian, and is treated by evolving the parameters associated with the Hagedorn wave packets. The residual part is treated by a Galerkin approximation. We prove that, with the modified Hamiltonian only, the Hagedorn wave packets dynamics give the asymptotic solution with error O(?{sup 1/2}), where ? is the scaled Planck constant. We also prove that, the Galerkin approximation for the residual Hamiltonian can reduce the approximation error to O(?{sup k/2}), where k depends on the number of Hagedorn wave packets added to the dynamics. This approach is easy to implement, and can be naturally extended to the multidimensional cases. Unlike the high order Gaussian beam method, in which the non-constant cut-off function is necessary and some extra error is introduced, the Hagedorn wave packets approach gives a practical way to improve accuracy even when ? is not very small.

  7. An Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid-

    E-Print Network [OSTI]

    Powell, Warren B.

    dispatch and energy allocation decisions in the presence of grid-level storage. The model makes it possible the economic behavior of energy allocation and electric power dispatch. Linear pro- gramming has been usedAn Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid

  8. Error of the network approximation for densely packed composites with irregular geometry

    E-Print Network [OSTI]

    Novikov, Alexei

    properties such as the effective conductivity or the effective dielectric constant of composite materials the concentration of the filling inclusions is high is particularly relevant to polymer/ceramic composites, becauseError of the network approximation for densely packed composites with irregular geometry Leonid

  9. On the Construction of Initial Basis Function for Efficient Value Function Approximation

    E-Print Network [OSTI]

    Lin, Jason Yi-Bing

    ) are a general framework for planning and learning under uncertainty. On solving problems with large-scale for the learning process [11]. Incremental basis generation aims to provide feature expansion, and both the work the issues of improving the feature generation methods for the value-function approximation and the state

  10. A New Approximate Matrix Factorization for Implicit Time Integration in Air Pollution

    E-Print Network [OSTI]

    Botchev, Mike

    A New Approximate Matrix Factorization for Implicit Time Integration in Air Pollution Modeling + M on the one hand and its e#ciency on the other hand. For example, in air pollution modeling, AMF has been factorization, large sparse linear systems, sti# ODEs, method of lines, Rosenbrock methods, air pollution

  11. Approximation of Coupled Stokes-Darcy Flow in an Axisymmetric V.J. Ervin

    E-Print Network [OSTI]

    Ervin, Vincent J.

    we investigate the numerical approximation of coupled Stokes and Darcy fluid flow equations are also given for a model of fluid flow in the eye. Key words. axisymmetric flow; Stokes equation, Darcy equation) in the Darcy domain. Other researchers who have used this approach include [30, 21, 11, 9

  12. DARCY'S FLOW WITH PRESCRIBED CONTACT ANGLE WELL-POSEDNESS AND LUBRICATION APPROXIMATION

    E-Print Network [OSTI]

    DARCY'S FLOW WITH PRESCRIBED CONTACT ANGLE ­ WELL-POSEDNESS AND LUBRICATION APPROXIMATION HANS KN on a solid sub- strate. We use a model for viscous fluids where evolution is governed by Darcy's Law converge to the solutions of a one-dimensional degenerate parabolic fourth order equation which belongs

  13. Quasi-local-density approximation for a van der Waals energy functional

    E-Print Network [OSTI]

    John F. Dobson

    2003-11-17T23:59:59.000Z

    We discuss a possible form for a theory akin to local density functional theory, but able to produce van der Waals energies in a natural fashion. The usual Local Density Approximation (LDA) for the exchange and correlation energy $E_{xc}$ of an inhomogeneous electronic system can be derived by making a quasilocal approximation for the {\\it interacting} density-density response function $\\chi (\\vec{r},\\vec{r} ^{\\prime},\\omega)$, then using the fluctuation-dissipation theorem and a Feynman coupling-constant integration to generate $E_{xc}$. The first new idea proposed here is to use the same approach except that one makes a quasilocal approximation for the {\\it bare} response $\\chi ^{0}$, rather than for $\\chi $. The interacting response is then obtained by solving a nonlocal screening integral equation in real space. If the nonlocal screening is done at the time-dependent Hartree level, then the resulting energy is an approximation to the full inhomogeneous RPA energy: we show here that the inhomogeneous RPA correlation energy contains a van der Waals term for the case of widely-separated neutral subsystems. The second new idea is to use a particularly simple way of introducing LDA-like local field corrrections into the screening equations, giving a theory which should remain reasonable for all separations of a pair of subsystems, encompassing both the van der Waals limit much as in RPA and the bonding limit much as in LDA theory.

  14. Relaxation Approximations to Shallow Water and Pollutant Transport Department of Sciences, Division of Mathematics,

    E-Print Network [OSTI]

    Katsaounis, Theodoros D.

    1 Relaxation Approximations to Shallow Water and Pollutant Transport Equations A.I. Delis solution of shallow water flows and the transport and diffusion of pollutant in such flows. By first can be considered as an alternative to classical finite difference methods. Keywords--Shallow water

  15. The Approximation of Outage Probability and the Trade-off between Capacity and Diversity for the

    E-Print Network [OSTI]

    Scharf, Louis

    The Approximation of Outage Probability and the Trade-off between Capacity and Diversity for the Frequency-Selective Channel Zhifei Fan Department of Electrical and Computer Engineering Colorado State University Fort Collins, CO 80523 Email: fanz@engr.colostate.edu Louis Scharf Department of Electrical

  16. On-line and Approximation Algorithms Fall Semester, 2011/12 Final Exam: February 8, 2012

    E-Print Network [OSTI]

    Azar, Yossi

    On-line and Approximation Algorithms Fall Semester, 2011/12 Final Exam: February 8, 2012 Lecturer a subset of machines Si of size m/2 and two values wi and pi. Assigning job i is assigned to a machine j Si increases the load of j by wi where assigning job i to a machine j / Si increases the load of j

  17. On-line and Approximation Algorithms Fall Semester, 2009/10 Final Exam: January 25, 2010

    E-Print Network [OSTI]

    Azar, Yossi

    On-line and Approximation Algorithms Fall Semester, 2009/10 Final Exam: January 25, 2010 Lecturer capacity. At round i we receive a request to connect si to ti with one of two options. The first non additive constant is needed). The duration of the exam is 3 hours. GOOD LUCK 1 #12;

  18. On-line and Approximation Algorithms Spring Semester, 2006 Final Exam: June 12, 2006

    E-Print Network [OSTI]

    Azar, Yossi

    On-line and Approximation Algorithms Spring Semester, 2006 Final Exam: June 12, 2006 Lecturer: Prof problem on m (divisible by 3) machines. Job i has weight wi and a subset Si of size m/3 of the m machines. The job has to be assigned to one machine in Si. (a) Design a 4 competitive algorithm. (b) Show

  19. Dynamic Programming Approximations for Stochastic, Time-Staged Integer Multicommodity Flow Problems

    E-Print Network [OSTI]

    Topaloglu, Huseyin

    . We propose an iterative, adaptive dynamic programming-based methodology that makes use of linear andDynamic Programming Approximations for Stochastic, Time-Staged Integer Multicommodity Flow Problems by a set of indivisible and reusable resources of different types. The assignment of a resource to a task

  20. Extended Soft Binding Mean Spherical- Contact Probability Approximation for Hard Ions

    SciTech Connect (OSTI)

    Blum, L. [Department of Mathematics, Rutgers University (United States); Arias, M.; Veloz, D. V. Perez [Physics Department, University of Puerto Rico (Puerto Rico)

    2009-03-09T23:59:59.000Z

    We propose a new analytical theory of electrolytes that extends the range of the Mean Spherical Approximation (MSA) to include extremely high charges [1, 2, 3, 4, 5]. In the MSA the thermodynamics and structure of the most general electrolyte are given in terms of a single screening parameter {gamma}, [1] which is obtained from the simple algebraic equation.

  1. Sinc Approximation of the Heat Distribution on the Boundary of a Two-Dimensional Finite Slab

    E-Print Network [OSTI]

    Dinh, Alain Pham Ngoc; Trong, Dang Duc

    2007-01-01T23:59:59.000Z

    We consider the two-dimensional problem of recovering globally in time the heat distribution on the surface of a layer inside of a heat conducting body from two interior temperature measurements. The problem is ill-posed. The approximation function is represented by a two-dimensional Sinc series and the error estimate is given.

  2. FINITE VOLUME APPROXIMATION OF THE EFFECTIVE DIFFUSION MATRIX: THE CASE OF INDEPENDENT BOND

    E-Print Network [OSTI]

    FINITE VOLUME APPROXIMATION OF THE EFFECTIVE DIFFUSION MATRIX: THE CASE OF INDEPENDENT BOND with independent jump rates across nearest neighbour bonds of the lattice. We show that the infinite volume effective diffusion matrix can be almost surely recovered as the limit of finite volume periodized effective

  3. A closed-form approximate expression for the optical conductivity of graphene

    E-Print Network [OSTI]

    Simsek, Ergun

    A closed-form approximate expression for the optical conductivity of graphene Ergun Simsek School for the optical conductivity of graphene is developed, which generates re- sults with less than 0.8% maximum.001437 Graphene, a one atom thick sheet of carbon atoms, has been receiving a great deal of interest since its

  4. A New 2D-Transport, 1D-Diffusion Approximation of the Boltzmann Transport equation

    SciTech Connect (OSTI)

    Larsen, Edward

    2013-06-17T23:59:59.000Z

    The work performed in this project consisted of the derivation, implementation, and testing of a new, computationally advantageous approximation to the 3D Boltz- mann transport equation. The solution of the Boltzmann equation is the neutron flux in nuclear reactor cores and shields, but solving this equation is difficult and costly. The new “2D/1D” approximation takes advantage of a special geometric feature of typical 3D reactors to approximate the neutron transport physics in a specific (ax- ial) direction, but not in the other two (radial) directions. The resulting equation is much less expensive to solve computationally, and its solutions are expected to be sufficiently accurate for many practical problems. In this project we formulated the new equation, discretized it using standard methods, developed a stable itera- tion scheme for solving the equation, implemented the new numerical scheme in the MPACT code, and tested the method on several realistic problems. All the hoped- for features of this new approximation were seen. For large, difficult problems, the resulting 2D/1D solution is highly accurate, and is calculated about 100 times faster than a 3D discrete ordinates simulation.

  5. Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data

    E-Print Network [OSTI]

    Fiat, Amos

    Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data LISA K may suffer a cost when their data are used in which case they should be compensated. The analyst and sensitive data may be correlated, it is important to protect the privacy of both data and cost. We model

  6. Reinforcement Learning Control with Approximation of Time-Dependent Agent Dynamics

    E-Print Network [OSTI]

    Kirkpatrick, Kenton

    2013-04-30T23:59:59.000Z

    .4.2 Rotating Robot . . . . . . . . . . . . . . . . . . . . . . . . . . 45 4. DYNAMICS APPROXIMATION LEARNING . . . . . . . . . . . . . . . 56 4.1 First-Order Dynamics Learning . . . . . . . . . . . . . . . . . . . . . 58 4.2 Second-Order Dynamics Learning... . . . . . . . . . . . . . . . . . . . . . . . . . . . . 186 B.4 Overdamped . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 188 viii LIST OF FIGURES FIGURE Page 2.1 Perceptron . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2 Q-learning Simulation of Robot - Goal...

  7. TRAJECTOIRES COMPLEXES ET APPROXIMATION SEMI-CLASSIQUE J. KNOLL et R. SCHAEFFER

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    équations semi-classiques (BKW) décrivant la diffusion de deux particules. Ceci nous a permis d'inclure un équations classiquesdu mouvement. Celapermet, tout en restant dans le cadre de l'approximation BKW, de

  8. The University of Minnesota saves approximately $3 million annually as a result of district cooling,

    E-Print Network [OSTI]

    Webb, Peter

    Benefits The University of Minnesota saves approximately $3 million annually as a result running stand-alone units in individual buildings. Money is saved through: · Reducedmaintenancecosts eco-friendly products. The district unit's efficiency means they use less energy. Cost Savings Annual

  9. Feature Selection Using f-Information Measures in Fuzzy Approximation Spaces

    E-Print Network [OSTI]

    Pal, Sankar Kumar

    of real-life data sets. Index Terms--Pattern recognition, data mining, feature selection, fuzzy-rough sets is an essential preprocessing step used for pattern recognition, data mining, machine learning, etc., [1], [2Feature Selection Using f-Information Measures in Fuzzy Approximation Spaces Pradipta Maji

  10. A Coupled AtmosphereOcean Radiative Transfer System Using the Analytic Four-Stream Approximation

    E-Print Network [OSTI]

    Liou, K. N.

    of the ocean. Shortwave radiation from the sun contributes most of the heat fluxes that penetrate the airA Coupled Atmosphere­Ocean Radiative Transfer System Using the Analytic Four-Stream Approximation WEI-LIANG LEE AND K. N. LIOU Department of Atmospheric and Oceanic Sciences, University of California

  11. Quasiparticle random phase approximation uncertainties and their correlations in the analysis of neutrinoless double beta decay

    E-Print Network [OSTI]

    Amand Faessler; G. L. Fogli; E. Lisi; V. Rodin; A. M. Rotunno; F. Simkovic

    2009-03-06T23:59:59.000Z

    The variances and covariances associated to the nuclear matrix elements (NME) of neutrinoless double beta decay are estimated within the quasiparticle random phase approximation (QRPA). It is shown that correlated NME uncertainties play an important role in the comparison of neutrinoless double beta decay rates for different nuclei, and that they are degenerate with the uncertainty in the reconstructed Majorana neutrino mass.

  12. Neutrinoless double beta decay of 48Ca in the shell model: Closure versus nonclosure approximation

    E-Print Network [OSTI]

    R. A. Sen'kov; M. Horoi

    2013-12-16T23:59:59.000Z

    Neutrinoless double-beta decay is a unique process that could reveal physics beyond the Standard Model. Essential ingredients in the analysis of neutrinoless double-beta rates are the associated nuclear matrix elements. Most of the approaches used to calculate these matrix elements rely on the closure approximation. Here we analyze the light neutrino-exchange matrix elements of 48Ca neutrinoless double-beta decay and test the closure approximation in a shell-model approach. We calculate the neutrinoless double-beta nuclear matrix elements for 48Ca using both the closure approximation and a nonclosure approach, and we estimate the uncertainties associated with the closure approximation. We demonstrate that the nonclosure approach has excellent convergence properties which allow us to avoid unmanageable computational cost. Combining the nonclosure and closure approaches we propose a new method of calculation for neutrinoless double-beta decay rates which can be applied to the neutrinoless double-beta decay rates of heavy nuclei, such as 76Ge or 82Se.

  13. Approximation Theory and Finite Element Analysis January 2014 Lecturer David Silvester

    E-Print Network [OSTI]

    Silvester, David J.

    Approximation Theory and Finite Element Analysis January 2014 Lecturer David Silvester Office Alan Analysis, CUP, 2003. · Dietrich Braess, Finite Elements: Theory, Fast Solvers and Applications in Solid Mechanics, CUP, Third Edition, 2007. · Howard Elman, David Silvester and Andy Wathen, Finite Elements

  14. Mentorship Groups Groups are sorted by approximate area. Mentors are in bold, and apprentice students are

    E-Print Network [OSTI]

    May, J. Peter

    Mentorship Groups Groups are sorted by approximate area. Mentors are in bold, and apprentice-ok Choi (CSP, Undergraduate Mentor) · Mitch Hill (Apprentice, 5 weeks, Undergraduate Mentee) · Bradly Stadie (YSP) · Peter Hansen (Intermediate) · Ben Riffer-Reinert (Apprentice, 8 weeks) Analysis: Shawn

  15. Definition of Systematic, Approximately Separable and Modular Internal Coordinates (SASMIC) for macromolecular simulation

    E-Print Network [OSTI]

    Pablo Echenique; J. L. Alonso

    2006-12-04T23:59:59.000Z

    A set of rules is defined to systematically number the groups and the atoms of organic molecules and, particularly, of polypeptides in a modular manner. Supported by this numeration, a set of internal coordinates is defined. These coordinates (termed Systematic, Approximately Separable and Modular Internal Coordinates, SASMIC) are straightforwardly written in Z-matrix form and may be directly implemented in typical Quantum Chemistry packages. A number of Perl scripts that automatically generate the Z-matrix files for polypeptides are provided as supplementary material. The main difference with other Z-matrix-like coordinates normally used in the literature is that normal dihedral angles (``principal dihedrals'' in this work) are only used to fix the orientation of whole groups and a somewhat non-standard type of dihedrals, termed ``phase dihedrals'', are used to describe the covalent structure inside the groups. This physical approach allows to approximately separate soft and hard movements of the molecule using only topological information and to directly implement constraints. As an application, we use the coordinates defined and ab initio quantum mechanical calculations to assess the commonly assumed approximation of the free energy, obtained from ``integrating out'' the side chain degree of freedom chi, by the Potential Energy Surface (PES) in the protected dipeptide HCO-L-Ala-NH2. We also present a sub-box of the Hessian matrix in two different sets of coordinates to illustrate the approximate separation of soft and hard movements when the coordinates defined in this work are used.

  16. A FINITE ELEMENT APPROXIMATION OF A VARIATIONAL INEQUALITY FORMULATION OF BEAN'S MODEL FOR

    E-Print Network [OSTI]

    Elliott, Charles

    A FINITE ELEMENT APPROXIMATION OF A VARIATIONAL INEQUALITY FORMULATION OF BEAN'S MODEL of a variational formulation of Bean's model for the physical configuration of an infinitely long cylindrical's axis, for x R2 . The well-known Bean critical state model can be formulated as an evolutionary

  17. RECONSTRUCTION OF THE EARLY UNIVERSE, ZELDOVICH APPROXIMATION AND MONGE-AMP`ERE GRAVITATION

    E-Print Network [OSTI]

    (t, x) satisfies (0.2) = 1 + t. The Newton law for each gravitating bodies is just (0.3) t((t)2 tRECONSTRUCTION OF THE EARLY UNIVERSE, ZELDOVICH APPROXIMATION AND MONGE-AMP`ERE GRAVITATION YANN Monge-Amp`ere equation for the linear Poisson equation to model gravitation, we introduce a modified

  18. Job Scheduling Using successive Linear Programming Approximations of a Sparse Model

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Job Scheduling Using successive Linear Programming Approximations of a Sparse Model Stephane of parallel jobs on a set of processors either in a cluster or in a multiprocessor computer. For the makespan objective, i.e., the comple- tion time of the last job, this problem has been shown to be NP

  19. MSci Project 20142015 Dr Myrta Gruning Efficient diagonalisation of large Random-Phase Approximation

    E-Print Network [OSTI]

    Paxton, Anthony T.

    larger and more complex systems of interest for several applications, ranging from photovoltaics to art of non-Hermitian matrices, the Random-Phase Approx- imation (RPA) matrices. The size of those matrices matrix. However, such an approximation has been showed to breakdown for systems such as nanotubes

  20. On the Approximability of Comparing Genomes with Sebastien Angibaud, Guillaume Fertin, and Irena Rusu

    E-Print Network [OSTI]

    Fertin, Guillaume

    On the Approximability of Comparing Genomes with Duplicates S´ebastien Angibaud, Guillaume Fertin.angibaud,guillaume.fertin,irena.rusu}@univ-nantes.fr Abstract. A central problem in comparative genomics consists in computing a (dis-)simi- larity measure between two genomes, e.g. in order to construct a phylogenetic tree. A large number of such measures has

  1. A 2-Approximation Algorithms for Genome Rearrangements by Reversals and Transpositions 1

    E-Print Network [OSTI]

    Gu, Qianping

    A 2-Approximation Algorithms for Genome Rearrangements by Reversals and Transpositions 1 Qian of Texas at Dallas, Richardson, TX 75083 U.S.A. Keywords: Sorting of permutations, genome rearrangements: Recently, a new approach to analyze genomes evolving was proposed which is based on comparison of gene

  2. On the Approximability of Comparing Genomes with Sebastien Angibaud, Guillaume Fertin, and Irena Rusu

    E-Print Network [OSTI]

    Fertin, Guillaume

    On the Approximability of Comparing Genomes with Duplicates Sâ??ebastien Angibaud, Guillaume Fertin.angibaud,guillaume.fertin,irena.rusu}@univ­nantes.fr Abstract. A central problem in comparative genomics consists in computing a (dis­)simi­ larity measure between two genomes, e.g. in order to construct a phylogenetic tree. A large number of such measures has

  3. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated

    E-Print Network [OSTI]

    Boyer, Edmond

    The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated Guillaume Blin1 - France guillaume.fertin@univ-nantes.fr Abstract. A promising and active field of comparative genomics con- sists in comparing two genomes by establishing a one-to-one correspon- dence (i.e., a matching) between

  4. Approximating the True Evolutionary Distance Between Two Genomes Krister M. Swenson

    E-Print Network [OSTI]

    Moret, Bernard

    Approximating the True Evolutionary Distance Between Two Genomes Krister M. Swenson Mark Marron Joel V. Earnest-DeYoung Bernard M.E. Moret Abstract As more and more genomes are sequenced, evolutionary bi- ologists are becoming increasingly interested in evolution at the level of whole genomes

  5. The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated

    E-Print Network [OSTI]

    Blin, Guillaume

    The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated Guillaume Blin1 - France guillaume.fertin@univ-nantes.fr Abstract. A promising and active field of comparative genomics con- sists in comparing two genomes by establishing a one-to-one correspon- dence (i.e., a matching) between

  6. Approximate Mining of Consensus Sequential Patterns Hye-Chung (Monica) Kum

    E-Print Network [OSTI]

    Whitton, Mary C.

    . Mining sequential patterns in large databases of such data has become an important data mining task pattern mining, to mine databases with long sequences. A paradigm, which defines patterns operationallyApproximate Mining of Consensus Sequential Patterns by Hye-Chung (Monica) Kum A dissertation

  7. A justification for the thin film approximation of Stokes flow with surface tension

    E-Print Network [OSTI]

    Eindhoven, Technische Universiteit

    A justification for the thin film approximation of Stokes flow with surface tension M. G¨unther 1.prokert@tue.nl Abstract In the free boundary problem of Stokes flow driven by surface tension, we pass to the limit by surface tension is considered, the type of the problem changes significantly: while in the general case

  8. How hard can it be to pitch a wind turbine blade? Moment of inertia approximately

    E-Print Network [OSTI]

    How hard can it be to pitch a wind turbine blade? Moment of inertia approximately as a small car (1 ton) on 7 m arm Morten Hartvig Hansen Wind Energy Department Risø, DTU #12;How hard can it be to pitch a wind turbine blade? Hydraulic pitch actuator for the virtual NREL 5 MW turbine · Motivation · Actuator

  9. System-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation

    E-Print Network [OSTI]

    Xu, Cheng-Zhong

    - time solutions by exploiting its inherent properties. 1. INTRODUCTION Power management is importantSystem-Wide Energy Minimization for Real-Time Tasks: Lower Bound and Approximation Xiliang Zhong and Cheng-Zhong Xu Department of Electrical and Computer Engineering Wayne State University, Detroit

  10. Inverse bremsstrahlung heating rate in xenon clusters in the eikonal approximation

    SciTech Connect (OSTI)

    Dey, R. [Max-Planck-Institut fuer Plasmaphysik, EURATOM Association, Boltzmannstr. 2, 85748 Garching (Germany); Roy, A. C. [School of Mathematical Sciences, Ramakrishna Mission Vivekananda University, Belur Math, 711202 West Bengal (India)

    2013-03-15T23:59:59.000Z

    We report inverse bremsstrahlung (IB) heating rates in the eikonal approximation (EA). The present analysis is performed using the plasma-screened Rogers and Debye potentials for Xe clusters with two different charge states (6 and 10). We compare the eikonal results with the first Born approximation (FBA) and classical-simulation (CL-sim) (Moll et al., Phys. Plasmas 19, 033303 (2012)) calculations for clusters in infrared light. Calculations have been performed for the field strength of 2.6 Multiplication-Sign 10{sup 8} V/cm. We find that compared to the FBA and CL-sim methods, the IB heating rate in the EA is less sensitive to the choice of the two potentials considered here. The present EA calculation shows that the influence of the inner structure of atomic ion on the heating rate is more prominent for the smaller ion charge (Xe{sup 6+}). In the case of low laser field approximation based on the elastic transport cross sections, it is seen that in contrast to the FBA and classical methods, the heating rate predicted by the EA does not deviate much all over the range of mean kinetic energy of electrons (20-500 eV) considered here for both the charge states of xenon (Xe{sup 6+} and Xe{sup 10+}). Furthermore, for the Rogers potential, EA is found to be in closer agreement with the classical method than the FBA. We also compare the results of the IB heating rate using the present and low-field approximation approaches to the above three methods and observe that the magnitudes of the IB heating rate calculated in the low field approximation are, in general, higher than the corresponding values predicted by the present approach for both the electron-ion potentials.

  11. Relaxation-time approximation and relativistic third-order viscous hydrodynamics from kinetic theory

    E-Print Network [OSTI]

    Amaresh Jaiswal

    2014-12-08T23:59:59.000Z

    Using the iterative solution of Boltzmann equation in the relaxation-time approximation, the derivation of a third-order evolution equation for shear stress tensor is presented. To this end we first derive the expression for viscous corrections to the phase-space distribution function, $f(x,p)$, up to second-order in derivative expansion. The expression for $\\delta f(x,p)$ obtained in this method does not lead to violation of the experimentally observed $1/\\sqrt{m_T}$ scaling of the femtoscopic radii, as opposed to the widely used Grad's 14-moment approximation. Subsequently, we present the derivation of a third-order viscous evolution equation and demonstrate the significance of this derivation within one-dimensional scaling expansion. We show that results obtained using third-order evolution equations are in excellent accordance with the exact solution of Boltzmann equation as well as with transport results.

  12. An SDE approximation for stochastic differential delay equations with colored state-dependent noise

    E-Print Network [OSTI]

    Austin McDaniel; Ozer Duman; Giovanni Volpe; Jan Wehr

    2014-12-09T23:59:59.000Z

    We consider a general multidimensional stochastic differential delay equation (SDDE) with colored state-dependent noises. We approximate it by a stochastic differential equation (SDE) system and calculate its limit as the time delays and the correlation times of the noises go to zero. The main result is proven using a theorem about convergence of stochastic integrals by Kurtz and Protter. It formalizes and extends a result that has been obtained in the analysis of a noisy electrical circuit with delayed state-dependent noise, and may be used as a working SDE approximation of an SDDE modeling a real system, where noises are correlated in time and whose response to noise sources is delayed.

  13. Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis

    E-Print Network [OSTI]

    Jonathan Welch; Alex Bocharov; Krysta M. Svore

    2014-12-22T23:59:59.000Z

    We present an algorithm for the approximate decomposition of diagonal operators, focusing specifically on decompositions over the Clifford+$T$ basis, that minimize the number of phase-rotation gates in the synthesized approximation circuit. The equivalent $T$-count of the synthesized circuit is bounded by $k \\, C_0 \\log_2(1/\\varepsilon) + E(n,k)$, where $k$ is the number of distinct phases in the diagonal $n$-qubit unitary, $\\varepsilon$ is the desired precision, $C_0$ is a quality factor of the implementation method ($1total entanglement cost (in $T$ gates). We determine an optimal decision boundary in $(k,n,\\varepsilon)$-space where our decomposition algorithm achieves lower entanglement cost than previous state-of-the-art techniques. Our method outperforms state-of-the-art techniques for a practical range of $\\varepsilon$ values and diagonal operators and can reduce the number of $T$ gates exponentially in $n$ when $k << 2^n$.

  14. Computing hitting times via fluid approximation: application to the coupon collector problem

    E-Print Network [OSTI]

    Gast, Nicolas

    2011-01-01T23:59:59.000Z

    In this paper, we show how to use stochastic approximation to compute hitting time of a stochastic process, based on the study of the time for a fluid approximation of this process to be at distance 1/N of its fixed point. This approach is developed to study a generalized version of the coupon collector problem. The system is composed by N independent identical Markov chains. At each time step, one Markov chain is picked at random and performs one transition. We show that the time at which all chains have hit the same state is bounded by a N log N + b N log log N + O(N) where a and b are two constants depending on eigenvalues of the Markov chain.

  15. The fragmentation of expanding shells I: Limitations of the thin--shell approximation

    E-Print Network [OSTI]

    Dale, James E; Whitworth, Anthony; Palous, Jan

    2009-01-01T23:59:59.000Z

    We investigate the gravitational fragmentation of expanding shells in the context of the linear thin--shell analysis. We make use of two very different numerical schemes; the FLASH Adaptive Mesh Refinement code and a version of the Benz Smoothed Particle Hydrodynamics code. We find that the agreement between the two codes is excellent. We use our numerical results to test the thin--shell approximation and we find that the external pressure applied to the shell has a strong effect on the fragmentation process. In cases where shells are not pressure--confined, the shells thicken as they expand and hydrodynamic flows perpendicular to the plane of the shell suppress fragmentation at short wavelengths. If the shells are pressure--confined internally and externally, so that their thickness remains approximately constant during their expansion, the agreement with the analytical solution is better.

  16. A generalized approximation for the thermophoretic force on a free-molecular particle.

    SciTech Connect (OSTI)

    Gallis, Michail A.; Rader, Daniel John; Torczynski, John Robert

    2003-07-01T23:59:59.000Z

    A general, approximate expression is described that can be used to predict the thermophoretic force on a free-molecular, motionless, spherical particle suspended in a quiescent gas with a temperature gradient. The thermophoretic force is equal to the product of an order-unity coefficient, the gas-phase translational heat flux, the particle cross-sectional area, and the inverse of the mean molecular speed. Numerical simulations are used to test the accuracy of this expression for monatomic gases, polyatomic gases, and mixtures thereof. Both continuum and noncontinuum conditions are examined; in particular, the effects of low pressure, wall proximity, and high heat flux are investigated. The direct simulation Monte Carlo (DSMC) method is used to calculate the local molecular velocity distribution, and the force-Green's-function method is used to calculate the thermophoretic force. The approximate expression is found to predict the calculated thermophoretic force to within 10% for all cases examined.

  17. Flux-Limited Diffusion Approximation Models of Giant Planet Formation by Disk Instability

    E-Print Network [OSTI]

    Boss, Alan P

    2008-01-01T23:59:59.000Z

    Both core accretion and disk instability appear to be required as formation mechanisms in order to explain the entire range of giant planets found in extrasolar planetary systems. Disk instability is based on the formation of clumps in a marginally-gravitationally unstable protoplanetary disk. These clumps can only be expected to contract and survive to become protoplanets if they are able to lose thermal energy through a combination of convection and radiative cooling. Here we present several new three dimensional, radiative hydrodynamics models of self-gravitating protoplanetary disks, where radiative transfer is handled in the flux-limited diffusion approximation. We show that while the flux-limited models lead to higher midplane temperatures than in a diffusion approximation model without the flux-limiter, the difference in temperatures does not appear to be sufficiently high to have any significant effect on the formation of self-gravitating clumps. Self-gravitating clumps form rapidly in the models both...

  18. The shallow shelf approximation as a "sliding law" in a thermomechanically coupled ice sheet model

    E-Print Network [OSTI]

    Bueler, Ed

    2008-01-01T23:59:59.000Z

    The shallow shelf approximation is a better ``sliding law'' for ice sheet modeling than those sliding laws in which basal velocity is a function of driving stress. The shallow shelf approximation as formulated by \\emph{Schoof} [2006a] is well-suited to this use. Our new thermomechanically coupled sliding scheme is based on a plasticity assumption about the strength of the saturated till underlying the ice sheet in which the till yield stress is given by a Mohr-Coulomb formula using a modeled pore water pressure. Using this scheme, our prognostic whole ice sheet model has convincing ice streams. Driving stress is balanced in part by membrane stresses, the model is computable at high spatial resolution in parallel, it is stable with respect to parameter changes, and it produces surface velocities seen in actual ice streams.

  19. The Chimera Scheme: Approximate Waveforms for Extreme-Mass-Ratio Inspirals

    E-Print Network [OSTI]

    Sopuerta, Carlos F

    2011-01-01T23:59:59.000Z

    We introduce the Chimera scheme, a new framework to model the dynamics of generic extreme mass-ratio inspirals (stellar compact objects spiraling into a spinning super-massive black hole) and to produce the gravitational waveforms that describe the gravitational wave emission of these systems. The Chimera scheme combines techniques from black hole perturbation theory and post-Minkowskian theory. The orbital evolution is approximated as a sequence of osculating geodesics that shrink due to the stellar compact object's self-acceleration. Lacking a general prescription for this self-force, we here approximate it locally in time via a post-Minkowskian expansion. The orbital evolution is thus equivalent to evolving the geodesic equations with time-dependent orbital elements, as dictated by this post-Minkowskian radiation-reaction prescription. Gravitational radiation is modeled via a multipolar expansion in post-Minkowskian theory, here taken up to mass hexadecapole and current octopole order. To complete the sche...

  20. Validity of the thin mask approximation in extreme ultraviolet mask roughness simulations

    SciTech Connect (OSTI)

    Naulleau, Patrick; George, Simi

    2011-01-26T23:59:59.000Z

    In the case of extreme ultraviolet (EUV) lithography, modeling has shown that reflector phase roughness on the lithographic mask is a significant concern due to the image plan speckle it causes and the resulting line-edge roughness on imaged features. Modeling results have recently been used to determine the requirements for future production worthy masks yielding the extremely stringent specification of 50 pm rms roughness. Owing to the scale of the problem in terms of memory requirements, past modeling results have all been based on the thin mask approximation. EUV masks, however, are inherently three dimensional in nature and thus the question arises as to the validity of the thin mask approximation. Here we directly compare image plane speckle calculation results using the fast two dimensional thin mask model to rigorous finite-difference time-domain results and find the two methods to be comparable.