ACHP | News | Mrs. Laura Bush Presents "Preserve America History Teacher

Science.gov Websites

. Laura Bush Presents "Preserve America History Teacher of the Year" Award to New Jersey Teacher Mrs. Laura Bush Presents "Preserve America History Teacher of the Year" Award to New Jersey Teacher October 14, 2005 Mrs. Laura Bush Presents "Preserve America History Teacher of the Year"

Analysis of Effectiveness of Phoenix Entry Reaction Control System

NASA Technical Reports Server (NTRS)

Dyakonov, Artem A.; Glass, Christopher E.; Desai, Prasun, N.; VanNorman, John W.

2008-01-01

Interaction between the external flowfield and the reaction control system (RCS) thruster plumes of the Phoenix capsule during entry has been investigated. The analysis covered rarefied, transitional, hypersonic and supersonic flight regimes. Performance of pitch, yaw and roll control authority channels was evaluated, with specific emphasis on the yaw channel due to its low nominal yaw control authority. Because Phoenix had already been constructed and its RCS could not be modified before flight, an assessment of RCS efficacy along the trajectory was needed to determine possible issues and to make necessary software changes. Effectiveness of the system at various regimes was evaluated using a hybrid DSMC-CFD technique, based on DSMC Analysis Code (DAC) code and General Aerodynamic Simulation Program (GASP), the LAURA (Langley Aerothermal Upwind Relaxation Algorithm) code, and the FUN3D (Fully Unstructured 3D) code. Results of the analysis at hypersonic and supersonic conditions suggest a significant aero-RCS interference which reduced the efficacy of the thrusters and could likely produce control reversal. Very little aero-RCS interference was predicted in rarefied and transitional regimes. A recommendation was made to the project to widen controller system deadbands to minimize (if not eliminate) the use of RCS thrusters through hypersonic and supersonic flight regimes, where their performance would be uncertain.

Re-Entry Aeroheating Analysis of Tile-Repair Augers for the Shuttle Orbiter

NASA Technical Reports Server (NTRS)

Mazaheri, Ali R.; Wood, William A.

2007-01-01

Computational re-entry aerothermodynamic analysis of the Space Shuttle Orbiter s tile overlay repair (TOR) sub-assembly is presented. Entry aeroheating analyses are conducted to characterize the aerothermodynamic environment of the TOR and to provide necessary inputs for future TOR thermal and structural analyses. The TOR sub-assembly consists of a thin plate and several augers and spacers that serve as the TOR fasteners. For the computational analysis, the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) is used. A 5-species non-equilibrium chemistry model with a finite rate catalytic recombination model and a radiation equilibrium wall condition are used. It is assumed that wall properties are the same as reaction cured glass (RCG) properties with a surface emissivity of epsilon = 0.89. Surface heat transfer rates for the TOR and tile repair augers (TRA) are computed at a STS-107 trajectory point corresponding to Mach 18 free stream conditions. Computational results show that the average heating bump factor (BF), which is a ratio of local heat transfer rate to a design reference point located at the damage site, for the auger head alone is about 1.9. It is also shown that the average BF for the combined auger and washer heads is about 2.0.

Performance of the OVERFLOW-MLP and LAURA-MLP CFD Codes on the NASA Ames 512 CPU Origin System

NASA Technical Reports Server (NTRS)

Taft, James R.

2000-01-01

The shared memory Multi-Level Parallelism (MLP) technique, developed last year at NASA Ames has been very successful in dramatically improving the performance of important NASA CFD codes. This new and very simple parallel programming technique was first inserted into the OVERFLOW production CFD code in FY 1998. The OVERFLOW-MLP code's parallel performance scaled linearly to 256 CPUs on the NASA Ames 256 CPU Origin 2000 system (steger). Overall performance exceeded 20.1 GFLOP/s, or about 4.5x the performance of a dedicated 16 CPU C90 system. All of this was achieved without any major modification to the original vector based code. The OVERFLOW-MLP code is now in production on the inhouse Origin systems as well as being used offsite at commercial aerospace companies. Partially as a result of this work, NASA Ames has purchased a new 512 CPU Origin 2000 system to further test the limits of parallel performance for NASA codes of interest. This paper presents the performance obtained from the latest optimization efforts on this machine for the LAURA-MLP and OVERFLOW-MLP codes. The Langley Aerothermodynamics Upwind Relaxation Algorithm (LAURA) code is a key simulation tool in the development of the next generation shuttle, interplanetary reentry vehicles, and nearly all "X" plane development. This code sustains about 4-5 GFLOP/s on a dedicated 16 CPU C90. At this rate, expected workloads would require over 100 C90 CPU years of computing over the next few calendar years. It is not feasible to expect that this would be affordable or available to the user community. Dramatic performance gains on cheaper systems are needed. This code is expected to be perhaps the largest consumer of NASA Ames compute cycles per run in the coming year.The OVERFLOW CFD code is extensively used in the government and commercial aerospace communities to evaluate new aircraft designs. It is one of the largest consumers of NASA supercomputing cycles and large simulations of highly resolved full aircraft are routinely undertaken. Typical large problems might require 100s of Cray C90 CPU hours to complete. The dramatic performance gains with the 256 CPU steger system are exciting. Obtaining results in hours instead of months is revolutionizing the way in which aircraft manufacturers are looking at future aircraft simulation work. Figure 2 below is a current state of the art plot of OVERFLOW-MLP performance on the 512 CPU Lomax system. As can be seen, the chart indicates that OVERFLOW-MLP continues to scale linearly with CPU count up to 512 CPUs on a large 35 million point full aircraft RANS simulation. At this point performance is such that a fully converged simulation of 2500 time steps is completed in less than 2 hours of elapsed time. Further work over the next few weeks will improve the performance of this code even further.The LAURA code has been converted to the MLP format as well. This code is currently being optimized for the 512 CPU system. Performance statistics indicate that the goal of 100 GFLOP/s will be achieved by year's end. This amounts to 20x the 16 CPU C90 result and strongly demonstrates the viability of the new parallel systems rapidly solving very large simulations in a production environment.

Efficient and optimized identification of generalized Maxwell viscoelastic relaxation spectra

PubMed Central

Babaei, Behzad; Davarian, Ali; Pryse, Kenneth M.; Elson, Elliot L.; Genin, Guy M.

2017-01-01

Viscoelastic relaxation spectra are essential for predicting and interpreting the mechanical responses of materials and structures. For biological tissues, these spectra must usually be estimated from viscoelastic relaxation tests. Interpreting viscoelastic relaxation tests is challenging because the inverse problem is expensive computationally. We present here an efficient algorithm that enables rapid identification of viscoelastic relaxation spectra. The algorithm was tested against trial data to characterize its robustness and identify its limitations and strengths. The algorithm was then applied to identify the viscoelastic response of reconstituted collagen, revealing an extensive distribution of viscoelastic time constants. PMID:26523785

LAURA Users Manual: 5.3-48528

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Gnoffo, Peter A.; Johnston, Chirstopher O.; Kleb, Bil

2010-01-01

This users manual provides in-depth information concerning installation and execution of LAURA, version 5. LAURA is a structured, multi-block, computational aerothermodynamic simulation code. Version 5 represents a major refactoring of the original Fortran 77 LAURA code toward a modular structure afforded by Fortran 95. The refactoring improved usability and maintainability by eliminating the requirement for problem-dependent re-compilations, providing more intuitive distribution of functionality, and simplifying interfaces required for multi-physics coupling. As a result, LAURA now shares gas-physics modules, MPI modules, and other low-level modules with the FUN3D unstructured-grid code. In addition to internal refactoring, several new features and capabilities have been added, e.g., a GNU-standard installation process, parallel load balancing, automatic trajectory point sequencing, free-energy minimization, and coupled ablation and flowfield radiation.

LAURA Users Manual: 5.5-64987

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Gnoffo, Peter A.; Johnston, Christopher O.; Kleb, William L.

2013-01-01

This users manual provides in-depth information concerning installation and execution of LAURA, version 5. LAURA is a structured, multi-block, computational aerothermodynamic simulation code. Version 5 represents a major refactoring of the original Fortran 77 LAURA code toward a modular structure afforded by Fortran 95. The refactoring improved usability and maintain ability by eliminating the requirement for problem dependent recompilations, providing more intuitive distribution of functionality, and simplifying interfaces required for multi-physics coupling. As a result, LAURA now shares gas-physics modules, MPI modules, and other low-level modules with the Fun3D unstructured-grid code. In addition to internal refactoring, several new features and capabilities have been added, e.g., a GNU standard installation process, parallel load balancing, automatic trajectory point sequencing, free-energy minimization, and coupled ablation and flowfield radiation.

LAURA Users Manual: 5.4-54166

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Gnoffo, Peter A.; Johnston, Christopher O.; Kleb, Bil

2011-01-01

This users manual provides in-depth information concerning installation and execution of Laura, version 5. Laura is a structured, multi-block, computational aerothermodynamic simulation code. Version 5 represents a major refactoring of the original Fortran 77 Laura code toward a modular structure afforded by Fortran 95. The refactoring improved usability and maintainability by eliminating the requirement for problem dependent re-compilations, providing more intuitive distribution of functionality, and simplifying interfaces required for multi-physics coupling. As a result, Laura now shares gas-physics modules, MPI modules, and other low-level modules with the Fun3D unstructured-grid code. In addition to internal refactoring, several new features and capabilities have been added, e.g., a GNU-standard installation process, parallel load balancing, automatic trajectory point sequencing, free-energy minimization, and coupled ablation and flowfield radiation.

LAURA Users Manual: 5.2-43231

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Gnoffo, Peter A.; Johnston, Christopher O.; Kleb, Bil

2009-01-01

This users manual provides in-depth information concerning installation and execution of LAURA, version 5. LAURA is a structured, multi-block, computational aerothermodynamic simulation code. Version 5 represents a major refactoring of the original Fortran 77 LAURA code toward a modular structure afforded by Fortran 95. The refactoring improved usability and maintainability by eliminating the requirement for problem-dependent re-compilations, providing more intuitive distribution of functionality, and simplifying interfaces required for multiphysics coupling. As a result, LAURA now shares gas-physics modules, MPI modules, and other low-level modules with the FUN3D unstructured-grid code. In addition to internal refactoring, several new features and capabilities have been added, e.g., a GNU-standard installation process, parallel load balancing, automatic trajectory point sequencing, free-energy minimization, and coupled ablation and flowfield radiation.

Laura Users Manual: 5.1-41601

NASA Technical Reports Server (NTRS)

Mazaheri, Alireza; Gnoffo, Peter A.; Johnston, Christopher O.; Kleb, Bil

2009-01-01

This users manual provides in-depth information concerning installation and execution of LAURA, version 5. LAURA is a structured, multi-block, computational aerothermodynamic simulation code. Version 5 represents a major refactoring of the original Fortran 77 LAURA code toward a modular structure afforded by Fortran 95. The refactoring improved usability and maintainability by eliminating the requirement for problem-dependent re-compilations, providing more intuitive distribution of functionality, and simplifying interfaces required for multiphysics coupling. As a result, LAURA now shares gas-physics modules, MPI modules, and other low-level modules with the FUN3D unstructured-grid code. In addition to internal refactoring, several new features and capabilities have been added, e.g., a GNU-standard installation process, parallel load balancing, automatic trajectory point sequencing, free-energy minimization, and coupled ablation and flowfield radiation.

Efficient and optimized identification of generalized Maxwell viscoelastic relaxation spectra.

PubMed

Babaei, Behzad; Davarian, Ali; Pryse, Kenneth M; Elson, Elliot L; Genin, Guy M

2015-03-01

Viscoelastic relaxation spectra are essential for predicting and interpreting the mechanical responses of materials and structures. For biological tissues, these spectra must usually be estimated from viscoelastic relaxation tests. Interpreting viscoelastic relaxation tests is challenging because the inverse problem is expensive computationally. We present here an efficient algorithm that enables rapid identification of viscoelastic relaxation spectra. The algorithm was tested against trial data to characterize its robustness and identify its limitations and strengths. The algorithm was then applied to identify the viscoelastic response of reconstituted collagen, revealing an extensive distribution of viscoelastic time constants. Copyright © 2015 Elsevier Ltd. All rights reserved.

78 FR 17653 - Wright, Laura H.; Notice of Filing

Federal Register 2010, 2011, 2012, 2013, 2014

2013-03-22

... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission [Docket No. ID-7103-000] Wright, Laura H.; Notice of Filing Take notice that on March 14, 2013, Laura H. Wright filed an application to hold interlocking positions, pursuant to section 305(b) of the Federal Power Act, 16 U.S.C. 825d(b) (2008) and Part...

Developing a Learning Algorithm-Generated Empirical Relaxer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitchell, Wayne; Kallman, Josh; Toreja, Allen

2016-03-30

One of the main difficulties when running Arbitrary Lagrangian-Eulerian (ALE) simulations is determining how much to relax the mesh during the Eulerian step. This determination is currently made by the user on a simulation-by-simulation basis. We present a Learning Algorithm-Generated Empirical Relaxer (LAGER) which uses a regressive random forest algorithm to automate this decision process. We also demonstrate that LAGER successfully relaxes a variety of test problems, maintains simulation accuracy, and has the potential to significantly decrease both the person-hours and computational hours needed to run a successful ALE simulation.

Laura Pittman: The Nation's First Credentialed Direct Support Professional

ERIC Educational Resources Information Center

King, Tom

2007-01-01

This article profiles Laura Pittman, the nation's first credentialed Direct Support Professional (DSP). Laura is a DSP at the Orange Grove Center (OGC) in Chattanooga, Tennessee and has been working there for almost ten years. She has been a DSP for seven of those years, and in that role, supported four women at one of the Orange Grove Center…

Infant welfare, philanthropy and entrepreneurship in Glasgow: Sister Laura's Infant Food Company.

PubMed

Weaver, L T

2008-06-01

Laura Smith was sister-in-charge of the Children's Dispensary in Glasgow from 1897 to 1922. In 1911 she established Sister Laura's Infant Food Company to market a special milk formula of her own invention.The directors of the Dispensary were not amused. As the 'outdoor' department of the Royal Hospital for Sick Children (Yorkhill), the Dispensary was at the forefront of efforts to combat child ill health and malnutrition. This paper considers Laura Smith's initiative within the context of the health and care of infants of the time - high infant mortality, public and professional concerns for infant welfare, technological advances in food science, changing recommendations and practices of infant feeding and ambiguous relations between medicine and commerce.

The erudite humility of the historian: the 'critical epistemology' of Georges Lantéri-Laura.

PubMed

Basso Lorini, Elisabetta

2017-06-01

This paper analyses the historical and epistemological work of the French psychiatrist Georges Lantéri-Laura (1930-2004) within the context of the French 'tradition' of history and philosophy of sciences, with special reference to Georges Canguilhem and Michel Foucault. After an introduction devoted to a critical survey of the most recent works on the history and historiography of psychiatry in French, the paper outlines Lantéri-Laura's approach by focusing especially on the role played by the methodological concept of 'semiology' as regards the relation between medicine and psychiatry. The last part of the paper draws attention to the relation between the history and philosophy of psychiatry in light of Lantéri-Laura's 'critical epistemology'.

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

PubMed

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

Implicit flux-split schemes for the Euler equations

NASA Technical Reports Server (NTRS)

Thomas, J. L.; Walters, R. W.; Van Leer, B.

1985-01-01

Recent progress in the development of implicit algorithms for the Euler equations using the flux-vector splitting method is described. Comparisons of the relative efficiency of relaxation and spatially-split approximately factored methods on a vector processor for two-dimensional flows are made. For transonic flows, the higher convergence rate per iteration of the Gauss-Seidel relaxation algorithms, which are only partially vectorizable, is amply compensated for by the faster computational rate per iteration of the approximately factored algorithm. For supersonic flows, the fully-upwind line-relaxation method is more efficient since the numerical domain of dependence is more closely matched to the physical domain of dependence. A hybrid three-dimensional algorithm using relaxation in one coordinate direction and approximate factorization in the cross-flow plane is developed and applied to a forebody shape at supersonic speeds and a swept, tapered wing at transonic speeds.

Computational Fluid Dynamics Technology for Hypersonic Applications

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2003-01-01

Several current challenges in computational fluid dynamics and aerothermodynamics for hypersonic vehicle applications are discussed. Example simulations are presented from code validation and code benchmarking efforts to illustrate capabilities and limitations. Opportunities to advance the state-of-art in algorithms, grid generation and adaptation, and code validation are identified. Highlights of diverse efforts to address these challenges are then discussed. One such effort to re-engineer and synthesize the existing analysis capability in LAURA, VULCAN, and FUN3D will provide context for these discussions. The critical (and evolving) role of agile software engineering practice in the capability enhancement process is also noted.

Meet EPA Biologist Laura Jackson, Ph.D.

EPA Pesticide Factsheets

Research Biologist Laura Jackson, Ph.D., has worked for the EPA for 22 years, leading research initiatives in a diversity of disciplines, including environmental monitoring, land use planning, and the impacts that urbanization has on an area's ecology

Annual Report 2005

DTIC Science & Technology

2005-01-01

Program Integration PROJECT LEADERS: Bernard Rostker and Laura Miller 20 RAND National Security Research Division The more intensive use of the...Lim, Laura Werber Castaneda, Daniela Golinelli. MG-196-OSD. NOTE: MG stands for monograph; CF for confer- ence proceedings; CT for congressional

Solving LP Relaxations of Large-Scale Precedence Constrained Problems

NASA Astrophysics Data System (ADS)

Bienstock, Daniel; Zuckerberg, Mark

We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that can be employed on a wide range of problems; on data sets arising in the mining industry our algorithms prove effective on problems with many millions of variables and constraints, obtaining provably optimal solutions in a few minutes of computation.

Curved-line search algorithm for ab initio atomic structure relaxation

NASA Astrophysics Data System (ADS)

Chen, Zhanghui; Li, Jingbo; Li, Shushen; Wang, Lin-Wang

2017-09-01

Ab initio atomic relaxations often take large numbers of steps and long times to converge, especially when the initial atomic configurations are far from the local minimum or there are curved and narrow valleys in the multidimensional potentials. An atomic relaxation method based on on-the-flight force learning and a corresponding curved-line search algorithm is presented to accelerate this process. Results demonstrate the superior performance of this method for metal and magnetic clusters when compared with the conventional conjugate-gradient method.

Research Capabilities

Science.gov Websites

Search Site submit About Us Los Alamos National LaboratoryRichard P. Feynman Center for Innovation Innovation protecting tomorrow Los Alamos National Laboratory The Richard P. Feynman Center for Innovation . thumbnail of Energy and Subsurface Laura Barber, Business Development Laura Barber Energy: Los Alamos is

Wideband RELAX and wideband CLEAN for aeroacoustic imaging

NASA Astrophysics Data System (ADS)

Wang, Yanwei; Li, Jian; Stoica, Petre; Sheplak, Mark; Nishida, Toshikazu

2004-02-01

Microphone arrays can be used for acoustic source localization and characterization in wind tunnel testing. In this paper, the wideband RELAX (WB-RELAX) and the wideband CLEAN (WB-CLEAN) algorithms are presented for aeroacoustic imaging using an acoustic array. WB-RELAX is a parametric approach that can be used efficiently for point source imaging without the sidelobe problems suffered by the delay-and-sum beamforming approaches. WB-CLEAN does not have sidelobe problems either, but it behaves more like a nonparametric approach and can be used for both point source and distributed source imaging. Moreover, neither of the algorithms suffers from the severe performance degradations encountered by the adaptive beamforming methods when the number of snapshots is small and/or the sources are highly correlated or coherent with each other. A two-step optimization procedure is used to implement the WB-RELAX and WB-CLEAN algorithms efficiently. The performance of WB-RELAX and WB-CLEAN is demonstrated by applying them to measured data obtained at the NASA Langley Quiet Flow Facility using a small aperture directional array (SADA). Somewhat surprisingly, using these approaches, not only were the parameters of the dominant source accurately determined, but a highly correlated multipath of the dominant source was also discovered.

Wideband RELAX and wideband CLEAN for aeroacoustic imaging.

PubMed

Wang, Yanwei; Li, Jian; Stoica, Petre; Sheplak, Mark; Nishida, Toshikazu

2004-02-01

Microphone arrays can be used for acoustic source localization and characterization in wind tunnel testing. In this paper, the wideband RELAX (WB-RELAX) and the wideband CLEAN (WB-CLEAN) algorithms are presented for aeroacoustic imaging using an acoustic array. WB-RELAX is a parametric approach that can be used efficiently for point source imaging without the sidelobe problems suffered by the delay-and-sum beamforming approaches. WB-CLEAN does not have sidelobe problems either, but it behaves more like a nonparametric approach and can be used for both point source and distributed source imaging. Moreover, neither of the algorithms suffers from the severe performance degradations encountered by the adaptive beamforming methods when the number of snapshots is small and/or the sources are highly correlated or coherent with each other. A two-step optimization procedure is used to implement the WB-RELAX and WB-CLEAN algorithms efficiently. The performance of WB-RELAX and WB-CLEAN is demonstrated by applying them to measured data obtained at the NASA Langley Quiet Flow Facility using a small aperture directional array (SADA). Somewhat surprisingly, using these approaches, not only were the parameters of the dominant source accurately determined, but a highly correlated multipath of the dominant source was also discovered.

Laura Carnell: The Woman behind the Founder's Myth at Temple University

ERIC Educational Resources Information Center

Bakley, Annette McMenamin

2014-01-01

Using archival materials from the early years of Temple University's history at the Special Collections Research Center, Templana Collection, at Samuel Paley Library of Temple University as well as historical periodicals, this project established a biographical sketch of Associate President Laura Carnell and examined her influence on the…

Through the Eyes of Laura Ingalls Wilder

ERIC Educational Resources Information Center

Dowd, Diane

2006-01-01

Laura Ingalls Wilder's purpose in writing the "Little House" books for children illustrate the day-to-day experiences of a girl, and her stories provide glimpses into a young mind's conceptualization of aspects of living that are mathematical in nature, such as geometric and quantitative conceptions, logical reasoning and communication, and…

Planning for Success: Developing an Economic Planning Cell for the Operational Level Commander

DTIC Science & Technology

2011-05-04

Laura Landes, “ Follow the Money : The Army Finance Corps and Iraqi Financial Independence,” Military Review (March – April 2008): 85 ii Joint...accessed 23 March, 2011). Landes, Laura. “ Follow the Money : The Army Finance Corps and Iraqi Financial Independence,” Military Review (March

Missing Funds

ERIC Educational Resources Information Center

Hassenpflug, Ann

2012-01-01

A high school drama coach informs assistant principal Laura Madison that the money students earned through fund-raising activities seems to have vanished and that the male assistant principal may be involved in the disappearance of the funds. Laura has to determine how to address this situation. She considers her past experiences with problematic…

Comparison of Nonequilibrium Solution Algorithms Applied to Chemically Stiff Hypersonic Flows

NASA Technical Reports Server (NTRS)

Palmer, Grant; Venkatapathy, Ethiraj

1995-01-01

Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15 and 30, the lower-upper symmetric Gauss-Seidel method produces an eight order of magnitude drop in the energy residual in one-third to one-half the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 30 and above. At Mach 40 the performance of the lower-upper symmetric Gauss-Seidel algorithm deteriorates to the point that it is out performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

Angular-contact ball-bearing internal load estimation algorithm using runtime adaptive relaxation

NASA Astrophysics Data System (ADS)

Medina, H.; Mutu, R.

2017-07-01

An algorithm to estimate internal loads for single-row angular contact ball bearings due to externally applied thrust loads and high-operating speeds is presented. A new runtime adaptive relaxation procedure and blending function is proposed which ensures algorithm stability whilst also reducing the number of iterations needed to reach convergence, leading to an average reduction in computation time in excess of approximately 80%. The model is validated based on a 218 angular contact bearing and shows excellent agreement compared to published results.

Evolving fuzzy rules for relaxed-criteria negotiation.

PubMed

Sim, Kwang Mong

2008-12-01

In the literature on automated negotiation, very few negotiation agents are designed with the flexibility to slightly relax their negotiation criteria to reach a consensus more rapidly and with more certainty. Furthermore, these relaxed-criteria negotiation agents were not equipped with the ability to enhance their performance by learning and evolving their relaxed-criteria negotiation rules. The impetus of this work is designing market-driven negotiation agents (MDAs) that not only have the flexibility of relaxing bargaining criteria using fuzzy rules, but can also evolve their structures by learning new relaxed-criteria fuzzy rules to improve their negotiation outcomes as they participate in negotiations in more e-markets. To this end, an evolutionary algorithm for adapting and evolving relaxed-criteria fuzzy rules was developed. Implementing the idea in a testbed, two kinds of experiments for evaluating and comparing EvEMDAs (MDAs with relaxed-criteria rules that are evolved using the evolutionary algorithm) and EMDAs (MDAs with relaxed-criteria rules that are manually constructed) were carried out through stochastic simulations. Empirical results show that: 1) EvEMDAs generally outperformed EMDAs in different types of e-markets and 2) the negotiation outcomes of EvEMDAs generally improved as they negotiated in more e-markets.

Creating Value from Innovation: Laura Gordon-Murnane--Bureau of National Affairs

ERIC Educational Resources Information Center

Library Journal, 2005

2005-01-01

Some corporate executives regard their libraries as black holes that just consume company resources, but thanks to Laura Gordon-Murnane, executives at the Bureau of National Affairs (BNA) know their library actively adds value to the company. As web master for BNA's intranet, Gordon-Murnane creates information tools, databases, and products for…

Gender Transformations and Colonial Displacements in Laura Antillano's "Tuna de mar"

ERIC Educational Resources Information Center

Reid, Alana

2015-01-01

This paper examines the trajectories of two characters in Laura Antillano's short story, "Tuna de mar" (1991), as they navigate interrelated systems of power and attempt to position themselves closer to, or further away from, the margins. Set in the late eighteenth century, the tale features a female protagonist who escapes prostitution…

76 FR 10083 - 60-Day Notice of Proposed Information Collection: DS-7652, U.S. National Commission for UNESCO...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-23

... Collection: DS-7652, U.S. National Commission for UNESCO Laura W. Bush Traveling Fellowship ACTION: Notice of....S. National Commission for UNESCO Laura W. Bush Traveling Fellowship. OMB Control Number: 1405-0180... UNESCO (IO/UNESCO). Form Number: DS-7646. Respondents: U.S. college and university students applying for...

Teaching Laura Kipnis's "Love's Labors" in "Ways of Reading"

ERIC Educational Resources Information Center

Fike, Matthew A.

2013-01-01

This essay describes a method of teaching a very challenging anthology piece: Laura Kipnis's "Love's Labors" (chapter 1 of her 2003 "Against Love: A Polemic"). The method, although designed for a critical thinking course, should also provide resources for those who teach Kipnis's work in writing courses. Using…

Flux-split algorithms for flows with non-equilibrium chemistry and vibrational relaxation

NASA Technical Reports Server (NTRS)

Grossman, B.; Cinnella, P.

1990-01-01

The present consideration of numerical computation methods for gas flows with nonequilibrium chemistry thermodynamics gives attention to an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Flux-splitting procedures are developed for the fully-coupled inviscid equations encompassing fluid dynamics and both chemical and internal energy-relaxation processes. A fully coupled and implicit large-block structure is presented which embodies novel forms of flux-vector split and flux-difference split algorithms valid for nonequilibrium flow; illustrative high-temperature shock tube and nozzle flow examples are given.

Clique Relaxations in Biological and Social Network Analysis Foundations and Algorithms

DTIC Science & Technology

2015-10-26

study of clique relaxation models arising in biological and social networks. This project examines the elementary clique-defining properties... elementary clique-defining properties inherently exploited in the available clique relaxation models and pro- poses a taxonomic framework that not...analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that

Optimal convolution SOR acceleration of waveform relaxation with application to semiconductor device simulation

NASA Technical Reports Server (NTRS)

Reichelt, Mark

1993-01-01

In this paper we describe a novel generalized SOR (successive overrelaxation) algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is substantially faster than that of the more obvious frequency-independent waveform SOR algorithm. Finally, to demonstrate the general applicability of this new method, it is used to solve the differential-algebraic system generated by spatial discretization of the time-dependent semiconductor device equations.

ACHP | News | Mrs. Laura Bush Announces Preserve America Community

Science.gov Websites

Sept. 15, 2003, Mobile, Alabama—Mrs. Laura Bush today announced details of two new key components of continue to build upon. Mobile is a great example of a community that is using its past to build a better recognition program included ACHP member Emily Summers; Mobile, AL, mayor Mike Dow; Secretary of the Interior

Preparing Children To Read and Learn: An Education Initiative of Laura Bush.

ERIC Educational Resources Information Center

Department of Education, Washington, DC.

Noting that teaching reading is one of the Bush Administration's top domestic priorities, this pamphlet introduces the Ready to Read, Ready to Learn education initiative of First Lady Laura Bush. The goals of the initiative are to ensure that all young children are ready to read and learn when they enter their first classroom, and to ensure that…

The Actions of One Inspire the Power of Many: Laura Briley, Day Schools, Tulsa, Oklahoma

ERIC Educational Resources Information Center

Gonzalez-Mena, Janet

2010-01-01

Laura Briley is a person who makes things happen! Not only is she instrumental in creating a new World Forum Working Group for the Rights of Children in Children's Homes, but in April she organized the first ever Pikler Intensive Training in the United States by bringing two internationally famous infant development experts to Tulsa, Oklahoma. In…

Heat-bath algorithmic cooling with correlated qubit-environment interactions

NASA Astrophysics Data System (ADS)

Rodríguez-Briones, Nayeli A.; Li, Jun; Peng, Xinhua; Mor, Tal; Weinstein, Yossi; Laflamme, Raymond

2017-11-01

Cooling techniques are essential to understand fundamental thermodynamic questions of the low-energy states of physical systems, furthermore they are at the core of practical applications of quantum information science. In quantum computing, this controlled preparation of highly pure quantum states is required from the state initialization of most quantum algorithms to a reliable supply of ancilla qubits that satisfy the fault-tolerance threshold for quantum error correction. Heat-bath algorithmic cooling has been shown to purify qubits by controlled redistribution of entropy and multiple contact with a bath, not only for ensemble implementations but also for technologies with strong but imperfect measurements. In this paper, we show that correlated relaxation processes between the system and environment during rethermalization when we reset hot ancilla qubits, can be exploited to enhance purification. We show that a long standing upper bound on the limits of algorithmic cooling Schulman et al (2005 Phys. Rev. Lett. 94, 120501) can be broken by exploiting these correlations. We introduce a new tool for cooling algorithms, which we call ‘state-reset’, obtained when the coupling to the environment is generalized from individual-qubits relaxation to correlated-qubit relaxation. Furthermore, we present explicit improved cooling algorithms which lead to an increase of purity beyond all the previous work, and relate our results to the Nuclear Overhauser Effect.

The Calm AFTER the Storm: An Interview with Laura Bush about the Caring Power of the Gulf Coast School Library Recovery Initiative

ERIC Educational Resources Information Center

Walker, Julie

2012-01-01

In 2005, a record breaking 26 named tropical storms including 13 hurricanes ravaged the Gulf Coast of the United States. In response to the devastation of hundreds of schools, the Laura Bush Foundation swiftly created The Gulf Coast School Library Recovery Initiative to help school libraries become fully functional and to offer the needed print…

ACT-R/E: An Embodied Cognitive Architecture for Human-Robot Interaction

DTIC Science & Technology

2013-01-01

Threaded Cognition: An Integrated Theory of Concurrent Multitasking . Psychological Review, 115(1), 101–130, http://dx.doi.org/10.1037/0033-295X...Trafton, Naval Research Laboratory, Washington, DC, USA Email : greg.trafton@nrl.navy.mil Laura Hiatt, Naval Research Laboratory, Washington, DC, USA Email ...laura.hiatt@nrl.navy.mil Anthony Harrison, Naval Research Laboratory, Washington, DC, USA Email : anthony.harrison@nrl.navy.mil Frank Tamborello, Naval

Review Article: Yamada, Jeni "Laura: A Case for the Modularity of Language"; Tomasello, Michael "First Verbs: A Case Study of Early Grammatical Development."

ERIC Educational Resources Information Center

Shatz, Marilyn

1994-01-01

Jeni Yamada's "Laura" and Michael Tomasello's "First Verbs" continue a tradition of providing useful information on the language ability of individuals in a depth rarely found in multisubject studies; however, these efforts are unusual for case studies in that both take strong theoretical positions on the essence of language and language learning.…

Judith Husband: 'it's surprising what we can actually live without, other than air, water and food'. Interview by Laura Pacey.

PubMed

Husband, Judith

2013-05-01

Judith Husband speaks to the BDJ about current challenges facing dentistry, the new BDA PEC and her love of social media site Twitter. The only catch is she has accepted the challenge issued by interviewer and fellow Twitter enthusiast Laura Pacey of answering every question, in 140 characters or less. Follow on Twitter @Judith_Husband and @The_BDJ.

Looking outside the (voice)box.

PubMed

Gartrell, Nanette; Rothblum, Esther

2014-01-01

Laura S. Brown, PhD, is a clinical and forensic psychologist in independent practice in Seattle, Washington. The bulk of her scholarly work has been in the fields of feminist therapy theory, trauma treatment, lesbian and gay issues, assessment and diagnosis, ethics and standards of care in psychotherapy, and cultural competence. She has authored or edited ten professional books, including the award-winning Subversive Dialogues: Theory in Feminist Therapy, as well as more than 140 other professional publications. She has also recently published her first book for general audiences, Your turn for care: Surviving the aging and death of the adults who harmed you. Laura has been featured in five psychotherapy training videos produced by the American Psychological Association. She was President of American Psychological Association Divisions 35 (Society for the Psychology of Women), 44 (Society for the Psychological Study of Lesbian, Gay and Bisexual Issues), and 56 (Trauma Psychology). Laura was also President of the Washington State Psychological Association. She is the founder and Director of the Fremont Community Therapy Project, a low-fee psychotherapy training clinic in Seattle. In the fall of 2000, she was the on-site psychologist for the reality show Survivor: The Australian Outback. In 1987, Laura lost her voice and was diagnosed with spasmodic dysphonia. In 1988, she found her voice again.

Improving the Held and Karp Approach with Constraint Programming

NASA Astrophysics Data System (ADS)

Benchimol, Pascal; Régin, Jean-Charles; Rousseau, Louis-Martin; Rueher, Michel; van Hoeve, Willem-Jan

Held and Karp have proposed, in the early 1970s, a relaxation for the Traveling Salesman Problem (TSP) as well as a branch-and-bound procedure that can solve small to modest-size instances to optimality [4, 5]. It has been shown that the Held-Karp relaxation produces very tight bounds in practice, and this relaxation is therefore applied in TSP solvers such as Concorde [1]. In this short paper we show that the Held-Karp approach can benefit from well-known techniques in Constraint Programming (CP) such as domain filtering and constraint propagation. Namely, we show that filtering algorithms developed for the weighted spanning tree constraint [3, 8] can be adapted to the context of the Held and Karp procedure. In addition to the adaptation of existing algorithms, we introduce a special-purpose filtering algorithm based on the underlying mechanisms used in Prim's algorithm [7]. Finally, we explored two different branching schemes to close the integrality gap. Our initial experimental results indicate that the addition of the CP techniques to the Held-Karp method can be very effective.

A nonlinear relaxation/quasi-Newton algorithm for the compressible Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Edwards, Jack R.; Mcrae, D. S.

1992-01-01

A highly efficient implicit method for the computation of steady, two-dimensional compressible Navier-Stokes flowfields is presented. The discretization of the governing equations is hybrid in nature, with flux-vector splitting utilized in the streamwise direction and central differences with flux-limited artificial dissipation used for the transverse fluxes. Line Jacobi relaxation is used to provide a suitable initial guess for a new nonlinear iteration strategy based on line Gauss-Seidel sweeps. The applicability of quasi-Newton methods as convergence accelerators for this and other line relaxation algorithms is discussed, and efficient implementations of such techniques are presented. Convergence histories and comparisons with experimental data are presented for supersonic flow over a flat plate and for several high-speed compression corner interactions. Results indicate a marked improvement in computational efficiency over more conventional upwind relaxation strategies, particularly for flowfields containing large pockets of streamwise subsonic flow.

The efficient simulation of separated three-dimensional viscous flows using the boundary-layer equations

NASA Technical Reports Server (NTRS)

Van Dalsem, W. R.; Steger, J. L.

1985-01-01

A simple and computationally efficient algorithm for solving the unsteady three-dimensional boundary-layer equations in the time-accurate or relaxation mode is presented. Results of the new algorithm are shown to be in quantitative agreement with detailed experimental data for flow over a swept infinite wing. The separated flow over a 6:1 ellipsoid at angle of attack, and the transonic flow over a finite-wing with shock-induced 'mushroom' separation are also computed and compared with available experimental data. It is concluded that complex, separated, three-dimensional viscous layers can be economically and routinely computed using a time-relaxation boundary-layer algorithm.

Powered Descent Guidance with General Thrust-Pointing Constraints

NASA Technical Reports Server (NTRS)

Carson, John M., III; Acikmese, Behcet; Blackmore, Lars

2013-01-01

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Achievable Imperative - Baseline Health of the Reserve Component

DTIC Science & Technology

2001-03-22

Sekikawa, Akira, Ronald E . Laporte , Toshihiko Satoh and Genero Ochi. "Health Workers Need Information From Countries With Better Health Indicators Than...Statistic Quarterly, 48 (1995): 48. 21Thomas E . McKone, Beverly M. Huey, Edward Downing, and Laura M. Duffy, eds., Strategies to Protect the Health of...lmsmr/MSMRTOC.htm>. Internet. Accessed 10 October 2001. McKone, Thomas E ., Beverly M. Huey, Edward Downing, and Laura M. Duffy, eds. Strategies to

The Carolina Autism Transition Study (CATS)

DTIC Science & Technology

2016-07-20

AWARD NUMBER: W81XWH-15-1-0093 TITLE: The Carolina Autism Transition Study (CATS) PRINCIPAL INVESTIGATOR: Laura Carpenter, MD RECIPIENT...Carolina Autism Transition Study (CATS) 5b. GRANT NUMBER W81XWH-15-1-0093 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) . 5d. PROJECT NUMBER Laura...report provides a description of the Year 1 progress made and plans for Year 2 for the project entitled “The Carolina Autism Transition Study (CATS

Looking for Laura Secord on the Web: Using a Famous Figure from the War of 1812 as a Model for Evaluating Historical Web Sites

ERIC Educational Resources Information Center

Tate, Marsha Ann

2005-01-01

Laura Ingersoll Secord was, admittedly, a well-known historical figure--at least in Canada over a century before the development of the World Wide Web. In 1860, she first achieved widespread notoriety in her adopted homeland of Canada (she was born in Massachusetts) when a deed she performed for the British army during the War of 1812 was publicly…

Assessment of the Air Force Materiel Command Reorganization: Report for Congress

DTIC Science & Technology

2013-01-01

Report for Congress Don Snyder, Bernard Fox, Kristin F. Lynch, Raymond E. Conley, John A. Ausink, Laura Werber , William Shelton, Sarah A. Nowak, Michael... Bernard Fox, Kristin F. Lynch, Raymond E. Conley, John A. Ausink, Laura Werber , William Shelton, Sarah A. Nowak, Michael R. Thirtle, Albert A. Robbert...Ausink, Chelsea Kaihoi Duran, Robert G. DeFeo, David W. George, Raymond E. Conley, Bernard Fox, and Jerry M. Sollinger, Air Force Materiel Command

Combined LAURA-UPS hypersonic solution procedure

NASA Technical Reports Server (NTRS)

Wood, William A.; Thompson, Richard A.

1993-01-01

A combined solution procedure for hypersonic flowfields around blunted slender bodies was implemented using a thin-layer Navier-Stokes code (LAURA) in the nose region and a parabolized Navier-Stokes code (UPS) on the after body region. Perfect gas, equilibrium air, and non-equilibrium air solutions to sharp cones and a sharp wedge were obtained using UPS alone as a preliminary step. Surface heating rates are presented for two slender bodies with blunted noses, having used LAURA to provide a starting solution to UPS downstream of the sonic line. These are an 8 deg sphere-cone in Mach 5, perfect gas, laminar flow at 0 and 4 deg angles of attack and the Reentry F body at Mach 20, 80,000 ft equilibrium gas conditions for 0 and 0.14 deg angles of attack. The results indicate that this procedure is a timely and accurate method for obtaining aerothermodynamic predictions on slender hypersonic vehicles.

General relaxation schemes in multigrid algorithms for higher order singularity methods

NASA Technical Reports Server (NTRS)

Oskam, B.; Fray, J. M. J.

1981-01-01

Relaxation schemes based on approximate and incomplete factorization technique (AF) are described. The AF schemes allow construction of a fast multigrid method for solving integral equations of the second and first kind. The smoothing factors for integral equations of the first kind, and comparison with similar results from the second kind of equations are a novel item. Application of the MD algorithm shows convergence to the level of truncation error of a second order accurate panel method.

Partial branch and bound algorithm for improved data association in multiframe processing

NASA Astrophysics Data System (ADS)

Poore, Aubrey B.; Yan, Xin

1999-07-01

A central problem in multitarget, multisensor, and multiplatform tracking remains that of data association. Lagrangian relaxation methods have shown themselves to yield near optimal answers in real-time. The necessary improvement in the quality of these solutions warrants a continuing interest in these methods. These problems are NP-hard; the only known methods for solving them optimally are enumerative in nature with branch-and-bound being most efficient. Thus, the development of methods less than a full branch-and-bound are needed for improving the quality. Such methods as K-best, local search, and randomized search have been proposed to improve the quality of the relaxation solution. Here, a partial branch-and-bound technique along with adequate branching and ordering rules are developed. Lagrangian relaxation is used as a branching method and as a method to calculate the lower bound for subproblems. The result shows that the branch-and-bound framework greatly improves the resolution quality of the Lagrangian relaxation algorithm and yields better multiple solutions in less time than relaxation alone.

The Carolina Autism Transition Study (CATS)

DTIC Science & Technology

2017-07-01

AWARD NUMBER: W81XWH-15-1-0093 TITLE: The Carolina Autism Transition Study (CATS) PRINCIPAL INVESTIGATOR: Laura Carpenter, MD RECIPIENT...Carolina Autism Transition Study (CATS) 5b. GRANT NUMBER W81XWH-15-1-0093 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER Laura Carpenter...provides a description of the Year 2 progress made and plans for Year 3 for the project entitled “The Carolina Autism Transition Study (CATS).” The goal of

Exploring the Combat Potential of Financial Managers as Expeditionary Bankers in the Contemporary Operating Environment

DTIC Science & Technology

2009-05-04

Fiasco (New York: Penguin Press, 2006), 230. 12 Laura Landes, “ Follow the Money : The Army Finance Corps and Iraqi Financial Independence...Axe, David. “ Follow the Money ; U.S. targets elusive cadre that funds insurgents in Iraq.” Defense Technology International, December 1, 2007...www.army.mil/professionalwriting/ volumes/volume6/december_2008/12_08_3 _pf.html (accessed March 23, 2009). Landes, Laura. “ Follow the Money : The

Relaxation of Distributed Data Aggregation for Underwater Acoustic Sensor Networks

DTIC Science & Technology

2014-03-31

2 3.1 Gossip algorithms for distributed averaging . . . . . . . . . . . . . . . . . 3 3.2 Distributed particle filtering...algorithm that had direct access to all of the measurements. We use gossip algorithms (discussed in Section 3.1) to diffuse information across the...2 3.1 Gossip algorithms for distributed averaging We begin by discussing gossip algorithms, which we use to synchronize and spread infor- mation

A comparison of three-dimensional nonequilibrium solution algorithms applied to hypersonic flows with stiff chemical source terms

NASA Technical Reports Server (NTRS)

Palmer, Grant; Venkatapathy, Ethiraj

1993-01-01

Three solution algorithms, explicit underrelaxation, point implicit, and lower upper symmetric Gauss-Seidel (LUSGS), are used to compute nonequilibrium flow around the Apollo 4 return capsule at 62 km altitude. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness. The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15, 23, and 30, the LUSGS method produces an eight order of magnitude drop in the L2 norm of the energy residual in 1/3 to 1/2 the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 23 and above. At Mach 40 the performance of the LUSGS algorithm deteriorates to the point it is out-performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

A Pseudo-Temporal Multi-Grid Relaxation Scheme for Solving the Parabolized Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

White, J. A.; Morrison, J. H.

1999-01-01

A multi-grid, flux-difference-split, finite-volume code, VULCAN, is presented for solving the elliptic and parabolized form of the equations governing three-dimensional, turbulent, calorically perfect and non-equilibrium chemically reacting flows. The space marching algorithms developed to improve convergence rate and or reduce computational cost are emphasized. The algorithms presented are extensions to the class of implicit pseudo-time iterative, upwind space-marching schemes. A full approximate storage, full multi-grid scheme is also described which is used to accelerate the convergence of a Gauss-Seidel relaxation method. The multi-grid algorithm is shown to significantly improve convergence on high aspect ratio grids.

Computations of Viking Lander Capsule Hypersonic Aerodynamics with Comparisons to Ground and Flight Data

NASA Technical Reports Server (NTRS)

Edquist, Karl T.

2006-01-01

Comparisons are made between the LAURA Navier-Stokes code and Viking Lander Capsule hypersonic aerodynamics data from ground and flight measurements. Wind tunnel data are available for a 3.48 percent scale model at Mach 6 and a 2.75 percent scale model at Mach 10.35, both under perfect gas air conditions. Viking Lander 1 aerodynamics flight data also exist from on-board instrumentation for velocities between 2900 and 4400 m/sec (Mach 14 to 23.3). LAURA flowfield solutions are obtained for the geometry as tested or flown, including sting effects at tunnel conditions and finite-rate chemistry effects in flight. Using the flight vehicle center-of-gravity location (trim angle approx. equals -11.1 deg), the computed trim angle at tunnel conditions is within 0.31 degrees of the angle derived from Mach 6 data and 0.13 degrees from the Mach 10.35 trim angle. LAURA Mach 6 trim lift and drag force coefficients are within 2 percent of measured data, and computed trim lift-to-drag ratio is within 4 percent of the data. Computed trim lift and drag force coefficients at Mach 10.35 are within 5 percent and 3 percent, respectively, of wind tunnel data. Computed trim lift-to-drag ratio is within 2 percent of the Mach 10.35 data. Using the nominal density profile and center-of-gravity location, LAURA trim angle at flight conditions is within 0.5 degrees of the total angle measured from on-board instrumentation. LAURA trim lift and drag force coefficients at flight conditions are within 7 and 5 percent, respectively, of the flight data. Computed trim lift-to-drag ratio is within 4 percent of the data. Computed aerodynamics sensitivities to center-of-gravity location, atmospheric density, and grid refinement are generally small. The results will enable a better estimate of aerodynamics uncertainties for future Mars entry vehicles where non-zero angle-of-attack is required.

Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brown, Nathanael J. K.; Arguello, Bryan; Nozick, Linda Karen

This paper focuses on scheduling antennas to track satellites using a heuristic method. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The performance of the algorithm is established using several illustrative problems.

Deconvolution of astronomical images using SOR with adaptive relaxation.

PubMed

Vorontsov, S V; Strakhov, V N; Jefferies, S M; Borelli, K J

2011-07-04

We address the potential performance of the successive overrelaxation technique (SOR) in image deconvolution, focusing our attention on the restoration of astronomical images distorted by atmospheric turbulence. SOR is the classical Gauss-Seidel iteration, supplemented with relaxation. As indicated by earlier work, the convergence properties of SOR, and its ultimate performance in the deconvolution of blurred and noisy images, can be made competitive to other iterative techniques, including conjugate gradients, by a proper choice of the relaxation parameter. The question of how to choose the relaxation parameter, however, remained open, and in the practical work one had to rely on experimentation. In this paper, using constructive (rather than exact) arguments, we suggest a simple strategy for choosing the relaxation parameter and for updating its value in consecutive iterations to optimize the performance of the SOR algorithm (and its positivity-constrained version, +SOR) at finite iteration counts. We suggest an extension of the algorithm to the notoriously difficult problem of "blind" deconvolution, where both the true object and the point-spread function have to be recovered from the blurred image. We report the results of numerical inversions with artificial and real data, where the algorithm is compared with techniques based on conjugate gradients. In all of our experiments +SOR provides the highest quality results. In addition +SOR is found to be able to detect moderately small changes in the true object between separate data frames: an important quality for multi-frame blind deconvolution where stationarity of the object is a necesessity.

Implementation of a Blowing Boundary Condition in the LAURA Code

NASA Technical Reports Server (NTRS)

Thompson, Richard a.; Gnoffo, Peter A.

2008-01-01

Preliminary steps toward modeling a coupled ablation problem using a finite-volume Navier-Stokes code (LAURA) are presented in this paper. Implementation of a surface boundary condition with mass transfer (blowing) is described followed by verification and validation through comparisons with analytic results and experimental data. Application of the code to a carbon-nosetip ablation problem is demonstrated and the results are compared with previously published data. It is concluded that the code and coupled procedure are suitable to support further ablation analyses and studies.

Improved Savitzky-Golay-method-based fluorescence subtraction algorithm for rapid recovery of Raman spectra.

PubMed

Chen, Kun; Zhang, Hongyuan; Wei, Haoyun; Li, Yan

2014-08-20

In this paper, we propose an improved subtraction algorithm for rapid recovery of Raman spectra that can substantially reduce the computation time. This algorithm is based on an improved Savitzky-Golay (SG) iterative smoothing method, which involves two key novel approaches: (a) the use of the Gauss-Seidel method and (b) the introduction of a relaxation factor into the iterative procedure. By applying a novel successive relaxation (SG-SR) iterative method to the relaxation factor, additional improvement in the convergence speed over the standard Savitzky-Golay procedure is realized. The proposed improved algorithm (the RIA-SG-SR algorithm), which uses SG-SR-based iteration instead of Savitzky-Golay iteration, has been optimized and validated with a mathematically simulated Raman spectrum, as well as experimentally measured Raman spectra from non-biological and biological samples. The method results in a significant reduction in computing cost while yielding consistent rejection of fluorescence and noise for spectra with low signal-to-fluorescence ratios and varied baselines. In the simulation, RIA-SG-SR achieved 1 order of magnitude improvement in iteration number and 2 orders of magnitude improvement in computation time compared with the range-independent background-subtraction algorithm (RIA). Furthermore the computation time of the experimentally measured raw Raman spectrum processing from skin tissue decreased from 6.72 to 0.094 s. In general, the processing of the SG-SR method can be conducted within dozens of milliseconds, which can provide a real-time procedure in practical situations.

Effective channel estimation and efficient symbol detection for multi-input multi-output underwater acoustic communications

NASA Astrophysics Data System (ADS)

Ling, Jun

Achieving reliable underwater acoustic communications (UAC) has long been recognized as a challenging problem owing to the scarce bandwidth available and the reverberant spread in both time and frequency domains. To pursue high data rates, we consider a multi-input multi-output (MIMO) UAC system, and our focus is placed on two main issues regarding a MIMO UAC system: (1) channel estimation, which involves the design of the training sequences and the development of a reliable channel estimation algorithm, and (2) symbol detection, which requires interference cancelation schemes due to simultaneous transmission from multiple transducers. To enhance channel estimation performance, we present a cyclic approach for designing training sequences with good auto- and cross-correlation properties, and a channel estimation algorithm called the iterative adaptive approach (IAA). Sparse channel estimates can be obtained by combining IAA with the Bayesian information criterion (BIC). Moreover, we present sparse learning via iterative minimization (SLIM) and demonstrate that SLIM gives similar performance to IAA but at a much lower computational cost. Furthermore, an extension of the SLIM algorithm is introduced to estimate the sparse and frequency modulated acoustic channels. The extended algorithm is referred to as generalization of SLIM (GoSLIM). Regarding symbol detection, a linear minimum mean-squared error based detection scheme, called RELAX-BLAST, which is a combination of vertical Bell Labs layered space-time (V-BLAST) algorithm and the cyclic principle of the RELAX algorithm, is presented and it is shown that RELAX-BLAST outperforms V-BLAST. We show that RELAX-BLAST can be implemented efficiently by making use of the conjugate gradient method and diagonalization properties of circulant matrices. This fast implementation approach requires only simple fast Fourier transform operations and facilitates parallel implementations. The effectiveness of the proposed MIMO schemes is verified by both computer simulations and experimental results obtained by analyzing the measurements acquired in multiple in-water experiments.

A lattice relaxation algorithm for three-dimensional Poisson-Nernst-Planck theory with application to ion transport through the gramicidin A channel.

PubMed Central

Kurnikova, M G; Coalson, R D; Graf, P; Nitzan, A

1999-01-01

A lattice relaxation algorithm is developed to solve the Poisson-Nernst-Planck (PNP) equations for ion transport through arbitrary three-dimensional volumes. Calculations of systems characterized by simple parallel plate and cylindrical pore geometries are presented in order to calibrate the accuracy of the method. A study of ion transport through gramicidin A dimer is carried out within this PNP framework. Good agreement with experimental measurements is obtained. Strengths and weaknesses of the PNP approach are discussed. PMID:9929470

A method for generating reliable atomistic models of amorphous polymers based on a random search of energy minima

NASA Astrophysics Data System (ADS)

Curcó, David; Casanovas, Jordi; Roca, Marc; Alemán, Carlos

2005-07-01

A method for generating atomistic models of dense amorphous polymers is presented. The method is organized in a two-steps procedure. First, structures are generated using an algorithm that minimizes the torsional strain. After this, a relaxation algorithm is applied to minimize the non-bonding interactions. Two alternative relaxation methods, which are based simple minimization and Concerted Rotation techniques, have been implemented. The performance of the method has been checked by simulating polyethylene, polypropylene, nylon 6, poly(L,D-lactic acid) and polyglycolic acid.

An Upwind Multigrid Algorithm for Calculating Flows on Unstructured Grids

NASA Technical Reports Server (NTRS)

Bonhaus, Daryl L.

1993-01-01

An algorithm is described that calculates inviscid, laminar, and turbulent flows on triangular meshes with an upwind discretization. A brief description of the base solver and the multigrid implementation is given, followed by results that consist mainly of convergence rates for inviscid and viscous flows over a NACA four-digit airfoil section. The results show that multigrid does accelerate convergence when the same relaxation parameters that yield good single-grid performance are used; however, larger gains in performance can be realized by doing less work in the relaxation scheme.

Graph Matching: Relax at Your Own Risk.

PubMed

Lyzinski, Vince; Fishkind, Donniell E; Fiori, Marcelo; Vogelstein, Joshua T; Priebe, Carey E; Sapiro, Guillermo

2016-01-01

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.

Aerodynamic Database Development for Mars Smart Lander Vehicle Configurations

NASA Technical Reports Server (NTRS)

Bobskill, Glenn J.; Parikh, Paresh C.; Prabhu, Ramadas K.; Tyler, Erik D.

2002-01-01

An aerodynamic database has been generated for the Mars Smart Lander Shelf-All configuration using computational fluid dynamics (CFD) simulations. Three different CFD codes, USM3D and FELISA, based on unstructured grid technology and LAURA, an established and validated structured CFD code, were used. As part of this database development, the results for the Mars continuum were validated with experimental data and comparisons made where applicable. The validation of USM3D and LAURA with the Unitary experimental data, the use of intermediate LAURA check analyses, as well as the validation of FELISA with the Mach 6 CF(sub 4) experimental data provided a higher confidence in the ability for CFD to provide aerodynamic data in order to determine the static trim characteristics for longitudinal stability. The analyses of the noncontinuum regime showed the existence of multiple trim angles of attack that can be unstable or stable trim points. This information is needed to design guidance controller throughout the trajectory.

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Interconversion algorithm between mechanical and dielectric relaxation measurements for acetate of cis- and trans-2-phenyl-5-hydroxymethyl-1,3-dioxane.

PubMed

Garcia-Bernabé, A; Lidón-Roger, J V; Sanchis, M J; Díaz-Calleja, R; del Castillo, L F

2015-10-01

The dielectric and mechanical spectroscopies of acetate of cis- and trans-2-phenyl-5-hydroxymethyl-1,3-dioxane are reported in the frequency domain from 10(-2) to 10(6)Hz. This ester has been selected in this study for its predominant α relaxation with regard to the β relaxation, which can be neglected. This study consists of determining an interconversion algorithm between dielectric and mechanical measurements, given by using a relation between rotational and translational complex viscosities. These important viscosities were obtained from measures of the dielectric complex permittivity and by dynamic mechanical analysis, respectively. The definitions of rotational and translational viscosities were evaluated by means of fractional calculus, by using the fit parameters of the Havriliak-Negami empirical model obtained in the dielectric and mechanical characterization of the α relaxation. This interconversion algorithm is a generalization of the break of the Stokes-Einstein-Debye relationship. It uses a power law with an exponent defined as the shape factor, which modifies the translational viscosity. Two others factors are introduced for the interconversion, a shift factor, which displaces the translational viscosity in the frequency domain, and a scale factor, which makes equal values of the two viscosities. In this paper, the shape factor has been identified as the relation between the slopes of the moduli of the complex viscosities at higher frequency. This is interpreted as the degree of kinetic coupling between the molecular rotation and translational movements. Alternatively, another interconversion algorithm has been expressed by means of dielectric and mechanical moduli.

An Algorithm for Automatically Modifying Train Crew Schedule

NASA Astrophysics Data System (ADS)

Takahashi, Satoru; Kataoka, Kenji; Kojima, Teruhito; Asami, Masayuki

Once the break-down of the train schedule occurs, the crew schedule as well as the train schedule has to be modified as quickly as possible to restore them. In this paper, we propose an algorithm for automatically modifying a crew schedule that takes all constraints into consideration, presenting a model of the combined problem of crews and trains. The proposed algorithm builds an initial solution by relaxing some of the constraint conditions, and then uses a Taboo-search method to revise this solution in order to minimize the degree of constraint violation resulting from these relaxed conditions. Then we show not only that the algorithm can generate a constraint satisfaction solution, but also that the solution will satisfy the experts. That is, we show the proposed algorithm is capable of producing a usable solution in a short time by applying to actual cases of train-schedule break-down, and that the solution is at least as good as those produced manually, by comparing the both solutions with several point of view.

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.

PubMed

Ćwik, Michał; Józefczyk, Jerzy

2018-01-01

An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the criterion's value, as such calculation is NP-hard problem itself. Moreover, the lower bound is used instead of solving the internal deterministic flow-shop. The constructive heuristic algorithm is applied for the relaxed optimization problem. The algorithm is compared with previously elaborated other heuristic algorithms basing on the evolutionary and the middle interval approaches. The conducted computational experiments showed the advantage of the constructive heuristic algorithm with regards to both the criterion and the time of computations. The Wilcoxon paired-rank statistical test confirmed this conclusion.

The Complexity of Bit Retrieval

DOE PAGES

Elser, Veit

2018-09-20

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

The Complexity of Bit Retrieval

DOE Office of Scientific and Technical Information (OSTI.GOV)

Elser, Veit

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Rusell; Nagarajan, Harsha; Sundar, Kaarthik

2017-09-25

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures

A Message Passing Approach to Side Chain Positioning with Applications in Protein Docking Refinement *

PubMed Central

Moghadasi, Mohammad; Kozakov, Dima; Mamonov, Artem B.; Vakili, Pirooz; Vajda, Sandor; Paschalidis, Ioannis Ch.

2013-01-01

We introduce a message-passing algorithm to solve the Side Chain Positioning (SCP) problem. SCP is a crucial component of protein docking refinement, which is a key step of an important class of problems in computational structural biology called protein docking. We model SCP as a combinatorial optimization problem and formulate it as a Maximum Weighted Independent Set (MWIS) problem. We then employ a modified and convergent belief-propagation algorithm to solve a relaxation of MWIS and develop randomized estimation heuristics that use the relaxed solution to obtain an effective MWIS feasible solution. Using a benchmark set of protein complexes we demonstrate that our approach leads to more accurate docking predictions compared to a baseline algorithm that does not solve the SCP. PMID:23515575

Ground-water resources of the Laura area, Majuro Atoll, Marshall Islands

USGS Publications Warehouse

Hamlin, S.N.; Anthony, S.S.

1987-01-01

The water system that supplies the heavily populated Dalap-Uliga-Darrit (DUD) area of Majuro atoll, Marshall Island, relies almost entirely upon airstrip catchment of rain water. Droughts cause severe water supply problems and water rationing is required, even during periods of normal rainfall. The Laura area contains a substantial lens of fresh groundwater that could be developed for export to the DUD area 30 mi to the east. Study of the groundwater resource at Laura involved a survey of existing wells, installation of monitoring wells and test holes, compilation of continuous records of rainfall and water level fluctuations, and collection of water quality data. Test hole data permitted the definition of three geohydrologic units which correlate well with similar units in Bikini and Enewetak atolls. The units consist of two layers of unconsolidated reef and lagoon sediments resting on a dense, highly permeable limestone. The potable water zone, or freshwater nucleus, of the lens is contained mostly within the unconsolidated layers, which are much less permeable than the basal limestone. Recharge to the Laura freshwater lens is estimated to be 1.8 mil gal/day, based on an average annual rainfall of 140 in. Sustainable yield is estimated to be about 400,000 gal/day. Shallow skimming wells or infiltration galleries similar to those used on Kwajalein atoll would be appropriate to develop the freshwater lens. The impact of development on the lens can be determined by monitoring the salinity in developed water and in a network of monitor wells. (Author 's abstract)

Semidefinite Relaxation-Based Optimization of Multiple-Input Wireless Power Transfer Systems

NASA Astrophysics Data System (ADS)

Lang, Hans-Dieter; Sarris, Costas D.

2017-11-01

An optimization procedure for multi-transmitter (MISO) wireless power transfer (WPT) systems based on tight semidefinite relaxation (SDR) is presented. This method ensures physical realizability of MISO WPT systems designed via convex optimization -- a robust, semi-analytical and intuitive route to optimizing such systems. To that end, the nonconvex constraints requiring that power is fed into rather than drawn from the system via all transmitter ports are incorporated in a convex semidefinite relaxation, which is efficiently and reliably solvable by dedicated algorithms. A test of the solution then confirms that this modified problem is equivalent (tight relaxation) to the original (nonconvex) one and that the true global optimum has been found. This is a clear advantage over global optimization methods (e.g. genetic algorithms), where convergence to the true global optimum cannot be ensured or tested. Discussions of numerical results yielded by both the closed-form expressions and the refined technique illustrate the importance and practicability of the new method. It, is shown that this technique offers a rigorous optimization framework for a broad range of current and emerging WPT applications.

Algorithmic developments of the kinetic activation-relaxation technique: Accessing long-time kinetics of larger and more complex systems

NASA Astrophysics Data System (ADS)

Trochet, Mickaël; Sauvé-Lacoursière, Alecsandre; Mousseau, Normand

2017-10-01

In spite of the considerable computer speed increase of the last decades, long-time atomic simulations remain a challenge and most molecular dynamical simulations are limited to 1 μ s at the very best in condensed matter and materials science. There is a need, therefore, for accelerated methods that can bridge the gap between the full dynamical description of molecular dynamics and experimentally relevant time scales. This is the goal of the kinetic Activation-Relaxation Technique (k-ART), an off-lattice kinetic Monte-Carlo method with on-the-fly catalog building capabilities based on the topological tool NAUTY and the open-ended search method Activation-Relaxation Technique (ART nouveau) that has been applied with success to the study of long-time kinetics of complex materials, including grain boundaries, alloys, and amorphous materials. We present a number of recent algorithmic additions, including the use of local force calculation, two-level parallelization, improved topological description, and biased sampling and show how they perform on two applications linked to defect diffusion and relaxation after ion bombardement in Si.

Distributed Matrix Completion: Applications to Cooperative Positioning in Noisy Environments

DTIC Science & Technology

2013-12-11

positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown...computing the leading eigenvectors of a large data matrix through gossip algorithms. A new algorithm is proposed that amounts to iteratively multiplying...generalization of gossip algorithms for consensus. The algorithms outperform state-of-the-art methods in a communication-limited scenario. Positioning via

Relaxation dynamics of a multihierarchical polymer network

NASA Astrophysics Data System (ADS)

Jurjiu, Aurel; Biter, Teodor Lucian; Turcu, Flaviu

2017-01-01

In this work, we study the relaxation dynamics of a multihierarchical polymer network built by replicating the Vicsek fractal in dendrimer shape. The relaxation dynamics is investigated in the framework of the generalized Gaussian structure model by employing both Rouse and Zimm approaches. In the Rouse-type approach, we show the iterative procedure whereby the whole eigenvalue spectrum of the connectivity matrix of the multihierarchical structure can be obtained. Remarkably, the general picture that emerges from both approaches, even though we have a mixed growth algorithm, is that the obtained multihierarchical structure preserves the individual relaxation behaviors of its components. The theoretical findings with respect to the splitting of the intermediate domain of the relaxation quantities are well supported by experimental results.

Adaptive Inverse Control for Rotorcraft Vibration Reduction

NASA Technical Reports Server (NTRS)

Jacklin, Stephen A.

1985-01-01

This thesis extends the Least Mean Square (LMS) algorithm to solve the mult!ple-input, multiple-output problem of alleviating N/Rev (revolutions per minute by number of blades) helicopter fuselage vibration by means of adaptive inverse control. A frequency domain locally linear model is used to represent the transfer matrix relating the higher harmonic pitch control inputs to the harmonic vibration outputs to be controlled. By using the inverse matrix as the controller gain matrix, an adaptive inverse regulator is formed to alleviate the N/Rev vibration. The stability and rate of convergence properties of the extended LMS algorithm are discussed. It is shown that the stability ranges for the elements of the stability gain matrix are directly related to the eigenvalues of the vibration signal information matrix for the learning phase, but not for the control phase. The overall conclusion is that the LMS adaptive inverse control method can form a robust vibration control system, but will require some tuning of the input sensor gains, the stability gain matrix, and the amount of control relaxation to be used. The learning curve of the controller during the learning phase is shown to be quantitatively close to that predicted by averaging the learning curves of the normal modes. For higher order transfer matrices, a rough estimate of the inverse is needed to start the algorithm efficiently. The simulation results indicate that the factor which most influences LMS adaptive inverse control is the product of the control relaxation and the the stability gain matrix. A small stability gain matrix makes the controller less sensitive to relaxation selection, and permits faster and more stable vibration reduction, than by choosing the stability gain matrix large and the control relaxation term small. It is shown that the best selections of the stability gain matrix elements and the amount of control relaxation is basically a compromise between slow, stable convergence and fast convergence with increased possibility of unstable identification. In the simulation studies, the LMS adaptive inverse control algorithm is shown to be capable of adapting the inverse (controller) matrix to track changes in the flight conditions. The algorithm converges quickly for moderate disturbances, while taking longer for larger disturbances. Perfect knowledge of the inverse matrix is not required for good control of the N/Rev vibration. However it is shown that measurement noise will prevent the LMS adaptive inverse control technique from controlling the vibration, unless the signal averaging method presented is incorporated into the algorithm.

A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.

PubMed

Gong, Pinghua; Zhang, Changshui; Lu, Zhaosong; Huang, Jianhua Z; Ye, Jieping

2013-01-01

Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems because its computational cost is a multiple of solving a single convex problem. In this paper, we propose a General Iterative Shrinkage and Thresholding (GIST) algorithm to solve the nonconvex optimization problem for a large class of non-convex penalties. The GIST algorithm iteratively solves a proximal operator problem, which in turn has a closed-form solution for many commonly used penalties. At each outer iteration of the algorithm, we use a line search initialized by the Barzilai-Borwein (BB) rule that allows finding an appropriate step size quickly. The paper also presents a detailed convergence analysis of the GIST algorithm. The efficiency of the proposed algorithm is demonstrated by extensive experiments on large-scale data sets.

Operator induced multigrid algorithms using semirefinement

NASA Technical Reports Server (NTRS)

Decker, Naomi; Vanrosendale, John

1989-01-01

A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two and three dimensional model problems are presented, together with a two level analysis explaining these results.

Distributed Data-aggregation Consensus for Sensor Networks: Relaxation of Consensus Concept and Convergence Property

DTIC Science & Technology

2014-08-01

consensus algorithm called randomized gossip is more suitable [7, 8]. In asynchronous randomized gossip algorithms, pairs of neighboring nodes exchange...messages and perform updates in an asynchronous and unattended manner, and they also 1 The class of broadcast gossip algorithms [9, 10, 11, 12] are...dynamics [2] and asynchronous pairwise randomized gossip [7, 8], broadcast gossip algorithms do not require that nodes know the identities of their

Differential and relaxed image foresting transform for graph-cut segmentation of multiple 3D objects.

PubMed

Moya, Nikolas; Falcão, Alexandre X; Ciesielski, Krzysztof C; Udupa, Jayaram K

2014-01-01

Graph-cut algorithms have been extensively investigated for interactive binary segmentation, when the simultaneous delineation of multiple objects can save considerable user's time. We present an algorithm (named DRIFT) for 3D multiple object segmentation based on seed voxels and Differential Image Foresting Transforms (DIFTs) with relaxation. DRIFT stands behind efficient implementations of some state-of-the-art methods. The user can add/remove markers (seed voxels) along a sequence of executions of the DRIFT algorithm to improve segmentation. Its first execution takes linear time with the image's size, while the subsequent executions for corrections take sublinear time in practice. At each execution, DRIFT first runs the DIFT algorithm, then it applies diffusion filtering to smooth boundaries between objects (and background) and, finally, it corrects possible objects' disconnection occurrences with respect to their seeds. We evaluate DRIFT in 3D CT-images of the thorax for segmenting the arterial system, esophagus, left pleural cavity, right pleural cavity, trachea and bronchi, and the venous system.

Adaptive truncation of matrix decompositions and efficient estimation of NMR relaxation distributions

NASA Astrophysics Data System (ADS)

Teal, Paul D.; Eccles, Craig

2015-04-01

The two most successful methods of estimating the distribution of nuclear magnetic resonance relaxation times from two dimensional data are data compression followed by application of the Butler-Reeds-Dawson algorithm, and a primal-dual interior point method using preconditioned conjugate gradient. Both of these methods have previously been presented using a truncated singular value decomposition of matrices representing the exponential kernel. In this paper it is shown that other matrix factorizations are applicable to each of these algorithms, and that these illustrate the different fundamental principles behind the operation of the algorithms. These are the rank-revealing QR (RRQR) factorization and the LDL factorization with diagonal pivoting, also known as the Bunch-Kaufman-Parlett factorization. It is shown that both algorithms can be improved by adaptation of the truncation as the optimization process progresses, improving the accuracy as the optimal value is approached. A variation on the interior method viz, the use of barrier function instead of the primal-dual approach, is found to offer considerable improvement in terms of speed and reliability. A third type of algorithm, related to the algorithm known as Fast iterative shrinkage-thresholding algorithm, is applied to the problem. This method can be efficiently formulated without the use of a matrix decomposition.

A nudging-based data assimilation method: the Back and Forth Nudging (BFN) algorithm

NASA Astrophysics Data System (ADS)

Auroux, D.; Blum, J.

2008-03-01

This paper deals with a new data assimilation algorithm, called Back and Forth Nudging. The standard nudging technique consists in adding to the equations of the model a relaxation term that is supposed to force the observations to the model. The BFN algorithm consists in repeatedly performing forward and backward integrations of the model with relaxation (or nudging) terms, using opposite signs in the direct and inverse integrations, so as to make the backward evolution numerically stable. This algorithm has first been tested on the standard Lorenz model with discrete observations (perfect or noisy) and compared with the variational assimilation method. The same type of study has then been performed on the viscous Burgers equation, comparing again with the variational method and focusing on the time evolution of the reconstruction error, i.e. the difference between the reference trajectory and the identified one over a time period composed of an assimilation period followed by a prediction period. The possible use of the BFN algorithm as an initialization for the variational method has also been investigated. Finally the algorithm has been tested on a layered quasi-geostrophic model with sea-surface height observations. The behaviours of the two algorithms have been compared in the presence of perfect or noisy observations, and also for imperfect models. This has allowed us to reach a conclusion concerning the relative performances of the two algorithms.

Fast Algorithms for Estimating Mixture Parameters

DTIC Science & Technology

1989-08-30

The investigation is a two year project with the first year sponsored by the Army Research Office and the second year by the National Science Foundation (Grant... Science Foundation during the coming year. Keywords: Fast algorithms; Algorithms Mixture Distribution Random Variables. (KR)...numerical testing of the accelerated fixed-point method was completed. The work on relaxation methods will be done under the sponsorship of the National

An algorithm for the solution of dynamic linear programs

NASA Technical Reports Server (NTRS)

Psiaki, Mark L.

1989-01-01

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Non-rigid ultrasound image registration using generalized relaxation labeling process

NASA Astrophysics Data System (ADS)

Lee, Jong-Ha; Seong, Yeong Kyeong; Park, MoonHo; Woo, Kyoung-Gu; Ku, Jeonghun; Park, Hee-Jun

2013-03-01

This research proposes a novel non-rigid registration method for ultrasound images. The most predominant anatomical features in medical images are tissue boundaries, which appear as edges. In ultrasound images, however, other features can be identified as well due to the specular reflections that appear as bright lines superimposed on the ideal edge location. In this work, an image's local phase information (via the frequency domain) is used to find the ideal edge location. The generalized relaxation labeling process is then formulated to align the feature points extracted from the ideal edge location. In this work, the original relaxation labeling method was generalized by taking n compatibility coefficient values to improve non-rigid registration performance. This contextual information combined with a relaxation labeling process is used to search for a correspondence. Then the transformation is calculated by the thin plate spline (TPS) model. These two processes are iterated until the optimal correspondence and transformation are found. We have tested our proposed method and the state-of-the-art algorithms with synthetic data and bladder ultrasound images of in vivo human subjects. Experiments show that the proposed method improves registration performance significantly, as compared to other state-of-the-art non-rigid registration algorithms.

Lifelong-RL: Lifelong Relaxation Labeling for Separating Entities and Aspects in Opinion Targets.

PubMed

Shu, Lei; Liu, Bing; Xu, Hu; Kim, Annice

2016-11-01

It is well-known that opinions have targets. Extracting such targets is an important problem of opinion mining because without knowing the target of an opinion, the opinion is of limited use. So far many algorithms have been proposed to extract opinion targets. However, an opinion target can be an entity or an aspect (part or attribute) of an entity. An opinion about an entity is an opinion about the entity as a whole, while an opinion about an aspect is just an opinion about that specific attribute or aspect of an entity. Thus, opinion targets should be separated into entities and aspects before use because they represent very different things about opinions. This paper proposes a novel algorithm, called Lifelong-RL , to solve the problem based on lifelong machine learning and relaxation labeling . Extensive experiments show that the proposed algorithm Lifelong-RL outperforms baseline methods markedly.

An efficient iteration strategy for the solution of the Euler equations

NASA Technical Reports Server (NTRS)

Walters, R. W.; Dwoyer, D. L.

1985-01-01

A line Gauss-Seidel (LGS) relaxation algorithm in conjunction with a one-parameter family of upwind discretizations of the Euler equations in two-dimensions is described. The basic algorithm has the property that convergence to the steady-state is quadratic for fully supersonic flows and linear otherwise. This is in contrast to the block ADI methods (either central or upwind differenced) and the upwind biased relaxation schemes, all of which converge linearly, independent of the flow regime. Moreover, the algorithm presented here is easily enhanced to detect regions of subsonic flow embedded in supersonic flow. This allows marching by lines in the supersonic regions, converging each line quadratically, and iterating in the subsonic regions, thus yielding a very efficient iteration strategy. Numerical results are presented for two-dimensional supersonic and transonic flows containing both oblique and normal shock waves which confirm the efficiency of the iteration strategy.

Efficient solutions to the Euler equations for supersonic flow with embedded subsonic regions

NASA Technical Reports Server (NTRS)

Walters, Robert W.; Dwoyer, Douglas L.

1987-01-01

A line Gauss-Seidel (LGS) relaxation algorithm in conjunction with a one-parameter family of upwind discretizations of the Euler equations in two dimensions is described. Convergence of the basic algorithm to the steady state is quadratic for fully supersonic flows and is linear for other flows. This is in contrast to the block alternating direction implicit methods (either central or upwind differenced) and the upwind biased relaxation schemes, all of which converge linearly, independent of the flow regime. Moreover, the algorithm presented herein is easily coupled with methods to detect regions of subsonic flow embedded in supersonic flow. This allows marching by lines in the supersonic regions, converging each line quadratically, and iterating in the subsonic regions, and yields a very efficient iteration strategy. Numerical results are presented for two-dimensional supersonic and transonic flows containing oblique and normal shock waves which confirm the efficiency of the iteration strategy.

Distributed Matrix Completion: Application to Cooperative Positioning in Noisy Environments

DTIC Science & Technology

2013-12-11

positioning, and a gossip version of low-rank approximation were developed. A convex relaxation for positioning in the presence of noise was shown to...of a large data matrix through gossip algorithms. A new algorithm is proposed that amounts to iteratively multiplying a vector by independent random...sparsification of the original matrix and averaging the resulting normalized vectors. This can be viewed as a generalization of gossip algorithms for

The kinetic activation-relaxation technique: an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search

NASA Astrophysics Data System (ADS)

Mousseau, Nomand

2012-02-01

While kinetic Monte Carlo algorithm has been proposed almost 40 years ago, its application in materials science has been mostly limited to lattice-based motion due to the difficulties associated with identifying new events and building usable catalogs when atoms moved into off-lattice position. Here, I present the kinetic activation-relaxation technique (kinetic ART) is an off-lattice, self-learning kinetic Monte Carlo algorithm with on-the-fly event search [1]. It combines ART nouveau [2], a very efficient unbiased open-ended activated method for finding transition states, with a topological classification [3] that allows a discrete cataloguing of local environments in complex systems, including disordered materials. In kinetic ART, local topologies are first identified for all atoms in a system. ART nouveau event searches are then launched for new topologies, building an extensive catalog of barriers and events. Next, all low energy events are fully reconstructed and relaxed, allowing to take complete account of elastic effects in the system's kinetics. Using standard kinetic Monte Carlo, the clock is brought forward and an event is then selected and applied before a new search for topologies is launched. In addition to presenting the various elements of the algorithm, I will discuss three recent applications to ion-bombarded silicon, defect diffusion in Fe and structural relaxation in amorphous silicon.[4pt] This work was done in collaboration with Laurent Karim B'eland, Peter Brommer, Fedwa El-Mellouhi, Jean-Francois Joly and Laurent Lewis.[4pt] [1] F. El-Mellouhi, N. Mousseau and L.J. Lewis, Phys. Rev. B. 78, 153202 (2008); L.K. B'eland et al., Phys. Rev. E 84, 046704 (2011).[2] G.T. Barkema and N. Mousseau, Phys. Rev. Lett. 77, 4358 (1996); E. Machado-Charry et al., J. Chem Phys. 135, 034102, (2011).[3] B.D. McKay, Congressus Numerantium 30, 45 (1981).

Upwind relaxation methods for the Navier-Stokes equations using inner iterations

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Ng, Wing-Fai; Walters, Robert W.

1992-01-01

A subsonic and a supersonic problem are respectively treated by an upwind line-relaxation algorithm for the Navier-Stokes equations using inner iterations to accelerate steady-state solution convergence and thereby minimize CPU time. While the ability of the inner iterative procedure to mimic the quadratic convergence of the direct solver method is attested to in both test problems, some of the nonquadratic inner iterative results are noted to have been more efficient than the quadratic. In the more successful, supersonic test case, inner iteration required only about 65 percent of the line-relaxation method-entailed CPU time.

A computational atomistic study of the relaxation of ion-bombarded c-Si on experimental time-scales: an application of the kinetic Activation Relaxation Technique

NASA Astrophysics Data System (ADS)

Béland, Laurent Karim; Mousseau, Normand

2012-02-01

The kinetic activation relaxation technique (kinetic ART) method, an off-lattice, self-learning kinetic Monte Carlo (KMC) algorithm with on-the-fly event search,ootnotetextL. K. B'eland, P. Brommer, F. El-Mellouhi, J.-F. Joly and N. Mousseau, Phys. Rev. E 84, 046704 (2011). is used to study the relaxation of c-Si after Si^- bombardment at 3 keV. We describe the evolution of the damaged areas at room-temperature and above for periods of the order of seconds, treating long-range elastic deformations exactly. We assess the stability of the nanoscale structures formed by the damage cascade and the mechanisms that govern post-implantation annealing.

Countering the Non-State Nuclear Threat: Are We Ready?

DTIC Science & Technology

2005-01-01

Problem……………………………………… 7 B. Civilian Nuclear Sources………….………………………………… 10 C. The “ Brain Drain” ………………………………………………….. 13 V. US POLICY ON NUCLEAR...4 Jay Ackerman and Laura Snyder. “Would They if They Could?” Bulletin of the Atomic Scientists, Vol. 58, no. 3...New York: Columbia University Press, 1998), 94. 6 Jay Ackerman and Laura Snyder. “Would They if They Could?” Bulletin of the Atomic Scientists, Vol. 58

Adaptive relaxation for the steady-state analysis of Markov chains

NASA Technical Reports Server (NTRS)

Horton, Graham

1994-01-01

We consider a variant of the well-known Gauss-Seidel method for the solution of Markov chains in steady state. Whereas the standard algorithm visits each state exactly once per iteration in a predetermined order, the alternative approach uses a dynamic strategy. A set of states to be visited is maintained which can grow and shrink as the computation progresses. In this manner, we hope to concentrate the computational work in those areas of the chain in which maximum improvement in the solution can be achieved. We consider the adaptive approach both as a solver in its own right and as a relaxation method within the multi-level algorithm. Experimental results show significant computational savings in both cases.

Direct simulation Monte Carlo modeling of relaxation processes in polyatomic gases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pfeiffer, M., E-mail: mpfeiffer@irs.uni-stuttgart.de; Nizenkov, P., E-mail: nizenkov@irs.uni-stuttgart.de; Mirza, A., E-mail: mirza@irs.uni-stuttgart.de

2016-02-15

Relaxation processes of polyatomic molecules are modeled and implemented in an in-house Direct Simulation Monte Carlo code in order to enable the simulation of atmospheric entry maneuvers at Mars and Saturn’s Titan. The description of rotational and vibrational relaxation processes is derived from basic quantum-mechanics using a rigid rotator and a simple harmonic oscillator, respectively. Strategies regarding the vibrational relaxation process are investigated, where good agreement for the relaxation time according to the Landau-Teller expression is found for both methods, the established prohibiting double relaxation method and the new proposed multi-mode relaxation. Differences and applications areas of these two methodsmore » are discussed. Consequently, two numerical methods used for sampling of energy values from multi-dimensional distribution functions are compared. The proposed random-walk Metropolis algorithm enables the efficient treatment of multiple vibrational modes within a time step with reasonable computational effort. The implemented model is verified and validated by means of simple reservoir simulations and the comparison to experimental measurements of a hypersonic, carbon-dioxide flow around a flat-faced cylinder.« less

Direct simulation Monte Carlo modeling of relaxation processes in polyatomic gases

NASA Astrophysics Data System (ADS)

Pfeiffer, M.; Nizenkov, P.; Mirza, A.; Fasoulas, S.

2016-02-01

Relaxation processes of polyatomic molecules are modeled and implemented in an in-house Direct Simulation Monte Carlo code in order to enable the simulation of atmospheric entry maneuvers at Mars and Saturn's Titan. The description of rotational and vibrational relaxation processes is derived from basic quantum-mechanics using a rigid rotator and a simple harmonic oscillator, respectively. Strategies regarding the vibrational relaxation process are investigated, where good agreement for the relaxation time according to the Landau-Teller expression is found for both methods, the established prohibiting double relaxation method and the new proposed multi-mode relaxation. Differences and applications areas of these two methods are discussed. Consequently, two numerical methods used for sampling of energy values from multi-dimensional distribution functions are compared. The proposed random-walk Metropolis algorithm enables the efficient treatment of multiple vibrational modes within a time step with reasonable computational effort. The implemented model is verified and validated by means of simple reservoir simulations and the comparison to experimental measurements of a hypersonic, carbon-dioxide flow around a flat-faced cylinder.

Deriving quantitative dynamics information for proteins and RNAs using ROTDIF with a graphical user interface.

PubMed

Berlin, Konstantin; Longhini, Andrew; Dayie, T Kwaku; Fushman, David

2013-12-01

To facilitate rigorous analysis of molecular motions in proteins, DNA, and RNA, we present a new version of ROTDIF, a program for determining the overall rotational diffusion tensor from single- or multiple-field nuclear magnetic resonance relaxation data. We introduce four major features that expand the program's versatility and usability. The first feature is the ability to analyze, separately or together, (13)C and/or (15)N relaxation data collected at a single or multiple fields. A significant improvement in the accuracy compared to direct analysis of R2/R1 ratios, especially critical for analysis of (13)C relaxation data, is achieved by subtracting high-frequency contributions to relaxation rates. The second new feature is an improved method for computing the rotational diffusion tensor in the presence of biased errors, such as large conformational exchange contributions, that significantly enhances the accuracy of the computation. The third new feature is the integration of the domain alignment and docking module for relaxation-based structure determination of multi-domain systems. Finally, to improve accessibility to all the program features, we introduced a graphical user interface that simplifies and speeds up the analysis of the data. Written in Java, the new ROTDIF can run on virtually any computer platform. In addition, the new ROTDIF achieves an order of magnitude speedup over the previous version by implementing a more efficient deterministic minimization algorithm. We not only demonstrate the improvement in accuracy and speed of the new algorithm for synthetic and experimental (13)C and (15)N relaxation data for several proteins and nucleic acids, but also show that careful analysis required especially for characterizing RNA dynamics allowed us to uncover subtle conformational changes in RNA as a function of temperature that were opaque to previous analysis.

Obtaining sparse distributions in 2D inverse problems.

PubMed

Reci, A; Sederman, A J; Gladden, L F

2017-08-01

The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L 1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L 1 regularization to a class of inverse problems; relaxation-relaxation, T 1 -T 2 , and diffusion-relaxation, D-T 2 , correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L 1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L 1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L 1 regularization algorithm stably recovers a distribution at a signal to noise ratio<20 and that it resolves relaxation time constants and diffusion coefficients differing by as little as 10%. The enhanced resolving capability is used to measure the inter and intra particle concentrations of a mixture of hexane and dodecane present within porous silica beads immersed within a bulk liquid phase; neither NNLS nor Tikhonov regularization are able to provide this resolution. This experimental study shows that the approach enables discrimination between different chemical species when direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise. Copyright © 2017. Published by Elsevier Inc.

Obtaining sparse distributions in 2D inverse problems

NASA Astrophysics Data System (ADS)

Reci, A.; Sederman, A. J.; Gladden, L. F.

2017-08-01

The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L1 regularization to a class of inverse problems; relaxation-relaxation, T1-T2, and diffusion-relaxation, D-T2, correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L1 regularization algorithm stably recovers a distribution at a signal to noise ratio < 20 and that it resolves relaxation time constants and diffusion coefficients differing by as little as 10%. The enhanced resolving capability is used to measure the inter and intra particle concentrations of a mixture of hexane and dodecane present within porous silica beads immersed within a bulk liquid phase; neither NNLS nor Tikhonov regularization are able to provide this resolution. This experimental study shows that the approach enables discrimination between different chemical species when direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise.

Arm retraction dynamics of entangled star polymers: A forward flux sampling method study

NASA Astrophysics Data System (ADS)

Zhu, Jian; Likhtman, Alexei E.; Wang, Zuowei

2017-07-01

The study of dynamics and rheology of well-entangled branched polymers remains a challenge for computer simulations due to the exponentially growing terminal relaxation times of these polymers with increasing molecular weights. We present an efficient simulation algorithm for studying the arm retraction dynamics of entangled star polymers by combining the coarse-grained slip-spring (SS) model with the forward flux sampling (FFS) method. This algorithm is first applied to simulate symmetric star polymers in the absence of constraint release (CR). The reaction coordinate for the FFS method is determined by finding good agreement of the simulation results on the terminal relaxation times of mildly entangled stars with those obtained from direct shooting SS model simulations with the relative difference between them less than 5%. The FFS simulations are then carried out for strongly entangled stars with arm lengths up to 16 entanglements that are far beyond the accessibility of brute force simulations in the non-CR condition. Apart from the terminal relaxation times, the same method can also be applied to generate the relaxation spectra of all entanglements along the arms which are desired for the development of quantitative theories of entangled branched polymers. Furthermore, we propose a numerical route to construct the experimentally measurable relaxation correlation functions by effectively linking the data stored at each interface during the FFS runs. The obtained star arm end-to-end vector relaxation functions Φ (t ) and the stress relaxation function G(t) are found to be in reasonably good agreement with standard SS simulation results in the terminal regime. Finally, we demonstrate that this simulation method can be conveniently extended to study the arm-retraction problem in entangled star polymer melts with CR by modifying the definition of the reaction coordinate, while the computational efficiency will depend on the particular slip-spring or slip-link model employed.

MHD Turbulence, div B = 0 and Lattice Boltzmann Simulations

NASA Astrophysics Data System (ADS)

Phillips, Nate; Keating, Brian; Vahala, George; Vahala, Linda

2006-10-01

The question of div B = 0 in MHD simulations is a crucial issue. Here we consider lattice Boltzmann simulations for MHD (LB-MHD). One introduces a scalar distribution function for the velocity field and a vector distribution function for the magnetic field. This asymmetry is due to the different symmetries in the tensors arising in the time evolution of these fields. The simple algorithm of streaming and local collisional relaxation is ideally parallelized and vectorized -- leading to the best sustained performance/PE of any code run on the Earth Simulator. By reformulating the BGK collision term, a simple implicit algorithm can be immediately transformed into an explicit algorithm that permits simulations at quite low viscosity and resistivity. However the div B is not an imposed constraint. Currently we are examining a new formulations of LB-MHD that impose the div B constraint -- either through an entropic like formulation or by introducing forcing terms into the momentum equations and permitting simpler forms of relaxation distributions.

Fast graph-based relaxed clustering for large data sets using minimal enclosing ball.

PubMed

Qian, Pengjiang; Chung, Fu-Lai; Wang, Shitong; Deng, Zhaohong

2012-06-01

Although graph-based relaxed clustering (GRC) is one of the spectral clustering algorithms with straightforwardness and self-adaptability, it is sensitive to the parameters of the adopted similarity measure and also has high time complexity O(N(3)) which severely weakens its usefulness for large data sets. In order to overcome these shortcomings, after introducing certain constraints for GRC, an enhanced version of GRC [constrained GRC (CGRC)] is proposed to increase the robustness of GRC to the parameters of the adopted similarity measure, and accordingly, a novel algorithm called fast GRC (FGRC) based on CGRC is developed in this paper by using the core-set-based minimal enclosing ball approximation. A distinctive advantage of FGRC is that its asymptotic time complexity is linear with the data set size N. At the same time, FGRC also inherits the straightforwardness and self-adaptability from GRC, making the proposed FGRC a fast and effective clustering algorithm for large data sets. The advantages of FGRC are validated by various benchmarking and real data sets.

Fainting

MedlinePlus

... Syncope. In: Marx JA, Hockberger RS, Walls RM, et al, eds. Rosen's Emergency Medicine: Concepts and Clinical Practice ... by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal Medicine ...

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

NASA Technical Reports Server (NTRS)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

An improved pulse sequence and inversion algorithm of T2 spectrum

NASA Astrophysics Data System (ADS)

Ge, Xinmin; Chen, Hua; Fan, Yiren; Liu, Juntao; Cai, Jianchao; Liu, Jianyu

2017-03-01

The nuclear magnetic resonance transversal relaxation time is widely applied in geological prospecting, both in laboratory and downhole environments. However, current methods used for data acquisition and inversion should be reformed to characterize geological samples with complicated relaxation components and pore size distributions, such as samples of tight oil, gas shale, and carbonate. We present an improved pulse sequence to collect transversal relaxation signals based on the CPMG (Carr, Purcell, Meiboom, and Gill) pulse sequence. The echo spacing is not constant but varies in different windows, depending on prior knowledge or customer requirements. We use the entropy based truncated singular value decomposition (TSVD) to compress the ill-posed matrix and discard small singular values which cause the inversion instability. A hybrid algorithm combining the iterative TSVD and a simultaneous iterative reconstruction technique is implemented to reach the global convergence and stability of the inversion. Numerical simulations indicate that the improved pulse sequence leads to the same result as CPMG, but with lower echo numbers and computational time. The proposed method is a promising technique for geophysical prospecting and other related fields in future.

Nonlinear relaxation algorithms for circuit simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saleh, R.A.

Circuit simulation is an important Computer-Aided Design (CAD) tool in the design of Integrated Circuits (IC). However, the standard techniques used in programs such as SPICE result in very long computer-run times when applied to large problems. In order to reduce the overall run time, a number of new approaches to circuit simulation were developed and are described. These methods are based on nonlinear relaxation techniques and exploit the relative inactivity of large circuits. Simple waveform-processing techniques are described to determine the maximum possible speed improvement that can be obtained by exploiting this property of large circuits. Three simulation algorithmsmore » are described, two of which are based on the Iterated Timing Analysis (ITA) method and a third based on the Waveform-Relaxation Newton (WRN) method. New programs that incorporate these techniques were developed and used to simulate a variety of industrial circuits. The results from these simulations are provided. The techniques are shown to be much faster than the standard approach. In addition, a number of parallel aspects of these algorithms are described, and a general space-time model of parallel-task scheduling is developed.« less

Multiple quay cranes scheduling for double cycling in container terminals

PubMed Central

Chu, Yanling; Zhang, Xiaoju; Yang, Zhongzhen

2017-01-01

Double cycling is an efficient tool to increase the efficiency of quay crane (QC) in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high. PMID:28692699

Multiple quay cranes scheduling for double cycling in container terminals.

PubMed

Chu, Yanling; Zhang, Xiaoju; Yang, Zhongzhen

2017-01-01

Double cycling is an efficient tool to increase the efficiency of quay crane (QC) in container terminals. In this paper, an optimization model for double cycling is developed to optimize the operation sequence of multiple QCs. The objective is to minimize the makespan of the ship handling operation considering the ship balance constraint. To solve the model, an algorithm based on Lagrangian relaxation is designed. Finally, we compare the efficiency of the Lagrangian relaxation based heuristic with the branch-and-bound method and a genetic algorithm using instances of different sizes. The results of numerical experiments indicate that the proposed model can effectively reduce the unloading and loading times of QCs. The effects of the ship balance constraint are more notable when the number of QCs is high.

Solution of elliptic partial differential equations by fast Poisson solvers using a local relaxation factor. 1: One-step method

NASA Technical Reports Server (NTRS)

Chang, S. C.

1986-01-01

An algorithm for solving a large class of two- and three-dimensional nonseparable elliptic partial differential equations (PDE's) is developed and tested. It uses a modified D'Yakanov-Gunn iterative procedure in which the relaxation factor is grid-point dependent. It is easy to implement and applicable to a variety of boundary conditions. It is also computationally efficient, as indicated by the results of numerical comparisons with other established methods. Furthermore, the current algorithm has the advantage of possessing two important properties which the traditional iterative methods lack; that is: (1) the convergence rate is relatively insensitive to grid-cell size and aspect ratio, and (2) the convergence rate can be easily estimated by using the coefficient of the PDE being solved.

Relaxation dynamics of internal segments of DNA chains in nanochannels

NASA Astrophysics Data System (ADS)

Jain, Aashish; Muralidhar, Abhiram; Dorfman, Kevin; Dorfman Group Team

We will present relaxation dynamics of internal segments of a DNA chain confined in nanochannel. The results have direct application in genome mapping technology, where long DNA molecules containing sequence-specific fluorescent probes are passed through an array of nanochannels to linearize them, and then the distances between these probes (the so-called ``DNA barcode'') are measured. The relaxation dynamics of internal segments set the experimental error due to dynamic fluctuations. We developed a multi-scale simulation algorithm, combining a Pruned-Enriched Rosenbluth Method (PERM) simulation of a discrete wormlike chain model with hard spheres with Brownian dynamics (BD) simulations of a bead-spring chain. Realistic parameters such as the bead friction coefficient and spring force law parameters are obtained from PERM simulations and then mapped onto the bead-spring model. The BD simulations are carried out to obtain the extension autocorrelation functions of various segments, which furnish their relaxation times. Interestingly, we find that (i) corner segments relax faster than the center segments and (ii) relaxation times of corner segments do not depend on the contour length of DNA chain, whereas the relaxation times of center segments increase linearly with DNA chain size.

Ion flux through membrane channels--an enhanced algorithm for the Poisson-Nernst-Planck model.

PubMed

Dyrka, Witold; Augousti, Andy T; Kotulska, Malgorzata

2008-09-01

A novel algorithmic scheme for numerical solution of the 3D Poisson-Nernst-Planck model is proposed. The algorithmic improvements are universal and independent of the detailed physical model. They include three major steps: an adjustable gradient-based step value, an adjustable relaxation coefficient, and an optimized segmentation of the modeled space. The enhanced algorithm significantly accelerates the speed of computation and reduces the computational demands. The theoretical model was tested on a regular artificial channel and validated on a real protein channel-alpha-hemolysin, proving its efficiency. (c) 2008 Wiley Periodicals, Inc.

Segmentation of magnetic resonance images using fuzzy algorithms for learning vector quantization.

PubMed

Karayiannis, N B; Pai, P I

1999-02-01

This paper evaluates a segmentation technique for magnetic resonance (MR) images of the brain based on fuzzy algorithms for learning vector quantization (FALVQ). These algorithms perform vector quantization by updating all prototypes of a competitive network through an unsupervised learning process. Segmentation of MR images is formulated as an unsupervised vector quantization process, where the local values of different relaxation parameters form the feature vectors which are represented by a relatively small set of prototypes. The experiments evaluate a variety of FALVQ algorithms in terms of their ability to identify different tissues and discriminate between normal tissues and abnormalities.

Diastolic chamber properties of the left ventricle assessed by global fitting of pressure-volume data: improving the gold standard of diastolic function.

PubMed

Bermejo, Javier; Yotti, Raquel; Pérez del Villar, Candelas; del Álamo, Juan C; Rodríguez-Pérez, Daniel; Martínez-Legazpi, Pablo; Benito, Yolanda; Antoranz, J Carlos; Desco, M Mar; González-Mansilla, Ana; Barrio, Alicia; Elízaga, Jaime; Fernández-Avilés, Francisco

2013-08-15

In cardiovascular research, relaxation and stiffness are calculated from pressure-volume (PV) curves by separately fitting the data during the isovolumic and end-diastolic phases (end-diastolic PV relationship), respectively. This method is limited because it assumes uncoupled active and passive properties during these phases, it penalizes statistical power, and it cannot account for elastic restoring forces. We aimed to improve this analysis by implementing a method based on global optimization of all PV diastolic data. In 1,000 Monte Carlo experiments, the optimization algorithm recovered entered parameters of diastolic properties below and above the equilibrium volume (intraclass correlation coefficients = 0.99). Inotropic modulation experiments in 26 pigs modified passive pressure generated by restoring forces due to changes in the operative and/or equilibrium volumes. Volume overload and coronary microembolization caused incomplete relaxation at end diastole (active pressure > 0.5 mmHg), rendering the end-diastolic PV relationship method ill-posed. In 28 patients undergoing PV cardiac catheterization, the new algorithm reduced the confidence intervals of stiffness parameters by one-fifth. The Jacobian matrix allowed visualizing the contribution of each property to instantaneous diastolic pressure on a per-patient basis. The algorithm allowed estimating stiffness from single-beat PV data (derivative of left ventricular pressure with respect to volume at end-diastolic volume intraclass correlation coefficient = 0.65, error = 0.07 ± 0.24 mmHg/ml). Thus, in clinical and preclinical research, global optimization algorithms provide the most complete, accurate, and reproducible assessment of global left ventricular diastolic chamber properties from PV data. Using global optimization, we were able to fully uncouple relaxation and passive PV curves for the first time in the intact heart.

Effective temperature in relaxation of Coulomb glasses.

PubMed

Somoza, A M; Ortuño, M; Caravaca, M; Pollak, M

2008-08-01

We study relaxation in two-dimensional Coulomb glasses up to macroscopic times. We use a kinetic Monte Carlo algorithm especially designed to escape efficiently from deep valleys around metastable states. We find that, during the relaxation process, the site occupancy follows a Fermi-Dirac distribution with an effective temperature much higher than the real temperature T. Long electron-hole excitations are characterized by T(eff), while short ones are thermalized at T. We argue that the density of states at the Fermi level is proportional to T(eff) and is a good thermometer to measure it. T(eff) decreases extremely slowly, roughly as the inverse of the logarithm of time, and it should affect hopping conductance in many experimental circumstances.

Bilirubin - urine

MedlinePlus

... Direct bilirubin - urine Images Male urinary system References Berk PD, Korenblat KM. Approach to the patient with ... Review Date 5/21/2017 Updated by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal ...

Heavy metals in the bottom sediments of the Furo of Laura estuary, Eastern Amazon, Brazil.

PubMed

Lima, M W; Santos, M L S; Faial, K C F; Freitas, E S; Lima, M O; Pereira, J A R; Cunha, I P R T

2017-05-15

The Furo of Laura is an economically important river in the Amazon estuary. Thus, in the present study, we evaluated the metal distribution (Al, Cd, Co, Cu, Cr, Fe, Ni, and Mg) in the bottom sediments of this river. The sediments were sampled at four points every 2months for a year with an Ekman-Birge sampler. After microwave acid digestion, the metal levels were determined by optical emission spectrometry with inductively coupled plasma. The particle size and organic matter content influenced the concentration of the metals. The sediments were not enriched by the analyzed metals; the estuary therefore retained the characteristics of an uncontaminated environment, thus serving as a reference environment for comparison. Copyright © 2017 Elsevier Ltd. All rights reserved.

Application of a flux-split algorithm to chemically relaxing, hypervelocity blunt-body flows

NASA Technical Reports Server (NTRS)

Balakrishnan, A.

1987-01-01

Viscous, nonequilibrium, hypervelocity flow fields over two axisymmetric configurations are numerically simulated using a factored, implicit, flux-split algorithm. The governing gas-dynamic and species-continuity equations for laminar flow are presented. The gas-dynamics/nonequilibrium-chemistry coupling procedure is developed as part of the solution procedure and is described in detail. Numerical solutions are presented for hypervelocity flows over a hemisphere and over an axisymmetric aeroassisted orbital transfer vehicle using three different chemistry models. The gas models considered are those for an ideal gas, for a frozen gas, and for chemically relaxing air consisting of five species. The calculated results are compared with existing numerical solutions in the literature along the stagnation line of the hemisphere. The effects of free-stream Reynolds number on the nonequilibrium flow field are discussed.

Separation analysis, a tool for analyzing multigrid algorithms

NASA Technical Reports Server (NTRS)

Costiner, Sorin; Taasan, Shlomo

1995-01-01

The separation of vectors by multigrid (MG) algorithms is applied to the study of convergence and to the prediction of the performance of MG algorithms. The separation operator for a two level cycle algorithm is derived. It is used to analyze the efficiency of the cycle when mixing of eigenvectors occurs. In particular cases the separation analysis reduces to Fourier type analysis. The separation operator of a two level cycle for a Schridubger eigenvalue problem, is derived and analyzed in a Fourier basis. Separation analysis gives information on how to choose performance relaxations and inter-level transfers. Separation analysis is a tool for analyzing and designing algorithms, and for optimizing their performance.

ALP - blood test

MedlinePlus

... Renal cell carcinoma Alternative Names Alkaline phosphatase References Berk PD, Korenblat KM. Approach to the patient with ... Review Date 5/21/2017 Updated by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal ...

ALP isoenzyme test

MedlinePlus

... Alkaline phosphatase isoenzyme test Images Blood test References Berk PD, Korenblat KM. Approach to the patient with ... Review Date 5/21/2017 Updated by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal ...

Paige Jadun | NREL

Science.gov Websites

dynamics. She has performed research in sustainable mobility, network optimization, supply chain analysis Experience Supply Chain Design Consultant, LLamasoft, Ann Arbor, MI Featured Publications Laura J

Adaptive optics retinal imaging with automatic detection of the pupil and its boundary in real time using Shack-Hartmann images.

PubMed

de Castro, Alberto; Sawides, Lucie; Qi, Xiaofeng; Burns, Stephen A

2017-08-20

Retinal imaging with an adaptive optics (AO) system usually requires that the eye be centered and stable relative to the exit pupil of the system. Aberrations are then typically corrected inside a fixed circular pupil. This approach can be restrictive when imaging some subjects, since the pupil may not be round and maintaining a stable head position can be difficult. In this paper, we present an automatic algorithm that relaxes these constraints. An image quality metric is computed for each spot of the Shack-Hartmann image to detect the pupil and its boundary, and the control algorithm is applied only to regions within the subject's pupil. Images on a model eye as well as for five subjects were obtained to show that a system exit pupil larger than the subject's eye pupil could be used for AO retinal imaging without a reduction in image quality. This algorithm automates the task of selecting pupil size. It also may relax constraints on centering the subject's pupil and on the shape of the pupil.

Deriving Quantitative Dynamics Information for Proteins and RNAs using ROTDIF with a Graphical User Interface

PubMed Central

Berlin, Konstantin; Longhini, Andrew; Dayie, T. Kwaku; Fushman, David

2013-01-01

To facilitate rigorous analysis of molecular motions in proteins, DNA, and RNA, we present a new version of ROTDIF, a program for determining the overall rotational diffusion tensor from single-or multiple-field Nuclear Magnetic Resonance (NMR) relaxation data. We introduce four major features that expand the program’s versatility and usability. The first feature is the ability to analyze, separately or together, 13C and/or 15N relaxation data collected at a single or multiple fields. A significant improvement in the accuracy compared to direct analysis of R2/R1 ratios, especially critical for analysis of 13C relaxation data, is achieved by subtracting high-frequency contributions to relaxation rates. The second new feature is an improved method for computing the rotational diffusion tensor in the presence of biased errors, such as large conformational exchange contributions, that significantly enhances the accuracy of the computation. The third new feature is the integration of the domain alignment and docking module for relaxation-based structure determination of multi-domain systems. Finally, to improve accessibility to all the program features, we introduced a graphical user interface (GUI) that simplifies and speeds up the analysis of the data. Written in Java, the new ROTDIF can run on virtually any computer platform. In addition, the new ROTDIF achieves an order of magnitude speedup over the previous version by implementing a more efficient deterministic minimization algorithm. We not only demonstrate the improvement in accuracy and speed of the new algorithm for synthetic and experimental 13C and 15N relaxation data for several proteins and nucleic acids, but also show that careful analysis required especially for characterizing RNA dynamics allowed us to uncover subtle conformational changes in RNA as a function of temperature that were opaque to previous analysis. PMID:24170368

Argonne Physics Division Colloquium

Science.gov Websites

and the birth of gravitational wave astronomy Host: Seamus Riordan 11 May 2018 18 May 2018 Laura University of Illinois at Chicago Physics Department Colloquia Northwestern University Physics and Astronomy

Living with Crohn's Disease

MedlinePlus

... courtesy of Laura King Benjamin King, star of Disney Channel's hit TV series Liv and Maddie , helps ... root in so many homes that watch the Disney Channel and have children—especially considering the number ...

Novel cooperative neural fusion algorithms for image restoration and image fusion.

PubMed

Xia, Youshen; Kamel, Mohamed S

2007-02-01

To deal with the problem of restoring degraded images with non-Gaussian noise, this paper proposes a novel cooperative neural fusion regularization (CNFR) algorithm for image restoration. Compared with conventional regularization algorithms for image restoration, the proposed CNFR algorithm can relax need of the optimal regularization parameter to be estimated. Furthermore, to enhance the quality of restored images, this paper presents a cooperative neural fusion (CNF) algorithm for image fusion. Compared with existing signal-level image fusion algorithms, the proposed CNF algorithm can greatly reduce the loss of contrast information under blind Gaussian noise environments. The performance analysis shows that the proposed two neural fusion algorithms can converge globally to the robust and optimal image estimate. Simulation results confirm that in different noise environments, the proposed two neural fusion algorithms can obtain a better image estimate than several well known image restoration and image fusion methods.

Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

DTIC Science & Technology

2016-10-11

Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization,” (W. Bian, X. Chen, and Ye), Math Programming, 149 (2015) 301-327...Chen, Ge, Wang, Ye), Math Programming, 143 (1-2) (2014) 371-383. This paper resolved an important open question in cardinality constrained...Statistical Performance, and Algorithmic Theory for Local Solutions,” (H. Liu, T. Yao, R. Li, Y. Ye) manuscript, 2nd revision in Math Programming

Relaxation model for extended magnetohydrodynamics: Comparison to magnetohydrodynamics for dense Z-pinches

DOE PAGES

Seyler, C. E.; Martin, M. R.

2011-01-14

In this study, it is shown that the two-fluid model under a generalized Ohm’s law formulation and the resistive magnetohydrodynamics (MHD) can both be described as relaxation systems. In the relaxation model, the under-resolved stiff source terms constrain the dynamics of a set of hyperbolic equations to give the correct asymptotic solution. When applied to the collisional two-fluid model, the relaxation of fast time scales associated with displacement current and finite electron mass allows for a natural transition from a system where Ohm’s law determines the current density to a system where Ohm’s law determines the electric field. This resultmore » is used to derive novel algorithms, which allow for multiscale simulation of low and high frequency extended-MHD physics. This relaxation formulation offers an efficient way to implicitly advance the Hall term and naturally simulate a plasma-vacuum interface without invoking phenomenological models. The relaxation model is implemented as an extended-MHD code, which is used to analyze pulsed power loads such as wire arrays and ablating foils. Two-dimensional simulations of pulsed power loads are compared for extended-MHD and MHD. For these simulations, it is also shown that the relaxation model properly recovers the resistive-MHD limit.« less

ACHP | Advisory Council on Historic Preservation News

Science.gov Websites

Preserve America Community Blackstone River Valley Towns and Cities Designated Newest Preserve America Understanding Blackstone River Valley Presents 24 Preserve America Community Applications to the ACHP Laura Bush

All equine vets should wear helmets.

PubMed

Shaw, Laura

2018-05-05

Laura Shaw argues that, due to the equine profession having the highest injury rate of all civilian professions, senior veterinary surgeons should take the lead in wearing helmets as routine. British Veterinary Association.

Instantaneous normal mode analysis of the vibrational relaxation of the amide I mode of alanine dipeptide in water.

PubMed

Farag, Marwa H; Zúñiga, José; Requena, Alberto; Bastida, Adolfo

2013-05-28

Nonequilibrium Molecular Dynamics (MD) simulations coupled to instantaneous normal modes (INMs) analysis are used to study the vibrational relaxation of the acetyl and amino-end amide I modes of the alanine dipeptide (AlaD) molecule dissolved in water (D2O). The INMs are assigned in terms of the equilibrium normal modes using the Effective Atomic Min-Cost algorithm as adapted to make use of the outputs of standard MD packages, a method which is well suited for the description of flexible molecules. The relaxation energy curves of both amide I modes show multiexponential decays, in good agreement with the experimental findings. It is found that ~85%-90% of the energy relaxes through intramolecular vibrational redistribution. The main relaxation pathways are also identified. The rate at which energy is transferred into the solvent is similar for the acetyl-end and amino-end amide I modes. The conformational changes occurring during relaxation are investigated, showing that the populations of the alpha and beta region conformers are altered by energy transfer in such a way that it takes 15 ps for the equilibrium conformational populations to be recovered after the initial excitation of the AlaD molecule.

A Coulomb collision algorithm for weighted particle simulations

NASA Technical Reports Server (NTRS)

Miller, Ronald H.; Combi, Michael R.

1994-01-01

A binary Coulomb collision algorithm is developed for weighted particle simulations employing Monte Carlo techniques. Charged particles within a given spatial grid cell are pair-wise scattered, explicitly conserving momentum and implicitly conserving energy. A similar algorithm developed by Takizuka and Abe (1977) conserves momentum and energy provided the particles are unweighted (each particle representing equal fractions of the total particle density). If applied as is to simulations incorporating weighted particles, the plasma temperatures equilibrate to an incorrect temperature, as compared to theory. Using the appropriate pairing statistics, a Coulomb collision algorithm is developed for weighted particles. The algorithm conserves energy and momentum and produces the appropriate relaxation time scales as compared to theoretical predictions. Such an algorithm is necessary for future work studying self-consistent multi-species kinetic transport.

Adapting the Home After a Stroke

MedlinePlus

... and the Program in Occupational Therapy at Washington University in St. Louis School of Medicine . The research ... the Leonard Davis School of Gerontology at the University of Southern California), with additional contributions from Laura ...

Combined LAURA-UPS solution procedure for chemically-reacting flows. M.S. Thesis

NASA Technical Reports Server (NTRS)

Wood, William A.

1994-01-01

A new procedure seeks to combine the thin-layer Navier-Stokes solver LAURA with the parabolized Navier-Stokes solver UPS for the aerothermodynamic solution of chemically-reacting air flowfields. The interface protocol is presented and the method is applied to two slender, blunted shapes. Both axisymmetric and three dimensional solutions are included with surface pressure and heat transfer comparisons between the present method and previously published results. The case of Mach 25 flow over an axisymmetric six degree sphere-cone with a noncatalytic wall is considered to 100 nose radii. A stability bound on the marching step size was observed with this case and is attributed to chemistry effects resulting from the noncatalytic wall boundary condition. A second case with Mach 28 flow over a sphere-cone-cylinder-flare configuration is computed at both two and five degree angles of attack with a fully-catalytic wall. Surface pressures are seen to be within five percent with the present method compared to the baseline LAURA solution and heat transfers are within 10 percent. The effect of grid resolution is investigated and the nonequilibrium results are compared with a perfect gas solution, showing that while the surface pressure is relatively unchanged by the inclusion of reacting chemistry the nonequilibrium heating is 25 percent higher. The procedure demonstrates significant, order of magnitude reductions in solution time and required memory for the three dimensional case over an all thin-layer Navier-Stokes solution.

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.

PubMed

Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

2013-01-01

We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.

SALUTE Grid Application using Message-Oriented Middleware

NASA Astrophysics Data System (ADS)

Atanassov, E.; Dimitrov, D. Sl.; Gurov, T.

2009-10-01

Stochastic ALgorithms for Ultra-fast Transport in sEmiconductors (SALUTE) is a grid application developed for solving various computationally intensive problems which describe ultra-fast carrier transport in semiconductors. SALUTE studies memory and quantum effects during the relaxation process due to electronphonon interaction in one-band semiconductors or quantum wires. Formally, SALUTE integrates a set of novel Monte Carlo, quasi-Monte Carlo and hybrid algorithms for solving various computationally intensive problems which describe the femtosecond relaxation process of optically excited carriers in one-band semiconductors or quantum wires. In this paper we present application-specific job submission and reservation management tool named a Job Track Server (JTS). It is developed using Message-Oriented middleware to implement robust, versatile job submission and tracing mechanism, which can be tailored to application specific failover and quality of service requirements. Experience from using the JTS for submission of SALUTE jobs is presented.

Distributed resource allocation under communication constraints

NASA Astrophysics Data System (ADS)

Dodin, Pierre; Nimier, Vincent

2001-03-01

This paper deals with a study of the multi-sensor management problem for multi-target tracking. The collaboration between many sensors observing the same target means that they are able to fuse their data during the information process. Then one must take into account this possibility to compute the optimal association sensors-target at each step of time. In order to solve this problem for real large scale system, one must both consider the information aspect and the control aspect of the problem. To unify these problems, one possibility is to use a decentralized filtering algorithm locally driven by an assignment algorithm. The decentralized filtering algorithm we use in our model is the filtering algorithm of Grime, which relaxes the usual full-connected hypothesis. By full-connected, one means that the information in a full-connected system is totally distributed everywhere at the same moment, which is unacceptable for a real large scale system. We modelize the distributed assignment decision with the help of a greedy algorithm. Each sensor performs a global optimization, in order to estimate other information sets. A consequence of the relaxation of the full- connected hypothesis is that the sensors' information set are not the same at each step of time, producing an information dis- symmetry in the system. The assignment algorithm uses a local knowledge of this dis-symmetry. By testing the reactions and the coherence of the local assignment decisions of our system, against maneuvering targets, we show that it is still possible to manage with decentralized assignment control even though the system is not full-connected.

Numerical evaluation of the intensity transport equation for well-known wavefronts and intensity distributions

NASA Astrophysics Data System (ADS)

Campos-García, Manuel; Granados-Agustín, Fermín.; Cornejo-Rodríguez, Alejandro; Estrada-Molina, Amilcar; Avendaño-Alejo, Maximino; Moreno-Oliva, Víctor Iván.

2013-11-01

In order to obtain a clearer interpretation of the Intensity Transport Equation (ITE), in this work, we propose an algorithm to solve it for some particular wavefronts and its corresponding intensity distributions. By simulating intensity distributions in some planes, the ITE is turns into a Poisson equation with Neumann boundary conditions. The Poisson equation is solved by means of the iterative algorithm SOR (Simultaneous Over-Relaxation).

Differentially Private Frequent Sequence Mining via Sampling-based Candidate Pruning

PubMed Central

Xu, Shengzhi; Cheng, Xiang; Li, Zhengyi; Xiong, Li

2016-01-01

In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively reduce the number of unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose a novel differentially private FSM algorithm, which is referred to as PFS2. The core of our algorithm is to utilize sample databases to further prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which sequences are potentially frequent. To improve the accuracy of such private estimations, a sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS2 algorithm is ε-differentially private. Extensive experiments on real datasets illustrate that our PFS2 algorithm can privately find frequent sequences with high accuracy. PMID:26973430

A resolution honoring the life and legacy of Laura Pollan.

THOMAS, 112th Congress

Sen. Rubio, Marco [R-FL

2011-12-01

Senate - 02/14/2012 Placed on Senate Legislative Calendar under General Orders. Calendar No. 321. (All Actions) Tracker: This bill has the status IntroducedHere are the steps for Status of Legislation:

Laura Jackson, Ph.D.

EPA Pesticide Factsheets

Research Biologist with the EPA. Her current work involves linking natural and built infrastructure to human health and well-being at multiple spatial scales, in order to develop interpretive maps and analytical tools for an interactive, web-based Atlas.

Numerical simulation of a relaxation test designed to fit a quasi-linear viscoelastic model for temporomandibular joint discs.

PubMed

Commisso, Maria S; Martínez-Reina, Javier; Mayo, Juana; Domínguez, Jaime

2013-02-01

The main objectives of this work are: (a) to introduce an algorithm for adjusting the quasi-linear viscoelastic model to fit a material using a stress relaxation test and (b) to validate a protocol for performing such tests in temporomandibular joint discs. This algorithm is intended for fitting the Prony series coefficients and the hyperelastic constants of the quasi-linear viscoelastic model by considering that the relaxation test is performed with an initial ramp loading at a certain rate. This algorithm was validated before being applied to achieve the second objective. Generally, the complete three-dimensional formulation of the quasi-linear viscoelastic model is very complex. Therefore, it is necessary to design an experimental test to ensure a simple stress state, such as uniaxial compression to facilitate obtaining the viscoelastic properties. This work provides some recommendations about the experimental setup, which are important to follow, as an inadequate setup could produce a stress state far from uniaxial, thus, distorting the material constants determined from the experiment. The test considered is a stress relaxation test using unconfined compression performed in cylindrical specimens extracted from temporomandibular joint discs. To validate the experimental protocol, the test was numerically simulated using finite-element modelling. The disc was arbitrarily assigned a set of quasi-linear viscoelastic constants (c1) in the finite-element model. Another set of constants (c2) was obtained by fitting the results of the simulated test with the proposed algorithm. The deviation of constants c2 from constants c1 measures how far the stresses are from the uniaxial state. The effects of the following features of the experimental setup on this deviation have been analysed: (a) the friction coefficient between the compression plates and the specimen (which should be as low as possible); (b) the portion of the specimen glued to the compression plates (smaller areas glued are better); and (c) the variation in the thickness of the specimen. The specimen's faces should be parallel to ensure a uniaxial stress state. However, this is not possible in real specimens, and a criterion must be defined to accept the specimen in terms of the specimen's thickness variation and the deviation of the fitted constants arising from such a variation.

Bounded-Degree Approximations of Stochastic Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identifymore » the r-best approximations among these classes, enabling robust decision making.« less

Three-dimensional particle tracking velocimetry algorithm based on tetrahedron vote

NASA Astrophysics Data System (ADS)

Cui, Yutong; Zhang, Yang; Jia, Pan; Wang, Yuan; Huang, Jingcong; Cui, Junlei; Lai, Wing T.

2018-02-01

A particle tracking velocimetry algorithm based on tetrahedron vote, which is named TV-PTV, is proposed to overcome the limited selection problem of effective algorithms for 3D flow visualisation. In this new cluster-matching algorithm, tetrahedrons produced by the Delaunay tessellation are used as the basic units for inter-frame matching, which results in a simple algorithmic structure of only two independent preset parameters. Test results obtained using the synthetic test image data from the Visualisation Society of Japan show that TV-PTV presents accuracy comparable to that of the classical algorithm based on new relaxation method (NRX). Compared with NRX, TV-PTV possesses a smaller number of loops in programming and thus a shorter computing time, especially for large particle displacements and high particle concentration. TV-PTV is confirmed practically effective using an actual 3D wake flow.

Curvilinear immersed boundary method for simulating fluid structure interaction with complex 3D rigid bodies

NASA Astrophysics Data System (ADS)

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2008-08-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A numerical method for solving the 3D unsteady incompressible Navier-Stokes equations in curvilinear domains with complex immersed boundaries, Journal of Computational Physics 225 (2007) 1782-1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions the FSI algorithm is unconditionally unstable even when strong coupling FSI is employed. For such cases, however, combining the strong coupling iteration with under-relaxation in conjunction with the Aitken's acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and the upper bound of the under-relaxation coefficient, required for stability, is derived.

Location estimation in wireless sensor networks using spring-relaxation technique.

PubMed

Zhang, Qing; Foh, Chuan Heng; Seet, Boon-Chong; Fong, A C M

2010-01-01

Accurate and low-cost autonomous self-localization is a critical requirement of various applications of a large-scale distributed wireless sensor network (WSN). Due to its massive deployment of sensors, explicit measurements based on specialized localization hardware such as the Global Positioning System (GPS) is not practical. In this paper, we propose a low-cost WSN localization solution. Our design uses received signal strength indicators for ranging, light weight distributed algorithms based on the spring-relaxation technique for location computation, and the cooperative approach to achieve certain location estimation accuracy with a low number of nodes with known locations. We provide analysis to show the suitability of the spring-relaxation technique for WSN localization with cooperative approach, and perform simulation experiments to illustrate its accuracy in localization.

Caregiving: It Takes a Village | NIH MedlinePlus the Magazine

MedlinePlus

... members, as an affordable caregiving option. Laura Gitlin, Ph.D., has been funded by NIH’s National Institute on Aging (NIA) for various trials that test ways to support family caregivers and informal caregivers. ...

ARC-2006-ACD06-0091-010

NASA Image and Video Library

2006-06-05

Space shuttle STS-121 FIT (Fly Immunity and Tumors) payload. Using Drosophila (fruit fly) to complete the experiments. Here we have sample preparation for post flight analysis of Drosophila (fruit fly) larva with Oana Marcu and Laura Higgins

U.S. Department of Defense Official Website

Science.gov Websites

the President George W. Bush, his wife Laura, Vice-President Richard Cheney and his wife Lynne, to . Defense Dept. photo by Kathleen T. Rhem President George W. Bush delivers his inaugural address during the

78 FR 1143 - Explosive Siting Requirements; Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-08

... launch site operators in site planning for the storage and handling of energetic liquids and explosives...: For technical questions concerning this final rule, contact Yvonne Tran, Commercial Space... this final rule, contact Laura Montgomery, AGC 200, [[Page 1144

Mrs. Laura Bush Announces First Preserve America Grant Recipients,

Science.gov Websites

Preservation; the U.S. Departments of Defense, Interior, Agriculture, Commerce, Housing and Urban Development . Department of Commerce seal U.S. Department of Agriculture logo U.S. Department of Housing and Urban

Enhancing Web applications in radiology with Java: estimating MR imaging relaxation times.

PubMed

Dagher, A P; Fitzpatrick, M; Flanders, A E; Eng, J

1998-01-01

Java is a relatively new programming language that has been used to develop a World Wide Web-based tool for estimating magnetic resonance (MR) imaging relaxation times, thereby demonstrating how Java may be used for Web-based radiology applications beyond improving the user interface of teaching files. A standard processing algorithm coded with Java is downloaded along with the hypertext markup language (HTML) document. The user (client) selects the desired pulse sequence and inputs data obtained from a region of interest on the MR images. The algorithm is used to modify selected MR imaging parameters in an equation that models the phenomenon being evaluated. MR imaging relaxation times are estimated, and confidence intervals and a P value expressing the accuracy of the final results are calculated. Design features such as simplicity, object-oriented programming, and security restrictions allow Java to expand the capabilities of HTML by offering a more versatile user interface that includes dynamic annotations and graphics. Java also allows the client to perform more sophisticated information processing and computation than is usually associated with Web applications. Java is likely to become a standard programming option, and the development of stand-alone Java applications may become more common as Java is integrated into future versions of computer operating systems.

Migration of dispersive GPR data

USGS Publications Warehouse

Powers, M.H.; Oden, C.P.; ,

2004-01-01

Electrical conductivity and dielectric and magnetic relaxation phenomena cause electromagnetic propagation to be dispersive in earth materials. Both velocity and attenuation may vary with frequency, depending on the frequency content of the propagating energy and the nature of the relaxation phenomena. A minor amount of velocity dispersion is associated with high attenuation. For this reason, measuring effects of velocity dispersion in ground penetrating radar (GPR) data is difficult. With a dispersive forward model, GPR responses to propagation through materials with known frequency-dependent properties have been created. These responses are used as test data for migration algorithms that have been modified to handle specific aspects of dispersive media. When either Stolt or Gazdag migration methods are modified to correct for just velocity dispersion, the results are little changed from standard migration. For nondispersive propagating wavefield data, like deep seismic, ensuring correct phase summation in a migration algorithm is more important than correctly handling amplitude. However, the results of migrating model responses to dispersive media with modified algorithms indicate that, in this case, correcting for frequency-dependent amplitude loss has a much greater effect on the result than correcting for proper phase summation. A modified migration is only effective when it includes attenuation recovery, performing deconvolution and migration simultaneously.

Sparse approximation problem: how rapid simulated annealing succeeds and fails

NASA Astrophysics Data System (ADS)

Obuchi, Tomoyuki; Kabashima, Yoshiyuki

2016-03-01

Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the sparse approximation. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing works well in a reasonable parameter region: the planted solution is found fairly rapidly. This is true even in the case where a common relaxation of the sparse approximation problem, the G-relaxation, is ineffective. On the other hand, when the dimensionality of the data is close to the number of non-zero components, another metastable state emerges, and our algorithm fails to find the planted solution. This phenomenon is associated with a first-order phase transition. In the case of very strong noise, it is no longer meaningful to search for the planted solution. In this situation, our algorithm determines a solution with close-to-minimum distortion fairly quickly.

Taming the Wild: A Unified Analysis of Hogwild!-Style Algorithms.

PubMed

De Sa, Christopher; Zhang, Ce; Olukotun, Kunle; Ré, Christopher

2015-12-01

Stochastic gradient descent (SGD) is a ubiquitous algorithm for a variety of machine learning problems. Researchers and industry have developed several techniques to optimize SGD's runtime performance, including asynchronous execution and reduced precision. Our main result is a martingale-based analysis that enables us to capture the rich noise models that may arise from such techniques. Specifically, we use our new analysis in three ways: (1) we derive convergence rates for the convex case (Hogwild!) with relaxed assumptions on the sparsity of the problem; (2) we analyze asynchronous SGD algorithms for non-convex matrix problems including matrix completion; and (3) we design and analyze an asynchronous SGD algorithm, called Buckwild!, that uses lower-precision arithmetic. We show experimentally that our algorithms run efficiently for a variety of problems on modern hardware.

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

NASA Technical Reports Server (NTRS)

Barnard, Stephen T.; Pothen, Alex; Simon, Horst D.

1993-01-01

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Finite-element time-domain algorithms for modeling linear Debye and Lorentz dielectric dispersions at low frequencies.

PubMed

Stoykov, Nikolay S; Kuiken, Todd A; Lowery, Madeleine M; Taflove, Allen

2003-09-01

We present what we believe to be the first algorithms that use a simple scalar-potential formulation to model linear Debye and Lorentz dielectric dispersions at low frequencies in the context of finite-element time-domain (FETD) numerical solutions of electric potential. The new algorithms, which permit treatment of multiple-pole dielectric relaxations, are based on the auxiliary differential equation method and are unconditionally stable. We validate the algorithms by comparison with the results of a previously reported method based on the Fourier transform. The new algorithms should be useful in calculating the transient response of biological materials subject to impulsive excitation. Potential applications include FETD modeling of electromyography, functional electrical stimulation, defibrillation, and effects of lightning and impulsive electric shock.

Radiation Coupling with the FUN3D Unstructured-Grid CFD Code

NASA Technical Reports Server (NTRS)

Wood, William A.

2012-01-01

The HARA radiation code is fully-coupled to the FUN3D unstructured-grid CFD code for the purpose of simulating high-energy hypersonic flows. The radiation energy source terms and surface heat transfer, under the tangent slab approximation, are included within the fluid dynamic ow solver. The Fire II flight test, at the Mach-31 1643-second trajectory point, is used as a demonstration case. Comparisons are made with an existing structured-grid capability, the LAURA/HARA coupling. The radiative surface heat transfer rates from the present approach match the benchmark values within 6%. Although radiation coupling is the focus of the present work, convective surface heat transfer rates are also reported, and are seen to vary depending upon the choice of mesh connectivity and FUN3D ux reconstruction algorithm. On a tetrahedral-element mesh the convective heating matches the benchmark at the stagnation point, but under-predicts by 15% on the Fire II shoulder. Conversely, on a mixed-element mesh the convective heating over-predicts at the stagnation point by 20%, but matches the benchmark away from the stagnation region.

77 FR 25210 - Advisors Series Trust and Orinda Asset Management, LLC; Notice of Application

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-27

.... FOR FURTHER INFORMATION CONTACT: Laura L. Solomon, Senior Counsel, at (202) 551-6915, or Jennifer L..., and the four managing partners of the Advisor each have a minority interest in the Advisor. The...

75 FR 17928 - Nisso America, Inc.; Filing of Food Additive Petition

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-08

... dietary supplements. FOR FURTHER INFORMATION CONTACT: Laura Dye, Center for Food Safety and Applied... from 145 cPs to 10 cPs and to permit its use as a binder in dietary supplements. The agency has...

Preserve America News

Science.gov Websites

Communities Designated; Applications Available Preserve America Stewards Honored Preserve America Grants historic structures and assets. 736 Communities Designated; Applications Available 736 Communities Designated; Applications Available Just before leaving the White House, former First Lady Mrs. Laura Bush

77 FR 59114 - Cyazofamid; Pesticide Tolerances

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-26

...; Pesticide Tolerances AGENCY: Environmental Protection Agency (EPA). ACTION: Final rule. SUMMARY: This....regulations.gov or at the Office of Pesticide Programs Regulatory Public Docket (OPP Docket) in the... CONTACT: Laura Nollen, Registration Division (7505P), Office of Pesticide Programs, Environmental...

76 FR 11337 - Presidential Library Facilities; Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-02

... Presidential Library Facilities; Correction AGENCY: National Archives and Records Administration. ACTION... and design standards for Presidential libraries and information required in NARA's reports to Congress... Presidential library. DATES: This regulation is effective March 2, 2011. FOR FURTHER INFORMATION CONTACT: Laura...

Feminist Film Theory and Criticism.

ERIC Educational Resources Information Center

Mayne, Judith

1985-01-01

Discusses Laura Mulvey's 1975 essay, "Visual Pleasure and Narrative Cinema," and the ideas about feminist film theory and psychoanalysis as a critical tool which it raises. Suggests contradiction is the central issue in feminist film theory. Explores definitions of women's cinema. (SA)

Teacher is Space participant Christa McAuliffe during suite/hygiene briefing

NASA Technical Reports Server (NTRS)

1985-01-01

Teacher is Space participant Christa McAuliffe (right) is briefed on her suit and on personal hygiene equipment to be used on the STS 51-L mission. The briefing was conducted by Laura Louviere (center).

Women and Mathematics in the Time of Euler

ERIC Educational Resources Information Center

Mayfield, Betty

2013-01-01

We explore mathematics written both by and for women in eighteenth-century Europe, and some of the interesting personalities involved: Maria Agnesi, Emilie du Chatelet, Laura Bassi, Princess Charlotte Ludovica Luisa, John Colson, Francesco Algarotti, and Leonhard Euler himself.

The attitudes and beliefs of a female science teacher: Implications in relation to gender and pedagogical practice

NASA Astrophysics Data System (ADS)

Zapata, Mara

In this case study of a female science teacher named Laura, numerous observations, field notes, researcher interpretations, and assertions were developed. As meanings were negotiated, intent of actions was defined using significant statements, clustered to produce invariant meaning units. Both the participant's intents and how she interpreted her experiences were central to the understandings sought in this study. Whenever Laura planned for teaching science, taught, or otherwise interacted with students, the following four themes seemed to frame her actions: (1) Responsibility to Nurture/Mother/Mentor (2) Connecting to and Relating (3) Meeting Gender-Specific Expectations (4) Promoting the Fighter/Survivor Within. Each theme is examined in relation to attitudes and beliefs about teaching and learning science, and conclusions and assertions are expressed. The findings of this study point to the tensions between Laura's attitudes and beliefs and her pedagogical practices, disconfirming these as they pertain to gender in relation to teaching and learning science. It was not evident as part of her daily practice that student experiences were used in an attempt to create connections between their lives and science, although Laura always emphasized that science is a way of life. The findings support questioning the role of intentionality and a teacher's perceived ability to adhere to intentions while practicing within the norms established by the social institution of schools operating within the larger structures of society. The major findings and implications are relevant to the manner teachers are prepared and encouraged to enact their practice by departments and boards of education, prepared by institutions of higher education and subsequent participation in professional development. Specifically, calling attention to how these educational frameworks emphasize or de-emphasize the role of teachers and promote cognizance in terms of the culture of schools, reflective of the larger structures of society. Understanding the larger social structures and manner in which science in particular is formally packaged with its hegemonic reality and power arrangements reflective of such society is important if teachers are going to enact their practice in ways that facilitate this understanding to students. A lack of this understanding implicates that teachers enter the classroom without having developed a critical consciousness about societal structures and about schools as reproducers of the social and gender inequalities pervasive in society. (Abstract shortened by UMI.)

Scheduled Relaxation Jacobi method: Improvements and applications

NASA Astrophysics Data System (ADS)

Adsuara, J. E.; Cordero-Carrión, I.; Cerdá-Durán, P.; Aloy, M. A.

2016-09-01

Elliptic partial differential equations (ePDEs) appear in a wide variety of areas of mathematics, physics and engineering. Typically, ePDEs must be solved numerically, which sets an ever growing demand for efficient and highly parallel algorithms to tackle their computational solution. The Scheduled Relaxation Jacobi (SRJ) is a promising class of methods, atypical for combining simplicity and efficiency, that has been recently introduced for solving linear Poisson-like ePDEs. The SRJ methodology relies on computing the appropriate parameters of a multilevel approach with the goal of minimizing the number of iterations needed to cut down the residuals below specified tolerances. The efficiency in the reduction of the residual increases with the number of levels employed in the algorithm. Applying the original methodology to compute the algorithm parameters with more than 5 levels notably hinders obtaining optimal SRJ schemes, as the mixed (non-linear) algebraic-differential system of equations from which they result becomes notably stiff. Here we present a new methodology for obtaining the parameters of SRJ schemes that overcomes the limitations of the original algorithm and provide parameters for SRJ schemes with up to 15 levels and resolutions of up to 215 points per dimension, allowing for acceleration factors larger than several hundreds with respect to the Jacobi method for typical resolutions and, in some high resolution cases, close to 1000. Most of the success in finding SRJ optimal schemes with more than 10 levels is based on an analytic reduction of the complexity of the previously mentioned system of equations. Furthermore, we extend the original algorithm to apply it to certain systems of non-linear ePDEs.

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

Cavity control as a new quantum algorithms implementation treatment

NASA Astrophysics Data System (ADS)

AbuGhanem, M.; Homid, A. H.; Abdel-Aty, M.

2018-02-01

Based on recent experiments [ Nature 449, 438 (2007) and Nature Physics 6, 777 (2010)], a new approach for realizing quantum gates for the design of quantum algorithms was developed. Accordingly, the operation times of such gates while functioning in algorithm applications depend on the number of photons present in their resonant cavities. Multi-qubit algorithms can be realized in systems in which the photon number is increased slightly over the qubit number. In addition, the time required for operation is considerably less than the dephasing and relaxation times of the systems. The contextual use of the photon number as a main control in the realization of any algorithm was demonstrated. The results indicate the possibility of a full integration into the realization of multi-qubit multiphoton states and its application in algorithm designs. Furthermore, this approach will lead to a successful implementation of these designs in future experiments.

Unweighted least squares phase unwrapping by means of multigrid techniques

NASA Astrophysics Data System (ADS)

Pritt, Mark D.

1995-11-01

We present a multigrid algorithm for unweighted least squares phase unwrapping. This algorithm applies Gauss-Seidel relaxation schemes to solve the Poisson equation on smaller, coarser grids and transfers the intermediate results to the finer grids. This approach forms the basis of our multigrid algorithm for weighted least squares phase unwrapping, which is described in a separate paper. The key idea of our multigrid approach is to maintain the partial derivatives of the phase data in separate arrays and to correct these derivatives at the boundaries of the coarser grids. This maintains the boundary conditions necessary for rapid convergence to the correct solution. Although the multigrid algorithm is an iterative algorithm, we demonstrate that it is nearly as fast as the direct Fourier-based method. We also describe how to parallelize the algorithm for execution on a distributed-memory parallel processor computer or a network-cluster of workstations.

Typical performance of approximation algorithms for NP-hard problems

NASA Astrophysics Data System (ADS)

Takabe, Satoshi; Hukushima, Koji

2016-11-01

Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linear-programming relaxation, loopy-belief propagation, and the leaf-removal algorithm. The former two algorithms are analyzed using a statistical-mechanical technique, whereas the average-case analysis of the last one is conducted using the generating function method. These algorithms have a threshold in the typical performance with increasing average degree of the random graph, below which they find true optimal solutions with high probability. Our study reveals that there exist only three cases, determined by the order of the typical performance thresholds. In addition, we provide some conditions for classification of the graph ensembles and demonstrate explicitly some examples for the difference in thresholds.

Charge Relaxation Dynamics of an Electrolytic Nanocapacitor

PubMed Central

2015-01-01

Understanding ion relaxation dynamics in overlapping electric double layers (EDLs) is critical for the development of efficient nanotechnology-based electrochemical energy storage, electrochemomechanical energy conversion, and bioelectrochemical sensing devices as well as the controlled synthesis of nanostructured materials. Here, a lattice Boltzmann (LB) method is employed to simulate an electrolytic nanocapacitor subjected to a step potential at t = 0 for various degrees of EDL overlap, solvent viscosities, ratios of cation-to-anion diffusivity, and electrode separations. The use of a novel continuously varying and Galilean-invariant molecular-speed-dependent relaxation time (MSDRT) with the LB equation recovers a correct microscopic description of the molecular-collision phenomena and enhances the stability of the LB algorithm. Results for large EDL overlaps indicated oscillatory behavior for the ionic current density, in contrast to monotonic relaxation to equilibrium for low EDL overlaps. Further, at low solvent viscosities and large EDL overlaps, anomalous plasmalike spatial oscillations of the electric field were observed that appeared to be purely an effect of nanoscale confinement. Employing MSDRT in our simulations enabled modeling of the fundamental physics of the transient charge relaxation dynamics in electrochemical systems operating away from equilibrium wherein Nernst–Einstein relation is known to be violated. PMID:25678941

Relaxation of selection, niche construction, and the Baldwin effect in language evolution.

PubMed

Yamauchi, Hajime; Hashimoto, Takashi

2010-01-01

Deacon has suggested that one of the key factors of language evolution is not characterized by an increase in genetic contribution, often known as the Baldwin effect, but rather by a decrease. This process effectively increases linguistic learning capability by organizing a novel synergy of multiple lower-order functions previously irrelevant to the process of language acquisition. Deacon posits that this transition is not caused by natural selection. Rather, it is due to the relaxation of natural selection. While there are some cases in which relaxation caused by some external factors indeed induces the transition, we do not know what kind of relaxation has worked in language evolution. In this article, a genetic-algorithm-based computer simulation is used to investigate how the niche-constructing aspect of linguistic behavior may trigger the degradation of genetic predisposition related to language learning. The results show that agents initially increase their genetic predisposition for language learning—the Baldwin effect. They create a highly uniform sociolinguistic environment—a linguistic niche construction. This means that later generations constantly receive very similar inputs from adult agents, and subsequently the selective pressure to retain the genetic predisposition is relaxed.

Iterative algorithm for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution

NASA Astrophysics Data System (ADS)

Quan, Haiyang; Wu, Fan; Hou, Xi

2015-10-01

New method for reconstructing rotationally asymmetric surface deviation with pixel-level spatial resolution is proposed. It is based on basic iterative scheme and accelerates the Gauss-Seidel method by introducing an acceleration parameter. This modified Successive Over-relaxation (SOR) is effective for solving the rotationally asymmetric components with pixel-level spatial resolution, without the usage of a fitting procedure. Compared to the Jacobi and Gauss-Seidel method, the modified SOR method with an optimal relaxation factor converges much faster and saves more computational costs and memory space without reducing accuracy. It has been proved by real experimental results.

Aspects and applications of patched grid calculations

NASA Technical Reports Server (NTRS)

Walters, R. W.; Switzer, G. F.; Thomas, J. L.

1986-01-01

Patched grid calculations within the framework of an implicit, flux-vector split upwind/relaxation algorithm for the Euler equations are presented. The effect of a metric-discontinuous interface on the convergence rate of the algorithm is discussed along with the spatial accuracy of the solution and the effect of curvature along an interface. Results are presented and discussed for the free-stream problem, shock reflection problem, supersonic inlet with a 5 degree ramp, aerodynamically choked inlet, and three-dimensional analytic forebody.

Characteristic-based algorithms for flows in thermo-chemical nonequilibrium

NASA Technical Reports Server (NTRS)

Walters, Robert W.; Cinnella, Pasquale; Slack, David C.; Halt, David

1990-01-01

A generalized finite-rate chemistry algorithm with Steger-Warming, Van Leer, and Roe characteristic-based flux splittings is presented in three-dimensional generalized coordinates for the Navier-Stokes equations. Attention is placed on convergence to steady-state solutions with fully coupled chemistry. Time integration schemes including explicit m-stage Runge-Kutta, implicit approximate-factorization, relaxation and LU decomposition are investigated and compared in terms of residual reduction per unit of CPU time. Practical issues such as code vectorization and memory usage on modern supercomputers are discussed.

A conservative finite difference algorithm for the unsteady transonic potential equation in generalized coordinates

NASA Technical Reports Server (NTRS)

Bridgeman, J. O.; Steger, J. L.; Caradonna, F. X.

1982-01-01

An implicit, approximate-factorization, finite-difference algorithm has been developed for the computation of unsteady, inviscid transonic flows in two and three dimensions. The computer program solves the full-potential equation in generalized coordinates in conservation-law form in order to properly capture shock-wave position and speed. A body-fitted coordinate system is employed for the simple and accurate treatment of boundary conditions on the body surface. The time-accurate algorithm is modified to a conventional ADI relaxation scheme for steady-state computations. Results from two- and three-dimensional steady and two-dimensional unsteady calculations are compared with existing methods.

Osmotic diuresis

MedlinePlus

... disorders. In: Marx JA, Hockberger RS, Walls RM, et al, eds. Rosen's Emergency Medicine: Concepts and Clinical Practice . 8th ed. Philadelphia, PA: Elsevier Saunders; 2014:chap 125. Review Date 8/22/2016 Updated by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal Medicine ...

78 FR 36011 - Notice of Senior Executive Service Performance Review Board Membership

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-14

... Min* Van Nguyen DeBorah Russell Vance Teel Amy Thompson* Laura Train* *New Member Reginald F. Wells, Deputy Commissioner for Human Resources. [FR Doc. 2013-14200 Filed 6-13-13; 8:45 am] BILLING CODE 4191-02...

Instructional Technology. IDRA Focus.

ERIC Educational Resources Information Center

IDRA Newsletter, 1997

1997-01-01

This theme issue includes five articles that focus on implementing instructional technology in ways that benefit all students, including limited-English-proficient, minority, economically disadvantaged, and at-risk students. "Cruising the Web with English Language Learners" (Laura Chris Green) presents three scenarios using the World…

Iterated local search algorithm for solving the orienteering problem with soft time windows.

PubMed

Aghezzaf, Brahim; Fahim, Hassan El

2016-01-01

In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.

Multi-Stage Convex Relaxation Methods for Machine Learning

DTIC Science & Technology

2013-03-01

Many problems in machine learning can be naturally formulated as non-convex optimization problems. However, such direct nonconvex formulations have...original nonconvex formulation. We will develop theoretical properties of this method and algorithmic consequences. Related convex and nonconvex machine learning methods will also be investigated.

A numerical model for predicting crack path and modes of damage in unidirectional metal matrix composites

NASA Technical Reports Server (NTRS)

Bakuckas, J. G.; Tan, T. M.; Lau, A. C. W.; Awerbuch, J.

1993-01-01

A finite element-based numerical technique has been developed to simulate damage growth in unidirectional composites. This technique incorporates elastic-plastic analysis, micromechanics analysis, failure criteria, and a node splitting and node force relaxation algorithm to create crack surfaces. Any combination of fiber and matrix properties can be used. One of the salient features of this technique is that damage growth can be simulated without pre-specifying a crack path. In addition, multiple damage mechanisms in the forms of matrix cracking, fiber breakage, fiber-matrix debonding and plastic deformation are capable of occurring simultaneously. The prevailing failure mechanism and the damage (crack) growth direction are dictated by the instantaneous near-tip stress and strain fields. Once the failure mechanism and crack direction are determined, the crack is advanced via the node splitting and node force relaxation algorithm. Simulations of the damage growth process in center-slit boron/aluminum and silicon carbide/titanium unidirectional specimens were performed. The simulation results agreed quite well with the experimental observations.

KSC-02pd1680

NASA Image and Video Library

2002-11-07

KENNEDY SPACE CENTER, FLA. -- New methods of environmental cleanup are explained during a presentation to government and business representatives, scientists and engineers at Launch Complex 34-A, Cape Canaveral Spaceport. At left is Laura Filipek, a University of Central Florida graduate chemistry student involved in the science.

Math and Science. IDRA Focus.

ERIC Educational Resources Information Center

IDRA Newsletter, 1995

1995-01-01

This theme issue contains six articles on improving math and science education for minority group students, particularly language-minority students. "Accelerating Content Area Gains for English Language Learners" (Laura Chris Green) describes the Young Scientists Acquiring English project, which seeks to improve the content-area…

SHORTER MENSTRUAL CYCLES ASSOCIATED WITH CHLORINATION BY-PRODUCTS IN DRINKING WATER

EPA Science Inventory

Shorter Menstrual Cycles Associated with Chlorination by-Products in Drinking Water.
Gayle Windham, Kirsten Waller, Meredith Anderson, Laura Fenster, Pauline Mendola, Shanna Swan. California Department of Health Services.

In previous studies of tap water consumption we...

77 FR 553 - Surety Companies Acceptable on Federal Bonds: Termination; Western Bonding Company

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-05

.... Department of the Treasury, Financial Management Service, Financial Accounting and Services Division, Surety..., 2011. Laura Carrico, Director, Financial Accounting and Services Division, Financial Management Service...: Termination; Western Bonding Company AGENCY: Financial Management Service, Fiscal Service, Department of the...

Preserve America News

Science.gov Websites

and Humanities; and the President's Council on Environmental Quality. The seal of the President of the Development logo Mrs. Laura Bush Announces Bipartisan Historic Preservation Legislation October 31, 2007 America and Save America's Treasures, announced introduction of bipartisan legislation authorizing two

76 FR 45303 - ING Asia Pacific High Dividend Equity Income Fund, et al.; Notice of Application

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-28

... 20006. FOR FURTHER INFORMATION CONTACT: Laura L. Solomon, Senior Counsel, at (202) 551-6915, or Daniele... meeting or within four months of the last day of such 12-week rolling period, the Board, including a...

78 FR 51740 - Agency Information Collection Activities: Comment Request

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-21

... information collection, Registry of Climate Change Vulnerability Assessments. SUMMARY: We (the U.S. Geological... of Climate Change Vulnerability Assessments'' in the subject line. FOR FURTHER INFORMATION CONTACT: Laura Thompson, National Climate Change and Wildlife Science Center, U.S. Geological Survey, 12201...

Child Nutrition. Beginnings Workshop.

ERIC Educational Resources Information Center

Hayden, Jacqueline; Eastman, Wayne; Aird, Laura Dutil; McCrea, Nadine L.

2002-01-01

Four workshops focus on nutrition for infants and children in child care settings. Articles are: (1) "Nutrition and Child Development: Global Perspectives" (Jacqueline Hayden); (2) "Working with Families around Nutritional Issues" (Wayne Eastman); (3) "Breastfeeding Promotion in Child Care" (Laura Dutil Aird); and (4) "Food as Shared…

From Mindless to Meaningful

ERIC Educational Resources Information Center

Billings, Laura; Roberts, Terry

2014-01-01

Despite teachers' best intentions, traditional whole-class discussions sometimes end up sounding like the monotonous drone of Charlie Brown's teacher. But with careful planning, teachers can structure discussions that encourage meaningful student interaction and collaborative thinking, write Laura Billings and Terry Roberts of the…

Computation and Theory in Large-Scale Optimization

DTIC Science & Technology

1993-01-13

Sang Jin Lee. Research Assistant. - Laura Morley, Research Assistant. - Yonca A. Ozge , Research Assistant. - Stephen M. Robinson. Professor. - Hichem...other participants. M.N. Azadez. S.J. Lee. Y.A. Ozge . and H. Sellami are continuing students in the doctoral program (in Industrial Engineering except

The Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 aerosol extinction retrieval algorithm: theoretical basis

NASA Astrophysics Data System (ADS)

Loughman, Robert; Bhartia, Pawan K.; Chen, Zhong; Xu, Philippe; Nyaku, Ernest; Taha, Ghassan

2018-05-01

The theoretical basis of the Ozone Mapping and Profiler Suite (OMPS) Limb Profiler (LP) Version 1 aerosol extinction retrieval algorithm is presented. The algorithm uses an assumed bimodal lognormal aerosol size distribution to retrieve aerosol extinction profiles at 675 nm from OMPS LP radiance measurements. A first-guess aerosol extinction profile is updated by iteration using the Chahine nonlinear relaxation method, based on comparisons between the measured radiance profile at 675 nm and the radiance profile calculated by the Gauss-Seidel limb-scattering (GSLS) radiative transfer model for a spherical-shell atmosphere. This algorithm is discussed in the context of previous limb-scattering aerosol extinction retrieval algorithms, and the most significant error sources are enumerated. The retrieval algorithm is limited primarily by uncertainty about the aerosol phase function. Horizontal variations in aerosol extinction, which violate the spherical-shell atmosphere assumed in the version 1 algorithm, may also limit the quality of the retrieved aerosol extinction profiles significantly.

And now, a word from our sponsor.

PubMed

Peebles, M Ellen

2003-10-01

Bryant Pharmaceutical's flagship product, a popular arthritis medicine called Seflex, is selling well--but not well enough. With generic versions due on the shelves in a couple of years, the drug company is looking for a dramatic sales increase. No wonder marketing VP Laura Goldenberg feels the pressure. She knows she has to reach more consumers, but in an environment where people bombarded with advertising are using devices such as TiVo to skip ads, her job has suddenly taken on a new intensity. In search of a new, gangbuster campaign, Laura and her ad agency come up with the idea of product placement--not your typical integration of a product into a television or movie script, but a less traditional approach. Their idea is to hire a much-loved, elderly actress to extol the virtues of Seflex on a morning news program. The news segment would be about arthritis, and Seflex would be casually mentioned during the interview. The company would have to pay the actress $1 million, and there are risks: What if it gets out that Bryant is paying her? What if the actress errs and says something about Seflex's side effects? If something goes wrong, Bryant Pharmaceutical's reputation could suffer. Should the company green-light Laura's plan? This fictional case study looks at the pros and cons of traditional product placement and newer, more subtle alternatives to advertising. Commenting on the case are Bob Gamgort, president of Masterfoods USA; Michelle R. Nelson, an assistant professor of journalism and mass communications at the University of Wisconsin, Madison; FTC commissioner Mozelle W. Thompson; and Mike Sheehan, president and CEO of Hill, Holliday, Connors, Cosmopulos.

An efficient impedance method for induced field evaluation based on a stabilized Bi-conjugate gradient algorithm.

PubMed

Wang, Hua; Liu, Feng; Xia, Ling; Crozier, Stuart

2008-11-21

This paper presents a stabilized Bi-conjugate gradient algorithm (BiCGstab) that can significantly improve the performance of the impedance method, which has been widely applied to model low-frequency field induction phenomena in voxel phantoms. The improved impedance method offers remarkable computational advantages in terms of convergence performance and memory consumption over the conventional, successive over-relaxation (SOR)-based algorithm. The scheme has been validated against other numerical/analytical solutions on a lossy, multilayered sphere phantom excited by an ideal coil loop. To demonstrate the computational performance and application capability of the developed algorithm, the induced fields inside a human phantom due to a low-frequency hyperthermia device is evaluated. The simulation results show the numerical accuracy and superior performance of the method.

Solving the Cauchy-Riemann equations on parallel computers

NASA Technical Reports Server (NTRS)

Fatoohi, Raad A.; Grosch, Chester E.

1987-01-01

Discussed is the implementation of a single algorithm on three parallel-vector computers. The algorithm is a relaxation scheme for the solution of the Cauchy-Riemann equations; a set of coupled first order partial differential equations. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, and SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The machine architectures are briefly described. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Conclusions are presented.

Relaxation of sound fields in rooms of diffusely reflecting boundaries and its application in acoustical radiosity simulation.

PubMed

Zhang, Honghu

2006-04-01

The acoustical radiosity method is a computationally expensive acoustical simulation algorithm that assumes an enclosure with ideal diffuse reflecting boundaries. Miles observed that for such an enclosure, the sound energy decay of every point on the boundaries will gradually converge to exponential manner with a uniform decay rate. Therefore, the ratio of radiosity between every pair of points on the boundaries will converge to a constant, and the radiosity across the boundaries will approach a fixed distribution during the sound decay process, where radiosity is defined as the acoustic power per unit area leaving (or being received by) a point on a boundary. We call this phenomenon the "relaxation" of the sound field. In this paper, we study the relaxation in rooms of different shapes with different boundary absorptions. Criteria based on the relaxation of the sound field are proposed to terminate the costly and unnecessary radiosity computation in the later phase, which can then be replaced by a fast regression step to speed up the acoustical radiosity simulation.

Generation of Well-Relaxed All-Atom Models of Large Molecular Weight Polymer Melts: A Hybrid Particle-Continuum Approach Based on Particle-Field Molecular Dynamics Simulations.

PubMed

De Nicola, Antonio; Kawakatsu, Toshihiro; Milano, Giuseppe

2014-12-09

A procedure based on Molecular Dynamics (MD) simulations employing soft potentials derived from self-consistent field (SCF) theory (named MD-SCF) able to generate well-relaxed all-atom structures of polymer melts is proposed. All-atom structures having structural correlations indistinguishable from ones obtained by long MD relaxations have been obtained for poly(methyl methacrylate) (PMMA) and poly(ethylene oxide) (PEO) melts. The proposed procedure leads to computational costs mainly related on system size rather than to the chain length. Several advantages of the proposed procedure over current coarse-graining/reverse mapping strategies are apparent. No parametrization is needed to generate relaxed structures of different polymers at different scales or resolutions. There is no need for special algorithms or back-mapping schemes to change the resolution of the models. This characteristic makes the procedure general and its extension to other polymer architectures straightforward. A similar procedure can be easily extended to the generation of all-atom structures of block copolymer melts and polymer nanocomposites.

78 FR 13765 - Federal Acquisition Regulation; Definition of Contingency Operation

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-28

... Government procurement. Dated: February 20, 2013. Laura Auletta, Director, Office of Governmentwide... Regulation (FAR) to revise the definition of ``contingency operation'' to address the statutory change to the... change to http://www.regulations.gov , including any personal and/or business confidential information...

Technology in Education. IDRA Focus.

ERIC Educational Resources Information Center

IDRA Newsletter, 1995

1995-01-01

This theme issue includes four articles on the effective use of computers and electronic technology in education, and on equitable access to educational technologies for Hispanics and other minority groups. "Teachers and Instructional Technology: Wise or Foolish Choices" (Laura Chris Green) describes three unproductive roles for computer…

Laura Vimmerstedt | NREL

Science.gov Websites

implications for energy technologies Research Interests Environmental effects of energy technologies and . Warner, and Dana Stright. 2016. Effects of Deployment Investment on the Growth of the Biofuels Industry . W. Bush. 2013. Effects of Deployment Investment on the Growth of the Biofuels Industry. Golden, CO

2008 Preserve America Presidential Awards

Science.gov Websites

Project, New York, New York; Corinth and Alcorn County Mississippi Heritage Tourism Initiative; Lower East and Alcorn County Mississippi Heritage Tourism Initiative were Rosemary Williams, Chairperson, Siege Heritage Tourism Initiative Mrs. Laura Bush poses for a photo with Preserve America Presidential Award

75 FR 35815 - Ocean Transportation Intermediary License Applicants

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-23

..., TX 76011. Officers: Omar Kolaghassi, Manager (Qualifying Individual), Laura Alicia, Manager. Application Type: New OFF & NVO License. CALS Logistics USA, Inc. (OFF & NVO), 755 North Route 83, Suite 215.... Premium Star Logistics LLC dba O.P. Premium Star Logistics (OFF & NVO), 4200 Lightning Court, Bakersfield...

76 FR 9338 - List of Correspondence

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-17

... the Individuals with Disabilities Education Act (IDEA). Under section 607(f) of the IDEA, the... that describes the interpretations of the Department of the IDEA or the regulations that implement the IDEA. FOR FURTHER INFORMATION CONTACT: Laura Duos or Mary Louise Dirrigl. Telephone: (202) 245-7468. If...

76 FR 8629 - Clarification of Reciprocal Waivers of Claims for Multiple-Customer Commercial Space Launch and...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-15

..., Government property, Indemnity payments, Insurance, Reporting and recordkeeping requirements, Rockets, Space...- Customer Commercial Space Launch and Reentry AGENCY: Federal Aviation Administration (FAA), DOT. ACTION... INFORMATION CONTACT: Laura Montgomery, Senior Attorney for Commercial Space Transportation, Office of the...

The Holocaust and History.

ERIC Educational Resources Information Center

Singer, Alan, Ed.

2003-01-01

This theme based journal issue consists of articles and teaching ideas focusing on the Holocaust and history. This publication contains the following materials: (1) "Multiple Perspectives on the Holocaust?" (Alan Singer); (2) "Responses to 'Multiple Perspectives on the Holocaust'"; (3) "Escape to Cuba: Story of Laura Kahn,…

A resolution electing Laura C. Dove, of Virginia, as Secretary for the Minority of the Senate.

THOMAS, 113th Congress

Sen. McConnell, Mitch [R-KY

2013-08-01

Senate - 08/01/2013 Submitted in the Senate, considered, and agreed to without amendment by Unanimous Consent. (All Actions) Tracker: This bill has the status Agreed to in SenateHere are the steps for Status of Legislation:

Learning Organization.

ERIC Educational Resources Information Center

1996

This document consists of three papers presented at a symposium on the learning organization moderated by Roger Miller at the 1996 conference of the Academy of Human Resource Development (AHRD). "Creating a Learning Organization: A Case Study of Outcomes and Lessons Learned" (Laura L. Bierema, David M. Berdish) reports a study…

Bean alpha-amylase inhibitors in transgenic peas inhibit development of pea weevil larvae.

PubMed

de Sousa-Majer, Maria José; Hardie, Darryl C; Turner, Neil C; Higgins, Thomas J V

2007-08-01

This glasshouse study used an improved larval measurement procedure to evaluate the impact of transgenic pea, Pisum sativum L., seeds expressing a-amylase inhibitor (AI)-1 or -2 proteins on pea weevil, Bruchus pisorum L. Seeds of transgenic 'Laura' and 'Greenfeast' peas expressing alpha-(AI)-1 reduced pea weevil survival by 93-98%. Larval mortality occurred at an early instar. Conversely, in nontransgenic cultivars, approximately 98-99% of the pea weevils emerged as adults. By measuring the head capsule size, we determined that larvae died at the first to early third instar in alpha-(AI)-1 transgenic peas, indicating that this inhibitor is highly effective in controlling this insect. By contrast, transgenic Laura and 'Dundale' expressing alpha-(AI)-2 did not affect pea weevil survival, but they did delay larval development. After 77 d of development, the head capsule size indicated that the larvae were still at the third instar stage in transgenic alpha-(AI)-2 peas, whereas adult bruchids had developed in the nontransgenic peas.

Recent progress in density functional theory

NASA Astrophysics Data System (ADS)

Truhlar, Donald

2014-03-01

Ongoing work involves several areas of density functional theory: new methods for computing electronic excitation energies, including a new way to remove spin contamination in the spin-flip Tamm-Dancoff approximation and a configuration-interaction-corrected Tamm-Dancoff Approximation for treating conical intersections; new ways to treat open-shell states, including a reinterpreted broken-symmetry method and multi-configuration Kohn-Sham theory; a new exchange-correlation functional; new tests of density functional theory against databases for electronic transition energies and molecules and solids containing metal atoms; and applications. A selection of results will be presented. I am grateful to the following collaborators for contributions to the ongoing work: Boris Averkiev, Rebecca Carlson, Laura Fernandez, Laura Gagliardi, Chad Hoyer, Francesc Illas, Miho Isegawa, Shaohong Li, Giovanni Li Manni, Sijie Luo, Dongxia Ma, Remi Maurice, Rubén Means-Pañeda, Roberto Peverati, Nora Planas, Prasenjit Seal, Pragya Verma, Bo Wang, Xuefei Xu, Ke R. Yang, Haoyu Yu, Wenjing Zhang, and Jingjing Zheng. Supported in part by the AFOSR and U.S. DOE.

Real Gas Computation Using an Energy Relaxation Method and High-Order WENO Schemes

NASA Technical Reports Server (NTRS)

Montarnal, Philippe; Shu, Chi-Wang

1998-01-01

In this paper, we use a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition into two parts: one part is associated with a simpler pressure law and the other part (the nonlinear deviation) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the first part. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Algorithms for Mathematical Programming with Emphasis on Bi-level Models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goldfarb, Donald; Iyengar, Garud

2014-05-22

The research supported by this grant was focused primarily on first-order methods for solving large scale and structured convex optimization problems and convex relaxations of nonconvex problems. These include optimal gradient methods, operator and variable splitting methods, alternating direction augmented Lagrangian methods, and block coordinate descent methods.

Convex relaxations of spectral sparsity for robust super-resolution and line spectrum estimation

NASA Astrophysics Data System (ADS)

Chi, Yuejie

2017-08-01

We consider recovering the amplitudes and locations of spikes in a point source signal from its low-pass spectrum that may suffer from missing data and arbitrary outliers. We first review and provide a unified view of several recently proposed convex relaxations that characterize and capitalize the spectral sparsity of the point source signal without discretization under the framework of atomic norms. Next we propose a new algorithm when the spikes are known a priori to be positive, motivated by applications such as neural spike sorting and fluorescence microscopy imaging. Numerical experiments are provided to demonstrate the effectiveness of the proposed approach.

LUCY: A New Path to Diversity

ERIC Educational Resources Information Center

Marrah, Arleezah; Mills, Roxanne

2011-01-01

This article describes the Librarianship Upgrades for Children and Youth Services (LUCY), a multifaceted multicultural continuing education program for librarians developed by the Library and Information Science Program at Old Dominion University. The Institute of Museum and Library Services (IMLS) funds LUCY through the Laura Bush 21st century…

78 FR 63530 - Self-Regulatory Organizations; New York Stock Exchange LLC; Order Granting Approval to Proposed...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-24

... Bertsch, President and CEO, Society of Corporate Secretaries & Governance Professionals, dated March 7... March 14, 2013 (``Harrington Letter''); James McRitchie, Shareowner, Corporate Governance, dated March... March 15, 2013 (``Sharegate Letter''); Laura Berry, Executive Director, Interfaith Center on Corporate...

TIME TO PREGNANCY IN RELATION TO TOTAL TRIHALOMETHANE LEVELS IN TAP WATER

EPA Science Inventory

Time to pregnancy in relation to total trihalomethane levels in tap water
Shanna H. Swan, Cuirong Ren, Gayle C. Windham, Laura Fenster, Kirsten Waller. (University of Missouri and California Department of Health Services).

We have previously reported increased risks o...

77 FR 10806 - Surety Companies Acceptable on Federal Bonds: Termination; First Sealord Surety, Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-23

... 20782. Dated: February 10, 2012. Laura Carrico, Director, Financial Accounting and Services Division...: Termination; First Sealord Surety, Inc. AGENCY: Financial Management Service, Fiscal Service, Department of... be directed to the U.S. Department of the Treasury, Financial Management Service, Financial...

75 FR 60865 - Surety Companies Acceptable on Federal Bonds: Amendment-Allegheny Casualty Company

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-01

... 20782. Dated: September 24, 2010. Laura Carrico, Director, Financial Accounting and Services Division...-- Allegheny Casualty Company AGENCY: Financial Management Service, Fiscal Service, Department of the Treasury... notice may be directed to the U.S. Department of the Treasury, Financial Management Service, Financial...

75 FR 61246 - Surety Companies Acceptable on Federal Bonds: Darwin National Assurance Company

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-04

... the U.S. Department of the Treasury, Financial Management Service, Financial Accounting and Services..., 2010. Laura Carrico, Director, Financial Accounting and Services Division, [FR Doc. 2010-24632 Filed 10... National Assurance Company AGENCY: Financial Management Service, Fiscal Service, Department of the Treasury...

An Unplanned Path

ERIC Educational Resources Information Center

McGarvey, Lynn M.; Sterenberg, Gladys Y.; Long, Julie S.

2013-01-01

The authors elucidate what they saw as three important challenges to overcome along the path to becoming elementary school mathematics teacher leaders: marginal interest in math, low self-confidence, and teaching in isolation. To illustrate how these challenges were mitigated, they focus on the stories of two elementary school teachers--Laura and…

Standards and Assessment. IDRA Focus.

ERIC Educational Resources Information Center

IDRA Newsletter, 1997

1997-01-01

This newsletter includes three articles, two of which focus on standards for student evaluation and for admission to higher education. "A Measuring Stick for Standards and TEKS: Meeting the Needs of Second Language Learners" (Laura Chris Green, Adela Solis) examines beliefs embodied in the notion of standards; defines content,…

My Desire for Art Education

ERIC Educational Resources Information Center

Hetrick, Laura J.

2013-01-01

In this commentary, Laura Hetrick focuses on what is inherently missing from the art education literature about teaching future teachers of art--of addressing nascent teachers' personal, pedagogical, and professional desires. Specifically, she considers teachers' desires for power and recognition, their desires to love and be loved, and…

CHLORINATION BY-PRODUCTS IN DRINKING WATER AND MENSTRUAL CYCLE FUNCTION

EPA Science Inventory

Chlorination by-Products in Drinking Water and Menstrual Cycle Function

Gayle C. Windham1, Kirsten Waller2, Meredith Anderson2, Laura Fenster1, Pauline Mendola3, Shanna Swan4

1California Department of Health Services, Division of Environmental and Occupational Disea...

76 FR 17817 - North Central Idaho Resource Advisory Committee

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-31

... Central Idaho Resource Advisory Committee AGENCY: Forest Service, USDA. ACTION: Notice of meeting. SUMMARY: The North Central Idaho RAC will meet in Grangeville, Idaho. The committee is meeting as authorized... Supervisors Office, 104 Airport Road, Grangeville, Idaho. Written comments should be sent to Laura Smith at...

Federal Support for Preserve America

Science.gov Websites

Development logo Mrs. Laura Bush Presents "Preserve America History Teacher of the Year" Award to , West Virginia, the 2006 "Preserve America History Teacher of the Year" Award during a ceremony held at Lincoln Hall in The Union League Club. "Great history teachers take required

77 FR 20531 - Correction of Authority Citations for Commercial Space Transportation

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-05

...-AI50, 2120-AI57, 2120-AI56, 2120-AI88] Correction of Authority Citations for Commercial Space..., Congress transferred the statute authorizing the FAA's commercial space transportation regulations. This...: Laura Montgomery, Senior Attorney for Commercial Space Transportation, Office of the Chief Counsel...

Philanthropy and the Gospel of Child Development.

ERIC Educational Resources Information Center

Schlossman, Steven

1981-01-01

Highlights the role of the Laura Spelman Rockefeller Memorial Foundation in promoting child development research and parent education in America during the 1920s. The author discusses the ways that the movement's stress on scientific objectivity help to increase its acceptance by both parents and educators. (AM)

Disciplined Development: Teachers and Reform in Ghana

ERIC Educational Resources Information Center

Dull, Laura J.

2006-01-01

Drawing on Foucault's analysis of disciplinary power and Gramsci's theories on hegemony, Laura Dull argues in this insightful volume that Ghanian teachers' diverse roles--as moral disciplinarians, ambivalent partners with global donors and lenders, romantic racialists of Africans--illustrate the ways in which educators deploy history and…

76 FR 72003 - Proposed Collection, Laura Bush 21st Century Librarian Grant Program Evaluation

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-21

... responses. ADDRESSES: Send comments to: Matthew Birnbaum, Ph.D., Evaluation and Research Officer, Institute... the Institute. Current research initiatives include analysis of grants made to educational and... communities. IMLS proposes to collect qualitative and quantitative information from grant recipients and...

All take and no give?

PubMed

Honey, Laura

2015-12-05

Benefits of the human-animal bond are often highlighted, but how equal is the relationship? Delegates at the BVA Congress at the London Vet Show heard that, while animals can bring benefits to people, people do not always fulfil their side of the bargain. Laura Honey reports. British Veterinary Association.

Helping America's Youth

ERIC Educational Resources Information Center

Bush, Laura

2005-01-01

As First Lady of the United States, Laura Bush is leading the Helping America's Youth initiative of the federal government. She articulates the goal of enlisting public and volunteer resources to foster healthy growth by early intervention and mentoring of youngsters at risk. Helping America's Youth will benefit children and teenagers by…

Then and Now: Women Respond to the Manhattan Project - an illustrated talk

NASA Astrophysics Data System (ADS)

Fermi, M. A., Olivia

2014-03-01

I am very much looking forward to visiting you, the family of physicists gathering for your annual APS conference. In different ways, my grandfather Enrico Fermi is a member of both our families. In this sense we are connected and share a common legacy, which I want to explore from the angle of two women inextricably involved with and affected by the Manhattan Project. One from the past and one alive now. These two women, despite a significant temporal and cultural gap share a remarkable number of traits and values. My talk will not offer a particular thesis or finding. Rather it will be about ways of seeing, including questioning unnoticed assumptions and belief systems. My grandmother Laura Fermi, modeled this for me as a youngster. She was at Enrico's side during the Manhattan Project years, yet in the dark about his work. What was it like to live in a climate of intellectually and patriotically charged enthusiasm, with an undercurrent of unspoken dread? Laura, just like most everyone else, discovered the true nature of the effort on the day the atomic bomb was dropped on Hiroshima. After the war and after Enrico's untimely death in 1954, in response to all she had experienced, Laura re-invented herself as an author and visionary, pioneering in both the environmental and handgun control movements. Marian Naranjo lives on the Santa Clara Pueblo near Los Alamos. Her ancestors dwelled on the Pajarito Plateau which encompasses the space where Los Alamos National Labs (LANL) is today. Her people, the Pueblo People have used the area's natural resources for ceremonial and survival for uncountable generations. They say, ``We are this place.'' What is it like to live on land one's families have safely occupied for thousands of years, with an undercurrent of dread at the prospect of toxic waste stream products from LANL? Like my grandmother did in her place and time, Marian builds community as an integral part of her environmental and social justice activism. She is regularly a presenter at the table with LANL, DOE and other organizations; and also works to empower women and youth. Laura and Marian's lives illustrate the potential for engaged response to the Manhattan Project and its legacy. Implicit in them are fundamental moral and ethical questions. What is the nature of individual responsibility? Does it differ for men and women? How does the interplay between masculine and feminine forces affect our culture, and what does it imply for our future?

Structure of the two-dimensional relaxation spectra seen within the eigenmode perturbation theory and the two-site exchange model.

PubMed

Bytchenkoff, Dimitri; Rodts, Stéphane

2011-01-01

The form of the two-dimensional (2D) NMR-relaxation spectra--which allow to study interstitial fluid dynamics in diffusive systems by correlating spin-lattice (T(1)) and spin-spin (T(2)) relaxation times--has given rise to numerous conjectures. Herein we find analytically a number of fundamental structural properties of the spectra: within the eigen-modes formalism, we establish relationships between the signs and intensities of the diagonal and cross-peaks in spectra obtained by various 1 and 2D NMR-relaxation techniques, reveal symmetries of the spectra and uncover interdependence between them. We investigate more specifically a practically important case of porous system that has sets of T(1)- and T(2)-eigenmodes and eigentimes similar to each other by applying the perturbation theory. Furthermore we provide a comparative analysis of the application of the, mathematically more rigorous, eigen-modes formalism and the, rather more phenomenological, first-order two-site exchange model to diffusive systems. Finally we put the results that we could formulate analytically to the test by comparing them with computer-simulations for 2D porous model systems. The structural properties, in general, are to provide useful clues for assignment and analysis of relaxation spectra. The most striking of them--the presence of negative peaks--underlines an urgent need for improvement of the current 2D Inverse Laplace Transform (ILT) algorithm used for calculation of relaxation spectra from NMR raw data. Copyright © 2010 Elsevier Inc. All rights reserved.

Proposed algorithm for determining the delta intercept of a thermocouple psychrometer curve

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurzmack, M.A.

1993-07-01

The USGS Hydrologic Investigations Program is currently developing instrumentation to study the unsaturated zone at Yucca Mountain in Nevada. Surface-based boreholes up to 2,500 feet in depth will be drilled, and then instrumented in order to define the water potential field within the unsaturated zone. Thermocouple psychrometers will be used to monitor the in-situ water potential. An algorithm is proposed for simply and efficiently reducing a six wire thermocouple psychrometer voltage output curve to a single value, the delta intercept. The algorithm identifies a plateau region in the psychrometer curve and extrapolates a linear regression back to the initial startmore » of relaxation. When properly conditioned for the measurements being made, the algorithm results in reasonable results even with incomplete or noisy psychrometer curves over a 1 to 60 bar range.« less

Consumer Health

ERIC Educational Resources Information Center

Bibel, Barbara

2010-01-01

This article presents an annotated bibliography of 19 titles that focus on cancer and health-care reform. These include: (1) Anderson, John W. "Stand by Her: A Breast Cancer Guide for Men." AMACOM: American Management Assn.; (2) Carstensen, Laura L. "A Long Bright Future: An Action Plan for a Lifetime of Happiness, Health, and Financial Security."…

PROSPECTIVE PREGNANCY STUDY DESIGNS FOR ASSESSING REPRODUCTIVE AND DEVELOPMENTAL TOXICANTS

EPA Science Inventory

Prospective Pregnancy Study Designs for Assessing Reproductive and Developmental Toxicants
Germaine M. Buck,1 Courtney D. Johnson,1 Joseph Stanford,2 Anne Sweeney,3 Laura Schieve,4 John Rockett,5 Sherry G. Selevan,6 Steve Schrader 7

Abstract
The origin of successfu...

A resolution to authorize testimony and representation In the Matter of the Proposed Discipline of Laura Block Lower.

THOMAS, 113th Congress

Sen. Reid, Harry [D-NV

2013-07-15

Senate - 07/15/2013 Submitted in the Senate, considered, and agreed to without amendment and with a preamble by Unanimous Consent. (All Actions) Tracker: This bill has the status Agreed to in SenateHere are the steps for Status of Legislation:

76 FR 38459 - Surety Companies Acceptable on Federal Bonds-Redomestication and Change in Business Address...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-30

... directed to the U.S. Department of the Treasury, Financial Management Service, Financial Accounting and...: June 22, 2011. Laura Carrico, Director, Financial Accounting and Services Division, Financial...: Financial Management Service, Fiscal Service, Department of the Treasury. ACTION: Notice. SUMMARY: This is...

76 FR 25783 - Surety Companies Acceptable on Federal Bonds; Name Change: Odyssey America Reinsurance Corporation

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-05

... directed to the U.S. Department of the Treasury, Financial Management Service, Financial Accounting and...: April 22, 2011. Laura Carrico, Director, Financial Accounting and Services Division. [FR Doc. 2011-10773... Change: Odyssey America Reinsurance Corporation AGENCY: Financial Management Service, Fiscal Service...

77 FR 553 - Surety Companies Acceptable on Federal Bonds: Amendment-Evergreen National Indemnity Company

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-05

..., Financial Accounting and Services Division, Surety Bond Branch, 3700 East-West Highway, Room 6F01, Hyattsville, MD 20782. Dated: December 20, 2011. Laura Carrico, Director, Financial Accounting and Services...-- Evergreen National Indemnity Company AGENCY: Financial Management Service, Fiscal Service, Department of the...

77 FR 29472 - Surety Companies Acceptable on Federal Bonds-Termination: Atlantic Bonding Company, Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-17

..., Financial Accounting and Services Division, Surety Bond Branch, 3700 East-West Highway, Room 6F01, Hyattsville, MD 20782. Dated: May 8, 2012. Laura Carrico, Director, Financial Accounting and Services Division...--Termination: Atlantic Bonding Company, Inc. AGENCY: Financial Management Service, Fiscal Service, Department...

76 FR 60603 - Surety Companies Acceptable on Federal Bonds: Termination; Minnesota Surety and Trust Company

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-29

... 20782. Dated: September 15, 2011. Laura Carrico, Director, Financial Accounting and Services Division...: Termination; Minnesota Surety and Trust Company AGENCY: Financial Management Service, Fiscal Service... notice may be directed to the U.S. Department of the Treasury, Financial Management Service, Financial...

77 FR 27253 - Proposed Collection, Laura Bush 21st Century Librarian Grant Program Evaluation

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-09

... information gathered will inform the library and information science field of innovations and best practices... Century Librarian Grant Program Evaluation AGENCY: Institute of Museum and Library Services, National.... SUMMARY: The Institute of Museum and Library Services announces the following information collection has...

"No DH, No Interview"

ERIC Educational Resources Information Center

Pannapacker, William

2012-01-01

In this article, the author discusses digital humanities (DH) and what future it holds for graduate students who are riding the digital-humanities bandwagon. He spoke with several graduate students about their interest in the field: how they got into it and began their first projects. Laura Mandell, director of the Initiative for Digital…

Literary Study, Measurement, and the Sublime: Disciplinary Assessment

ERIC Educational Resources Information Center

Heiland, Donna, Ed.; Rosenthal, Laura J., Ed.

2011-01-01

This collection of essays, "Literary Study, Measurement, and the Sublime: Disciplinary Assessment," edited by Donna Heiland and Laura J. Rosenthal, represents an important new venture in the Foundation's communication program. The book is the product of many authors, including the editors, both of whom have written essays for it. But it…

77 FR 25013 - Notice To Rescind Notice of Intent To Prepare an Environmental Impact Statement; Mahoning and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-26

... the EIS could be completed, the funding reality is such that the project could not be designed or... and Construction (A, B). Authority: 23 U.S.C. 315; 49 CFR 1.48. Issued on: April 16, 2012. Laura S...

77 FR 35624 - Federal Acquisition Regulation; Justification and Approval of Sole-Source 8(a) Contracts: Correction

Federal Register 2010, 2011, 2012, 2013, 2014

2012-06-14

... 2] RIN 9000-AL55 Federal Acquisition Regulation; Justification and Approval of Sole-Source 8(a... removes language indicating that the applicable section of the National Defense Authorization Act for...: June 8, 2012. Laura Auletta, Director, Office of Governmentwide Acquisition Policy, Office of...

75 FR 57904 - Mid-Atlantic Fishery Management Council (MAFMC); Meetings

Federal Register 2010, 2011, 2012, 2013, 2014

2010-09-23

... receive a MARCO presentation by Laura McKay, Program Manager Virginia Coastal Zone Program. The Council... Ecosystems and Oceans Planning Committee, its Demersal and Coastal Migratory Committee, its Law Enforcement... Coastal Migratory Committee will meet from 4 p.m. until 5 p.m. The Law Enforcement Committee will meet...

Diversity in the Workplace [in HRD].

ERIC Educational Resources Information Center

1995

These four papers are from a symposium that was facilitated by Laura Bierema at the 1995 conference of the Academy of Human Resource Development (HRD). "The Status of Valuing and Managing Diversity in Fortune 500 Manufacturing and Fortune 500 Service Organizations: Perceptions of Top Human Resource Professionals" (Sandra J. Johnson) reports a…

TRIHALOMETHANE LEVELS IN HOME TAP WATER AND SEMEN QUALITY

EPA Science Inventory

Trihalomethane Levels in Home Tap Water and Semen Quality
Laura Fenster, 1 Kirsten Waller, 2 Gayle Windham, 1 Tanya Henneman, 2 Meredith Anderson, 2 Pauline Mendola, 3 James W. Overstreet, 4 Shanna H. Swan5

1California Department of Health Services, Division of Environm...

Postsecondary Education and Transition for Students with Learning Disabilities. Second Edition.

ERIC Educational Resources Information Center

Brinckerhoff, Loring C.; McGuire, Joan M.; Shaw, Stan F.

This text is designed to help postsecondary education personnel initiate or refine college programs for the increasing numbers of students with learning disabilities. Following an introductory chapter, chapters have the following titles: (1) "A Comprehensive Approach to Transition Planning"; (2) "Judicial Intent and Legal Precedents" (Laura F.…

Losing Libraries, Saving Libraries

ERIC Educational Resources Information Center

Miller, Rebecca

2010-01-01

This summer, as public libraries continued to get budget hit after budget hit across the country, several readers asked for a comprehensive picture of the ravages of the recession on library service. In partnership with 2010 Movers & Shakers Laura Solomon and Mandy Knapp, Ohio librarians who bought the Losing Libraries domain name,…

Issues of Gender. Symposium.

ERIC Educational Resources Information Center

2002

This symposium is comprised of three papers on issues of gender in human resource development (HRD). "The Impact of Awareness and Action on the Implementation of a Women's Network" (Laura L. Bierema) reports on research to examine how gender consciousness emerges through the formation of in-company networks to promote corporate women's…

Early Years Children Think Too!

ERIC Educational Resources Information Center

Mooney, Laura

2013-01-01

During a recent theme on "Ourselves," Laura Mooney's class focused on height and looking at similarities and differences between a range of objects. This involved not only looking at each other, but also linked to their self-portrait development, where they had been learning about their facial features and comparing them to other…

Runoff Characterization and Variations at McMurdo Station, Antarctica

DTIC Science & Technology

2014-05-13

Boulevard Arlington, VA 22230 Laura Elliot and Corey Chan Antarctic Support Contract 7400 S. Tucson Way Centennial , CO 08112 Michael Diamond...then along the road and down Hut Point Road. Sub-basin 2 has the largest area and encompasses the majority of the snowfield and the depression above

Oracy II.

ERIC Educational Resources Information Center

Nebraska Univ., Lincoln.

This volume on the Tri-University project contains three reports on the teaching of oracy. The chairman of the committee on oracy, Laura Chase, offers suggestions for the preservice and inservice training of teachers to prepare them to deal with discussion, the individual talk, oral reading, and dramatic role playing. She outlines a teacher…

PubMed

2005-09-01

Screen break: nursing students Jackie Walsh, Laura Robinson and Liz Midgley join 'matron' Sandra McQuat, a ward manager at Beatson Oncology Centre, the Western Infirmary, Glasgow, as they try out nurse training 1950s style for a new BBC series to be televised this autumn. The series, Thoroughly Modern Matron, was filmed at Belvoir Park Hospital, Belfast.

78 FR 22529 - Information on Surplus Land at a Military Installation Designated for Disposal: Naval Air Station...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-16

... Installation Designated for Disposal: Naval Air Station Alameda, Alameda, California AGENCY: Department of the... at Naval Air Station Alameda, Alameda, California. FOR FURTHER INFORMATION CONTACT: Ms. Laura Duchnak, Director, Naval Facilities Engineering Command, Base Realignment and Closure Program Management Office...

Harvard Education Letter. Volume 26, Number 5, September-October 2010

ERIC Educational Resources Information Center

Walser, Nancy, Ed.

2010-01-01

"Harvard Education Letter" is published bimonthly at the Harvard Graduate School of Education. This issue of "Harvard Education Letter" contains the following articles: (1) Scenes from the School Turnaround Movement: Passion, Frustration, Mid-Course Corrections Mark Rapid Reforms (Laura Pappano); (2) The Media Savvy Educator:…

"Never Enough": Bridging the Chasm between College Women's Achievements and Their Anguish

ERIC Educational Resources Information Center

Choate, Laura A.

2017-01-01

Laura H. Choate demonstrates a disconnect between what female undergraduates are achieving and how they actually feel about themselves and their accomplishments; she suggests a variety of interventions to counterbalance the cultural pressures that undermine college women's overall self-esteem and mental health.

Palliative care - what the final days are like

MedlinePlus

... do symptoms change for patients in the last days and hours of life? In: Goldstein NE, Morrison RS, eds. Evidence-Based Practice of Palliative Medicine . Philadelphia, PA: Elsevier Saunders; 2013:chap 39. Review Date 2/6/2016 Updated by: Laura J. Martin, MD, MPH, ABIM Board Certified in Internal ...

How Does Relaxing the Algorithm for Autism Affect DSM-V Prevalence Rates?

ERIC Educational Resources Information Center

Matson, Johnny L.; Hattier, Megan A.; Williams, Lindsey W.

2012-01-01

Although it is still unclear what causes autism spectrum disorders (ASDs), over time researchers and clinicians have become more precise with detecting and diagnosing ASD. Many diagnoses, however, are based on the criteria established within the "Diagnostic and Statistical Manual of Mental Disorders" ("DSM"); thus, any change in these diagnostic…

Measurement of the Exchange Rate of Waters of Hydration in Elastin by 2D T(2)-T(2) Correlation Nuclear Magnetic Resonance Spectroscopy.

PubMed

Sun, Cheng; Boutis, Gregory S

2011-02-28

We report on the direct measurement of the exchange rate of waters of hydration in elastin by T(2)-T(2) exchange spectroscopy. The exchange rates in bovine nuchal ligament elastin and aortic elastin at temperatures near, below and at the physiological temperature are reported. Using an Inverse Laplace Transform (ILT) algorithm, we are able to identify four components in the relaxation times. While three of the components are in good agreement with previous measurements that used multi-exponential fitting, the ILT algorithm distinguishes a fourth component having relaxation times close to that of free water and is identified as water between fibers. With the aid of scanning electron microscopy, a model is proposed allowing for the application of a two-site exchange analysis between any two components for the determination of exchange rates between reservoirs. The results of the measurements support a model (described elsewhere [1]) wherein the net entropy of bulk waters of hydration should increase upon increasing temperature in the inverse temperature transition.

Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

NASA Astrophysics Data System (ADS)

Scutari, Gesualdo; Facchinei, Francisco; Lampariello, Lorenzo

2017-04-01

In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell environment. We develop a new class of algorithms enjoying the following distinctive features: i) they are \\emph{distributed} across the base stations (with limited signaling) and lead to subproblems whose solutions are computable in closed form; and ii) differently from current relaxation-based schemes (e.g., semidefinite relaxation), they are proved to always converge to d-stationary solutions of the aforementioned class of nonconvex problems. Numerical results show that the proposed (distributed) schemes achieve larger worst-case rates (resp. signal-to-noise interference ratios) than state-of-the-art centralized ones while having comparable computational complexity.

Dependence of calculated postshock thermodynamic variables on vibrational equilibrium and input uncertainty

DOE Office of Scientific and Technical Information (OSTI.GOV)

Campbell, Matthew Frederick; Owen, Kyle G.; Davidson, David F.

The purpose of this article is to explore the dependence of calculated postshock thermodynamic properties in shock tube experiments upon the vibrational state of the test gas and upon the uncertainties inherent to calculation inputs. This paper first offers a comparison between state variables calculated according to a Rankine–Hugoniot–equation-based algorithm, known as FROSH, and those derived from shock tube experiments on vibrationally nonequilibrated gases. It is shown that incorrect vibrational relaxation assumptions could lead to errors in temperature as large as 8% for 25% oxygen/argon mixtures at 3500 K. Following this demonstration, this article employs the algorithm to show themore » importance of correct vibrational equilibration assumptions, noting, for instance, that errors in temperature of up to about 2% at 3500 K may be generated for 10% nitrogen/argon mixtures if vibrational relaxation is not treated properly. Lastly, this article presents an extensive uncertainty analysis, showing that postshock temperatures can be calculated with root-of-sum-of-square errors of better than ±1% given sufficiently accurate experimentally measured input parameters.« less

Dependence of calculated postshock thermodynamic variables on vibrational equilibrium and input uncertainty

DOE PAGES

Campbell, Matthew Frederick; Owen, Kyle G.; Davidson, David F.; ...

2017-01-30

The purpose of this article is to explore the dependence of calculated postshock thermodynamic properties in shock tube experiments upon the vibrational state of the test gas and upon the uncertainties inherent to calculation inputs. This paper first offers a comparison between state variables calculated according to a Rankine–Hugoniot–equation-based algorithm, known as FROSH, and those derived from shock tube experiments on vibrationally nonequilibrated gases. It is shown that incorrect vibrational relaxation assumptions could lead to errors in temperature as large as 8% for 25% oxygen/argon mixtures at 3500 K. Following this demonstration, this article employs the algorithm to show themore » importance of correct vibrational equilibration assumptions, noting, for instance, that errors in temperature of up to about 2% at 3500 K may be generated for 10% nitrogen/argon mixtures if vibrational relaxation is not treated properly. Lastly, this article presents an extensive uncertainty analysis, showing that postshock temperatures can be calculated with root-of-sum-of-square errors of better than ±1% given sufficiently accurate experimentally measured input parameters.« less

A meta-cognitive learning algorithm for a Fully Complex-valued Relaxation Network.

PubMed

Savitha, R; Suresh, S; Sundararajan, N

2012-08-01

This paper presents a meta-cognitive learning algorithm for a single hidden layer complex-valued neural network called "Meta-cognitive Fully Complex-valued Relaxation Network (McFCRN)". McFCRN has two components: a cognitive component and a meta-cognitive component. A Fully Complex-valued Relaxation Network (FCRN) with a fully complex-valued Gaussian like activation function (sech) in the hidden layer and an exponential activation function in the output layer forms the cognitive component. The meta-cognitive component contains a self-regulatory learning mechanism which controls the learning ability of FCRN by deciding what-to-learn, when-to-learn and how-to-learn from a sequence of training data. The input parameters of cognitive components are chosen randomly and the output parameters are estimated by minimizing a logarithmic error function. The problem of explicit minimization of magnitude and phase errors in the logarithmic error function is converted to system of linear equations and output parameters of FCRN are computed analytically. McFCRN starts with zero hidden neuron and builds the number of neurons required to approximate the target function. The meta-cognitive component selects the best learning strategy for FCRN to acquire the knowledge from training data and also adapts the learning strategies to implement best human learning components. Performance studies on a function approximation and real-valued classification problems show that proposed McFCRN performs better than the existing results reported in the literature. Copyright © 2012 Elsevier Ltd. All rights reserved.

A New Method for Determining Structure Ensemble: Application to a RNA Binding Di-Domain Protein.

PubMed

Liu, Wei; Zhang, Jingfeng; Fan, Jing-Song; Tria, Giancarlo; Grüber, Gerhard; Yang, Daiwen

2016-05-10

Structure ensemble determination is the basis of understanding the structure-function relationship of a multidomain protein with weak domain-domain interactions. Paramagnetic relaxation enhancement has been proven a powerful tool in the study of structure ensembles, but there exist a number of challenges such as spin-label flexibility, domain dynamics, and overfitting. Here we propose a new (to our knowledge) method to describe structure ensembles using a minimal number of conformers. In this method, individual domains are considered rigid; the position of each spin-label conformer and the structure of each protein conformer are defined by three and six orthogonal parameters, respectively. First, the spin-label ensemble is determined by optimizing the positions and populations of spin-label conformers against intradomain paramagnetic relaxation enhancements with a genetic algorithm. Subsequently, the protein structure ensemble is optimized using a more efficient genetic algorithm-based approach and an overfitting indicator, both of which were established in this work. The method was validated using a reference ensemble with a set of conformers whose populations and structures are known. This method was also applied to study the structure ensemble of the tandem di-domain of a poly (U) binding protein. The determined ensemble was supported by small-angle x-ray scattering and nuclear magnetic resonance relaxation data. The ensemble obtained suggests an induced fit mechanism for recognition of target RNA by the protein. Copyright © 2016 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Shape effects on time-scale divergence at athermal jamming transition of frictionless non-spherical particles

NASA Astrophysics Data System (ADS)

Yuan, Ye; Jin, Weiwei; Liu, Lufeng; Li, Shuixiang

2017-10-01

The critical behaviors of a granular system at the jamming transition have been extensively studied from both mechanical and thermodynamic perspectives. In this work, we numerically investigate the jamming behaviors of a variety of frictionless non-spherical particles, including spherocylinder, ellipsoid, spherotetrahedron and spherocube. In particular, for a given particle shape, a series of random configurations at different fixed densities are generated and relaxed to minimize interparticle overlaps using the relaxation algorithm. We find that as the jamming point (i.e., point J) is approached, the number of iteration steps (defined as the "time-scale" for our systems) required to completely relax the interparticle overlaps exhibits a clear power-law divergence. The dependence of the detailed mathematical form of the power-law divergence on particle shapes is systematically investigated and elucidated, which suggests that the shape effects can be generally categorized as elongation and roundness. Importantly, we show the jamming transition density can be accurately determined from the analysis of time-scale divergence for different non-spherical shapes, and the obtained values agree very well with corresponding ones reported in literature. Moreover, we study the plastic behaviors of over-jammed packings of different particles under a compression-expansion procedure and find that the jamming of ellipsoid is much more robust than other non-spherical particles. This work offers an alternative approximate procedure besides conventional packing algorithms for studying athermal jamming transition in granular system of frictionless non-spherical particles.

Graph cuts with invariant object-interaction priors: application to intervertebral disc segmentation.

PubMed

Ben Ayed, Ismail; Punithakumar, Kumaradevan; Garvin, Gregory; Romano, Walter; Li, Shuo

2011-01-01

This study investigates novel object-interaction priors for graph cut image segmentation with application to intervertebral disc delineation in magnetic resonance (MR) lumbar spine images. The algorithm optimizes an original cost function which constrains the solution with learned prior knowledge about the geometric interactions between different objects in the image. Based on a global measure of similarity between distributions, the proposed priors are intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive an original fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed priors relax the need of costly pose estimation (or registration) procedures and large training sets (we used a single subject for training), and can tolerate shape deformations, unlike template-based priors. Our formulation leads to an NP-hard problem which does not afford a form directly amenable to graph cut optimization. We proceeded to a relaxation of the problem via an auxiliary function, thereby obtaining a nearly real-time solution with few graph cuts. Quantitative evaluations over 60 intervertebral discs acquired from 10 subjects demonstrated that the proposed algorithm yields a high correlation with independent manual segmentations by an expert. We further demonstrate experimentally the invariance of the proposed geometric attributes. This supports the fact that a single subject is sufficient for training our algorithm, and confirms the relevance of the proposed priors to disc segmentation.

Dense-HOG-based drift-reduced 3D face tracking for infant pain monitoring

NASA Astrophysics Data System (ADS)

Saeijs, Ronald W. J. J.; Tjon A Ten, Walther E.; de With, Peter H. N.

2017-03-01

This paper presents a new algorithm for 3D face tracking intended for clinical infant pain monitoring. The algorithm uses a cylinder head model and 3D head pose recovery by alignment of dynamically extracted templates based on dense-HOG features. The algorithm includes extensions for drift reduction, using re-registration in combination with multi-pose state estimation by means of a square-root unscented Kalman filter. The paper reports experimental results on videos of moving infants in hospital who are relaxed or in pain. Results show good tracking behavior for poses up to 50 degrees from upright-frontal. In terms of eye location error relative to inter-ocular distance, the mean tracking error is below 9%.

Application of a fast sorting algorithm to the assignment of mass spectrometric cross-linking data.

PubMed

Petrotchenko, Evgeniy V; Borchers, Christoph H

2014-09-01

Cross-linking combined with MS involves enzymatic digestion of cross-linked proteins and identifying cross-linked peptides. Assignment of cross-linked peptide masses requires a search of all possible binary combinations of peptides from the cross-linked proteins' sequences, which becomes impractical with increasing complexity of the protein system and/or if digestion enzyme specificity is relaxed. Here, we describe the application of a fast sorting algorithm to search large sequence databases for cross-linked peptide assignments based on mass. This same algorithm has been used previously for assigning disulfide-bridged peptides (Choi et al., ), but has not previously been applied to cross-linking studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A genetic algorithm solution to the unit commitment problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kazarlis, S.A.; Bakirtzis, A.G.; Petridis, V.

1996-02-01

This paper presents a Genetic Algorithm (GA) solution to the Unit Commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple Ga algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the Varying Quality Function technique and adding problem specific operators, satisfactory solutions to the Unit Commitment problem were obtained. Test results for systems of up to 100 unitsmore » and comparisons with results obtained using Lagrangian Relaxation and Dynamic Programming are also reported.« less

Curvilinear Immersed Boundary Method for Simulating Fluid Structure Interaction with Complex 3D Rigid Bodies

PubMed Central

Borazjani, Iman; Ge, Liang; Sotiropoulos, Fotis

2010-01-01

The sharp-interface CURVIB approach of Ge and Sotiropoulos [L. Ge, F. Sotiropoulos, A Numerical Method for Solving the 3D Unsteady Incompressible Navier-Stokes Equations in Curvilinear Domains with Complex Immersed Boundaries, Journal of Computational Physics 225 (2007) 1782–1809] is extended to simulate fluid structure interaction (FSI) problems involving complex 3D rigid bodies undergoing large structural displacements. The FSI solver adopts the partitioned FSI solution approach and both loose and strong coupling strategies are implemented. The interfaces between immersed bodies and the fluid are discretized with a Lagrangian grid and tracked with an explicit front-tracking approach. An efficient ray-tracing algorithm is developed to quickly identify the relationship between the background grid and the moving bodies. Numerical experiments are carried out for two FSI problems: vortex induced vibration of elastically mounted cylinders and flow through a bileaflet mechanical heart valve at physiologic conditions. For both cases the computed results are in excellent agreement with benchmark simulations and experimental measurements. The numerical experiments suggest that both the properties of the structure (mass, geometry) and the local flow conditions can play an important role in determining the stability of the FSI algorithm. Under certain conditions unconditionally unstable iteration schemes result even when strong coupling FSI is employed. For such cases, however, combining the strong-coupling iteration with under-relaxation in conjunction with the Aitken’s acceleration technique is shown to effectively resolve the stability problems. A theoretical analysis is presented to explain the findings of the numerical experiments. It is shown that the ratio of the added mass to the mass of the structure as well as the sign of the local time rate of change of the force or moment imparted on the structure by the fluid determine the stability and convergence of the FSI algorithm. The stabilizing role of under-relaxation is also clarified and an upper bound of the required for stability under-relaxation coefficient is derived. PMID:20981246

Entropic multi-relaxation free-energy lattice Boltzmann model for two-phase flows

NASA Astrophysics Data System (ADS)

Bösch, F.; Dorschner, B.; Karlin, I.

2018-04-01

The entropic multi-relaxation lattice Boltzmann method is extended to two-phase systems following the free-energy approach. Gain in stability is achieved by incorporating the force term due to Korteweg's stress into the redefined entropic stabilizer, which allows simulation of higher Weber and Reynolds numbers with an efficient and explicit algorithm. Results for head-on droplet collisions and droplet impact on super-hydrophobic substrates are matching experimental data accurately. Furthermore, it is demonstrated that the entropic stabilization leads to smaller spurious currents without affecting the interface thickness. The present findings demonstrate the universality of the simple and explicit entropic lattice Boltzmann models and provide a viable and robust alternative to existing methods.

Mapping implicit spectral methods to distributed memory architectures

NASA Technical Reports Server (NTRS)

Overman, Andrea L.; Vanrosendale, John

1991-01-01

Spectral methods were proven invaluable in numerical simulation of PDEs (Partial Differential Equations), but the frequent global communication required raises a fundamental barrier to their use on highly parallel architectures. To explore this issue, a 3-D implicit spectral method was implemented on an Intel hypercube. Utilization of about 50 percent was achieved on a 32 node iPSC/860 hypercube, for a 64 x 64 x 64 Fourier-spectral grid; finer grids yield higher utilizations. Chebyshev-spectral grids are more problematic, since plane-relaxation based multigrid is required. However, by using a semicoarsening multigrid algorithm, and by relaxing all multigrid levels concurrently, relatively high utilizations were also achieved in this harder case.

Mechanical response of transient telechelic networks with many-part stickers

NASA Astrophysics Data System (ADS)

Sing, Michelle K.; Ramírez, Jorge; Olsen, Bradley D.

2017-11-01

A central question in soft matter is understanding how several individual, weak bonds act together to produce collective interactions. Here, gel-forming telechelic polymers with multiple stickers at each chain end are studied through Brownian dynamics simulations to understand how collective interaction of the bonds affects mechanical response of the gels. These polymers are modeled as finitely extensible dumbbells using an explicit tau-leap algorithm and the binding energy of these associations was kept constant regardless of the number of stickers. The addition of multiple bonds to the associating ends of telechelic polymers increases or decreases the network relaxation time depending on the relative kinetics of association but increases both shear stress and extensional viscosity. The relationship between the rate of association and the Rouse time of dangling chains results in two different regimes for the equilibrium stress relaxation of associating physical networks. In case I, a dissociated dangling chain is able to fully relax before re-associating to the network, resulting in two characteristic relaxation times and a non-monotonic terminal relaxation time with increasing number of bonds per polymer endgroup. In case II, the dissociated dangling chain is only able to relax a fraction of the way before it re-attaches to the network, and increasing the number of bonds per endgroup monotonically increases the terminal relaxation time. In flow, increasing the number of stickers increases the steady-state shear and extensional viscosities even though the overall bond kinetics and equilibrium constant remain unchanged. Increased dissipation in the simulations is primarily due to higher average chain extension with increasing bond number. These results indicate that toughness and dissipation in physically associating networks can both be increased by breaking single, strong bonds into smaller components.

Time scale bridging in atomistic simulation of slow dynamics: viscous relaxation and defect activation

NASA Astrophysics Data System (ADS)

Kushima, A.; Eapen, J.; Li, Ju; Yip, S.; Zhu, T.

2011-08-01

Atomistic simulation methods are known for timescale limitations in resolving slow dynamical processes. Two well-known scenarios of slow dynamics are viscous relaxation in supercooled liquids and creep deformation in stressed solids. In both phenomena the challenge to theory and simulation is to sample the transition state pathways efficiently and follow the dynamical processes on long timescales. We present a perspective based on the biased molecular simulation methods such as metadynamics, autonomous basin climbing (ABC), strain-boost and adaptive boost simulations. Such algorithms can enable an atomic-level explanation of the temperature variation of the shear viscosity of glassy liquids, and the relaxation behavior in solids undergoing creep deformation. By discussing the dynamics of slow relaxation in two quite different areas of condensed matter science, we hope to draw attention to other complex problems where anthropological or geological-scale time behavior can be simulated at atomic resolution and understood in terms of micro-scale processes of molecular rearrangements and collective interactions. As examples of a class of phenomena that can be broadly classified as materials ageing, we point to stress corrosion cracking and cement setting as opportunities for atomistic modeling and simulations.

Weighted cubic and biharmonic splines

NASA Astrophysics Data System (ADS)

Kvasov, Boris; Kim, Tae-Wan

2017-01-01

In this paper we discuss the design of algorithms for interpolating discrete data by using weighted cubic and biharmonic splines in such a way that the monotonicity and convexity of the data are preserved. We formulate the problem as a differential multipoint boundary value problem and consider its finite-difference approximation. Two algorithms for automatic selection of shape control parameters (weights) are presented. For weighted biharmonic splines the resulting system of linear equations can be efficiently solved by combining Gaussian elimination with successive over-relaxation method or finite-difference schemes in fractional steps. We consider basic computational aspects and illustrate main features of this original approach.

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Molzahn, Daniel K.

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

Computing the Feasible Spaces of Optimal Power Flow Problems

DOE PAGES

Molzahn, Daniel K.

2017-03-15

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC)more » algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.« less

THE MUTAGENICITY OF METALLIZED AND UNMETALLIZED AZO AND FORMAZAN DYES IN THE SALMONELLA MUTAGENICITY ASSAY

EPA Science Inventory

The mutagenicity of metallized and unmetallized azo and formazan dyes in the Salmonella mutagenicity
Laura. C. Edwards', Harold S. Freeman'*, and Larry D. Claxton2

Abstract
In previous papers, the synthesis and chemical properties of iron complexed azo and formazan d...

Modeling Incremental Initial Active Duty Continuation Probabilities in the Selected Marine Corps Reserve

DTIC Science & Technology

2014-03-01

Regression. 2nd ed. Hoboken, NJ: John Wiley & Sons, 2000. Lien, Dianna, Aline Quester, and Robert Shuford, Marine Corps Deployment Tempo and Retention...calhoun.nps.edu/public/bitstream/handle/10945/5778/11Mar_Lizarraga.pdf? sequence=1 Quester, Aline , Laura Kelley, Cathy Hiatt, and Robert Shoford. Marine

Storytime in a Digital World: Making a Case for Thinking Outside the Book

ERIC Educational Resources Information Center

Paganelli, Andrea

2016-01-01

Storytime is an important fixture in many school libraries that helps foster students' reading abilities. With a history of success, why would librarians want to alter storytime by incorporating technology? This article discusses how Laura Fleming, a long-time school librarian, addressed decreased student engagement in traditional reading…

Cultivating Inquiry-Driven Learners: A College Education for the Twenty-First Century

ERIC Educational Resources Information Center

Conrad, Clifton; Dunek, Laura

2012-01-01

Inquiry-driven learners anticipate, embrace, and adapt to disruptive change. Clifton Conrad and Laura Dunek advance a transformative purpose of a college education. They invite stakeholders from across higher education to engage in vigorous dialogue about the aims of a college education--and how to realize those aims. Increasingly influenced by…

77 FR 11195 - Surety Companies Acceptable on Federal Bonds-Name Change and Change in State of Incorporation...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-24

..., Financial Management Service, Financial Accounting and Services Division, Surety Bond Branch, 3700 East-West Highway, Room 6F01, Hyattsville, MD 20782. Dated: February 15, 2012. Laura Carrico, Director, Financial... Change and Change in State of Incorporation: Nations Bonding Company AGENCY: Financial Management Service...

A New Take on the Field Trip

ERIC Educational Resources Information Center

Lukes, Laura

2014-01-01

Because Laura Lukes used to be a geologist, when she started teaching science, she wanted to incorporate field experiences in her classroom. But, like many teachers, she faced obstacles: insufficient budgets, testing requirements, a lack of chaperones and transportation, and the safety concerns that come with fieldwork. As a result, a real field…

Sequential Art, the White House Conference, and School Library Media Specialists.

ERIC Educational Resources Information Center

Barron, Daniel D.

2002-01-01

Discusses sequential art, also known as comic books or graphic novels, as reading motivators, as content, as literature, and as the subject itself. Includes comic resources for school library media specialists and describes the White House Conference that Laura Bush has promoted that has given library media centers national visibility. (LRW)

ACHP | News | Mrs. Laura Bush Designates 61 New Preserve America

Science.gov Websites

commitment to preserving an important part of our Nation's historic past for visitors, neighbors, and, most of the initiative include a greater shared knowledge about the Nation's past; strengthened regional tourism efforts, and eligibility for proposed Preserve America grants that will begin in Fiscal Year 2005

MEASURED CONCENTRATIONS OF HERBICIDES AND MODEL PREDICTIONS OF ATRAZINE FATE IN THE PATUXENT RIVER ESTUARY

EPA Science Inventory

McConnell, Laura L., Jennifer A. Harman-Fetcho and James D. Hagy, III. 2004. Measured Concentrations of Herbicides and Model Predictions of Atrazine Fate in the Patuxent River Estuary. J. Environ. Qual. 33(2):594-604. (ERL,GB X1051).

The environmental fate of herbicides i...

Thirteen for Thirteen-Year-Olds

ERIC Educational Resources Information Center

Instructor, 2011

2011-01-01

What does it take to reach a middle school reader? Literacy expert Laura Robb recently shared her top strategies in a webcast for Scholastic fans. This article presents Robb's 13 strategies for thirteen-year-olds. These are: (1) Respect students' search for self; (2) Embrace blogging; (3) Send texts in class; (4) Take words apart; (5) Build…

Music Activities for "Mama", "Mama" and "Papa", "Papa"

ERIC Educational Resources Information Center

Cardany, Audrey Berger

2011-01-01

Jean Marzollo creates two beautiful texts using a child's first words, "Mama, Mama" and "Papa, Papa" as a recurring theme. Wildlife artist, Laura Regan, illustrates Marzollo's poetry with loving images of parents and children in the animal kingdom. Poetry and illustrations highlight the tenderness and care of Mama and Papa as they bond with their…

ACHP | News | Mrs. Laura Bush Designates 31 Preserve America Communities in

Science.gov Websites

tourism for the state and its communities, and an effort headed by the State Historic Preservation Officer promotional materials; notification to media, State tourism offices, and visitor bureaus; and listing on a Web -based directory to showcase preservation efforts and highlight heritage tourism destinations. The Bush

ACHP | News | Mrs. Laura Bush Designates Corinth, Mississippi, a Preserve

Science.gov Websites

; notification to media, state tourism offices, and visitor bureaus; and listing on a Web-based directory to showcase preservation efforts and highlight heritage tourism destinations. The Bush Administration's fiscal promotion of heritage tourism and other economic revitalization projects. John L. Nau, III, chairman of the

77 FR 14568 - Earned Import Allowance Program: Evaluation of the Effectiveness of the Program for Certain...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-12

... docket (EDIS) at http://edis.usitc.gov . FOR FURTHER INFORMATION CONTACT: Project Leader Laura Rodriguez (202- 205-3499 or [email protected] ) for information specific to this investigation. For information on the legal aspects of this investigation, contact William Gearhart of the Commission's Office of...

Segmentation and Classification of Burn Color Images

DTIC Science & Technology

2001-10-25

SEGMENTATION AND CLASSIFICATION OF BURN COLOR IMAGES Begoña Acha1, Carmen Serrano1, Laura Roa2 1Área de Teoría de la Señal y Comunicaciones ...2000, Las Vegas (USA), pp. 411-415. [21] G. Wyszecki and W.S. Stiles, Color Science: Concepts and Methods, Quantitative Data and Formulae (New

Where Daggers Are Only of the Mind

ERIC Educational Resources Information Center

Monaghan, Peter

2007-01-01

Laura Bates, an associate professor of English at Indiana State University, teaches college courses at Wabash Valley Correctional Facility, but her Shakespeare workshop is a rarer undertaking, with a startling history. About six years ago, an inmate in one of her college-degree courses was sent from the general population to the "SHU"--the…

Collaboration: A Reply to Bowern & Warner's Reply

ERIC Educational Resources Information Center

Robinson, Laura; Crippen, James

2015-01-01

Although Laura Robinson and James Crippen disagree strongly with a number of Bowern and Warner's [see EJ1075309] characterizations of their own paper ["In Defense of the Lone Wolf: Collaboration in Language Documentation" v7 p123-135 2013], Robinson and Crippen do agree with most of Bowern and Warner's assertions. In this reply, Robinson…

Working in the Virtual Stacks: The New Library and Information Science

ERIC Educational Resources Information Center

Kane, Laura Townsend, Ed.

2011-01-01

Thanks in part to technology, the boundaries of library positions are dissolving. It is no longer practical to discuss the profession in terms of traditional library types, and in today's library, the relationship between librarians and technology is stronger than ever. In this informative volume, veteran author Laura Townsend Kane interviews…

Must Public Education Restore Its Image as Great Equalizer?

ERIC Educational Resources Information Center

Carr, Nora

2006-01-01

Widely viewed today by many taxpayers, business leaders, and elected officials as inefficient, ineffective, bureaucratic, public education is losing its once-noble brand position as the cornerstone of American democracy. According to Laura Ries, a marketing guru, the first problem is the name, it is called public education. It is because the…

Combat Risk and Pay: Theory and Some Evidence

DTIC Science & Technology

2011-10-01

Kavanagh, and Laura Miller. 2006. “How Deployments Affect Service Members.” RAND Report MG432. Hosek, James R. and Mark E. Totten . 2004. “The Effect of...Richard Layard, 12: 641 92. Amsterdam, Netherlands: North Holland Publishing Co. Shogren, Jason F. and Tommy Stamland. 2002. “Skill and the Value of

Child Discourse. Language, Thought, and Culture: Advances in the Study of Cognition.

ERIC Educational Resources Information Center

Ervin-Tripp, Susan, Ed.; Mitchell-Kernan, Claudia, Ed.

The following essays on children's spoken language are included in this volume: "Play with Language and Speech" by Catherin Garvey, "'You Fruithead': A Sociolinguistic Approach to Children's Dispute Settlement" by Donald Brenneis and Laura Lein, "From Verbal Play to Talk Story: The Role of Routines in Speech Events among…

Proceedings: Conference on the Community/Junior College (Knoxville, Tennessee, April 25-26, 1974).

ERIC Educational Resources Information Center

McCullough, K. Owen, Ed.

Presented at the 1974 Community/Junior College Conference, the papers in this monograph examine issues related to institutional, program, staff, and student evaluation. After K. Owen McCullough's and Earl M. Ramer's prefatory remarks, Laura Bornholdt presents a typology of negative staff attitudes toward program and institutional evaluations;…

ACHP | News | Mrs. Laura Bush Presents "Preserve America History Teacher

Science.gov Websites

cases. However, regulatory and statutory changes since then have significantly altered case management practices. The Section 106 review process has evolved to focus ACHP participation on high-profile cases . Involvement in these cases can also lead the ACHP to pursue broad changes to Federal agency programs or

Harvard Education Letter. Volume 23, Number 2, March-April 2007

ERIC Educational Resources Information Center

Chauncey, Caroline, Ed.

2007-01-01

"Harvard Education Letter" is published bimonthly at the Harvard Graduate School of Education. This issue of "Harvard Education Letter" contains the following articles: (1) More Than "Making Nice": Getting Teachers to (Truly) Collaborate (Laura Pappano); (2) "Doing the Critical Things First": An Aligned Approach to PreK and Early Elementary Math;…

Implementing No Child Left Behind in Three States. Research Brief

ERIC Educational Resources Information Center

Stecher, Brian M.; Epstein, Scott; Hamilton, Laura S.; Marsh, Julie A.; Robyn, Abby; McCombs, Jennifer Sloan; Russell, Jennifer; Naftel, Scott

2008-01-01

This research brief describes work done for RAND Education and documented in "Pain and Gain: Implementing No Child Left Behind in Three States, 2004-2006", Brian M. Stecher, Scott Epstein, Laura S. Hamilton, Julie A. Marsh, Abby Robyn, Jennifer Sloan McCombs, Jennifer Russell, and Scott Naftel." The three states discussed are:…

Histories of Special Education: Stories from Our Past, Insights for Our Future.

ERIC Educational Resources Information Center

Smith, J. David

1998-01-01

Discusses the contributions of historical research to special education and describes the research by Margaret Mead, the views of Helen Keller, and Laura Bridgman, and the work of Samuel Gridley Howe. The importance of understanding aspects of people and events that have previously been overlooked is emphasized. (CR)

Maximum Margin Clustering of Hyperspectral Data

NASA Astrophysics Data System (ADS)

Niazmardi, S.; Safari, A.; Homayouni, S.

2013-09-01

In recent decades, large margin methods such as Support Vector Machines (SVMs) are supposed to be the state-of-the-art of supervised learning methods for classification of hyperspectral data. However, the results of these algorithms mainly depend on the quality and quantity of available training data. To tackle down the problems associated with the training data, the researcher put effort into extending the capability of large margin algorithms for unsupervised learning. One of the recent proposed algorithms is Maximum Margin Clustering (MMC). The MMC is an unsupervised SVMs algorithm that simultaneously estimates both the labels and the hyperplane parameters. Nevertheless, the optimization of the MMC algorithm is a non-convex problem. Most of the existing MMC methods rely on the reformulating and the relaxing of the non-convex optimization problem as semi-definite programs (SDP), which are computationally very expensive and only can handle small data sets. Moreover, most of these algorithms are two-class classification, which cannot be used for classification of remotely sensed data. In this paper, a new MMC algorithm is used that solve the original non-convex problem using Alternative Optimization method. This algorithm is also extended for multi-class classification and its performance is evaluated. The results of the proposed algorithm show that the algorithm has acceptable results for hyperspectral data clustering.

Multi-task feature selection in microarray data by binary integer programming.

PubMed

Lan, Liang; Vucetic, Slobodan

2013-12-20

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.

Experiences with serial and parallel algorithms for channel routing using simulated annealing

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

ERIC Educational Resources Information Center

Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

2011-01-01

JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

Real-time Continuous Assessment Method for Mental and Physiological Condition using Heart Rate Variability

NASA Astrophysics Data System (ADS)

Yoshida, Yutaka; Yokoyama, Kiyoko; Ishii, Naohiro

It is necessary to monitor the daily health condition for preventing stress syndrome. In this study, it was proposed the method assessing the mental and physiological condition, such as the work stress or the relaxation, using heart rate variability at real time and continuously. The instantanuous heart rate (HR), and the ratio of the number of extreme points (NEP) and the number of heart beats were calculated for assessing mental and physiological condition. In this method, 20 beats heart rate were used to calculate these indexes. These were calculated in one beat interval. Three conditions, which are sitting rest, performing mental arithmetic and watching relaxation movie, were assessed using our proposed algorithm. The assessment accuracies were 71.9% and 55.8%, when performing mental arithmetic and watching relaxation movie respectively. In this method, the mental and physiological condition was assessed using only 20 regressive heart beats, so this method is considered as the real time assessment method.

Time-domain approach for the transient responses in stratified viscoelastic Earth models

NASA Technical Reports Server (NTRS)

Hanyk, L.; Moser, J.; Yuen, D. A.; Matyska, C.

1995-01-01

We have developed the numerical algorithm for the computation of transient viscoelastic responses in the time domain for a radially stratified Earth model. Stratifications in both the elastic parameters and the viscosity profile have been considered. The particular viscosity profile employed has a viscosity maximum with a constrast of O(100) in the mid lower mantle. The distribution of relaxation times reveals the presence of a continuous spectrum situated between O(100) and O(exp 4) years. The principal mode is embedded within this continuous spectrum. From this initial-value approach we have found that for the low degree harmonics the non-modal contributions are comparable to the modal contributions. For this viscosity model the differences between the time-domain and normal-mode results are found to decrease strongly with increasing angular order. These calculations also show that a time-dependent effective relaxation time can be defined, which can be bounded by the relaxation times of the principal modes.

A unified inversion scheme to process multifrequency measurements of various dispersive electromagnetic properties

NASA Astrophysics Data System (ADS)

Han, Y.; Misra, S.

2018-04-01

Multi-frequency measurement of a dispersive electromagnetic (EM) property, such as electrical conductivity, dielectric permittivity, or magnetic permeability, is commonly analyzed for purposes of material characterization. Such an analysis requires inversion of the multi-frequency measurement based on a specific relaxation model, such as Cole-Cole model or Pelton's model. We develop a unified inversion scheme that can be coupled to various type of relaxation models to independently process multi-frequency measurement of varied EM properties for purposes of improved EM-based geomaterial characterization. The proposed inversion scheme is firstly tested in few synthetic cases in which different relaxation models are coupled into the inversion scheme and then applied to multi-frequency complex conductivity, complex resistivity, complex permittivity, and complex impedance measurements. The method estimates up to seven relaxation-model parameters exhibiting convergence and accuracy for random initializations of the relaxation-model parameters within up to 3-orders of magnitude variation around the true parameter values. The proposed inversion method implements a bounded Levenberg algorithm with tuning initial values of damping parameter and its iterative adjustment factor, which are fixed in all the cases shown in this paper and irrespective of the type of measured EM property and the type of relaxation model. Notably, jump-out step and jump-back-in step are implemented as automated methods in the inversion scheme to prevent the inversion from getting trapped around local minima and to honor physical bounds of model parameters. The proposed inversion scheme can be easily used to process various types of EM measurements without major changes to the inversion scheme.

Measurement of short transverse relaxation times by pseudo-echo nutation experiments

NASA Astrophysics Data System (ADS)

Ferrari, Maude; Moyne, Christian; Canet, Daniel

2018-07-01

Very short NMR transverse relaxation times may be difficult to measure by conventional methods. Nutation experiments constitute an alternative approach. Nutation is, in the rotating frame, the equivalent of precession in the laboratory frame. It consists in monitoring the rotation of magnetization around the radio-frequency (rf) field when on-resonance conditions are fulfilled. Depending on the amplitude of the rf field, nutation may be sensitive to the two relaxation rates R1 and R2. A full theoretical development has been worked out for demonstrating how these two relaxation rates could be deduced from a simple nutation experiment, noticing however that inhomogeneity of the rf field may lead to erroneous results. This has led us to devise new experiments which are the equivalent of echo techniques in the rotating frame (pseudo spin-echo nutation experiment and pseudo gradient-echo experiment). Full equations of motion have been derived. Although complicated, they indicate that the sum of the two relaxation rates can be obtained very accurately and not altered by rf field inhomogeneity. This implies however an appropriate data processing accounting for the oscillations which are superposed to the echo decays and, anyway, theoretically predicted. A series of experiments has been carried out for different values of the rf field amplitude on samples of water doped with a paramagnetic compound at different concentrations. Pragmatically, as R1 can be easily measured by conventional methods, its value is entered in the data processing algorithm which then returns exclusively the value of the transverse relaxation time. Very consistent results are obtained that way.

Measurement of short transverse relaxation times by pseudo-echo nutation experiments.

PubMed

Ferrari, Maude; Moyne, Christian; Canet, Daniel

2018-05-03

Very short NMR transverse relaxation times may be difficult to measure by conventional methods. Nutation experiments constitute an alternative approach. Nutation is, in the rotating frame, the equivalent of precession in the laboratory frame. It consists in monitoring the rotation of magnetization around the radio-frequency (rf) field when on-resonance conditions are fulfilled. Depending on the amplitude of the rf field, nutation may be sensitive to the two relaxation rates R 1 and R 2 . A full theoretical development has been worked out for demonstrating how these two relaxation rates could be deduced from a simple nutation experiment, noticing however that inhomogeneity of the rf field may lead to erroneous results. This has led us to devise new experiments which are the equivalent of echo techniques in the rotating frame (pseudo spin-echo nutation experiment and pseudo gradient-echo experiment). Full equations of motion have been derived. Although complicated, they indicate that the sum of the two relaxation rates can be obtained very accurately and not altered by rf field inhomogeneity. This implies however an appropriate data processing accounting for the oscillations which are superposed to the echo decays and, anyway, theoretically predicted. A series of experiments has been carried out for different values of the rf field amplitude on samples of water doped with a paramagnetic compound at different concentrations. Pragmatically, as R 1 can be easily measured by conventional methods, its value is entered in the data processing algorithm which then returns exclusively the value of the transverse relaxation time. Very consistent results are obtained that way. Copyright © 2018 Elsevier Inc. All rights reserved.

The hard winter of 1880-1881: Climatological context and communication via a Laura Ingalls Wilder narrative

NASA Astrophysics Data System (ADS)

Boustead, Barbara E.

The Hard Winter of 1880-1881 was featured in the Laura Ingalls Wilder historical fiction account, The Long Winter, as well as in several town histories across the region. Both meteorological records and historical accounts indicate that the winter was particularly long, snowy, and cold. The question of how "hard" a winter is for a given location depends on the climatological context, which relies on an objective characterization of winter severity. The Accumulated Winter Season Severity Index (AWSSI) allows comparison of the winter of 1880-1881 among sites across the region, as well as in the context of the period of record, to quantify its severity. Additionally, investigating the impacts of both the El Nino/Southern Oscillation (ENSO) and the North Atlantic Oscillation (NAO) in the central United States provides context for the influence of both a strongly negative NAO and an El Nino event during the winter of 1880-1881. With an understanding of the climatological factors influencing the Hard Winter, along with the context for its severity, a more thorough analysis then was conducted to quantify and describe its severity. The connection of the winter of 1880-1881 to a popular book written by an author who is a cultural icon provides a natural vehicle with which to communicate weather and climate concepts to multiple non-technical audiences. The communication of complex weather and climate concepts is a well-documented challenge. One method to bridge between science concepts and public understanding is to relate those concepts to familiar subjects and stories, including Laura Ingalls Wilder's books. A narrative constructed around the books, particularly The Long Winter, provides a means of audience engagement and interest in weather- and climate-related topics, which was at least partially quantified by surveying audiences of the narrative. Overall, the scientific background, combined with a familiar narrative voice, provides a means to transmit weather and climate.

Improvements to a five-phase ABS algorithm for experimental validation

NASA Astrophysics Data System (ADS)

Gerard, Mathieu; Pasillas-Lépine, William; de Vries, Edwin; Verhaegen, Michel

2012-10-01

The anti-lock braking system (ABS) is the most important active safety system for passenger cars. Unfortunately, the literature is not really precise about its description, stability and performance. This research improves a five-phase hybrid ABS control algorithm based on wheel deceleration [W. Pasillas-Lépine, Hybrid modeling and limit cycle analysis for a class of five-phase anti-lock brake algorithms, Veh. Syst. Dyn. 44 (2006), pp. 173-188] and validates it on a tyre-in-the-loop laboratory facility. Five relevant effects are modelled so that the simulation matches the reality: oscillations in measurements, wheel acceleration reconstruction, brake pressure dynamics, brake efficiency changes and tyre relaxation. The time delays in measurement and actuation have been identified as the main difficulty for the initial algorithm to work in practice. Three methods are proposed in order to deal with these delays. It is verified that the ABS limit cycles encircle the optimal braking point, without assuming any tyre parameter being a priori known. The ABS algorithm is compared with the commercial algorithm developed by Bosch.

A comparison of neural network and fuzzy clustering techniques in segmenting magnetic resonance images of the brain

NASA Technical Reports Server (NTRS)

Hall, Lawrence O.; Bensaid, Amine M.; Clarke, Laurence P.; Velthuizen, Robert P.; Silbiger, Martin S.; Bezdek, James C.

1992-01-01

Magnetic resonance (MR) brain section images are segmented and then synthetically colored to give visual representations of the original data with three approaches: the literal and approximate fuzzy c-means unsupervised clustering algorithms and a supervised computational neural network, a dynamic multilayered perception trained with the cascade correlation learning algorithm. Initial clinical results are presented on both normal volunteers and selected patients with brain tumors surrounded by edema. Supervised and unsupervised segmentation techniques provide broadly similar results. Unsupervised fuzzy algorithms were visually observed to show better segmentation when compared with raw image data for volunteer studies. However, for a more complex segmentation problem with tumor/edema or cerebrospinal fluid boundary, where the tissues have similar MR relaxation behavior, inconsistency in rating among experts was observed.

An efficient interior-point algorithm with new non-monotone line search filter method for nonlinear constrained programming

NASA Astrophysics Data System (ADS)

Wang, Liwei; Liu, Xinggao; Zhang, Zeyin

2017-02-01

An efficient primal-dual interior-point algorithm using a new non-monotone line search filter method is presented for nonlinear constrained programming, which is widely applied in engineering optimization. The new non-monotone line search technique is introduced to lead to relaxed step acceptance conditions and improved convergence performance. It can also avoid the choice of the upper bound on the memory, which brings obvious disadvantages to traditional techniques. Under mild assumptions, the global convergence of the new non-monotone line search filter method is analysed, and fast local convergence is ensured by second order corrections. The proposed algorithm is applied to the classical alkylation process optimization problem and the results illustrate its effectiveness. Some comprehensive comparisons to existing methods are also presented.

Joint segmentation of lumen and outer wall from femoral artery MR images: Towards 3D imaging measurements of peripheral arterial disease.

PubMed

Ukwatta, Eranga; Yuan, Jing; Qiu, Wu; Rajchl, Martin; Chiu, Bernard; Fenster, Aaron

2015-12-01

Three-dimensional (3D) measurements of peripheral arterial disease (PAD) plaque burden extracted from fast black-blood magnetic resonance (MR) images have shown to be more predictive of clinical outcomes than PAD stenosis measurements. To this end, accurate segmentation of the femoral artery lumen and outer wall is required for generating volumetric measurements of PAD plaque burden. Here, we propose a semi-automated algorithm to jointly segment the femoral artery lumen and outer wall surfaces from 3D black-blood MR images, which are reoriented and reconstructed along the medial axis of the femoral artery to obtain improved spatial coherence between slices of the long, thin femoral artery and to reduce computation time. The developed segmentation algorithm enforces two priors in a global optimization manner: the spatial consistency between the adjacent 2D slices and the anatomical region order between the femoral artery lumen and outer wall surfaces. The formulated combinatorial optimization problem for segmentation is solved globally and exactly by means of convex relaxation using a coupled continuous max-flow (CCMF) model, which is a dual formulation to the convex relaxed optimization problem. In addition, the CCMF model directly derives an efficient duality-based algorithm based on the modern multiplier augmented optimization scheme, which has been implemented on a GPU for fast computation. The computed segmentations from the developed algorithm were compared to manual delineations from experts using 20 black-blood MR images. The developed algorithm yielded both high accuracy (Dice similarity coefficients ≥ 87% for both the lumen and outer wall surfaces) and high reproducibility (intra-class correlation coefficient of 0.95 for generating vessel wall area), while outperforming the state-of-the-art method in terms of computational time by a factor of ≈ 20. Copyright © 2015 Elsevier B.V. All rights reserved.

On the suitability of the connection machine for direct particle simulation

NASA Technical Reports Server (NTRS)

Dagum, Leonard

1990-01-01

The algorithmic structure was examined of the vectorizable Stanford particle simulation (SPS) method and the structure is reformulated in data parallel form. Some of the SPS algorithms can be directly translated to data parallel, but several of the vectorizable algorithms have no direct data parallel equivalent. This requires the development of new, strictly data parallel algorithms. In particular, a new sorting algorithm is developed to identify collision candidates in the simulation and a master/slave algorithm is developed to minimize communication cost in large table look up. Validation of the method is undertaken through test calculations for thermal relaxation of a gas, shock wave profiles, and shock reflection from a stationary wall. A qualitative measure is provided of the performance of the Connection Machine for direct particle simulation. The massively parallel architecture of the Connection Machine is found quite suitable for this type of calculation. However, there are difficulties in taking full advantage of this architecture because of lack of a broad based tradition of data parallel programming. An important outcome of this work has been new data parallel algorithms specifically of use for direct particle simulation but which also expand the data parallel diction.

Spring Research Festival and NICBR Collaboration Winners Announced | Poster

Cancer.gov

By Carolynne Keenan, Contributing Writer, and Ashley DeVine, Staff Writer The winners of the 2014 Spring Research Festival (SRF), held May 7 and 8, were recognized on July 2, and included 20 NCI at Frederick researchers: Matthew Anderson, Victor Ayala, Matt Bess, Cristina Bergamaschi, Charlotte Choi, Rami Doueiri, Laura Guasch Pamies, Diana Haines, Saadia Iftikhar, Maria

"Why Do They Hate Us?": Leading amid Criticism, Crisis, and Disrespect

ERIC Educational Resources Information Center

Karpinski, Carol F.

2012-01-01

Laura Dannon, an educator with experience as teacher, assistant principal, and principal, enjoys her profession. Faculty camaraderie and student/teacher busyness at her school have led her to think all is well. A sudden outburst by a new teacher causes her to reflect on what is really happening. What has changed? Have media criticism, movements…

Developmental Advising--How? Why? Proceedings of the Region VII Conference on Academic Advising. (4th, Little Rock, Arkansas, May 15-17, 1988).

ERIC Educational Resources Information Center

Garnett, Donald T., Ed.

This report of a conference on developmental advising contains the following 18 papers: "An Introduction to the Myers-Briggs Type Indicator (MBTI)" (Roberta Corder); "Computer-Assisted Advising: The Personal Touch" (Susan Aldrich, Mark Peterson, Bruce Sands); "The Freshman Survey: Phase I" (Laura Lemonine);…

Intern Programs | Contacts

Science.gov Websites

Phone CCI Jonathan Lewis Manager jdl@fnal.gov 1-630-840-3779 GEM Sandra Charles Manager scharles gdzurics@fnal.gov 1-630-687-2929 SIST Sandra Charles Manager sist@fnal.gov 1-630-840-4574 Laura Fields Committee Chair sist@fnal.gov 1-630-840-8491 TARGET Sandra Charles Manager scharles@fnal.gov 1-630-840-4574

78 FR 63487 - Agency Information Collection Activities: Petition for a Nonimmigrant Worker, Form I-129...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-10-24

... interested in the public's experience, input, and estimates on the burden in terms of time and money incurred....regulations.gov . We may also be contacted at: USCIS, Office of Policy and Strategy, Regulatory Coordination... 21, 2013. Laura Dawkins, Chief, Regulatory Coordination Division, Office of Policy and Strategy, U.S...

78 FR 55083 - Submission for OMB Review; 30-day Comment Request; Genomics and Society Public Surveys in...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-09

... site. The URL for this survey site will also be advertised separately through media and social media... information on the proposed project, contact: Laura M. Koehly, Ph.D., Senior Investigator, Social and... in health conditions and associated risk factors; The role of friends, family, media, and health...

The White House Conference on School Libraries Proceedings (Washington, DC, June 4, 2002).

ERIC Educational Resources Information Center

Institute of Museum and Library Services, Washington, DC.

Laura Bush hosted a White House Conference on School Libraries on June 4, 2002, to discuss the latest research on libraries, student achievement and successful local programs. Mrs. Bush's cohost was Dr. Robert Martin, Director of the Institute of Museum and Library Services and education, library, government and philanthropic leaders from across…

Looking at Citizenship through a Literary Lens

ERIC Educational Resources Information Center

Tavares, Laura

2017-01-01

President Barack Obama once said he believes that he learned how to be a good citizen by reading novels. In this article, Laura Tavares looks at the ways that ELA teachers can use fiction to illustrate social and ethical awareness, humility, and a tolerance for difference--all traits that are necessary to be a good citizen. By putting themselves…

Minority Undergraduate Research in Prostate Cancer: Bridging Opportunities for Post-Baccalaureate Education

DTIC Science & Technology

2010-04-01

Rubrics for the ASBMB Undergraduate Poster Competition 2007 Dr. David Usher (Dept. of Biological Sciences), Tyler Larsen and Laura Sloofman. A good site...did his research on a genetic disease called Spinal Muscular Atrophy, also known as SMA. "I did research up at the Children’s Hospital because this is a

Significance of Marketing Practices for Work Force Preparation. National Marketing Education Research Conference (Key West, Florida, May 19-21, 1995).

ERIC Educational Resources Information Center

University of West Florida, Pensacola.

The following papers are included: "Concepts on Marketing Issues in the Czech Republic" (Anne Mills); "Requiring More of Teacher Preparation: Authentic Assessment as a Vehicle to Reform" (Laura J. Wyant); "A Delphi Study of Professional Competencies for the Secondary Marketing Educator" (Trellys A. Morris); "The…

ACHP | News | Laura Bush Announces Preserve America Grants Budget

Science.gov Websites

, Kentucky. In addition, Mrs. Bush announced two new education efforts to enhance the teaching of history in America's classrooms: Preserve America has worked with the History Channel's Save Our History initiative to support the creation of a history education manual. This manual provides teachers with lesson plans and

ACHP | News | First Lady Laura Bush Launches Preserve America Initiative

Science.gov Websites

historic architecture, landscapes and communities. Every one tells a story about the past and provides will be one of many opportunities for learning and recreation. In Idaho, modern-day explorers can Salmon and Lemhi Valleys is one of the few original portions still in existence. Visitors can see

Doing Social Media So It Matters: A Librarian's Guide

ERIC Educational Resources Information Center

Solomon, Laura

2010-01-01

Facebook, Twitter, MySpace, LinkedIn: it's difficult enough to keep abreast of social media Web sites, let alone understand how they fit into today's library. This practical resource brings together current information on the topic in a concise format that's easy to digest. Laura Solomon is a librarian with more than a decade of experience in Web…

Rescuing the Soiled Dove: Pop Culture's Influence on a Historical Narrative of Prostitution

ERIC Educational Resources Information Center

Voelkel, Micki; Henehan, Shelli

2018-01-01

American popular culture romanticises relationships between sex workers and their customers; novels, films and television depict prostitutes as innocents in need of rescue by a wealthy or powerful man. Miss Laura's Social Club, a restored Victorian brothel in Fort Smith, Arkansas, USA, functions both as an informal house museum and the visitor…

The Double Bind for Women: Exploring the Gendered Nature of Turnaround Leadership in a Principal Preparation Program

ERIC Educational Resources Information Center

Weiner, Jennie Miles; Burton, Laura J.

2016-01-01

In this study of nine participants in a turnaround principal preparation program, Jennie Miles Weiner and Laura J. Burton explore how gender role identity shaped participants' views of effective principal leadership and their place within it. The authors find that although female and male participants initially framed effective leadership…

Creation of a California Tribe: Grandfather's Maidu Indian Tales.

ERIC Educational Resources Information Center

Smith-Trafzer, Lee Ann; Trafzer, Clifford E.

This children's book relates the story of Travis and Laura and how their grandfather, a Maidu Indian, teaches them about their history and culture through stories. The book stresses the importance of storytelling as the traditional way of passing on the history of Indian peoples. As part of a school project, Travis tells his classmates the Maidu…

Alternative large-scale conservation visions for northern Maine: interviews with decision leaders in Maine

Treesearch

Elizabeth Dennis Baldwin; Laura S. Kenefic; Will F. LaPage

2007-01-01

Based on confidential interviews with 21 decision leaders in Maine, Elizabeth Baldwin, Laura Kenefic, and Will LaPage examine the complexity of the conflicts over alternate visions for large-scale conservation in Maine. Exploring models that may be useful for policymakers grappling with competing values for Maine's forests, they present four alternatives: national...

Establishing Sustainable Higher Education Partnerships in a Globally Competitive Environment

ERIC Educational Resources Information Center

Chigisheva, Oksana

2013-01-01

The paper written in the form of literature review is devoted to the analysis of the latest educational manuscripts by Laura M. Portnoi et al and Robin Sakamoto et al and provides a critical overview of possible partnership interactions in the actively globalizing sphere of world higher education. [For complete volume, see ED567118.

Dynamic Models of Insurgent Activity

DTIC Science & Technology

2014-05-19

Martin Short, P. Jeffrey Brantingham, Frederick Schoenberg, George Tita . Self-Exciting Point Process Modeling of Crime, Journal of the American...Mohler, P. J. Brantingham, G. E. Tita . Gang rivalry dynamics via coupled point process networks, Discrete and Continuous Dynamical Systems - Series...8532-2-1 Laura Smith, Andrea Bertozzi, P. Jeffrey Brantingham, George Tita , Matthew Valasik. ADAPTATION OF AN ECOLOGICAL TERRITORIAL MODEL TOSTREET

Giving Muslim Girls "A Voice": The Possibilities and Limits to Challenging Patriarchal Interpretations of Islam in One English Community

ERIC Educational Resources Information Center

Keddie, Amanda

2009-01-01

This paper presents the philosophies and practices of "Laura", a young English community liaison worker and former religious studies teacher who has recently converted to Islam. Drawing on data generated from a qualitative and predominantly interview-based research project that investigated issues of pedagogy and social justice in…

Correction: Seeing the "Big" Picture: Big Data Methods for Exploring Relationships Between Usage, Language, and Outcome in Internet Intervention Data.

PubMed

Carpenter, Jordan; Crutchley, Patrick; Zilca, Ran D; Schwartz, H Andrew; Smith, Laura K; Cobb, Angela M; Parks, Acacia C

2017-12-19

[This corrects the article DOI: 10.2196/jmir.5725.]. ©Jordan Carpenter, Patrick Crutchley, Ran D Zilca, H Andrew Schwartz, Laura K Smith, Angela M Cobb, Acacia C Parks. Originally published in the Journal of Medical Internet Research (http://www.jmir.org), 19.12.2017.

Increasing Access to College: Extending Possibilities for All Students. SUNY Series, Frontiers in Education.

ERIC Educational Resources Information Center

Tierney, William G., Ed.; Hagedorn, Linda Serra, Ed.

This collection of papers examines pre-college enrichment programs that offer a specific remedy to the problem of low income and underrepresented students' access to higher education. The 10 papers are: (1) "Pre-College Outreach Programs: A National Perspective" (Watson Scott Swail and Laura W. Perna); (2) "The Relationship between…

"Butterfly under a Pin": An Emergent Teacher Image amid Mandated Curriculum Reform

ERIC Educational Resources Information Center

Craig, Cheryl J.

2012-01-01

The author examines 1 experienced teacher's image of teaching and how it was purposely changed--through external intervention and against the individual's will--from the view of teacher as curriculum maker to the view of teacher as curriculum implementer. Laura's account of the "butterfly under a pin" image, a version of the…

Pilot Trial of Inpatient Cognitive Therapy for the Prevention of Suicide in Military Personnel with Acute Stress Disorder or Post-Traumatic Stress Disorder

DTIC Science & Technology

2013-08-01

meeting was held on April 14, 2013. The members of the DSMB included Dr. Sunil Bhar (Swinburne University), Dr. Walter Matweychuk (University of...Depression (NARSAD) Study Representatives: Dr. Marjan Holloway (PI); Dr. Laura Neely (Clinical Coordinator) DSMB Members: Dr. Sunil Bhar

Technology for Musicianship: Using the Internet for Music Instruction.

ERIC Educational Resources Information Center

Kassner, Kirk

2001-01-01

Presents descriptions of using the Internet for music instruction by Laura Ferguson, James F. Daugherty, and Sandi MacLeod. Covers topics such as steps for creating and publishing movies on a Web site, a template for electronic learning called ChoirONLINE based on the creative use of interactive Web forms, and the Vermont MIDI Project. (CMK)

Development in Mexico and Central America. Fulbright-Hays Summer Seminars Abroad Program. Summer 1991.

ERIC Educational Resources Information Center

Institute of International Education, New York, NY.

This document features writings and curriculum projects by teachers who traveled to Mexico and Central America in the summer of 1991 as members of a Fulbright-Hays Summer Seminar. The following items are among the 20 included: Curriculum Project: "'Escritoras Mexicanas Contemporaneas': A Survey of Mexican Women Fiction Writers" (Laura J.…

INHIBITION OF TOBACCO SMOKE-INDUCED LUNG INFLAMMATION BY A CATALYTIC ANTIOXIDANT

EPA Science Inventory

AMathematical Model for the Kinetics of the Male Reproductive Endocrine System

Laura K. Potter1,2, H.A. Barton2 and R.W. Setzer2
1Curriculum in Toxicology, UNC-Chapel Hill, NC; 2US EPA, ORD, NHEERL, ETD, RTP, NC

In this presentation a model for the hormonal regul...

Harvard Education Letter. Volume 23, Number 4, July-August 2007

ERIC Educational Resources Information Center

Chauncey, Caroline, Ed.

2007-01-01

"Harvard Education Letter" is published bimonthly by the Harvard Graduate School of Education. This issue of "Harvard Education Letter" contains the following articles: (1) Meeting of the Minds: The Parent-Teacher Conference Is the Cornerstone of School-Home Relations. How Can It Work for All Families? (Laura Pappano); (2) In Search of That "Third…

Providing a Global Education for Refugee Students: An Activity about Personal Budgeting

ERIC Educational Resources Information Center

Quaynor, Laura J.; Hamilton, Carrie

2012-01-01

In this article, the authors describe how a teacher (Carrie Hamilton) can scaffold and connect social studies concepts to a variety of students' experiences in meaningful ways. They draw on findings from Laura J. Quaynor's study about social studies education for immigrant students who are also refugees. Together, they discuss effective pedagogic…

Formation of Verbal Behavior of Deaf-Blind Children.

ERIC Educational Resources Information Center

Umezu, Hachizo

The monograph describes the development of verbal behavior over a 20-year period in two deaf Japanese children (5- and 7-years-old when first contacted by the author) with whom previous training attempts had failed. It is noted that prior training methods which had succeeded with Laura Bridgman and Helen Keller failed with these two children. A…

A generalized interval fuzzy mixed integer programming model for a multimodal transportation problem under uncertainty

NASA Astrophysics Data System (ADS)

Tian, Wenli; Cao, Chengxuan

2017-03-01

A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.

Explaining quantum correlations through evolution of causal models

NASA Astrophysics Data System (ADS)

Harper, Robin; Chapman, Robert J.; Ferrie, Christopher; Granade, Christopher; Kueng, Richard; Naoumenko, Daniel; Flammia, Steven T.; Peruzzo, Alberto

2017-04-01

We propose a framework for the systematic and quantitative generalization of Bell's theorem using causal networks. We first consider the multiobjective optimization problem of matching observed data while minimizing the causal effect of nonlocal variables and prove an inequality for the optimal region that both strengthens and generalizes Bell's theorem. To solve the optimization problem (rather than simply bound it), we develop a genetic algorithm treating as individuals causal networks. By applying our algorithm to a photonic Bell experiment, we demonstrate the trade-off between the quantitative relaxation of one or more local causality assumptions and the ability of data to match quantum correlations.

Fluid transport properties by equilibrium molecular dynamics. I. Methodology at extreme fluid states

NASA Astrophysics Data System (ADS)

Dysthe, D. K.; Fuchs, A. H.; Rousseau, B.

1999-02-01

The Green-Kubo formalism for evaluating transport coefficients by molecular dynamics has been applied to flexible, multicenter models of linear and branched alkanes in the gas phase and in the liquid phase from ambient conditions to close to the triple point. The effects of integration time step, potential cutoff and system size have been studied and shown to be small compared to the computational precision except for diffusion in gaseous n-butane. The RATTLE algorithm is shown to give accurate transport coefficients for time steps up to a limit of 8 fs. The different relaxation mechanisms in the fluids have been studied and it is shown that the longest relaxation time of the system governs the statistical precision of the results. By measuring the longest relaxation time of a system one can obtain a reliable error estimate from a single trajectory. The accuracy of the Green-Kubo method is shown to be as good as the precision for all states and models used in this study even when the system relaxation time becomes very long. The efficiency of the method is shown to be comparable to nonequilibrium methods. The transport coefficients for two recently proposed potential models are presented, showing deviations from experiment of 0%-66%.

Tumor segmentation of multi-echo MR T2-weighted images with morphological operators

NASA Astrophysics Data System (ADS)

Torres, W.; Martín-Landrove, M.; Paluszny, M.; Figueroa, G.; Padilla, G.

2009-02-01

In the present work an automatic brain tumor segmentation procedure based on mathematical morphology is proposed. The approach considers sequences of eight multi-echo MR T2-weighted images. The relaxation time T2 characterizes the relaxation of water protons in the brain tissue: white matter, gray matter, cerebrospinal fluid (CSF) or pathological tissue. Image data is initially regularized by the application of a log-convex filter in order to adjust its geometrical properties to those of noiseless data, which exhibits monotonously decreasing convex behavior. Finally the regularized data is analyzed by means of an 8-dimensional morphological eccentricity filter. In a first stage, the filter was used for the spatial homogenization of the tissues in the image, replacing each pixel by the most representative pixel within its structuring element, i.e. the one which exhibits the minimum total distance to all members in the structuring element. On the filtered images, the relaxation time T2 is estimated by means of least square regression algorithm and the histogram of T2 is determined. The T2 histogram was partitioned using the watershed morphological operator; relaxation time classes were established and used for tissue classification and segmentation of the image. The method was validated on 15 sets of MRI data with excellent results.

Closer insight into the structure of moderate to densely branched comb polymers by combining modelling and linear rheological measurements.

PubMed

Ahmadi, Mostafa; Pioge, Sandie; Fustin, Charles-Andre; Gohy, Jean-Francois; van Ruymbeke, Evelyne

2017-02-07

Synthesis of combs with well-entangled backbones and long branches with high densities has always been a challenge. Steric hindrance frequently leads to coupling of chains and structural imperfections that cannot be easily distinguished by traditional characterization methods. Research studies have therefore tried to use a combination of different methods to obtain more information on the actual microstructures. In this work, a grafting-from approach is used to synthesize poly(n-butyl acrylate) combs using atom transfer radical polymerization (ATRP) in three steps including the synthesis of a backbone, cleavage of protecting groups and growth of side branches. We have compared the linear viscoelastic properties theoretically predicted by a time marching algorithm (TMA) tube based model with the measured rheological behaviour to provide a better insight into the actual microstructure formed during synthesis. For combs with branches smaller than an entanglement, no discernible hierarchical relaxation can be distinguished, while for those with longer branches, a high frequency plateau made by entangled branches can be separated from backbone's relaxation. Dilution of the backbone, after relaxation of side branches, may accelerate the final relaxation, while extra friction can delay it especially for longer branches. Such a comparison provides a better assessment of the microstructure formed in combs.

Optimal Energy Efficiency Fairness of Nodes in Wireless Powered Communication Networks.

PubMed

Zhang, Jing; Zhou, Qingjie; Ng, Derrick Wing Kwan; Jo, Minho

2017-09-15

In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity.

Optimal Energy Efficiency Fairness of Nodes in Wireless Powered Communication Networks

PubMed Central

Zhou, Qingjie; Ng, Derrick Wing Kwan; Jo, Minho

2017-01-01

In wireless powered communication networks (WPCNs), it is essential to research energy efficiency fairness in order to evaluate the balance of nodes for receiving information and harvesting energy. In this paper, we propose an efficient iterative algorithm for optimal energy efficiency proportional fairness in WPCN. The main idea is to use stochastic geometry to derive the mean proportionally fairness utility function with respect to user association probability and receive threshold. Subsequently, we prove that the relaxed proportionally fairness utility function is a concave function for user association probability and receive threshold, respectively. At the same time, a sub-optimal algorithm by exploiting alternating optimization approach is proposed. Through numerical simulations, we demonstrate that our sub-optimal algorithm can obtain a result close to optimal energy efficiency proportional fairness with significant reduction of computational complexity. PMID:28914818

Evaluation of various deformable image registrations for point and volume variations

NASA Astrophysics Data System (ADS)

Han, Su Chul; Lee, Soon Sung; Kim, Mi-Sook; Ji, Young Hoon; Kim, Kum Bae; Choi, Sang Hyun; Park, Seungwoo; Jung, Haijo; Yoo, Hyung Jun; Yi, Chul Young

2015-07-01

The accuracy of deformable image registration (DIR) has a significant dosimetric impact in radiationtreatment planning. Many groups have studied the accuracy of DIR. In this study, we evaluatedthe accuracy of various DIR algorithms by using variations of the deformation point and volume.The reference image (I ref ) and volume (V ref ) were first generated by using virtual deformation QAsoftware (ImSimQA, Oncology System Limited, UK). We deformed I ref with axial movement of thedeformation point and V ref , depending on the type of deformation (relaxation and contraction) inImSimQA software. The deformed image (I def ) and volume (V def ) acquired by using the ImSimQAsoftware were inversely deformed relative to I ref and V ref by using DIR algorithms. As a result,we acquired a deformed image (I id ) from I def and volume (V id ) from V ref . Four intensity-basedalgorithms were tested by following the horn-schunk optical flow (HS), iterative optical flow (IOF),modified demons (MD) and fast demons (FD) with the Deformable Image Registration and AdaptiveRadiotherapy Toolkit (DIRART) of MATLAB. The image similarity between I ref and I id wascalculated to evaluate the accuracy of DIR algorithms using by Normalized Mutual Information(NMI) and Normalized Cross Correlation (NCC) metrics, when the distance of point deformationwas moved 4 mm, the value of NMI was above 1.81 and that of NCC was above 0.99 in all DIRalgorithms. As the degree of deformation was increased, the degree of image similarity decreased.When the V ref was increased or decreased by about 12%, the difference between V ref and V id waswithin ±5% regardless of the type of deformation, the deformation was classified into two types:deformation 1 increased the V ref (relaxation) and deformation 2 decreased the V ref (contraction).The value of the Dice Similarity Coefficient (DSC) was above 0.95 in deformation 1 except for theMD algorithm. In the case of deformation 2, the value of the DSC was above 0.95 in all DIR algorithms.The I def and the V def were not completely restored to I ref and V ref , and the accuracy ofthe DIR algorithms were different, depending on the degree of deformation. Hence, the performanceof DIR algorithms should be verified for the desired applications

An algorithm for the design and tuning of RF accelerating structures with variable cell lengths

NASA Astrophysics Data System (ADS)

Lal, Shankar; Pant, K. K.

2018-05-01

An algorithm is proposed for the design of a π mode standing wave buncher structure with variable cell lengths. It employs a two-parameter, multi-step approach for the design of the structure with desired resonant frequency and field flatness. The algorithm, along with analytical scaling laws for the design of the RF power coupling slot, makes it possible to accurately design the structure employing a freely available electromagnetic code like SUPERFISH. To compensate for machining errors, a tuning method has been devised to achieve desired RF parameters for the structure, which has been qualified by the successful tuning of a 7-cell buncher to π mode frequency of 2856 MHz with field flatness <3% and RF coupling coefficient close to unity. The proposed design algorithm and tuning method have demonstrated the feasibility of developing an S-band accelerating structure for desired RF parameters with a relatively relaxed machining tolerance of ∼ 25 μm. This paper discusses the algorithm for the design and tuning of an RF accelerating structure with variable cell lengths.

Robust automatic line scratch detection in films.

PubMed

Newson, Alasdair; Almansa, Andrés; Gousseau, Yann; Pérez, Patrick

2014-03-01

Line scratch detection in old films is a particularly challenging problem due to the variable spatiotemporal characteristics of this defect. Some of the main problems include sensitivity to noise and texture, and false detections due to thin vertical structures belonging to the scene. We propose a robust and automatic algorithm for frame-by-frame line scratch detection in old films, as well as a temporal algorithm for the filtering of false detections. In the frame-by-frame algorithm, we relax some of the hypotheses used in previous algorithms in order to detect a wider variety of scratches. This step's robustness and lack of external parameters is ensured by the combined use of an a contrario methodology and local statistical estimation. In this manner, over-detection in textured or cluttered areas is greatly reduced. The temporal filtering algorithm eliminates false detections due to thin vertical structures by exploiting the coherence of their motion with that of the underlying scene. Experiments demonstrate the ability of the resulting detection procedure to deal with difficult situations, in particular in the presence of noise, texture, and slanted or partial scratches. Comparisons show significant advantages over previous work.

The theory of variational hybrid quantum-classical algorithms

NASA Astrophysics Data System (ADS)

McClean, Jarrod R.; Romero, Jonathan; Babbush, Ryan; Aspuru-Guzik, Alán

2016-02-01

Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘the quantum variational eigensolver’ was developed (Peruzzo et al 2014 Nat. Commun. 5 4213) with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through a relaxation of exponential operator splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

Changing Faces of Reform. Proceedings of the Annual Rural & Small Schools Conference (18th, Manhattan, Kansas, October 27-28, 1996).

ERIC Educational Resources Information Center

Kansas State Univ., Manhattan. Center for Rural Education and Small Schools.

This proceedings contains abstracts of 21 presentations. Titles and presenters are: "Teaching and Learning in Multiage Classrooms" (Laura Blevins and others); "Leadership, School Reform and the Rural School Superintendent" (Mike Boone); "Teaching English as a Second Language from Theory to Practice" (Mingsheng Dai); "A Guide for Central Office…

76 FR 39967 - 30-Day Notice of Proposed Information Collection: U.S. National Commission for UNESCO Laura W...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-07

... submitted the following information collection request to the Office of Management and Budget (OMB) for... Benefit DATES: Submit comments to the Office of Management and Budget (OMB) for up to 30 days from July 7... and Regulatory Affairs at the Office of Management and Budget (OMB). You may submit comments by the...

A Decision Support Model Using Life Cycle Cost (LCC) Analysis to Select Cost-Effective Alternatives for Hazardous Materials

DTIC Science & Technology

1993-09-01

AF89-071. Washington: GPO, 1989. 159 14. Diaz , SSgt Laura, 648 Med Sq/SGHL. Personal interview. Brooks AFB, San Antonio TX, 14 July 1993. 15. EA...Training Strateav of the Acauisition Management of Hazardous Materials Program. Draft Report. McLean VA, August 1991. 36. Moore, SSgt Alicia . AL/OEVP

Advice for Fund Raisers: Know Your Donors and Never Let Them See You Sweat

ERIC Educational Resources Information Center

Masterson, Kathryn

2008-01-01

The psychology behind getting the big gift and making "the ask" for it was a major topic at Fund Raising Day in New York 2008, which drew representatives from across the nonprofit world, including charities, hospitals, colleges, and museums. Laura Fredricks, who was vice president for philanthropy at Pace University from 2002 until earlier this…

World War II Activity Day: Through the Eyes of Trainee Treachers

ERIC Educational Resources Information Center

Clark, Emily; Hornsby, Laura; Howard, Abigail; Pople, Kathryn

2013-01-01

As student teachers, authors Emily Clark, Laura Hornsby, Abigail Howard, and Kathryn Pople were aware of what the class had already covered on World War 2 (WW2). It was unclear to them, however, what knowledge the children actually had acquired from the lessons. In this article these student teachers describe their use of concept mapping as they…

Statewide and District Professional Development in Standards: Addressing Teacher Equity. Models of Inservice. National Writing Project at Work

ERIC Educational Resources Information Center

Koch, Richard; Roop, Laura; Setter, Gail

2006-01-01

The National Writing Project at Work (NWP) monograph series documents how the National Writing Project model is implemented and developed at local sites across the country. These monographs describe NWP work, which is often shared informally or in workshops. Richard Koch and Laura Roop present a model of standards-based professional development…

Censoring History: Citizenship and Memory in Japan, Germany, and the United States. Asia and the Pacific.

ERIC Educational Resources Information Center

Hein, Laura, Ed.; Selden, Mark, Ed.

This collection of essays focuses on textbook treatments of World War II in Japan, Germany, and the United States and gives readers a new perspective on the creation of national identities and international misunderstandings. Essays in the collection are: (1) "The Lessons of War, Global Power, and Social Change" (Laura Hein; Mark…

Unequal Fortunes: Snapshots from the South Bronx

ERIC Educational Resources Information Center

Levine, Arthur; Scheiber, Laura

2010-01-01

In this powerful book, Arthur Levine (president of the Woodrow Wilson Foundation) and coauthor Laura Scheiber revisit the South Bronx, where Levine grew up in the 1960s, and compare his experiences with those of a group of teenagers coming of age in the same neighborhood nearly 40 years later. Shaken by the violent death of Leo Disla, one of the…

Faculty Retirement. Proceedings from the Consortium on Financing Higher Education Retirement Conference (Providence, Rhode Island, October 31-November 1, 1980).

ERIC Educational Resources Information Center

Consortium on Financing Higher Education, Cambridge, MA.

Proceedings of a 1980 Brown University conference on faculty retirement are presented. Papers and authors are as follows: "A Review of Current Legal Status and National Policy Issues" (Laura C. Ford); "Mandatory Retirement Age Legislation for Tenured Faculty: The Policy Issues and Their Context" (W. Lee Hansen);…

Meteor Beliefs Project: ``Year of Meteors''

NASA Astrophysics Data System (ADS)

McBeath, Alastair; Drobnock, George J.; Gheorghe, Andrei Dorian

2011-10-01

We present a discussion linking ideas from a modern music album by Laura Veirs back to a turbulent time in American history 150 years ago, which inspired poet Walt Whitman to compose his poem "Year of Meteors", and the meteor beliefs of the period around 1859-1860, when collection of facts was giving way to analyses and theoretical explanations in meteor science.

Volunteer Flying Organizations: Law Enforcements Untapped Resource

DTIC Science & Technology

2016-12-01

ORGANIZATIONS: LAW ENFORCEMENT’S UNTAPPED RESOURCE by Christopher R. Laird December 2016 Thesis Advisor: Erik Dahl Second Reader: Laura...DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE VOLUNTEER FLYING ORGANIZATIONS: LAW ENFORCEMENT’S UNTAPPED RESOURCE 5. FUNDING NUMBERS 6...is unlimited. 12b. DISTRIBUTION CODE 13. ABSTRACT (maximum 200 words) Given the fiscal constraints of today’s law enforcement environment

A World of Magic: Conference Papers from the Selected Sessions of the AACRAO Annual Meeting (79th, Orlando, FL, April 18-23, 1993).

ERIC Educational Resources Information Center

Russell, Michele, Ed.

Papers on aspects of college admission, records, and institutional research functions are: "How To Improve Office Morale" (Victor Swenson); "Staff Meetings: How To Save Hours per Month and Develop Your Staff" (LuAnn Harris, Shelley Olsen); "Selling SPEED/ExPRESS" (Laura Patterson, Thomas Scott); "Advisement and…

78 FR 47327 - National Institute of Arthritis and Musculoskeletal and Skin Diseases; Notice of Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-05

... accordance with the provisions set forth in sections 552b(c)(4) and 552b(c)(6), Title 5 U.S.C., as amended...: Laura K. Moen, Ph.D., Director, Division of Extramural Research Activities, NIAMS/NIH, 6700 Democracy... show one form of identification (for example, a government-issued photo ID, driver's license, or...

Survivors on Campus: A Dialogue about Sexual Assault

ERIC Educational Resources Information Center

Gray-Rosendale, Laura; Dierking, Kirsten

2014-01-01

At a conference last fall, Kirsten Dierking came across "College Girl: A Memoir," a book by Laura Gray-Rosendale that tells the story of a brutal sexual assault she experienced as a college student. While she purchased a copy of the book, it sat unopened on her desk for a while; also a victim of brutal rape in college, she was not sure…

Choreographing Theory: An Analysis of Edouard Lock's "Amelia" (2002) Questioning the Limits of Feminist and Poststructuralist Perspectives

ERIC Educational Resources Information Center

Ireland, Ruby

2009-01-01

Edouard Lock's dance film "Amelia" (2002) is the focus of this essay. Second-wave feminist and poststructuralist perspectives inform the analysis of this piece of contemporary dance. Laura Mulvey's male gaze theory and Julia Kristeva's theory of the semiotic and symbolic realms of representation are explored and critiqued, whilst Jacques Derrida's…

Assessing 21st Century Skills: A Guide to Evaluating Mastery and Authentic Learning

ERIC Educational Resources Information Center

Greenstein, Laura

2012-01-01

The Common Core State Standards clearly define the skills students need for success in college and the 21st century workplace. The question is, how can you measure student mastery of skills like creativity, problem solving, and use of technology? Laura Greenstein demonstrates how teachers can teach and assess 21st century skills using authentic…

From Laura Ingalls to Wing Biddlebaum: A Study of Teacher Identity in Works of Literature

ERIC Educational Resources Information Center

Muchmore, James A.

2010-01-01

The purpose of this study is to systemically analyze the types of teachers that appear in works of literature, and to explore the various teacher identities that are depicted. The data consists of 44 works of literature representing a wide variety of genres, settings, cultures, and historical periods. They include 20 adult novels, 6 young adult…

Whose Deficit Is This Anyhow? Exploring Counter-Stories of Somali Bantu Refugees' Experiences in "Doing School"

ERIC Educational Resources Information Center

Roy, Laura A.; Roxas, Kevin C.

2011-01-01

In this article, Laura Roy and Kevin Roxas draw from two studies with Somali Bantu refugee families in South Texas and Michigan. Findings from both study sites revealed a disconnect between how educators perceived the Somali Bantu families' educational goals and Somali Bantu families' actual views of education. In contrast to educators'…

Establishing an Inclusive Educational System in Samara a Partnership between West Lothian, Barnardo's and Samara

ERIC Educational Resources Information Center

Currie, Laura-Ann; Prudnikova, Victoria; Yarkova, Natalya

2005-01-01

In this article, Laura Ann Currie and Victoria Prudnikova describe a three-year Russian/Scottish partnership designed to take forward an inclusive educational policy in the Samara Region of Russia. Education staff from West Lothian Council and Barnardo's visited the Samara Region to train staff there to help take forward their inclusion programme.…

Phytoremediation of Hazardous Wastes

DTIC Science & Technology

1995-07-26

TITLE AND SUBTITLE Phytoremediation of Hazardous Wastes 6. AUTHOR(S) Steven C. McCutcheon, N. Lee Wolfe, Laura H. Carreria and Tse-Yuan Ou 5... phytoremediation (the use of plants to degrade hazardous contaminants) was developed. The new approach to phytoremediation involves rigorous pathway analyses...SUBJECT TERMS phytoremediation , nitroreductase, laccase enzymes, SERDP 15. NUMBER OF PAGES 8 16. PRICE CODE N/A 17. SECURITY CLASSIFICATION OF

Sedimentary facies and Holocene depositional processes of Laura Island, Majuro Atoll

NASA Astrophysics Data System (ADS)

Yasukochi, Toru; Kayanne, Hajime; Yamaguchi, Toru; Yamano, Hiroya

2014-10-01

The depositional processes that formed Laura Island, Majuro Atoll, Marshall Islands, were reconstructed based on a facies analysis of island sediments and spine ratios, and radiocarbon ages of foraminifera. Sedimentary facies were analyzed from trenches and drill cores excavated on the island and its adjacent reef flat. Depositional ages were obtained using benthic foraminifera (Calcarina) whose spines had not been abraded. The facies were classified into two types: gravelly and sandy. The initial sediments of these sites consisted of gravelly facies in the lower horizon and sandy facies in the upper horizon. Their ages were approximately 2000 cal BP and coincident with the onset of a 1.1-m decline in regional relative sea level, which enabled deposition of the gravelly facies. Half of the sand fraction of the sediment was composed of larger benthic foraminifera. The spine ratio showed that their supply source on the reef flat was located oceanside of the island. The supply source appears to have been caused by the relative sea-level fall. This indicates that the studied island was formed by a relative reduction in wave energy and enhanced foraminiferal supply, both of which were triggered by the late Holocene relative sea-level fall.

Diagnostics of Dielectric Materials with Several Relaxation Times

NASA Astrophysics Data System (ADS)

Karpov, A. G.; Klemeshev, V. A.

2018-04-01

A set of means for detection and preprocessing of dielectrometric information has been suggested for studying the polarization/depolarization of dielectrics. Special attention has been paid to the processing of dielectrometric data for inhomogeneous materials using dielectric diagrams. Rapid analysis has been carried out the results of which can be used as initial approximations in more accurate (more complicated and time-consuming) iterative algorithms for model fitting.

A Novel Electrocardiogram Segmentation Algorithm Using a Multiple Model Adaptive Estimator

DTIC Science & Technology

2002-03-01

2-5 Figure 2-3. Typical Pulse Oximeter Placement [20].....................................................2-5 Figure 2-4...the heart contracts and then decreases when the heart relaxes. The pulse oximeter is typically place on a toe, finger, or earlobe as shown in Figure...2-3. Figure 2-2. Absorption as Light Passes Through the Body [24]. Figure 2-3. Typical Pulse Oximeter Placement [19]. The pulse

An upwind multigrid method for solving viscous flows on unstructured triangular meshes. M.S. Thesis

NASA Technical Reports Server (NTRS)

Bonhaus, Daryl Lawrence

1993-01-01

A multigrid algorithm is combined with an upwind scheme for solving the two dimensional Reynolds averaged Navier-Stokes equations on triangular meshes resulting in an efficient, accurate code for solving complex flows around multiple bodies. The relaxation scheme uses a backward-Euler time difference and relaxes the resulting linear system using a red-black procedure. Roe's flux-splitting scheme is used to discretize convective and pressure terms, while a central difference is used for the diffusive terms. The multigrid scheme is demonstrated for several flows around single and multi-element airfoils, including inviscid, laminar, and turbulent flows. The results show an appreciable speed up of the scheme for inviscid and laminar flows, and dramatic increases in efficiency for turbulent cases, especially those on increasingly refined grids.

A vectorization of the Jameson-Caughey NYU transonic swept-wing computer program FLO-22-V1 for the STAR-100 computer

NASA Technical Reports Server (NTRS)

Smith, R. E.; Pitts, J. I.; Lambiotte, J. J., Jr.

1978-01-01

The computer program FLO-22 for analyzing inviscid transonic flow past 3-D swept-wing configurations was modified to use vector operations and run on the STAR-100 computer. The vectorized version described herein was called FLO-22-V1. Vector operations were incorporated into Successive Line Over-Relaxation in the transformed horizontal direction. Vector relational operations and control vectors were used to implement upwind differencing at supersonic points. A high speed of computation and extended grid domain were characteristics of FLO-22-V1. The new program was not the optimal vectorization of Successive Line Over-Relaxation applied to transonic flow; however, it proved that vector operations can readily be implemented to increase the computation rate of the algorithm.

Kinetic Activation-Relaxation Technique and Self-Evolving Atomistic Kinetic Monte Carlo: Comparison of on-the-fly kinetic Monte Carlo algorithms

DOE PAGES

Beland, Laurent Karim; Osetskiy, Yury N.; Stoller, Roger E.; ...

2015-02-07

Here, we present a comparison of the Kinetic Activation–Relaxation Technique (k-ART) and the Self-Evolving Atomistic Kinetic Monte Carlo (SEAKMC), two off-lattice, on-the-fly Kinetic Monte Carlo (KMC) techniques that were recently used to solve several materials science problems. We show that if the initial displacements are localized the dimer method and the Activation–Relaxation Technique nouveau provide similar performance. We also show that k-ART and SEAKMC, although based on different approximations, are in agreement with each other, as demonstrated by the examples of 50 vacancies in a 1950-atom Fe box and of interstitial loops in 16,000-atom boxes. Generally speaking, k-ART’s treatment ofmore » geometry and flickers is more flexible, e.g. it can handle amorphous systems, and rigorous than SEAKMC’s, while the later’s concept of active volumes permits a significant speedup of simulations for the systems under consideration and therefore allows investigations of processes requiring large systems that are not accessible if not localizing calculations.« less

A novel partitioning method for block-structured adaptive meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fu, Lin, E-mail: lin.fu@tum.de; Litvinov, Sergej, E-mail: sergej.litvinov@aer.mw.tum.de; Hu, Xiangyu Y., E-mail: xiangyu.hu@tum.de

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtainmore » the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.« less

Post-seismic relaxation theory on laterally heterogeneous viscoelastic model

USGS Publications Warehouse

Pollitz, F.F.

2003-01-01

Investigation was carried out into the problem of relaxation of a laterally heterogeneous viscoelastic Earth following an impulsive moment release event. The formal solution utilizes a semi-analytic solution for post-seismic deformation on a laterally homogeneous Earth constructed from viscoelastic normal modes, followed by application of mode coupling theory to derive the response on the aspherical Earth. The solution is constructed in the Laplace transform domain using the correspondence principle and is valid for any linear constitutive relationship between stress and strain. The specific implementation described in this paper is a semi-analytic discretization method which assumes isotropic elastic structure and a Maxwell constitutive relation. It accounts for viscoelastic-gravitational coupling under lateral variations in elastic parameters and viscosity. For a given viscoelastic structure and minimum wavelength scale, the computational effort involved with the numerical algorithm is proportional to the volume of the laterally heterogeneous region. Examples are presented of the calculation of post-seismic relaxation with a shallow, laterally heterogeneous volume following synthetic impulsive seismic events, and they illustrate the potentially large effect of regional 3-D heterogeneities on regional deformation patterns.

NMR relaxometry study of plaster mortar with polymer additives

NASA Astrophysics Data System (ADS)

Jumate, E.; Moldovan, D.; Fechete, R.; Manea, D.

2013-11-01

The cement mixed with water forms a plastic paste or slurry which stiffness in time and finally hardens into a resistant stone. The addition of sand aggregates, polymers (Walocel) and/or calcium carbonate will modify dramatically the final mortar mechanic and thermal properties. The hydration processes can be observed using the 1D NMR measurements of transverse T2 relaxation times distributions analysed by a Laplace inversion algorithm. These distributions were obtained for mortar pasta measured at 2 hours after preparation then at 3, 7 and 28 days after preparation. Multiple components are identified in the T2 distributions. These can be associated with the proton bounded chemical or physical to the mortar minerals characterized by a short T2 relaxation time and to water protons in pores with three different pore sizes as observed from SEM images. The evaporation process is faster in the first hours after preparation, while the mortar hydration (bonding of water molecules to mortar minerals) can be still observed after days or months from preparation. Finally, the mechanic resistance was correlated with the transverse T2 relaxation rates corresponding to the bound water.

A novel partitioning method for block-structured adaptive meshes

NASA Astrophysics Data System (ADS)

Fu, Lin; Litvinov, Sergej; Hu, Xiangyu Y.; Adams, Nikolaus A.

2017-07-01

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

Multi-objective based spectral unmixing for hyperspectral images

NASA Astrophysics Data System (ADS)

Xu, Xia; Shi, Zhenwei

2017-02-01

Sparse hyperspectral unmixing assumes that each observed pixel can be expressed by a linear combination of several pure spectra in a priori library. Sparse unmixing is challenging, since it is usually transformed to a NP-hard l0 norm based optimization problem. Existing methods usually utilize a relaxation to the original l0 norm. However, the relaxation may bring in sensitive weighted parameters and additional calculation error. In this paper, we propose a novel multi-objective based algorithm to solve the sparse unmixing problem without any relaxation. We transform sparse unmixing to a multi-objective optimization problem, which contains two correlative objectives: minimizing the reconstruction error and controlling the endmember sparsity. To improve the efficiency of multi-objective optimization, a population-based randomly flipping strategy is designed. Moreover, we theoretically prove that the proposed method is able to recover a guaranteed approximate solution from the spectral library within limited iterations. The proposed method can directly deal with l0 norm via binary coding for the spectral signatures in the library. Experiments on both synthetic and real hyperspectral datasets demonstrate the effectiveness of the proposed method.

Parametric Quantum Search Algorithm as Quantum Walk: A Quantum Simulation

NASA Astrophysics Data System (ADS)

Ellinas, Demosthenes; Konstandakis, Christos

2016-02-01

Parametric quantum search algorithm (PQSA) is a form of quantum search that results by relaxing the unitarity of the original algorithm. PQSA can naturally be cast in the form of quantum walk, by means of the formalism of oracle algebra. This is due to the fact that the completely positive trace preserving search map used by PQSA, admits a unitarization (unitary dilation) a la quantum walk, at the expense of introducing auxiliary quantum coin-qubit space. The ensuing QW describes a process of spiral motion, chosen to be driven by two unitary Kraus generators, generating planar rotations of Bloch vector around an axis. The quadratic acceleration of quantum search translates into an equivalent quadratic saving of the number of coin qubits in the QW analogue. The associated to QW model Hamiltonian operator is obtained and is shown to represent a multi-particle long-range interacting quantum system that simulates parametric search. Finally, the relation of PQSA-QW simulator to the QW search algorithm is elucidated.

Distributed support vector machine in master-slave mode.

PubMed

Chen, Qingguo; Cao, Feilong

2018-05-01

It is well known that the support vector machine (SVM) is an effective learning algorithm. The alternating direction method of multipliers (ADMM) algorithm has emerged as a powerful technique for solving distributed optimisation models. This paper proposes a distributed SVM algorithm in a master-slave mode (MS-DSVM), which integrates a distributed SVM and ADMM acting in a master-slave configuration where the master node and slave nodes are connected, meaning the results can be broadcasted. The distributed SVM is regarded as a regularised optimisation problem and modelled as a series of convex optimisation sub-problems that are solved by ADMM. Additionally, the over-relaxation technique is utilised to accelerate the convergence rate of the proposed MS-DSVM. Our theoretical analysis demonstrates that the proposed MS-DSVM has linear convergence, meaning it possesses the fastest convergence rate among existing standard distributed ADMM algorithms. Numerical examples demonstrate that the convergence and accuracy of the proposed MS-DSVM are superior to those of existing methods under the ADMM framework. Copyright © 2018 Elsevier Ltd. All rights reserved.

Numerical evaluation of mobile robot navigation in static indoor environment via EGAOR Iteration

NASA Astrophysics Data System (ADS)

Dahalan, A. A.; Saudi, A.; Sulaiman, J.; Din, W. R. W.

2017-09-01

One of the key issues in mobile robot navigation is the ability for the robot to move from an arbitrary start location to a specified goal location without colliding with any obstacles while traveling, also known as mobile robot path planning problem. In this paper, however, we examined the performance of a robust searching algorithm that relies on the use of harmonic potentials of the environment to generate smooth and safe path for mobile robot navigation in a static known indoor environment. The harmonic potentials will be discretized by using Laplacian’s operator to form a system of algebraic approximation equations. This algebraic linear system will be computed via 4-Point Explicit Group Accelerated Over-Relaxation (4-EGAOR) iterative method for rapid computation. The performance of the proposed algorithm will then be compared and analyzed against the existing algorithms in terms of number of iterations and execution time. The result shows that the proposed algorithm performed better than the existing methods.

Design Approach and Implementation of Application Specific Instruction Set Processor for SHA-3 BLAKE Algorithm

NASA Astrophysics Data System (ADS)

Zhang, Yuli; Han, Jun; Weng, Xinqian; He, Zhongzhu; Zeng, Xiaoyang

This paper presents an Application Specific Instruction-set Processor (ASIP) for the SHA-3 BLAKE algorithm family by instruction set extensions (ISE) from an RISC (reduced instruction set computer) processor. With a design space exploration for this ASIP to increase the performance and reduce the area cost, we accomplish an efficient hardware and software implementation of BLAKE algorithm. The special instructions and their well-matched hardware function unit improve the calculation of the key section of the algorithm, namely G-functions. Also, relaxing the time constraint of the special function unit can decrease its hardware cost, while keeping the high data throughput of the processor. Evaluation results reveal the ASIP achieves 335Mbps and 176Mbps for BLAKE-256 and BLAKE-512. The extra area cost is only 8.06k equivalent gates. The proposed ASIP outperforms several software approaches on various platforms in cycle per byte. In fact, both high throughput and low hardware cost achieved by this programmable processor are comparable to that of ASIC implementations.

Surface hopping with a manifold of electronic states. I. Incorporating surface-leaking to capture lifetimes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ouyang, Wenjun; Dou, Wenjie; Subotnik, Joseph E., E-mail: subotnik@sas.upenn.edu

2015-02-28

We investigate the incorporation of the surface-leaking (SL) algorithm into Tully’s fewest-switches surface hopping (FSSH) algorithm to simulate some electronic relaxation induced by an electronic bath in conjunction with some electronic transitions between discrete states. The resulting SL-FSSH algorithm is benchmarked against exact quantum scattering calculations for three one-dimensional model problems. The results show excellent agreement between SL-FSSH and exact quantum dynamics in the wide band limit, suggesting the potential for a SL-FSSH algorithm. Discrepancies and failures are investigated in detail to understand the factors that will limit the reliability of SL-FSSH, especially the wide band approximation. Considering the easinessmore » of implementation and the low computational cost, we expect this method to be useful in studying processes involving both a continuum of electronic states (where electronic dynamics are probabilistic) and processes involving only a few electronic states (where non-adiabatic processes cannot ignore short-time coherence)« less

Analysis and design of second-order sliding-mode algorithms for quadrotor roll and pitch estimation.

PubMed

Chang, Jing; Cieslak, Jérôme; Dávila, Jorge; Zolghadri, Ali; Zhou, Jun

2017-11-01

The problem addressed in this paper is that of quadrotor roll and pitch estimation without any assumption about the knowledge of perturbation bounds when Inertial Measurement Units (IMU) data or position measurements are available. A Smooth Sliding Mode (SSM) algorithm is first designed to provide reliable estimation under a smooth disturbance assumption. This assumption is next relaxed with the second proposed Adaptive Sliding Mode (ASM) algorithm that deals with disturbances of unknown bounds. In addition, the analysis of the observers are extended to the case where measurements are corrupted by bias and noise. The gains of the proposed algorithms were deduced from the Lyapunov function. Furthermore, some useful guidelines are provided for the selection of the observer turning parameters. The performance of these two approaches is evaluated using a nonlinear simulation model and considering either accelerometer or position measurements. The simulation results demonstrate the benefits of the proposed solutions. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

A splitting algorithm for a novel regularization of Perona-Malik and application to image restoration

NASA Astrophysics Data System (ADS)

Karami, Fahd; Ziad, Lamia; Sadik, Khadija

2017-12-01

In this paper, we focus on a numerical method of a problem called the Perona-Malik inequality which we use for image denoising. This model is obtained as the limit of the Perona-Malik model and the p-Laplacian operator with p→ ∞. In Atlas et al., (Nonlinear Anal. Real World Appl 18:57-68, 2014), the authors have proved the existence and uniqueness of the solution of the proposed model. However, in their work, they used the explicit numerical scheme for approximated problem which is strongly dependent to the parameter p. To overcome this, we use in this work an efficient algorithm which is a combination of the classical additive operator splitting and a nonlinear relaxation algorithm. At last, we have presented the experimental results in image filtering show, which demonstrate the efficiency and effectiveness of our algorithm and finally, we have compared it with the previous scheme presented in Atlas et al., (Nonlinear Anal. Real World Appl 18:57-68, 2014).

The artificial-free technique along the objective direction for the simplex algorithm

NASA Astrophysics Data System (ADS)

Boonperm, Aua-aree; Sinapiromsaran, Krung

2014-03-01

The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

A capacitated vehicle routing problem with order available time in e-commerce industry

NASA Astrophysics Data System (ADS)

Liu, Ling; Li, Kunpeng; Liu, Zhixue

2017-03-01

In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

An outer approximation method for the road network design problem

PubMed Central

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well. PMID:29590111

An outer approximation method for the road network design problem.

PubMed

Asadi Bagloee, Saeed; Sarvi, Majid

2018-01-01

Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.

Composite scheme using localized relaxation with non-standard finite difference method for hyperbolic conservation laws

NASA Astrophysics Data System (ADS)

Kumar, Vivek; Raghurama Rao, S. V.

2008-04-01

Non-standard finite difference methods (NSFDM) introduced by Mickens [ Non-standard Finite Difference Models of Differential Equations, World Scientific, Singapore, 1994] are interesting alternatives to the traditional finite difference and finite volume methods. When applied to linear hyperbolic conservation laws, these methods reproduce exact solutions. In this paper, the NSFDM is first extended to hyperbolic systems of conservation laws, by a novel utilization of the decoupled equations using characteristic variables. In the second part of this paper, the NSFDM is studied for its efficacy in application to nonlinear scalar hyperbolic conservation laws. The original NSFDMs introduced by Mickens (1994) were not in conservation form, which is an important feature in capturing discontinuities at the right locations. Mickens [Construction and analysis of a non-standard finite difference scheme for the Burgers-Fisher equations, Journal of Sound and Vibration 257 (4) (2002) 791-797] recently introduced a NSFDM in conservative form. This method captures the shock waves exactly, without any numerical dissipation. In this paper, this algorithm is tested for the case of expansion waves with sonic points and is found to generate unphysical expansion shocks. As a remedy to this defect, we use the strategy of composite schemes [R. Liska, B. Wendroff, Composite schemes for conservation laws, SIAM Journal of Numerical Analysis 35 (6) (1998) 2250-2271] in which the accurate NSFDM is used as the basic scheme and localized relaxation NSFDM is used as the supporting scheme which acts like a filter. Relaxation schemes introduced by Jin and Xin [The relaxation schemes for systems of conservation laws in arbitrary space dimensions, Communications in Pure and Applied Mathematics 48 (1995) 235-276] are based on relaxation systems which replace the nonlinear hyperbolic conservation laws by a semi-linear system with a stiff relaxation term. The relaxation parameter ( λ) is chosen locally on the three point stencil of grid which makes the proposed method more efficient. This composite scheme overcomes the problem of unphysical expansion shocks and captures the shock waves with an accuracy better than the upwind relaxation scheme, as demonstrated by the test cases, together with comparisons with popular numerical methods like Roe scheme and ENO schemes.

Rapid simultaneous high-resolution mapping of myelin water fraction and relaxation times in human brain using BMC-mcDESPOT.

PubMed

Bouhrara, Mustapha; Spencer, Richard G

2017-02-15

A number of central nervous system (CNS) diseases exhibit changes in myelin content and magnetic resonance longitudinal, T 1 , and transverse, T 2 , relaxation times, which therefore represent important biomarkers of CNS pathology. Among the methods applied for measurement of myelin water fraction (MWF) and relaxation times, the multicomponent driven equilibrium single pulse observation of T 1 and T 2 (mcDESPOT) approach is of particular interest. mcDESPOT permits whole brain mapping of multicomponent T 1 and T 2 , with data acquisition accomplished within a clinically realistic acquisition time. Unfortunately, previous studies have indicated the limited performance of mcDESPOT in the setting of the modest signal-to-noise range of high-resolution mapping, required for the depiction of small structures and to reduce partial volume effects. Recently, we showed that a new Bayesian Monte Carlo (BMC) analysis substantially improved determination of MWF from mcDESPOT imaging data. However, our previous study was limited in that it did not discuss determination of relaxation times. Here, we extend the BMC analysis to the simultaneous determination of whole-brain MWF and relaxation times using the two-component mcDESPOT signal model. Simulation analyses and in-vivo human brain studies indicate the overall greater performance of this approach compared to the stochastic region contraction (SRC) algorithm, conventionally used to derive parameter estimates from mcDESPOT data. SRC estimates of the transverse relaxation time of the long T 2 fraction, T 2,l , and the longitudinal relaxation time of the short T 1 fraction, T 1,s , clustered towards the lower and upper parameter search space limits, respectively, indicating failure of the fitting procedure. We demonstrate that this effect is absent in the BMC analysis. Our results also showed improved parameter estimation for BMC as compared to SRC for high-resolution mapping. Overall we find that the combination of BMC analysis and mcDESPOT, BMC-mcDESPOT, shows excellent performance for accurate high-resolution whole-brain mapping of MWF and bi-component transverse and longitudinal relaxation times within a clinically realistic acquisition time. Published by Elsevier Inc.

Faster quantum searching with almost any diffusion operator

NASA Astrophysics Data System (ADS)

Tulsi, Avatar

2015-05-01

Grover's search algorithm drives a quantum system from an initial state |s > to a desired final state |t > by using selective phase inversions of these two states. Earlier, we studied a generalization of Grover's algorithm that relaxes the assumption of the efficient implementation of Is, the selective phase inversion of the initial state, also known as a diffusion operator. This assumption is known to become a serious handicap in cases of physical interest. Our general search algorithm works with almost any diffusion operator Ds with the only restriction of having |s > as one of its eigenstates. The price that we pay for using any operator is an increase in the number of oracle queries by a factor of O (B ) , where B is a characteristic of the eigenspectrum of Ds and can be large in some situations. Here we show that by using a quantum Fourier transform, we can regain the optimal query complexity of Grover's algorithm without losing the freedom of using any diffusion operator for quantum searching. However, the total number of operators required by the algorithm is still O (B ) times more than that of Grover's algorithm. So our algorithm offers an advantage only if the oracle operator is computationally more expensive than the diffusion operator, which is true in most search problems.

Bin Packing, Number Balancing, and Rescaling Linear Programs

NASA Astrophysics Data System (ADS)

Hoberg, Rebecca

This thesis deals with several important algorithmic questions using techniques from diverse areas including discrepancy theory, machine learning and lattice theory. In Chapter 2, we construct an improved approximation algorithm for a classical NP-complete problem, the bin packing problem. In this problem, the goal is to pack items of sizes si ∈ [0,1] into as few bins as possible, where a set of items fits into a bin provided the sum of the item sizes is at most one. We give a polynomial-time rounding scheme for a standard linear programming relaxation of the problem, yielding a packing that uses at most OPT + O(log OPT) bins. This makes progress towards one of the "10 open problems in approximation algorithms" stated in the book of Shmoys and Williamson. In fact, based on related combinatorial lower bounds, Rothvoss conjectures that theta(logOPT) may be a tight bound on the additive integrality gap of this LP relaxation. In Chapter 3, we give a new polynomial-time algorithm for linear programming. Our algorithm is based on the multiplicative weights update (MWU) method, which is a general framework that is currently of great interest in theoretical computer science. An algorithm for linear programming based on MWU was known previously, but was not polynomial time--we remedy this by alternating between a MWU phase and a rescaling phase. The rescaling methods we introduce improve upon previous methods by reducing the number of iterations needed until one can rescale, and they can be used for any algorithm with a similar rescaling structure. Finally, we note that the MWU phase of the algorithm has a simple interpretation as gradient descent of a particular potential function, and we show we can speed up this phase by walking in a direction that decreases both the potential function and its gradient. In Chapter 4, we show that an approximate oracle for Minkowski's Theorem gives an approximate oracle for the number balancing problem, and conversely. Number balancing is the problem of minimizing | 〈a,x〉 | over x ∈ {-1,0,1}n \\ { 0}, given a ∈ [0,1]n. While an application of the pigeonhole principle shows that there always exists x with | 〈a,x〉| ≤ O(√ n/2n), the best known algorithm only guarantees |〈a,x〉| ≤ 2-ntheta(log n). We show that an oracle for Minkowski's Theorem with approximation factor rho would give an algorithm for NBP that guarantees | 〈a,x〉 | ≤ 2-ntheta(1/rho). In particular, this would beat the bound of Karmarkar and Karp provided rho ≤ O(logn/loglogn). In the other direction, we prove that any polynomial time algorithm for NBP that guarantees a solution of difference at most 2√n/2 n would give a polynomial approximation for Minkowski as well as a polynomial factor approximation algorithm for the Shortest Vector Problem.

A simulation based method to assess inversion algorithms for transverse relaxation data

NASA Astrophysics Data System (ADS)

Ghosh, Supriyo; Keener, Kevin M.; Pan, Yong

2008-04-01

NMR relaxometry is a very useful tool for understanding various chemical and physical phenomena in complex multiphase systems. A Carr-Purcell-Meiboom-Gill (CPMG) [P.T. Callaghan, Principles of Nuclear Magnetic Resonance Microscopy, Clarendon Press, Oxford, 1991] experiment is an easy and quick way to obtain transverse relaxation constant (T2) in low field. Most of the samples usually have a distribution of T2 values. Extraction of this distribution of T2s from the noisy decay data is essentially an ill-posed inverse problem. Various inversion approaches have been used to solve this problem, to date. A major issue in using an inversion algorithm is determining how accurate the computed distribution is. A systematic analysis of an inversion algorithm, UPEN [G.C. Borgia, R.J.S. Brown, P. Fantazzini, Uniform-penalty inversion of multiexponential decay data, Journal of Magnetic Resonance 132 (1998) 65-77; G.C. Borgia, R.J.S. Brown, P. Fantazzini, Uniform-penalty inversion of multiexponential decay data II. Data spacing, T2 data, systematic data errors, and diagnostics, Journal of Magnetic Resonance 147 (2000) 273-285] was performed by means of simulated CPMG data generation. Through our simulation technique and statistical analyses, the effects of various experimental parameters on the computed distribution were evaluated. We converged to the true distribution by matching up the inversion results from a series of true decay data and a noisy simulated data. In addition to simulation studies, the same approach was also applied on real experimental data to support the simulation results.

Parsimony and goodness-of-fit in multi-dimensional NMR inversion

NASA Astrophysics Data System (ADS)

Babak, Petro; Kryuchkov, Sergey; Kantzas, Apostolos

2017-01-01

Multi-dimensional nuclear magnetic resonance (NMR) experiments are often used for study of molecular structure and dynamics of matter in core analysis and reservoir evaluation. Industrial applications of multi-dimensional NMR involve a high-dimensional measurement dataset with complicated correlation structure and require rapid and stable inversion algorithms from the time domain to the relaxation rate and/or diffusion domains. In practice, applying existing inverse algorithms with a large number of parameter values leads to an infinite number of solutions with a reasonable fit to the NMR data. The interpretation of such variability of multiple solutions and selection of the most appropriate solution could be a very complex problem. In most cases the characteristics of materials have sparse signatures, and investigators would like to distinguish the most significant relaxation and diffusion values of the materials. To produce an easy to interpret and unique NMR distribution with the finite number of the principal parameter values, we introduce a new method for NMR inversion. The method is constructed based on the trade-off between the conventional goodness-of-fit approach to multivariate data and the principle of parsimony guaranteeing inversion with the least number of parameter values. We suggest performing the inversion of NMR data using the forward stepwise regression selection algorithm. To account for the trade-off between goodness-of-fit and parsimony, the objective function is selected based on Akaike Information Criterion (AIC). The performance of the developed multi-dimensional NMR inversion method and its comparison with conventional methods are illustrated using real data for samples with bitumen, water and clay.

Block structured adaptive mesh and time refinement for hybrid, hyperbolic + N-body systems

NASA Astrophysics Data System (ADS)

Miniati, Francesco; Colella, Phillip

2007-11-01

We present a new numerical algorithm for the solution of coupled collisional and collisionless systems, based on the block structured adaptive mesh and time refinement strategy (AMR). We describe the issues associated with the discretization of the system equations and the synchronization of the numerical solution on the hierarchy of grid levels. We implement a code based on a higher order, conservative and directionally unsplit Godunov’s method for hydrodynamics; a symmetric, time centered modified symplectic scheme for collisionless component; and a multilevel, multigrid relaxation algorithm for the elliptic equation coupling the two components. Numerical results that illustrate the accuracy of the code and the relative merit of various implemented schemes are also presented.

Dominant takeover regimes for genetic algorithms

NASA Technical Reports Server (NTRS)

Noever, David; Baskaran, Subbiah

1995-01-01

The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.

Neural-network-enhanced evolutionary algorithm applied to supported metal nanoparticles

NASA Astrophysics Data System (ADS)

Kolsbjerg, E. L.; Peterson, A. A.; Hammer, B.

2018-05-01

We show that approximate structural relaxation with a neural network enables orders of magnitude faster global optimization with an evolutionary algorithm in a density functional theory framework. The increased speed facilitates reliable identification of global minimum energy structures, as exemplified by our finding of a hollow Pt13 nanoparticle on an MgO support. We highlight the importance of knowing the correct structure when studying the catalytic reactivity of the different particle shapes. The computational speedup further enables screening of hundreds of different pathways in the search for optimum kinetic transitions between low-energy conformers and hence pushes the limits of the insight into thermal ensembles that can be obtained from theory.

Integrating NOE and RDC using sum-of-squares relaxation for protein structure determination.

PubMed

Khoo, Y; Singer, A; Cowburn, D

2017-07-01

We revisit the problem of protein structure determination from geometrical restraints from NMR, using convex optimization. It is well-known that the NP-hard distance geometry problem of determining atomic positions from pairwise distance restraints can be relaxed into a convex semidefinite program (SDP). However, often the NOE distance restraints are too imprecise and sparse for accurate structure determination. Residual dipolar coupling (RDC) measurements provide additional geometric information on the angles between atom-pair directions and axes of the principal-axis-frame. The optimization problem involving RDC is highly non-convex and requires a good initialization even within the simulated annealing framework. In this paper, we model the protein backbone as an articulated structure composed of rigid units. Determining the rotation of each rigid unit gives the full protein structure. We propose solving the non-convex optimization problems using the sum-of-squares (SOS) hierarchy, a hierarchy of convex relaxations with increasing complexity and approximation power. Unlike classical global optimization approaches, SOS optimization returns a certificate of optimality if the global optimum is found. Based on the SOS method, we proposed two algorithms-RDC-SOS and RDC-NOE-SOS, that have polynomial time complexity in the number of amino-acid residues and run efficiently on a standard desktop. In many instances, the proposed methods exactly recover the solution to the original non-convex optimization problem. To the best of our knowledge this is the first time SOS relaxation is introduced to solve non-convex optimization problems in structural biology. We further introduce a statistical tool, the Cramér-Rao bound (CRB), to provide an information theoretic bound on the highest resolution one can hope to achieve when determining protein structure from noisy measurements using any unbiased estimator. Our simulation results show that when the RDC measurements are corrupted by Gaussian noise of realistic variance, both SOS based algorithms attain the CRB. We successfully apply our method in a divide-and-conquer fashion to determine the structure of ubiquitin from experimental NOE and RDC measurements obtained in two alignment media, achieving more accurate and faster reconstructions compared to the current state of the art.

Detection method of flexion relaxation phenomenon based on wavelets for patients with low back pain

NASA Astrophysics Data System (ADS)

Nougarou, François; Massicotte, Daniel; Descarreaux, Martin

2012-12-01

The flexion relaxation phenomenon (FRP) can be defined as a reduction or silence of myoelectric activity of the lumbar erector spinae muscle during full trunk flexion. It is typically absent in patients with chronic low back pain (LBP). Before any broad clinical utilization of this neuromuscular response can be made, effective, standardized, and accurate methods of identifying FRP limits are needed. However, this phenomenon is clearly more difficult to detect for LBP patients than for healthy patients. The main goal of this study is to develop an automated method based on wavelet transformation that would improve time point limits detection of surface electromyography signals of the FRP in case of LBP patients. Conventional visual identification and proposed automated methods of time point limits detection of relaxation phase were compared on experimental data using criteria of accuracy and repeatability based on physiological properties. The evaluation demonstrates that the use of wavelet transform (WT) yields better results than methods without wavelet decomposition. Furthermore, methods based on wavelet per packet transform are more effective than algorithms employing discrete WT. Compared to visual detection, in addition to demonstrating an obvious saving of time, the use of wavelet per packet transform improves the accuracy and repeatability in the detection of the FRP limits. These results clearly highlight the value of the proposed technique in identifying onset and offset of the flexion relaxation response in LBP subjects.

Nonadiabatic Dynamics for Electrons at Second-Order: Real-Time TDDFT and OSCF2.

PubMed

Nguyen, Triet S; Parkhill, John

2015-07-14

We develop a new model to simulate nonradiative relaxation and dephasing by combining real-time Hartree-Fock and density functional theory (DFT) with our recent open-systems theory of electronic dynamics. The approach has some key advantages: it has been systematically derived and properly relaxes noninteracting electrons to a Fermi-Dirac distribution. This paper combines the new dissipation theory with an atomistic, all-electron quantum chemistry code and an atom-centered model of the thermal environment. The environment is represented nonempirically and is dependent on molecular structure in a nonlocal way. A production quality, O(N(3)) closed-shell implementation of our theory applicable to realistic molecular systems is presented, including timing information. This scaling implies that the added cost of our nonadiabatic relaxation model, time-dependent open self-consistent field at second order (OSCF2), is computationally inexpensive, relative to adiabatic propagation of real-time time-dependent Hartree-Fock (TDHF) or time-dependent density functional theory (TDDFT). Details of the implementation and numerical algorithm, including factorization and efficiency, are discussed. We demonstrate that OSCF2 approaches the stationary self-consistent field (SCF) ground state when the gap is large relative to k(b)T. The code is used to calculate linear-response spectra including the effects of bath dynamics. Finally, we show how our theory of finite-temperature relaxation can be used to correct ground-state DFT calculations.

Broadscale postseismic deformation and lower crustal relaxation in the central Bayankala Block (central Tibetan Plateau) observed using InSAR data

NASA Astrophysics Data System (ADS)

Zhao, Dezheng; Qu, Chunyan; Shan, Xinjian; Zuo, Ronghu; Liu, Yunhua; Gong, Wenyu; Zhang, Guohong

2018-04-01

We have generated a more than 500 km long postseismic deformation rate map and cumulative displacement time series in the central Bayankala Block of the Tibetan Plateau using ENVISAT/ASAR data from 2003 to 2010 by the π-RATE stacking algorithm. This rate map spans a period of ∼7.2 years and reveals that postseismic motion of 2001 Kokoxili earthquake exhibits a striking signal, dominating crustal deformation of the central Bayankala Block with a cross-fault magnitude ∼9-11 mm/yr in line of sight (LOS) (∼93.1°E). The southern and northern parts of the postseismic deformation field exhibit different patterns and variable magnitudes, reflecting asymmetry of the displacement distribution. Postseismic motion affects eastward extrusion of the central Bayankala Block, which reaches ∼15 km north of the Ganzi-Yushu fault. To further investigate viscoelastic relaxation of the lower crust in this area after approximately two years, E-M, E-M-M and E-S models are constructed. The result shows that the best fit viscosity for the lower crust is about 1 × 1019 Pa·s. Comparison between cumulative displacements resolved by these three models shows that viscoelastic relaxation of the lower crust makes the most significant contribution to postseismic stress relaxation after 2001 event.

Photoinduced relaxation dynamics of nitrogen-capped silicon nanoclusters: a TD-DFT study

NASA Astrophysics Data System (ADS)

Liu, Xiang-Yang; Xie, Xiao-Ying; Fang, Wei-Hai; Cui, Ganglong

2018-04-01

Herein we have developed and implemented a TD-DFT-based surface-hopping dynamics simulation method with a recently proposed numerical algorithm capable of efficiently computing nonadiabatic couplings, a semiclassical spectrum simulation method, and an excited-state character analysis method based on one-electron transition density matrix. With the use of these developed methods, we have studied the spectroscopic properties, excited-state characters, and photoinduced relaxation dynamics of three silicon nanoclusters capped with different chromophores (Cl@SiQD, Car@SiQD, Azo@SiQD). Spectroscopically, the main absorption peak is visibly red-shifted from Cl@SiQD via Car@SiQD to Azo@SiQD. In contrast to Cl@SiQD and Car@SiQD, there are two peaks observed in Azo@SiQD. Mechanistically, the excited-state relaxation to the lowest S1 excited singlet state is ultrafast in Cl@SiQD, which is less than 190 fs and without involving excited-state trapping. In comparison, there are clear excited-state trappings in Car@SiQD and Azo@SiQD. In the former, the S2 state is trapped more than 300 fs; in the latter, the S3 excited-state trapping is more than 615 fs. These results demonstrate that the interfacial interaction has significant influences on the spectroscopic properties and excited-state relaxation dynamics. The knowledge gained in this work could be helpful for the design of silicon nanoclusters with better photoluminescence performance.

Phase retrieval by coherent modulation imaging

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fucai; Chen, Bo; Morrison, Graeme R.

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging (CDI) is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit-wave. This coherent modulation imaging (CMI) method removes inherent ambiguities of CDI and uses a reliable, rapidly converging iterative algorithm involving three planes. It works formore » extended samples, does not require tight support for convergence, and relaxes dynamic range requirements on the detector. CMI provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free electron laser.« less

Phase retrieval by coherent modulation imaging

DOE PAGES

Zhang, Fucai; Chen, Bo; Morrison, Graeme R.; ...

2016-11-18

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging (CDI) is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit-wave. This coherent modulation imaging (CMI) method removes inherent ambiguities of CDI and uses a reliable, rapidly converging iterative algorithm involving three planes. It works formore » extended samples, does not require tight support for convergence, and relaxes dynamic range requirements on the detector. CMI provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free electron laser.« less

A survey of upwind methods for flows with equilibrium and non-equilibrium chemistry and thermodynamics

NASA Technical Reports Server (NTRS)

Grossman, B.; Garrett, J.; Cinnella, P.

1989-01-01

Several versions of flux-vector split and flux-difference split algorithms were compared with regard to general applicability and complexity. Test computations were performed using curve-fit equilibrium air chemistry for an M = 5 high-temperature inviscid flow over a wedge, and an M = 24.5 inviscid flow over a blunt cylinder for test computations; for these cases, little difference in accuracy was found among the versions of the same flux-split algorithm. For flows with nonequilibrium chemistry, the effects of the thermodynamic model on the development of flux-vector split and flux-difference split algorithms were investigated using an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Several numerical examples are presented, including nonequilibrium air chemistry in a high-temperature shock tube and nonequilibrium hydrogen-air chemistry in a supersonic diffuser.

Computational plasticity algorithm for particle dynamics simulations

NASA Astrophysics Data System (ADS)

Krabbenhoft, K.; Lyamin, A. V.; Vignes, C.

2018-01-01

The problem of particle dynamics simulation is interpreted in the framework of computational plasticity leading to an algorithm which is mathematically indistinguishable from the common implicit scheme widely used in the finite element analysis of elastoplastic boundary value problems. This algorithm provides somewhat of a unification of two particle methods, the discrete element method and the contact dynamics method, which usually are thought of as being quite disparate. In particular, it is shown that the former appears as the special case where the time stepping is explicit while the use of implicit time stepping leads to the kind of schemes usually labelled contact dynamics methods. The framing of particle dynamics simulation within computational plasticity paves the way for new approaches similar (or identical) to those frequently employed in nonlinear finite element analysis. These include mixed implicit-explicit time stepping, dynamic relaxation and domain decomposition schemes.

Shrink-wrapped isosurface from cross sectional images

PubMed Central

Choi, Y. K.; Hahn, J. K.

2010-01-01

Summary This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching Cubes (MC) algorithm, our method does not extract the iso-density surface (isosurface) directly from the voxel data but calculates the iso-density point (isopoint) first. After building a coarse initial mesh approximating the ideal isosurface by the cell-boundary representation, it metamorphoses the mesh into the final isosurface by a relaxation scheme, called shrink-wrapping process. Compared with the MC algorithm, our method is robust and does not make any cracks on surface. Furthermore, since it is possible to utilize lots of additional isopoints during the surface reconstruction process by extending the adjacency definition, theoretically the resulting surface can be better in quality than the MC algorithm. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images. PMID:20703361

Phase retrieval by coherent modulation imaging.

PubMed

Zhang, Fucai; Chen, Bo; Morrison, Graeme R; Vila-Comamala, Joan; Guizar-Sicairos, Manuel; Robinson, Ian K

2016-11-18

Phase retrieval is a long-standing problem in imaging when only the intensity of the wavefield can be recorded. Coherent diffraction imaging is a lensless technique that uses iterative algorithms to recover amplitude and phase contrast images from diffraction intensity data. For general samples, phase retrieval from a single-diffraction pattern has been an algorithmic and experimental challenge. Here we report a method of phase retrieval that uses a known modulation of the sample exit wave. This coherent modulation imaging method removes inherent ambiguities of coherent diffraction imaging and uses a reliable, rapidly converging iterative algorithm involving three planes. It works for extended samples, does not require tight support for convergence and relaxes dynamic range requirements on the detector. Coherent modulation imaging provides a robust method for imaging in materials and biological science, while its single-shot capability will benefit the investigation of dynamical processes with pulsed sources, such as X-ray free-electron lasers.

Do dogs bite without warning, or should we see it coming?

PubMed

2017-01-14

When dog bites occur, many owners will report the incident as being 'out of character' for the dog and as happening 'out of the blue'. But do dogs provide warning signs before biting and should owners and vets be able to see it coming? This question was explored in a session during the London Vet Show. Laura Honey reports. British Veterinary Association.

Fulfilling Dreams in Adult Education: Managing the Multi-Level Classroom

ERIC Educational Resources Information Center

Haley, Rebecca J.

2008-01-01

Have you ever wondered how Laura Ingalls Wilder taught all of her students in the little one-room school house in The Little House on the Prairie series? How did she teach students on so many different levels and all at the same time? Well, that is exactly what it is like in most adult education classrooms today. The purpose of this paper is to…

Biosecurity of Select Agents and Toxins

DTIC Science & Technology

2005-03-01

effort. As important, the encouragement and support provided my wife, Peggy, and my daughter, Laura, enabled me to accomplish this personal and...affiliations of the scholars involved. Visitors, scholars and other interested persons are commonplace on campus and cause neither alarm nor concern within that...Since its initial adoption in Washington, London, and Moscow in 1972, the treaty signatories have pledged to realize the goals outlined in Article I

Design Methodology for Automated Construction Machines

DTIC Science & Technology

1987-12-11

along with the design of a pair of machines which automate framework installation.-,, 20. DISTRIBUTION IAVAILABILITY OF ABSTRACT 21. ABSTRACT SECURITY... Development Assistant Professor of Civil Engineering and Laura A . Demsetz, David H. Levy, Bruce Schena Graduate Research Assistants December 11, 1987 U.S...are discussed along with the design of a pair of machines which automate framework installation. Preliminary analysis and testing indicate that these

Explaining and Influencing Chinese Arms Transfers

DTIC Science & Technology

1995-02-01

this volume: Jonathan W. Pierce [] Secretary: Laura Hall [] Circulation Manager : Myma Morgan INSS publishes McNair Papers to provoke thought and inform...their affiliated factories were directed to decentralize their decision-making processes, grant more autonomy to managers , use excess capacity to...intimacy of ties between Moscow and 10 EXPLAINING AND INFLUENCING CHINESE ARMS TRANSFERS New Dehli , and concem that the United States was still in retreat

Improving Air Force Enterprise Resource Planning-Enabled Business Transformation

DTIC Science & Technology

2013-01-01

of the time of the research. - xviii - At RAND, we thank Mr. Jerry Sollinger for helping us to organize our material and Dr. Laura Baldwin for...complex technology effort most public-sector organizations will ever attempt” ( KPMG , 2011). While many of the challenges listed above may manifest... KPMG LLP, 2011). 1 Multi-echelon means one person is in charge and has responsibility for

"Because We Feel the Pressure and We Also Feel the Support": Examining the Educational Success of Undocumented Immigrant Latina/o Students

ERIC Educational Resources Information Center

Enriquez, Laura E.

2011-01-01

Drawing from the educational experiences of fifty-four undocumented immigrant college students, Laura E. Enriquez seeks to uncover the concrete ways in which social capital is used to successfully navigate K-12 educational institutions and pursue a higher education. Enriquez argues that there is a need for a more grounded understanding of how…

Data Collection Methods. Semi-Structured Interviews and Focus Groups

DTIC Science & Technology

2009-01-01

erence. For example, consider the dif- ferences between informants, subjects, respondents, and actors.3 Bernard (2000) notes that anthropology generally...Cohesion, and Morale, Santa Monica, Calif.: RAND Corporation, MR-896-OSD, 1997; and Margaret C. Harrell, Laura Werber Castaneda, Peter Schirmer, Bryan...not divulging “secrets” if the researcher already knows ( Bernard , 2002). There are a couple of potential problems with probes for which the

RAND Project Air Force Annual Report 2008

DTIC Science & Technology

2008-01-01

Systems: Past Lessons and Future Recommendations, by Obaid Younossi, Mark A. Lorell, Kevin Brancato, Cynthia R. Cook, Mel Eisman, Bernard Fox, John C...Competency Development: Experience from Prince Sultan Air Base and Eskan Village in Saudi Arabia, by Laura Werber Castaneda, Lawrence M. Hanser, and...Proposal, by Michael R. Thirtle, Michael Boito, Ian P. Cook, Bernard Fox, Phyllis Gilmore, Michelle Grace, Jeff Hagen, Thomas Hamilton

Annual Report 2004

DTIC Science & Technology

2005-01-01

information for planning and management. MG-109-AF, Test and Evaluation Trends and Costs for Aircraft and Guided Weapons, Bernard Fox, Michael Boito...Experience fom Prince Sultan Air Base and Eskan Village in Saudi Arabia, Laura Werber Castaneda, Lawrence M. Hanser, and Constance H. Davis 28 RAND...India, C. Christine Fair ANNUAL REPORT 2004 47 Publications MG-109-AF, Test and Evaluation Trends and Costs for Aircraft and Guided Weapons, Bernard Fox

76 FR 40873 - Agency Information Collection Activities: Proposed Collection; Comment Request-Food Distribution...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-12

... or other forms of information technology. Comments may be sent to: Laura Castro, Branch Chief, Policy... individuals and households, 500 businesses and other for-profit companies, 11,211 private not-for-profit....00 542.37 178,980.93 0.12 21,935.87 Governments Private For Profit 500.00 9.12 4,560.00 1.04 4,740.00...

A Two-Stage Reconstruction Processor for Human Detection in Compressive Sensing CMOS Radar.

PubMed

Tsao, Kuei-Chi; Lee, Ling; Chu, Ta-Shun; Huang, Yuan-Hao

2018-04-05

Complementary metal-oxide-semiconductor (CMOS) radar has recently gained much research attraction because small and low-power CMOS devices are very suitable for deploying sensing nodes in a low-power wireless sensing system. This study focuses on the signal processing of a wireless CMOS impulse radar system that can detect humans and objects in the home-care internet-of-things sensing system. The challenges of low-power CMOS radar systems are the weakness of human signals and the high computational complexity of the target detection algorithm. The compressive sensing-based detection algorithm can relax the computational costs by avoiding the utilization of matched filters and reducing the analog-to-digital converter bandwidth requirement. The orthogonal matching pursuit (OMP) is one of the popular signal reconstruction algorithms for compressive sensing radar; however, the complexity is still very high because the high resolution of human respiration leads to high-dimension signal reconstruction. Thus, this paper proposes a two-stage reconstruction algorithm for compressive sensing radar. The proposed algorithm not only has lower complexity than the OMP algorithm by 75% but also achieves better positioning performance than the OMP algorithm especially in noisy environments. This study also designed and implemented the algorithm by using Vertex-7 FPGA chip (Xilinx, San Jose, CA, USA). The proposed reconstruction processor can support the 256 × 13 real-time radar image display with a throughput of 28.2 frames per second.

Reduction and Analysis of Phosphor Thermography Data With the IHEAT Software Package

NASA Technical Reports Server (NTRS)

Merski, N. Ronald

1998-01-01

Detailed aeroheating information is critical to the successful design of a thermal protection system (TPS) for an aerospace vehicle. This report describes NASA Langley Research Center's (LaRC) two-color relative-intensity phosphor thermography method and the IHEAT software package which is used for the efficient data reduction and analysis of the phosphor image data. Development of theory is provided for a new weighted two-color relative-intensity fluorescence theory for quantitatively determining surface temperatures on hypersonic wind tunnel models; an improved application of the one-dimensional conduction theory for use in determining global heating mappings; and extrapolation of wind tunnel data to flight surface temperatures. The phosphor methodology at LaRC is presented including descriptions of phosphor model fabrication, test facilities and phosphor video acquisition systems. A discussion of the calibration procedures, data reduction and data analysis is given. Estimates of the total uncertainties (with a 95% confidence level) associated with the phosphor technique are shown to be approximately 8 to 10 percent in the Langley's 31-Inch Mach 10 Tunnel and 7 to 10 percent in the 20-Inch Mach 6 Tunnel. A comparison with thin-film measurements using two-inch radius hemispheres shows the phosphor data to be within 7 percent of thin-film measurements and to agree even better with predictions via a LATCH computational fluid dynamics solution (CFD). Good agreement between phosphor data and LAURA CFD computations on the forebody of a vertical takeoff/vertical lander configuration at four angles of attack is also shown. In addition, a comparison is given between Mach 6 phosphor data and laminar and turbulent solutions generated using the LAURA, GASP and LATCH CFD codes. Finally, the extrapolation method developed in this report is applied to the X-34 configuration with good agreement between the phosphor extrapolation and LAURA flight surface temperature predictions. The phosphor process outlined in the paper is believed to provide the aerothermodynamic community with a valuable capability for rapidly obtaining (4 to 5 weeks) detailed heating information needed in TPS design.

The Influence of Ablation on Radiative Heating for Earth Entry

NASA Technical Reports Server (NTRS)

Johnston, Christopher O.; Gnoffo, Peter A.; Sutton, Kenneth

2008-01-01

Using the coupled ablation and radiation capability recently included in the LAURA flowfield solver, this paper investigates the influence of ablation on the shock-layer radiative heating for Earth entry. The extension of the HARA radiation model, which provides the radiation predictions in LAURA, to treat a gas consisting of the elements C, H, O, and N is discussed. It is shown that the absorption coefficient of air is increased with the introduction of the C and H elements. A simplified shock layer model is studied to show the impact of temperature, as well as the abundance of C and H, on the net absorption or emission from an ablation contaminated boundary layer. It is found that the ablation species reduce the radiative flux in the vacuum ultraviolet, through increased absorption, for all temperatures. However, in the infrared region of the spectrum, the ablation species increase the radiative flux, through strong emission, for temperatures above 3,000 K. Thus, depending on the temperature and abundance of ablation species, the contaminated boundary layer may either provide a net increase or decrease in the radiative flux reaching the wall. To assess the validity of the coupled ablation and radiation LAURA analysis, a previously analyzed Mars-return case (15.24 km/s), which contains significant ablation and radiation coupling, is studied. Exceptional agreement with previous viscous shock-layer results is obtained. A 40% decrease in the radiative flux is predicted for ablation rates equal to 20% of the free-stream mass flux. The Apollo 4 peak-heating case (10.24 km/s) is also studied. For ablation rates up to 3.4% of the free-stream mass flux, the radiative heating is reduced by up to 19%, while the convective heating is reduced by up to 87%. Good agreement with the Apollo 4 radiometer data is obtained by considering absorption in the radiometer cavity. For both the Mars return and the Apollo 4 cases, coupled radiation alone is found to reduce the radiative heating by 30 60% and the convective heating by less than 5%.

Grid generation on surfaces in 3 dimensions

NASA Technical Reports Server (NTRS)

Eiseman, Peter R.

1986-01-01

The development of a surface grid generation algorithm was initiated. The basic adaptive movement technique of mean-value-relaxation was extended from the viewpoint of a single coordinate grid over a surface described by a single scalar function to that of a surface more generally defined by vector functions and covered by a collection of smoothly connected grids. Within the multiconnected assemblage, the application of control was examined in several instances.

Algorithms and architecture for multiprocessor based circuit simulation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deutsch, J.T.

Accurate electrical simulation is critical to the design of high performance integrated circuits. Logic simulators can verify function and give first-order timing information. Switch level simulators are more effective at dealing with charge sharing than standard logic simulators, but cannot provide accurate timing information or discover DC problems. Delay estimation techniques and cell level simulation can be used in constrained design methods, but must be tuned for each application, and circuit simulation must still be used to generate the cell models. None of these methods has the guaranteed accuracy that many circuit designers desire, and none can provide detailed waveformmore » information. Detailed electrical-level simulation can predict circuit performance if devices and parasitics are modeled accurately. However, the computational requirements of conventional circuit simulators make it impractical to simulate current large circuits. In this dissertation, the implementation of Iterated Timing Analysis (ITA), a relaxation-based technique for accurate circuit simulation, on a special-purpose multiprocessor is presented. The ITA method is an SOR-Newton, relaxation-based method which uses event-driven analysis and selective trace to exploit the temporal sparsity of the electrical network. Because event-driven selective trace techniques are employed, this algorithm lends itself to implementation on a data-driven computer.« less

Comparison of Accuracy and Performance for Lattice Boltzmann and Finite Difference Simulations of Steady Viscous Flow

NASA Astrophysics Data System (ADS)

Noble, David R.; Georgiadis, John G.; Buckius, Richard O.

1996-07-01

The lattice Boltzmann method (LBM) is used to simulate flow in an infinite periodic array of octagonal cylinders. Results are compared with those obtained by a finite difference (FD) simulation solved in terms of streamfunction and vorticity using an alternating direction implicit scheme. Computed velocity profiles are compared along lines common to both the lattice Boltzmann and finite difference grids. Along all such slices, both streamwise and transverse velocity predictions agree to within 05% of the average streamwise velocity. The local shear on the surface of the cylinders also compares well, with the only deviations occurring in the vicinity of the corners of the cylinders, where the slope of the shear is discontinuous. When a constant dimensionless relaxation time is maintained, LBM exhibits the same convergence behaviour as the FD algorithm, with the time step increasing as the square of the grid size. By adjusting the relaxation time such that a constant Mach number is achieved, the time step of LBM varies linearly with the grid size. The efficiency of LBM on the CM-5 parallel computer at the National Center for Supercomputing Applications (NCSA) is evaluated by examining each part of the algorithm. Overall, a speed of 139 GFLOPS is obtained using 512 processors for a domain size of 2176×2176.

How Do You #relax When You're #stressed? A Content Analysis and Infodemiology Study of Stress-Related Tweets.

PubMed

Doan, Son; Ritchart, Amanda; Perry, Nicholas; Chaparro, Juan D; Conway, Mike

2017-06-13

Stress is a contributing factor to many major health problems in the United States, such as heart disease, depression, and autoimmune diseases. Relaxation is often recommended in mental health treatment as a frontline strategy to reduce stress, thereby improving health conditions. Twitter is a microblog platform that allows users to post their own personal messages (tweets), including their expressions about feelings and actions related to stress and stress management (eg, relaxing). While Twitter is increasingly used as a source of data for understanding mental health from a population perspective, the specific issue of stress-as manifested on Twitter-has not yet been the focus of any systematic study. The objective of our study was to understand how people express their feelings of stress and relaxation through Twitter messages. In addition, we aimed at investigating automated natural language processing methods to (1) classify stress versus nonstress and relaxation versus nonrelaxation tweets, and (2) identify first-hand experience-that is, who is the experiencer-in stress and relaxation tweets. We first performed a qualitative content analysis of 1326 and 781 tweets containing the keywords "stress" and "relax," respectively. We then investigated the use of machine learning algorithms-in particular naive Bayes and support vector machines-to automatically classify tweets as stress versus nonstress and relaxation versus nonrelaxation. Finally, we applied these classifiers to sample datasets drawn from 4 cities in the United States (Los Angeles, New York, San Diego, and San Francisco) obtained from Twitter's streaming application programming interface, with the goal of evaluating the extent of any correlation between our automatic classification of tweets and results from public stress surveys. Content analysis showed that the most frequent topic of stress tweets was education, followed by work and social relationships. The most frequent topic of relaxation tweets was rest & vacation, followed by nature and water. When we applied the classifiers to the cities dataset, the proportion of stress tweets in New York and San Diego was substantially higher than that in Los Angeles and San Francisco. In addition, we found that characteristic expressions of stress and relaxation varied for each city based on its geolocation. This content analysis and infodemiology study revealed that Twitter, when used in conjunction with natural language processing techniques, is a useful data source for understanding stress and stress management strategies, and can potentially supplement infrequently collected survey-based stress data. ©Son Doan, Amanda Ritchart, Nicholas Perry, Juan D Chaparro, Mike Conway. Originally published in JMIR Public Health and Surveillance (http://publichealth.jmir.org), 13.06.2017.

Numerical solutions of the Navier-Stokes equations for transonic afterbody flows

NASA Technical Reports Server (NTRS)

Swanson, R. C., Jr.

1980-01-01

The time dependent Navier-Stokes equations in mass averaged variables are solved for transonic flow over axisymmetric boattail plume simulator configurations. Numerical solution of these equations is accomplished with the unsplit explict finite difference algorithm of MacCormack. A grid subcycling procedure and computer code vectorization are used to improve computational efficiency. The two layer algebraic turbulence models of Cebeci-Smith and Baldwin-Lomax are employed for investigating turbulence closure. Two relaxation models based on these baseline models are also considered. Results in the form of surface pressure distribution for three different circular arc boattails at two free stream Mach numbers are compared with experimental data. The pressures in the recirculating flow region for all separated cases are poorly predicted with the baseline turbulence models. Significant improvements in the predictions are usually obtained by using the relaxation models.

Nano-ADEPT Aeroloads Wind Tunnel Test

NASA Technical Reports Server (NTRS)

Smith, Brandon; Cassell, A.; Yount, B.; Kruger, C.; Brivkalns, C.; Makino, A.; Zarchi, K.; McDaniel, R.; Venkatapathy, E.; Swanson, G.

2015-01-01

Analysis completed since the test suggests that all test objectives were met– This claim will be verified in the coming weeks as the data is examined further– Final disposition of test objective success will be documented in a final reportsubmitted to NASA stakeholders (early August 2015)– Expect conference paper in early 2016• Data products and observations made during testing will be used to refinecomputational models of Nano-ADEPT• Carbon fabric relaxed from its pre-test state during the test– System-level tolerance for relaxation will be driven by destination-specific andmission-specific aerothermal and aerodynamic requirements• Bonus experiment of asymmetric shape demonstrates that an asymmetricdeployable blunt body can be used to generate measureable lift– With a strut actuation system and a robust GN&C algorithm, this effect could beused to steer a blunt body at hypersonic speeds to aid precision landing

Fast inversion of gravity data using the symmetric successive over-relaxation (SSOR) preconditioned conjugate gradient algorithm

NASA Astrophysics Data System (ADS)

Meng, Zhaohai; Li, Fengting; Xu, Xuechun; Huang, Danian; Zhang, Dailei

2017-02-01

The subsurface three-dimensional (3D) model of density distribution is obtained by solving an under-determined linear equation that is established by gravity data. Here, we describe a new fast gravity inversion method to recover a 3D density model from gravity data. The subsurface will be divided into a large number of rectangular blocks, each with an unknown constant density. The gravity inversion method introduces a stabiliser model norm with a depth weighting function to produce smooth models. The depth weighting function is combined with the model norm to counteract the skin effect of the gravity potential field. As the numbers of density model parameters is NZ (the number of layers in the vertical subsurface domain) times greater than the observed gravity data parameters, the inverse density parameter is larger than the observed gravity data parameters. Solving the full set of gravity inversion equations is very time-consuming, and applying a new algorithm to estimate gravity inversion can significantly reduce the number of iterations and the computational time. In this paper, a new symmetric successive over-relaxation (SSOR) iterative conjugate gradient (CG) method is shown to be an appropriate algorithm to solve this Tikhonov cost function (gravity inversion equation). The new, faster method is applied on Gaussian noise-contaminated synthetic data to demonstrate its suitability for 3D gravity inversion. To demonstrate the performance of the new algorithm on actual gravity data, we provide a case study that includes ground-based measurement of residual Bouguer gravity anomalies over the Humble salt dome near Houston, Gulf Coast Basin, off the shore of Louisiana. A 3D distribution of salt rock concentration is used to evaluate the inversion results recovered by the new SSOR iterative method. In the test model, the density values in the constructed model coincide with the known location and depth of the salt dome.

Spectral Regularization Algorithms for Learning Large Incomplete Matrices.

PubMed

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-03-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 10(6) × 10(6) incomplete matrix with 10(5) observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques.

Spectral Regularization Algorithms for Learning Large Incomplete Matrices

PubMed Central

Mazumder, Rahul; Hastie, Trevor; Tibshirani, Robert

2010-01-01

We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we provide a simple and very efficient convex algorithm for minimizing the reconstruction error subject to a bound on the nuclear norm. Our algorithm Soft-Impute iteratively replaces the missing elements with those obtained from a soft-thresholded SVD. With warm starts this allows us to efficiently compute an entire regularization path of solutions on a grid of values of the regularization parameter. The computationally intensive part of our algorithm is in computing a low-rank SVD of a dense matrix. Exploiting the problem structure, we show that the task can be performed with a complexity linear in the matrix dimensions. Our semidefinite-programming algorithm is readily scalable to large matrices: for example it can obtain a rank-80 approximation of a 106 × 106 incomplete matrix with 105 observed entries in 2.5 hours, and can fit a rank 40 approximation to the full Netflix training set in 6.6 hours. Our methods show very good performance both in training and test error when compared to other competitive state-of-the art techniques. PMID:21552465

Three-Dimensional Radiative Hydrodynamics for Disk Stability Simulations: A Proposed Testing Standard and New Results

NASA Astrophysics Data System (ADS)

Boley, Aaron C.; Durisen, Richard H.; Nordlund, Åke; Lord, Jesse

2007-08-01

Recent three-dimensional radiative hydrodynamics simulations of protoplanetary disks report disparate disk behaviors, and these differences involve the importance of convection to disk cooling, the dependence of disk cooling on metallicity, and the stability of disks against fragmentation and clump formation. To guarantee trustworthy results, a radiative physics algorithm must demonstrate the capability to handle both the high and low optical depth regimes. We develop a test suite that can be used to demonstrate an algorithm's ability to relax to known analytic flux and temperature distributions, to follow a contracting slab, and to inhibit or permit convection appropriately. We then show that the radiative algorithm employed by Mejía and Boley et al. and the algorithm employed by Cai et al. pass these tests with reasonable accuracy. In addition, we discuss a new algorithm that couples flux-limited diffusion with vertical rays, we apply the test suite, and we discuss the results of evolving the Boley et al. disk with this new routine. Although the outcome is significantly different in detail with the new algorithm, we obtain the same qualitative answers. Our disk does not cool fast due to convection, and it is stable to fragmentation. We find an effective α~10-2. In addition, transport is dominated by low-order modes.

Transient Droplet Behavior and Droplet Breakup during Bulk and Confined Shear Flow in Blends with One Viscoelastic Component: Experiments, Modelling and Simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cardinaels, Ruth; Verhulst, Kristof; Moldenaers, Paula

2008-07-07

The transient droplet deformation and droplet orientation after inception of shear, the shape relaxation after cessation of shear and droplet breakup during shear, are microscopically studied, both under bulk and confined conditions. The studied blends contain one viscoelastic Boger fluid phase. A counter rotating setup, based on a Paar Physica MCR300, is used for the droplet visualisation. For bulk shear flow, it is shown that the droplet deformation during startup of shear flow and the shape relaxation after cessation of shear flow are hardly influenced by droplet viscoelasticity, even at moderate to high capillary and Deborah numbers. The effects ofmore » droplet viscoelasticity only become visible close to the critical conditions and a novel break-up mechanism is observed. Matrix viscoelasticity has a more pronounced effect, causing overshoots in the deformation and significantly inhibiting relaxation. However, different applied capillary numbers prior to cessation of shear flow, with the Deborah number fixed, still result in a single master curve for shape retraction, as in fully Newtonian systems. The long tail in the droplet relaxation can be qualitatively described with a phenomenological model for droplet deformation, when using a 5-mode Giesekus model for the fluid rheology. It is found that the shear flow history significantly affects the droplet shape evolution and the breakup process in blends with one viscoelastic component. Confining a droplet between two plates accelerates the droplet deformation kinetics, similar to fully Newtonian systems. However, the increased droplet deformation, due to wall effects, causes the steady state to be reached at a later instant in time. Droplet relaxation is less sensitive to confinement, leading to slower relaxation kinetics only for highly confined droplets. For the blend with a viscoelastic droplet, a non-monotonous trend is found for the critical capillary number as a function of the confinement ratio. Finally, experimental data are compared with 3D simulations, performed with a volume-of-fluid algorithm.« less

Mechanisms of postseismic relaxation after a great subduction earthquake constrained by cross-scale thermomechanical model and geodetic observations

NASA Astrophysics Data System (ADS)

Sobolev, Stephan; Muldashev, Iskander

2016-04-01

According to conventional view, postseismic relaxation process after a great megathrust earthquake is dominated by fault-controlled afterslip during first few months to year, and later by visco-elastic relaxation in mantle wedge. We test this idea by cross-scale thermomechanical models of seismic cycle that employs elasticity, mineral-physics constrained non-linear transient viscous rheology and rate-and-state friction plasticity. As initial conditions for the models we use thermomechanical models of subduction zones at geological time-scale including a narrow subduction channel with low static friction for two settings, similar to the Southern Chile in the region of the great Chile Earthquake of 1960 and Japan in the region of Tohoku Earthquake of 2011. We next introduce in the same models classic rate-and state friction law in subduction channels, leading to stick-slip instability. The models start to generate spontaneous earthquake sequences and model parameters are set to closely replicate co-seismic deformations of Chile and Japan earthquakes. In order to follow in details deformation process during the entire seismic cycle and multiple seismic cycles we use adaptive time-step algorithm changing integration step from 40 sec during the earthquake to minute-5 year during postseismic and interseismic processes. We show that for the case of the Chile earthquake visco-elastic relaxation in the mantle wedge becomes dominant relaxation process already since 1 hour after the earthquake, while for the smaller Tohoku earthquake this happens some days after the earthquake. We also show that our model for Tohoku earthquake is consistent with the geodetic observations for the day-to-4year time range. We will demonstrate and discuss modeled deformation patterns during seismic cycles and identify the regions where the effects of afterslip and visco-elastic relaxation can be best distinguished.

Recruitment and Selection of Minorities in High-Tech Organizations. A Sociological Perspective.

DTIC Science & Technology

1984-09-01

Gretchen M. Luebbe Doris R. Entwisle Nancy A. Madden Joyce L. Epstein Kirk Nabors James Fennessey Alejandro Portes Denise C. Gottfredson Donald C. Rickert...Jr. Gary D. Gottfredson Laura Hersh Salganik Linda S. Gottfredson Robert E. Slavin Edward J. Harsch Jane St. John John H. Hollifield Valarie...and intelligence --as the primary determinants of minority and female underrepresentation in high-tech occupations. Despite voluminous research

Using Cognitive Task Analysis and Eye Tracking to Understand Imagery Analysis

DTIC Science & Technology

2006-01-01

Using Cognitive Task Analysis and Eye Tracking to Understand Imagery Analysis Laura Kurland, Abigail Gertner, Tom Bartee, Michael Chisholm and...have used these to study the analysts search behavior in detail. 2 EXPERIMENT Using a Cognitive Task Analysis (CTA) framework for knowledge...TITLE AND SUBTITLE Using Cognitive Task Analysis and Eye Tracking to Understand Imagery Analysis 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM

U.S. Army Research Institute Program in Basic Research FY 2004

DTIC Science & Technology

2005-08-01

reports from these research efforts is available upon request. Paul A. Gade, Chief, Research and Advanced Concepts Office Laura Wheeler Poms, Consortium...subjects during the time when they are most awake; making sure subjects are not sick, hungry , or taking any performance-enhancing drugs other than...received growing confirmation in a range of other sciences. Neuropsychological studies of ultimatum game performance have confirmed the role of brain

Organizational Effectiveness in the Tanker Airlift Control Center

DTIC Science & Technology

2008-05-01

Institute 300 College Park Dayton OH 45469 Anne K. Offner Offner and Associates, Inc. Kirkwood MO 63122 Greg Padula C5T Corporation...ELEMENT NUMBER 62202F 6. AUTHOR(S) 1Laura G. Militello, 2Anne K. Offner, 3Greg Padula , 5d. PROJECT NUMBER 4Stephanie D. Swindler...is taken largely from Padula (2007). This excerpt from Padula ‟s International Symposium on Aviation Psychology (ISAP) proceedings paper conveys the

Air Force Service Procurement. Approaches for Measurement and Management

DTIC Science & Technology

2005-01-01

2003, Ritz - Carlton Hotel , Arlington, Vir- ginia. 15 We used a variety of search terms for the business literature review, including purchased services... Carlton Hotel , Arlington, Va., June 5, 2003. Shirley, Chad, John Ausink, and Laura H. Baldwin, Measuring Changes in Service Costs to Meet the Requirements...Richter, Gene, "Ten Private Sector Best Practices," presentation at the Pro- curement Executive Roundtable sponsored by the SAS Institute, Ritz

Application of Long Distance Conveyance (LDC) of Dredged Sediments to Louisiana Coastal Restoration

DTIC Science & Technology

2011-01-01

U.S. Army Engineer District, New Orleans, Laura Beldon, Louisiana Office of Coastal Protection and Restoration, Cheryl Brodnax, National...Louisiana Department of Natural Resources, Christopher Knotts , Louisiana Department of Natural Resources, Fay Lachney, MVN, Luke LeBas, Louisiana...associated with the petrochemical industry (e.g., Van Dyke et al. 1994) or backfilled canals dredged as part of the pipeline installation (e.g., Knott et al

Towards a Fiscally Constrained Pacific Posture

DTIC Science & Technology

2012-03-21

joint press conference with Australian Prime Minister Julia Gillard , President Obama emphasized U.S. intent in the Asia Pacific region when he... gillard -australia-joint-press (accessed February 5, 2012). 5 Laura MacInnis and Caren Bohan, “Obama seeks to hitch U.S. economy to Asian growth,” Reuters...November 16, 2011. http://www.whitehouse.gov/the-press-office/2011/11/16/remarks-president-obama-and-prime- minister- gillard -australia-joint-press

The Past, Present, and Future of Second Language Research: Selected Proceedings of the 2000 Second Language Research Forum (Madison, Wisconsin, September 7-10, 2000).

ERIC Educational Resources Information Center

Bonch-Bruevich, Xenia, Ed.; Crawford, William J., Ed.; Hellermann, John, Ed.; Higgins, Christina, Ed.; Nguyen, Hanh, Ed.

This book presents 16 peer-reviewed papers from a 2000 conference on second language research. Part 1, "Formal Investigations of SLA," includes "L2 Acquisition of English Liquids: Evidence for Production Independent from Perception" (Laura Catharine Smith); "Is L2 Learning the Same as L1 Learning? Learning L2 Phonology in…

Proceedings of the Annual Meeting of the Association for Education in Journalism and Mass Communication (86th, Kansas City, Missouri, July 30-August 2, 2003). Radio-Television Journalism Division.

ERIC Educational Resources Information Center

2003

The Radio-Television Journalism Division of the proceedings contains the following 11 papers: "In Whose Best Interest? FCC Deregulation and Local News: How Cross-Ownership, National Caps, and Duopolies Are Addressed in Three Commissioned Studies" (Laura K. Smith); "Remembering the News: The Effect of Chronological Presentation of…