Optimal Path Determination for Flying Vehicle to Search an Object

NASA Astrophysics Data System (ADS)

Heru Tjahjana, R.; Heri Soelistyo U, R.; Ratnasari, L.; Irawanto, B.

2018-01-01

In this paper, a method to determine optimal path for flying vehicle to search an object is proposed. Background of the paper is controlling air vehicle to search an object. Optimal path determination is one of the most popular problem in optimization. This paper describe model of control design for a flying vehicle to search an object, and focus on the optimal path that used to search an object. In this paper, optimal control model is used to control flying vehicle to make the vehicle move in optimal path. If the vehicle move in optimal path, then the path to reach the searched object also optimal. The cost Functional is one of the most important things in optimal control design, in this paper the cost functional make the air vehicle can move as soon as possible to reach the object. The axis reference of flying vehicle uses N-E-D (North-East-Down) coordinate system. The result of this paper are the theorems which say that the cost functional make the control optimal and make the vehicle move in optimal path are proved analytically. The other result of this paper also shows the cost functional which used is convex. The convexity of the cost functional is use for guarantee the existence of optimal control. This paper also expose some simulations to show an optimal path for flying vehicle to search an object. The optimization method which used to find the optimal control and optimal path vehicle in this paper is Pontryagin Minimum Principle.

Automated Reconstruction of Neural Trees Using Front Re-initialization

PubMed Central

Mukherjee, Amit; Stepanyants, Armen

2013-01-01

This paper proposes a greedy algorithm for automated reconstruction of neural arbors from light microscopy stacks of images. The algorithm is based on the minimum cost path method. While the minimum cost path, obtained using the Fast Marching Method, results in a trace with the least cumulative cost between the start and the end points, it is not sufficient for the reconstruction of neural trees. This is because sections of the minimum cost path can erroneously travel through the image background with undetectable detriment to the cumulative cost. To circumvent this problem we propose an algorithm that grows a neural tree from a specified root by iteratively re-initializing the Fast Marching fronts. The speed image used in the Fast Marching Method is generated by computing the average outward flux of the gradient vector flow field. Each iteration of the algorithm produces a candidate extension by allowing the front to travel a specified distance and then tracking from the farthest point of the front back to the tree. Robust likelihood ratio test is used to evaluate the quality of the candidate extension by comparing voxel intensities along the extension to those in the foreground and the background. The qualified extensions are appended to the current tree, the front is re-initialized, and Fast Marching is continued until the stopping criterion is met. To evaluate the performance of the algorithm we reconstructed 6 stacks of two-photon microscopy images and compared the results to the ground truth reconstructions by using the DIADEM metric. The average comparison score was 0.82 out of 1.0, which is on par with the performance achieved by expert manual tracers. PMID:24386539

A machine-learning graph-based approach for 3D segmentation of Bruch's membrane opening from glaucomatous SD-OCT volumes.

PubMed

Miri, Mohammad Saleh; Abràmoff, Michael D; Kwon, Young H; Sonka, Milan; Garvin, Mona K

2017-07-01

Bruch's membrane opening-minimum rim width (BMO-MRW) is a recently proposed structural parameter which estimates the remaining nerve fiber bundles in the retina and is superior to other conventional structural parameters for diagnosing glaucoma. Measuring this structural parameter requires identification of BMO locations within spectral domain-optical coherence tomography (SD-OCT) volumes. While most automated approaches for segmentation of the BMO either segment the 2D projection of BMO points or identify BMO points in individual B-scans, in this work, we propose a machine-learning graph-based approach for true 3D segmentation of BMO from glaucomatous SD-OCT volumes. The problem is formulated as an optimization problem for finding a 3D path within the SD-OCT volume. In particular, the SD-OCT volumes are transferred to the radial domain where the closed loop BMO points in the original volume form a path within the radial volume. The estimated location of BMO points in 3D are identified by finding the projected location of BMO points using a graph-theoretic approach and mapping the projected locations onto the Bruch's membrane (BM) surface. Dynamic programming is employed in order to find the 3D BMO locations as the minimum-cost path within the volume. In order to compute the cost function needed for finding the minimum-cost path, a random forest classifier is utilized to learn a BMO model, obtained by extracting intensity features from the volumes in the training set, and computing the required 3D cost function. The proposed method is tested on 44 glaucoma patients and evaluated using manual delineations. Results show that the proposed method successfully identifies the 3D BMO locations and has significantly smaller errors compared to the existing 3D BMO identification approaches. Published by Elsevier B.V.

Finding Chemical Reaction Paths with a Multilevel Preconditioning Protocol

DOE PAGES

Kale, Seyit; Sode, Olaseni; Weare, Jonathan; ...

2014-11-07

Finding transition paths for chemical reactions can be computationally costly owing to the level of quantum-chemical theory needed for accuracy. Here, we show that a multilevel preconditioning scheme that was recently introduced (Tempkin et al. J. Chem. Phys. 2014, 140, 184114) can be used to accelerate quantum-chemical string calculations. We demonstrate the method by finding minimum-energy paths for two well-characterized reactions: tautomerization of malonaldehyde and Claissen rearrangement of chorismate to prephanate. For these reactions, we show that preconditioning density functional theory (DFT) with a semiempirical method reduces the computational cost for reaching a converged path that is an optimum undermore » DFT by several fold. In conclusion, the approach also shows promise for free energy calculations when thermal noise can be controlled.« less

Research and application of genetic algorithm in path planning of logistics distribution vehicle

NASA Astrophysics Data System (ADS)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.

Thermal Stability of Al2O3/Silicone Composites as High-Temperature Encapsulants

NASA Astrophysics Data System (ADS)

Yao, Yiying

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Network Design for Reliability and Resilience to Attack

DTIC Science & Technology

2014-03-01

attacker can destroy n arcs in the network SPNI Shortest-Path Network-Interdiction problem TSP Traveling Salesman Problem UB upper bound UKR Ukraine...elimination from the traveling salesman problem (TSP). Literature calls a walk that does not contain a cycle a path [19]. The objective function in...arc lengths as random variables with known probability distributions. The m-median problem seeks to design a network with minimum average travel cost

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

New Polyazine-Bridged RuII,RhIII and RuII,RhI Supramolecular Photocatalysts for Water Reduction to Hydrogen Applicable for Solar Energy Conversion and Mechanistic Investigation of the Photocatalytic Cycle

NASA Astrophysics Data System (ADS)

Zhou, Rongwei

Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

Solving fuzzy shortest path problem by genetic algorithm

NASA Astrophysics Data System (ADS)

Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

2018-03-01

Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

TH-CD-206-07: Determination of Patient-Specific Myocardial Mass at Risk Using Computed Tomography Angiography

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

Hubbard, L; Ziemer, B; Malkasian, S

Purpose: To evaluate the accuracy of a patient-specific coronary perfusion territory assignment algorithm that uses CT angiography (CTA) and a minimum-cost-path approach to assign coronary perfusion territories on a voxel-by-voxel basis for determination of myocardial mass at risk. Methods: Intravenous (IV) contrast (370 mg/mL iodine, 25 mL, 7 mL/s) was injected centrally into five swine (35–45 kg) and CTA was performed using a 320-slice CT scanner at 100 kVp and 200 mA. Additionally, a 4F catheter was advanced into the left anterior descending (LAD), left circumflex (LCX), and right coronary artery (RCA) and contrast (30 mg/mL iodine, 10 mL, 1.5more » mL/s) was directly injected into each coronary artery for isolation of reference coronary perfusion territories. Semiautomatic myocardial segmentation of the CTA data was then performed and the centerlines of the LAD, LCX, and RCA were digitally extracted through image processing. Individual coronary perfusion territories were then assigned using a minimum-cost-path approach, and were quantitatively compared to the reference coronary perfusion territories. Results: The results of the coronary perfusion territory assignment algorithm were in good agreement with the reference coronary perfusion territories. The average volumetric assignment error from mitral orifice to apex was 5.5 ± 1.1%, corresponding to 2.1 ± 0.7 grams of myocardial mass misassigned for each coronary perfusion territory. Conclusion: The results indicate that accurate coronary perfusion territory assignment is possible on a voxel-by-voxel basis using CTA data and an assignment algorithm based on a minimum-cost-path approach. Thus, the technique can potentially be used to accurately determine patient-specific myocardial mass at risk distal to a coronary stenosis, improving coronary lesion assessment and treatment. Conflict of Interest (only if applicable): Grant funding from Toshiba America Medical Systems.« less

A biomimetic, energy-harvesting, obstacle-avoiding, path-planning algorithm for UAVs

NASA Astrophysics Data System (ADS)

Gudmundsson, Snorri

This dissertation presents two new approaches to energy harvesting for Unmanned Aerial Vehicles (UAV). One method is based on the Potential Flow Method (PFM); the other method seeds a wind-field map based on updraft peak analysis and then applies a variant of the Bellman-Ford algorithm to find the minimum-cost path. Both methods are enhanced by taking into account the performance characteristics of the aircraft using advanced performance theory. The combined approach yields five possible trajectories from which the one with the minimum energy cost is selected. The dissertation concludes by using the developed theory and modeling tools to simulate the flight paths of two small Unmanned Aerial Vehicles (sUAV) in the 500 kg and 250 kg class. The results show that, in mountainous regions, substantial energy can be recovered, depending on topography and wind characteristics. For the examples presented, as much as 50% of the energy was recovered for a complex, multi-heading, multi-altitude, 170 km mission in an average wind speed of 9 m/s. The algorithms constitute a Generic Intelligent Control Algorithm (GICA) for autonomous unmanned aerial vehicles that enables an extraction of atmospheric energy while completing a mission trajectory. At the same time, the algorithm. automatically adjusts the flight path in order to avoid obstacles, in a fashion not unlike what one would expect from living organisms, such as birds and insects. This multi-disciplinary approach renders the approach biomimetic, i.e. it constitutes a synthetic system that “mimics the formation and function of biological mechanisms and processes.”.

Path Planning Algorithms for the Adaptive Sensor Fleet

NASA Technical Reports Server (NTRS)

Stoneking, Eric; Hosler, Jeff

2005-01-01

The Adaptive Sensor Fleet (ASF) is a general purpose fleet management and planning system being developed by NASA in coordination with NOAA. The current mission of ASF is to provide the capability for autonomous cooperative survey and sampling of dynamic oceanographic phenomena such as current systems and algae blooms. Each ASF vessel is a software model that represents a real world platform that carries a variety of sensors. The OASIS platform will provide the first physical vessel, outfitted with the systems and payloads necessary to execute the oceanographic observations described in this paper. The ASF architecture is being designed for extensibility to accommodate heterogenous fleet elements, and is not limited to using the OASIS platform to acquire data. This paper describes the path planning algorithms developed for the acquisition phase of a typical ASF task. Given a polygonal target region to be surveyed, the region is subdivided according to the number of vessels in the fleet. The subdivision algorithm seeks a solution in which all subregions have equal area and minimum mean radius. Once the subregions are defined, a dynamic programming method is used to find a minimum-time path for each vessel from its initial position to its assigned region. This path plan includes the effects of water currents as well as avoidance of known obstacles. A fleet-level planning algorithm then shuffles the individual vessel assignments to find the overall solution which puts all vessels in their assigned regions in the minimum time. This shuffle algorithm may be described as a process of elimination on the sorted list of permutations of a cost matrix. All these path planning algorithms are facilitated by discretizing the region of interest onto a hexagonal tiling.

A New Control Paradigm for Stochastic Differential Equations

NASA Astrophysics Data System (ADS)

Schmid, Matthias J. A.

This study presents a novel comprehensive approach to the control of dynamic systems under uncertainty governed by stochastic differential equations (SDEs). Large Deviations (LD) techniques are employed to arrive at a control law for a large class of nonlinear systems minimizing sample path deviations. Thereby, a paradigm shift is suggested from point-in-time to sample path statistics on function spaces. A suitable formal control framework which leverages embedded Freidlin-Wentzell theory is proposed and described in detail. This includes the precise definition of the control objective and comprises an accurate discussion of the adaptation of the Freidlin-Wentzell theorem to the particular situation. The new control design is enabled by the transformation of an ill-posed control objective into a well-conditioned sequential optimization problem. A direct numerical solution process is presented using quadratic programming, but the emphasis is on the development of a closed-form expression reflecting the asymptotic deviation probability of a particular nominal path. This is identified as the key factor in the success of the new paradigm. An approach employing the second variation and the differential curvature of the effective action is suggested for small deviation channels leading to the Jacobi field of the rate function and the subsequently introduced Jacobi field performance measure. This closed-form solution is utilized in combination with the supplied parametrization of the objective space. For the first time, this allows for an LD based control design applicable to a large class of nonlinear systems. Thus, Minimum Large Deviations (MLD) control is effectively established in a comprehensive structured framework. The construction of the new paradigm is completed by an optimality proof for the Jacobi field performance measure, an interpretive discussion, and a suggestion for efficient implementation. The potential of the new approach is exhibited by its extension to scalar systems subject to state-dependent noise and to systems of higher order. The suggested control paradigm is further advanced when a sequential application of MLD control is considered. This technique yields a nominal path corresponding to the minimum total deviation probability on the entire time domain. It is demonstrated that this sequential optimization concept can be unified in a single objective function which is revealed to be the Jacobi field performance index on the entire domain subject to an endpoint deviation. The emerging closed-form term replaces the previously required nested optimization and, thus, results in a highly efficient application-ready control design. This effectively substantiates Minimum Path Deviation (MPD) control. The proposed control paradigm allows the specific problem of stochastic cost control to be addressed as a special case. This new technique is employed within this study for the stochastic cost problem giving rise to Cost Constrained MPD (CCMPD) as well as to Minimum Quadratic Cost Deviation (MQCD) control. An exemplary treatment of a generic scalar nonlinear system subject to quadratic costs is performed for MQCD control to demonstrate the elementary expandability of the new control paradigm. This work concludes with a numerical evaluation of both MPD and CCMPD control for three exemplary benchmark problems. Numerical issues associated with the simulation of SDEs are briefly discussed and illustrated. The numerical examples furnish proof of the successful design. This study is complemented by a thorough review of statistical control methods, stochastic processes, Large Deviations techniques and the Freidlin-Wentzell theory, providing a comprehensive, self-contained account. The presentation of the mathematical tools and concepts is of a unique character, specifically addressing an engineering audience.

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

Reister, D.B.; Lenhart, S.M.

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature ofmore » the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.« less

Time optimal paths for high speed maneuvering

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

Reister, D.B.; Lenhart, S.M.

1993-01-01

Recent theoretical results have completely solved the problem of determining the minimum length path for a vehicle with a minimum turning radius moving from an initial configuration to a final configuration. Time optimal paths for a constant speed vehicle are a subset of the minimum length paths. This paper uses the Pontryagin maximum principle to find time optimal paths for a constant speed vehicle. The time optimal paths consist of sequences of axes of circles and straight lines. The maximum principle introduces concepts (dual variables, bang-bang solutions, singular solutions, and transversality conditions) that provide important insight into the nature ofmore » the time optimal paths. We explore the properties of the optimal paths and present some experimental results for a mobile robot following an optimal path.« less

Robustness of mission plans for unmanned aircraft

NASA Astrophysics Data System (ADS)

Niendorf, Moritz

This thesis studies the robustness of optimal mission plans for unmanned aircraft. Mission planning typically involves tactical planning and path planning. Tactical planning refers to task scheduling and in multi aircraft scenarios also includes establishing a communication topology. Path planning refers to computing a feasible and collision-free trajectory. For a prototypical mission planning problem, the traveling salesman problem on a weighted graph, the robustness of an optimal tour is analyzed with respect to changes to the edge costs. Specifically, the stability region of an optimal tour is obtained, i.e., the set of all edge cost perturbations for which that tour is optimal. The exact stability region of solutions to variants of the traveling salesman problems is obtained from a linear programming relaxation of an auxiliary problem. Edge cost tolerances and edge criticalities are derived from the stability region. For Euclidean traveling salesman problems, robustness with respect to perturbations to vertex locations is considered and safe radii and vertex criticalities are introduced. For weighted-sum multi-objective problems, stability regions with respect to changes in the objectives, weights, and simultaneous changes are given. Most critical weight perturbations are derived. Computing exact stability regions is intractable for large instances. Therefore, tractable approximations are desirable. The stability region of solutions to relaxations of the traveling salesman problem give under approximations and sets of tours give over approximations. The application of these results to the two-neighborhood and the minimum 1-tree relaxation are discussed. Bounds on edge cost tolerances and approximate criticalities are obtainable likewise. A minimum spanning tree is an optimal communication topology for minimizing the cumulative transmission power in multi aircraft missions. The stability region of a minimum spanning tree is given and tolerances, stability balls, and criticalities are derived. This analysis is extended to Euclidean minimum spanning trees. This thesis aims at enabling increased mission performance by providing means of assessing the robustness and optimality of a mission and methods for identifying critical elements. Examples of the application to mission planning in contested environments, cargo aircraft mission planning, multi-objective mission planning, and planning optimal communication topologies for teams of unmanned aircraft are given.

Aircraft path planning for optimal imaging using dynamic cost functions

NASA Astrophysics Data System (ADS)

Christie, Gordon; Chaudhry, Haseeb; Kochersberger, Kevin

2015-05-01

Unmanned aircraft development has accelerated with recent technological improvements in sensing and communications, which has resulted in an "applications lag" for how these aircraft can best be utilized. The aircraft are becoming smaller, more maneuverable and have longer endurance to perform sensing and sampling missions, but operating them aggressively to exploit these capabilities has not been a primary focus in unmanned systems development. This paper addresses a means of aerial vehicle path planning to provide a realistic optimal path in acquiring imagery for structure from motion (SfM) reconstructions and performing radiation surveys. This method will allow SfM reconstructions to occur accurately and with minimal flight time so that the reconstructions can be executed efficiently. An assumption is made that we have 3D point cloud data available prior to the flight. A discrete set of scan lines are proposed for the given area that are scored based on visibility of the scene. Our approach finds a time-efficient path and calculates trajectories between scan lines and over obstacles encountered along those scan lines. Aircraft dynamics are incorporated into the path planning algorithm as dynamic cost functions to create optimal imaging paths in minimum time. Simulations of the path planning algorithm are shown for an urban environment. We also present our approach for image-based terrain mapping, which is able to efficiently perform a 3D reconstruction of a large area without the use of GPS data.

Development of Advanced Methods of Structural and Trajectory Analysis for Transport Aircraft

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Windhorst, Robert; Phillips, James

1998-01-01

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

Optimization of Supersonic Transport Trajectories

NASA Technical Reports Server (NTRS)

Ardema, Mark D.; Windhorst, Robert; Phillips, James

1998-01-01

This paper develops a near-optimal guidance law for generating minimum fuel, time, or cost fixed-range trajectories for supersonic transport aircraft. The approach uses a choice of new state variables along with singular perturbation techniques to time-scale decouple the dynamic equations into multiple equations of single order (second order for the fast dynamics). Application of the maximum principle to each of the decoupled equations, as opposed to application to the original coupled equations, avoids the two point boundary value problem and transforms the problem from one of a functional optimization to one of multiple function optimizations. It is shown that such an approach produces well known aircraft performance results such as minimizing the Brequet factor for minimum fuel consumption and the energy climb path. Furthermore, the new state variables produce a consistent calculation of flight path angle along the trajectory, eliminating one of the deficiencies in the traditional energy state approximation. In addition, jumps in the energy climb path are smoothed out by integration of the original dynamic equations at constant load factor. Numerical results performed for a supersonic transport design show that a pushover dive followed by a pullout at nominal load factors are sufficient maneuvers to smooth the jump.

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Janich, Karl W.

2005-01-01

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

A bat algorithm with mutation for UCAV path planning.

PubMed

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models.

Rock climbing: A local-global algorithm to compute minimum energy and minimum free energy pathways.

PubMed

Templeton, Clark; Chen, Szu-Hua; Fathizadeh, Arman; Elber, Ron

2017-10-21

The calculation of minimum energy or minimum free energy paths is an important step in the quantitative and qualitative studies of chemical and physical processes. The computations of these coordinates present a significant challenge and have attracted considerable theoretical and computational interest. Here we present a new local-global approach to study reaction coordinates, based on a gradual optimization of an action. Like other global algorithms, it provides a path between known reactants and products, but it uses a local algorithm to extend the current path in small steps. The local-global approach does not require an initial guess to the path, a major challenge for global pathway finders. Finally, it provides an exact answer (the steepest descent path) at the end of the calculations. Numerical examples are provided for the Mueller potential and for a conformational transition in a solvated ring system.

Pseudo paths towards minimum energy states in network dynamics

NASA Astrophysics Data System (ADS)

Hedayatifar, L.; Hassanibesheli, F.; Shirazi, A. H.; Vasheghani Farahani, S.; Jafari, G. R.

2017-10-01

The dynamics of networks forming on Heider balance theory moves towards lower tension states. The condition derived from this theory enforces agents to reevaluate and modify their interactions to achieve equilibrium. These possible changes in network's topology can be considered as various paths that guide systems to minimum energy states. Based on this theory the final destination of a system could reside on a local minimum energy, ;jammed state;, or the global minimum energy, balanced states. The question we would like to address is whether jammed states just appear by chance? Or there exist some pseudo paths that bound a system towards a jammed state. We introduce an indicator to suspect the location of a jammed state based on the Inverse Participation Ratio method (IPR). We provide a margin before a local minimum where the number of possible paths dramatically drastically decreases. This is a condition that proves adequate for ending up on a jammed states.

Riemannian geometric approach to human arm dynamics, movement optimization, and invariance

NASA Astrophysics Data System (ADS)

Biess, Armin; Flash, Tamar; Liebermann, Dario G.

2011-03-01

We present a generally covariant formulation of human arm dynamics and optimization principles in Riemannian configuration space. We extend the one-parameter family of mean-squared-derivative (MSD) cost functionals from Euclidean to Riemannian space, and we show that they are mathematically identical to the corresponding dynamic costs when formulated in a Riemannian space equipped with the kinetic energy metric. In particular, we derive the equivalence of the minimum-jerk and minimum-torque change models in this metric space. Solutions of the one-parameter family of MSD variational problems in Riemannian space are given by (reparametrized) geodesic paths, which correspond to movements with least muscular effort. Finally, movement invariants are derived from symmetries of the Riemannian manifold. We argue that the geometrical structure imposed on the arm’s configuration space may provide insights into the emerging properties of the movements generated by the motor system.

A Decision Processing Algorithm for CDC Location Under Minimum Cost SCM Network

NASA Astrophysics Data System (ADS)

Park, N. K.; Kim, J. Y.; Choi, W. Y.; Tian, Z. M.; Kim, D. J.

Location of CDC in the matter of network on Supply Chain is becoming on the high concern these days. Present status of methods on CDC has been mainly based on the calculation manually by the spread sheet to achieve the goal of minimum logistics cost. This study is focused on the development of new processing algorithm to overcome the limit of present methods, and examination of the propriety of this algorithm by case study. The algorithm suggested by this study is based on the principle of optimization on the directive GRAPH of SCM model and suggest the algorithm utilizing the traditionally introduced MST, shortest paths finding methods, etc. By the aftermath of this study, it helps to assess suitability of the present on-going SCM network and could be the criterion on the decision-making process for the optimal SCM network building-up for the demand prospect in the future.

Optimal impulsive time-fixed orbital rendezvous and interception with path constraints

NASA Technical Reports Server (NTRS)

Taur, D.-R.; Prussing, J. E.; Coverstone-Carroll, V.

1990-01-01

Minimum-fuel, impulsive, time-fixed solutions are obtained for the problem of orbital rendezvous and interception with interior path constraints. Transfers between coplanar circular orbits in an inverse-square gravitational field are considered, subject to a circular path constraint representing a minimum or maximum permissible orbital radius. Primer vector theory is extended to incorporate path constraints. The optimal number of impulses, their times and positions, and the presence of initial or final coasting arcs are determined. The existence of constraint boundary arcs and boundary points is investigated as well as the optimality of a class of singular arc solutions. To illustrate the complexities introduced by path constraints, an analysis is made of optimal rendezvous in field-free space subject to a minimum radius constraint.

Variational nature, integration, and properties of Newton reaction path

NASA Astrophysics Data System (ADS)

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-01

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Variational nature, integration, and properties of Newton reaction path.

PubMed

Bofill, Josep Maria; Quapp, Wolfgang

2011-02-21

The distinguished coordinate path and the reduced gradient following path or its equivalent formulation, the Newton trajectory, are analyzed and unified using the theory of calculus of variations. It is shown that their minimum character is related to the fact that the curve is located in a valley region. In this case, we say that the Newton trajectory is a reaction path with the category of minimum energy path. In addition to these findings a Runge-Kutta-Fehlberg algorithm to integrate these curves is also proposed.

Application of Network and Decision Theory to Routing Problems.

DTIC Science & Technology

1982-03-01

special thanks to Major Hal Carter, faculty member, for his help in getting the authors to understand one of the underlying algorithms in the methodology...61 26. General Methodology Flowchart .......... .. 64 27. Least Cost/Time Path Algorithm Flowchart . . 65 28. Possible Redundant Arc of Time...minimum time to travel. This was neces- sary because: 1. The DTN designers did not have a procedure to do so. 2. The various network algorithms to

PURE: a proposal for more retirement income security.

PubMed

Weller, Christian E

2007-01-01

Despite large public policy efforts over the past 30 years, a large minority of households remains consistently inadequately prepared for retirement. If policymakers want to address this shortcoming, public policy has to change from its current path. This paper suggests a system of mandatory private pensions funded by a minimum mandatory contribution of 3% of payroll. In addition, a number of institutional changes are suggested to reduce the costs and risks of individual accounts.

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

47 CFR 101.143 - Minimum path length requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SERVICES FIXED MICROWAVE SERVICES Technical Standards § 101.143 Minimum path length requirements. (a) The... carrier fixed point-to-point microwave services must equal or exceed the value set forth in the table...

A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning

PubMed Central

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model. PMID:23193383

A hybrid metaheuristic DE/CS algorithm for UCAV three-dimension path planning.

PubMed

Wang, Gaige; Guo, Lihong; Duan, Hong; Wang, Heqi; Liu, Luo; Shao, Mingzhen

2012-01-01

Three-dimension path planning for uninhabited combat air vehicle (UCAV) is a complicated high-dimension optimization problem, which primarily centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. A new hybrid metaheuristic differential evolution (DE) and cuckoo search (CS) algorithm is proposed to solve the UCAV three-dimension path planning problem. DE is applied to optimize the process of selecting cuckoos of the improved CS model during the process of cuckoo updating in nest. The cuckoos can act as an agent in searching the optimal UCAV path. And then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic CS. The realization procedure for this hybrid metaheuristic approach DE/CS is also presented. In order to make the optimized UCAV path more feasible, the B-Spline curve is adopted for smoothing the path. To prove the performance of this proposed hybrid metaheuristic method, it is compared with basic CS algorithm. The experiment shows that the proposed approach is more effective and feasible in UCAV three-dimension path planning than the basic CS model.

Environmental policies to enhance technological change in the electricity sector

NASA Astrophysics Data System (ADS)

Sunol Del Rio, Eric

International agreements on climate change mitigation set quantitative carbon emission reduction targets in a country for a given year with respect to a given base year. A central question is then on what time do the new clean and costly technologies need to start functioning to comply with the agreed targets, and under what incentive does the market implement them. The planner's economic problem is to design an incentive that makes the new clean technology less costly than the vintage polluting facility, at the precise time in order to comply with the agreements at minimum cost. Chapter 1 reviews the literature on efficient allocation of pollution, discussing its validity to explain induced technological change. It then presents a simple model of technological change showing that market power determes the optimal adoption time of a new technology. Chapter 2 analyzes the effectiveness of carbon costs in accelerating technological change under different paths of technological progress. Furthermore, the paper examines the influence of market conditions. It shows that emission charges do reduce the firm's optimal adoption time when investment cost paths for the new technology are convex. On the contrary, emission charges may delay the optimal the switching time of a technology when the investment cost path is concave. Chapter 3 explores the results of Chapter 2 in an agent-based model. Simulations of firms adjusting their output a la Cournot show that the effectiveness of carbon costs in accelerating technological change is highly dependant on the number of firms in the market. Moreover, the shape of the technological progress curve is determinant: the effects of carbon charges are not linear on carbon price, and become more uncertain the more concave the investment cost path is. These results show that policies aiming at internalizing pollution costs enhance technological change at very different rates, depending on the actual market conditions in the industry and the dynamics of technological progress. This has profound implications in policy design: not only do carbon charges need to be used with precaution in oligopolistic industries, but also its effectiveness depends on the inner dynamics of cleaner technological alternatives.

A Bat Algorithm with Mutation for UCAV Path Planning

PubMed Central

Wang, Gaige; Guo, Lihong; Duan, Hong; Liu, Luo; Wang, Heqi

2012-01-01

Path planning for uninhabited combat air vehicle (UCAV) is a complicated high dimension optimization problem, which mainly centralizes on optimizing the flight route considering the different kinds of constrains under complicated battle field environments. Original bat algorithm (BA) is used to solve the UCAV path planning problem. Furthermore, a new bat algorithm with mutation (BAM) is proposed to solve the UCAV path planning problem, and a modification is applied to mutate between bats during the process of the new solutions updating. Then, the UCAV can find the safe path by connecting the chosen nodes of the coordinates while avoiding the threat areas and costing minimum fuel. This new approach can accelerate the global convergence speed while preserving the strong robustness of the basic BA. The realization procedure for original BA and this improved metaheuristic approach BAM is also presented. To prove the performance of this proposed metaheuristic method, BAM is compared with BA and other population-based optimization methods, such as ACO, BBO, DE, ES, GA, PBIL, PSO, and SGA. The experiment shows that the proposed approach is more effective and feasible in UCAV path planning than the other models. PMID:23365518

Sensory Agreement Guides Kinetic Energy Optimization of Arm Movements during Object Manipulation.

PubMed

Farshchiansadegh, Ali; Melendez-Calderon, Alejandro; Ranganathan, Rajiv; Murphey, Todd D; Mussa-Ivaldi, Ferdinando A

2016-04-01

The laws of physics establish the energetic efficiency of our movements. In some cases, like locomotion, the mechanics of the body dominate in determining the energetically optimal course of action. In other tasks, such as manipulation, energetic costs depend critically upon the variable properties of objects in the environment. Can the brain identify and follow energy-optimal motions when these motions require moving along unfamiliar trajectories? What feedback information is required for such optimal behavior to occur? To answer these questions, we asked participants to move their dominant hand between different positions while holding a virtual mechanical system with complex dynamics (a planar double pendulum). In this task, trajectories of minimum kinetic energy were along curvilinear paths. Our findings demonstrate that participants were capable of finding the energy-optimal paths, but only when provided with veridical visual and haptic information pertaining to the object, lacking which the trajectories were executed along rectilinear paths.

Energy aware path planning in complex four dimensional environments

NASA Astrophysics Data System (ADS)

Chakrabarty, Anjan

This dissertation addresses the problem of energy-aware path planning for small autonomous vehicles. While small autonomous vehicles can perform missions that are too risky (or infeasible) for larger vehicles, the missions are limited by the amount of energy that can be carried on board the vehicle. Path planning techniques that either minimize energy consumption or exploit energy available in the environment can thus increase range and endurance. Path planning is complicated by significant spatial (and potentially temporal) variations in the environment. While the main focus is on autonomous aircraft, this research also addresses autonomous ground vehicles. Range and endurance of small unmanned aerial vehicles (UAVs) can be greatly improved by utilizing energy from the atmosphere. Wind can be exploited to minimize energy consumption of a small UAV. But wind, like any other atmospheric component , is a space and time varying phenomenon. To effectively use wind for long range missions, both exploration and exploitation of wind is critical. This research presents a kinematics based tree algorithm which efficiently handles the four dimensional (three spatial and time) path planning problem. The Kinematic Tree algorithm provides a sequence of waypoints, airspeeds, heading and bank angle commands for each segment of the path. The planner is shown to be resolution complete and computationally efficient. Global optimality of the cost function cannot be claimed, as energy is gained from the atmosphere, making the cost function inadmissible. However the Kinematic Tree is shown to be optimal up to resolution if the cost function is admissible. Simulation results show the efficacy of this planning method for a glider in complex real wind data. Simulation results verify that the planner is able to extract energy from the atmosphere enabling long range missions. The Kinematic Tree planning framework, developed to minimize energy consumption of UAVs, is applied for path planning in ground robots. In traditional path planning problem the focus is on obstacle avoidance and navigation. The optimal Kinematic Tree algorithm named Kinematic Tree* is shown to find optimal paths to reach the destination while avoiding obstacles. A more challenging path planning scenario arises for planning in complex terrain. This research shows how the Kinematic Tree* algorithm can be extended to find minimum energy paths for a ground vehicle in difficult mountainous terrain.

A Minimum Path Algorithm Among 3D-Polyhedral Objects

NASA Astrophysics Data System (ADS)

Yeltekin, Aysin

1989-03-01

In this work we introduce a minimum path theorem for 3D case. We also develop an algorithm based on the theorem we prove. The algorithm will be implemented on the software package we develop using C language. The theorem we introduce states that; "Given the initial point I, final point F and S be the set of finite number of static obstacles then an optimal path P from I to F, such that PA S = 0 is composed of straight line segments which are perpendicular to the edge segments of the objects." We prove the theorem as well as we develop the following algorithm depending on the theorem to find the minimum path among 3D-polyhedral objects. The algorithm generates the point Qi on edge ei such that at Qi one can find the line which is perpendicular to the edge and the IF line. The algorithm iteratively provides a new set of initial points from Qi and exploits all possible paths. Then the algorithm chooses the minimum path among the possible ones. The flowchart of the program as well as the examination of its numerical properties are included.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

PubMed

Jiang, Ailian; Zheng, Lihong

2018-03-29

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

PubMed Central

2018-01-01

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime. PMID:29596336

Equalizing secondary path effects using the periodicity of fMRI acoustic noise.

PubMed

Kannan, Govind; Milani, Ali A; Panahi, Issa; Briggs, Richard

2008-01-01

Non-minimum phase secondary path has a direct effect on achieving a desired noise attenuation level in active noise control (ANC) systems. The adaptive noise canceling filter is often a causal FIR filter which may not be able to sufficiently equalize the effect of a non-minimum phase secondary path, since in theory only a non-causal filter can equalize it. However a non-causal stable filter can be found to equalize the non-minimum phase effect of secondary path. Realization of non-causal stable filters requires knowledge of future values of input signal. In this paper we develop methods for equalizing the non-minimum phase property of the secondary path and improving the performance of an ANC system by exploiting the periodicity of fMRI acoustic noise. It has been shown that the scanner noise component is highly periodic and hence predictable which enables easy realization of non-causal filtering. Improvement in performance due to the proposed methods (with and without the equalizer) is shown for periodic fMRI acoustic noise.

The Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity

DTIC Science & Technology

2012-09-13

Jordan, Captain, USAF AFIT/DS/ENS/12-09 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright- Patterson Air Force Base...Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu 1.1 Abstract United...Technology 2950 Hobson Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu

47 CFR 74.644 - Minimum path lengths for fixed links.

Code of Federal Regulations, 2013 CFR

2013-10-01

... fixed link must equal or exceed the value set forth in the table below or the EIRP must be reduced in...,990-7,125 17 12,200-13,250 5 Above 17,700 n/a (b) For paths shorter than those specified in the Table... = Maximum EIRP as set forth in the Table in § 74.636 of this part. A = Minimum path length from the Table...

47 CFR 74.644 - Minimum path lengths for fixed links.

Code of Federal Regulations, 2010 CFR

2010-10-01

... fixed link must equal or exceed the value set forth in the table below or the EIRP must be reduced in...,990-7,125 17 12,200-13,250 5 Above 17,700 n/a (b) For paths shorter than those specified in the Table... = Maximum EIRP as set forth in the Table in § 74.636 of this part. A = Minimum path length from the Table...

47 CFR 74.644 - Minimum path lengths for fixed links.

Code of Federal Regulations, 2012 CFR

2012-10-01

... fixed link must equal or exceed the value set forth in the table below or the EIRP must be reduced in...,990-7,125 17 12,200-13,250 5 Above 17,700 n/a (b) For paths shorter than those specified in the Table... = Maximum EIRP as set forth in the Table in § 74.636 of this part. A = Minimum path length from the Table...

47 CFR 74.644 - Minimum path lengths for fixed links.

Code of Federal Regulations, 2014 CFR

2014-10-01

... fixed link must equal or exceed the value set forth in the table below or the EIRP must be reduced in...,990-7,125 17 12,200-13,250 5 Above 17,700 n/a (b) For paths shorter than those specified in the Table... = Maximum EIRP as set forth in the Table in § 74.636 of this part. A = Minimum path length from the Table...

47 CFR 74.644 - Minimum path lengths for fixed links.

Code of Federal Regulations, 2011 CFR

2011-10-01

... fixed link must equal or exceed the value set forth in the table below or the EIRP must be reduced in...,990-7,125 17 12,200-13,250 5 Above 17,700 n/a (b) For paths shorter than those specified in the Table... = Maximum EIRP as set forth in the Table in § 74.636 of this part. A = Minimum path length from the Table...

Dynamical mechanism in aero-engine gas path system using minimum spanning tree and detrended cross-correlation analysis

NASA Astrophysics Data System (ADS)

Dong, Keqiang; Zhang, Hong; Gao, You

2017-01-01

Identifying the mutual interaction in aero-engine gas path system is a crucial problem that facilitates the understanding of emerging structures in complex system. By employing the multiscale multifractal detrended cross-correlation analysis method to aero-engine gas path system, the cross-correlation characteristics between gas path system parameters are established. Further, we apply multiscale multifractal detrended cross-correlation distance matrix and minimum spanning tree to investigate the mutual interactions of gas path variables. The results can infer that the low-spool rotor speed (N1) and engine pressure ratio (EPR) are main gas path parameters. The application of proposed method contributes to promote our understanding of the internal mechanisms and structures of aero-engine dynamics.

Method and apparatus for determining and utilizing a time-expanded decision network

NASA Technical Reports Server (NTRS)

de Weck, Olivier (Inventor); Silver, Matthew (Inventor)

2012-01-01

A method, apparatus and computer program for determining and utilizing a time-expanded decision network is presented. A set of potential system configurations is defined. Next, switching costs are quantified to create a "static network" that captures the difficulty of switching among these configurations. A time-expanded decision network is provided by expanding the static network in time, including chance and decision nodes. Minimum cost paths through the network are evaluated under plausible operating scenarios. The set of initial design configurations are iteratively modified to exploit high-leverage switches and the process is repeated to convergence. Time-expanded decision networks are applicable, but not limited to, the design of systems, products, services and contracts.

Minimum-fuel, three-dimensional flight paths for jet transports

NASA Technical Reports Server (NTRS)

Neuman, F.; Kreindler, E.

1985-01-01

A number of studies dealing with fuel minimization are concerned with three-dimensional flight. However, only Neuman and Kreindler (1982) consider cases involving commercial jet transports. In the latter study, only the climb-out and descent portions of complete long-range flight paths below 10,000 ft altitude have been investigated. The present investigation is concerned with the computation of minimum-fuel nonturning and turning flight paths for climb-outs from 2000 to 10,000 ft for long-range flights (greater than 50 n mi), and for complete flight paths of lengths between 5 and 50 n mi.

Absence of metastable states in strained monoatomic cubic crystals.

NASA Astrophysics Data System (ADS)

Aguayo, Aarón; Mehl, Michael L.; de Coss, Romeo

2005-03-01

The Bain path distortion of a metal with an fcc (bcc) ground state toward the bcc (fcc) structure initially requires an increase in energy, but at some point along the Bain path the energy will again decrease until a local minimum is reached. We have studied the tetragonal distortion (Bain path) of monoatomic cubic crystals, using a combination of parametrized tight-binding and first-principles linearized augmented plane wave calculations. We show that this local minimum is unstable with respect to an elastic distortion, except in the rare case that the minimum is at the bcc (fcc) point on the Bain path. This shows that body-centered-tetragonal phases of these materials, which have been seen in epitaxially grown thin films, must be stabilized by the substrate and cannot be freestanding films. This work was partially supported by Consejo Nacional de Ciencia y Tecnolog'ia (CONACYT, M'exico) under Grant No. 43830-F.

Artificial Intelligence -- Research and Applications.

DTIC Science & Technology

1976-06-01

Determination of Minimum Cost Paths," IEEE Trans. Sys . Sci. Cybernetics, Vol. 4, No. 2, pp. 100-107. Hendrix, G. (1975), "Expanding the Utility of Semantic...PLANS E , IN, 7979 IZ)’. TE.R ATE RECOGNITION LASEHTAED LOCATION SENP PARTS ANO AAlYI CONIP E TELOMPL T FP NET SSTEMCOMPRS SY -STy 7974 ’T S ST7p -TO...EXTNDE 1: OUBLE -ETNE %AT,,RAL ~C’v LA ~t PB IV P6 TO T4 %~ ’ F" _______________________________________ SY ~STEM 7’j NTJt, E EPAk AAII IJ Aii SASSEVELY

Globally Optimal Path Planning with Anisotropic Running Costs

DTIC Science & Technology

2013-03-01

contours were generated on a 3852 Cartesian grid. . . . . . . . . . . . . . . . 33 A1 The N(i, j ) set shown mapped onto Ωh as large dots for the case...function NF(x) near front set as a function of x ∈ Ωh NF(i, j ) near front set as a function of (i, j ) ∈ ΩZh Υ(x) anisotropy function at x δ Cartesian...discriminant of the polynomial p, see Equation (26) argmin argument of the minimum of a function V yz(x, ζ) see Equation (28) T (i, j ) the triplet {(i, j ), V

Planning maximally smooth hand movements constrained to nonplanar workspaces.

PubMed

Liebermann, Dario G; Krasovsky, Tal; Berman, Sigal

2008-11-01

The article characterizes hand paths and speed profiles for movements performed in a nonplanar, 2-dimensional workspace (a hemisphere of constant curvature). The authors assessed endpoint kinematics (i.e., paths and speeds) under the minimum-jerk model assumptions and calculated minimal amplitude paths (geodesics) and the corresponding speed profiles. The authors also calculated hand speeds using the 2/3 power law. They then compared modeled results with the empirical observations. In all, 10 participants moved their hands forward and backward from a common starting position toward 3 targets located within a hemispheric workspace of small or large curvature. Comparisons of modeled observed differences using 2-way RM-ANOVAs showed that movement direction had no clear influence on hand kinetics (p < .05). Workspace curvature affected the hand paths, which seldom followed geodesic lines. Constraining the paths to different curvatures did not affect the hand speed profiles. Minimum-jerk speed profiles closely matched the observations and were superior to those predicted by 2/3 power law (p < .001). The authors conclude that speed and path cannot be unambiguously linked under the minimum-jerk assumption when individuals move the hand in a nonplanar 2-dimensional workspace. In such a case, the hands do not follow geodesic paths, but they preserve the speed profile, regardless of the geometric features of the workspace.

Multiple neutral density measurements in the lower thermosphere with cold-cathode ionization gauges

NASA Astrophysics Data System (ADS)

Lehmacher, G. A.; Gaulden, T. M.; Larsen, M. F.; Craven, J. D.

2013-01-01

Cold-cathode ionization gauges were used for rocket-borne measurements of total neutral density and temperature in the aurorally forced lower thermosphere between 90 and 200 km. A commercial gauge was adapted as a low-cost instrument with a spherical antechamber for measurements in molecular flow conditions. Three roll-stabilized payloads on different trajectories each carried two instruments for measurements near the ram flow direction along the respective upleg and downleg segments of a flight path, and six density profiles were obtained within a period of 22 min covering spatial separations up to 200 km. The density profiles were integrated below 125 km to yield temperatures. The mean temperature structure was similar for all six profiles with two mesopause minima near 110 and 101 km, however, for the downleg profiles, the upper minimum was warmer and the lower minimum was colder by 20-30 K indicating significant variability over horizontal scales of 100-200 km. The upper temperature minimum coincided with maximum horizontal winds speeds, exceeding 170 m/s.

Minimum-Risk Path Finding by an Adaptive Amoebal Network

NASA Astrophysics Data System (ADS)

Nakagaki, Toshiyuki; Iima, Makoto; Ueda, Tetsuo; Nishiura, Yasumasa; Saigusa, Tetsu; Tero, Atsushi; Kobayashi, Ryo; Showalter, Kenneth

2007-08-01

When two food sources are presented to the slime mold Physarum in the dark, a thick tube for absorbing nutrients is formed that connects the food sources through the shortest route. When the light-avoiding organism is partially illuminated, however, the tube connecting the food sources follows a different route. Defining risk as the experimentally measurable rate of light-avoiding movement, the minimum-risk path is exhibited by the organism, determined by integrating along the path. A model for an adaptive-tube network is presented that is in good agreement with the experimental observations.

Processor Would Find Best Paths On Map

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P.

1990-01-01

Proposed very-large-scale integrated (VLSI) circuit image-data processor finds path of least cost from specified origin to any destination on map. Cost of traversal assigned to each picture element of map. Path of least cost from originating picture element to every other picture element computed as path that preserves as much as possible of signal transmitted by originating picture element. Dedicated microprocessor at each picture element stores cost of traversal and performs its share of computations of paths of least cost. Least-cost-path problem occurs in research, military maneuvers, and in planning routes of vehicles.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Comparison Of Reaction Barriers In Energy And Free Energy For Enzyme Catalysis

NASA Astrophysics Data System (ADS)

Andrés Cisneros, G.; Yang, Weitao

Reaction paths on potential energy surfaces obtained from QM/MM calculations of enzymatic or solution reactions depend on the starting structure employed for the path calculations. The free energies associated with these paths should be more reliable for studying reaction mechanisms, because statistical averages are used. To investigate this, the role of enzyme environment fluctuations on reaction paths has been studied with an ab initio QM/MM method for the first step of the reaction catalyzed by 4-oxalocrotonate tautomerase (4OT). Four minimum energy paths (MEPs) are compared, which have been determined with two different methods. The first path (path A) has been determined with a procedure that combines the nudged elastic band (NEB) method and a second order parallel path optimizer recently developed in our group. The second path (path B) has also been determined by the combined procedure, however, the enzyme environment has been relaxed by molecular dynamics (MD) simulations. The third path (path C) has been determined with the coordinate driving (CD) method, using the enzyme environment from path B. We compare these three paths to a previously determined path (path D) determined with the CD method. In all four cases the QM/MM-FE method (Y. Zhang et al., JCP, 112, 3483) was employed to obtain the free energy barriers for all four paths. In the case of the combined procedure, the reaction path is approximated by a small number of images which are optimized to the MEP in parallel, which results in a reduced computational cost. However, this does not allow the FEP calculation on the MEP. In order to perform FEP calculations on these paths, we introduce a modification to the NEB method that enables the addition of as many extra images to the path as needed for the FEP calculations. The calculated potential energy barriers show differences in the activation barrier between the calculated paths of as much as 5.17 kcal/mol. However, the largest free energy barrier difference is 1.58 kcal/mol. These results show the importance of the inclusion of the environment fluctuation in the calculation of enzymatic activation barriers

Potential energy function for CH3+CH3 ⇆ C2H6: Attributes of the minimum energy path

NASA Astrophysics Data System (ADS)

Robertson, S. H.; Wardlaw, D. M.; Hirst, D. M.

1993-11-01

The region of the potential energy surface for the title reaction in the vicinity of its minimum energy path has been predicted from the analysis of ab initio electronic energy calculations. The ab initio procedure employs a 6-31G** basis set and a configuration interaction calculation which uses the orbitals obtained in a generalized valence bond calculation. Calculated equilibrium properties of ethane and of isolated methyl radical are compared to existing theoretical and experimental results. The reaction coordinate is represented by the carbon-carbon interatomic distance. The following attributes are reported as a function of this distance and fit to functional forms which smoothly interpolate between reactant and product values of each attribute: the minimum energy path potential, the minimum energy path geometry, normal mode frequencies for vibrational motion orthogonal to the reaction coordinate, a torsional potential, and a fundamental anharmonic frequency for local mode, out-of-plane CH3 bending (umbrella motion). The best representation is provided by a three-parameter modified Morse function for the minimum energy path potential and a two-parameter hyperbolic tangent switching function for all other attributes. A poorer but simpler representation, which may be satisfactory for selected applications, is provided by a standard Morse function and a one-parameter exponential switching function. Previous applications of the exponential switching function to estimate the reaction coordinate dependence of the frequencies and geometry of this system have assumed the same value of the range parameter α for each property and have taken α to be less than or equal to the ``standard'' value of 1.0 Å-1. Based on the present analysis this is incorrect: The α values depend on the property and range from ˜1.2 to ˜1.8 Å-1.

Optimum flight paths of turbojet aircraft

NASA Technical Reports Server (NTRS)

Miele, Angelo

1955-01-01

The climb of turbojet aircraft is analyzed and discussed including the accelerations. Three particular flight performances are examined: minimum time of climb, climb with minimum fuel consumption, and steepest climb. The theoretical results obtained from a previous study are put in a form that is suitable for application on the following simplifying assumptions: the Mach number is considered an independent variable instead of the velocity; the variations of the airplane mass due to fuel consumption are disregarded; the airplane polar is assumed to be parabolic; the path curvatures and the squares of the path angles are disregarded in the projection of the equation of motion on the normal to the path; lastly, an ideal turbojet with performance independent of the velocity is involved. The optimum Mach number for each flight condition is obtained from the solution of a sixth order equation in which the coefficients are functions of two fundamental parameters: the ratio of minimum drag in level flight to the thrust and the Mach number which represents the flight at constant altitude and maximum lift-drag ratio.

Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

PubMed

Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

2010-01-01

It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

NASA Astrophysics Data System (ADS)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

An avionics sensitivity study. Volume 1: Operational considerations

NASA Technical Reports Server (NTRS)

Scott, R. W.; Mcconkey, E. D.

1976-01-01

Equipment and operational concepts affecting aircraft in the terminal area are reported. Curved approach applications and modified climb and descent procedures for minimum fuel consumption are considered. The curved approach study involves the application of MLS guidance to enable execution of the current visual approach to Washington National Airport under instrument flight conditions. The operational significance and the flight path control requirements involved in the application of curved approach paths to this situation are considered. Alternative flight path control regimes are considered to achieve minimum fuel consumption subject to constraints related to air traffic control requirements, flight crew and passenger reactions, and airframe and powerplant limitations.

Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

Transition path time distributions for Lévy flights

NASA Astrophysics Data System (ADS)

Janakiraman, Deepika

2018-07-01

This paper presents a study of transition path time distributions for Lévy noise-induced barrier crossing. Transition paths are short segments of the reactive trajectories and span the barrier region of the potential without spilling into the reactant/product wells. The time taken to traverse this segment is referred to as the transition path time. Since the transition path is devoid of excursions in the minimum, the corresponding time will give the exclusive barrier crossing time, unlike . This work explores the distribution of transition path times for superdiffusive barrier crossing, analytically. This is made possible by approximating the barrier by an inverted parabola. Using this approximation, the distributions are evaluated in both over- and under-damped limits of friction. The short-time behaviour of the distributions, provide analytical evidence for single-step transition events—a feature in Lévy-barrier crossing as observed in prior simulation studies. The average transition path time is calculated as a function of the Lévy index (α), and the optimal value of α leading to minimum average transition path time is discussed, in both the limits of friction. Langevin dynamics simulations corroborating with the analytical results are also presented.

Assessment of Hydrogen Sulfide Minimum Detection Limits of an Open Path Tunable Diode Laser

EPA Science Inventory

During June 2007, U.S. EPA conducted a feasibility study to determine whether the EPA OTM 10 measurement approach, also known as radial plume mapping (RPM), was feasible. A Boreal open-path tunable diode laser (OP-TDL) to collect path-integrated hydrogen sulfide measurements alon...

Network of dedicated processors for finding lowest-cost map path

NASA Technical Reports Server (NTRS)

Eberhardt, Silvio P. (Inventor)

1991-01-01

A method and associated apparatus are disclosed for finding the lowest cost path of several variable paths. The paths are comprised of a plurality of linked cost-incurring areas existing between an origin point and a destination point. The method comprises the steps of connecting a purality of nodes together in the manner of the cost-incurring areas; programming each node to have a cost associated therewith corresponding to one of the cost-incurring areas; injecting a signal into one of the nodes representing the origin point; propagating the signal through the plurality of nodes from inputs to outputs; reducing the signal in magnitude at each node as a function of the respective cost of the node; and, starting at one of the nodes representing the destination point and following a path having the least reduction in magnitude of the signal from node to node back to one of the nodes representing the origin point whereby the lowest cost path from the origin point to the destination point is found.

Processing of Space Resources to Enable the Vision for Space Exploration

NASA Technical Reports Server (NTRS)

Curreri, Peter A.

2006-01-01

The NASA human exploration program as directed by the Vision for Exploration (G.W. Bush, Jan. 14,2004) includes developing methods to process materials on the Moon and beyond to enable safe and affordable human exploration. Processing space resources was first popularized (O Neill 1976) as a technically viable, economically feasible means to build city sized habitats and multi GWatt solar power satellites in Earth/Moon space. Although NASA studies found the concepts to be technically reasonable in the post Apollo era (AMES 1979), the front end costs the limits of national or corporate investment. In the last decade analysis of space on has shown it to be economically justifiable even on a relatively small mission or commercial scenario basis. The Mars Reference Mission analysis (JSC 1997) demonstrated that production of return propellant on Mars can enable an order of magnitude decrease in the costs of human Mars missions. Analysis (by M. Duke 2003) shows that production of propellant on the Moon for the Earth based satellite industries can be commercially viable after a human lunar base is established. Similar economic analysis (Rapp 2005) also shows large cost benefits for lunar propellant production for Mars missions and for the use of lunar materials for the production of photovoltaic power (Freundlich 2005). Recent technologies could enable much smaller initial costs, to achieve mass, energy, and life support self sufficiency, than were achievable in the 1970s. If the Exploration Vision program is executed with a front end emphasis on space resources, it could provide a path for human self reliance beyond Earth orbit. This path can lead to an open, non-zero-sum, future for humanity with safer human competition with limitless growth potential. This paper discusses extension of the analysis for space resource utilization, to determine the minimum systems necessary for human self sufficiency and growth off Earth. Such a approach can provide a more compelling and comprehensive path to space resource utilization.

Airborne Collision Detection and Avoidance for Small UAS Sense and Avoid Systems

NASA Astrophysics Data System (ADS)

Sahawneh, Laith Rasmi

The increasing demand to integrate unmanned aircraft systems (UAS) into the national airspace is motivated by the rapid growth of the UAS industry, especially small UAS weighing less than 55 pounds. Their use however has been limited by the Federal Aviation Administration regulations due to collision risk they pose, safety and regulatory concerns. Therefore, before civil aviation authorities can approve routine UAS flight operations, UAS must be equipped with sense-and-avoid technology comparable to the see-and-avoid requirements for manned aircraft. The sense-and-avoid problem includes several important aspects including regulatory and system-level requirements, design specifications and performance standards, intruder detecting and tracking, collision risk assessment, and finally path planning and collision avoidance. In this dissertation, our primary focus is on developing an collision detection, risk assessment and avoidance framework that is computationally affordable and suitable to run on-board small UAS. To begin with, we address the minimum sensing range for the sense-and-avoid (SAA) system. We present an approximate close form analytical solution to compute the minimum sensing range to safely avoid an imminent collision. The approach is then demonstrated using a radar sensor prototype that achieves the required minimum sensing range. In the area of collision risk assessment and collision prediction, we present two approaches to estimate the collision risk of an encounter scenario. The first is a deterministic approach similar to those been developed for Traffic Alert and Collision Avoidance (TCAS) in manned aviation. We extend the approach to account for uncertainties of state estimates by deriving an analytic expression to propagate the error variance using Taylor series approximation. To address unanticipated intruders maneuvers, we propose an innovative probabilistic approach to quantify likely intruder trajectories and estimate the probability of collision risk using the uncorrelated encounter model (UEM) developed by MIT Lincoln Laboratory. We evaluate the proposed approach using Monte Carlo simulations and compare the performance with linearly extrapolated collision detection logic. For the path planning and collision avoidance part, we present multiple reactive path planning algorithms. We first propose a collision avoidance algorithm based on a simulated chain that responds to a virtual force field produced by encountering intruders. The key feature of the proposed approach is to model the future motion of both the intruder and the ownship using a chain of waypoints that are equally spaced in time. This timing information is used to continuously re-plan paths that minimize the probability of collision. Second, we present an innovative collision avoidance logic using an ownship centered coordinate system. The technique builds a graph in the local-level frame and uses the Dijkstra's algorithm to find the least cost path. An advantage of this approach is that collision avoidance is inherently a local phenomenon and can be more naturally represented in the local coordinates than the global coordinates. Finally, we propose a two step path planner for ground-based SAA systems. In the first step, an initial suboptimal path is generated using A* search. In the second step, using the A* solution as an initial condition, a chain of unit masses connected by springs and dampers evolves in a simulated force field. The chain is described by a set of ordinary differential equations that is driven by virtual forces to find the steady-state equilibrium. The simulation results show that the proposed approach produces collision-free plans while minimizing the path length. To move towards a deployable system, we apply collision detection and avoidance techniques to a variety of simulation and sensor modalities including camera, radar and ADS-B along with suitable tracking schemes. Keywords: unmanned aircraft system, small UAS, sense and avoid, minimum sensing range, airborne collision detection and avoidance, collision detection, collision risk assessment, collision avoidance, conflict detection, conflict avoidance, path planning.

Agricultural robot designed for seeding mechanism

NASA Astrophysics Data System (ADS)

Sunitha, K. A., Dr.; Suraj, G. S. G. S.; Sowrya, CH P. N.; Atchyut Sriram, G.; Shreyas, D.; Srinivas, T.

2017-05-01

In the field of agriculture, plantation begins with ploughing the land and sowing seeds. The old traditional method plough attached to an OX and tractors needs human involvement to carry the process. The driving force behind this work is to reduce the human interference in the field of agriculture and to make it cost effective. In this work, apart of the land is taken into consideration and the robot introduced localizes the path and can navigate itself without human action. For ploughing, this robot is provided with tentacles attached with saw blades. The sowing mechanism initiates with long toothed gears actuated with motors. The complete body is divided into two parts the tail part acts as a container for seeds. The successor holds on all the electronics used for automating and actuation. The locomotion is provided with wheels covered under conveyor belts. Gears at the back of the robot rotate in equal speed with respect to each other with the saw blades. For each rotation every tooth on gear will take seeds and will drop them on field. Camera at the front end tracks the path for every fixed distance and at the minimum distance it takes the path pre-programmed.

Beat-the-wave evacuation mapping for tsunami hazards in Seaside, Oregon, USA

USGS Publications Warehouse

Priest, George R.; Stimely, Laura; Wood, Nathan J.; Madin, Ian; Watzig, Rudie

2016-01-01

Previous pedestrian evacuation modeling for tsunamis has not considered variable wave arrival times or critical junctures (e.g., bridges), nor does it effectively communicate multiple evacuee travel speeds. We summarize an approach that identifies evacuation corridors, recognizes variable wave arrival times, and produces a map of minimum pedestrian travel speeds to reach safety, termed a “beat-the-wave” (BTW) evacuation analysis. We demonstrate the improved approach by evaluating difficulty of pedestrian evacuation of Seaside, Oregon, for a local tsunami generated by a Cascadia subduction zone earthquake. We establish evacuation paths by calculating the least cost distance (LCD) to safety for every grid cell in a tsunami-hazard zone using geospatial, anisotropic path distance algorithms. Minimum BTW speed to safety on LCD paths is calculated for every grid cell by dividing surface distance from that cell to safety by the tsunami arrival time at safety. We evaluated three scenarios of evacuation difficulty: (1) all bridges are intact with a 5-minute evacuation delay from the start of earthquake, (2) only retrofitted bridges are considered intact with a 5-minute delay, and (3) only retrofitted bridges are considered intact with a 10-minute delay. BTW maps also take into account critical evacuation points along complex shorelines (e.g., peninsulas, bridges over shore-parallel estuaries) where evacuees could be caught by tsunami waves. The BTW map is able to communicate multiple pedestrian travel speeds, which are typically visualized by multiple maps with current LCD-based mapping practices. Results demonstrate that evacuation of Seaside is problematic seaward of the shore-parallel waterways for those with any limitations on mobility. Tsunami vertical-evacuation refuges or additional pedestrian bridges may be effective ways of reducing loss of life seaward of these waterways.

Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

NASA Astrophysics Data System (ADS)

Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

2014-11-01

minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several cities optimally or connecting all cities with minimum total road length.

Free-end adaptive nudged elastic band method for locating transition states in minimum energy path calculation.

PubMed

Zhang, Jiayong; Zhang, Hongwu; Ye, Hongfei; Zheng, Yonggang

2016-09-07

A free-end adaptive nudged elastic band (FEA-NEB) method is presented for finding transition states on minimum energy paths, where the energy barrier is very narrow compared to the whole paths. The previously proposed free-end nudged elastic band method may suffer from convergence problems because of the kinks arising on the elastic band if the initial elastic band is far from the minimum energy path and weak springs are adopted. We analyze the origin of the formation of kinks and present an improved free-end algorithm to avoid the convergence problem. Moreover, by coupling the improved free-end algorithm and an adaptive strategy, we develop a FEA-NEB method to accurately locate the transition state with the elastic band cut off repeatedly and the density of images near the transition state increased. Several representative numerical examples, including the dislocation nucleation in a penta-twinned nanowire, the twin boundary migration under a shear stress, and the cross-slip of screw dislocation in face-centered cubic metals, are investigated by using the FEA-NEB method. Numerical results demonstrate both the stability and efficiency of the proposed method.

[System design of open-path natural gas leakage detection based on Fresnel lens].

PubMed

Xia, Hui; Liu, Wen-Qing; Zhang, Yu-Jun; Kan, Rui-Feng; Cui, Yi-Ben; Wang, Min; He, Ying; Cui, Xiao-Juan; Ruan, Jun; Geng, Hui

2009-03-01

Based on the technology of tunable diode laser absorption spectroscopy (TDLAS) in conjunction with second harmonic wave detection, a long open-path TDLAS system using a 1.65 microm InGaAsP distributed feedback laser was developed, which is used for detecting pipeline leakage. In this system, a high cost performance Fresnel lens is used as the receiving optical system, which receives the laser-beam reflected by a solid corner cube reflector, and focuses the receiving laser-beam to the InGaAs detector. At the same time, the influences of the concentration to the fluctuation of light intensity were taken into account in the process of measurement, and were eliminated by the method of normalized light intensity. As a result, the measurement error caused by the fluctuation of light intensity was made less than 1%. The experiment of natural gas leakage detection was simulated, and the detection sensitivity is 0.1 x 10(-6) (ratio by volume) with a total path of 320 m. According to the receiving light efficiency of the optical system and the detectable minimum light intensity of the detector, the detectable maximal optical path of the system was counted to be 2 000 m. The results of experiment show that it is a feasible design to use the Fresnel lens as the receiving optical system and can satisfy the demand of the leakage detection of natural gas.

Search Problems in Mission Planning and Navigation of Autonomous Aircraft. M.S. Thesis

NASA Technical Reports Server (NTRS)

Krozel, James A.

1988-01-01

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

An Alternative Humans to Mars Approach: Reducing Mission Mass with Multiple Mars Flyby Trajectories and Minimal Capability Investments

NASA Technical Reports Server (NTRS)

Whitley, Ryan J.; Jedrey, Richard; Landau, Damon; Ocampo, Cesar

2015-01-01

Mars flyby trajectories and Earth return trajectories have the potential to enable lower- cost and sustainable human exploration of Mars. Flyby and return trajectories are true minimum energy paths with low to zero post-Earth departure maneuvers. By emplacing the large crew vehicles required for human transit on these paths, the total fuel cost can be reduced. The traditional full-up repeating Earth-Mars-Earth cycler concept requires significant infrastructure, but a Mars only flyby approach minimizes mission mass and maximizes opportunities to build-up missions in a stepwise manner. In this paper multiple strategies for sending a crew of 4 to Mars orbit and back are examined. With pre-emplaced assets in Mars orbit, a transit habitat and a minimally functional Mars taxi, a complete Mars mission can be accomplished in 3 SLS launches and 2 Mars Flyby's, including Orion. While some years are better than others, ample opportunities exist within a given 15-year Earth-Mars alignment cycle. Building up a mission cadence over time, this approach can translate to Mars surface access. Risk reduction, which is always a concern for human missions, is mitigated by the use of flybys with Earth return (some of which are true free returns) capability.

A novel automatic segmentation workflow of axial breast DCE-MRI

NASA Astrophysics Data System (ADS)

Besbes, Feten; Gargouri, Norhene; Damak, Alima; Sellami, Dorra

2018-04-01

In this paper we propose a novel process of a fully automatic breast tissue segmentation which is independent from expert calibration and contrast. The proposed algorithm is composed by two major steps. The first step consists in the detection of breast boundaries. It is based on image content analysis and Moore-Neighbour tracing algorithm. As a processing step, Otsu thresholding and neighbors algorithm are applied. Then, the external area of breast is removed to get an approximated breast region. The second preprocessing step is the delineation of the chest wall which is considered as the lowest cost path linking three key points; These points are located automatically at the breast. They are respectively, the left and right boundary points and the middle upper point placed at the sternum region using statistical method. For the minimum cost path search problem, we resolve it through Dijkstra algorithm. Evaluation results reveal the robustness of our process face to different breast densities, complex forms and challenging cases. In fact, the mean overlap between manual segmentation and automatic segmentation through our method is 96.5%. A comparative study shows that our proposed process is competitive and faster than existing methods. The segmentation of 120 slices with our method is achieved at least in 20.57+/-5.2s.

Vehicle path-planning in three dimensions using optics analogs for optimizing visibility and energy cost

NASA Technical Reports Server (NTRS)

Rowe, Neil C.; Lewis, David H.

1989-01-01

Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs

PubMed Central

Jiang, Peng; Li, Deshi; Sun, Tao

2017-01-01

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region. PMID:28925960

Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs.

PubMed

Wang, Xiaoliang; Jiang, Peng; Li, Deshi; Sun, Tao

2017-09-19

Unmanned Aerial Vehicles (UAVs) play an important role in applications such as data collection and target reconnaissance. An accurate and optimal path can effectively increase the mission success rate in the case of small UAVs. Although path planning for UAVs is similar to that for traditional mobile robots, the special kinematic characteristics of UAVs (such as their minimum turning radius) have not been taken into account in previous studies. In this paper, we propose a locally-adjustable, continuous-curvature, bounded path-planning algorithm for fixed-wing UAVs. To deal with the curvature discontinuity problem, an optimal interpolation algorithm and a key-point shift algorithm are proposed based on the derivation of a curvature continuity condition. To meet the upper bound for curvature and to render the curvature extrema controllable, a local replanning scheme is designed by combining arcs and Bezier curves with monotonic curvature. In particular, a path transition mechanism is built for the replanning phase using minimum curvature circles for a planning philosophy. Numerical results demonstrate that the analytical planning algorithm can effectively generate continuous-curvature paths, while satisfying the curvature upper bound constraint and allowing UAVs to pass through all predefined waypoints in the desired mission region.

Transformation Paths from Cubic to Low-Symmetry Structures in Heusler Ni2MnGa Compound.

PubMed

Zelený, Martin; Straka, Ladislav; Sozinov, Alexei; Heczko, Oleg

2018-05-08

In order to explain the formation of low-temperature phases in stoichiometric Ni 2 MnGa magnetic shape memory alloy, we investigate the phase transformation paths from cubic austenite with Heusler structure to low-symmetry martensitic structures. We used ab initio calculations combined with the generalized solid state nudged elastic band method to determine the minimum energy path and corresponding changes in crystal lattice. The four-, five-, and seven-layered modulated phases of martensite (4O, 10M, and 14M) are built as the relaxed nanotwinned non-modulated (NM) phase. Despite having a total energy larger than the other martensitic phases, the 10M phase will spontaneously form at 0 K, because there is no energy barrier on the path and the energy decreases with a large negative slope. Moreover, a similar negative slope in the beginning of path is found also for the transformation to the 6M premartensite, which appears as a local minimum on the path leading further to 10M martensite. Transformation paths to other structures exhibit more or less significant barriers in the beginning hindering such a transformation from austenite. These findings correspond to experiment and demonstrates that the kinetics of the transformation is decisive for the selection of the particular low-symmetry structure.

Quantum optimal control of isomerization dynamics of a one-dimensional reaction-path model dominated by a competing dissociation channel

NASA Astrophysics Data System (ADS)

Kurosaki, Yuzuru; Artamonov, Maxim; Ho, Tak-San; Rabitz, Herschel

2009-07-01

Quantum wave packet optimal control simulations with intense laser pulses have been carried out for studying molecular isomerization dynamics of a one-dimensional (1D) reaction-path model involving a dominant competing dissociation channel. The 1D intrinsic reaction coordinate model mimics the ozone open→cyclic ring isomerization along the minimum energy path that successively connects the ozone cyclic ring minimum, the transition state (TS), the open (global) minimum, and the dissociative O2+O asymptote on the O3 ground-state A1' potential energy surface. Energetically, the cyclic ring isomer, the TS barrier, and the O2+O dissociation channel lie at ˜0.05, ˜0.086, and ˜0.037 hartree above the open isomer, respectively. The molecular orientation of the modeled ozone is held constant with respect to the laser-field polarization and several optimal fields are found that all produce nearly perfect isomerization. The optimal control fields are characterized by distinctive high temporal peaks as well as low frequency components, thereby enabling abrupt transfer of the time-dependent wave packet over the TS from the open minimum to the targeted ring minimum. The quick transition of the ozone wave packet avoids detrimental leakage into the competing O2+O channel. It is possible to obtain weaker optimal laser fields, resulting in slower transfer of the wave packets over the TS, when a reduced level of isomerization is satisfactory.

Theoretical analysis of the time-resolved binary (e, 2e) binding energy spectra on three-body photodissociation of acetone at 195 nm

NASA Astrophysics Data System (ADS)

Yamazaki, M.; Nakayama, S.; Zhu, C. Y.; Takahashi, M.

2017-11-01

We report on theoretical progress in time-resolved (e, 2e) electron momentum spectroscopy of photodissociation dynamics of the deuterated acetone molecule at 195 nm. We have examined the predicted minimum energy reaction path to investigate whether associated (e, 2e) calculations meet the experimental results. A noticeable difference between the experiment and calculations has been found at around binding energy of 10 eV, suggesting that the observed difference may originate, at least partly, in ever-unconsidered non-minimum energy paths.

A comparison of optimal and noise-abatement trajectories of a tilt-rotor aircraft

NASA Technical Reports Server (NTRS)

Schmitz, F. H.; Stepniewski, W. Z.; Gibs, J.; Hinterkeuser, W. Z.

1972-01-01

The potential benefits of flight path control to optimize performance and/or reduce the noise of a tilt-rotor aircraft operating in the takeoff and landing phases of flight are investigated. A theoretical performance-acoustic model is developed and then mathematically flown to yield representative takeoff and landing profiles. Minimum-time and minimum-fuel trajectories are compared to proposed noise-abatement profiles to assess the reductions in annoyance possible through flight path control. Significant reductions are feasible if a nearly vertical-takeoff flight profile is flown near the landing site; however, the time expended and fuel consumed increase.

Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network

NASA Astrophysics Data System (ADS)

Le, Zichun; Suo, Kaihua; Fu, Minglei; Jiang, Ling; Dong, Wen

2012-03-01

In order to minimize the average end to end delay for data transporting in hybrid wireless optical broadband access network, a novel routing algorithm named MSTMCF (minimum spanning tree and minimum cost flow) is devised. The routing problem is described as a minimum spanning tree and minimum cost flow model and corresponding algorithm procedures are given. To verify the effectiveness of MSTMCF algorithm, extensively simulations based on OWNS have been done under different types of traffic source.

Minimum free-energy paths for the self-organization of polymer brushes.

PubMed

Gleria, Ignacio; Mocskos, Esteban; Tagliazucchi, Mario

2017-03-22

A methodology to calculate minimum free-energy paths based on the combination of a molecular theory and the improved string method is introduced and applied to study the self-organization of polymer brushes under poor solvent conditions. Polymer brushes in a poor solvent cannot undergo macroscopic phase separation due to the physical constraint imposed by the grafting points; therefore, they microphase separate forming aggregates. Under some conditions, the theory predicts that the homogeneous brush and the aggregates can exist as two different minima of the free energy. The theoretical methodology introduced in this work allows us to predict the minimum free-energy path connecting these two minima as well as the morphology of the system along the path. It is shown that the transition between the homogeneous brush and the aggregates may involve a free-energy barrier or be barrierless depending on the relative stability of the two morphologies and the chain length and grafting density of the polymer. In the case where a free-energy barrier exists, one of the morphologies is a metastable structure and, therefore, the properties of the brush as the quality of the solvent is cycled are expected to display hysteresis. The theory is also applied to study the adhesion/deadhesion transition between two opposing surfaces modified by identical polymer brushes and it is shown that this process may also require surpassing a free-energy barrier.

Theory of Disk-to-Vesicle Transformation

NASA Astrophysics Data System (ADS)

Li, Jianfeng; Shi, An-Chang

2009-03-01

Self-assembled membranes from amphiphilic molecules, such as lipids and block copolymers, can assume a variety of morphologies dictated by energy minimization of system. The membrane energy is characterized by a bending modulus (κ), a Gaussian modulus (κG), and the line tension (γ) of the edge. Two basic morphologies of membranes are flat disks that minimize the bending energy at the cost of the edge energy, and enclosed vesicles that minimize the edge energy at the cost of bending energy. In our work, the transition from disk to vesicle is studied theoretically using the string method, which is designed to find the minimum energy path (MEP) or the most probable transition path between two local minima of an energy landscape. Previous studies of disk-to-vesicle transition usually approximate the transitional states by a series of spherical cups, and found that the spherical cups do not correspond to stable or meta-stable states of the system. Our calculation demonstrates that the intermediate shapes along the MEP are very different from spherical cups. Furthermore, some of these transitional states can be meta-stable. The disk-to-vesicle transition pathways are governed by two scaled parameters, κG/κ and γR0/4κ, where R0 is the radius of the disk. In particular, a meta-stable intermediate state is predicted, which may correspond to the open morphologies observed in experiments and simulations.

41 CFR 102-76.80 - What is required if the costs of alterations to provide an accessible path of travel to an...

Code of Federal Regulations, 2010 CFR

2010-07-01

... to provide an accessible path of travel to an altered area containing a primary function are... accessible path of travel to an altered area containing a primary function are disproportionate to the costs... exceeding 20 percent of the costs of the alterations to the primary function area. Priority should be given...

41 CFR 102-76.80 - What is required if the costs of alterations to provide an accessible path of travel to an...

Code of Federal Regulations, 2012 CFR

2012-01-01

... to provide an accessible path of travel to an altered area containing a primary function are... accessible path of travel to an altered area containing a primary function are disproportionate to the costs... exceeding 20 percent of the costs of the alterations to the primary function area. Priority should be given...

41 CFR 102-76.80 - What is required if the costs of alterations to provide an accessible path of travel to an...

Code of Federal Regulations, 2013 CFR

2013-07-01

... to provide an accessible path of travel to an altered area containing a primary function are... accessible path of travel to an altered area containing a primary function are disproportionate to the costs... exceeding 20 percent of the costs of the alterations to the primary function area. Priority should be given...

41 CFR 102-76.80 - What is required if the costs of alterations to provide an accessible path of travel to an...

Code of Federal Regulations, 2011 CFR

2011-01-01

... to provide an accessible path of travel to an altered area containing a primary function are... accessible path of travel to an altered area containing a primary function are disproportionate to the costs... exceeding 20 percent of the costs of the alterations to the primary function area. Priority should be given...

41 CFR 102-76.80 - What is required if the costs of alterations to provide an accessible path of travel to an...

Code of Federal Regulations, 2014 CFR

2014-01-01

... to provide an accessible path of travel to an altered area containing a primary function are... accessible path of travel to an altered area containing a primary function are disproportionate to the costs... exceeding 20 percent of the costs of the alterations to the primary function area. Priority should be given...

Advances in Chemical and Structural Characterization of Concretion with Implications for Modeling Marine Corrosion

NASA Astrophysics Data System (ADS)

Johnson, Donald L.; DeAngelis, Robert J.; Medlin, Dana J.; Carr, James D.; Conlin, David L.

2014-05-01

The Weins number model and concretion equivalent corrosion rate methodology were developed as potential minimum-impact, cost-effective techniques to determine corrosion damage on submerged steel structures. To apply the full potential of these technologies, a detailed chemical and structural characterization of the concretion (hard biofouling) that transforms into iron bearing minerals is required. The fractions of existing compounds and the quantitative chemistries are difficult to determine from x-ray diffraction. Environmental scanning electron microscopy was used to present chemical compositions by means of energy-dispersive spectroscopy (EDS). EDS demonstrates the chemical data in mapping format or in point or selected area chemistries. Selected-area EDS data collection at precise locations is presented in terms of atomic percent. The mechanism of formation and distribution of the iron-bearing mineral species at specific locations will be presented. Based on water retention measurements, porosity in terms of void volume varies from 15 v/o to 30 v/o (vol.%). The void path displayed by scanning electron microscopy imaging illustrates the tortuous path by which oxygen migrates in the water phase within the concretion from seaside to metalside.

Power Distribution System Planning with GIS Consideration

NASA Astrophysics Data System (ADS)

Wattanasophon, Sirichai; Eua-Arporn, Bundhit

This paper proposes a method for solving radial distribution system planning problems taking into account geographical information. The proposed method can automatically determine appropriate location and size of a substation, routing of feeders, and sizes of conductors while satisfying all constraints, i.e. technical constraints (voltage drop and thermal limit) and geographical constraints (obstacle, existing infrastructure, and high-cost passages). Sequential quadratic programming (SQP) and minimum path algorithm (MPA) are applied to solve the planning problem based on net price value (NPV) consideration. In addition this method integrates planner's experience and optimization process to achieve an appropriate practical solution. The proposed method has been tested with an actual distribution system, from which the results indicate that it can provide satisfactory plans.

Airway Tree Segmentation in Serial Block-Face Cryomicrotome Images of Rat Lungs

PubMed Central

Bauer, Christian; Krueger, Melissa A.; Lamm, Wayne J.; Smith, Brian J.; Glenny, Robb W.; Beichel, Reinhard R.

2014-01-01

A highly-automated method for the segmentation of airways in serial block-face cryomicrotome images of rat lungs is presented. First, a point inside of the trachea is manually specified. Then, a set of candidate airway centerline points is automatically identified. By utilizing a novel path extraction method, a centerline path between the root of the airway tree and each point in the set of candidate centerline points is obtained. Local disturbances are robustly handled by a novel path extraction approach, which avoids the shortcut problem of standard minimum cost path algorithms. The union of all centerline paths is utilized to generate an initial airway tree structure, and a pruning algorithm is applied to automatically remove erroneous subtrees or branches. Finally, a surface segmentation method is used to obtain the airway lumen. The method was validated on five image volumes of Sprague-Dawley rats. Based on an expert-generated independent standard, an assessment of airway identification and lumen segmentation performance was conducted. The average of airway detection sensitivity was 87.4% with a 95% confidence interval (CI) of (84.9, 88.6)%. A plot of sensitivity as a function of airway radius is provided. The combined estimate of airway detection specificity was 100% with a 95% CI of (99.4, 100)%. The average number and diameter of terminal airway branches was 1179 and 159 μm, respectively. Segmentation results include airways up to 31 generations. The regression intercept and slope of airway radius measurements derived from final segmentations were estimated to be 7.22 μm and 1.005, respectively. The developed approach enables quantitative studies of physiology and lung diseases in rats, requiring detailed geometric airway models. PMID:23955692

Optimizing conceptual aircraft designs for minimum life cycle cost

NASA Technical Reports Server (NTRS)

Johnson, Vicki S.

1989-01-01

A life cycle cost (LCC) module has been added to the FLight Optimization System (FLOPS), allowing the additional optimization variables of life cycle cost, direct operating cost, and acquisition cost. Extensive use of the methodology on short-, medium-, and medium-to-long range aircraft has demonstrated that the system works well. Results from the study show that optimization parameter has a definite effect on the aircraft, and that optimizing an aircraft for minimum LCC results in a different airplane than when optimizing for minimum take-off gross weight (TOGW), fuel burned, direct operation cost (DOC), or acquisition cost. Additionally, the economic assumptions can have a strong impact on the configurations optimized for minimum LCC or DOC. Also, results show that advanced technology can be worthwhile, even if it results in higher manufacturing and operating costs. Examining the number of engines a configuration should have demonstrated a real payoff of including life cycle cost in the conceptual design process: the minimum TOGW of fuel aircraft did not always have the lowest life cycle cost when considering the number of engines.

7 CFR 701.10 - Qualifying minimum cost of restoration.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 7 2010-01-01 2010-01-01 false Qualifying minimum cost of restoration. 701.10 Section..., DEPARTMENT OF AGRICULTURE AGRICULTURAL CONSERVATION PROGRAM EMERGENCY CONSERVATION PROGRAM AND CERTAIN RELATED PROGRAMS PREVIOUSLY ADMINISTERED UNDER THIS PART § 701.10 Qualifying minimum cost of restoration...

In-hospital cost comparison between the standard lateral and supercapsular percutaneously-assisted total hip surgical techniques for total hip replacement.

PubMed

Gofton, Wade; Fitch, David A

2016-03-01

The purpose of this study was to compare the in-hospital costs associated with the tissue-sparing supercapsular percutaneously-assisted total hip (SuperPath) and traditional Lateral surgical techniques for total hip replacement (THR). Between April 2013 and January 2014, in-hospital costs were reviewed for all THRs performed using the SuperPath technique by a single surgeon and all THRs performed using the Lateral technique by another surgeon at the same institution. Overall, costs were 28.4% higher in the Lateral group. This was largely attributable to increased costs associated with transfusion (+92.5%), patient rooms (+60.4%), patient food (+62.8%), narcotics (+42.5%), physical therapy (+52.5%), occupational therapy (+88.6%), and social work (+92.9%). The only costs noticeably increased for SuperPath were for imaging (+105.9%), and this was because the SuperPath surgeon performed intraoperative radiographs on all patients while the Lateral surgeon did not. The use of the SuperPath technique resulted in in-hospital cost reductions of over 28%, suggesting that this tissue-sparing surgical technique can be cost-effective primarily by facilitating early mobilisation and patient discharge even during a surgeon's initial experience with the approach.

A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition

NASA Astrophysics Data System (ADS)

Franco, Patrick; Ogier, Jean-Marc; Loonis, Pierre; Mullot, Rémy

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified. The experimental results led on the GREC2003 database show that the proposed method is characterized by a good discrimination power, a real robustness to noise with an acceptable time computing.

Computation of rare transitions in the barotropic quasi-geostrophic equations

NASA Astrophysics Data System (ADS)

Laurie, Jason; Bouchet, Freddy

2015-01-01

We investigate the theoretical and numerical computation of rare transitions in simple geophysical turbulent models. We consider the barotropic quasi-geostrophic and two-dimensional Navier-Stokes equations in regimes where bistability between two coexisting large-scale attractors exist. By means of large deviations and instanton theory with the use of an Onsager-Machlup path integral formalism for the transition probability, we show how one can directly compute the most probable transition path between two coexisting attractors analytically in an equilibrium (Langevin) framework and numerically otherwise. We adapt a class of numerical optimization algorithms known as minimum action methods to simple geophysical turbulent models. We show that by numerically minimizing an appropriate action functional in a large deviation limit, one can predict the most likely transition path for a rare transition between two states. By considering examples where theoretical predictions can be made, we show that the minimum action method successfully predicts the most likely transition path. Finally, we discuss the application and extension of such numerical optimization schemes to the computation of rare transitions observed in direct numerical simulations and experiments and to other, more complex, turbulent systems.

Simple and cost-effective hardware and software for functional brain mapping using intrinsic optical signal imaging.

PubMed

Harrison, Thomas C; Sigler, Albrecht; Murphy, Timothy H

2009-09-15

We describe a simple and low-cost system for intrinsic optical signal (IOS) imaging using stable LED light sources, basic microscopes, and commonly available CCD cameras. IOS imaging measures activity-dependent changes in the light reflectance of brain tissue, and can be performed with a minimum of specialized equipment. Our system uses LED ring lights that can be mounted on standard microscope objectives or video lenses to provide a homogeneous and stable light source, with less than 0.003% fluctuation across images averaged from 40 trials. We describe the equipment and surgical techniques necessary for both acute and chronic mouse preparations, and provide software that can create maps of sensory representations from images captured by inexpensive 8-bit cameras or by 12-bit cameras. The IOS imaging system can be adapted to commercial upright microscopes or custom macroscopes, eliminating the need for dedicated equipment or complex optical paths. This method can be combined with parallel high resolution imaging techniques such as two-photon microscopy.

Aircraft symmetric flight optimization. [gradient techniques for supersonic aircraft control

NASA Technical Reports Server (NTRS)

Falco, M.; Kelley, H. J.

1973-01-01

Review of the development of gradient techniques and their application to aircraft optimal performance computations in the vertical plane of flight. Results obtained using the method of gradients are presented for attitude- and throttle-control programs which extremize the fuel, range, and time performance indices subject to various trajectory and control constraints, including boundedness of engine throttle control. A penalty function treatment of state inequality constraints which generally appear in aircraft performance problems is outlined. Numerical results for maximum-range, minimum-fuel, and minimum-time climb paths for a hypothetical supersonic turbojet interceptor are presented and discussed. In addition, minimum-fuel climb paths subject to various levels of ground overpressure intensity constraint are indicated for a representative supersonic transport. A variant of the Gel'fand-Tsetlin 'method of ravines' is reviewed, and two possibilities for further development of continuous gradient processes are cited - namely, a projection version of conjugate gradients and a curvilinear search.

Dynamical correlation effects on photoisomerization: Ab initio multiple spawning dynamics with MS-CASPT2 for a model trans-protonated Schiff base

DOE PAGES

Liu, Lihong; Liu, Jian; Martinez, Todd J.

2015-12-17

Here, we investigate the photoisomerization of a model retinal protonated Schiff base (trans-PSB3) using ab initio multiple spawning (AIMS) based on multi-state second order perturbation theory (MSPT2). Discrepancies between the photodynamical mechanism computed with three-root state-averaged complete active space self-consistent field (SA-3-CASSCF, which does not include dynamic electron correlation effects) and MSPT2 show that dynamic correlation is critical in this photoisomerization reaction. Furthermore, we show that the photodynamics of trans-PSB3 is not well described by predictions based on minimum energy conical intersections (MECIs) or minimum energy conical intersection (CI) seam paths. Instead, most of the CIs involved in the photoisomerizationmore » are far from MECIs and minimum energy CI seam paths. Thus, both dynamical nuclear effects and dynamic electron correlation are critical to understanding the photochemical mechanism.« less

Routing and spectrum assignment based on ant colony optimization of minimum consecutiveness loss in elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Fu; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Tian, Qinghua; Zhang, Qi; Rao, Lan; Tian, Feng; Luo, Biao; Liu, Yingjun; Tang, Bao

2016-10-01

Elastic Optical Networks are considered to be a promising technology for future high-speed network. In this paper, we propose a RSA algorithm based on the ant colony optimization of minimum consecutiveness loss (ACO-MCL). Based on the effect of the spectrum consecutiveness loss on the pheromone in the ant colony optimization, the path and spectrum of the minimal impact on the network are selected for the service request. When an ant arrives at the destination node from the source node along a path, we assume that this path is selected for the request. We calculate the consecutiveness loss of candidate-neighbor link pairs along this path after the routing and spectrum assignment. Then, the networks update the pheromone according to the value of the consecutiveness loss. We save the path with the smallest value. After multiple iterations of the ant colony optimization, the final selection of the path is assigned for the request. The algorithms are simulated in different networks. The results show that ACO-MCL algorithm performs better in blocking probability and spectrum efficiency than other algorithms. Moreover, the ACO-MCL algorithm can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness. Compared with other algorithms, the ACO-MCL algorithm can reduce the blocking rate by at least 5.9% in heavy load.

Game Theory and Risk-Based Levee System Design

NASA Astrophysics Data System (ADS)

Hui, R.; Lund, J. R.; Madani, K.

2014-12-01

Risk-based analysis has been developed for optimal levee design for economic efficiency. Along many rivers, two levees on opposite riverbanks act as a simple levee system. Being rational and self-interested, land owners on each river bank would tend to independently optimize their levees with risk-based analysis, resulting in a Pareto-inefficient levee system design from the social planner's perspective. Game theory is applied in this study to analyze decision making process in a simple levee system in which the land owners on each river bank develop their design strategies using risk-based economic optimization. For each land owner, the annual expected total cost includes expected annual damage cost and annualized construction cost. The non-cooperative Nash equilibrium is identified and compared to the social planner's optimal distribution of flood risk and damage cost throughout the system which results in the minimum total flood cost for the system. The social planner's optimal solution is not feasible without appropriate level of compensation for the transferred flood risk to guarantee and improve conditions for all parties. Therefore, cooperative game theory is then employed to develop an economically optimal design that can be implemented in practice. By examining the game in the reversible and irreversible decision making modes, the cost of decision making myopia is calculated to underline the significance of considering the externalities and evolution path of dynamic water resource problems for optimal decision making.

Exploring load, velocity, and surface disorder dependence of friction with one-dimensional and two-dimensional models.

PubMed

Dagdeviren, Omur E

2018-08-03

The effect of surface disorder, load, and velocity on friction between a single asperity contact and a model surface is explored with one-dimensional and two-dimensional Prandtl-Tomlinson (PT) models. We show that there are fundamental physical differences between the predictions of one-dimensional and two-dimensional models. The one-dimensional model estimates a monotonic increase in friction and energy dissipation with load, velocity, and surface disorder. However, a two-dimensional PT model, which is expected to approximate a tip-sample system more realistically, reveals a non-monotonic trend, i.e. friction is inert to surface disorder and roughness in wearless friction regime. The two-dimensional model discloses that the surface disorder starts to dominate the friction and energy dissipation when the tip and the sample interact predominantly deep into the repulsive regime. Our numerical calculations address that tracking the minimum energy path and the slip-stick motion are two competing effects that determine the load, velocity, and surface disorder dependence of friction. In the two-dimensional model, the single asperity can follow the minimum energy path in wearless regime; however, with increasing load and sliding velocity, the slip-stick movement dominates the dynamic motion and results in an increase in friction by impeding tracing the minimum energy path. Contrary to the two-dimensional model, when the one-dimensional PT model is employed, the single asperity cannot escape to the minimum energy minimum due to constraint motion and reveals only a trivial dependence of friction on load, velocity, and surface disorder. Our computational analyses clarify the physical differences between the predictions of the one-dimensional and two-dimensional models and open new avenues for disordered surfaces for low energy dissipation applications in wearless friction regime.

49 CFR 38.29 - Interior circulation, handrails and stanchions.

Code of Federal Regulations, 2013 CFR

2013-10-01

... length with front-door lifts or ramps, vertical stanchions immediately behind the driver shall either... of 22 feet in length, the minimum interior height along the path from the lift to the securement location shall be 68 inches. For vehicles of 22 feet in length or less, the minimum interior height from...

The terminal area automated path generation problem

NASA Technical Reports Server (NTRS)

Hsin, C.-C.

1977-01-01

The automated terminal area path generation problem in the advanced Air Traffic Control System (ATC), has been studied. Definitions, input, output and the interrelationships with other ATC functions have been discussed. Alternatives in modeling the problem have been identified. Problem formulations and solution techniques are presented. In particular, the solution of a minimum effort path stretching problem (path generation on a given schedule) has been carried out using the Newton-Raphson trajectory optimization method. Discussions are presented on the effect of different delivery time, aircraft entry position, initial guess on the boundary conditions, etc. Recommendations are made on real-world implementations.

A flight investigation with a STOL airplane flying curved, descending instrument approach paths

NASA Technical Reports Server (NTRS)

Benner, M. S.; Mclaughlin, M. D.; Sawyer, R. H.; Vangunst, R.; Ryan, J. L.

1974-01-01

A flight investigation using a De Havilland Twin Otter airplane was conducted to determine the configurations of curved, 6 deg descending approach paths which would provide minimum airspace usage within the requirements for acceptable commercial STOL airplane operations. Path configurations with turns of 90 deg, 135 deg, and 180 deg were studied; the approach airspeed was 75 knots. The length of the segment prior to turn, the turn radius, and the length of the final approach segment were varied. The relationship of the acceptable path configurations to the proposed microwave landing system azimuth coverage requirements was examined.

Application of particle swarm optimization in path planning of mobile robot

NASA Astrophysics Data System (ADS)

Wang, Yong; Cai, Feng; Wang, Ying

2017-08-01

In order to realize the optimal path planning of mobile robot in unknown environment, a particle swarm optimization algorithm based on path length as fitness function is proposed. The location of the global optimal particle is determined by the minimum fitness value, and the robot moves along the points of the optimal particles to the target position. The process of moving to the target point is done with MATLAB R2014a. Compared with the standard particle swarm optimization algorithm, the simulation results show that this method can effectively avoid all obstacles and get the optimal path.

Trajectory Generation and Path Planning for Autonomous Aerobots

NASA Technical Reports Server (NTRS)

Sharma, Shivanjli; Kulczycki, Eric A.; Elfes, Alberto

2007-01-01

This paper presents global path planning algorithms for the Titan aerobot based on user defined waypoints in 2D and 3D space. The algorithms were implemented using information obtained through a planner user interface. The trajectory planning algorithms were designed to accurately represent the aerobot's characteristics, such as minimum turning radius. Additionally, trajectory planning techniques were implemented to allow for surveying of a planar area based solely on camera fields of view, airship altitude, and the location of the planar area's perimeter. The developed paths allow for planar navigation and three-dimensional path planning. These calculated trajectories are optimized to produce the shortest possible path while still remaining within realistic bounds of airship dynamics.

Theoretical characterization of the minimum energy path for hydrogen atom addition to N2 - Implications for the unimolecular lifetime of HN2

NASA Technical Reports Server (NTRS)

Walch, Stephen P.; Duchovic, Ronald J.; Rohlfing, Celeste Mcmichael

1989-01-01

Results are reported from CASSCF externally contracted CI ab initio computations of the minimum-energy path for the addition of H to N2. The theoretical basis and numerical implementation of the computations are outlined, and the results are presented in extensive tables and graphs and characterized in detail. The zero-point-corrected barrier for HN2 dissociation is estimated as 8.5 kcal/mol, and the lifetime of the lowest-lying quasi-bound vibrational state of HN2 is found to be between 88 psec and 5.8 nsec (making experimental observation of this species very difficult).

Nonlinear Control Theory for Missile Autopilot Design.

DTIC Science & Technology

1987-04-24

minimum-time controller which includes constraints on both controls and angle-of-attack is developed and an example is given. -12- - - -~ *% PO PmCF E- A...constructed. In this case, some ideas from robotics on minimum-time trajectory planning under path constraints (see, e.g., Rajan (1985), Sahar and...Auto Cont., Vol. AC-29, No. 4, p. 361. Rajan, V.T. (1985), "Minimum-Time Trajectory Planning ", Proc IEEE Kobotics and Automation Conf., St. Louis. Reed

The Future of US Nuclear Deterrence and the Impact of the Global Zero Movement

DTIC Science & Technology

2013-02-10

The most appealing GZC recommendation is for a de facto minimum deterrence model en route to GZ. To its detriment, however, the GZC proposal relies...difficult to dispute that this path leads, at least eventually, to a minimum deterrence model . It is likely that the US can continue to wield a...instead, a capable, credible deterrent is critical to countering these threats and is especially so in a minimum deterrence model . Two key

Minimum-Cost Aircraft Descent Trajectories with a Constrained Altitude Profile

NASA Technical Reports Server (NTRS)

Wu, Minghong G.; Sadovsky, Alexander V.

2015-01-01

An analytical formula for solving the speed profile that accrues minimum cost during an aircraft descent with a constrained altitude profile is derived. The optimal speed profile first reaches a certain speed, called the minimum-cost speed, as quickly as possible using an appropriate extreme value of thrust. The speed profile then stays on the minimum-cost speed as long as possible, before switching to an extreme value of thrust for the rest of the descent. The formula is applied to an actual arrival route and its sensitivity to winds and airlines' business objectives is analyzed.

An algorithm for minimum-cost set-point ordering in a cryogenic wind tunnel

NASA Technical Reports Server (NTRS)

Tripp, J. S.

1981-01-01

An algorithm for minimum cost ordering of set points in a cryogenic wind tunnel is developed. The procedure generates a matrix of dynamic state transition costs, which is evaluated by means of a single-volume lumped model of the cryogenic wind tunnel and the use of some idealized minimum-costs, which is evaluated by means of a single-volume lumped model of the cryogenic wind tunnel and the use of some idealized minimum-cost state-transition control strategies. A branch and bound algorithm is employed to determine the least costly sequence of state transitions from the transition-cost matrix. Some numerical results based on data for the National Transonic Facility are presented which show a strong preference for state transitions that consume to coolant. Results also show that the choice of the terminal set point in an open odering can produce a wide variation in total cost.

[Cost accounting for gastrectomy under critical path--the usefulness of direct accounting of personnel expenses and a guide to shortening hospital stay].

PubMed

Nozue, M; Maruyama, T; Imamura, F; Fukue, M

2000-08-01

In this study, cost accounting was made for a surgical case of gastrectomy according to critical path (path) and the economic contribution of the path was determined. In addition, changes in the cost percentage with changes in number of hospital days were simulated. Basically, cost accounting was done by means of cost accounting by departments, which meets the concept of direct cost accounting of administered accounts. Personnel expenses were calculated by means of both direct and indirect calculations. In the direct method, the total hours personnel participated were recorded for calculation. In the indirect method, personnel expenses were calculated from the ratio of the income of the surgical department to that of other departments. Purchase prices for all materials and drugs used were recorded to check buying costs. According to the direct calculating method, the personnel expenses came to approximately 300,000 yen, total cost was approximately 700,000 yen, and the cost percentage was 59%. According to the indirect method, the personnel expenses were approximately 540,000 yen and the total cost was approximately 940,000 yen, the cost percentage being 80%. A simulation study of changes in the cost with changes in hospital days revealed that the cost percentages were assessed to be approximately 53% in 19 hospital days and approximately 45% in 12 hospital days.

Electrical utilities model for determining electrical distribution capacity

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

Fritz, R. L.

1997-09-03

In its simplest form, this model was to obtain meaningful data on the current state of the Site`s electrical transmission and distribution assets, and turn this vast collection of data into useful information. The resulting product is an Electrical Utilities Model for Determining Electrical Distribution Capacity which provides: current state of the electrical transmission and distribution systems; critical Hanford Site needs based on outyear planning documents; decision factor model. This model will enable Electrical Utilities management to improve forecasting requirements for service levels, budget, schedule, scope, and staffing, and recommend the best path forward to satisfy customer demands at themore » minimum risk and least cost to the government. A dynamic document, the model will be updated annually to reflect changes in Hanford Site activities.« less

Nearly metastable rhombohedral phases of bcc metals

NASA Astrophysics Data System (ADS)

Mehl, Michael J.; Finkenstadt, Daniel

2008-02-01

The energy E(c/a) for a bcc element stretched along its [001] axis (the Bain path) has a minimum at c/a=1 , a maximum at c/a=2 , and an elastically unstable local minimum at c/a>2 . An alternative path connecting the bcc and fcc structures is the rhombohedral lattice. The primitive lattice has R3¯m symmetry, with the angle α changing from 109.4° (bcc), to 90° (simple cubic), to 60 ° (fcc). We study this path for the non-magnetic bcc transition metals (V, Nb, Mo, Ta, and W) using both all-electron linearized augmented plane wave and projector augmented wave VASP codes. Except for Ta, the energy E(α) has a local maximum at α=60° , with local minima near 55° and 70° , the latter having lower energy, suggesting the possibility of a metastable rhombohedral state for these materials. We first examine the elastic stability of the 70° minimum structure, and determine that only W is elastically stable in this structure, with the smallest eigenvalue of the elastic tensor at 4GPa . We then consider the possibility that tungsten is actually metastable in this structure by looking at its vibrational and third-order elastic stability.

Harmonic Fourier beads method for studying rare events on rugged energy surfaces.

PubMed

Khavrutskii, Ilja V; Arora, Karunesh; Brooks, Charles L

2006-11-07

We present a robust, distributable method for computing minimum free energy paths of large molecular systems with rugged energy landscapes. The method, which we call harmonic Fourier beads (HFB), exploits the Fourier representation of a path in an appropriate coordinate space and proceeds iteratively by evolving a discrete set of harmonically restrained path points-beads-to generate positions for the next path. The HFB method does not require explicit knowledge of the free energy to locate the path. To compute the free energy profile along the final path we employ an umbrella sampling method in two generalized dimensions. The proposed HFB method is anticipated to aid the study of rare events in biomolecular systems. Its utility is demonstrated with an application to conformational isomerization of the alanine dipeptide in gas phase.

Excitation of nucleobases from a computational perspective I: reaction paths.

PubMed

Giussani, Angelo; Segarra-Martí, Javier; Roca-Sanjuán, Daniel; Merchán, Manuela

2015-01-01

The main intrinsic photochemical events in nucleobases can be described on theoretical grounds within the realm of non-adiabatic computational photochemistry. From a static standpoint, the photochemical reaction path approach (PRPA), through the computation of the respective minimum energy path (MEP), can be regarded as the most suitable strategy in order to explore the electronically excited isolated nucleobases. Unfortunately, the PRPA does not appear widely in the studies reported in the last decade. The main ultrafast decay observed experimentally for the gas-phase excited nucleobases is related to the computed barrierless MEPs from the bright excited state connecting the initial Franck-Condon region and a conical intersection involving the ground state. At the highest level of theory currently available (CASPT2//CASPT2), the lowest excited (1)(ππ*) hypersurface for cytosine has a shallow minimum along the MEP deactivation pathway. In any case, the internal conversion processes in all the natural nucleobases are attained by means of interstate crossings, a self-protection mechanism that prevents the occurrence of photoinduced damage of nucleobases by ultraviolet radiation. Many alternative and secondary paths have been proposed in the literature, which ultimately provide a rich and constructive interplay between experimentally and theoretically oriented research.

MEPSA: minimum energy pathway analysis for energy landscapes.

PubMed

Marcos-Alcalde, Iñigo; Setoain, Javier; Mendieta-Moreno, Jesús I; Mendieta, Jesús; Gómez-Puertas, Paulino

2015-12-01

From conformational studies to atomistic descriptions of enzymatic reactions, potential and free energy landscapes can be used to describe biomolecular systems in detail. However, extracting the relevant data of complex 3D energy surfaces can sometimes be laborious. In this article, we present MEPSA (Minimum Energy Path Surface Analysis), a cross-platform user friendly tool for the analysis of energy landscapes from a transition state theory perspective. Some of its most relevant features are: identification of all the barriers and minima of the landscape at once, description of maxima edge profiles, detection of the lowest energy path connecting two minima and generation of transition state theory diagrams along these paths. In addition to a built-in plotting system, MEPSA can save most of the generated data into easily parseable text files, allowing more versatile uses of MEPSA's output such as the generation of molecular dynamics restraints from a calculated path. MEPSA is freely available (under GPLv3 license) at: http://bioweb.cbm.uam.es/software/MEPSA/ CONTACT: pagomez@cbm.csic.es. Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Molecular dynamics and quasidynamics simulations of the annealing of bulk and near-surface interstitials formed in molecular-beam epitaxial Si due to low-energy particle bombardment during deposition

NASA Technical Reports Server (NTRS)

Kitabatake, M.; Fons, P.; Greene, J. E.

1991-01-01

The relaxation, diffusion, and annihilation of split and hexagonal interstitials resulting from 10 eV Si irradiation of (2x1)-terminated Si(100) are investigated. Molecular dynamics and quasidynamics simulations, utilizing the Tersoff many-body potential are used in the investigation. The interstitials are created in layers two through six, and stable atomic configurations and total potential energies are derived as a function of site symmetry and layer depth. The interstitial Si atoms are allowed to diffuse, and the total potential energy changes are calculated. Lattice configurations along each path, as well as the starting configurations, are relaxed, and minimum energy diffusion paths are derived. The results show that the minimum energy paths are toward the surface and generally involved tetrahedral sites. The calculated interstitial migration activation energies are always less than 1.4 eV and are much lower in the near-surface region than in the bulk.

Characterization of the Minimum Energy Paths and Energetics for the Reaction of Vinylidene with Acetylene

NASA Technical Reports Server (NTRS)

Walch, Stephen P.; Taylor, Peter R.

1995-01-01

The reaction of vinylidene (CH2C) with acetylene may be an initiating reaction in soot formation. We report minimum energy paths and accurate energetics for a pathway leading to vinyl-acetylene and for a number of isomers of C4H4. The calculations use complete active space self-consistent field (CASSCF) derivative methods to characterize the stationary points and internally contacted configuration interaction (ICCI) and/or coupled cluster singles and doubles with a perturbational estimate of triple excitations (CCSD(T)) to determine the energetics. We find an entrance channel barrier of about 5 kcal/mol for the addition of vinylidene to acetylene, but no barriers above reactants for the reaction pathway leading to vinyl-acetylene.

Characterization of the Minimum Energy Paths and Energetics for the reaction of Vinylidene with Acetylene

NASA Technical Reports Server (NTRS)

Walch, Stephen P.; Taylor, Peter R.

1995-01-01

The reaction of vinylidene (CH2C) with acetylene may be an initiating reaction in soot formation. We report minimum energy paths and accurate energetics for a pathway leading to vinylacetylene and for a number of isomers Of C4H4. The calculations use complete active space self-consistent field (CASSCF) derivative methods to characterize the stationary points and internally contacted configuration interaction (ICCI) and/or coupled cluster singles and doubles with a perturbational estimate of triple excitations (CCSD(T)) to determine the energetics. We find an entrance channel barrier of about 5 kcal/mol for the addition of vinylidene to acetylene, but no barriers above reactants for the reaction pathway leading to vinylacetylene.

Minimum Action Path Theory Reveals the Details of Stochastic Transitions Out of Oscillatory States

NASA Astrophysics Data System (ADS)

de la Cruz, Roberto; Perez-Carrasco, Ruben; Guerrero, Pilar; Alarcon, Tomas; Page, Karen M.

2018-03-01

Cell state determination is the outcome of intrinsically stochastic biochemical reactions. Transitions between such states are studied as noise-driven escape problems in the chemical species space. Escape can occur via multiple possible multidimensional paths, with probabilities depending nonlocally on the noise. Here we characterize the escape from an oscillatory biochemical state by minimizing the Freidlin-Wentzell action, deriving from it the stochastic spiral exit path from the limit cycle. We also use the minimized action to infer the escape time probability density function.

Minimum Action Path Theory Reveals the Details of Stochastic Transitions Out of Oscillatory States.

PubMed

de la Cruz, Roberto; Perez-Carrasco, Ruben; Guerrero, Pilar; Alarcon, Tomas; Page, Karen M

2018-03-23

Cell state determination is the outcome of intrinsically stochastic biochemical reactions. Transitions between such states are studied as noise-driven escape problems in the chemical species space. Escape can occur via multiple possible multidimensional paths, with probabilities depending nonlocally on the noise. Here we characterize the escape from an oscillatory biochemical state by minimizing the Freidlin-Wentzell action, deriving from it the stochastic spiral exit path from the limit cycle. We also use the minimized action to infer the escape time probability density function.

Adaptive feedforward control of non-minimum phase structural systems

NASA Astrophysics Data System (ADS)

Vipperman, J. S.; Burdisso, R. A.

1995-06-01

Adaptive feedforward control algorithms have been effectively applied to stationary disturbance rejection. For structural systems, the ideal feedforward compensator is a recursive filter which is a function of the transfer functions between the disturbance and control inputs and the error sensor output. Unfortunately, most control configurations result in a non-minimum phase control path; even a collocated control actuator and error sensor will not necessarily produce a minimum phase control path in the discrete domain. Therefore, the common practice is to choose a suitable approximation of the ideal compensator. In particular, all-zero finite impulse response (FIR) filters are desirable because of their inherent stability for adaptive control approaches. However, for highly resonant systems, large order filters are required for broadband applications. In this work, a control configuration is investigated for controlling non-minimum phase lightly damped structural systems. The control approach uses low order FIR filters as feedforward compensators in a configuration that has one more control actuator than error sensors. The performance of the controller was experimentally evaluated on a simply supported plate under white noise excitation for a two-input, one-output (2I1O) system. The results show excellent error signal reduction, attesting to the effectiveness of the method.

Satellite broadcasting system study

NASA Technical Reports Server (NTRS)

1972-01-01

The study to develop a system model and computer program representative of broadcasting satellite systems employing community-type receiving terminals is reported. The program provides a user-oriented tool for evaluating performance/cost tradeoffs, synthesizing minimum cost systems for a given set of system requirements, and performing sensitivity analyses to identify critical parameters and technology. The performance/ costing philosophy and what is meant by a minimum cost system is shown graphically. Topics discussed include: main line control program, ground segment model, space segment model, cost models and launch vehicle selection. Several examples of minimum cost systems resulting from the computer program are presented. A listing of the computer program is also included.

Phase unwrapping methods of corner reflector DInSAR monitoring slow ground deformation

NASA Astrophysics Data System (ADS)

Fu, Wenxue; Guo, Xiaofang; Tian, Qingjiu

2007-06-01

Difference interferometric Synthetic aperture radar (DInSAR) has turned out to be a very powerful technique for the measurement of land deformations, but it requires the observed area to be correlated, and coherence degradation will seriously affect the quality of interferogram. Corner reflector DInSAR (CRDInSAR) is a new technique in recently years, which can compensate for the limitation of the classical DInSAR. Due to the stable amplitude and phase performance of the reflector, the interferometric phase difference of the reflector can be used to monitor or measure the small and slowly ground deformation for the cases of large geometrical baseline and large time interval between acquisitions. Phase unwrapping is the process where the absolute phase is reconstructed from its principal value as accurately as possible. It is a key step in the analysis of DInSAR. The classical phase unwrapping methods are either of path following type or of minimum-norm type. However, if the coherence of the two images is very low, the both methods will get error result. In application of CRDInSAR, due to the scattered points, the phase unwrapping of corner reflectors is only dealt with on a sparse grid, so all the reflectors are connected with Delaunay triangulation firstly, which can be used to define neighboring points and elementary cycles. When the monitoring ground deformation is slow, that is unwrapped neighboring-CR phase gradients are supposed to equal their wrapped-phase counterparts, then path-following method and Phase unwrapping using Coefficient of Elevation-Phase-Relation can be used to phase unwrapping. However, in the cases of unwrapped gradients exceeding one-half cycle, minimum cost flow (MCF) method can be used to unwrap the interferogram.

String method for calculation of minimum free-energy paths in Cartesian space in freely-tumbling systems.

PubMed

Branduardi, Davide; Faraldo-Gómez, José D

2013-09-10

The string method is a molecular-simulation technique that aims to calculate the minimum free-energy path of a chemical reaction or conformational transition, in the space of a pre-defined set of reaction coordinates that is typically highly dimensional. Any descriptor may be used as a reaction coordinate, but arguably the Cartesian coordinates of the atoms involved are the most unprejudiced and intuitive choice. Cartesian coordinates, however, present a non-trivial problem, in that they are not invariant to rigid-body molecular rotations and translations, which ideally ought to be unrestricted in the simulations. To overcome this difficulty, we reformulate the framework of the string method to integrate an on-the-fly structural-alignment algorithm. This approach, referred to as SOMA (String method with Optimal Molecular Alignment), enables the use of Cartesian reaction coordinates in freely tumbling molecular systems. In addition, this scheme permits the dissection of the free-energy change along the most probable path into individual atomic contributions, thus revealing the dominant mechanism of the simulated process. This detailed analysis also provides a physically-meaningful criterion to coarse-grain the representation of the path. To demonstrate the accuracy of the method we analyze the isomerization of the alanine dipeptide in vacuum and the chair-to-inverted-chair transition of β -D mannose in explicit water. Notwithstanding the simplicity of these systems, the SOMA approach reveals novel insights into the atomic mechanism of these isomerizations. In both cases, we find that the dynamics and the energetics of these processes are controlled by interactions involving only a handful of atoms in each molecule. Consistent with this result, we show that a coarse-grained SOMA calculation defined in terms of these subsets of atoms yields nearidentical minimum free-energy paths and committor distributions to those obtained via a highly-dimensional string.

String method for calculation of minimum free-energy paths in Cartesian space in freely-tumbling systems

PubMed Central

Branduardi, Davide; Faraldo-Gómez, José D.

2014-01-01

The string method is a molecular-simulation technique that aims to calculate the minimum free-energy path of a chemical reaction or conformational transition, in the space of a pre-defined set of reaction coordinates that is typically highly dimensional. Any descriptor may be used as a reaction coordinate, but arguably the Cartesian coordinates of the atoms involved are the most unprejudiced and intuitive choice. Cartesian coordinates, however, present a non-trivial problem, in that they are not invariant to rigid-body molecular rotations and translations, which ideally ought to be unrestricted in the simulations. To overcome this difficulty, we reformulate the framework of the string method to integrate an on-the-fly structural-alignment algorithm. This approach, referred to as SOMA (String method with Optimal Molecular Alignment), enables the use of Cartesian reaction coordinates in freely tumbling molecular systems. In addition, this scheme permits the dissection of the free-energy change along the most probable path into individual atomic contributions, thus revealing the dominant mechanism of the simulated process. This detailed analysis also provides a physically-meaningful criterion to coarse-grain the representation of the path. To demonstrate the accuracy of the method we analyze the isomerization of the alanine dipeptide in vacuum and the chair-to-inverted-chair transition of β-D mannose in explicit water. Notwithstanding the simplicity of these systems, the SOMA approach reveals novel insights into the atomic mechanism of these isomerizations. In both cases, we find that the dynamics and the energetics of these processes are controlled by interactions involving only a handful of atoms in each molecule. Consistent with this result, we show that a coarse-grained SOMA calculation defined in terms of these subsets of atoms yields nearidentical minimum free-energy paths and committor distributions to those obtained via a highly-dimensional string. PMID:24729762

Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

NASA Astrophysics Data System (ADS)

Latip, Nor Badariyah Abdul; Omar, Rosli

2017-08-01

When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.

Evaluation of a Cubature Kalman Filtering-Based Phase Unwrapping Method for Differential Interferograms with High Noise in Coal Mining Areas

PubMed Central

Liu, Wanli; Bian, Zhengfu; Liu, Zhenguo; Zhang, Qiuzhao

2015-01-01

Differential interferometric synthetic aperture radar has been shown to be effective for monitoring subsidence in coal mining areas. Phase unwrapping can have a dramatic influence on the monitoring result. In this paper, a filtering-based phase unwrapping algorithm in combination with path-following is introduced to unwrap differential interferograms with high noise in mining areas. It can perform simultaneous noise filtering and phase unwrapping so that the pre-filtering steps can be omitted, thus usually retaining more details and improving the detectable deformation. For the method, the nonlinear measurement model of phase unwrapping is processed using a simplified Cubature Kalman filtering, which is an effective and efficient tool used in many nonlinear fields. Three case studies are designed to evaluate the performance of the method. In Case 1, two tests are designed to evaluate the performance of the method under different factors including the number of multi-looks and path-guiding indexes. The result demonstrates that the unwrapped results are sensitive to the number of multi-looks and that the Fisher Distance is the most suitable path-guiding index for our study. Two case studies are then designed to evaluate the feasibility of the proposed phase unwrapping method based on Cubature Kalman filtering. The results indicate that, compared with the popular Minimum Cost Flow method, the Cubature Kalman filtering-based phase unwrapping can achieve promising results without pre-filtering and is an appropriate method for coal mining areas with high noise. PMID:26153776

Energetically optimal travel across terrain: visualizations and a new metric of geographic distance with anthropological applications

NASA Astrophysics Data System (ADS)

Wood, Brian M.; Wood, Zoë J.

2006-01-01

We present a visualization and computation tool for modeling the caloric cost of pedestrian travel across three dimensional terrains. This tool is being used in ongoing archaeological research that analyzes how costs of locomotion affect the spatial distribution of trails and artifacts across archaeological landscapes. Throughout human history, traveling by foot has been the most common form of transportation, and therefore analyses of pedestrian travel costs are important for understanding prehistoric patterns of resource acquisition, migration, trade, and political interaction. Traditionally, archaeologists have measured geographic proximity based on "as the crow flies" distance. We propose new methods for terrain visualization and analysis based on measuring paths of least caloric expense, calculated using well established metabolic equations. Our approach provides a human centered metric of geographic closeness, and overcomes significant limitations of available Geographic Information System (GIS) software. We demonstrate such path computations and visualizations applied to archaeological research questions. Our system includes tools to visualize: energetic cost surfaces, comparisons of the elevation profiles of shortest paths versus least cost paths, and the display of paths of least caloric effort on Digital Elevation Models (DEMs). These analysis tools can be applied to calculate and visualize 1) likely locations of prehistoric trails and 2) expected ratios of raw material types to be recovered at archaeological sites.

41 CFR 102-76.70 - When are the costs of alterations to provide an accessible path of travel to an altered area...

Code of Federal Regulations, 2013 CFR

2013-07-01

... alterations to provide an accessible path of travel to an altered area containing a primary function... to an altered area containing a primary function disproportionate to the costs of the overall... area containing a primary function are disproportionate to the costs of the overall alterations when...

41 CFR 102-76.70 - When are the costs of alterations to provide an accessible path of travel to an altered area...

Code of Federal Regulations, 2010 CFR

2010-07-01

... alterations to provide an accessible path of travel to an altered area containing a primary function... to an altered area containing a primary function disproportionate to the costs of the overall... area containing a primary function are disproportionate to the costs of the overall alterations when...

41 CFR 102-76.70 - When are the costs of alterations to provide an accessible path of travel to an altered area...

Code of Federal Regulations, 2014 CFR

2014-01-01

... alterations to provide an accessible path of travel to an altered area containing a primary function... to an altered area containing a primary function disproportionate to the costs of the overall... area containing a primary function are disproportionate to the costs of the overall alterations when...

41 CFR 102-76.70 - When are the costs of alterations to provide an accessible path of travel to an altered area...

Code of Federal Regulations, 2012 CFR

2012-01-01

... alterations to provide an accessible path of travel to an altered area containing a primary function... to an altered area containing a primary function disproportionate to the costs of the overall... area containing a primary function are disproportionate to the costs of the overall alterations when...

41 CFR 102-76.70 - When are the costs of alterations to provide an accessible path of travel to an altered area...

Code of Federal Regulations, 2011 CFR

2011-01-01

... alterations to provide an accessible path of travel to an altered area containing a primary function... to an altered area containing a primary function disproportionate to the costs of the overall... area containing a primary function are disproportionate to the costs of the overall alterations when...

Sensitivity analysis of an optimization-based trajectory planner for autonomous vehicles in urban environments

NASA Astrophysics Data System (ADS)

Hardy, Jason; Campbell, Mark; Miller, Isaac; Schimpf, Brian

2008-10-01

The local path planner implemented on Cornell's 2007 DARPA Urban Challenge entry vehicle Skynet utilizes a novel mixture of discrete and continuous path planning steps to facilitate a safe, smooth, and human-like driving behavior. The planner first solves for a feasible path through the local obstacle map using a grid based search algorithm. The resulting path is then refined using a cost-based nonlinear optimization routine with both hard and soft constraints. The behavior of this optimization is influenced by tunable weighting parameters which govern the relative cost contributions assigned to different path characteristics. This paper studies the sensitivity of the vehicle's performance to these path planner weighting parameters using a data driven simulation based on logged data from the National Qualifying Event. The performance of the path planner in both the National Qualifying Event and in the Urban Challenge is also presented and analyzed.

Assessing the Performance of Human-Automation Collaborative Planning Systems

DTIC Science & Technology

2011-06-01

process- ing and incorporating vast amounts of incoming information into their solutions. How- ever, these algorithms are brittle and unable to account for...planning system, a descriptive Mission Performance measure may address the total travel time on the path or the cost of the path (e.g. total work...minimizing costs or collisions [4, 32, 33]. Error measures for such a path planning system may track how many collisions occur or how much threat

A surface hopping algorithm for nonadiabatic minimum energy path calculations.

PubMed

Schapiro, Igor; Roca-Sanjuán, Daniel; Lindh, Roland; Olivucci, Massimo

2015-02-15

The article introduces a robust algorithm for the computation of minimum energy paths transiting along regions of near-to or degeneracy of adiabatic states. The method facilitates studies of excited state reactivity involving weakly avoided crossings and conical intersections. Based on the analysis of the change in the multiconfigurational wave function the algorithm takes the decision whether the optimization should continue following the same electronic state or switch to a different state. This algorithm helps to overcome convergence difficulties near degeneracies. The implementation in the MOLCAS quantum chemistry package is discussed. To demonstrate the utility of the proposed procedure four examples of application are provided: thymine, asulam, 1,2-dioxetane, and a three-double-bond model of the 11-cis-retinal protonated Schiff base. © 2015 Wiley Periodicals, Inc.

Can households earning minimum wage in Nova Scotia afford a nutritious diet?

PubMed

Williams, Patricia L; Johnson, Christine P; Kratzmann, Meredith L V; Johnson, C Shanthi Jacob; Anderson, Barbara J; Chenhall, Cathy

2006-01-01

To assess the affordability of a nutritious diet for households earning minimum wage in Nova Scotia. Food costing data were collected in 43 randomly selected grocery stores throughout NS in 2002 using the National Nutritious Food Basket (NNFB). To estimate the affordability of a nutritious diet for households earning minimum wage, average monthly costs for essential expenses were subtracted from overall income to see if enough money remained for the cost of the NNFB. This was calculated for three types of household: 1) two parents and two children; 2) lone parent and two children; and 3) single male. Calculations were also made for the proposed 2006 minimum wage increase with expenses adjusted using the Consumer Price Index (CPI). The monthly cost of the NNFB priced in 2002 for the three types of household was 572.90 dollars, 351.68 dollars, and 198.73 dollars, respectively. Put into the context of basic living, these data showed that Nova Scotians relying on minimum wage could not afford to purchase a nutritious diet and meet their basic needs, placing their health at risk. These basic expenses do not include other routine costs, such as personal hygiene products, household and laundry cleaners, and prescriptions and costs associated with physical activity, education or savings for unexpected expenses. People working at minimum wage in Nova Scotia have not had adequate income to meet basic needs, including a nutritious diet. The 2006 increase in minimum wage to 7.15 dollars/hr is inadequate to ensure that Nova Scotians working at minimum wage are able to meet these basic needs. Wage increases and supplements, along with supports for expenses such as childcare and transportation, are indicated to address this public health problem.

Cooperative organic mine avoidance path planning

NASA Astrophysics Data System (ADS)

McCubbin, Christopher B.; Piatko, Christine D.; Peterson, Adam V.; Donnald, Creighton R.; Cohen, David

2005-06-01

The JHU/APL Path Planning team has developed path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Extending on previous years' efforts, we investigated real-world Naval mine avoidance requirements and developed a tactical decision aid (TDA) that satisfies those requirements. APL has developed new mine path planning techniques using graph based and genetic algorithms which quickly produce near-minimum risk paths for complicated fitness functions incorporating risk, path length, ship kinematics, and naval doctrine. The TDA user interface, a Java Swing application that obtains data via Corba interfaces to path planning databases, allows the operator to explore a fusion of historic and in situ mine field data, control the path planner, and display the planning results. To provide a context for the minefield data, the user interface also renders data from the Digital Nautical Chart database, a database created by the National Geospatial-Intelligence Agency containing charts of the world's ports and coastal regions. This TDA has been developed in conjunction with the COMID (Cooperative Organic Mine Defense) system. This paper presents a description of the algorithms, architecture, and application produced.

75 FR 35864 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Notice of Filing and...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-06-23

... Effectiveness of Proposed Rule Change To Establish the Appointment Cost for Options on the iPath S&P 500 VIX... Proposed Rule Change CBOE proposes to amend Rule 8.3 to establish the appointment cost for options on the i... the appointment cost for options on the iPath S&P 500 VIX Short-Term Futures Index ETN (``VXX...

A two-stage path planning approach for multiple car-like robots based on PH curves and a modified harmony search algorithm

NASA Astrophysics Data System (ADS)

Zeng, Wenhui; Yi, Jin; Rao, Xiao; Zheng, Yun

2017-11-01

In this article, collision-avoidance path planning for multiple car-like robots with variable motion is formulated as a two-stage objective optimization problem minimizing both the total length of all paths and the task's completion time. Accordingly, a new approach based on Pythagorean Hodograph (PH) curves and Modified Harmony Search algorithm is proposed to solve the two-stage path-planning problem subject to kinematic constraints such as velocity, acceleration, and minimum turning radius. First, a method of path planning based on PH curves for a single robot is proposed. Second, a mathematical model of the two-stage path-planning problem for multiple car-like robots with variable motion subject to kinematic constraints is constructed that the first-stage minimizes the total length of all paths and the second-stage minimizes the task's completion time. Finally, a modified harmony search algorithm is applied to solve the two-stage optimization problem. A set of experiments demonstrate the effectiveness of the proposed approach.

ILP-based co-optimization of cut mask layout, dummy fill, and timing for sub-14nm BEOL technology

NASA Astrophysics Data System (ADS)

Han, Kwangsoo; Kahng, Andrew B.; Lee, Hyein; Wang, Lutong

2015-10-01

Self-aligned multiple patterning (SAMP), due to its low overlay error, has emerged as the leading option for 1D gridded back-end-of-line (BEOL) in sub-14nm nodes. To form actual routing patterns from a uniform "sea of wires", a cut mask is needed for line-end cutting or realization of space between routing segments. Constraints on cut shapes and minimum cut spacing result in end-of-line (EOL) extensions and non-functional (i.e. dummy fill) patterns; the resulting capacitance and timing changes must be consistent with signoff performance analyses and their impacts should be minimized. In this work, we address the co-optimization of cut mask layout, dummy fill, and design timing for sub-14nm BEOL design. Our central contribution is an optimizer based on integer linear programming (ILP) to minimize the timing impact due to EOL extensions, considering (i) minimum cut spacing arising in sub-14nm nodes; (ii) cut assignment to different cut masks (color assignment); and (iii) the eligibility to merge two unit-size cuts into a bigger cut. We also propose a heuristic approach to remove dummy fills after the ILP-based optimization by extending the usage of cut masks. Our heuristic can improve critical path performance under minimum metal density and mask density constraints. In our experiments, we study the impact of number of cut masks, minimum cut spacing and metal density under various constraints. Our studies of optimized cut mask solutions in these varying contexts give new insight into the tradeoff of performance and cost that is afforded by cut mask patterning technology options.

Congestion patterns of electric vehicles with limited battery capacity.

PubMed

Jing, Wentao; Ramezani, Mohsen; An, Kun; Kim, Inhi

2018-01-01

The path choice behavior of battery electric vehicle (BEV) drivers is influenced by the lack of public charging stations, limited battery capacity, range anxiety and long battery charging time. This paper investigates the congestion/flow pattern captured by stochastic user equilibrium (SUE) traffic assignment problem in transportation networks with BEVs, where the BEV paths are restricted by their battery capacities. The BEV energy consumption is assumed to be a linear function of path length and path travel time, which addresses both path distance limit problem and road congestion effect. A mathematical programming model is proposed for the path-based SUE traffic assignment where the path cost is the sum of the corresponding link costs and a path specific out-of-energy penalty. We then apply the convergent Lagrangian dual method to transform the original problem into a concave maximization problem and develop a customized gradient projection algorithm to solve it. A column generation procedure is incorporated to generate the path set. Finally, two numerical examples are presented to demonstrate the applicability of the proposed model and the solution algorithm.

Congestion patterns of electric vehicles with limited battery capacity

PubMed Central

2018-01-01

The path choice behavior of battery electric vehicle (BEV) drivers is influenced by the lack of public charging stations, limited battery capacity, range anxiety and long battery charging time. This paper investigates the congestion/flow pattern captured by stochastic user equilibrium (SUE) traffic assignment problem in transportation networks with BEVs, where the BEV paths are restricted by their battery capacities. The BEV energy consumption is assumed to be a linear function of path length and path travel time, which addresses both path distance limit problem and road congestion effect. A mathematical programming model is proposed for the path-based SUE traffic assignment where the path cost is the sum of the corresponding link costs and a path specific out-of-energy penalty. We then apply the convergent Lagrangian dual method to transform the original problem into a concave maximization problem and develop a customized gradient projection algorithm to solve it. A column generation procedure is incorporated to generate the path set. Finally, two numerical examples are presented to demonstrate the applicability of the proposed model and the solution algorithm. PMID:29543875

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.

PubMed

Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

2013-10-01

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

Software Development Cost Estimation Executive Summary

NASA Technical Reports Server (NTRS)

Hihn, Jairus M.; Menzies, Tim

2006-01-01

Identify simple fully validated cost models that provide estimation uncertainty with cost estimate. Based on COCOMO variable set. Use machine learning techniques to determine: a) Minimum number of cost drivers required for NASA domain based cost models; b) Minimum number of data records required and c) Estimation Uncertainty. Build a repository of software cost estimation information. Coordinating tool development and data collection with: a) Tasks funded by PA&E Cost Analysis; b) IV&V Effort Estimation Task and c) NASA SEPG activities.

[Identification of ecological corridors and its importance by integrating circuit theory].

PubMed

Song, Li Li; Qin, Ming Zhou

2016-10-01

Landscape connectivity is considered as an extraordinarily important factor affecting various ecological processes. The least cost path (LCP) on the basis of minimum cumulative resis-tance model (MCRM) may provide a more efficient approach to identify functional connectivity in heterogeneous landscapes, and is already adopted by the research of landscape functional connecti-vity assessment and ecological corridor simulation. Connectivity model on circuit theory (CMCT) replaced the edges in the graph theory with resistors, cost distance with resistance distance to measure the functional connectivity in heterogeneous landscapes. By means of Linkage Mapper tool and Circuitscape software, the simulated landscape generated from SIMMAP 2.0 software was viewed as the study object in this article, aimed at exploring how to integrate MCRM with CMCT to identify ecological corridors and relative importance of landscape factors. The results showed that two models had their individual advantages and mutual complement. MCRM could effectively identify least cost corridors among habitats. CMCT could effectively identify important landscape factor and pinch point, which had important influence on landscape connectivity. We also found that the position of pinch point was not affected by corridor width, which had obvious advantage in the research of identifying the importance of corridors. The integrated method could provide certain scientific basis for regional ecological protection planning and ecological corridor design.

The Badger Company conceptual design of a 50 MGD desalination plant. Special report No. 10

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

Not Available

1965-08-01

The objective of this study is to produce a design which advances the technology of seawater conversion and to present the results in a form which can be used by any qualified individual or firm as the basis for an architectural-engineering design. Ground rules furnished by OSW specified that only the desalination section of a dual-purpose power-water plant be considered and that it be designed for a 30-year life. Process and structural design ideas are to be presented in terms of the complete plant concept. The complex is to be located on a typical California coastal site with capital andmore » operating costs based on December, 1964, values. The Badger study considers the Multi-Stage Flash (MSF) process, achieving a minimum overall pressure drop by an uninterrupted flow path of brine and product water through the evaporator flashing area. A performance ratio of 20 pounds of product water per pound of steam yields a calculated water cost of $0.323 per thousand gallons. The specified 30-year write-off at low interest rates allows comparatively high capital expenditures favoring titanium tubing for brine service which contributes to low maintenance and operating costs. (GRA)« less

Efficient micromagnetics for magnetic storage devices

NASA Astrophysics Data System (ADS)

Escobar Acevedo, Marco Antonio

Micromagnetics is an important component for advancing the magnetic nanostructures understanding and design. Numerous existing and prospective magnetic devices rely on micromagnetic analysis, these include hard disk drives, magnetic sensors, memories, microwave generators, and magnetic logic. The ability to examine, describe, and predict the magnetic behavior, and macroscopic properties of nanoscale magnetic systems is essential for improving the existing devices, for progressing in their understanding, and for enabling new technologies. This dissertation describes efficient micromagnetic methods as required for magnetic storage analysis. Their performance and accuracy is demonstrated by studying realistic, complex, and relevant micromagnetic system case studies. An efficient methodology for dynamic micromagnetics in large scale simulations is used to study the writing process in a full scale model of a magnetic write head. An efficient scheme, tailored for micromagnetics, to find the minimum energy state on a magnetic system is presented. This scheme can be used to calculate hysteresis loops. An efficient scheme, tailored for micromagnetics, to find the minimum energy path between two stable states on a magnetic system is presented. This minimum energy path is intimately related to the thermal stability.

Secondary electric power generation with minimum engine bleed

NASA Technical Reports Server (NTRS)

Tagge, G. E.

1983-01-01

Secondary electric power generation with minimum engine bleed is discussed. Present and future jet engine systems are compared. The role of auxiliary power units is evaluated. Details of secondary electric power generation systems with and without auxiliary power units are given. Advanced bleed systems are compared with minimum bleed systems. A cost model of ownership is given. The difference in the cost of ownership between a minimum bleed system and an advanced bleed system is given.

Train repathing in emergencies based on fuzzy linear programming.

PubMed

Meng, Xuelei; Cui, Bingmou

2014-01-01

Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This paper focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost, running cost, and social adverse effect cost. With the overall consideration of the segment and station capability constraints, we build the fuzzy linear programming model to solve the train pathing problem. We design the fuzzy membership function to describe the fuzzy coefficients. Furthermore, the contraction-expansion factors are introduced to contract or expand the value ranges of the fuzzy coefficients, coping with the uncertainty of the value range of the fuzzy coefficients. We propose a method based on triangular fuzzy coefficient and transfer the train pathing (fuzzy linear programming model) to a determinate linear model to solve the fuzzy linear programming problem. An emergency is supposed based on the real data of the Beijing-Shanghai Railway. The model in this paper was solved and the computation results prove the availability of the model and efficiency of the algorithm.

Automatic aneurysm neck detection using surface Voronoi diagrams.

PubMed

Cárdenes, Rubén; Pozo, José María; Bogunovic, Hrvoje; Larrabide, Ignacio; Frangi, Alejandro F

2011-10-01

A new automatic approach for saccular intracranial aneurysm isolation is proposed in this work. Due to the inter- and intra-observer variability in manual delineation of the aneurysm neck, a definition based on a minimum cost path around the aneurysm sac is proposed that copes with this variability and is able to make consistent measurements along different data sets, as well as to automate and speedup the analysis of cerebral aneurysms. The method is based on the computation of a minimal path along a scalar field obtained on the vessel surface, to find the aneurysm neck in a robust and fast manner. The computation of the scalar field on the surface is obtained using a fast marching approach with a speed function based on the exponential of the distance from the centerline bifurcation between the aneurysm dome and the parent vessels. In order to assure a correct topology of the aneurysm sac, the neck computation is constrained to a region defined by a surface Voronoi diagram obtained from the branches of the vessel centerline. We validate this method comparing our results in 26 real cases with manual aneurysm isolation obtained using a cut-plane, and also with results obtained using manual delineations from three different observers by comparing typical morphological measures. © 2011 IEEE

Research on optimal path planning algorithm of task-oriented optical remote sensing satellites

NASA Astrophysics Data System (ADS)

Liu, Yunhe; Xu, Shengli; Liu, Fengjing; Yuan, Jingpeng

2015-08-01

GEO task-oriented optical remote sensing satellite, is very suitable for long-term continuous monitoring and quick access to imaging. With the development of high resolution optical payload technology and satellite attitude control technology, GEO optical remote sensing satellites will become an important developing trend for aerospace remote sensing satellite in the near future. In the paper, we focused on GEO optical remote sensing satellite plane array stare imaging characteristics and real-time leading mission of earth observation mode, targeted on satisfying needs of the user with the minimum cost of maneuver, and put forward the optimal path planning algorithm centered on transformation from geographic coordinate space to Field of plane, and finally reduced the burden of the control system. In this algorithm, bounded irregular closed area on the ground would be transformed based on coordinate transformation relations in to the reference plane for field of the satellite payload, and then using the branch and bound method to search for feasible solutions, cutting off the non-feasible solution in the solution space based on pruning strategy; and finally trimming some suboptimal feasible solutions based on the optimization index until a feasible solution for the global optimum. Simulation and visualization presentation software testing results verified the feasibility and effectiveness of the strategy.

Minimum entropy deconvolution and blind equalisation

NASA Technical Reports Server (NTRS)

Satorius, E. H.; Mulligan, J. J.

1992-01-01

Relationships between minimum entropy deconvolution, developed primarily for geophysics applications, and blind equalization are pointed out. It is seen that a large class of existing blind equalization algorithms are directly related to the scale-invariant cost functions used in minimum entropy deconvolution. Thus the extensive analyses of these cost functions can be directly applied to blind equalization, including the important asymptotic results of Donoho.

A benchmark for reaction coordinates in the transition path ensemble

PubMed Central

2016-01-01

The molecular mechanism of a reaction is embedded in its transition path ensemble, the complete collection of reactive trajectories. Utilizing the information in the transition path ensemble alone, we developed a novel metric, which we termed the emergent potential energy, for distinguishing reaction coordinates from the bath modes. The emergent potential energy can be understood as the average energy cost for making a displacement of a coordinate in the transition path ensemble. Where displacing a bath mode invokes essentially no cost, it costs significantly to move the reaction coordinate. Based on some general assumptions of the behaviors of reaction and bath coordinates in the transition path ensemble, we proved theoretically with statistical mechanics that the emergent potential energy could serve as a benchmark of reaction coordinates and demonstrated its effectiveness by applying it to a prototypical system of biomolecular dynamics. Using the emergent potential energy as guidance, we developed a committor-free and intuition-independent method for identifying reaction coordinates in complex systems. We expect this method to be applicable to a wide range of reaction processes in complex biomolecular systems. PMID:27059559

Pedestrian flow-path modeling to support tsunami evacuation and disaster relief planning in the U.S. Pacific Northwest

USGS Publications Warehouse

Wood, Nathan J.; Jones, Jeanne M.; Schmidtlein, Mathew; Schelling, John; Frazier, T.

2016-01-01

Successful evacuations are critical to saving lives from future tsunamis. Pedestrian-evacuation modeling related to tsunami hazards primarily has focused on identifying areas and the number of people in these areas where successful evacuations are unlikely. Less attention has been paid to identifying evacuation pathways and population demand at assembly areas for at-risk individuals that may have sufficient time to evacuate. We use the neighboring coastal communities of Hoquiam, Aberdeen, and Cosmopolis (Washington, USA) and the local tsunami threat posed by Cascadia subduction zone earthquakes as a case study to explore the use of geospatial, least-cost-distance evacuation modeling for supporting evacuation outreach, response, and relief planning. We demonstrate an approach that uses geospatial evacuation modeling to (a) map the minimum pedestrian travel speeds to safety, the most efficient paths, and collective evacuation basins, (b) estimate the total number and demographic description of evacuees at predetermined assembly areas, and (c) determine which paths may be compromised due to earthquake-induced ground failure. Results suggest a wide range in the magnitude and type of evacuees at predetermined assembly areas and highlight parts of the communities with no readily accessible assembly area. Earthquake-induced ground failures could obstruct access to some assembly areas, cause evacuees to reroute to get to other assembly areas, and isolate some evacuees from relief personnel. Evacuation-modeling methods and results discussed here have implications and application to tsunami-evacuation outreach, training, response procedures, mitigation, and long-term land use planning to increase community resilience.

Investigation of positive shaft seals

NASA Technical Reports Server (NTRS)

Pfouts, J. O.

1970-01-01

Welded metal bellows secondary seals prevent secondary seal leakage with a minimum number of potential leak paths. High performance seal is obtained by controlling the potentially unstable seal-face movements induced by mechanical vibrations and fluid pressure pulsations.

Optimization of memory use of fragment extension-based protein-ligand docking with an original fast minimum cost flow algorithm.

PubMed

Yanagisawa, Keisuke; Komine, Shunta; Kubota, Rikuto; Ohue, Masahito; Akiyama, Yutaka

2018-06-01

The need to accelerate large-scale protein-ligand docking in virtual screening against a huge compound database led researchers to propose a strategy that entails memorizing the evaluation result of the partial structure of a compound and reusing it to evaluate other compounds. However, the previous method required frequent disk accesses, resulting in insufficient acceleration. Thus, more efficient memory usage can be expected to lead to further acceleration, and optimal memory usage could be achieved by solving the minimum cost flow problem. In this research, we propose a fast algorithm for the minimum cost flow problem utilizing the characteristics of the graph generated for this problem as constraints. The proposed algorithm, which optimized memory usage, was approximately seven times faster compared to existing minimum cost flow algorithms. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.

UAVs Task and Motion Planning in the Presence of Obstacles and Prioritized Targets

PubMed Central

Gottlieb, Yoav; Shima, Tal

2015-01-01

The intertwined task assignment and motion planning problem of assigning a team of fixed-winged unmanned aerial vehicles to a set of prioritized targets in an environment with obstacles is addressed. It is assumed that the targets’ locations and initial priorities are determined using a network of unattended ground sensors used to detect potential threats at restricted zones. The targets are characterized by a time-varying level of importance, and timing constraints must be fulfilled before a vehicle is allowed to visit a specific target. It is assumed that the vehicles are carrying body-fixed sensors and, thus, are required to approach a designated target while flying straight and level. The fixed-winged aerial vehicles are modeled as Dubins vehicles, i.e., having a constant speed and a minimum turning radius constraint. The investigated integrated problem of task assignment and motion planning is posed in the form of a decision tree, and two search algorithms are proposed: an exhaustive algorithm that improves over run time and provides the minimum cost solution, encoded in the tree, and a greedy algorithm that provides a quick feasible solution. To satisfy the target’s visitation timing constraint, a path elongation motion planning algorithm amidst obstacles is provided. Using simulations, the performance of the algorithms is compared, evaluated and exemplified. PMID:26610522

A superconducting magnet mandrel with minimum symmetry laminations for proton therapy

NASA Astrophysics Data System (ADS)

Caspi, S.; Arbelaez, D.; Brouwer, L.; Dietderich, D. R.; Felice, H.; Hafalia, R.; Prestemon, S.; Robin, D.; Sun, C.; Wan, W.

2013-08-01

The size and weight of ion-beam cancer therapy gantries are frequently determined by a large aperture, curved, ninety degree, dipole magnet. The higher fields achievable with superconducting technology promise to greatly reduce the size and weight of this magnet and therefore also the gantry as a whole. This paper reports advances in the design of winding mandrels for curved, canted cosine-theta (CCT) magnets in the context of a preliminary magnet design for a proton gantry. The winding mandrel is integral to the CCT design and significantly affects the construction cost, stress management, winding feasibility, eddy current power losses, and field quality of the magnet. A laminated mandrel design using a minimum symmetry in the winding path is introduced and its feasibility demonstrated by a rapid prototype model. Piecewise construction of the mandrel using this laminated approach allows for increased manufacturing techniques and material choices. Sectioning the mandrel also reduces eddy currents produced during field changes accommodating the scan of beam energies during treatment. This symmetry concept can also greatly reduce the computational resources needed for 3D finite element calculations. It is shown that the small region of symmetry forming the laminations combined with periodic boundary conditions can model the entire magnet geometry disregarding the ends.

Distribution path robust optimization of electric vehicle with multiple distribution centers

PubMed Central

Hao, Wei; He, Ruichun; Jia, Xiaoyan; Pan, Fuquan; Fan, Jing; Xiong, Ruiqi

2018-01-01

To identify electrical vehicle (EV) distribution paths with high robustness, insensitivity to uncertainty factors, and detailed road-by-road schemes, optimization of the distribution path problem of EV with multiple distribution centers and considering the charging facilities is necessary. With the minimum transport time as the goal, a robust optimization model of EV distribution path with adjustable robustness is established based on Bertsimas’ theory of robust discrete optimization. An enhanced three-segment genetic algorithm is also developed to solve the model, such that the optimal distribution scheme initially contains all road-by-road path data using the three-segment mixed coding and decoding method. During genetic manipulation, different interlacing and mutation operations are carried out on different chromosomes, while, during population evolution, the infeasible solution is naturally avoided. A part of the road network of Xifeng District in Qingyang City is taken as an example to test the model and the algorithm in this study, and the concrete transportation paths are utilized in the final distribution scheme. Therefore, more robust EV distribution paths with multiple distribution centers can be obtained using the robust optimization model. PMID:29518169

Greedy algorithms in disordered systems

NASA Astrophysics Data System (ADS)

Duxbury, P. M.; Dobrin, R.

1999-08-01

We discuss search, minimal path and minimal spanning tree algorithms and their applications to disordered systems. Greedy algorithms solve these problems exactly, and are related to extremal dynamics in physics. Minimal cost path (Dijkstra) and minimal cost spanning tree (Prim) algorithms provide extremal dynamics for a polymer in a random medium (the KPZ universality class) and invasion percolation (without trapping) respectively.

Minimum target prices for production of direct-acting antivirals and associated diagnostics to combat hepatitis C virus

PubMed Central

van de Ven, Nikolien; Fortunak, Joe; Simmons, Bryony; Ford, Nathan; Cooke, Graham S; Khoo, Saye; Hill, Andrew

2015-01-01

Combinations of direct-acting antivirals (DAAs) can cure hepatitis C virus (HCV) in the majority of treatment-naïve patients. Mass treatment programs to cure HCV in developing countries are only feasible if the costs of treatment and laboratory diagnostics are very low. This analysis aimed to estimate minimum costs of DAA treatment and associated diagnostic monitoring. Clinical trials of HCV DAAs were reviewed to identify combinations with consistently high rates of sustained virological response across hepatitis C genotypes. For each DAA, molecular structures, doses, treatment duration, and components of retrosynthesis were used to estimate costs of large-scale, generic production. Manufacturing costs per gram of DAA were based upon treating at least 5 million patients per year and a 40% margin for formulation. Costs of diagnostic support were estimated based on published minimum prices of genotyping, HCV antigen tests plus full blood count/clinical chemistry tests. Predicted minimum costs for 12-week courses of combination DAAs with the most consistent efficacy results were: US$122 per person for sofosbuvir+daclatasvir; US$152 for sofosbuvir+ribavirin; US$192 for sofosbuvir+ledipasvir; and US$115 for MK-8742+MK-5172. Diagnostic testing costs were estimated at US$90 for genotyping US$34 for two HCV antigen tests and US$22 for two full blood count/clinical chemistry tests. Conclusions: Minimum costs of treatment and diagnostics to cure hepatitis C virus infection were estimated at US$171-360 per person without genotyping or US$261-450 per person with genotyping. These cost estimates assume that existing large-scale treatment programs can be established. (Hepatology 2015;61:1174–1182) PMID:25482139

Minimum target prices for production of direct-acting antivirals and associated diagnostics to combat hepatitis C virus.

PubMed

van de Ven, Nikolien; Fortunak, Joe; Simmons, Bryony; Ford, Nathan; Cooke, Graham S; Khoo, Saye; Hill, Andrew

2015-04-01

Combinations of direct-acting antivirals (DAAs) can cure hepatitis C virus (HCV) in the majority of treatment-naïve patients. Mass treatment programs to cure HCV in developing countries are only feasible if the costs of treatment and laboratory diagnostics are very low. This analysis aimed to estimate minimum costs of DAA treatment and associated diagnostic monitoring. Clinical trials of HCV DAAs were reviewed to identify combinations with consistently high rates of sustained virological response across hepatitis C genotypes. For each DAA, molecular structures, doses, treatment duration, and components of retrosynthesis were used to estimate costs of large-scale, generic production. Manufacturing costs per gram of DAA were based upon treating at least 5 million patients per year and a 40% margin for formulation. Costs of diagnostic support were estimated based on published minimum prices of genotyping, HCV antigen tests plus full blood count/clinical chemistry tests. Predicted minimum costs for 12-week courses of combination DAAs with the most consistent efficacy results were: US$122 per person for sofosbuvir+daclatasvir; US$152 for sofosbuvir+ribavirin; US$192 for sofosbuvir+ledipasvir; and US$115 for MK-8742+MK-5172. Diagnostic testing costs were estimated at US$90 for genotyping US$34 for two HCV antigen tests and US$22 for two full blood count/clinical chemistry tests. Minimum costs of treatment and diagnostics to cure hepatitis C virus infection were estimated at US$171-360 per person without genotyping or US$261-450 per person with genotyping. These cost estimates assume that existing large-scale treatment programs can be established. © 2014 The Authors. Hepatology published by Wiley Periodicals, Inc., on behalf of the American Association for the Study of Liver Diseases.

Video distribution system cost model

NASA Technical Reports Server (NTRS)

Gershkoff, I.; Haspert, J. K.; Morgenstern, B.

1980-01-01

A cost model that can be used to systematically identify the costs of procuring and operating satellite linked communications systems is described. The user defines a network configuration by specifying the location of each participating site, the interconnection requirements, and the transmission paths available for the uplink (studio to satellite), downlink (satellite to audience), and voice talkback (between audience and studio) segments of the network. The model uses this information to calculate the least expensive signal distribution path for each participating site. Cost estimates are broken downy by capital, installation, lease, operations and maintenance. The design of the model permits flexibility in specifying network and cost structure.

Generating a Simulated Fluid Flow Over an Aircraft Surface Using Anisotropic Diffusion

NASA Technical Reports Server (NTRS)

Rodriguez, David L. (Inventor); Sturdza, Peter (Inventor)

2013-01-01

A fluid-flow simulation over a computer-generated aircraft surface is generated using a diffusion technique. The surface is comprised of a surface mesh of polygons. A boundary-layer fluid property is obtained for a subset of the polygons of the surface mesh. A pressure-gradient vector is determined for a selected polygon, the selected polygon belonging to the surface mesh but not one of the subset of polygons. A maximum and minimum diffusion rate is determined along directions determined using a pressure gradient vector corresponding to the selected polygon. A diffusion-path vector is defined between a point in the selected polygon and a neighboring point in a neighboring polygon. An updated fluid property is determined for the selected polygon using a variable diffusion rate, the variable diffusion rate based on the minimum diffusion rate, maximum diffusion rate, and angular difference between the diffusion-path vector and the pressure-gradient vector.

Automatic Match between Delimitation Line and Real Terrain Based on Least-Cost Path Analysis

NASA Astrophysics Data System (ADS)

Feng, C. Q.; Jiang, N.; Zhang, X. N.; Ma, J.

2013-11-01

Nowadays, during the international negotiation on separating dispute areas, manual adjusting is lonely applied to the match between delimitation line and real terrain, which not only consumes much time and great labor force, but also cannot ensure high precision. Concerning that, the paper mainly explores automatic match between them and study its general solution based on Least -Cost Path Analysis. First, under the guidelines of delimitation laws, the cost layer is acquired through special disposals of delimitation line and terrain features line. Second, a new delimitation line gets constructed with the help of Least-Cost Path Analysis. Third, the whole automatic match model is built via Module Builder in order to share and reuse it. Finally, the result of automatic match is analyzed from many different aspects, including delimitation laws, two-sided benefits and so on. Consequently, a conclusion is made that the method of automatic match is feasible and effective.

47 CFR 24.243 - The cost-sharing formula.

Code of Federal Regulations, 2010 CFR

2010-10-01

...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs; site acquisition and civil works; zoning costs; training; disposal of old equipment; test...

Solving constrained minimum-time robot problems using the sequential gradient restoration algorithm

NASA Technical Reports Server (NTRS)

Lee, Allan Y.

1991-01-01

Three constrained minimum-time control problems of a two-link manipulator are solved using the Sequential Gradient and Restoration Algorithm (SGRA). The inequality constraints considered are reduced via Valentine-type transformations to nondifferential path equality constraints. The SGRA is then used to solve these transformed problems with equality constraints. The results obtained indicate that at least one of the two controls is at its limits at any instant in time. The remaining control then adjusts itself so that none of the system constraints is violated. Hence, the minimum-time control is either a pure bang-bang control or a combined bang-bang/singular control.

Aviation Safety Simulation Model

NASA Technical Reports Server (NTRS)

Houser, Scott; Yackovetsky, Robert (Technical Monitor)

2001-01-01

The Aviation Safety Simulation Model is a software tool that enables users to configure a terrain, a flight path, and an aircraft and simulate the aircraft's flight along the path. The simulation monitors the aircraft's proximity to terrain obstructions, and reports when the aircraft violates accepted minimum distances from an obstruction. This model design facilitates future enhancements to address other flight safety issues, particularly air and runway traffic scenarios. This report shows the user how to build a simulation scenario and run it. It also explains the model's output.

When Dijkstra Meets Vanishing Point: A Stereo Vision Approach for Road Detection.

PubMed

Zhang, Yigong; Su, Yingna; Yang, Jian; Ponce, Jean; Kong, Hui

2018-05-01

In this paper, we propose a vanishing-point constrained Dijkstra road model for road detection in a stereo-vision paradigm. First, the stereo-camera is used to generate the u- and v-disparity maps of road image, from which the horizon can be extracted. With the horizon and ground region constraints, we can robustly locate the vanishing point of road region. Second, a weighted graph is constructed using all pixels of the image, and the detected vanishing point is treated as the source node of the graph. By computing a vanishing-point constrained Dijkstra minimum-cost map, where both disparity and gradient of gray image are used to calculate cost between two neighbor pixels, the problem of detecting road borders in image is transformed into that of finding two shortest paths that originate from the vanishing point to two pixels in the last row of image. The proposed approach has been implemented and tested over 2600 grayscale images of different road scenes in the KITTI data set. The experimental results demonstrate that this training-free approach can detect horizon, vanishing point, and road regions very accurately and robustly. It can achieve promising performance.

Minimum time and fuel flight profiles for an F-15 airplane with a Highly Integrated Digital Electronic Control (HIDEC) system

NASA Technical Reports Server (NTRS)

Haering, E. A., Jr.; Burcham, F. W., Jr.

1984-01-01

A simulation study was conducted to optimize minimum time and fuel consumption paths for an F-15 airplane powered by two F100 Engine Model Derivative (EMD) engines. The benefits of using variable stall margin (uptrim) to increase performance were also determined. This study supports the NASA Highly Integrated Digital Electronic Control (HIDEC) program. The basis for this comparison was minimum time and fuel used to reach Mach 2 at 13,716 m (45,000 ft) from the initial conditions of Mach 0.15 at 1524 m (5000 ft). Results were also compared to a pilot's estimated minimum time and fuel trajectory determined from the F-15 flight manual and previous experience. The minimum time trajectory took 15 percent less time than the pilot's estimate for the standard EMD engines, while the minimum fuel trajectory used 1 percent less fuel than the pilot's estimate for the minimum fuel trajectory. The F-15 airplane with EMD engines and uptrim, was 23 percent faster than the pilot's estimate. The minimum fuel used was 5 percent less than the estimate.

Investigating seismoionospheric effects on a long subionospheric path

NASA Astrophysics Data System (ADS)

Clilverd, Mark A.; Rodger, Craig J.; Thomson, Neil R.

We examine the possibility of earthquake precursors influencing the subionospheric propagation of VLF transmissions. We consider the long (12 Mm) path from northeastern United States to Faraday, Antarctica (65°S, 64°W), during 1990-1995 and investigate the subionospheric amplitude variation of signals from the NAA communication transmitter (24.0 kHz, 1 MW) in Cutler, Maine, with particular emphasis on possible changes induced by seismic events occurring in South America. We have analyzed the changes in timing of modal minima generated by the passage of the sunrise terminator over the Andes, i.e., the ``VLF terminator time'' (TT) method. The anomalous variations in timing throughout the year are of a size and occurrence frequency similar to those previously reported, i.e., +/-0.5-1 hour and 1-2 per month. However, we find that in these anomalous cases, the time of the sunrise modal minimum does not change significantly, but rather, the minimum becomes insufficiently deep to be detected, and the time of the next nearest minimum is logged. Our analysis indicates that the occurrence rate of successful earthquake predictions using the TT method cannot be distinguished from that of chance. Additionally, the level of false earthquake prediction using the TT method is high.

The Analysis of Forward and Backward Dynamic Programming for Multistage Graph

NASA Astrophysics Data System (ADS)

Sitinjak, Anna Angela; Pasaribu, Elvina; Simarmata, Justin E.; Putra, Tedy; Mawengkang, Herman

2018-01-01

Dynamic programming is an optimization approach that divides the complex problems into the simple sequences of problems in which they are interrelated leading to decisions. In the dynamic programming, there is no standard formula that can be used to make a certain formulation. In this paper we use forward and backward method to find path which have the minimum cost and to know whether they make the same final decision. Convert the problem into several successive sequential stages starting on from stages 1,2,3 and 4 for forward dynamic programming and the step back from stage 4.3,2,1 for backward dynamic programming and interconnected with a decision rule in each stage. Find the optimal solution with cost principle at next stage. Based on the characteristics of the dynamic programming, the case is divided into several stages and the decision is has to be made (xk) at each stage. The results obtained at a stage are used for the states in the next stage so that at the forward stage 1, f1 (s) is obtained and used as a consideration of the decision in the next stage. In the backward, used firstly stage 4, f4 (s) is obtained and used as a consideration of the decision in the next stage. Cost forward and backward always increase steadily, because the cost in the next stage depends on the cost in the previous stage and formed the decision of each stage by taking the smallest fk value. Therefore the forward and backward approaches have the same result.

Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts

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

Bagli, Stefano, E-mail: stefano.bagli@gecosistema.i; Geneletti, Davide, E-mail: davide.geneletti@ing.unitn.i; Center for International Development, Harvard University, 79 JFK Street, Cambridge, MA 02138

2011-04-15

Least-cost path analysis (LCPA) allows designers to find the 'cheapest' way to connect two locations within a cost surface, which can be computed by combining multiple criteria, and therefore by accounting for different issues (environmental impact, economic investment, etc.). This procedure can be easily implemented with modern Geographic Information System (GIS) technologies, and consequently it has been widely employed to support planning and design of different types of linear infrastructures, ranging from roads to pipelines. This paper presents an approach based on the integration of multicriteria evaluation (MCE) and LCPA to identify the most suitable route for a 132 kVmore » power line. Criteria such as cost, visibility, population density, and ecosystem naturalness were used for the analysis. Firstly, spatial MCE and LCPA were combined to generate cost surfaces, and to identify alternative paths. Subsequently, MCE was used to compare the alternatives, and rank them according to their overall suitability. Finally, a sensitivity analysis allowed the stability of the results to be tested and the most critical factors of the evaluation to be detected. The study found that small changes in the location of the power line start and end points can result in significantly different paths, and consequently impact levels. This suggested that planners should always consider alternative potential locations of terminals in order to identify the best path. Furthermore, it was shown that the use of different weight scenarios may help making the model adaptable to varying environmental and social contexts. The approach was tested on a real-world case study in north-eastern Italy.« less

Ab initio molecular dynamics with nuclear quantum effects at classical cost: Ring polymer contraction for density functional theory.

PubMed

Marsalek, Ondrej; Markland, Thomas E

2016-02-07

Path integral molecular dynamics simulations, combined with an ab initio evaluation of interactions using electronic structure theory, incorporate the quantum mechanical nature of both the electrons and nuclei, which are essential to accurately describe systems containing light nuclei. However, path integral simulations have traditionally required a computational cost around two orders of magnitude greater than treating the nuclei classically, making them prohibitively costly for most applications. Here we show that the cost of path integral simulations can be dramatically reduced by extending our ring polymer contraction approach to ab initio molecular dynamics simulations. By using density functional tight binding as a reference system, we show that our ring polymer contraction scheme gives rapid and systematic convergence to the full path integral density functional theory result. We demonstrate the efficiency of this approach in ab initio simulations of liquid water and the reactive protonated and deprotonated water dimer systems. We find that the vast majority of the nuclear quantum effects are accurately captured using contraction to just the ring polymer centroid, which requires the same number of density functional theory calculations as a classical simulation. Combined with a multiple time step scheme using the same reference system, which allows the time step to be increased, this approach is as fast as a typical classical ab initio molecular dynamics simulation and 35× faster than a full path integral calculation, while still exactly including the quantum sampling of nuclei. This development thus offers a route to routinely include nuclear quantum effects in ab initio molecular dynamics simulations at negligible computational cost.

Equilibrium paths of an imperfect plate with respect to its aspect ratio

NASA Astrophysics Data System (ADS)

Psotny, Martin

2017-07-01

The stability analysis of a rectangular plate loaded in compression is presented, a specialized code based on FEM has been created. Special finite element with 48 degrees of freedom has been used for analysis. The nonlinear finite element method equations are derived from the variational principle of minimum of total potential energy. To trace the complete nonlinear equilibrium paths, the Newton-Raphson iteration algorithm is used, load versus displacement control was changed during the calculation process. The peculiarities of the effects of the initial imperfections on the load-deflection paths are investigated with respect to aspect ratio of the plate. Special attention is paid to the influence of imperfections on the post-critical buckling mode.

Construction of physical maps for the sex-specific regions of papaya sex chromosomes.

PubMed

Na, Jong-Kuk; Wang, Jianping; Murray, Jan E; Gschwend, Andrea R; Zhang, Wenli; Yu, Qingyi; Navajas-Pérez, Rafael; Feltus, F Alex; Chen, Cuixia; Kubat, Zdenek; Moore, Paul H; Jiang, Jiming; Paterson, Andrew H; Ming, Ray

2012-05-08

Papaya is a major fruit crop in tropical and subtropical regions worldwide. It is trioecious with three sex forms: male, female, and hermaphrodite. Sex determination is controlled by a pair of nascent sex chromosomes with two slightly different Y chromosomes, Y for male and Yh for hermaphrodite. The sex chromosome genotypes are XY (male), XYh (hermaphrodite), and XX (female). The papaya hermaphrodite-specific Yh chromosome region (HSY) is pericentromeric and heterochromatic. Physical mapping of HSY and its X counterpart is essential for sequencing these regions and uncovering the early events of sex chromosome evolution and to identify the sex determination genes for crop improvement. A reiterate chromosome walking strategy was applied to construct the two physical maps with three bacterial artificial chromosome (BAC) libraries. The HSY physical map consists of 68 overlapped BACs on the minimum tiling path, and covers all four HSY-specific Knobs. One gap remained in the region of Knob 1, the only knob structure shared between HSY and X, due to the lack of HSY-specific sequences. This gap was filled on the physical map of the HSY corresponding region in the X chromosome. The X physical map consists of 44 BACs on the minimum tiling path with one gap remaining in the middle, due to the nature of highly repetitive sequences. This gap was filled on the HSY physical map. The borders of the non-recombining HSY were defined genetically by fine mapping using 1460 F2 individuals. The genetically defined HSY spanned approximately 8.5 Mb, whereas its X counterpart extended about 5.4 Mb including a 900 Kb region containing the Knob 1 shared by the HSY and X. The 8.5 Mb HSY corresponds to 4.5 Mb of its X counterpart, showing 4 Mb (89%) DNA sequence expansion. The 89% increase of DNA sequence in HSY indicates rapid expansion of the Yh chromosome after genetic recombination was suppressed 2-3 million years ago. The genetically defined borders coincide with the common BACs on the minimum tiling paths of HSY and X. The minimum tiling paths of HSY and its X counterpart are being used for sequencing these X and Yh-specific regions.

Device for adapting continuously variable transmissions to infinitely variable transmissions with forward-neutral-reverse capabilities

DOEpatents

Wilkes, Donald F.; Purvis, James W.; Miller, A. Keith

1997-01-01

An infinitely variable transmission is capable of operating between a maximum speed in one direction and a minimum speed in an opposite direction, including a zero output angular velocity, while being supplied with energy at a constant angular velocity. Input energy is divided between a first power path carrying an orbital set of elements and a second path that includes a variable speed adjustment mechanism. The second power path also connects with the orbital set of elements in such a way as to vary the rate of angular rotation thereof. The combined effects of power from the first and second power paths are combined and delivered to an output element by the orbital element set. The transmission can be designed to operate over a preselected ratio of forward to reverse output speeds.

Thermal Storage System for Electric Vehicle Cabin Heating Component and System Analysis

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

LaClair, Tim J; Gao, Zhiming; Abdelaziz, Omar

Cabin heating of current electric vehicle (EV) designs is typically provided using electrical energy from the traction battery, since waste heat is not available from an engine as in the case of a conventional automobile. In very cold climatic conditions, the power required for space heating of an EV can be of a similar magnitude to that required for propulsion of the vehicle. As a result, its driving range can be reduced very significantly during the winter season, which limits consumer acceptance of EVs and results in increased battery costs to achieve a minimum range while ensuring comfort to themore » EV driver. To minimize the range penalty associated with EV cabin heating, a novel climate control system that includes thermal energy storage from an advanced phase change material (PCM) has been designed for use in EVs and plug-in hybrid electric vehicles (PHEVs). The present paper focuses on the modeling and analysis of this electrical PCM-Assisted Thermal Heating System (ePATHS) and is a companion to the paper Design and Testing of a Thermal Storage System for Electric Vehicle Cabin Heating. A detailed heat transfer model was developed to simulate the PCM heat exchanger that is at the heart of the ePATHS and was subsequently used to analyze and optimize its design. The results from this analysis were integrated into a MATLAB Simulink system model to simulate the fluid flow, pressure drop and heat transfer in all components of the ePATHS. The system model was then used to predict the performance of the climate control system in the vehicle and to evaluate control strategies needed to achieve the desired temperature control in the cabin. The analysis performed to design the ePATHS is described in detail and the system s predicted performance in a vehicle HVAC system is presented.« less

On the efficacy of spatial sampling using manual scanning paths to determine the spatial average sound pressure level in rooms.

PubMed

Hopkins, Carl

2011-05-01

In architectural acoustics, noise control and environmental noise, there are often steady-state signals for which it is necessary to measure the spatial average, sound pressure level inside rooms. This requires using fixed microphone positions, mechanical scanning devices, or manual scanning. In comparison with mechanical scanning devices, the human body allows manual scanning to trace out complex geometrical paths in three-dimensional space. To determine the efficacy of manual scanning paths in terms of an equivalent number of uncorrelated samples, an analytical approach is solved numerically. The benchmark used to assess these paths is a minimum of five uncorrelated fixed microphone positions at frequencies above 200 Hz. For paths involving an operator walking across the room, potential problems exist with walking noise and non-uniform scanning speeds. Hence, paths are considered based on a fixed standing position or rotation of the body about a fixed point. In empty rooms, it is shown that a circle, helix, or cylindrical-type path satisfy the benchmark requirement with the latter two paths being highly efficient at generating large number of uncorrelated samples. In furnished rooms where there is limited space for the operator to move, an efficient path comprises three semicircles with 45°-60° separations.

From brittle to ductile fracture in disordered materials.

PubMed

Picallo, Clara B; López, Juan M; Zapperi, Stefano; Alava, Mikko J

2010-10-08

We introduce a lattice model able to describe damage and yielding in heterogeneous materials ranging from brittle to ductile ones. Ductile fracture surfaces, obtained when the system breaks once the strain is completely localized, are shown to correspond to minimum energy surfaces. The similarity of the resulting fracture paths to the limits of brittle fracture or minimum energy surfaces is quantified. The model exhibits a smooth transition from brittleness to ductility. The dynamics of yielding exhibits avalanches with a power-law distribution.

Solving a Class of Spatial Reasoning Problems: Minimal-Cost Path Planning in the Cartesian Plane.

DTIC Science & Technology

1987-06-01

as in Figure 72. By the Theorem of Pythagoras : Z1 <a z 2 < C Yl(bl+b 2)uI, the cost of going along (a,b,c) is greater that the...preceding lemmas to an indefinite number of boundary-crossing episodes is accomplished by the following theorems . Theorem 1 extends the result of Lemma 1... Theorem 1: Any two Snell’s-law paths within a K-explored wedge defined by Snell’s-law paths RL and R. do not intersect within the K-explored portion of

REML/BLUP and sequential path analysis in estimating genotypic values and interrelationships among simple maize grain yield-related traits.

PubMed

Olivoto, T; Nardino, M; Carvalho, I R; Follmann, D N; Ferrari, M; Szareski, V J; de Pelegrin, A J; de Souza, V Q

2017-03-22

Methodologies using restricted maximum likelihood/best linear unbiased prediction (REML/BLUP) in combination with sequential path analysis in maize are still limited in the literature. Therefore, the aims of this study were: i) to use REML/BLUP-based procedures in order to estimate variance components, genetic parameters, and genotypic values of simple maize hybrids, and ii) to fit stepwise regressions considering genotypic values to form a path diagram with multi-order predictors and minimum multicollinearity that explains the relationships of cause and effect among grain yield-related traits. Fifteen commercial simple maize hybrids were evaluated in multi-environment trials in a randomized complete block design with four replications. The environmental variance (78.80%) and genotype-vs-environment variance (20.83%) accounted for more than 99% of the phenotypic variance of grain yield, which difficult the direct selection of breeders for this trait. The sequential path analysis model allowed the selection of traits with high explanatory power and minimum multicollinearity, resulting in models with elevated fit (R 2 > 0.9 and ε < 0.3). The number of kernels per ear (NKE) and thousand-kernel weight (TKW) are the traits with the largest direct effects on grain yield (r = 0.66 and 0.73, respectively). The high accuracy of selection (0.86 and 0.89) associated with the high heritability of the average (0.732 and 0.794) for NKE and TKW, respectively, indicated good reliability and prospects of success in the indirect selection of hybrids with high-yield potential through these traits. The negative direct effect of NKE on TKW (r = -0.856), however, must be considered. The joint use of mixed models and sequential path analysis is effective in the evaluation of maize-breeding trials.

A Comparison of Two Path Planners for Planetary Rovers

NASA Technical Reports Server (NTRS)

Tarokh, M.; Shiller, Z.; Hayati, S.

1999-01-01

The paper presents two path planners suitable for planetary rovers. The first is based on fuzzy description of the terrain, and genetic algorithm to find a traversable path in a rugged terrain. The second planner uses a global optimization method with a cost function that is the path distance divided by the velocity limit obtained from the consideration of the rover static and dynamic stability. A description of both methods is provided, and the results of paths produced are given which show the effectiveness of the path planners in finding near optimal paths. The features of the methods and their suitability and application for rover path planning are compared

Three Essays In and Tests of Theoretical Urban Economics

NASA Astrophysics Data System (ADS)

Zhao, Weihua

This dissertation consists of three essays on urban economics. The three essays are related to urban spatial structure change, energy consumption, greenhouse gas emissions, and housing redevelopment. Chapter 1 answers the question: Does the classic Standard Urban Model still describe the growth of cities? Chapter 2 derives the implications of telework on urban spatial structure, energy consumption, and greenhouse gas emissions. Chapter 3 investigates the long run effects of minimum lot size zoning on neighborhood redevelopment. Chapter 1 identifies a new implication of the classic Standard Urban Model, the "unitary elasticity property (UEP)", which is the sum of the elasticity of central density and the elasticity of land area with respect to population change is approximately equal to unity. When this implication of the SUM is tested, it fits US cities fairly well. Further analysis demonstrates that topographic barriers and age of housing stock are the key factors explaining deviation from the UEP. Chapter 2 develops a numerical urban simulation model with households that are able to telework to investigate the urban form, congestion, energy consumption and greenhouse gas emission implications of telework. Simulation results suggest that by reducing transportation costs, telework causes sprawl, with associated longer commutes and consumption of larger homes, both of which increase energy consumption. Overall effects depend on who captures the gains from telework (workers versus firms), urban land use regulation such as height limits or greenbelts, and the fraction of workers participating in telework. The net effects of telework on energy use and GHG emissions are generally negligible. Chapter 3 applies dynamic programming to investigate the long run effects of minimum lot size zoning on neighborhood redevelopment. With numerical simulation, comparative dynamic results show that minimum lot size zoning can delay initial land conversion and slow down demolition and housing redevelopment. Initially, minimum lot size zoning is not binding. However, as city grows, it becomes binding and can effectively distort housing supply. It can lower both floor area ratio and residential density, and reduce aggregate housing supply. Overall, minimum lot size zoning can stabilize the path of structure/land ratios, housing service levels, structure density, and housing prices. In addition, minimum lot size zoning provides more incentive for developer to maintain the building, slow structure deterioration, and raise the minimum level of housing services provided over the life cycle of development.

Auditory Perception of Motor Vehicle Travel Paths

PubMed Central

Ashmead, Daniel H.; Grantham, D. Wesley; Maloff, Erin S.; Hornsby, Benjamin; Nakamura, Takabun; Davis, Timothy J.; Pampel, Faith; Rushing, Erin G.

2012-01-01

Objective These experiments address concerns that motor vehicles in electric engine mode are so quiet that they pose a risk to pedestrians, especially those with visual impairments. Background The “quiet car” issue has focused on hybrid and electric vehicles, although it also applies to internal combustion engine vehicles. Previous research has focused on detectability of vehicles, mostly in quiet settings. Instead, we focused on the functional ability to perceive vehicle motion paths. Method Participants judged whether simulated vehicles were traveling straight or turning, with emphasis on the impact of background traffic sound. Results In quiet, listeners made the straight-or-turn judgment soon enough in the vehicle’s path to be useful for deciding whether to start crossing the street. This judgment is based largely on sound level cues rather than the spatial direction of the vehicle. With even moderate background traffic sound, the ability to tell straight from turn paths is severely compromised. The signal-to-noise ratio needed for the straight-or-turn judgment is much higher than that needed to detect a vehicle. Conclusion Although a requirement for a minimum vehicle sound level might enhance detection of vehicles in quiet settings, it is unlikely that this requirement would contribute to pedestrian awareness of vehicle movements in typical traffic settings with many vehicles present. Application The findings are relevant to deliberations by government agencies and automobile manufacturers about standards for minimum automobile sounds and, more generally, for solutions to pedestrians’ needs for information about traffic, especially for pedestrians with sensory impairments. PMID:22768645

Auditory perception of motor vehicle travel paths.

PubMed

Ashmead, Daniel H; Grantham, D Wesley; Maloff, Erin S; Hornsby, Benjamin; Nakamura, Takabun; Davis, Timothy J; Pampel, Faith; Rushing, Erin G

2012-06-01

These experiments address concerns that motor vehicles in electric engine mode are so quiet that they pose a risk to pedestrians, especially those with visual impairments. The "quiet car" issue has focused on hybrid and electric vehicles, although it also applies to internal combustion engine vehicles. Previous research has focused on detectability of vehicles, mostly in quiet settings. Instead, we focused on the functional ability to perceive vehicle motion paths. Participants judged whether simulated vehicles were traveling straight or turning, with emphasis on the impact of background traffic sound. In quiet, listeners made the straight-or-turn judgment soon enough in the vehicle's path to be useful for deciding whether to start crossing the street. This judgment is based largely on sound level cues rather than the spatial direction of the vehicle. With even moderate background traffic sound, the ability to tell straight from turn paths is severely compromised. The signal-to-noise ratio needed for the straight-or-turn judgment is much higher than that needed to detect a vehicle. Although a requirement for a minimum vehicle sound level might enhance detection of vehicles in quiet settings, it is unlikely that this requirement would contribute to pedestrian awareness of vehicle movements in typical traffic settings with many vehicles present. The findings are relevant to deliberations by government agencies and automobile manufacturers about standards for minimum automobile sounds and, more generally, for solutions to pedestrians' needs for information about traffic, especially for pedestrians with sensory impairments.

Cost of and soil loss on "minimum-standard" forest truck roads constructed in the central Appalachians

Treesearch

J. N. Kochenderfer; G. W. Wendel; H. Clay Smith

1984-01-01

A "minimum-standard" forest truck road that provides efficient and environmentally acceptable access for several forest activities is described. Cost data are presented for eight of these roads constructed in the central Appalachians. The average cost per mile excluding gravel was $8,119. The range was $5,048 to $14,424. Soil loss was measured from several...

Menu Plans: Maximum Nutrition for Minimum Cost.

ERIC Educational Resources Information Center

Texas Child Care, 1995

1995-01-01

Suggests that menu planning is the key to getting maximum nutrition in day care meals and snacks for minimum cost. Explores United States Department of Agriculture food pyramid guidelines for children and tips for planning menus and grocery shopping. Includes suggested meal patterns and portion sizes. (HTH)

Key node selection in minimum-cost control of complex networks

NASA Astrophysics Data System (ADS)

Ding, Jie; Wen, Changyun; Li, Guoqi

2017-11-01

Finding the key node set that is connected with a given number of external control sources for driving complex networks from initial state to any predefined state with minimum cost, known as minimum-cost control problem, is critically important but remains largely open. By defining an importance index for each node, we propose revisited projected gradient method extension (R-PGME) in Monte-Carlo scenario to determine key node set. It is found that the importance index of a node is strongly correlated to occurrence rate of that node to be selected as a key node in Monte-Carlo realizations for three elementary topologies, Erdős-Rényi and scale-free networks. We also discover the distribution patterns of key nodes when the control cost reaches its minimum. Specifically, the importance indices of all nodes in an elementary stem show a quasi-periodic distribution with high peak values in the beginning and end of a quasi-period while they approach to a uniform distribution in an elementary cycle. We further point out that an elementary dilation can be regarded as two elementary stems whose lengths are the closest, and the importance indices in each stem present similar distribution as in an elementary stem. Our results provide a better understanding and deep insight of locating the key nodes in different topologies with minimum control cost.

Limited static and dynamic delivering capacity allocations in scale-free networks

NASA Astrophysics Data System (ADS)

Haddou, N. Ben; Ez-Zahraouy, H.; Rachadi, A.

In traffic networks, it is quite important to assign proper packet delivering capacities to the routers with minimum cost. In this respect, many allocation models based on static and dynamic properties have been proposed. In this paper, we are interested in the impact of limiting the packet delivering capacities already allocated to the routers; each node is assigned a packet delivering capacity limited by the maximal capacity Cmax of the routers. To study the limitation effect, we use two basic delivering capacity allocation models; static delivering capacity allocation (SDCA) and dynamic delivering capacity allocation (DDCA). In the SDCA, the capacity allocated is proportional to the node degree, and for DDCA, it is proportional to its queue length. We have studied and compared the limitation of both allocation models under the shortest path (SP) routing strategy as well as the efficient path (EP) routing protocol. In the SP case, we noted a similarity in the results; the network capacity increases with increasing Cmax. For the EP scheme, the network capacity stops increasing for relatively small packet delivering capability limit Cmax for both allocation strategies. However, it reaches high values under the limited DDCA before the saturation. We also find that in the DDCA case, the network capacity remains constant when the traffic information available to each router was updated after long period times τ.

I/O load balancing for big data HPC applications

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

Paul, Arnab K.; Goyal, Arpit; Wang, Feiyi

High Performance Computing (HPC) big data problems require efficient distributed storage systems. However, at scale, such storage systems often experience load imbalance and resource contention due to two factors: the bursty nature of scientific application I/O; and the complex I/O path that is without centralized arbitration and control. For example, the extant Lustre parallel file system-that supports many HPC centers-comprises numerous components connected via custom network topologies, and serves varying demands of a large number of users and applications. Consequently, some storage servers can be more loaded than others, which creates bottlenecks and reduces overall application I/O performance. Existing solutionsmore » typically focus on per application load balancing, and thus are not as effective given their lack of a global view of the system. In this paper, we propose a data-driven approach to load balance the I/O servers at scale, targeted at Lustre deployments. To this end, we design a global mapper on Lustre Metadata Server, which gathers runtime statistics from key storage components on the I/O path, and applies Markov chain modeling and a minimum-cost maximum-flow algorithm to decide where data should be placed. Evaluation using a realistic system simulator and a real setup shows that our approach yields better load balancing, which in turn can improve end-to-end performance.« less

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

NASA Astrophysics Data System (ADS)

Jiang, Zhongzhou; Liu, Jing; Wang, Shuai

2016-12-01

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Ab initio molecular dynamics with nuclear quantum effects at classical cost: Ring polymer contraction for density functional theory

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

Marsalek, Ondrej; Markland, Thomas E., E-mail: tmarkland@stanford.edu

Path integral molecular dynamics simulations, combined with an ab initio evaluation of interactions using electronic structure theory, incorporate the quantum mechanical nature of both the electrons and nuclei, which are essential to accurately describe systems containing light nuclei. However, path integral simulations have traditionally required a computational cost around two orders of magnitude greater than treating the nuclei classically, making them prohibitively costly for most applications. Here we show that the cost of path integral simulations can be dramatically reduced by extending our ring polymer contraction approach to ab initio molecular dynamics simulations. By using density functional tight binding asmore » a reference system, we show that our ring polymer contraction scheme gives rapid and systematic convergence to the full path integral density functional theory result. We demonstrate the efficiency of this approach in ab initio simulations of liquid water and the reactive protonated and deprotonated water dimer systems. We find that the vast majority of the nuclear quantum effects are accurately captured using contraction to just the ring polymer centroid, which requires the same number of density functional theory calculations as a classical simulation. Combined with a multiple time step scheme using the same reference system, which allows the time step to be increased, this approach is as fast as a typical classical ab initio molecular dynamics simulation and 35× faster than a full path integral calculation, while still exactly including the quantum sampling of nuclei. This development thus offers a route to routinely include nuclear quantum effects in ab initio molecular dynamics simulations at negligible computational cost.« less

Automatic procedure for stable tetragonal or hexagonal structures: application to tetragonal Y and Cd

NASA Astrophysics Data System (ADS)

Marcus, P. M.; Jona, F.

2005-05-01

A simple effective procedure (MNP) for finding equilibrium tetragonal and hexagonal states under pressure is described and applied. The MNP procedure finds a path to minima of the Gibbs free energy G at T=0 K (G=E+pV, E=energy per atom, p=pressure, V=volume per atom) for tetragonal and hexagonal structures by using the approximate expansion of G in linear and quadratic strains at an arbitrary initial structure to find a change in the strains which moves toward a minimum of G. Iteration automatically proceeds to a minimum within preset convergence criteria on the calculation of the minimum. Comparison is made with experimental results for the ground states of seven metallic elements in hexagonal close-packed (hcp), face- and body-centered cubic structures, and with a previous procedure for finding minima based on tracing G along the epitaxial Bain path (EBP) to a minimum; the MNP is more easily generalized than the EBP procedure to lower symmetry and more atoms in the unit cell. Comparison is also made with a molecular-dynamics program for crystal equilibrium structures under pressure and with CRYSTAL, a program for crystal equilibrium structures at zero pressure. Application of MNP to the elements Y and Cd, which have hcp ground states at zero pressure, finds minima of E at face-centered cubic (fcc) structure for both Y and Cd. Evaluation of all the elastic constants shows that fcc Y is stable, hence a metastable phase, but fcc Cd is unstable.

Comparing laser-based open- and closed-path gas analyzers to measure methane fluxes using the eddy covariance method

USGS Publications Warehouse

Detto, Matteo; Verfaillie, Joseph; Anderson, Frank; Xu, Liukang; Baldocchi, Dennis

2011-01-01

Closed- and open-path methane gas analyzers are used in eddy covariance systems to compare three potential methane emitting ecosystems in the Sacramento-San Joaquin Delta (CA, USA): a rice field, a peatland pasture and a restored wetland. The study points out similarities and differences of the systems in field experiments and data processing. The closed-path system, despite a less intrusive placement with the sonic anemometer, required more care and power. In contrast, the open-path system appears more versatile for a remote and unattended experimental site. Overall, the two systems have comparable minimum detectable limits, but synchronization between wind speed and methane data, air density corrections and spectral losses have different impacts on the computed flux covariances. For the closed-path analyzer, air density effects are less important, but the synchronization and spectral losses may represent a problem when fluxes are small or when an undersized pump is used. For the open-path analyzer air density corrections are greater, due to spectroscopy effects and the classic Webb–Pearman–Leuning correction. Comparison between the 30-min fluxes reveals good agreement in terms of magnitudes between open-path and closed-path flux systems. However, the scatter is large, as consequence of the intensive data processing which both systems require.

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

Dorum, O.H.; Hoover, A.; Jones, J.P.

This paper addresses some issues in the development of sensor-based systems for mobile robot navigation which use range imaging sensors as the primary source for geometric information about the environment. In particular, we describe a model of scanning laser range cameras which takes into account the properties of the mechanical system responsible for image formation and a calibration procedure which yields improved accuracy over previous models. In addition, we describe an algorithm which takes the limitations of these sensors into account in path planning and path execution. In particular, range imaging sensors are characterized by a limited field of viewmore » and a standoff distance -- a minimum distance nearer than which surfaces cannot be sensed. These limitations can be addressed by enriching the concept of configuration space to include information about what can be sensed from a given configuration, and using this information to guide path planning and path following.« less

47 CFR 27.1164 - The cost-sharing formula.

Code of Federal Regulations, 2011 CFR

2011-10-01

... control equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs... plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. Increased recurring costs...

47 CFR 27.1164 - The cost-sharing formula.

Code of Federal Regulations, 2012 CFR

2012-10-01

... control equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs... plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. Increased recurring costs...

Barriers and dispersal surfaces in minimum-time interception. [for optimizing aircraft flight paths

NASA Technical Reports Server (NTRS)

Rajan, N.; Ardema, M. D.

1984-01-01

A method is proposed for mapping the barrier, dispersal, and control-level surfaces for a class of minimum-time interception and pursuit-evasion problems. Minimum-time interception of a target moving in a horizontal plane is formulated in a coordinate system whose origin is at the interceptor's terminal position and whose x-axis is along the terminal line of sight. This approach makes it possible to discuss the nature of the interceptor's extremals, using its extremal trajectory maps (ETMs), independently of target motion. The game surfaces are constructed by drawing sections of the isochrones, or constant minimum-time loci, from the interceptor and target ETMs. In this way, feedback solutions for the optimal controls are obtained. An example involving the interception of a target moving in a straight line at constant speed is presented.

Computational Role of Tunneling in a Programmable Quantum Annealer

NASA Technical Reports Server (NTRS)

Boixo, Sergio; Smelyanskiy, Vadim; Shabani, Alireza; Isakov, Sergei V.; Dykman, Mark; Amin, Mohammad; Mohseni, Masoud; Denchev, Vasil S.; Neven, Hartmut

2016-01-01

Quantum tunneling is a phenomenon in which a quantum state tunnels through energy barriers above the energy of the state itself. Tunneling has been hypothesized as an advantageous physical resource for optimization. Here we present the first experimental evidence of a computational role of multiqubit quantum tunneling in the evolution of a programmable quantum annealer. We developed a theoretical model based on a NIBA Quantum Master Equation to describe the multi-qubit dissipative cotunneling effects under the complex noise characteristics of such quantum devices.We start by considering a computational primitive, the simplest non-convex optimization problem consisting of just one global and one local minimum. The quantum evolutions enable tunneling to the global minimum while the corresponding classical paths are trapped in a false minimum. In our study the non-convex potentials are realized by frustrated networks of qubit clusters with strong intra-cluster coupling. We show that the collective effect of the quantum environment is suppressed in the critical phase during the evolution where quantum tunneling decides the right path to solution. In a later stage dissipation facilitates the multiqubit cotunneling leading to the solution state. The predictions of the model accurately describe the experimental data from the D-WaveII quantum annealer at NASA Ames. In our computational primitive the temperature dependence of the probability of success in the quantum model is opposite to that of the classical paths with thermal hopping. Specially, we provide an analysis of an optimization problem with sixteen qubits,demonstrating eight qubit cotunneling that increases success probabilities. Furthermore, we report results for larger problems with up to 200 qubits that contain the primitive as subproblems.

Traffic-engineering-aware shortest-path routing and its application in IP-over-WDM networks [Invited

NASA Astrophysics Data System (ADS)

Lee, Youngseok; Mukherjee, Biswanath

2004-03-01

Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest path first and intermediate system-intermediate system protocols does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the globally optimal TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next hop toward the destination by looking up the destination prefix. We present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program, and we propose a simple heuristic for solving large instances of the problem. Then we explore the usage of our proposed algorithm for the integrated TE method in IP-over-WDM networks. The proposed algorithm is evaluated through simulations in IP networks as well as in IP-over-WDM networks.

42 CFR 412.348 - Exception payments.

Code of Federal Regulations, 2010 CFR

2010-10-01

... beginning on or after October 1, 1991 and before October 1, 2001. (c) Minimum payment level by class of hospital. (1) CMS establishes a minimum payment level by class of hospital. The minimum payment level for a hospital will equal a fixed percentage of the hospital's capital-related costs. The minimum payment levels...

High-cost, high-capacity backbone for global brain communication.

PubMed

van den Heuvel, Martijn P; Kahn, René S; Goñi, Joaquín; Sporns, Olaf

2012-07-10

Network studies of human brain structural connectivity have identified a specific set of brain regions that are both highly connected and highly central. Recent analyses have shown that these putative hub regions are mutually and densely interconnected, forming a "rich club" within the human brain. Here we show that the set of pathways linking rich club regions forms a central high-cost, high-capacity backbone for global brain communication. Diffusion tensor imaging (DTI) data of two sets of 40 healthy subjects were used to map structural brain networks. The contributions to network cost and communication capacity of global cortico-cortical connections were assessed through measures of their topology and spatial embedding. Rich club connections were found to be more costly than predicted by their density alone and accounted for 40% of the total communication cost. Furthermore, 69% of all minimally short paths between node pairs were found to travel through the rich club and a large proportion of these communication paths consisted of ordered sequences of edges ("path motifs") that first fed into, then traversed, and finally exited the rich club, while passing through nodes of increasing and then decreasing degree. The prevalence of short paths that follow such ordered degree sequences suggests that neural communication might take advantage of strategies for dynamic routing of information between brain regions, with an important role for a highly central rich club. Taken together, our results show that rich club connections make an important contribution to interregional signal traffic, forming a central high-cost, high-capacity backbone for global brain communication.

Designing from minimum to optimum functionality

NASA Astrophysics Data System (ADS)

Bannova, Olga; Bell, Larry

2011-04-01

This paper discusses a multifaceted strategy to link NASA Minimal Functionality Habitable Element (MFHE) requirements to a compatible growth plan; leading forward to evolutionary, deployable habitats including outpost development stages. The discussion begins by reviewing fundamental geometric features inherent in small scale, vertical and horizontal, pressurized module configuration options to characterize applicability to meet stringent MFHE constraints. A proposed scenario to incorporate a vertical core MFHE concept into an expanded architecture to provide continuity of structural form and a logical path from "minimum" to "optimum" design of a habitable module. The paper describes how habitation and logistics accommodations could be pre-integrated into a common Hab/Log Module that serves both habitation and logistics functions. This is offered as a means to reduce unnecessary redundant development costs and to avoid EVA-intensive on-site adaptation and retrofitting requirements for augmented crew capacity. An evolutionary version of the hard shell Hab/Log design would have an expandable middle section to afford larger living and working accommodations. In conclusion, the paper illustrates that a number of cargo missions referenced for NASA's 4.0.0 Lunar Campaign Scenario could be eliminated altogether to expedite progress and reduce budgets. The plan concludes with a vertical growth geometry that provides versatile and efficient site development opportunities using a combination of hard Hab/Log modules and a hybrid expandable "CLAM" (Crew Lunar Accommodations Module) element.

Possible metastable rhombohedral states of the bcc transition metals

NASA Astrophysics Data System (ADS)

Mehl, Michael; Finkenstadt, Daniel

2007-03-01

The energy E(c/a) for a bcc element stretched along its [001] axis (the Bain path) has a minimum at c/a = 1, a maximum at c/a = √2, and an elastically unstable local minimum at c/a > √2. A rhombohedral strain is an alternative method of connecting the bcc and fcc structures. The primitive lattice keeps R3m symmetry, with the angle α changing from 109.4^o (bcc), to 90^o (simple cubic), to 60^o (fcc). We studied this path for the non-magnetic bcc transition metals (V, Nb, Mo, Ta, and W) using both a full-potential LAPW and PAW VASP. Except for Ta, the energy E(α) has a local maximum at α=60^o, with local minima near 55^o and 70^o, the later having lower energy. We studied the elastic stability of the 70^o minimum structure. Only W is elastically stable in this structure, with the smallest eigenvalue of the elastic tensor at 4 GPa, while the other three elements are unstable. We discuss the possibility that Tungsten is actually metastable in this structure. We also consider the possible epitaxial growth of this structure. M. J. Mehl, A. Aguayo, L. L. Boyer, and R. De Coss, Phys. Rev. B 70, 014105 (2004).

Wetting transition on patterned surfaces: transition states and energy barriers.

PubMed

Ren, Weiqing

2014-03-18

We study the wetting transition on microstructured hydrophobic surfaces. We use the string method [J. Chem. Phys. 2007, 126, 164103; J. Chem. Phys. 2013, 138, 134105] to accurately compute the transition states, the energy barriers, and the minimum energy paths for the wetting transition from the Cassie-Baxter state to the Wenzel state. Numerical results are obtained for the wetting of a hydrophobic surface textured with a square lattice of pillars. It is found that the wetting of the solid substrate occurs via infiltration of the liquid in a single groove, followed by lateral propagation of the liquid front. The propagation of the liquid front proceeds in a stepwise manner, and a zipping mechanism is observed during the infiltration of each layer. The minimum energy path for the wetting transition goes through a sequence of intermediate metastable states, whose wetted areas reflect the microstructure of the patterned surface. We also study the dependence of the energy barrier on the drop size and the gap between the pillars.

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

Chen, Hang, E-mail: hangchen@mit.edu; Thill, Peter; Cao, Jianshu

In biochemical systems, intrinsic noise may drive the system switch from one stable state to another. We investigate how kinetic switching between stable states in a bistable network is influenced by dynamic disorder, i.e., fluctuations in the rate coefficients. Using the geometric minimum action method, we first investigate the optimal transition paths and the corresponding minimum actions based on a genetic toggle switch model in which reaction coefficients draw from a discrete probability distribution. For the continuous probability distribution of the rate coefficient, we then consider two models of dynamic disorder in which reaction coefficients undergo different stochastic processes withmore » the same stationary distribution. In one, the kinetic parameters follow a discrete Markov process and in the other they follow continuous Langevin dynamics. We find that regulation of the parameters modulating the dynamic disorder, as has been demonstrated to occur through allosteric control in bistable networks in the immune system, can be crucial in shaping the statistics of optimal transition paths, transition probabilities, and the stationary probability distribution of the network.« less

Topology Trivialization and Large Deviations for the Minimum in the Simplest Random Optimization

NASA Astrophysics Data System (ADS)

Fyodorov, Yan V.; Le Doussal, Pierre

2014-01-01

Finding the global minimum of a cost function given by the sum of a quadratic and a linear form in N real variables over (N-1)-dimensional sphere is one of the simplest, yet paradigmatic problems in Optimization Theory known as the "trust region subproblem" or "constraint least square problem". When both terms in the cost function are random this amounts to studying the ground state energy of the simplest spherical spin glass in a random magnetic field. We first identify and study two distinct large-N scaling regimes in which the linear term (magnetic field) leads to a gradual topology trivialization, i.e. reduction in the total number {N}_{tot} of critical (stationary) points in the cost function landscape. In the first regime {N}_{tot} remains of the order N and the cost function (energy) has generically two almost degenerate minima with the Tracy-Widom (TW) statistics. In the second regime the number of critical points is of the order of unity with a finite probability for a single minimum. In that case the mean total number of extrema (minima and maxima) of the cost function is given by the Laplace transform of the TW density, and the distribution of the global minimum energy is expected to take a universal scaling form generalizing the TW law. Though the full form of that distribution is not yet known to us, one of its far tails can be inferred from the large deviation theory for the global minimum. In the rest of the paper we show how to use the replica method to obtain the probability density of the minimum energy in the large-deviation approximation by finding both the rate function and the leading pre-exponential factor.

Steiner trees and spanning trees in six-pin soap films

NASA Astrophysics Data System (ADS)

Dutta, Prasun; Khastgir, S. Pratik; Roy, Anushree

2010-02-01

The problem of finding minimum (local as well as absolute) path lengths joining given points (or terminals) on a plane is known as the Steiner problem. The Steiner problem arises in finding the minimum total road length joining several towns and cities. We study the Steiner tree problem using six-pin soap films. Experimentally, we observe spanning trees as well as Steiner trees partly by varying the pin diameter. We propose a possibly exact expression for the length of a spanning tree or a Steiner tree, which fails mysteriously in certain cases.

A semi-automatic method for extracting thin line structures in images as rooted tree network

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

Brazzini, Jacopo; Dillard, Scott; Soille, Pierre

2010-01-01

This paper addresses the problem of semi-automatic extraction of line networks in digital images - e.g., road or hydrographic networks in satellite images, blood vessels in medical images, robust. For that purpose, we improve a generic method derived from morphological and hydrological concepts and consisting in minimum cost path estimation and flow simulation. While this approach fully exploits the local contrast and shape of the network, as well as its arborescent nature, we further incorporate local directional information about the structures in the image. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the targetmore » network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given seed with this metric is combined with hydrological operators for overland flow simulation to extract the line network. The algorithm is demonstrated for the extraction of blood vessels in a retina image and of a river network in a satellite image.« less

Smallholder farms as stepping stone corridors for crop-raiding elephant in northern Tanzania: integration of Bayesian expert system and network simulator.

PubMed

Pittiglio, Claudia; Skidmore, Andrew K; van Gils, Hein A M J; McCall, Michael K; Prins, Herbert H T

2014-03-01

Crop-raiding elephants affect local livelihoods, undermining conservation efforts. Yet, crop-raiding patterns are poorly understood, making prediction and protection difficult. We hypothesized that raiding elephants use corridors between daytime refuges and farmland. Elephant counts, crop-raiding records, household surveys, Bayesian expert system, and least-cost path simulation were used to predict four alternative categories of daily corridors: (1) footpaths, (2) dry river beds, (3) stepping stones along scattered small farms, and (4) trajectories of shortest distance to refuges. The corridor alignments were compared in terms of their minimum cumulative resistance to elephant movement and related to crop-raiding zones quantified by a kernel density function. The "stepping stone" corridors predicted the crop-raiding patterns. Elephant presence was confirmed along these corridors, demonstrating that small farms located between refuges and contiguous farmland increase habitat connectivity for elephant. Our analysis successfully predicted elephant occurrence in farmland where daytime counts failed to detect nocturnal presence. These results have conservation management implications.

Dynamic multicast routing scheme in WDM optical network

NASA Astrophysics Data System (ADS)

Zhu, Yonghua; Dong, Zhiling; Yao, Hong; Yang, Jianyong; Liu, Yibin

2007-11-01

During the information era, the Internet and the service of World Wide Web develop rapidly. Therefore, the wider and wider bandwidth is required with the lower and lower cost. The demand of operation turns out to be diversified. Data, images, videos and other special transmission demands share the challenge and opportunity with the service providers. Simultaneously, the electrical equipment has approached their limit. So the optical communication based on the wavelength division multiplexing (WDM) and the optical cross-connects (OXCs) shows great potentials and brilliant future to build an optical network based on the unique technical advantage and multi-wavelength characteristic. In this paper, we propose a multi-layered graph model with inter-path between layers to solve the problem of multicast routing wavelength assignment (RWA) contemporarily by employing an efficient graph theoretic formulation. And at the same time, an efficient dynamic multicast algorithm named Distributed Message Copying Multicast (DMCM) mechanism is also proposed. The multicast tree with minimum hops can be constructed dynamically according to this proposed scheme.

[Reconstruction of urban land space based on minimum cumulative resistance model: a case study of Xintang Town, Guangzhou City].

PubMed

Zhong, Shi-Yu; Wu, Qing; Li, Yu; Cheng, Jin-Ping

2012-11-01

Based on the source-sink landscape theory and the principles of ecosystem services, the minimum cumulative resistance (MCR) model was modified, where the urban center construction land was taken as the expansion source, and the contribution rate of ecological land ecosystem services value was considered as the resistance coefficient. With the modified MCR, the urban spatial expansion process of Xintang Town, Guangzhou City was successfully simulated, and, based on the protection of ecological security pattern, the optimum path for reconstructing urban land space was put forward. The simulated urban spatial expansion short path in 1988-2008 was in accordance with the real situation. By the modified MCR, the urban space was divided into four zones of high, higher, medium, and low resistance, with the area of 80.84, 78.90, 24.26, and 61.88 km2, respectively. The expansion path of the urban space was along the route from low to medium and then to high resistance zones successively. The land suitable for eco-protection and construction had an area of 159.74 km2 and 86.14 km2, while the ecological conflict area (17.37 km2) was mainly located in higher and high resistance zones, being 10.38 and 6.99 km2, respectively. The modified MCR could not only effectively reflect the distribution area of urban land use and the conflict relationship between urban construction and ecological protection, but also reasonably judge the best developmental short path for urban spatial expansion.

Conception et analyse d'un systeme d'optimisation de plans de vol pour les avions

NASA Astrophysics Data System (ADS)

Maazoun, Wissem

The main objective of this thesis is to develop an optimization method for the preparation of flight plans for aircrafts. The flight plan minimizes all costs associated with the flight. We determine an optimal path for an airplane from a departure airport to a destination airport. The optimal path minimizes the sum of all costs, i.e. the cost of fuel added to the cost of time (wages, rental of the aircraft, arrival delays, etc.). The optimal trajectory is obtained by considering all possible trajectories on a 3D graph (longitude, latitude and altitude) where the altitude levels are separated by 2,000 feet, and by applying a shortest path algorithm. The main task was to accurately compute fuel consumption on each edge of the graph, making sure that each arc has a minimal cost and is covered in a realistic way from the point of view of control, i.e. in accordance with the rules of navigation. To compute the cost of an arc, we take into account weather conditions (temperature, pressure, wind components, etc.). The optimization of each arc is done via the evaluation of an optimum speed that takes all costs into account. Each arc of the graph typically includes several sub-phases of the flight, e.g. altitude change, speed change, and constant speed and altitude. In the initial climb and the final descent phases, the costs are determined by considering altitude changes at constant CAS (Calibrated Air Speed) or constant Mach number. CAS and Mach number are adjusted to minimize cost. The aerodynamic model used is the one proposed by Eurocontrol, which uses the BADA (Base of Aircraft Data) tables. This model is based on the total energy equation that determines the instantaneous fuel consumption. Calculations on each arc are done by solving a system of differential equations that systematically takes all costs into account. To compute the cost of an arc, we must know the time to go through it, which is generally unknown. To have well-posed boundary conditions, we use the horizontal displacement as the independent variable of the system of differential equations. We consider the velocity components of the wind in a 3D system of coordinates to compute the instantaneous ground speed of the aircraft. To consider the cost of time, we use the cost index. The cost of an arc depends on the aircraft mass at the beginning of this arc, and this mass depends on the path. As we consider all possible paths, the cost of an arc must be computed for each trajectory to which it belongs. For a long-distance flight, the number of arcs to be considered in the graph is large and therefore the cost of an arc is typically computed many times. Our algorithm computes the costs of one million arcs in seconds while having a high accuracy. The determination of the optimal trajectory can therefore be done in a short time. To get the optimal path, the mass of the aircraft at the departure point must also be optimal. It is therefore necessary to know the optimal amount of fuel for the journey. The aircraft mass is known only at the arrival point. This mass is the mass of the aircraft including passengers, cargo and reserve fuel mass. The optimal path is determined by calculating backwards, i.e. from the arrival point to the departure point. For the determination of the optimal trajectory, we use an elliptical grid that has focal points at the departure and arrival points. The use of this grid is essential for the construction of a direct and acyclic graph. We use the Bellman-Ford algorithm on a DAG to determine the shortest path. This algorithm is easy to implement and results in short computation times. Our algorithm computes an optimal trajectory with an optimal cost for each arc. Altitude changes are done optimally with respect to the mass of the aircraft and the cost of time. Our algorithm gives the mass, speed, altitude and total cost at any point of the trajectory as well as the optimal profiles of climb and descent. A prototype has been implemented in C. We made simulations of all types of possible arcs and of several complete trajectories to illustrate the behaviour of the algorithm.

Potential benefits of minimum unit pricing for alcohol versus a ban on below cost selling in England 2014: modelling study.

PubMed

Brennan, Alan; Meng, Yang; Holmes, John; Hill-McManus, Daniel; Meier, Petra S

2014-09-30

To evaluate the potential impact of two alcohol control policies under consideration in England: banning below cost selling of alcohol and minimum unit pricing. Modelling study using the Sheffield Alcohol Policy Model version 2.5. England 2014-15. Adults and young people aged 16 or more, including subgroups of moderate, hazardous, and harmful drinkers. Policy to ban below cost selling, which means that the selling price to consumers could not be lower than tax payable on the product, compared with policies of minimum unit pricing at £0.40 (€0.57; $0.75), 45 p, and 50 p per unit (7.9 g/10 mL) of pure alcohol. Changes in mean consumption in terms of units of alcohol, drinkers' expenditure, and reductions in deaths, illnesses, admissions to hospital, and quality adjusted life years. The proportion of the market affected is a key driver of impact, with just 0.7% of all units estimated to be sold below the duty plus value added tax threshold implied by a ban on below cost selling, compared with 23.2% of units for a 45 p minimum unit price. Below cost selling is estimated to reduce harmful drinkers' mean annual consumption by just 0.08%, around 3 units per year, compared with 3.7% or 137 units per year for a 45 p minimum unit price (an approximately 45 times greater effect). The ban on below cost selling has a small effect on population health-saving an estimated 14 deaths and 500 admissions to hospital per annum. In contrast, a 45 p minimum unit price is estimated to save 624 deaths and 23,700 hospital admissions. Most of the harm reductions (for example, 89% of estimated deaths saved per annum) are estimated to occur in the 5.3% of people who are harmful drinkers. The ban on below cost selling, implemented in the England in May 2014, is estimated to have small effects on consumption and health harm. The previously announced policy of a minimum unit price, if set at expected levels between 40 p and 50 p per unit, is estimated to have an approximately 40-50 times greater effect. © Brennan et al 2014.

Potential benefits of minimum unit pricing for alcohol versus a ban on below cost selling in England 2014: modelling study

PubMed Central

Meng, Yang; Holmes, John; Hill-McManus, Daniel; Meier, Petra S

2014-01-01

Objective To evaluate the potential impact of two alcohol control policies under consideration in England: banning below cost selling of alcohol and minimum unit pricing. Design Modelling study using the Sheffield Alcohol Policy Model version 2.5. Setting England 2014-15. Population Adults and young people aged 16 or more, including subgroups of moderate, hazardous, and harmful drinkers. Interventions Policy to ban below cost selling, which means that the selling price to consumers could not be lower than tax payable on the product, compared with policies of minimum unit pricing at £0.40 (€0.57; $0.75), 45p, and 50p per unit (7.9 g/10 mL) of pure alcohol. Main outcome measures Changes in mean consumption in terms of units of alcohol, drinkers’ expenditure, and reductions in deaths, illnesses, admissions to hospital, and quality adjusted life years. Results The proportion of the market affected is a key driver of impact, with just 0.7% of all units estimated to be sold below the duty plus value added tax threshold implied by a ban on below cost selling, compared with 23.2% of units for a 45p minimum unit price. Below cost selling is estimated to reduce harmful drinkers’ mean annual consumption by just 0.08%, around 3 units per year, compared with 3.7% or 137 units per year for a 45p minimum unit price (an approximately 45 times greater effect). The ban on below cost selling has a small effect on population health—saving an estimated 14 deaths and 500 admissions to hospital per annum. In contrast, a 45p minimum unit price is estimated to save 624 deaths and 23 700 hospital admissions. Most of the harm reductions (for example, 89% of estimated deaths saved per annum) are estimated to occur in the 5.3% of people who are harmful drinkers. Conclusions The ban on below cost selling, implemented in the England in May 2014, is estimated to have small effects on consumption and health harm. The previously announced policy of a minimum unit price, if set at expected levels between 40p and 50p per unit, is estimated to have an approximately 40-50 times greater effect. PMID:25270743

Shuttle payload minimum cost vibroacoustic tests

NASA Technical Reports Server (NTRS)

Stahle, C. V.; Gongloff, H. R.; Young, J. P.; Keegan, W. B.

1977-01-01

This paper is directed toward the development of the methodology needed to evaluate cost effective vibroacoustic test plans for Shuttle Spacelab payloads. Statistical decision theory is used to quantitatively evaluate seven alternate test plans by deriving optimum test levels and the expected cost for each multiple mission payload considered. The results indicate that minimum costs can vary by as much as $6 million for the various test plans. The lowest cost approach eliminates component testing and maintains flight vibration reliability by performing subassembly tests at a relatively high acoustic level. Test plans using system testing or combinations of component and assembly level testing are attractive alternatives. Component testing alone is shown not to be cost effective.

An economic analysis of selected strategies for dissolved-oxygen management; Chattahoochee River, Georgia

USGS Publications Warehouse

Schefter, John E.; Hirsch, Robert M.

1980-01-01

A method for evaluating the cost-effectiveness of alternative strategies for dissolved-oxygen (DO) management is demonstrated, using the Chattahoochee River, GA., as an example. The conceptual framework for the analysis is suggested by the economic theory of production. The minimum flow of the river and the percentage of the total waste inflow receiving nitrification are considered to be two variable inputs to be used in the production of given minimum concentration of DO in the river. Each of the inputs has a cost: the loss of dependable peak hydroelectric generating capacity at Buford Dam associated with flow augmentation and the cost associated with nitrification of wastes. The least-cost combination of minimum flow and waste treatment necessary to achieve a prescribed minimum DO concentration is identified. Results of the study indicate that, in some instances, the waste-assimilation capacity of the Chattahoochee River can be substituted for increased waste treatment; the associated savings in waste-treatment costs more than offset the benefits foregone because of the loss of peak generating capacity at Buford Dam. The sensitivity of the results to the estimates of the cost of replacing peak generating capacity is examined. It is also demonstrated that a flexible approach to the management of DO in the Chattahoochee River may be much more cost effective than a more rigid, institutional approach wherein constraints are placed on the flow of the river and(or) on waste-treatment practices. (USGS)

Optimum swimming pathways of fish spawning migrations in rivers

USGS Publications Warehouse

McElroy, Brandon; DeLonay, Aaron; Jacobson, Robert

2012-01-01

Fishes that swim upstream in rivers to spawn must navigate complex fluvial velocity fields to arrive at their ultimate locations. One hypothesis with substantial implications is that fish traverse pathways that minimize their energy expenditure during migration. Here we present the methodological and theoretical developments necessary to test this and similar hypotheses. First, a cost function is derived for upstream migration that relates work done by a fish to swimming drag. The energetic cost scales with the cube of a fish's relative velocity integrated along its path. By normalizing to the energy requirements of holding a position in the slowest waters at the path's origin, a cost function is derived that depends only on the physical environment and not on specifics of individual fish. Then, as an example, we demonstrate the analysis of a migration pathway of a telemetrically tracked pallid sturgeon (Scaphirhynchus albus) in the Missouri River (USA). The actual pathway cost is lower than 105 random paths through the surveyed reach and is consistent with the optimization hypothesis. The implication—subject to more extensive validation—is that reproductive success in managed rivers could be increased through manipulation of reservoir releases or channel morphology to increase abundance of lower-cost migration pathways.

47 CFR 27.1164 - The cost-sharing formula.

Code of Federal Regulations, 2010 CFR

2010-10-01

... control equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs; site acquisition and civil works; zoning costs; training; disposal of old equipment; test equipment... a replacement system, such as equipment and engineering expenses. C may not exceed $250,000 per...

Path coloring on the Mesh

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

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

47 CFR 27.1180 - The cost-sharing formula.

Code of Federal Regulations, 2013 CFR

2013-10-01

... § 27.1180 The cost-sharing formula. (a) An AWS licensee that relocates a BRS system with which it... forth in paragraph (b) of this section. (b) C is the actual cost of relocating the system, and includes... equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs; site...

Advanced electric propulsion system concept for electric vehicles. Addendum 1: Voltage considerations

NASA Technical Reports Server (NTRS)

Raynard, A. E.; Forbes, F. E.

1980-01-01

The two electric vehicle propulsion systems that best met cost and performance goals were examined to assess the effect of battery pack voltage on system performance and cost. A voltage range of 54 to 540 V was considered for a typical battery pack capacity of 24 k W-hr. The highest battery specific energy (W-hr/kg) and the lowest cost ($/kW-hr) were obtained at the minimum voltage level. The flywheel system traction motor is a dc, mechanically commutated with shunt field control, and due to the flywheel the traction motor and the battery are not subject to extreme peaks of power demand. The basic system uses a permanent-magnet motor with electronic commutation supplied by an ac power control unit. In both systems battery cost were the major factor in system voltage selection, and a battery pack with the minimum voltage of 54 V produced the lowest life-cycle cost. The minimum life-cycle cost for the basic system with lead-acid batteries was $0.057/km and for the flywheel system was $0.037/km.

Research on configuration of railway self-equipped tanker based on minimum cost maximum flow model

NASA Astrophysics Data System (ADS)

Yang, Yuefang; Gan, Chunhui; Shen, Tingting

2017-05-01

In the study of the configuration of the tanker of chemical logistics park, the minimum cost maximum flow model is adopted. Firstly, the transport capacity of the park loading and unloading area and the transportation demand of the dangerous goods are taken as the constraint condition of the model; then the transport arc capacity, the transport arc flow and the transport arc edge weight are determined in the transportation network diagram; finally, the software calculations. The calculation results show that the configuration issue of the tankers can be effectively solved by the minimum cost maximum flow model, which has theoretical and practical application value for tanker management of railway transportation of dangerous goods in the chemical logistics park.

Radiant energy receiver having improved coolant flow control means

DOEpatents

Hinterberger, H.

1980-10-29

An improved coolant flow control for use in radiant energy receivers of the type having parallel flow paths is disclosed. A coolant performs as a temperature dependent valve means, increasing flow in the warmer flow paths of the receiver, and impeding flow in the cooler paths of the receiver. The coolant has a negative temperature coefficient of viscosity which is high enough such that only an insignificant flow through the receiver is experienced at the minimum operating temperature of the receiver, and such that a maximum flow is experienced at the maximum operating temperature of the receiver. The valving is accomplished by changes in viscosity of the coolant in response to the coolant being heated and cooled. No remotely operated valves, comparators or the like are needed.

Reaction path of energetic materials using THOR code

NASA Astrophysics Data System (ADS)

Durães, L.; Campos, J.; Portugal, A.

1998-07-01

The method of predicting reaction path, using THOR code, allows for isobar and isochor adiabatic combustion and CJ detonation regimes, the calculation of the composition and thermodynamic properties of reaction products of energetic materials. THOR code assumes the thermodynamic equilibria of all possible products, for the minimum Gibbs free energy, using HL EoS. The code allows the possibility of estimating various sets of reaction products, obtained successively by the decomposition of the original reacting compound, as a function of the released energy. Two case studies of thermal decomposition procedure were selected, calculated and discussed—pure Ammonium Nitrate and its based explosive ANFO, and Nitromethane—because their equivalence ratio is respectively lower, near and greater than the stoicheiometry. Predictions of reaction path are in good correlation with experimental values, proving the validity of proposed method.

Improved Efficient Routing Strategy on Scale-Free Networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

Improvements of the Ray-Tracing Based Method Calculating Hypocentral Loci for Earthquake Location

NASA Astrophysics Data System (ADS)

Zhao, A. H.

2014-12-01

Hypocentral loci are very useful to reliable and visual earthquake location. However, they can hardly be analytically expressed when the velocity model is complex. One of methods numerically calculating them is based on a minimum traveltime tree algorithm for tracing rays: a focal locus is represented in terms of ray paths in its residual field from the minimum point (namely initial point) to low residual points (referred as reference points of the focal locus). The method has no restrictions on the complexity of the velocity model but still lacks the ability of correctly dealing with multi-segment loci. Additionally, it is rather laborious to set calculation parameters for obtaining loci with satisfying completeness and fineness. In this study, we improve the ray-tracing based numerical method to overcome its advantages. (1) Reference points of a hypocentral locus are selected from nodes of the model cells that it goes through, by means of a so-called peeling method. (2) The calculation domain of a hypocentral locus is defined as such a low residual area that its connected regions each include one segment of the locus and hence all the focal locus segments are respectively calculated with the minimum traveltime tree algorithm for tracing rays by repeatedly assigning the minimum residual reference point among those that have not been traced as an initial point. (3) Short ray paths without branching are removed to make the calculated locus finer. Numerical tests show that the improved method becomes capable of efficiently calculating complete and fine hypocentral loci of earthquakes in a complex model.

Path to Market for Compact Modular Fusion Power Cores

NASA Astrophysics Data System (ADS)

Woodruff, Simon; Baerny, Jennifer K.; Mattor, Nathan; Stoulil, Don; Miller, Ronald; Marston, Theodore

2012-08-01

The benefits of an energy source whose reactants are plentiful and whose products are benign is hard to measure, but at no time in history has this energy source been more needed. Nuclear fusion continues to promise to be this energy source. However, the path to market for fusion systems is still regularly a matter for long-term (20 + year) plans. This white paper is intended to stimulate discussion of faster commercialization paths, distilling guidance from investors, utilities, and the wider energy research community (including from ARPA-E). There is great interest in a small modular fusion system that can be developed quickly and inexpensively. A simple model shows how compact modular fusion can produce a low cost development path by optimizing traditional systems that burn deuterium and tritium, operating not only at high magnetic field strength, but also by omitting some components that allow for the core to become more compact and easier to maintain. The dominant hurdles to the development of low cost, practical fusion systems are discussed, primarily in terms of the constraints placed on the cost of development stages in the private sector. The main finding presented here is that the bridge from DOE Office of Science to the energy market can come at the Proof of Principle development stage, providing the concept is sufficiently compact and inexpensive that its development allows for a normal technology commercialization path.

Employment Effects of Minimum and Subminimum Wages. Recent Evidence.

ERIC Educational Resources Information Center

Neumark, David

Using a specially constructed panel data set on state minimum wage laws and labor market conditions, Neumark and Wascher (1992) presented evidence that countered the claim that minimum wages could be raised with no cost to employment. They concluded that estimates indicating that minimum wages reduced employment on the order of 1-2 percent for a…

Simulation Of Research And Development Projects

NASA Technical Reports Server (NTRS)

Miles, Ralph F.

1987-01-01

Measures of preference for alternative project plans calculated. Simulation of Research and Development Projects (SIMRAND) program aids in optimal allocation of research and development resources needed to achieve project goals. Models system subsets or project tasks as various network paths to final goal. Each path described in terms of such task variables as cost per hour, cost per unit, and availability of resources. Uncertainty incorporated by treating task variables as probabilistic random variables. Written in Microsoft FORTRAN 77.

Military Occupational Speciality Training Cost Handbook (MOSB)

DTIC Science & Technology

1983-10-01

FINANCE & ACCOUNTING CENTER "JUN 1 i 184’, l APPROVED:_ . A " W. M. ALLENi T - DIRECTOR OF COST ANALYSIS _ "OFFICE OF THE COMPTROLLER OF THE ARMYj 84 04 16 ...COVERED j14. DATE OF REPORT (Yr.. Alo.. Day) 15 AE COUNT 16 . SUPPLEMENTARY NOTAOMION IFROM TO 83/10 43o Supersedes Volumes I and II, MOSB, dated 81... depreciation of equipment, minimum consumption of utilities, pay of minimum grounds staff, etc. Of course, per capita fixed cost will rise with a decreasing

Communication networks, soap films and vectors

NASA Astrophysics Data System (ADS)

Clark, R. C.

1981-01-01

The problem of constructing the least-cost network of connections between arbitrarily placed points is one that is common and which can be very important financially. The network may consist of motorways between towns, a grid of electric power lines, buried gas or oil pipe lines or telephone cables. Soap films trapped between parallel planes with vertical pins between them provide a 'shortest path' network and Isenberg (1975) has suggested that soap films of this sort be used to model communication networks. However soap films are unable to simulate the different costs of laying, say, a three-lane motorway instead of a two-lane one or of using a larger pipeline to take the flow from two smaller ones. Soap films, however, have considerable intrinsic interest. In the article the emphasis is on the use of soap films and communication networks as a practical means of illustrating the importance of vector and matrix methods in geometry. The power of vector methods is illustrated by the fact that given any soap film network the total length of the film can be written down by inspection if the vector positions of the pins are known. It is also possible to predict the boundaries at which 'catastrophes' occur and to decide which network has the least total length. In the field of communication networks a method is given of designing the minimum cost network linking, say, a number of oilwells, which produce at different rates to an outlet terminal.

30 CFR 7.98 - Technical requirements.

Code of Federal Regulations, 2014 CFR

2014-07-01

... the manufacturing process to not more than 250 microinches. (ii) A means shall be provided to ensure...) The minimum thread engagement of fastenings shall be equal to or greater than the nominal diameter of... flame-arresting path shall be finished during the manufacturing process to not more than 250 microinches...

30 CFR 7.98 - Technical requirements.

Code of Federal Regulations, 2013 CFR

2013-07-01

... the manufacturing process to not more than 250 microinches. (ii) A means shall be provided to ensure...) The minimum thread engagement of fastenings shall be equal to or greater than the nominal diameter of... flame-arresting path shall be finished during the manufacturing process to not more than 250 microinches...

30 CFR 7.98 - Technical requirements.

Code of Federal Regulations, 2012 CFR

2012-07-01

... the manufacturing process to not more than 250 microinches. (ii) A means shall be provided to ensure...) The minimum thread engagement of fastenings shall be equal to or greater than the nominal diameter of... flame-arresting path shall be finished during the manufacturing process to not more than 250 microinches...

Soft Paths: How To Enjoy the Wilderness without Harming It.

ERIC Educational Resources Information Center

Hampton, Bruce; Cole, David

This outdoor-education book describes methods of hiking and camping that minimize the human impact upon the natural environment. Each chapter offers the rationale behind recommended practices, based on the best scientific research on recreational impact. The first chapter, "The Case for Minimum Impact," describes increasing tourist use…

Effects of Scene-Linked Symbology on Flight Performance

DOT National Transportation Integrated Search

1997-01-01

Previous research has shown that the presence of aircraft head-up display (HUD) : symbology indicating altitude improves maintenance of altitude, but at a cost : to (ground) path-following ability. We term this the altitude/path performance : trade-o...

Quadratic String Method for Locating Instantons in Tunneling Splitting Calculations.

PubMed

Cvitaš, Marko T

2018-03-13

The ring-polymer instanton (RPI) method is an efficient technique for calculating approximate tunneling splittings in high-dimensional molecular systems. In the RPI method, tunneling splitting is evaluated from the properties of the minimum action path (MAP) connecting the symmetric wells, whereby the extensive sampling of the full potential energy surface of the exact quantum-dynamics methods is avoided. Nevertheless, the search for the MAP is usually the most time-consuming step in the standard numerical procedures. Recently, nudged elastic band (NEB) and string methods, originaly developed for locating minimum energy paths (MEPs), were adapted for the purpose of MAP finding with great efficiency gains [ J. Chem. Theory Comput. 2016 , 12 , 787 ]. In this work, we develop a new quadratic string method for locating instantons. The Euclidean action is minimized by propagating the initial guess (a path connecting two wells) over the quadratic potential energy surface approximated by means of updated Hessians. This allows the algorithm to take many minimization steps between the potential/gradient calls with further reductions in the computational effort, exploiting the smoothness of potential energy surface. The approach is general, as it uses Cartesian coordinates, and widely applicable, with computational effort of finding the instanton usually lower than that of determining the MEP. It can be combined with expensive potential energy surfaces or on-the-fly electronic-structure methods to explore a wide variety of molecular systems.

Power dissipation in the mixed metal-insulator state of self-heated VO2 single crystals and the effect of sliding domains

NASA Astrophysics Data System (ADS)

Fisher, B.; Patlagan, L.

2018-06-01

The mixed metal-insulator state in VO2 sets on within the current-controlled negative differential resistivity regime of I-V loops traced at ambient temperature. In this state, the stability of I(V) and/or spontaneous switching between initial and final steady states are governed by the load resistance RL in series with the sample. With increasing current (decreasing voltage), the power P = IV reaches a maximum (Pmax) and drops to a minimum (Pmin) along a path that depends on RL. For low enough RL, the ratio Pmax/Pmin may exceed by far the contrast in thermal emissivity from films of VO2 over the metal-insulator transition as reported in Kats et al. [Phys. Rev. X 3, 041004 (2013)]. The minimum is followed by a range of currents where the power increases with current. The return path overlaps the original path and continues towards backward switching. For a few samples, there is evidence from optical microscopy that the portion of the P(I) loop between Pmin and backward switching coincides with the range of currents where semiconducting domains slide within a metallic background. Damage induced in crystals by repeated I-V cycling suppresses domain sliding and flattens P(I) in the respective range of currents. This is consistent with the current dependent excess power dissipation being induced by the sliding domains.

On the Path to SunShot. Emerging Issues and Challenges in Integrating Solar with the Distribution System

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

Palmintier, Bryan; Broderick, Robert; Mather, Barry

2016-05-01

This report analyzes distribution-integration challenges, solutions, and research needs in the context of distributed generation from PV (DGPV) deployment to date and the much higher levels of deployment expected with achievement of the U.S. Department of Energy's SunShot targets. Recent analyses have improved estimates of the DGPV hosting capacities of distribution systems. This report uses these results to statistically estimate the minimum DGPV hosting capacity for the contiguous United States using traditional inverters of approximately 170 GW without distribution system modifications. This hosting capacity roughly doubles if advanced inverters are used to manage local voltage and additional minor, low-cost changesmore » could further increase these levels substantially. Key to achieving these deployment levels at minimum cost is siting DGPV based on local hosting capacities, suggesting opportunities for regulatory, incentive, and interconnection innovation. Already, pre-computed hosting capacity is beginning to expedite DGPV interconnection requests and installations in select regions; however, realizing SunShot-scale deployment will require further improvements to DGPV interconnection processes, standards and codes, and compensation mechanisms so they embrace the contributions of DGPV to system-wide operations. SunShot-scale DGPV deployment will also require unprecedented coordination of the distribution and transmission systems. This includes harnessing DGPV's ability to relieve congestion and reduce system losses by generating closer to loads; minimizing system operating costs and reserve deployments through improved DGPV visibility; developing communication and control architectures that incorporate DGPV into system operations; providing frequency response, transient stability, and synthesized inertia with DGPV in the event of large-scale system disturbances; and potentially managing reactive power requirements due to large-scale deployment of advanced inverter functions. Finally, additional local and system-level value could be provided by integrating DGPV with energy storage and 'virtual storage,' which exploits improved management of electric vehicle charging, building energy systems, and other large loads. Together, continued innovation across this rich distribution landscape can enable the very-high deployment levels envisioned by SunShot.« less

47 CFR 27.1180 - The cost-sharing formula.

Code of Federal Regulations, 2010 CFR

2010-10-01

...); towers and/or modifications; back-up power equipment; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC filing costs; site acquisition and civil works... as equipment and engineering expenses. There is no cap on the actual costs of relocation. (c) An AWS...

Air Vehicle Path Planning

DTIC Science & Technology

2001-12-13

6-18 6.13. Apollonius Circle for the Case of Two Unequal Power Radars . . . 6-20 6.14. Solution Triangle...Voronoi edge is an Apollonius circle [32, 19]. In this section, we are concerned with the optimality of the Voronoi path for the two radar exposure...Comparison of Cost vs. Path Length for Constrained Trajectories Around and Between Two Radars 6-18 from the two radars is an Apollonius circle

Optimum Pathways of Fish Spawning Migrations in Rivers

NASA Astrophysics Data System (ADS)

McElroy, B. J.; Jacobson, R. B.; Delonay, A.

2010-12-01

Many fish species migrate large distances upstream in rivers to spawn. These migrations require energetic expenditures that are inversely related to fecundity of spawners. Here we present the theory necessary to quantify relative energetic requirements of upstream migration pathways and then test the hypothesis that least-cost paths are taken by the federally endangered pallid sturgeon (Scaphyrhyncus Albus), a benthic rheophile, in the lower Missouri River, USA. Total work done by a fish through a migratory path is proportional to the size of the fish, the total drag on the fish, and the distance traversed. Normalizing by the work required to remain stationary at the beginning of a path, relative work expenditure at each point of the path is found to be the cube of the ratio of the velocity along the path to the velocity at the start of the path. This is the velocity of the fish relative to the river flow. A least-cost migratory pathway can be determined from the velocity field in a reach as the path that minimizes a fish's relative work expenditure. We combine location data from pallid sturgeon implanted with telemetric tags and pressure-sensitive data storage tags with depth and velocity data collected with an acoustic Doppler profiler. During spring 2010 individual sturgeon were closely followed as they migrated up the Missouri River to spawn. These show that, within a small margin, pallid sturgeon in the lower Missouri River select least-cost paths as they swim upstream (typical velocities near 1.0 - 1.2 m/s). Within the range of collected data, it is also seen that many alternative paths not selected for migration are two orders of magnitude more energetically expensive (typical velocities near 2.0 - 2.5 m/s). In general these sturgeon migrated along the inner banks of bends avoiding high velocities in the thalweg, crossing the channel where the thalweg crosses in the opposite direction in order to proceed up the inner bank of subsequent bends. Overall, these results suggest a management strategy for increasing fecundity and reproductive success could be to manage flows to lower levels during prespawn migrations thereby decreasing expenditure necessary to reach spawning sites.

Parametric Investigation on the Use of Lateral and Logitudinal Rotor Trim Flapping for Tiltrotor Noise Reduction

NASA Technical Reports Server (NTRS)

Malpica, Carlos

2017-01-01

This paper presents an acoustics parametric study of the effect of varying lateral and longitudinal rotor trim flapping angles (tip-path-plane tilt) on noise radiated by an isolated 26-ft diameter proprotor, similar to that of the AW609 tiltrotor, in edgewise flight. Three tip-path-plane angle of attack operating conditions of -9, 0 and 6 deg, at 80 knots, were investigated. Results showed that: 1) minimum noise was attained for the tip-path-plane angle of attack value of -9 deg, and 2) changing the cyclic trim state (i.e., controls) altered the airloads and produced noticeable changes to the low-frequency (LF) and blade-vortex interaction (BVI) radiated-noise magnitude and directionality. In particular, by trimming the rotor to a positive (inboard) lateral flapping angle of 4 deg, further reductions up to 3 dB in the low-frequency noise sound pressure level were attained without significantly impacting the BVI noise for longitudinal tip-path-plane angles of -9 and 6 deg.

Path integral learning of multidimensional movement trajectories

NASA Astrophysics Data System (ADS)

André, João; Santos, Cristina; Costa, Lino

2013-10-01

This paper explores the use of Path Integral Methods, particularly several variants of the recent Path Integral Policy Improvement (PI2) algorithm in multidimensional movement parametrized policy learning. We rely on Dynamic Movement Primitives (DMPs) to codify discrete and rhythmic trajectories, and apply the PI2-CMA and PIBB methods in the learning of optimal policy parameters, according to different cost functions that inherently encode movement objectives. Additionally we merge both of these variants and propose the PIBB-CMA algorithm, comparing all of them with the vanilla version of PI2. From the obtained results we conclude that PIBB-CMA surpasses all other methods in terms of convergence speed and iterative final cost, which leads to an increased interest in its application to more complex robotic problems.

Daytime midlatitude D region parameters at solar minimum from short-path VLF phase and amplitude

NASA Astrophysics Data System (ADS)

Thomson, Neil R.; Clilverd, Mark A.; Rodger, Craig J.

2011-03-01

Observed phases and amplitudes of VLF radio signals propagating on a short (˜360 km) path are used to find improved parameters for the lowest edge of the (D region of the) Earth's ionosphere at a geomagnetic latitude of ˜53.5° in midsummer near solar minimum. The phases, relative to GPS 1 s pulses, and the amplitudes were measured both near (˜110 km from) the transmitter, where the direct ground wave is very dominant, and at distances of ˜360 km near where the ionospherically reflected waves form a (modal) minimum with the (direct) ground wave. The signals came from the 24.0 kHz transmitter, NAA, on the coast of Maine near the U.S.-Canada border, propagating ˜360 km E-NE, mainly over the sea, to Saint John and Prince Edward Island. The bottom edge of the midday, midsummer, ionosphere at ˜53.5° geomagnetic latitude was thus found to be well modeled by H' = 71.8 ± 0.6 km and β = 0.335 ± 0.025 km-1 where H' and β are Wait's traditional height and sharpness parameters used by the U.S. Navy in their Earth-ionosphere VLF radio waveguide programs. The variation of β with latitude is also estimated with the aid of interpolation using measured galactic cosmic ray fluxes.

Molecular mechanism of direct proflavine-DNA intercalation: evidence for drug-induced minimum base-stacking penalty pathway.

PubMed

Sasikala, Wilbee D; Mukherjee, Arnab

2012-10-11

DNA intercalation, a biophysical process of enormous clinical significance, has surprisingly eluded molecular understanding for several decades. With appropriate configurational restraint (to prevent dissociation) in all-atom metadynamics simulations, we capture the free energy surface of direct intercalation from minor groove-bound state for the first time using an anticancer agent proflavine. Mechanism along the minimum free energy path reveals that intercalation happens through a minimum base stacking penalty pathway where nonstacking parameters (Twist→Slide/Shift) change first, followed by base stacking parameters (Buckle/Roll→Rise). This mechanism defies the natural fluctuation hypothesis and provides molecular evidence for the drug-induced cavity formation hypothesis. The thermodynamic origin of the barrier is found to be a combination of entropy and desolvation energy.

Mixed quantum-classical studies of energy partitioning in unimolecular chemical reactions

NASA Astrophysics Data System (ADS)

Bladow, Landon Lowell

A mixed quantum-classical reaction path Hamiltonian method is utilized to study the dynamics of unimolecular reactions. The method treats motion along the reaction path classically and treats the transverse vibrations quantum mechanically. The theory leads to equations that predict the disposai of the exit-channel potential energy to product translation and vibration. In addition, vibrational state distributions are obtained for the product normal modes. Vibrational excitation results from the curvature of the minimum energy reaction path. The method is applied to six unimolecular reactions: HF elimination from fluoroethane, 1,1-difluoroethane, 1,1-difluoroethene, and trifluoromethane; and HCl elimination from chloroethane and acetyl chloride. The minimum energy paths were calculated at either the MP2 or B3LYP level of theory. In all cases, the majority of the vibrational excitation of the products occurs in the HX fragment. The results are compared to experimental data and other theoretical results, where available. The best agreement between the experimental and calculated HX vibrational distributions is found for the halogenated ethanes, and the experimental deduction that the majority of the HX vibrational excitation arises from the potential energy release is supported. It is believed that the excess energy provided in experiments contributes to the poorer agreement between experiment and theory observed for HF elimination from 1,1-difluoroethene and trifluoromethane. An attempt is described to incorporate a treatment of the excess energy into the present method. However, the sign of the curvature coupling elements is then found to affect the dynamics. Overall, the method appears to be an efficient dynamical tool for modeling the disposal of the exit-channel potential energy in unimolecular reactions.

What is a Dune: Developing AN Automated Approach to Extracting Dunes from Digital Elevation Models

NASA Astrophysics Data System (ADS)

Taylor, H.; DeCuir, C.; Wernette, P. A.; Taube, C.; Eyler, R.; Thopson, S.

2016-12-01

Coastal dunes can absorb storm surge and mitigate inland erosion caused by elevated water levels during a storm. In order to understand how a dune responds to and recovers from a storm, it is important that we can first identify and differentiate the beach and dune from the rest of the landscape. Current literature does not provide a consistent definition of what the dune features (e.g. dune toe, dune crest) are or how they can be extracted. The purpose of this research is to develop enhanced approaches to extracting dunes from a digital elevation model (DEM). Manual delineation, convergence index, least-cost path, relative relief, and vegetation abundance were compared and contrasted on a small area of Padre Island National Seashore (PAIS), Preliminary results indicate that the method used to extract the dune greatly affects our interpretation of how the dune changes. The manual delineation method was time intensive and subjective, while the convergence index approach was useful to easily identify the dune crest through maximum and minimum values. The least-cost path method proved to be time intensive due to data clipping; however, this approach resulted in continuous geomorphic landscape features (e.g. dune toe, dune crest). While the relative relief approach shows the most features in multi resolution, it is difficult to assess the accuracy of the extracted features because extracted features appear as points that can vary widely in their location from one meter to the next. The vegetation approach was greatly impacted by the seasonal and annual fluctuations of growth but is advantageous in historical change studies because it can be used to extract consistent dune formation from historical aerial imagery. Improving our ability to more accurately assess dune response and recovery to a storm will enable coastal managers to more accurately predict how dunes may respond to future climate change scenarios.

Hierarchical Motion Planning for Autonomous Aerial and Terrestrial Vehicles

NASA Astrophysics Data System (ADS)

Cowlagi, Raghvendra V.

Autonomous mobile robots---both aerial and terrestrial vehicles---have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of the vehicular task requirements, which requires tools from combinatorics and/or formal methods, and (2) design of the vehicle control laws, which requires tools from dynamical systems and control theory. Accordingly, this problem is usually decomposed and solved over two levels of hierarchy. The higher level, called the geometric path planning level, finds a geometric path that satisfies the vehicular task requirements, e.g., obstacle avoidance. The lower level, called the trajectory planning level, involves sufficient smoothening of this geometric path followed by a suitable time parametrization to obtain a reference trajectory for the vehicle. Although simple and efficient, such hierarchical decomposition suffers a serious drawback: the geometric path planner has no information of the kinematical and dynamical constraints of the vehicle. Consequently, the geometric planner may produce paths that the trajectory planner cannot transform into a feasible reference trajectory. Two main ideas appear in the literature to remedy this problem: (a) randomized sampling-based planning, which eliminates the geometric planner altogether by planning in the vehicle state space, and (b) geometric planning supported by feedback control laws. The former class of methods suffer from a lack of optimality of the resultant trajectory, while the latter class of methods makes a restrictive assumption concerning the vehicle kinematical model. We propose a hierarchical motion planning framework based on a novel mode of interaction between these two levels of planning. This interaction rests on the solution of a special shortest-path problem on graphs, namely, one using costs defined on multiple edge transitions in the path instead of the usual single edge transition costs. These costs are provided by a local trajectory generation algorithm, which we implement using model predictive control and the concept of effective target sets for simplifying the non-convex constraints involved in the problem. The proposed motion planner ensures "consistency" between the two levels of planning, i.e., a guarantee that the higher level geometric path is always associated with a kinematically and dynamically feasible trajectory. The main contributions of this thesis are: 1. A motion planning framework based on history-dependent costs (H-costs) in cell decomposition graphs for incorporating vehicle dynamical constraints: this framework offers distinct advantages in comparison with the competing approaches of discretization of the state space, of randomized sampling-based motion planning, and of local feedback-based, decoupled hierarchical motion planning, 2. An efficient and flexible algorithm for finding optimal H-cost paths, 3. A precise and general formulation of a local trajectory problem (the tile motion planning problem) that allows independent development of the discrete planner and the trajectory planner, while maintaining "compatibility" between the two planners, 4. A local trajectory generation algorithm using mpc, and the application of the concept of effective target sets for a significant simplification of the local trajectory generation problem, 5. The geometric analysis of curvature-bounded traversal of rectangular channels, leading to less conservative results in comparison with a result reported in the literature, and also to the efficient construction of effective target sets for the solution of the tile motion planning problem, 6. A wavelet-based multi-resolution path planning scheme, and a proof of completeness of the proposed scheme: such proofs are altogether absent from other works on multi-resolution path planning, 7. A technique for extracting all information about cells---namely, the locations, the sizes, and the associated image intensities---directly from the set of significant detail coefficients considered for path planning at a given iteration, and 8. The extension of the multi-resolution path planning scheme to include vehicle dynamical constraints using the aforementioned history-dependent costs approach. The future work includes an implementation of the proposed framework involving a discrete planner that solves classical planning problems more general than the single-query path planning problem considered thus far, and involving trajectory generation schemes for realistic vehicle dynamical models such as the bicycle model.

DISPOSITION PATHS FOR ROCKY FLATS GLOVEBOXES: EVALUATING OPTIONS

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

Lobdell, D.; Geimer, R.; Larsen, P.

2003-02-27

The Kaiser-Hill Company, LLC has the responsibility for closure activities at the Rocky Flats Environmental Technology Site (RFETS). One of the challenges faced for closure is the disposition of radiologically contaminated gloveboxes. Evaluation of the disposition options for gloveboxes included a detailed analysis of available treatment capabilities, disposal facilities, and lifecycle costs. The Kaiser-Hill Company, LLC followed several processes in determining how the gloveboxes would be managed for disposition. Currently, multiple disposition paths have been chosen to accommodate the needs of the varying styles and conditions of the gloveboxes, meet the needs of the decommissioning team, and to best managemore » lifecycle costs. Several challenges associated with developing a disposition path that addresses both the radiological and RCRA concerns as well as offering the most cost-effective solution were encountered. These challenges included meeting the radiological waste acceptance criteria of available disposal facilities, making a RCRA determination, evaluating treatment options and costs, addressing void requirements associated with disposal, and identifying packaging and transportation options. The varying disposal facility requirements affected disposition choices. Facility conditions that impacted decisions included radiological and chemical waste acceptance criteria, physical requirements, and measurement for payment options. The facility requirements also impacted onsite activities including management strategies, decontamination activities, and life-cycle cost.« less

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

Dumbser, Michael, E-mail: michael.dumbser@unitn.it; Balsara, Dinshaw S., E-mail: dbalsara@nd.edu

In this paper a new, simple and universal formulation of the HLLEM Riemann solver (RS) is proposed that works for general conservative and non-conservative systems of hyperbolic equations. For non-conservative PDE, a path-conservative formulation of the HLLEM RS is presented for the first time in this paper. The HLLEM Riemann solver is built on top of a novel and very robust path-conservative HLL method. It thus naturally inherits the positivity properties and the entropy enforcement of the underlying HLL scheme. However, with just the slight additional cost of evaluating eigenvectors and eigenvalues of intermediate characteristic fields, we can represent linearlymore » degenerate intermediate waves with a minimum of smearing. For conservative systems, our paper provides the easiest and most seamless path for taking a pre-existing HLL RS and quickly and effortlessly converting it to a RS that provides improved results, comparable with those of an HLLC, HLLD, Osher or Roe-type RS. This is done with minimal additional computational complexity, making our variant of the HLLEM RS also a very fast RS that can accurately represent linearly degenerate discontinuities. Our present HLLEM RS also transparently extends these advantages to non-conservative systems. For shallow water-type systems, the resulting method is proven to be well-balanced. Several test problems are presented for shallow water-type equations and two-phase flow models, as well as for gas dynamics with real equation of state, magnetohydrodynamics (MHD & RMHD), and nonlinear elasticity. Since our new formulation accommodates multiple intermediate waves and has a broader applicability than the original HLLEM method, it could alternatively be called the HLLI Riemann solver, where the “I” stands for the intermediate characteristic fields that can be accounted for. -- Highlights: •New simple and general path-conservative formulation of the HLLEM Riemann solver. •Application to general conservative and non-conservative hyperbolic systems. •Inclusion of sub-structure and resolution of intermediate characteristic fields. •Well-balanced for single- and two-layer shallow water equations and multi-phase flows. •Euler equations with real equation of state, MHD equations, nonlinear elasticity.« less

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

Uncertainty, imprecision, and the precautionary principle in climate change assessment.

PubMed

Borsuk, M E; Tomassini, L

2005-01-01

Statistical decision theory can provide useful support for climate change decisions made under conditions of uncertainty. However, the probability distributions used to calculate expected costs in decision theory are themselves subject to uncertainty, disagreement, or ambiguity in their specification. This imprecision can be described using sets of probability measures, from which upper and lower bounds on expectations can be calculated. However, many representations, or classes, of probability measures are possible. We describe six of the more useful classes and demonstrate how each may be used to represent climate change uncertainties. When expected costs are specified by bounds, rather than precise values, the conventional decision criterion of minimum expected cost is insufficient to reach a unique decision. Alternative criteria are required, and the criterion of minimum upper expected cost may be desirable because it is consistent with the precautionary principle. Using simple climate and economics models as an example, we determine the carbon dioxide emissions levels that have minimum upper expected cost for each of the selected classes. There can be wide differences in these emissions levels and their associated costs, emphasizing the need for care when selecting an appropriate class.

The GLC8 - A miniature low cost ring laser gyroscope

NASA Astrophysics Data System (ADS)

Godart, D.-F.; Peghaire, J.-P.

SAGEM is enlarging its family of ring laser gyros (RLG) which already includes a triangular 32-cm path-length gyro and a square 16-cm path-length gyro, in order to meet the increasing demand for low cost, medium accuracy strap-down inertial measurement units for applications such as short- and medium-range tactical missiles as well as aided navigation systems for aircrafts and land vehicles. Based on the experience acquired in the past 13 years in the RLG field, and especially in mirror manufacturing, SAGEM developed the GLC8 which has a square 8-cm path length cavity, central piezoelectric dither. It incorporates two cathodes, a single anode, and is technologically designed to minimize production-costs while optimizing the performance to global device size ratio. This gyro is characterized by a bias and a scale-factor stability respectively better than 0.5 deg/h and 100 ppm (1 sigma), and has an operating lifetime compatible with the most demanding relevant applications and a high robustness to mechanical environments.

45 CFR 2521.60 - To what extent must my share of program costs increase over time?

Code of Federal Regulations, 2010 CFR

2010-10-01

...(percent) Year 7(percent) Year 8(percent) Year 9(percent) Year 10(percent) Minimum member support 15 15 15...(percent) Year 6(percent) Year 7(percent) Year 8(percent) Year 9(percent) Year 10(percent) Minimum member... 45 Public Welfare 4 2010-10-01 2010-10-01 false To what extent must my share of program costs...

45 CFR 2521.60 - To what extent must my share of program costs increase over time?

Code of Federal Regulations, 2011 CFR

2011-10-01

...(percent) Year 7(percent) Year 8(percent) Year 9(percent) Year 10(percent) Minimum member support 15 15 15...(percent) Year 6(percent) Year 7(percent) Year 8(percent) Year 9(percent) Year 10(percent) Minimum member... 45 Public Welfare 4 2011-10-01 2011-10-01 false To what extent must my share of program costs...

Cost efficient environmental survey paths for detecting continuous tracer discharges

NASA Astrophysics Data System (ADS)

Alendal, G.

2017-07-01

Designing monitoring programs for detecting potential tracer discharges from unknown locations is challenging. The high variability of the environment may camouflage the anticipated anisotropic signal from a discharge, and there are a number of discharge scenarios. Monitoring operations may also be costly, constraining the number of measurements taken. By assuming that a discharge is active, and a prior belief on the most likely seep location, a method that uses Bayes' theorem combined with discharge footprint predictions is used to update the probability map. Measurement locations with highest reduction in the overall probability of a discharge to be active can be identified. The relative cost between reallocating and measurements can be taken into account. Three different strategies are suggested to enable cost efficient paths for autonomous vessels.

White Paper on Dish Stirling Technology: Path Toward Commercial Deployment

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

Andraka, Charles E.; Stechel, Ellen; Becker, Peter

2016-07-01

Dish Stirling energy systems have been developed for distributed and large-scale utility deployment. This report summarizes the state of the technology in a joint project between Stirling Energy Systems, Sandia National Laboratories, and the Department of Energy in 2011. It then lays out a feasible path to large scale deployment, including development needs and anticipated cost reduction paths that will make a viable deployment product.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

Clinical care paths: a role for finance in clinical decision-making.

PubMed

Abrams, Michael N; Cummings, Simone; Hage, Dana

2012-12-01

Care paths map the critical actions and decision points across a patient's course of medical treatment; their purpose is to guide physicians in the delivery of high-quality care while reducing care costs by avoiding services that do not contribute meaningfully to positive outcomes. Each care path development initiative should be led by a respected physician champion, whose specialty is in the area of the care episode being mapped, with the support of a clinician project manager. Once the care path has been developed and implemented, the finance leader's role begins in earnest with the tracking of financial and clinical data against care paths.

Laser-Based Production of Metallic Conducting Paths

NASA Astrophysics Data System (ADS)

Vedder, Christian; Stollenwerk, Jochen; Wissenbach, Konrad; Pirch, Norbert

For numerous devices such as OLEDs, solar cells or heated windows conducting paths are needed for collecting or distributing electricity on poorly or non-conducting surfaces. With established techniques the metallic paths can only be produced with a great deal of effort, incurring high costs for plant, equipment and energy. A new laser based process to manufacture conducting paths allows for writing narrow paths (down to 35 μm width) of Al, Cu, Ag or similar materials onto flat surfaces of glass (plain or coated with ITO) and silicon wafers by melting and vaporizing a metal foil through optical energy at high speeds of up to 2.5 m/s.

Architecture and design of optical path networks utilizing waveband virtual links

NASA Astrophysics Data System (ADS)

Ito, Yusaku; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

2016-02-01

We propose a novel optical network architecture that uses waveband virtual links, each of which can carry several optical paths, to directly bridge distant node pairs. Future photonic networks should not only transparently cover extended areas but also expand fiber capacity. However, the traversal of many ROADM nodes impairs the optical signal due to spectrum narrowing. To suppress the degradation, the bandwidth of guard bands needs to be increased, which degrades fiber frequency utilization. Waveband granular switching allows us to apply broader pass-band filtering at ROADMs and to insert sufficient guard bands between wavebands with minimum frequency utilization offset. The scheme resolves the severe spectrum narrowing effect. Moreover, the guard band between optical channels in a waveband can be minimized, which increases the number of paths that can be accommodated per fiber. In the network, wavelength path granular routing is done without utilizing waveband virtual links, and it still suffers from spectrum narrowing. A novel network design algorithm that can bound the spectrum narrowing effect by limiting the number of hops (traversed nodes that need wavelength path level routing) is proposed in this paper. This algorithm dynamically changes the waveband virtual link configuration according to the traffic distribution variation, where optical paths that need many node hops are effectively carried by virtual links. Numerical experiments demonstrate that the number of necessary fibers is reduced by 23% compared with conventional optical path networks.

36 CFR § 1192.23 - Mobility aid accessibility.

Code of Federal Regulations, 2013 CFR

2013-07-01

... at vehicle floor height with the inner barrier (if applicable) down or retracted, gaps between the.... Such space shall adjoin, and may overlap, an access path. Not more than 6 inches of the required clear floor space may be accommodated for footrests under another seat provided there is a minimum of 9 inches...

36 CFR 1192.23 - Mobility aid accessibility.

Code of Federal Regulations, 2014 CFR

2014-07-01

... at vehicle floor height with the inner barrier (if applicable) down or retracted, gaps between the.... Such space shall adjoin, and may overlap, an access path. Not more than 6 inches of the required clear floor space may be accommodated for footrests under another seat provided there is a minimum of 9 inches...

36 CFR 1192.23 - Mobility aid accessibility.

Code of Federal Regulations, 2012 CFR

2012-07-01

... at vehicle floor height with the inner barrier (if applicable) down or retracted, gaps between the.... Such space shall adjoin, and may overlap, an access path. Not more than 6 inches of the required clear floor space may be accommodated for footrests under another seat provided there is a minimum of 9 inches...

49 CFR 38.29 - Interior circulation, handrails and stanchions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... location from the lift or ramp. (b) Handrails and stanchions shall be provided in the entrance to the... length with front-door lifts or ramps, vertical stanchions immediately behind the driver shall either... of 22 feet in length, the minimum interior height along the path from the lift to the securement...

49 CFR 38.29 - Interior circulation, handrails and stanchions.

Code of Federal Regulations, 2011 CFR

2011-10-01

... location from the lift or ramp. (b) Handrails and stanchions shall be provided in the entrance to the... length with front-door lifts or ramps, vertical stanchions immediately behind the driver shall either... of 22 feet in length, the minimum interior height along the path from the lift to the securement...

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.

Using a Family of Dividing Surfaces Normal to the Minimum EnergyPath for Quantum Instanton Rate Constants

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

Li, Yimin; Miller, Wlliam H.

2006-02-22

One of the outstanding issues in the quantum instanton (QI) theory (or any transition state-type theory) for thermal rate constants of chemical reactions is the choice of an appropriate ''dividing surface'' (DS) that separates reactants and products. (In the general version of the QI theory, there are actually two dividing surfaces involved.) This paper shows one simple and general way for choosing DS's for use in QI Theory, namely using the family of (hyper) planes normal to the minimum energy path (MEP) on the potential energy surface at various distances s along it. Here the reaction coordinate is not onemore » of the dynamical coordinates of the system (which will in general be the Cartesian coordinates of the atoms), but rather simply a parameter which specifies the DS. It is also shown how this idea can be implemented for an N-atom system in 3d space in a way that preserves overall translational and rotational invariance. Numerical application to a simple system (the colliner H + H{sub 2} reaction) is presented to illustrate the procedure.« less

Determination of the Residence Time of Food Particles During Aseptic Sterilization

NASA Technical Reports Server (NTRS)

Carl, J. R.; Arndt, G. D.; Nguyen, T. X.

1994-01-01

The paper describes a non-invasive method to measure the time an individual particle takes to move through a length of stainless steel pipe. The food product is in two phase flow (liquids and solids) and passes through a pipe with pressures of approximately 60 psig and temperatures of 270-285 F. The proposed problem solution is based on the detection of transitory amplitude and/or phase changes in a microwave transmission path caused by the passage of the particles of interest. The particles are enhanced in some way, as will be discussed later, such that they will provide transitory changes that are distinctive enough not to be mistaken for normal variations in the received signal (caused by the non-homogeneous nature of the medium). Two detectors (transmission paths across the pipe) will be required and place at a known separation. A minimum transit time calculation is made from which the maximum velocity can be determined. This provides the minimum residence time. Also average velocity and statistical variations can be computed so that the amount of 'over-cooking' can be determined.

Architecture Synthesis and Reduced-Cost Architectures for Human Exploration Missions

NASA Technical Reports Server (NTRS)

Woodcock, Gordon

2004-01-01

Development of architectures for human exploration missions has been pursued in the international aerospace community for a long time. This paper attempts a different approach and way of looking at architectures. Most of the emphasis is on lunar architectures with a brief look at Mars. The first step is to set forth overarching gods in order to understand origins of requirements. Then, principles and guidelines are developed for architecture formulation. It is argued that safety and cost are the primary factors. Alternative mission profiles are examined for adherence to the principles, and specific architectures formulated according to the guidelines. The guidelines themselves indicate preferred evolution paths from lunar to Mars architectures. Results of example calculations are given to illustrate the process, and an evolution path is recommended. Safety and cost criteria tend to conflict, but it is shown that cost-efficient architectures can be enhanced for good safety ratings at modest cost.

Cyber warfare and electronic warfare integration in the operational environment of the future: cyber electronic warfare

NASA Astrophysics Data System (ADS)

Askin, Osman; Irmak, Riza; Avsever, Mustafa

2015-05-01

For the states with advanced technology, effective use of electronic warfare and cyber warfare will be the main determining factor of winning a war in the future's operational environment. The developed states will be able to finalize the struggles they have entered with a minimum of human casualties and minimum cost thanks to high-tech. Considering the increasing number of world economic problems, the development of human rights and humanitarian law it is easy to understand the importance of minimum cost and minimum loss of human. In this paper, cyber warfare and electronic warfare concepts are examined in conjunction with the historical development and the relationship between them is explained. Finally, assessments were carried out about the use of cyber electronic warfare in the coming years.

47 CFR 27.1164 - The cost-sharing formula.

Code of Federal Regulations, 2014 CFR

2014-10-01

... systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and.../path survey); installation; systems testing; FCC filing costs; site acquisition and civil works; zoning... defined as the actual costs associated with providing a replacement system, such as equipment and...

On the Path to SunShot. Emerging Opportunities and Challenges in U.S. Solar Manufacturing

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

Chung, Donald; Horowitz, Kelsey; Kurup, Parthiv

This report provides insights into photovoltaic (PV) and concentrating solar power (CSP) manufacturing in the context of the U.S. Department of Energy's SunShot Initiative. Although global PV price reductions and deployment have been strong recently, PV manufacturing faces challenges. Slowing rates of manufacturing cost reductions, combined with the relatively low price of incumbent electricity generating sources in most large global PV markets, may constrain profit opportunities for firms and poses a potential challenge to the sustainable operation and growth of the global PV manufacturing base. In the United States, manufacturers also face a factors-of-production cost disadvantage compared with competing nations.more » However, the United States is one of the world's most competitive and innovative countries as well as one of the best locations for PV manufacturing. In conjunction with strong projected PV demand in the United States and across the Americas, these advantages could increase the share of PV technologies produced by U.S. manufacturers as the importance of innovation-driven PV cost reductions increases. Compared with PV, CSP systems are much more complex and require a much larger minimum effective scale, resulting in much higher total CAPEX requirements for system construction, lengthier development cycles, and ultimately higher costs of energy produced. The global lack of consistent CSP project development creates challenges for companies that manufacture specialty CSP components, and the potential lack of a near-term U.S. market could hinder domestic CSP manufacturers. However, global and U.S. CSP deployment is expected to expand beyond 2020, and U.S. CSP manufacturers could benefit from U.S. innovation advantages similar to those associated with PV. Expansion of PV and CSP manufacturing also presents U.S. job-growth opportunities.« less

Comparative evaluation of distributed-collector solar thermal electric power plants

NASA Technical Reports Server (NTRS)

Fujita, T.; El Gabalawi, N.; Herrera, G. G.; Caputo, R. S.

1978-01-01

Distributed-collector solar thermal-electric power plants are compared by projecting power plant economics of selected systems to the 1990-2000 timeframe. The approach taken is to evaluate the performance of the selected systems under the same weather conditions. Capital and operational costs are estimated for each system. Energy costs are calculated for different plant sizes based on the plant performance and the corresponding capital and maintenance costs. Optimum systems are then determined as the systems with the minimum energy costs for a given load factor. The optimum system is comprised of the best combination of subsystems which give the minimum energy cost for every plant size. Sensitivity analysis is done around the optimum point for various plant parameters.

Systems Modeling of a Hypothetical SSME Channel-Wall Nozzle

NASA Technical Reports Server (NTRS)

Greene, William D.; Thames, Mignon P.; Polsgrove, Robert H.

2003-01-01

A future upgrade to the Space Shuttle Main Engine (SSME) may be the replacement of the current regenerative cooled tube-wall nozzle with a nozzle using a regeneratively-cooled channel-wall design. The current tube-wall design represents the only major piece of SSME hardware that has not been dramatically updated throughout thc long history of the engine. There are a number of advantages to a channel-wall design including the promise of faster and lower cost fabrication and greater reliability in the field. The technical obstacles in the path of making this happen are many, particularly in the realms of metallurgy and manufacturing techniques. However, one technical area that can and should be addressed in the near term as part of the development of detailed component requirements is a systems type model of the fluid flow and heat transfer processes to which the new design will be exposed. This paper presents the results of an effort to develop a mathematical model of the internal flow for a generic channel-wall nozzle functioning as a direct replacement for the current tube-wall nozzle with a minimum of systems-level changes. Comparisons will be made to mathematical modeling results for the current tube-wall design and the results of various geometrical trade studies will be presented. It is the intent of this work to examine the feasibility of the concept of a direct replacement component with minimum systems-!eve impacts and to highlight potential areas of concern requiring further work in the future.

Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia.

PubMed

Miklós, István; Darling, Aaron E

2009-06-22

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called "MC4Inversion." We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique.

Comparison between Mean Forces and Swarms-of-Trajectories String Methods.

PubMed

Maragliano, Luca; Roux, Benoît; Vanden-Eijnden, Eric

2014-02-11

The original formulation of the string method in collective variable space is compared with a recent variant called string method with swarms-of-trajectories. The assumptions made in the original method are revisited and the significance of the minimum free energy path (MFEP) is discussed in the context of reactive events. These assumptions are compared to those made in the string method with swarms-of-trajectories, and shown to be equivalent in a certain regime: in particular an expression for the path identified by the swarms-of-trajectories method is given and shown to be closely related to the MFEP. Finally, the algorithmic aspects of both methods are compared.

Convective heater

DOEpatents

Thorogood, Robert M.

1986-01-01

A convective heater for heating fluids such as a coal slurry is constructed of a tube circuit arrangement which obtains an optimum temperature distribution to give a relatively constant slurry film temperature. The heater is constructed to divide the heating gas flow into two equal paths and the tube circuit for the slurry is arranged to provide a mixed flow configuration whereby the slurry passes through the two heating gas paths in successive co-current, counter-current and co-current flow relative to the heating gas flow. This arrangement permits the utilization of minimum surface area for a given maximum film temperature of the slurry consistent with the prevention of coke formation.

Convective heater

DOEpatents

Thorogood, Robert M.

1983-01-01

A convective heater for heating fluids such as a coal slurry is constructed of a tube circuit arrangement which obtains an optimum temperature distribution to give a relatively constant slurry film temperature. The heater is constructed to divide the heating gas flow into two equal paths and the tube circuit for the slurry is arranged to provide a mixed flow configuration whereby the slurry passes through the two heating gas paths in successive co-current, counter-current and co-current flow relative to the heating gas flow. This arrangement permits the utilization of minimum surface area for a given maximum film temperature of the slurry consistent with the prevention of coke formation.

Convective heater

DOEpatents

Thorogood, R.M.

1983-12-27

A convective heater for heating fluids such as a coal slurry is constructed of a tube circuit arrangement which obtains an optimum temperature distribution to give a relatively constant slurry film temperature. The heater is constructed to divide the heating gas flow into two equal paths and the tube circuit for the slurry is arranged to provide a mixed flow configuration whereby the slurry passes through the two heating gas paths in successive co-current, counter-current and co-current flow relative to the heating gas flow. This arrangement permits the utilization of minimum surface area for a given maximum film temperature of the slurry consistent with the prevention of coke formation. 14 figs.

Laser Communications Relay Demonstration (LCRD) Update and the Path Towards Optical Relay Operations

NASA Technical Reports Server (NTRS)

Israel, David J.; Edwards, Bernard L.; Staren, John W.

2017-01-01

This paper provides a concept for an evolution of NASA's optical communications near Earth relay architecture. NASA's Laser Communications Relay Demonstration (LCRD), a joint project between NASA's Goddard Space Flight Center (GSFC), the Jet Propulsion Laboratory - California Institute of Technology (JPL), and the Massachusetts Institute of Technology Lincoln Laboratory (MIT LL). LCRD will provide a minimum of two years of high data rate optical communications service experiments in geosynchronous orbit (GEO), following launch in 2019. This paper will provide an update of the LCRD mission status and planned capabilities and experiments, followed by a discussion of the path from LCRD to operational network capabilities.

Tectonic tests of proposed polar wander paths for Mars and the moon

NASA Technical Reports Server (NTRS)

Grimm, R. E.; Solomon, S. C.

1986-01-01

A comparison of the lithospheric stress field predicted for rapid global reorientations against observed tectonic features is used to test the polar wander paths proposed for Mars by Schultz and Lutz-Garihan (1981). A calculation of the reorientation stresses leads to the suggestion that the formation of normal faults or graben in broad regions around the former rotation poles should be the minimum tectonic signature of a reorientation that generates lithospheric stresses in excess of the extensional strength of near-surface material. It is concluded that polar wander of the magnitude and timing envisioned by Schultz and Lutz-Garihan did not occur.

Laser Communications Relay Demonstration (LCRD) Update and the Path Towards Optical Relay Operations

NASA Technical Reports Server (NTRS)

Israel, David J.; Edwards, Bernard L.; Staren, John W.

2017-01-01

This Presentation provides a concept for an evolution of NASAs optical communications near Earth relay architecture. NASA's Laser Communications Relay Demonstration (LCRD), a joint project between NASAs Goddard Space Flight Center (GSFC), the Jet Propulsion Laboratory - California Institute of Technology (JPL), and the Massachusetts Institute of Technology Lincoln Laboratory (MIT LL). LCRD will provide a minimum of two years of high data rate optical communications service experiments in geosynchronous orbit (GEO), following launch in 2019. This paper will provide an update of the LCRD mission status and planned capabilities and experiments, followed by a discussion of the path from LCRD to operational network capabilities.

Distributed Method to Optimal Profile Descent

NASA Astrophysics Data System (ADS)

Kim, Geun I.

Current ground automation tools for Optimal Profile Descent (OPD) procedures utilize path stretching and speed profile change to maintain proper merging and spacing requirements at high traffic terminal area. However, low predictability of aircraft's vertical profile and path deviation during decent add uncertainty to computing estimated time of arrival, a key information that enables the ground control center to manage airspace traffic effectively. This paper uses an OPD procedure that is based on a constant flight path angle to increase the predictability of the vertical profile and defines an OPD optimization problem that uses both path stretching and speed profile change while largely maintaining the original OPD procedure. This problem minimizes the cumulative cost of performing OPD procedures for a group of aircraft by assigning a time cost function to each aircraft and a separation cost function to a pair of aircraft. The OPD optimization problem is then solved in a decentralized manner using dual decomposition techniques under inter-aircraft ADS-B mechanism. This method divides the optimization problem into more manageable sub-problems which are then distributed to the group of aircraft. Each aircraft solves its assigned sub-problem and communicate the solutions to other aircraft in an iterative process until an optimal solution is achieved thus decentralizing the computation of the optimization problem.

Software Defined Radios - Architectures, Systems and Functions

NASA Technical Reports Server (NTRS)

Sims, William H.

2017-01-01

Software Defined Radio is an industry term describing a method of utilizing a minimum amount of Radio Frequency (RF)/analog electronics before digitization takes place. Upon digitization all other functions are performed in software/firmware. There are as many different types of SDRs as there are data systems. Software Defined Radio (SDR) technology has been proven in the commercial sector since the early 90's. Today's rapid advancement in mobile telephone reliability and power management capabilities exemplifies the effectiveness of the SDR technology for the modern communications market. In contrast the foundations of transponder technology presently qualified for satellite applications were developed during the early space program of the 1960's. SDR technology offers potential to revolutionize satellite transponder technology by increasing science data through-put capability by at least an order of magnitude. While the SDR is adaptive in nature and is "One-size-fits-all" by design, conventional transponders are built to a specific platform and must be redesigned for every new bus. The SDR uses a minimum amount of analog/Radio Frequency components to up/down-convert the RF signal to/from a digital format. Once analog data is digitized, all processing is performed using hardware logic. Typical SDR processes include; filtering, modulation, up/down converting and demodulation. This presentation will show how the emerging SDR market has leveraged the existing commercial sector to provide a path to a radiation tolerant SDR transponder. These innovations will reduce the cost of transceivers, a decrease in power requirements and a commensurate reduction in volume. A second pay-off is the increased flexibility of the SDR by allowing the same hardware to implement multiple transponder types by altering hardware logic - no change of analog hardware is required - all of which can be ultimately accomplished in orbit. This in turn would provide high capability and low cost transponder to programs of all sizes.

Software Defined Radios - Architectures, Systems and Functions

NASA Technical Reports Server (NTRS)

Sims, Herb

2017-01-01

Software Defined Radio is an industry term describing a method of utilizing a minimum amount of Radio Frequency (RF)/analog electronics before digitization takes place. Upon digitization all other functions are performed in software/firmware. There are as many different types of SDRs as there are data systems. Software Defined Radio (SDR) technology has been proven in the commercial sector since the early 90's. Today's rapid advancement in mobile telephone reliability and power management capabilities exemplifies the effectiveness of the SDR technology for the modern communications market. In contrast the foundations of transponder technology presently qualified for satellite applications were developed during the early space program of the 1960's. SDR technology offers potential to revolutionize satellite transponder technology by increasing science data through-put capability by at least an order of magnitude. While the SDR is adaptive in nature and is "One-size-fits-all" by design, conventional transponders are built to a specific platform and must be redesigned for every new bus. The SDR uses a minimum amount of analog/Radio Frequency components to up/down-convert the RF signal to/from a digital format. Once analog data is digitized, all processing is performed using hardware logic. Typical SDR processes include; filtering, modulation, up/down converting and demodulation. This presentation will show how the emerging SDR market has leveraged the existing commercial sector to provide a path to a radiation tolerant SDR transponder. These innovations will reduce the cost of transceivers, a decrease in power requirements and a commensurate reduction in volume. A second pay-off is the increased flexibility of the SDR by allowing the same hardware to implement multiple transponder types by altering hardware logic - no change of analog hardware is required - all of which can be ultimately accomplished in orbit. This in turn would provide high capability and low cost transponder to programs of all sizes

Dynamical Bifurcation in Gas-Phase XH- + CH3 Y SN 2 Reactions: The Role of Energy Flow and Redistribution in Avoiding the Minimum Energy Path.

PubMed

Proenza, Yaicel G; de Souza, Miguel A F; Longo, Ricardo L

2016-11-02

The gas-phase reactions of XH - (X=O, S) + CH 3 Y (Y=F, Cl, Br) span nearly the whole range of S N 2 pathways, and show an intrinsic reaction coordinate (IRC) (minimum energy path) with a deep well owing to the CH 3 XH⋅⋅⋅Y - (or CH 3 S - ⋅⋅⋅HF) hydrogen-bonded postreaction complex. MP2 quasiclassical-type direct dynamics starting at the [HX⋅⋅⋅CH 3 ⋅⋅⋅Y] - transition-state (TS) structure reveal distinct mechanistic behaviors. Trajectories that yield the separated CH 3 XH+Y - (or CH 3 S - +HF) products directly are non-IRC, whereas those that sample the CH 3 XH⋅⋅⋅Y - (or CH 3 S - ⋅⋅⋅HF) complex are IRC. The IRCIRC/non-IRC ratios of 90:10, 40:60, 25:75, 2:98, 0:100, and 0:100 are obtained for (X, Y)=(S, F), (O, F), (S, Cl), (S, Br), (O, Cl), and (O, Br), respectively. The properties of the energy profiles after the TS cannot provide a rationalization of these results. Analysis of the energy flow in dynamics shows that the trajectories cross a dynamical bifurcation, and that the inability to follow the minimum energy path arises from long vibration periods of the X-C⋅⋅⋅Y bending mode. The partition of the available energy to the products into vibrational, rotational, and translational energies reveals that if the vibrational contribution is more than 80 %, non-IRC behavior dominates, unless the relative fraction of the rotational and translational components is similar, in which case a richer dynamical mechanism is shown, with an IRC/non-IRC ratio that correlates to this relative fraction. © 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Is the minimum enough? Affordability of a nutritious diet for minimum wage earners in Nova Scotia (2002-2012).

PubMed

Newell, Felicia D; Williams, Patricia L; Watt, Cynthia G

2014-05-09

This paper aims to assess the affordability of a nutritious diet for households earning minimum wage in Nova Scotia (NS) from 2002 to 2012 using an economic simulation that includes food costing and secondary data. The cost of the National Nutritious Food Basket (NNFB) was assessed with a stratified, random sample of grocery stores in NS during six time periods: 2002, 2004/2005, 2007, 2008, 2010 and 2012. The NNFB's cost was factored into affordability scenarios for three different household types relying on minimum wage earnings: a household of four; a lone mother with three children; and a lone man. Essential monthly living expenses were deducted from monthly net incomes using methods that were standardized from 2002 to 2012 to determine whether adequate funds remained to purchase a basic nutritious diet across the six time periods. A 79% increase to the minimum wage in NS has resulted in a decrease in the potential deficit faced by each household scenario in the period examined. However, the household of four and the lone mother with three children would still face monthly deficits ($44.89 and $496.77, respectively, in 2012) if they were to purchase a nutritiously sufficient diet. As a social determinant of health, risk of food insecurity is a critical public health issue for low wage earners. While it is essential to increase the minimum wage in the short term, adequately addressing income adequacy in NS and elsewhere requires a shift in thinking from a focus on minimum wage towards more comprehensive policies ensuring an adequate livable income for everyone.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind.

PubMed

Luo, He; Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided.

Integrated optimization of unmanned aerial vehicle task allocation and path planning under steady wind

PubMed Central

Liang, Zhengzheng; Zhu, Moning; Hu, Xiaoxuan; Wang, Guoqiang

2018-01-01

Wind has a significant effect on the control of fixed-wing unmanned aerial vehicles (UAVs), resulting in changes in their ground speed and direction, which has an important influence on the results of integrated optimization of UAV task allocation and path planning. The objective of this integrated optimization problem changes from minimizing flight distance to minimizing flight time. In this study, the Euclidean distance between any two targets is expanded to the Dubins path length, considering the minimum turning radius of fixed-wing UAVs. According to the vector relationship between wind speed, UAV airspeed, and UAV ground speed, a method is proposed to calculate the flight time of UAV between targets. On this basis, a variable-speed Dubins path vehicle routing problem (VS-DP-VRP) model is established with the purpose of minimizing the time required for UAVs to visit all the targets and return to the starting point. By designing a crossover operator and mutation operator, the genetic algorithm is used to solve the model, the results of which show that an effective UAV task allocation and path planning solution under steady wind can be provided. PMID:29561888

Optimization of fixed-range trajectories for supersonic transport aircraft

NASA Astrophysics Data System (ADS)

Windhorst, Robert Dennis

1999-11-01

This thesis develops near-optimal guidance laws that generate minimum fuel, time, or direct operating cost fixed-range trajectories for supersonic transport aircraft. The approach uses singular perturbation techniques to time-scale de-couple the equations of motion into three sets of dynamics, two of which are analyzed in the main body of this thesis and one of which is analyzed in the Appendix. The two-point-boundary-value-problems obtained by application of the maximum principle to the dynamic systems are solved using the method of matched asymptotic expansions. Finally, the two solutions are combined using the matching principle and an additive composition rule to form a uniformly valid approximation of the full fixed-range trajectory. The approach is used on two different time-scale formulations. The first holds weight constant, and the second allows weight and range dynamics to propagate on the same time-scale. Solutions for the first formulation are only carried out to zero order in the small parameter, while solutions for the second formulation are carried out to first order. Calculations for a HSCT design were made to illustrate the method. Results show that the minimum fuel trajectory consists of three segments: a minimum fuel energy-climb, a cruise-climb, and a minimum drag glide. The minimum time trajectory also has three segments: a maximum dynamic pressure ascent, a constant altitude cruise, and a maximum dynamic pressure glide. The minimum direct operating cost trajectory is an optimal combination of the two. For realistic costs of fuel and flight time, the minimum direct operating cost trajectory is very similar to the minimum fuel trajectory. Moreover, the HSCT has three local optimum cruise speeds, with the globally optimum cruise point at the highest allowable speed, if range is sufficiently long. The final range of the trajectory determines which locally optimal speed is best. Ranges of 500 to 6,000 nautical miles, subsonic and supersonic mixed flight, and varying fuel efficiency cases are analyzed. Finally, the payload-range curve of the HSCT design is determined.

Investigation of progressive failure robustness and alternate load paths for damage tolerant structures

NASA Astrophysics Data System (ADS)

Marhadi, Kun Saptohartyadi

Structural optimization for damage tolerance under various unforeseen damage scenarios is computationally challenging. It couples non-linear progressive failure analysis with sampling-based stochastic analysis of random damage. The goal of this research was to understand the relationship between alternate load paths available in a structure and its damage tolerance, and to use this information to develop computationally efficient methods for designing damage tolerant structures. Progressive failure of a redundant truss structure subjected to small random variability was investigated to identify features that correlate with robustness and predictability of the structure's progressive failure. The identified features were used to develop numerical surrogate measures that permit computationally efficient deterministic optimization to achieve robustness and predictability of progressive failure. Analysis of damage tolerance on designs with robust progressive failure indicated that robustness and predictability of progressive failure do not guarantee damage tolerance. Damage tolerance requires a structure to redistribute its load to alternate load paths. In order to investigate the load distribution characteristics that lead to damage tolerance in structures, designs with varying degrees of damage tolerance were generated using brute force stochastic optimization. A method based on principal component analysis was used to describe load distributions (alternate load paths) in the structures. Results indicate that a structure that can develop alternate paths is not necessarily damage tolerant. The alternate load paths must have a required minimum load capability. Robustness analysis of damage tolerant optimum designs indicates that designs are tailored to specified damage. A design Optimized under one damage specification can be sensitive to other damages not considered. Effectiveness of existing load path definitions and characterizations were investigated for continuum structures. A load path definition using a relative compliance change measure (U* field) was demonstrated to be the most useful measure of load path. This measure provides quantitative information on load path trajectories and qualitative information on the effectiveness of the load path. The use of the U* description of load paths in optimizing structures for effective load paths was investigated.

40 CFR 310.16 - What kind of cost documentation is necessary?

Code of Federal Regulations, 2010 CFR

2010-07-01

...) SUPERFUND, EMERGENCY PLANNING, AND COMMUNITY RIGHT-TO-KNOW PROGRAMS REIMBURSEMENT TO LOCAL GOVERNMENTS FOR... cost documentation is necessary? Cost documentation must be adequate for an audit. At a minimum, you...

Virtual local target method for avoiding local minimum in potential field based robot navigation.

PubMed

Zou, Xi-Yong; Zhu, Jing

2003-01-01

A novel robot navigation algorithm with global path generation capability is presented. Local minimum is a most intractable but is an encountered frequently problem in potential field based robot navigation. Through appointing appropriately some virtual local targets on the journey, it can be solved effectively. The key concept employed in this algorithm are the rules that govern when and how to appoint these virtual local targets. When the robot finds itself in danger of local minimum, a virtual local target is appointed to replace the global goal temporarily according to the rules. After the virtual target is reached, the robot continues on its journey by heading towards the global goal. The algorithm prevents the robot from running into local minima anymore. Simulation results showed that it is very effective in complex obstacle environments.

Atmospheric reaction of Cl + methacrolein: a theoretical study on the mechanism, and pressure- and temperature-dependent rate constants.

PubMed

Sun, Cuihong; Xu, Baoen; Zhang, Shaowen

2014-05-22

Methacrolein is a major degradation product of isoprene, the reaction of methacrolein with Cl atoms may play some roles in the degradation of isoprene where these species are relatively abundant. However, the energetics and kinetics of this reaction, which govern the reaction branching, are still not well understood so far. In the present study, two-dimensional potential energy surfaces were constructed to analyze the minimum energy path of the barrierless addition process between Cl and the C═C double bond of methacrolein, which reveals that the terminal addition intermediate is directly formed from the addition reaction. The terminal addition intermediate can further yield different products among which the reaction paths abstracting the aldehyde hydrogen atom and the methyl hydrogen atom are dominant reaction exits. The minimum reaction path for the direct aldehydic hydrogen atom abstraction is also obtained. The reaction kinetics was calculated by the variational transition state theory in conjunction with the master equation method. From the theoretical model we predicted that the overall rate constant of the Cl + methacrolein reaction at 297 K and atmospheric pressure is koverall = 2.3× 10(-10) cm(3) molecule(-1) s(-1), and the branching ratio of the aldehydic hydrogen abstraction is about 12%. The reaction is pressure dependent at P < 10 Torr with the high pressure limit at about 100 Torr. The calculated results could well account for the experimental observations.

Path connectivity based spectral defragmentation in flexible bandwidth networks.

PubMed

Wang, Ying; Zhang, Jie; Zhao, Yongli; Zhang, Jiawei; Zhao, Jie; Wang, Xinbo; Gu, Wanyi

2013-01-28

Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.

South Philadelphia passive sampler and sensor study.

PubMed

Thoma, Eben D; Brantley, Halley L; Oliver, Karen D; Whitaker, Donald A; Mukerjee, Shaibal; Mitchell, Bill; Wu, Tai; Squier, Bill; Escobar, Elsy; Cousett, Tamira A; Gross-Davis, Carol Ann; Schmidt, Howard; Sosna, Dennis; Weiss, Hallie

2016-10-01

From June 2013 to March 2015, in total 41 passive sampler deployments of 2 wk duration each were conducted at 17 sites in South Philadelphia, PA, with results for benzene discussed here. Complementary time-resolved measurements with lower cost prototype fenceline sensors and an open-path ultraviolet differential optical absorption spectrometer were also conducted. Minimum passive sampler benzene concentrations for each sampling period ranged from 0.08 ppbv to 0.65 ppbv, with a mean of 0.25 ppbv, and were negatively correlated with ambient temperature (-0.01 ppbv/°C, R(2) = 0.68). Co-deployed duplicate passive sampler pairs (N = 609) demonstrated good precision with an average and maximum percent difference of 1.5% and 34%, respectively. A group of passive samplers located within 50 m of a refinery fenceline had a study mean benzene concentration of 1.22 ppbv, whereas a group of samplers located in communities >1 km distant from facilities had a mean of 0.29 ppbv. The difference in the means of these groups was statistically significant at the 95% confidence level (p < 0.001). A decreasing gradient in benzene concentrations moving away from the facilities was observed, as was a significant period-to-period variation. The highest recorded 2-wk average benzene concentration for the fenceline group was 3.11 ppbv. During this period, time-resolved data from the prototype sensors and the open-path spectrometer detected a benzene signal from the west on one day in particular, with the highest 5-min path-averaged benzene concentration measured at 24 ppbv. Using a variation of EPA's passive sampler refinery fenceline monitoring method, coupled with time-resolved measurements, a multiyear study in South Philadelphia informed benzene concentrations near facilities and in communities. The combination of measurement strategies can assist facilities in identification and mitigation of emissions from fugitive sources and improve information on air quality complex air sheds.

7 CFR 4288.10 - Applicant eligibility.

Code of Federal Regulations, 2014 CFR

2014-01-01

... least minimum points for cost-effectiveness under § 4288.21(b)(1). (4) Percentage of reduction of fossil fuel use. The application must be awarded at least minimum points for percentage of reduction of fossil...

7 CFR 4288.10 - Applicant eligibility.

Code of Federal Regulations, 2013 CFR

2013-01-01

... least minimum points for cost-effectiveness under § 4288.21(b)(1). (4) Percentage of reduction of fossil fuel use. The application must be awarded at least minimum points for percentage of reduction of fossil...

7 CFR 4288.10 - Applicant eligibility.

Code of Federal Regulations, 2012 CFR

2012-01-01

... least minimum points for cost-effectiveness under § 4288.21(b)(1). (4) Percentage of reduction of fossil fuel use. The application must be awarded at least minimum points for percentage of reduction of fossil...

Chasing the shadows, a trip to spice island

NASA Astrophysics Data System (ADS)

Yamani, A.; Soegijoko, W.; Baskoro, A. A.; Satyaningsih, R.; Simatupang, F. M.; Maulana, F.; Suherli, J.; Syamara, R.; Canas, L.; Stevenson, T.; Oktariani, F.; Santosa, I.; Ariadi, F.; Carvalho, N.; Soegijoko, K.

2016-11-01

The 2016 Total Solar Eclipse provided us an opportunity to introduce astronomy to a much wider audience. The path of totality crossed the Indonesia from Sumatra to the Maluku Islands and ended its journey in the Pacific Ocean. Its path crossed over 4 major islands, 12 provinces and many cities. Most of the cities have minimum exposure to astronomy. langitselatan travelled to observe the eclipse and to do astronomy outreach at the eastern most island under the eclipse path. We chose Maba, a small village in East Halmahera, North Maluku as our site to observe the eclipse as well as conduct a workshop for teachers and students. The aim of the workshop is to introduce astronomy taking advantage of the eclipse as well as raise awareness and curiosity among students. In this paper, we will share a short report regarding the whole trip and event in Maba.

Truncation Depth Rule-of-Thumb for Convolutional Codes

NASA Technical Reports Server (NTRS)

Moision, Bruce

2009-01-01

In this innovation, it is shown that a commonly used rule of thumb (that the truncation depth of a convolutional code should be five times the memory length, m, of the code) is accurate only for rate 1/2 codes. In fact, the truncation depth should be 2.5 m/(1 - r), where r is the code rate. The accuracy of this new rule is demonstrated by tabulating the distance properties of a large set of known codes. This new rule was derived by bounding the losses due to truncation as a function of the code rate. With regard to particular codes, a good indicator of the required truncation depth is the path length at which all paths that diverge from a particular path have accumulated the minimum distance of the code. It is shown that the new rule of thumb provides an accurate prediction of this depth for codes of varying rates.

Compact atom interferometer using single laser

NASA Astrophysics Data System (ADS)

Chiow, Sheng-wey; Yu, Nan

2018-06-01

A typical atom interferometer requires vastly different laser frequencies at different stages of operation, e.g., near resonant light for laser cooling and far detuned light for atom optics, such that multiple lasers are typically employed. The number of laser units constrains the achievable minimum size and power in practical devices for resource critical environments such as space. We demonstrate a compact atom interferometer accelerometer operated by a single diode laser. This is achieved by dynamically changing the laser output frequency in GHz range while maintaining spectroscopic reference to an atomic transition via a sideband generated by phase modulation. At the same time, a beam path sharing configuration is also demonstrated for a compact sensor head design, in which atom interferometer beams share the same path as that of the cooling beam. This beam path sharing also significantly simplifies three-axis atomic accelerometry in microgravity using single sensor head.

A Spatial Cognitive Map and a Human-Like Memory Model Dedicated to Pedestrian Navigation in Virtual Urban Environments

NASA Astrophysics Data System (ADS)

Thomas, Romain; Donikian, Stéphane

Many articles dealing with agent navigation in an urban environment involve the use of various heuristics. Among them, one is prevalent: the search of the shortest path between two points. This strategy impairs the realism of the resulting behaviour. Indeed, psychological studies state that such a navigation behaviour is conditioned by the knowledge the subject has of its environment. Furthermore, the path a city dweller can follow may be influenced by many factors like his daily habits, or the path simplicity in term of minimum of direction changes. It appeared interesting to us to investigate how to mimic human navigation behavior with an autonomous agent. The solution we propose relies on an architecture based on a generic model of informed environment, a spatial cognitive map model merged with a human-like memory model, representing the agent's temporal knowledge of the environment, it gained along its experiences of navigation.

Projectile motion in real-life situation: Kinematics of basketball shooting

NASA Astrophysics Data System (ADS)

Changjan, A.; Mueanploy, W.

2015-06-01

Basketball shooting is a basic practice for players. The path of the ball from the players to the hoop is projectile motion. For undergraduate introductory physics courses student must be taught about projectile motion. Basketball shooting can be used as a case study for learning projectile motion from real-life situation. In this research, we discuss the relationship between optimal angle, minimum initial velocity and the height of the ball before the player shoots the ball for basketball shooting problem analytically. We found that the value of optimal angle and minimum initial velocity decreases with increasing the height of the ball before the player shoots the ball.

Minimum-fuel, 3-dimensional flightpath guidance of transfer jets

NASA Technical Reports Server (NTRS)

Neuman, F.; Kreindler, E.

1984-01-01

Minimum fuel, three dimensional flightpaths for commercial jet aircraft are discussed. The theoretical development is divided into two sections. In both sections, the necessary conditions of optimal control, including singular arcs and state constraints, are used. One section treats the initial and final portions (below 10,000 ft) of long optimal flightpaths. Here all possible paths can be derived by generating fields of extremals. Another section treats the complete intermediate length, three dimensional terminal area flightpaths. Here only representative sample flightpaths can be computed. Sufficient detail is provided to give the student of optimal control a complex example of a useful application of optimal control theory.

Optimal dual-fuel propulsion for minimum inert weight or minimum fuel cost

NASA Technical Reports Server (NTRS)

Martin, J. A.

1973-01-01

An analytical investigation of single-stage vehicles with multiple propulsion phases has been conducted with the phasing optimized to minimize a general cost function. Some results are presented for linearized sizing relationships which indicate that single-stage-to-orbit, dual-fuel rocket vehicles can have lower inert weight than similar single-fuel rocket vehicles and that the advantage of dual-fuel vehicles can be increased if a dual-fuel engine is developed. The results also indicate that the optimum split can vary considerably with the choice of cost function to be minimized.

Future trends which will influence waste disposal.

PubMed Central

Wolman, A

1978-01-01

The disposal and management of solid wastes are ancient problems. The evolution of practices naturally changed as populations grew and sites for disposal became less acceptable. The central search was for easy disposal at minimum costs. The methods changed from indiscriminate dumping to sanitary landfill, feeding to swine, reduction, incineration, and various forms of re-use and recycling. Virtually all procedures have disabilities and rising costs. Many methods once abandoned are being rediscovered. Promises for so-called innovations outstrip accomplishments. Markets for salvage vary widely or disappear completely. The search for conserving materials and energy at minimum cost must go on forever. PMID:570105

36 CFR 1192.107 - Restrooms.

Code of Federal Regulations, 2012 CFR

2012-07-01

... shelves may overlap the clear floor space at a lower height provided they can be easily folded up or moved... of the toilet seat. Seats shall not be sprung to return to a lifted position. (3) A grab bar at least... mobility aids and shall be connected to such a space by an unobstructed path having a minimum width of 32...

36 CFR § 1192.107 - Restrooms.

Code of Federal Regulations, 2013 CFR

2013-07-01

... shelves may overlap the clear floor space at a lower height provided they can be easily folded up or moved... of the toilet seat. Seats shall not be sprung to return to a lifted position. (3) A grab bar at least... mobility aids and shall be connected to such a space by an unobstructed path having a minimum width of 32...

36 CFR 1192.123 - Restrooms.

Code of Federal Regulations, 2014 CFR

2014-07-01

... the water closet. Fold-down or retractable seats or shelves may overlap the clear floor space at a... closet shall be 17 inches to 19 inches measured to the top of the toilet seat. Seats shall not be sprung....125(d) and shall be connected to such a space by an unobstructed path having a minimum width of 32...

36 CFR 1192.107 - Restrooms.

Code of Federal Regulations, 2014 CFR

2014-07-01

... shelves may overlap the clear floor space at a lower height provided they can be easily folded up or moved... of the toilet seat. Seats shall not be sprung to return to a lifted position. (3) A grab bar at least... mobility aids and shall be connected to such a space by an unobstructed path having a minimum width of 32...

36 CFR 1192.123 - Restrooms.

Code of Federal Regulations, 2012 CFR

2012-07-01

... the water closet. Fold-down or retractable seats or shelves may overlap the clear floor space at a... closet shall be 17 inches to 19 inches measured to the top of the toilet seat. Seats shall not be sprung....125(d) and shall be connected to such a space by an unobstructed path having a minimum width of 32...

E-Learning Technologies: Employing Matlab Web Server to Facilitate the Education of Mathematical Programming

ERIC Educational Resources Information Center

Karagiannis, P.; Markelis, I.; Paparrizos, K.; Samaras, N.; Sifaleras, A.

2006-01-01

This paper presents new web-based educational software (webNetPro) for "Linear Network Programming." It includes many algorithms for "Network Optimization" problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems and other search algorithms. Therefore, webNetPro can assist the teaching process of courses such…

Aorta and pulmonary artery segmentation using optimal surface graph cuts in non-contrast CT

NASA Astrophysics Data System (ADS)

Sedghi Gamechi, Zahra; Arias-Lorza, Andres M.; Pedersen, Jesper Holst; de Bruijne, Marleen

2018-03-01

Accurate measurements of the size and shape of the aorta and pulmonary arteries are important as risk factors for cardiovascular diseases, and for Chronicle Obstacle Pulmonary Disease (COPD).1 The aim of this paper is to propose an automated method for segmenting the aorta and pulmonary arteries in low-dose non-ECGgated non-contrast CT scans. Low contrast and the high noise level make the automatic segmentation in such images a challenging task. In the proposed method, first, a minimum cost path tracking algorithm traces the centerline between user-defined seed points. The cost function is based on a multi-directional medialness filter and a lumen intensity similarity metric. The vessel radius is also estimated from the medialness filter. The extracted centerlines are then smoothed and dilated non-uniformly according to the extracted local vessel radius and subsequently used as initialization for a graph-cut segmentation. The algorithm is evaluated on 225 low-dose non-ECG-gated non-contrast CT scans from a lung cancer screening trial. Quantitatively analyzing 25 scans with full manual annotations, we obtain a dice overlap of 0.94+/-0.01 for the aorta and 0.92+/-0.01 for pulmonary arteries. Qualitative validation by visual inspection on 200 scans shows successful segmentation in 93% of all cases for the aorta and 94% for pulmonary arteries.

Low-Cost Telemetry System for Small/Micro Satellites

NASA Technical Reports Server (NTRS)

Sims, William; Varnavas, Kosta

2012-01-01

A Software Defined Radio (SDR) concept uses a minimum amount of analog/radio frequency components to up/downconvert the RF signal to/from a digital format. Once in the digital domain, all other processing (filtering, modulation, demodulation, etc.) is done in software. The project will leverage existing designs and enhance capabilities in the commercial sector to provide a path to a radiation-hardened SDR transponder. The SDR transponder would incorporate baseline technologies dealing with improved Forward Error Correcting (FEC) codes to be deployed to all Near Earth Network (NEN) ground stations. By incorporating this FEC, at least a tenfold increase in data throughput can be achieved. A family of transponder products can be implemented using common platform architecture, allowing new products to be more quickly introduced into the market. Software can be reused across products, reducing software/hardware costs dramatically. New features and capabilities, such as encoding and decoding algorithms, filters, and bit synchronizers, can be added to the existing infrastructure without requiring major new capital expenditures, allowing implementation of advanced features in the communication systems. As new telecommunication technologies emerge, incorporating them into the SDR fabric will be easily accomplished with little or no requirements for new hardware. There are no preferred flight platforms for the SDR technology, so it can be used on any type of orbital or sub-orbital platform, all within a fully radiation hardened design.

THE CRITICAL-PATH METHOD OF CONSTRUCTION CONTROL.

ERIC Educational Resources Information Center

DOMBROW, RODGER T.; MAUCHLY, JOHN

THIS DISCUSSION PRESENTS A DEFINITION AND BRIEF DESCRIPTION OF THE CRITICAL-PATH METHOD AS APPLIED TO BUILDING CONSTRUCTION. INTRODUCING REMARKS CONSIDER THE MOST PERTINENT QUESTIONS PERTAINING TO CPM AND THE NEEDS ASSOCIATED WITH MINIMIZING TIME AND COST ON CONSTRUCTION PROJECTS. SPECIFIC DISCUSSION INCLUDES--(1) ADVANTAGES OF NETWORK TECHNIQUES,…

C-semiring Frameworks for Minimum Spanning Tree Problems

NASA Astrophysics Data System (ADS)

Bistarelli, Stefano; Santini, Francesco

In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.

[Economic aspects of oncological esophageal surgery : Centralization is essential].

PubMed

von Dercks, N; Gockel, I; Mehdorn, M; Lorenz, D

2017-01-01

The incidence of esophageal carcinoma has increased in recent years in Germany. The aim of this article is a discussion of the economic aspects of oncological esophageal surgery within the German diagnosis-related groups (DRG) system focusing on the association between minimum caseload requirements and outcome quality as well as costs. The margins for the DRG classification G03A are low and quickly exhausted if complications determine the postoperative course. A current study using nationwide German hospital discharge data proved a significant difference in hospital mortality between clinics with and without achieving the minimum caseload requirements for esophagectomy. Data from the USA clearly showed that besides patient-relevant parameters, the caseload of a surgeon is relevant for the cost of treatment. Such cost-related analyses do not exist in Germany at present. Scientific validation of reliable minimum caseload numbers for oncological esophagectomy is desirable in the future.

An Optimization Principle for Deriving Nonequilibrium Statistical Models of Hamiltonian Dynamics

NASA Astrophysics Data System (ADS)

Turkington, Bruce

2013-08-01

A general method for deriving closed reduced models of Hamiltonian dynamical systems is developed using techniques from optimization and statistical estimation. Given a vector of resolved variables, selected to describe the macroscopic state of the system, a family of quasi-equilibrium probability densities on phase space corresponding to the resolved variables is employed as a statistical model, and the evolution of the mean resolved vector is estimated by optimizing over paths of these densities. Specifically, a cost function is constructed to quantify the lack-of-fit to the microscopic dynamics of any feasible path of densities from the statistical model; it is an ensemble-averaged, weighted, squared-norm of the residual that results from submitting the path of densities to the Liouville equation. The path that minimizes the time integral of the cost function determines the best-fit evolution of the mean resolved vector. The closed reduced equations satisfied by the optimal path are derived by Hamilton-Jacobi theory. When expressed in terms of the macroscopic variables, these equations have the generic structure of governing equations for nonequilibrium thermodynamics. In particular, the value function for the optimization principle coincides with the dissipation potential that defines the relation between thermodynamic forces and fluxes. The adjustable closure parameters in the best-fit reduced equations depend explicitly on the arbitrary weights that enter into the lack-of-fit cost function. Two particular model reductions are outlined to illustrate the general method. In each example the set of weights in the optimization principle contracts into a single effective closure parameter.

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

Wu, Qishi; Zhu, Mengxia; Rao, Nageswara S

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme tomore » achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.« less

An efficient and accurate framework for calculating lattice thermal conductivity of solids: AFLOW—AAPL Automatic Anharmonic Phonon Library

NASA Astrophysics Data System (ADS)

Plata, Jose J.; Nath, Pinku; Usanmaz, Demet; Carrete, Jesús; Toher, Cormac; de Jong, Maarten; Asta, Mark; Fornari, Marco; Nardelli, Marco Buongiorno; Curtarolo, Stefano

2017-10-01

One of the most accurate approaches for calculating lattice thermal conductivity, , is solving the Boltzmann transport equation starting from third-order anharmonic force constants. In addition to the underlying approximations of ab-initio parameterization, two main challenges are associated with this path: high computational costs and lack of automation in the frameworks using this methodology, which affect the discovery rate of novel materials with ad-hoc properties. Here, the Automatic Anharmonic Phonon Library (AAPL) is presented. It efficiently computes interatomic force constants by making effective use of crystal symmetry analysis, it solves the Boltzmann transport equation to obtain , and allows a fully integrated operation with minimum user intervention, a rational addition to the current high-throughput accelerated materials development framework AFLOW. An "experiment vs. theory" study of the approach is shown, comparing accuracy and speed with respect to other available packages, and for materials characterized by strong electron localization and correlation. Combining AAPL with the pseudo-hybrid functional ACBN0 is possible to improve accuracy without increasing computational requirements.

A computational imaging target specific detectivity metric

NASA Astrophysics Data System (ADS)

Preece, Bradley L.; Nehmetallah, George

2017-05-01

Due to the large quantity of low-cost, high-speed computational processing available today, computational imaging (CI) systems are expected to have a major role for next generation multifunctional cameras. The purpose of this work is to quantify the performance of theses CI systems in a standardized manner. Due to the diversity of CI system designs that are available today or proposed in the near future, significant challenges in modeling and calculating a standardized detection signal-to-noise ratio (SNR) to measure the performance of these systems. In this paper, we developed a path forward for a standardized detectivity metric for CI systems. The detectivity metric is designed to evaluate the performance of a CI system searching for a specific known target or signal of interest, and is defined as the optimal linear matched filter SNR, similar to the Hotelling SNR, calculated in computational space with special considerations for standardization. Therefore, the detectivity metric is designed to be flexible, in order to handle various types of CI systems and specific targets, while keeping the complexity and assumptions of the systems to a minimum.

Automated generation of weld path trajectories.

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

Sizemore, John M.; Hinman-Sweeney, Elaine Marie; Ames, Arlo Leroy

2003-06-01

AUTOmated GENeration of Control Programs for Robotic Welding of Ship Structure (AUTOGEN) is software that automates the planning and compiling of control programs for robotic welding of ship structure. The software works by evaluating computer representations of the ship design and the manufacturing plan. Based on this evaluation, AUTOGEN internally identifies and appropriately characterizes each weld. Then it constructs the robot motions necessary to accomplish the welds and determines for each the correct assignment of process control values. AUTOGEN generates these robot control programs completely without manual intervention or edits except to correct wrong or missing input data. Most shipmore » structure assemblies are unique or at best manufactured only a few times. Accordingly, the high cost inherent in all previous methods of preparing complex control programs has made robot welding of ship structures economically unattractive to the U.S. shipbuilding industry. AUTOGEN eliminates the cost of creating robot control programs. With programming costs eliminated, capitalization of robots to weld ship structures becomes economically viable. Robot welding of ship structures will result in reduced ship costs, uniform product quality, and enhanced worker safety. Sandia National Laboratories and Northrop Grumman Ship Systems worked with the National Shipbuilding Research Program to develop a means of automated path and process generation for robotic welding. This effort resulted in the AUTOGEN program, which has successfully demonstrated automated path generation and robot control. Although the current implementation of AUTOGEN is optimized for welding applications, the path and process planning capability has applicability to a number of industrial applications, including painting, riveting, and adhesive delivery.« less

Direction-dependent force-induced dissociation dynamics of an entropic-driven lock-and-key assembly.

PubMed

Chen, Yen-Fu; Chen, Hsuan-Yi; Sheng, Yu-Jane; Tsao, Heng-Kwong

2017-09-01

The unbinding dynamics of a nanosized sphere-and-cavity assembly under the pulling of constant force and constant loading rate is explored by dissipative particle dynamics simulations. The formation of this matched lock-and-key pair in a polymer solution is driven by the depletion attraction. The two-dimensional free energy landscape U(x,z) associated with this assembly is constructed. Our results indicate that the unbinding pathway along the orientation of the assembly is unfavorable due to the relatively high energy barrier compared to that along the tortuous minimum path whose energy barrier is not high. It is also found that the dissociation rate depends on the direction of the external force (θ) with respect to the assembly orientation. The presence of the force component perpendicular to the assembly orientation can reduce the bond lifetime significantly by driving the key particle to approach the minimum path. Moreover, the dissociation dynamics can be facilitated even by a pushing force compared to the spontaneous dissociation (without forces). To elucidate the effective pathway under pulling, the escaping position is analyzed and its mean direction with respect to the assembly orientation rises generally with increasing θ, revealing that the presence of the force component along the minimum pathway is helpful. The importance of the direction of the external pulling has been demonstrated in our simple system. Therefore, this effect should be considered in more complicated unbinding experiments.

Direction-dependent force-induced dissociation dynamics of an entropic-driven lock-and-key assembly

NASA Astrophysics Data System (ADS)

Chen, Yen-Fu; Chen, Hsuan-Yi; Sheng, Yu-Jane; Tsao, Heng-Kwong

2017-09-01

The unbinding dynamics of a nanosized sphere-and-cavity assembly under the pulling of constant force and constant loading rate is explored by dissipative particle dynamics simulations. The formation of this matched lock-and-key pair in a polymer solution is driven by the depletion attraction. The two-dimensional free energy landscape U (x ,z ) associated with this assembly is constructed. Our results indicate that the unbinding pathway along the orientation of the assembly is unfavorable due to the relatively high energy barrier compared to that along the tortuous minimum path whose energy barrier is not high. It is also found that the dissociation rate depends on the direction of the external force (θ ) with respect to the assembly orientation. The presence of the force component perpendicular to the assembly orientation can reduce the bond lifetime significantly by driving the key particle to approach the minimum path. Moreover, the dissociation dynamics can be facilitated even by a pushing force compared to the spontaneous dissociation (without forces). To elucidate the effective pathway under pulling, the escaping position is analyzed and its mean direction with respect to the assembly orientation rises generally with increasing θ , revealing that the presence of the force component along the minimum pathway is helpful. The importance of the direction of the external pulling has been demonstrated in our simple system. Therefore, this effect should be considered in more complicated unbinding experiments.

Nudged elastic band method and density functional theory calculation for finding a local minimum energy pathway of p-benzoquinone and phenol fragmentation in mass spectrometry.

PubMed

Sugimura, Natsuhiko; Igarashi, Yoko; Aoyama, Reiko; Shibue, Toshimichi

2017-02-01

Analysis of the fragmentation pathways of molecules in mass spectrometry gives a fundamental insight into gas-phase ion chemistry. However, the conventional intrinsic reaction coordinates method requires knowledge of the transition states of ion structures in the fragmentation pathways. Herein, we use the nudged elastic band method, using only the initial and final state ion structures in the fragmentation pathways, and report the advantages and limitations of the method. We found a minimum energy path of p-benzoquinone ion fragmentation with two saddle points and one intermediate structure. The primary energy barrier, which corresponded to the cleavage of the C-C bond adjacent to the CO group, was calculated to be 1.50 eV. An additional energy barrier, which corresponded to the cleavage of the CO group, was calculated to be 0.68 eV. We also found an energy barrier of 3.00 eV, which was the rate determining step of the keto-enol tautomerization in CO elimination from the molecular ion of phenol. The nudged elastic band method allowed the determination of a minimum energy path using only the initial and final state ion structures in the fragmentation pathways, and it provided faster than the conventional intrinsic reaction coordinates method. In addition, this method was found to be effective in the analysis of the charge structures of the molecules during the fragmentation in mass spectrometry.

77 FR 61403 - Combined Notice of Filings #1

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-09

... related cancelled project cost for the TL6942 Sycamore Project. Filed Date: 9/28/12. Accession Number.... Description: PATH submits revisions to its Formula Rate for recovery of RTEP abandonment cost to be effective...

47 CFR 27.1180 - The cost-sharing formula.

Code of Federal Regulations, 2014 CFR

2014-10-01

... system with which it interferes is entitled to pro rata reimbursement based on the cost-sharing formula... system, and includes, but is not limited to, such items as: Radio terminal equipment (TX and/or RX...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC...

47 CFR 27.1180 - The cost-sharing formula.

Code of Federal Regulations, 2012 CFR

2012-10-01

...-sharing formula. (a) An AWS licensee that relocates a BRS system with which it interferes is entitled to... this section. (b) C is the actual cost of relocating the system, and includes, but is not limited to... (design/path survey); installation; systems testing; FCC filing costs; site acquisition and civil works...

47 CFR 27.1180 - The cost-sharing formula.

Code of Federal Regulations, 2011 CFR

2011-10-01

...-sharing formula. (a) An AWS licensee that relocates a BRS system with which it interferes is entitled to... this section. (b) C is the actual cost of relocating the system, and includes, but is not limited to... (design/path survey); installation; systems testing; FCC filing costs; site acquisition and civil works...

Cost Study of Educational Media Systems and Their Equipment Components. Volume III, A Supplementary Report: Computer Assisted Instruction. Final Report.

ERIC Educational Resources Information Center

General Learning Corp., Washington, DC.

The COST-ED model (Costs of Schools, Training, and Education) of the instructional process encourages the recognition of management alternatives and potential cost-savings. It is used to calculate the minimum cost of performing specified instructional tasks. COST-ED components are presented as cost modules in a flowchart format for manpower,…

The economic burden of meningitis to households in Kassena-Nankana district of Northern Ghana.

PubMed

Akweongo, Patricia; Dalaba, Maxwell A; Hayden, Mary H; Awine, Timothy; Nyaaba, Gertrude N; Anaseba, Dominic; Hodgson, Abraham; Forgor, Abdulai A; Pandya, Rajul

2013-01-01

To estimate the direct and indirect costs of meningitis to households in the Kassena-Nankana District of Ghana. A Cost of illness (COI) survey was conducted between 2010 and 2011. The COI was computed from a retrospective review of 80 meningitis cases answers to questions about direct medical costs, direct non-medical costs incurred and productivity losses due to recent meningitis incident. The average direct and indirect costs of treating meningitis in the district was GH¢152.55 (US$101.7) per household. This is equivalent to about two months minimum wage earned by Ghanaians in unskilled paid jobs in 2009. Households lost 29 days of work per meningitis case and thus those in minimum wage paid jobs lost a monthly minimum wage of GH¢76.85 (US$51.23) due to the illness. Patients who were insured spent an average of GH¢38.5 (US$25.67) in direct medical costs whiles the uninsured patients spent as much as GH¢177.9 (US$118.6) per case. Patients with sequelae incurred additional costs of GH¢22.63 (US$15.08) per case. The least poor were more exposed to meningitis than the poorest. Meningitis is a debilitating but preventable disease that affects people living in the Sahel and in poorer conditions. The cost of meningitis treatment may further lead to impoverishment for these households. Widespread mass vaccination will save households' an equivalent of GH¢175.18 (US$117) and impairment due to meningitis.

Efficient Sampling of Parsimonious Inversion Histories with Application to Genome Rearrangement in Yersinia

PubMed Central

Darling, Aaron E.

2009-01-01

Inversions are among the most common mutations acting on the order and orientation of genes in a genome, and polynomial-time algorithms exist to obtain a minimal length series of inversions that transform one genome arrangement to another. However, the minimum length series of inversions (the optimal sorting path) is often not unique as many such optimal sorting paths exist. If we assume that all optimal sorting paths are equally likely, then statistical inference on genome arrangement history must account for all such sorting paths and not just a single estimate. No deterministic polynomial algorithm is known to count the number of optimal sorting paths nor sample from the uniform distribution of optimal sorting paths. Here, we propose a stochastic method that uniformly samples the set of all optimal sorting paths. Our method uses a novel formulation of parallel Markov chain Monte Carlo. In practice, our method can quickly estimate the total number of optimal sorting paths. We introduce a variant of our approach in which short inversions are modeled to be more likely, and we show how the method can be used to estimate the distribution of inversion lengths and breakpoint usage in pathogenic Yersinia pestis. The proposed method has been implemented in a program called “MC4Inversion.” We draw comparison of MC4Inversion to the sampler implemented in BADGER and a previously described importance sampling (IS) technique. We find that on high-divergence data sets, MC4Inversion finds more optimal sorting paths per second than BADGER and the IS technique and simultaneously avoids bias inherent in the IS technique. PMID:20333186

Minimum savings requirements in shared savings provider payment.

PubMed

Pope, Gregory C; Kautter, John

2012-11-01

Payer (insurer) sharing of savings is a way of motivating providers of medical services to reduce cost growth. A Medicare shared savings program is established for accountable care organizations in the 2010 Patient Protection and Affordable Care Act. However, savings created by providers cannot be distinguished from the normal (random) variation in medical claims costs, setting up a classic principal-agent problem. To lessen the likelihood of paying undeserved bonuses, payers may pay bonuses only if observed savings exceed minimum levels. We study the trade-off between two types of errors in setting minimum savings requirements: paying bonuses when providers do not create savings and not paying bonuses when providers create savings. Copyright © 2011 John Wiley & Sons, Ltd.

Simulation and validation of concentrated subsurface lateral flow paths in an agricultural landscape

NASA Astrophysics Data System (ADS)

Zhu, Q.; Lin, H. S.

2009-08-01

The importance of soil water flow paths to the transport of nutrients and contaminants has long been recognized. However, effective means of detecting concentrated subsurface flow paths in a large landscape are still lacking. The flow direction and accumulation algorithm based on single-direction flow algorithm (D8) in GIS hydrologic modeling is a cost-effective way to simulate potential concentrated flow paths over a large area once relevant data are collected. This study tested the D8 algorithm for simulating concentrated lateral flow paths at three interfaces in soil profiles in a 19.5-ha agricultural landscape in central Pennsylvania, USA. These interfaces were (1) the interface between surface plowed layers of Ap1 and Ap2 horizons, (2) the interface with subsoil water-restricting clay layer where clay content increased to over 40%, and (3) the soil-bedrock interface. The simulated flow paths were validated through soil hydrologic monitoring, geophysical surveys, and observable soil morphological features. The results confirmed that concentrated subsurface lateral flow occurred at the interfaces with the clay layer and the underlying bedrock. At these two interfaces, the soils on the simulated flow paths were closer to saturation and showed more temporally unstable moisture dynamics than those off the simulated flow paths. Apparent electrical conductivity in the soil on the simulated flow paths was elevated and temporally unstable as compared to those outside the simulated paths. The soil cores collected from the simulated flow paths showed significantly higher Mn content at these interfaces than those away from the simulated paths. These results suggest that (1) the D8 algorithm is useful in simulating possible concentrated subsurface lateral flow paths if used with appropriate threshold value of contributing area and sufficiently detailed digital elevation model (DEM); (2) repeated electromagnetic surveys can reflect the temporal change of soil water storage and thus is a useful indicator of possible subsurface flow path over a large area; and (3) observable Mn distribution in soil profiles can be used as a simple indicator of water flow paths in soils and over the landscape; however, it does require sufficient soil sampling (by excavation or augering) to possibly infer landscape-scale subsurface flow paths. In areas where subsurface interface topography varies similarly with surface topography, surface DEM can be used to simulate potential subsurface lateral flow path reasonably so the cost associated with obtaining depth to subsurface water-restricting layer can be minimized.

Advanced Launch System Multi-Path Redundant Avionics Architecture Analysis and Characterization

NASA Technical Reports Server (NTRS)

Baker, Robert L.

1993-01-01

The objective of the Multi-Path Redundant Avionics Suite (MPRAS) program is the development of a set of avionic architectural modules which will be applicable to the family of launch vehicles required to support the Advanced Launch System (ALS). To enable ALS cost/performance requirements to be met, the MPRAS must support autonomy, maintenance, and testability capabilities which exceed those present in conventional launch vehicles. The multi-path redundant or fault tolerance characteristics of the MPRAS are necessary to offset a reduction in avionics reliability due to the increased complexity needed to support these new cost reduction and performance capabilities and to meet avionics reliability requirements which will provide cost-effective reductions in overall ALS recurring costs. A complex, real-time distributed computing system is needed to meet the ALS avionics system requirements. General Dynamics, Boeing Aerospace, and C.S. Draper Laboratory have proposed system architectures as candidates for the ALS MPRAS. The purpose of this document is to report the results of independent performance and reliability characterization and assessment analyses of each proposed candidate architecture and qualitative assessments of testability, maintainability, and fault tolerance mechanisms. These independent analyses were conducted as part of the MPRAS Part 2 program and were carried under NASA Langley Research Contract NAS1-17964, Task Assignment 28.

Cost Efficiency in Public Higher Education.

ERIC Educational Resources Information Center

Robst, John

This study used the frontier cost function framework to examine cost efficiency in public higher education. The frontier cost function estimates the minimum predicted cost for producing a given amount of output. Data from the annual Almanac issues of the "Chronicle of Higher Education" were used to calculate state level enrollments at two-year and…

The mid-IR silicon photonics sensor platform (Conference Presentation)

NASA Astrophysics Data System (ADS)

Kimerling, Lionel; Hu, Juejun; Agarwal, Anuradha M.

2017-02-01

Advances in integrated silicon photonics are enabling highly connected sensor networks that offer sensitivity, selectivity and pattern recognition. Cost, performance and the evolution path of the so-called `Internet of Things' will gate the proliferation of these networks. The wavelength spectral range of 3-8um, commonly known as the mid-IR, is critical to specificity for sensors that identify materials by detection of local vibrational modes, reflectivity and thermal emission. For ubiquitous sensing applications in this regime, the sensors must move from premium to commodity level manufacturing volumes and cost. Scaling performance/cost is critically dependent on establishing a minimum set of platform attributes for point, wearable, and physical sensing. Optical sensors are ideal for non-invasive applications. Optical sensor device physics involves evanescent or intra-cavity structures for applied to concentration, interrogation and photo-catalysis functions. The ultimate utility of a platform is dependent on sample delivery/presentation modalities; system reset, recalibration and maintenance capabilities; and sensitivity and selectivity performance. The attributes and performance of a unified Glass-on-Silicon platform has shown good prospects for heterogeneous integration on materials and devices using a low cost process flow. Integrated, single mode, silicon photonic platforms offer significant performance and cost advantages, but they require discovery and qualification of new materials and process integration schemes for the mid-IR. Waveguide integrated light sources based on rare earth dopants and Ge-pumped frequency combs have promise. Optical resonators and waveguide spirals can enhance sensitivity. PbTe materials are among the best choices for a standard, waveguide integrated photodetector. Chalcogenide glasses are capable of transmitting mid-IR signals with high transparency. Integrated sensor case studies of i) high sensitivity analyte detection in solution; ii) gas sensing in air and iii) on-chip spectrometry provide good insight into the tradeoffs being made en route to ubiquitous sensor deployment in an Internet of Things.

Interferometric weak measurement of photon polarization

NASA Astrophysics Data System (ADS)

Iinuma, Masataka; Suzuki, Yutaro; Taguchi, Gen; Kadoya, Yutaka; Hofmann, Holger F.

2011-10-01

We realize a minimum back-action quantum non-demolition measurement of variable strength on photon polarization in the diagonal(PM) basis by two-mode path interference. This method uses the phase difference between the positive (P) and negative (M) superpositions in the interference between the horizontal (H) and vertical (V) polarized paths in the input beam. Although the interference can not occur when the H and V polarizations are distinguishable, a well-controlled amount of interference is induced by erasing the H and V information using a coherent rotation of polarization toward a common diagonal polarization. This method is particularly suitable for the realization of weak measurements, where the control of the back-action is essential.

Scaling laws for ignition at the National Ignition Facility from first principles.

PubMed

Cheng, Baolian; Kwan, Thomas J T; Wang, Yi-Ming; Batha, Steven H

2013-10-01

We have developed an analytical physics model from fundamental physics principles and used the reduced one-dimensional model to derive a thermonuclear ignition criterion and implosion energy scaling laws applicable to inertial confinement fusion capsules. The scaling laws relate the fuel pressure and the minimum implosion energy required for ignition to the peak implosion velocity and the equation of state of the pusher and the hot fuel. When a specific low-entropy adiabat path is used for the cold fuel, our scaling laws recover the ignition threshold factor dependence on the implosion velocity, but when a high-entropy adiabat path is chosen, the model agrees with recent measurements.

Metastable phases of silver and gold in hexagonal structure

NASA Astrophysics Data System (ADS)

Jona, F.; Marcus, P. M.

2004-07-01

Metastable phases of silver and gold in hexagonal close-packed structures are investigated by means of first-principles total-energy calculations. Two different methods are employed to find the equilibrium states: determination of the minima along the hexagonal epitaxial Bain path, and direct determination of minima of the total energy by a new minimum-path procedure. Both metals have two equilibrium states at different values of the hexagonal axial ratio c/a. For both metals, the elastic constants show that the high-c/a states are stable, hence, since the ground states are face-centred cubic, these states represent hexagonal close-packed metastable phases. The elastic constants of the low-c/a states show that they are unstable.

On the formation of granulites

USGS Publications Warehouse

Bohlen, S.R.

1991-01-01

The tectonic settings for the formation and evolution of regional granulite terranes and the lowermost continental crust can be deduced from pressure-temperature-time (P-T-time) paths and constrained by petrological and geophysical considerations. P-T conditions deduced for regional granulites require transient, average geothermal gradients of greater than 35??C km-1, implying minimum heat flow in excess of 100 mW m-2. Such high heat flow is probably caused by magmatic heating. Tectonic settings wherein such conditions are found include convergent plate margins, continental rifts, hot spots and at the margins of large, deep-seated batholiths. Cooling paths can be constrained by solid-solid and devolatilization equilibria and geophysical modelling. -from Author

Optimal symmetric flight with an intermediate vehicle model

NASA Technical Reports Server (NTRS)

Menon, P. K. A.; Kelley, H. J.; Cliff, E. M.

1983-01-01

Optimal flight in the vertical plane with a vehicle model intermediate in complexity between the point-mass and energy models is studied. Flight-path angle takes on the role of a control variable. Range-open problems feature subarcs of vertical flight and singular subarcs. The class of altitude-speed-range-time optimization problems with fuel expenditure unspecified is investigated and some interesting phenomena uncovered. The maximum-lift-to-drag glide appears as part of the family, final-time-open, with appropriate initial and terminal transient exceeding level-flight drag, some members exhibiting oscillations. Oscillatory paths generally fail the Jacobi test for durations exceeding a period and furnish a minimum only for short-duration problems.

Stochastic Formalism for Thermally Driven Distribution Frontier: A Nonempirical Approach to the Potential Escape Problem

NASA Astrophysics Data System (ADS)

Akashi, Ryosuke; Nagornov, Yuri S.

2018-06-01

We develop a non-empirical scheme to search for the minimum-energy escape paths from the minima of the potential surface to unknown saddle points nearby. A stochastic algorithm is constructed to move the walkers up the surface through the potential valleys. This method employs only the local gradient and diagonal part of the Hessian matrix of the potential. An application to a two-dimensional model potential is presented to demonstrate the successful finding of the paths to the saddle points. The present scheme could serve as a starting point toward first-principles simulation of rare events across the potential basins free from empirical collective variables.

Analyzing Water's Optical Absorption

NASA Technical Reports Server (NTRS)

2002-01-01

A cooperative agreement between World Precision Instruments (WPI), Inc., and Stennis Space Center has led the UltraPath(TM) device, which provides a more efficient method for analyzing the optical absorption of water samples at sea. UltraPath is a unique, high-performance absorbance spectrophotometer with user-selectable light path lengths. It is an ideal tool for any study requiring precise and highly sensitive spectroscopic determination of analytes, either in the laboratory or the field. As a low-cost, rugged, and portable system capable of high- sensitivity measurements in widely divergent waters, UltraPath will help scientists examine the role that coastal ocean environments play in the global carbon cycle. UltraPath(TM) is a trademark of World Precision Instruments, Inc. LWCC(TM) is a trademark of World Precision Instruments, Inc.

For Teachers, a Better Kind of Pension Plan

ERIC Educational Resources Information Center

Winters, Marcus A.

2017-01-01

Public school teachers deserve a compensation system that puts them on a secure path toward retirement. The severely backloaded structure of today's public school teacher pension systems benefit only a small proportion of entering teachers while putting the rest on an insecure retirement path. But there is a cost-neutral solution to this problem…

VALIDATION OF A METHOD FOR ESTIMATING POLLUTION EMISSION RATES FROM AREA SOURCES USING OPEN-PATH FTIR SEPCTROSCOPY AND DISPERSION MODELING TECHNIQUES

EPA Science Inventory

The paper describes a methodology developed to estimate emissions factors for a variety of different area sources in a rapid, accurate, and cost effective manner. he methodology involves using an open-path Fourier transform infrared (FTIR) spectrometer to measure concentrations o...

Optimization of educational paths for higher education

NASA Astrophysics Data System (ADS)

Tarasyev, Alexandr A.; Agarkov, Gavriil; Medvedev, Aleksandr

2017-11-01

In our research, we combine the theory of economic behavior and the methodology of increasing efficiency of the human capital to estimate the optimal educational paths. We provide an optimization model for higher education process to analyze possible educational paths for each rational individual. The preferences of each rational individual are compared to the best economically possible educational path. The main factor of the individual choice, which is formed by the formation of optimal educational path, deals with higher salaries level in the chosen economic sector after graduation. Another factor that influences on the economic profit is the reduction of educational costs or the possibility of the budget support for the student. The main outcome of this research consists in correction of the governmental policy of investment in human capital based on the results of educational paths optimal control.

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

Granderson, G.D.

The purpose of the dissertation is to examine the impact of rate-of-return regulation on the cost of transporting natural gas in interstate commerce. Of particular interest is the effect of the regulation on the input choice of a firm. Does regulation induce a regulated firm to produce its selected level of output at greater than minimum cost The theoretical model is based on the work of Rolf Faere and James Logan who investigate the duality relationship between the cost and production functions of a rate-of-return regulated firm. Faere and Logan derive the cost function for a regulated firm as themore » minimum cost of producing the firm's selected level of output, subject to the regulatory constraint. The regulated cost function is used to recover the unregulated cost function. A firm's unregulated cost function is the minimum cost of producing its selected level of output. Characteristics of the production technology are obtained from duality between the production and unregulated cost functions. Using data on 20 pipeline companies from 1977 to 1987, the author estimates a random effects model that consists of a regulated cost function and its associated input share equations. The model is estimated as a set of seemingly unrelated regressions. The empirical results are used to test the Faere and Logan theory and the traditional Averch-Johnson hypothesis of overcapitalization. Parameter estimates are used to recover the unregulated cost function and to calculate the amount by which transportation costs are increased by the regulation of the industry. Empirical results show that a firm's transportation cost decreases as the allowed rate of return increases and the regulatory constraint becomes less tight. Elimination of the regulatory constraint would lead to a reduction in costs on average of 5.278%. There is evidence that firms overcapitalize on pipeline capital. There is inconclusive evidence on whether firms overcapitalized on compressor station capital.« less

Selecting quantitative water management measures at the river basin scale in a global change context

NASA Astrophysics Data System (ADS)

Girard, Corentin; Rinaudo, Jean-Daniel; Caballero, Yvan; Pulido-Velazquez, Manuel

2013-04-01

One of the main challenges in the implementation of the Water Framework Directive (WFD) in the European Union is the definition of programme of measures to reach the good status of the European water bodies. In areas where water scarcity is an issue, one of these challenges is the selection of water conservation and capacity expansion measures to ensure minimum environmental in-stream flow requirements. At the same time, the WFD calls for the use of economic analysis to identify the most cost-effective combination of measures at the river basin scale to achieve its objective. With this respect, hydro-economic river basin models, by integrating economics, environmental and hydrological aspects at the river basin scale in a consistent framework, represent a promising approach. This article presents a least-cost river basin optimization model (LCRBOM) that selects the combination of quantitative water management measures to meet environmental flows for future scenarios of agricultural and urban demand taken into account the impact of the climate change. The model has been implemented in a case study on a Mediterranean basin in the south of France, the Orb River basin. The water basin has been identified as in need for quantitative water management measures in order to reach the good status of its water bodies. The LCRBOM has been developed using GAMS, applying Mixed Integer Linear Programming. It is run to select the set of measures that minimizes the total annualized cost of the applied measures, while meeting the demands and minimum in-stream flow constraints. For the economic analysis, the programme of measures is composed of water conservation measures on agricultural and urban water demands. It compares them with measures mobilizing new water resources coming from groundwater, inter-basin transfers and improvement in reservoir operating rules. The total annual cost of each measure is calculated for each demand unit considering operation, maintenance and investment costs. The results show that by combining quantitative water management measures, the flow regime can be improved to better mimic the natural flow regime. However, the acceptability of the higher cost of the program of measures is not yet assessed. Other stages such as stakeholder participation and negotiation processes are as well required to design an acceptable programme of measures. For this purpose, this type of model opens the path to investigate the problems of equity issues, and measures and costs allocation among the stakeholders of the basin. Acknowledgments: The study has been partially supported by the Hérault General Council, the Languedoc-Rousillon Regional Council, the Rhône Mediterranean Corsica Water Agency and the BRGM, as well as the European Community 7th Framework Project GENESIS (n. 226536) on groundwater systems, and the Plan Nacional I+D+I 2008-2011 of the Spanish Ministry of Science and Innovation (subprojects CGL2009-13238-C02-01 and CGL2009-13238-C02-02).

Sequencing of a QTL-rich region of the Theobroma cacao genome using pooled BACs and the identification of trait specific candidate genes

USDA-ARS?s Scientific Manuscript database

Background: BAC-based physical maps provide for sequencing across an entire genome or selected sub-genome regions of biological interest. Using the minimum tiling path as a guide, it is possible to select specific BAC clones from prioritized genome sections such as a genetically defined QTL interv...

36 CFR § 1192.123 - Restrooms.

Code of Federal Regulations, 2013 CFR

2013-07-01

... the clear floor space at a lower height provided they can be easily folded up or moved out of the way. (2) The height of the water closet shall be 17 inches to 19 inches measured to the top of the toilet... complying with § 1192.125(d) and shall be connected to such a space by an unobstructed path having a minimum...

Officer Career Development: Modeling Married Aviator Retention

DTIC Science & Technology

1989-06-01

of turnover. That is, one in which individual, organizational, and environmental factors together determine career intent and turnover. The study...modifications were needed. The path analysis was consistent with a perspective of turnover in which individual, organizational, and environmental factors...has been confronted with dlecreasing percentages of pilots who remnain in the Navy more than 2 years beyond their Minimum Service Requiremient. The

Finding Out Critical Points For Real-Time Path Planning

NASA Astrophysics Data System (ADS)

Chen, Wei

1989-03-01

Path planning for a mobile robot is a classic topic, but the path planning under real-time environment is a different issue. The system sources including sampling time, processing time, processes communicating time, and memory space are very limited for this type of application. This paper presents a method which abstracts the world representation from the sensory data and makes the decision as to which point will be a potentially critical point to span the world map by using incomplete knowledge about physical world and heuristic rule. Without any previous knowledge or map of the workspace, the robot will determine the world map by roving through the workspace. The computational complexity for building and searching such a map is not more than O( n2 ) The find-path problem is well-known in robotics. Given an object with an initial location and orientation, a goal location and orientation, and a set of obstacles located in space, the problem is to find a continuous path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. There are a lot of methods to find a collision-free path in given environment. Techniques for solving this problem can be classified into three approaches: 1) the configuration space approach [1],[2],[3] which represents the polygonal obstacles by vertices in a graph. The idea is to determine those parts of the free space which a reference point of the moving object can occupy without colliding with any obstacles. A path is then found for the reference point through this truly free space. Dealing with rotations turns out to be a major difficulty with the approach, requiring complex geometric algorithms which are computationally expensive. 2) the direct representation of the free space using basic shape primitives such as convex polygons [4] and overlapping generalized cones [5]. 3) the combination of technique 1 and 2 [6] by which the space is divided into the primary convex region, overlap region and obstacle region, then obstacle boundaries with attribute values are represented by the vertices of the hypergraph. The primary convex region and overlap region are represented by hyperedges, the centroids of overlap form the critical points. The difficulty is generating segment graph and estimating of minimum path width. The all techniques mentioned above need previous knowledge about the world to make path planning and the computational cost is not low. They are not available in an unknow and uncertain environment. Due to limited system resources such as CPU time, memory size and knowledge about the special application in an intelligent system (such as mobile robot), it is necessary to use algorithms that provide the good decision which is feasible with the available resources in real time rather than the best answer that could be achieved in unlimited time with unlimited resources. A real-time path planner should meet following requirements: - Quickly abstract the representation of the world from the sensory data without any previous knowledge about the robot environment. - Easily update the world model to spell out the global-path map and to reflect changes in the robot environment. - Must make a decision of where the robot must go and which direction the range sensor should point to in real time with limited resources. The method presented here assumes that the data from range sensors has been processed by signal process unite. The path planner will guide the scan of range sensor, find critical points, make decision where the robot should go and which point is poten- tial critical point, generate the path map and monitor the robot moves to the given point. The program runs recursively until the goal is reached or the whole workspace is roved through.

Getting off the Bain path: Are there any metastable states of cubic elements?

NASA Astrophysics Data System (ADS)

Mehl, Michael J.; Boyer, Larry L.

2003-03-01

Body-centered and face-centered cubic crystals can be considered as special cases of a body-centered tetragonal crystal with c/a = 1 and 2, respectively. First-principles calculations along this Bain path show that elements with an fcc (bcc) ground state are elastically unstable with respect to a tetragonal distortion in the bcc (fcc) phase. Starting with a normally fcc element and calculating E(c/a) for c/a < 1 we find a local minimum near c/a = 2/3, while for a bcc element we find a local minimum at some c/a > 2. It is tempting to conclude that these bct minima, which are required by continuity, are metastable, but calculations by several authors show that, at least for Al, Cu, and Pd, the bct structures are unstable with respect to an orthorhombic distortion. We use a simple "magic strain" construction(L. L. Boyer, Acta Cryst. A) 45, FC29 (1989).(M. J. Mehl and L. L. Boyer, Phys. Rev. B) 43, 9498 (1991). to study the stability of these bct states, and present examples which suggest that no fcc or bcc element has a metastable bct state.

Magnetic Nanoparticle Thermometer: An Investigation of Minimum Error Transmission Path and AC Bias Error

PubMed Central

Du, Zhongzhou; Su, Rijian; Liu, Wenzhong; Huang, Zhixing

2015-01-01

The signal transmission module of a magnetic nanoparticle thermometer (MNPT) was established in this study to analyze the error sources introduced during the signal flow in the hardware system. The underlying error sources that significantly affected the precision of the MNPT were determined through mathematical modeling and simulation. A transfer module path with the minimum error in the hardware system was then proposed through the analysis of the variations of the system error caused by the significant error sources when the signal flew through the signal transmission module. In addition, a system parameter, named the signal-to-AC bias ratio (i.e., the ratio between the signal and AC bias), was identified as a direct determinant of the precision of the measured temperature. The temperature error was below 0.1 K when the signal-to-AC bias ratio was higher than 80 dB, and other system errors were not considered. The temperature error was below 0.1 K in the experiments with a commercial magnetic fluid (Sample SOR-10, Ocean Nanotechnology, Springdale, AR, USA) when the hardware system of the MNPT was designed with the aforementioned method. PMID:25875188

Non-isolated Resolving Sets of certain Graphs Cartesian Product with a Path

NASA Astrophysics Data System (ADS)

Hasibuan, I. M.; Salman, A. N. M.; Saputro, S. W.

2018-04-01

Let G be a connected, simple, and finite graph. For an ordered subset W = {w 1 , w 2 , · · ·, wk } of vertices in a graph G and a vertex v of G, the metric representation of v with respect to W is the k-vector r(v|W ) = (d(v, w 1), d(v, w 2), · · ·, d(v, wk )). The set W is called a resolving set for G if every vertex of G has a distinct representation. The minimum cardinality of W is called the metric dimension of G, denoted by dim(G). If the induced subgraph < W> has no isolated vertices, then W is called a non-isolated resolving set. The minimum cardinality of non-isolated resolving set of G is called the non-isolated resolving number of G, denoted by nr(G). In this paper, we consider H\\square {P}n that is a graph obtained from Cartesian product between a connected graph H and a path Pn . We determine nr(H\\square {P}n), for some classes of H, including cycles, complete graphs, complete bipartite graphs, and friendship graphs.

40 CFR 35.937-6 - Cost and price considerations.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 40 Protection of Environment 1 2011-07-01 2011-07-01 false Cost and price considerations. 35.937-6...) shall apply. (1) The candidate(s) selected for negotiation shall submit to the grantee for review...) Cost review. (1) The grantee shall review proposed subagreement costs. (2) As a minimum, proposed...

40 CFR 35.937-6 - Cost and price considerations.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 1 2010-07-01 2010-07-01 false Cost and price considerations. 35.937-6...) shall apply. (1) The candidate(s) selected for negotiation shall submit to the grantee for review...) Cost review. (1) The grantee shall review proposed subagreement costs. (2) As a minimum, proposed...

Cost-efficient scheduling of FAST observations

NASA Astrophysics Data System (ADS)

Luo, Qi; Zhao, Laiping; Yu, Ce; Xiao, Jian; Sun, Jizhou; Zhu, Ming; Zhong, Yi

2018-03-01

A cost-efficient schedule for the Five-hundred-meter Aperture Spherical radio Telescope (FAST) requires to maximize the number of observable proposals and the overall scientific priority, and minimize the overall slew-cost generated by telescope shifting, while taking into account the constraints including the astronomical objects visibility, user-defined observable times, avoiding Radio Frequency Interference (RFI). In this contribution, first we solve the problem of maximizing the number of observable proposals and scientific priority by modeling it as a Minimum Cost Maximum Flow (MCMF) problem. The optimal schedule can be found by any MCMF solution algorithm. Then, for minimizing the slew-cost of the generated schedule, we devise a maximally-matchable edges detection-based method to reduce the problem size, and propose a backtracking algorithm to find the perfect matching with minimum slew-cost. Experiments on a real dataset from NASA/IPAC Extragalactic Database (NED) show that, the proposed scheduler can increase the usage of available times with high scientific priority and reduce the slew-cost significantly in a very short time.

Four-dimensional guidance algorithms for aircraft in an air traffic control environment

NASA Technical Reports Server (NTRS)

Pecsvaradi, T.

1975-01-01

Theoretical development and computer implementation of three guidance algorithms are presented. From a small set of input parameters the algorithms generate the ground track, altitude profile, and speed profile required to implement an experimental 4-D guidance system. Given a sequence of waypoints that define a nominal flight path, the first algorithm generates a realistic, flyable ground track consisting of a sequence of straight line segments and circular arcs. Each circular turn is constrained by the minimum turning radius of the aircraft. The ground track and the specified waypoint altitudes are used as inputs to the second algorithm which generates the altitude profile. The altitude profile consists of piecewise constant flight path angle segments, each segment lying within specified upper and lower bounds. The third algorithm generates a feasible speed profile subject to constraints on the rate of change in speed, permissible speed ranges, and effects of wind. Flight path parameters are then combined into a chronological sequence to form the 4-D guidance vectors. These vectors can be used to drive the autopilot/autothrottle of the aircraft so that a 4-D flight path could be tracked completely automatically; or these vectors may be used to drive the flight director and other cockpit displays, thereby enabling the pilot to track a 4-D flight path manually.

47 CFR 24.243 - The cost-sharing formula.

Code of Federal Regulations, 2014 CFR

2014-10-01

...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC... control; power plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. C also includes...

47 CFR 24.243 - The cost-sharing formula.

Code of Federal Regulations, 2013 CFR

2013-10-01

...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC... control; power plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. C also includes...

47 CFR 24.243 - The cost-sharing formula.

Code of Federal Regulations, 2012 CFR

2012-10-01

...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC... control; power plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. C also includes...

47 CFR 24.243 - The cost-sharing formula.

Code of Federal Regulations, 2011 CFR

2011-10-01

...; monitoring or control equipment; engineering costs (design/path survey); installation; systems testing; FCC... control; power plant upgrade (if required); electrical grounding systems; Heating Ventilation and Air Conditioning (HVAC) (if required); alternate transport equipment; and leased facilities. C also includes...

A holistic framework for design of cost-effective minimum water utilization network.

PubMed

Wan Alwi, S R; Manan, Z A; Samingin, M H; Misran, N

2008-07-01

Water pinch analysis (WPA) is a well-established tool for the design of a maximum water recovery (MWR) network. MWR, which is primarily concerned with water recovery and regeneration, only partly addresses water minimization problem. Strictly speaking, WPA can only lead to maximum water recovery targets as opposed to the minimum water targets as widely claimed by researchers over the years. The minimum water targets can be achieved when all water minimization options including elimination, reduction, reuse/recycling, outsourcing and regeneration have been holistically applied. Even though WPA has been well established for synthesis of MWR network, research towards holistic water minimization has lagged behind. This paper describes a new holistic framework for designing a cost-effective minimum water network (CEMWN) for industry and urban systems. The framework consists of five key steps, i.e. (1) Specify the limiting water data, (2) Determine MWR targets, (3) Screen process changes using water management hierarchy (WMH), (4) Apply Systematic Hierarchical Approach for Resilient Process Screening (SHARPS) strategy, and (5) Design water network. Three key contributions have emerged from this work. First is a hierarchical approach for systematic screening of process changes guided by the WMH. Second is a set of four new heuristics for implementing process changes that considers the interactions among process changes options as well as among equipment and the implications of applying each process change on utility targets. Third is the SHARPS cost-screening technique to customize process changes and ultimately generate a minimum water utilization network that is cost-effective and affordable. The CEMWN holistic framework has been successfully implemented on semiconductor and mosque case studies and yielded results within the designer payback period criterion.

[Application of clinical nursing path in standard management of advanced schistosomiasis patients with splenomegaly].

PubMed

Yang, Liu; Liu, Juan-Juan

2013-04-01

To study the feasibility and effect of clinical nursing path in the standard management of advanced schistosomiasis patients with splenomegaly. A total of 64 advanced schistosomiasis patients with splenomegaly were randomly divided into a routine nursing group (control group) and a clinical nursing pathway group (CNP group), and the postoperative situation, average hospitalization days, cost of hospitalization and the satisfaction of the patients of the 2 groups were compared. The complications, average hospitalization days, costs of hospitalization in the CNP group were significantly decreased compared with those in the control group, and satisfaction rate of the patients in the CNP group increased from 81.25% to 100%. The implementation of CNP effectively reduces the length of hospitalization, costs and complications, and improves the satisfaction of the patients.

Quiet Short-Haul Research Airplane (QSRA) model select panel functional description

NASA Technical Reports Server (NTRS)

Watson, D. M.

1982-01-01

The QSRA, when equipped with programmable color cathode ray tube displays, a head up display, a general purpose digital computer and a microwave landing system receiver, will provide a capability to do handling qualities studies and terminal area operating systems experiments as well as to enhance an experimenter's ability to obtain repeatable aircraft performance data. The operating systems experiments include the capability to generate minimum fuel approach and departure paths and to conduct precision approaches to a STOLport runway. The mode select panel is designed to provide both the flexibility needed for a variety of flight test experiments and the minimum workload operation required by pilots flying into congested terminal traffic areas.

Path planning for mobile robot using the novel repulsive force algorithm

NASA Astrophysics Data System (ADS)

Sun, Siyue; Yin, Guoqiang; Li, Xueping

2018-01-01

A new type of repulsive force algorithm is proposed to solve the problem of local minimum and the target unreachable of the classic Artificial Potential Field (APF) method in this paper. The Gaussian function that is related to the distance between the robot and the target is added to the traditional repulsive force, solving the problem of the goal unreachable with the obstacle nearby; variable coefficient is added to the repulsive force component to resize the repulsive force, which can solve the local minimum problem when the robot, the obstacle and the target point are in the same line. The effectiveness of the algorithm is verified by simulation based on MATLAB and actual mobile robot platform.

Path Forward to Space Solar Power using the O'Neill - Glaser Model Modified for Climate Change Demand and Considering the Increasing Risk of Human Self-Extinction if Confined to Earth

NASA Technical Reports Server (NTRS)

Curreri, Peter A.; Nall, Mark

2013-01-01

The cost of energy is humanity's economic exchange rate with the universe. Space solar power is the first great step that our technological species has to utilize the energy of its star. The classic Peter Glaser Solar Power Satellite, SPS, and later designs collect a large area of solar energy in space and beam it back to Earth for use in the electric grid, but even with optimistic launch costs and technology innovation a clear economic path is not evident using Earth launch of SPS. O Neill in 1969 solved the transportation costs problem by a model that uses lunar and asteroid materials to build SPS and locates the labor force permanently in space (O Neill free space habitats). This solution closes the economics and predicts large profits after 17-35 years. However the costs of time have up to now prevented this solution. We discuss a strategy to move forward in SPS with the motivations to stop global warming and prevent human selfextinction. There are near term steps that can be taken that place us on this path forward. First, we must reevaluate the technologies for the classic model and update the parameters to current technology. As technological capability continues to increase exponentially, we need to understand when the monetary potential energy hills are small as the technology gets larger. But the chance for self-extinction, if humanity remains in a single vulnerable habitat, also increased exponentially with time. The path forward is to identify investment points while assessing the risks of non-action.

Evaluating the intersection of a regional wildlife connectivity network with highways.

PubMed

Cushman, Samuel A; Lewis, Jesse S; Landguth, Erin L

2013-01-01

Reliable predictions of regional-scale population connectivity are needed to prioritize conservation actions. However, there have been few examples of regional connectivity models that are empirically derived and validated. The central goals of this paper were to (1) evaluate the effectiveness of factorial least cost path corridor mapping on an empirical resistance surface in reflecting the frequency of highway crossings by American black bear, (2) predict the location and predicted intensity of use of movement corridors for American black bear, and (3) identify where these corridors cross major highways and rank the intensity of these crossings. We used factorial least cost path modeling coupled with resistant kernel analysis to predict a network of movement corridors across a 30.2 million hectare analysis area in Montana and Idaho, USA. Factorial least cost path corridor mapping was associated with the locations of actual bear highway crossings. We identified corridor-highway intersections and ranked these based on corridor strength. We found that a major wildlife crossing overpass structure was located close to one of the most intense predicted corridors, and that the vast majority of the predicted corridor network was "protected" under federal management. However, narrow, linear corridors connecting the Greater Yellowstone Ecosystem to the rest of the analysis area had limited protection by federal ownership, making these additionally vulnerable to habitat loss and fragmentation. Factorial least cost path modeling coupled with resistant kernel analysis provides detailed, synoptic information about connectivity across populations that vary in distribution and density in complex landscapes. Specifically, our results could be used to quantify the structure of the connectivity network, identify critical linkage nodes and core areas, map potential barriers and fracture zones, and prioritize locations for mitigation, restoration and conservation actions.

Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation

PubMed Central

Yu, Hongyi

2018-01-01

A novel geolocation architecture, termed “Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)” is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér–Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML. PMID:29562601

Direct Position Determination of Unknown Signals in the Presence of Multipath Propagation.

PubMed

Du, Jianping; Wang, Ding; Yu, Wanting; Yu, Hongyi

2018-03-17

A novel geolocation architecture, termed "Multiple Transponders and Multiple Receivers for Multiple Emitters Positioning System (MTRE)" is proposed in this paper. Existing Direct Position Determination (DPD) methods take advantage of a rather simple channel assumption (line of sight channels with complex path attenuations) and a simplified MUltiple SIgnal Classification (MUSIC) algorithm cost function to avoid the high dimension searching. We point out that the simplified assumption and cost function reduce the positioning accuracy because of the singularity of the array manifold in a multi-path environment. We present a DPD model for unknown signals in the presence of Multi-path Propagation (MP-DPD) in this paper. MP-DPD adds non-negative real path attenuation constraints to avoid the mistake caused by the singularity of the array manifold. The Multi-path Propagation MUSIC (MP-MUSIC) method and the Active Set Algorithm (ASA) are designed to reduce the dimension of searching. A Multi-path Propagation Maximum Likelihood (MP-ML) method is proposed in addition to overcome the limitation of MP-MUSIC in the sense of a time-sensitive application. An iterative algorithm and an approach of initial value setting are given to make the MP-ML time consumption acceptable. Numerical results validate the performances improvement of MP-MUSIC and MP-ML. A closed form of the Cramér-Rao Lower Bound (CRLB) is derived as a benchmark to evaluate the performances of MP-MUSIC and MP-ML.

Application of Climate Impact Metrics to Rotorcraft Design

NASA Technical Reports Server (NTRS)

Russell, Carl; Johnson, Wayne

2013-01-01

Multiple metrics are applied to the design of large civil rotorcraft, integrating minimum cost and minimum environmental impact. The design mission is passenger transport with similar range and capacity to a regional jet. Separate aircraft designs are generated for minimum empty weight, fuel burn, and environmental impact. A metric specifically developed for the design of aircraft is employed to evaluate emissions. The designs are generated using the NDARC rotorcraft sizing code, and rotor analysis is performed with the CAMRAD II aeromechanics code. Design and mission parameters such as wing loading, disk loading, and cruise altitude are varied to minimize both cost and environmental impact metrics. This paper presents the results of these parametric sweeps as well as the final aircraft designs.

Application of Climate Impact Metrics to Civil Tiltrotor Design

NASA Technical Reports Server (NTRS)

Russell, Carl R.; Johnson, Wayne

2013-01-01

Multiple metrics are applied to the design of a large civil tiltrotor, integrating minimum cost and minimum environmental impact. The design mission is passenger transport with similar range and capacity to a regional jet. Separate aircraft designs are generated for minimum empty weight, fuel burn, and environmental impact. A metric specifically developed for the design of aircraft is employed to evaluate emissions. The designs are generated using the NDARC rotorcraft sizing code, and rotor analysis is performed with the CAMRAD II aeromechanics code. Design and mission parameters such as wing loading, disk loading, and cruise altitude are varied to minimize both cost and environmental impact metrics. This paper presents the results of these parametric sweeps as well as the final aircraft designs.

Path planning for assembly of strut-based structures. Thesis

NASA Technical Reports Server (NTRS)

Muenger, Rolf

1991-01-01

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

Voltage scheduling for low power/energy

NASA Astrophysics Data System (ADS)

Manzak, Ali

2001-07-01

Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned to lower voltage levels (thus reducing the power consumption). A polynomial time resource and latency constrained scheduling algorithm is developed to distribute the available slack among the nodes such that power consumption is minimum. The algorithm is iterative and utilizes the slack based on the Lagrange multiplier method.

Wise Investment? Modeling Industry Profitability and Risk of Targeted Chemotherapy for Incurable Solid Cancers

PubMed Central

Conter, Henry J.; Chu, Quincy S.C.

2012-01-01

Purpose: Pharmaceutical development involves substantial financial risk. This risk, rising development costs, and the promotion of continued research and development have been cited as major drivers in the progressive increase in drug prices. Currently, cost-effective analyses are being used to determine the value of treatment. However, cost-effective analyses practically function as a threshold for value and do not directly address the rationale for drug prices. We set out to create a functional model for industry price decisions and clarify the minimum acceptable profitability of new drugs. Methods: Assuming that industry should only invest in profitable ventures, we employed a linear cost-volume-profit breakeven analysis to equate initial capital investment and risk and post–drug-approval profits, where drug development represents the bulk of investment. A Markov decision analysis model was also used to define the relationships between investment events risk. A systematic literature search was performed to determine event probabilities, clinical trial costs, and total expenses as inputs into the model. Disease-specific inputs, current market size across regions, and lengths of treatment for cancer types were also included. Results: With development of single novel chemotherapies costing from $802 to $1,042 million (2002 US dollars), pharmaceutical profits should range from $4.3 to $5.2 billion, with an expected rate of return on investment of 11% annually. However, diversification across cancer types for chemotherapy can reduce the minimum required profit to less than $3 billion. For optimal diversification, industry should study four tumor types per drug; however, nonprofit organizations could tolerate eight parallel development tracks to minimize the risk of development failure. Assuming that pharmaceutical companies hold exclusive rights for drug sales for only 5 years after market approval, the minimum required profit per drug per month per patient ranges from $294 for end-stage lung cancer to $3,231 for end-stage renal cell carcinoma. Conclusion: Pharmaceutical development in oncology is costly, with substantial risk, but is also highly profitable. Minimum acceptable profits per drug per month of treatment per patient vary with prevalence of disease, but they should be less than $5,000 per month of treatment in the developed world. Minimum acceptable profits may be lower for treatments with additional efficacy in the earlier stages of a tumor type. However, this type of event could not be statistically modeled. PMID:29447097

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

Optimization of solar cell contacts by system cost-per-watt minimization

NASA Technical Reports Server (NTRS)

Redfield, D.

1977-01-01

New, and considerably altered, optimum dimensions for solar-cell metallization patterns are found using the recently developed procedure whose optimization criterion is the minimum cost-per-watt effect on the entire photovoltaic system. It is also found that the optimum shadow fraction by the fine grid is independent of metal cost and resistivity as well as cell size. The optimum thickness of the fine grid metal depends on all these factors, and in familiar cases it should be appreciably greater than that found by less complete analyses. The optimum bus bar thickness is much greater than those generally used. The cost-per-watt penalty due to the need for increased amounts of metal per unit area on larger cells is determined quantitatively and thereby provides a criterion for the minimum benefits that must be obtained in other process steps to make larger cells cost effective.

Intelligent path loss prediction engine design using machine learning in the urban outdoor environment

NASA Astrophysics Data System (ADS)

Wang, Ruichen; Lu, Jingyang; Xu, Yiran; Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2018-05-01

Due to the progressive expansion of public mobile networks and the dramatic growth of the number of wireless users in recent years, researchers are motivated to study the radio propagation in urban environments and develop reliable and fast path loss prediction models. During last decades, different types of propagation models are developed for urban scenario path loss predictions such as the Hata model and the COST 231 model. In this paper, the path loss prediction model is thoroughly investigated using machine learning approaches. Different non-linear feature selection methods are deployed and investigated to reduce the computational complexity. The simulation results are provided to demonstratethe validity of the machine learning based path loss prediction engine, which can correctly determine the signal propagation in a wireless urban setting.

Defining Continuous Improvement and Cost Minimization Possibilities through School Choice Experiments

ERIC Educational Resources Information Center

Merrifield, John

2009-01-01

Studies of existing best practices cannot determine whether the current "best" schooling practices could be even better, less costly, or more effective and/or improve at a faster rate, but we can discover a cost effective menu of schooling options and each item's minimum cost through market accountability experiments. This paper describes…

Using the pallet costing system to determine costs and stay competitive in the pallet industry

Treesearch

A. Jefferson Jr. Palmer; Bruce G. Hansen; Bruce G. Hansen

2002-01-01

In order to stay competitive and keep production costs at a minimum, wood pallet manufacturers must plan, monitor, and control their various production activities. Cost information on pallet manufacturing operations, must be gathered and analyzed so that the plant manager can determine whether certain activities are efficient and profitable. The Pallet Costing System (...

Two paths from lab to market: Product and standard

NASA Astrophysics Data System (ADS)

Knapp, Robert H.

2018-01-01

To shed light on the movement of sustainable technologies from basic science to widespread use, this chapter describes key aspects of the quite different paths followed by two important examples—photovoltaics (a product) and passive-house buildings (a standard). Discussion of photovoltaics includes the experience curve concept, the increasing significance of balance-of-system costs, and the importance of market heterogeneity (niches and sub-national markets) to the long-term trajectory of major cost reductions. Discussion of passive-houses highlights the array of technical developments needed for present-day energy efficient houses, and the relevance of "stretch" standards to the development of a market for very high-performance houses.

Optimal Design and Operation of Permanent Irrigation Systems

NASA Astrophysics Data System (ADS)

Oron, Gideon; Walker, Wynn R.

1981-01-01

Solid-set pressurized irrigation system design and operation are studied with optimization techniques to determine the minimum cost distribution system. The principle of the analysis is to divide the irrigation system into subunits in such a manner that the trade-offs among energy, piping, and equipment costs are selected at the minimum cost point. The optimization procedure involves a nonlinear, mixed integer approach capable of achieving a variety of optimal solutions leading to significant conclusions with regard to the design and operation of the system. Factors investigated include field geometry, the effect of the pressure head, consumptive use rates, a smaller flow rate in the pipe system, and outlet (sprinkler or emitter) discharge.

A real-time path rating calculation tool powered by HPC

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

If transmission path ratings are determined in real time and optimized control methods can be implemented, congestion problems can be more effectively managed using the existing transmission assets, reducing congestion costs, avoiding capital expenditures for new physical assets, increasing revenues from the existing system, and maintaining reliability. In just one illustrative case, a BPA study has shown that a 1000-MW rating increase for a transmission path generates $15M in annual revenue, even if only 25% of the increased margin can be tapped for just 25% of the year.

Achieving cost-neutrality with long-acting reversible contraceptive methods.

PubMed

Trussell, James; Hassan, Fareen; Lowin, Julia; Law, Amy; Filonenko, Anna

2015-01-01

This analysis aimed to estimate the average annual cost of available reversible contraceptive methods in the United States. In line with literature suggesting long-acting reversible contraceptive (LARC) methods become increasingly cost-saving with extended duration of use, it aimed to also quantify minimum duration of use required for LARC methods to achieve cost-neutrality relative to other reversible contraceptive methods while taking into consideration discontinuation. A three-state economic model was developed to estimate relative costs of no method (chance), four short-acting reversible (SARC) methods (oral contraceptive, ring, patch and injection) and three LARC methods [implant, copper intrauterine device (IUD) and levonorgestrel intrauterine system (LNG-IUS) 20 mcg/24 h (total content 52 mg)]. The analysis was conducted over a 5-year time horizon in 1000 women aged 20-29 years. Method-specific failure and discontinuation rates were based on published literature. Costs associated with drug acquisition, administration and failure (defined as an unintended pregnancy) were considered. Key model outputs were annual average cost per method and minimum duration of LARC method usage to achieve cost-savings compared to SARC methods. The two least expensive methods were copper IUD ($304 per women, per year) and LNG-IUS 20 mcg/24 h ($308). Cost of SARC methods ranged between $432 (injection) and $730 (patch), per women, per year. A minimum of 2.1 years of LARC usage would result in cost-savings compared to SARC usage. This analysis finds that even if LARC methods are not used for their full durations of efficacy, they become cost-saving relative to SARC methods within 3 years of use. Previous economic arguments in support of using LARC methods have been criticized for not considering that LARC methods are not always used for their full duration of efficacy. This study calculated that cost-savings from LARC methods relative to SARC methods, with discontinuation rates considered, can be realized within 3 years. Copyright © 2014 Elsevier Inc. All rights reserved.

Achieving cost-neutrality with long-acting reversible contraceptive methods⋆

PubMed Central

Trussell, James; Hassan, Fareen; Lowin, Julia; Law, Amy; Filonenko, Anna

2014-01-01

Objectives This analysis aimed to estimate the average annual cost of available reversible contraceptive methods in the United States. In line with literature suggesting long-acting reversible contraceptive (LARC) methods become increasingly cost-saving with extended duration of use, it aimed to also quantify minimum duration of use required for LARC methods to achieve cost-neutrality relative to other reversible contraceptive methods while taking into consideration discontinuation. Study design A three-state economic model was developed to estimate relative costs of no method (chance), four short-acting reversible (SARC) methods (oral contraceptive, ring, patch and injection) and three LARC methods [implant, copper intrauterine device (IUD) and levonorgestrel intrauterine system (LNG-IUS) 20 mcg/24 h (total content 52 mg)]. The analysis was conducted over a 5-year time horizon in 1000 women aged 20–29 years. Method-specific failure and discontinuation rates were based on published literature. Costs associated with drug acquisition, administration and failure (defined as an unintended pregnancy) were considered. Key model outputs were annual average cost per method and minimum duration of LARC method usage to achieve cost-savings compared to SARC methods. Results The two least expensive methods were copper IUD ($304 per women, per year) and LNG-IUS 20 mcg/24 h ($308). Cost of SARC methods ranged between $432 (injection) and $730 (patch), per women, per year. A minimum of 2.1 years of LARC usage would result in cost-savings compared to SARC usage. Conclusions This analysis finds that even if LARC methods are not used for their full durations of efficacy, they become cost-saving relative to SARC methods within 3 years of use. Implications Previous economic arguments in support of using LARC methods have been criticized for not considering that LARC methods are not always used for their full duration of efficacy. This study calculated that cost-savings from LARC methods relative to SARC methods, with discontinuation rates considered, can be realized within 3 years. PMID:25282161

Space Nuclear Reactor Engineering

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

Poston, David Irvin

We needed to find a space reactor concept that could be attractive to NASA for flight and proven with a rapid turnaround, low-cost nuclear test. Heat-pipe-cooled reactors coupled to Stirling engines long identified as the easiest path to near-term, low-cost concept.

Economic optimization of the energy transport component of a large distributed solar power plant

NASA Technical Reports Server (NTRS)

Turner, R. H.

1976-01-01

A solar thermal power plant with a field of collectors, each locally heating some transport fluid, requires a pipe network system for eventual delivery of energy power generation equipment. For a given collector distribution and pipe network geometry, a technique is herein developed which manipulates basic cost information and physical data in order to design an energy transport system consistent with minimized cost constrained by a calculated technical performance. For a given transport fluid and collector conditions, the method determines the network pipe diameter and pipe thickness distribution and also insulation thickness distribution associated with minimum system cost; these relative distributions are unique. Transport losses, including pump work and heat leak, are calculated operating expenses and impact the total system cost. The minimum cost system is readily selected. The technique is demonstrated on six candidate transport fluids to emphasize which parameters dominate the system cost and to provide basic decision data. Three different power plant output sizes are evaluated in each case to determine severity of diseconomy of scale.

Optimal Control of Fully Routed Air Traffic in the Presence of Uncertainty and Kinodynamic Constraints

DTIC Science & Technology

2014-09-18

Operations and Developing Issues . . . . . . . . . . . . . . . . . . 6 2.1.2 Next-Generation Air Transportation System (NextGen...Air Traffic Management ESP Euclidean Shortest Path FAA Federal Aviation Administration FCFS First-Come-First-Served HCS Hybrid Control System KKT...Karush-Kuhn-Tucker LGR Legendre-Gauss-Radau MLD Minimum Lateral Distance NAS National Airspace System NASA National Aeronautics and Space Administration

[Maximization of economic yield, minimum cost optimal diets and cultivation diversification for small scale farmers of the highland region of Guatemala].

PubMed

Alarcón, J A; Immink, M D; Méndez, L F

1989-12-01

The present study was conducted as part of an evaluation of the economic and nutritional effects of a crop diversification program for small-scale farmers in the Western highlands of Guatemala. Linear programming models are employed in order to obtain optimal combinations of traditional and non-traditional food crops under different ecological conditions that: a) provide minimum cost diets for auto-consumption, and b) maximize net income and market availability of dietary energy. Data used were generated by means of an agroeconomic survey conducted in 1983 among 726 farming households. Food prices were obtained from the Institute of Agrarian Marketing; data on production costs, from the National Bank of Agricultural Development in Guatemala. The gestation periods for each crop were obtained from three different sources, and then averaged. The results indicated that the optimal cropping pattern for the minimum-cost diets for auto consumption include traditional foods (corn, beans, broad bean, wheat, potato), non-traditional foods (carrots, broccoli, beets) and foods of animal origin (milk, eggs). A significant number of farmers included in the sample did not have sufficient land availability to produce all foods included in the minimum-cost diet. Cropping patterns which maximize net incomes include only non-traditional foods: onions, carrots, broccoli and beets for farmers in the low highland areas, and raddish, broccoli, cauliflower and carrots for farmers in the higher parts. Optimal cropping patterns which maximize market availability of dietary energy include traditional and non-traditional foods; for farmers in the lower areas: wheat, corn, beets, carrots and onions; for farmers in the higher areas: potato, wheat, raddish, carrots and cabbage.

Energy-optimal path planning in the coastal ocean

NASA Astrophysics Data System (ADS)

Subramani, Deepak N.; Haley, Patrick J.; Lermusiaux, Pierre F. J.

2017-05-01

We integrate data-driven ocean modeling with the stochastic Dynamically Orthogonal (DO) level-set optimization methodology to compute and study energy-optimal paths, speeds, and headings for ocean vehicles in the Middle-Atlantic Bight (MAB) region. We hindcast the energy-optimal paths from among exact time-optimal paths for the period 28 August 2006 to 9 September 2006. To do so, we first obtain a data-assimilative multiscale reanalysis, combining ocean observations with implicit two-way nested multiresolution primitive-equation simulations of the tidal-to-mesoscale dynamics in the region. Second, we solve the reduced-order stochastic DO level-set partial differential equations (PDEs) to compute the joint probability of minimum arrival time, vehicle-speed time series, and total energy utilized. Third, for each arrival time, we select the vehicle-speed time series that minimize the total energy utilization from the marginal probability of vehicle-speed and total energy. The corresponding energy-optimal path and headings are obtained through the exact particle-backtracking equation. Theoretically, the present methodology is PDE-based and provides fundamental energy-optimal predictions without heuristics. Computationally, it is 3-4 orders of magnitude faster than direct Monte Carlo methods. For the missions considered, we analyze the effects of the regional tidal currents, strong wind events, coastal jets, shelfbreak front, and other local circulations on the energy-optimal paths. Results showcase the opportunities for vehicles that intelligently utilize the ocean environment to minimize energy usage, rigorously integrating ocean forecasting with optimal control of autonomous vehicles.

Magnetic Resonance Imaging of Optic Nerve Traction During Adduction in Primary Open-Angle Glaucoma With Normal Intraocular Pressure

PubMed Central

Demer, Joseph L.; Clark, Robert A.; Suh, Soh Youn; Giaconi, JoAnn A.; Nouri-Mahdavi, Kouros; Law, Simon K.; Bonelli, Laura; Coleman, Anne L.; Caprioli, Joseph

2017-01-01

Purpose We used magnetic resonance imaging (MRI) to ascertain effects of optic nerve (ON) traction in adduction, a phenomenon proposed as neuropathic in primary open-angle glaucoma (POAG). Methods Seventeen patients with POAG and maximal IOP ≤ 20 mm Hg, and 31 controls underwent MRI in central gaze and 20° to 30° abduction and adduction. Optic nerve and sheath area centroids permitted computation of midorbital lengths versus minimum paths. Results Average mean deviation (±SEM) was −8.2 ± 1.2 dB in the 15 patients with POAG having interpretable perimetry. In central gaze, ON path length in POAG was significantly more redundant (104.5 ± 0.4% of geometric minimum) than in controls (102.9 ± 0.4%, P = 2.96 × 10−4). In both groups the ON became significantly straighter in adduction (28.6 ± 0.8° in POAG, 26.8 ± 1.1° in controls) than central gaze and abduction. In adduction, the ON in POAG straightened to 102.0% ± 0.2% of minimum path length versus 104.5% ± 0.4% in central gaze (P = 5.7 × 10−7), compared with controls who straightened to 101.6% ± 0.1% from 102.9% ± 0.3% in central gaze (P = 8.7 × 10−6); and globes retracted 0.73 ± 0.09 mm in POAG, but only 0.07 ± 0.08 mm in controls (P = 8.8 × 10−7). Both effects were confirmed in age-matched controls, and remained significant after correction for significant effects of age and axial globe length (P = 0.005). Conclusions Although tethering and elongation of ON and sheath are normal in adduction, adduction is associated with abnormally great globe retraction in POAG without elevated IOP. Traction in adduction may cause mechanical overloading of the ON head and peripapillary sclera, thus contributing to or resulting from the optic neuropathy of glaucoma independent of IOP. PMID:28829843

Strategies for Choosing Descent Flight-Path Angles for Small Jets

NASA Technical Reports Server (NTRS)

Wu, Minghong Gilbert; Green, Steven M.

2012-01-01

Three candidate strategies for choosing the descent flight path angle (FPA) for small jets are proposed, analyzed, and compared for fuel efficiency under arrival metering conditions. The strategies vary in operational complexity from a universally fixed FPA, or FPA function that varies with descent speed for improved fuel efficiency, to the minimum-fuel FPA computed for each flight based on winds, route, and speed profile. Methodologies for selecting the parameter for the first two strategies are described. The differences in fuel burn are analyzed over a year s worth of arrival traffic and atmospheric conditions recorded for the Dallas/Fort Worth (DFW) Airport during 2011. The results show that the universally fixed FPA strategy (same FPA for all flights, all year) burns on average 26 lbs more fuel per flight as compared to the minimum-fuel solution. This FPA is adapted to the arrival gate (direction of entry to the terminal) and various timespans (season, month and day) to improve fuel efficiency. Compared to a typical FPA of approximately 3 degrees the adapted FPAs vary significantly, up to 1.3 from one arrival gate to another or up to 1.4 from one day to another. Adapting the universally fixed FPA strategy to the arrival gate or to each day reduces the extra fuel burn relative to the minimum-fuel solution by 27% and 34%, respectively. The adaptations to gate and time combined shows up to 57% reduction of the extra fuel burn. The second strategy, an FPA function, contributes a 17% reduction in the 26 lbs of extra fuel burn over the universally fixed FPA strategy. Compared to the corresponding adaptations of the universally fixed FPA, adaptations of the FPA function reduce the extra fuel burn anywhere from 15-23% depending on the extent of adaptation. The combined effect of the FPA function strategy with both directional and temporal adaptation recovers 67% of the extra fuel relative to the minimum-fuel solution.

Dynamic compression and volatile release of carbonates

NASA Technical Reports Server (NTRS)

Tyburczy, J. A.; Ahrens, T. J.

1984-01-01

Particle velocity profiles upon shock compression and isentropic releases were measured for polycrystalline calcite. The Solenhofen limestone release paths lie, close to the Hugoniot. Calcite 3 to 2 transition, upon release, was observed, but rarefaction shocks were not detected. The equation of state is used to predict the fraction of material devolatilized upon isentropic release as a function of shock pressure. The effect of ambient partial pressure of CO2 on the calculations is demonstrated and considered in models of atmospheric evolution by impact induced mineral devolatilization. The radiative characteristics of shocked calcite indicate that localization of thermal energy occurs under shock compression. Shock entropy calculations result in a minimum estimate of 90% devolatilization upon complete release from 10 GPa. Isentropic release paths from calculated continuum Hugoniot temperatures cross into the CaO (solid) + CO2 (vapor) field at improbably low pressures. It is found that release paths from measured shock temperatures cross into the melt plus vapor field at pressures greater than .5 GPa, which suggests that devolatilization is initiated at the shear banding sites.

Perspective: Maximum caliber is a general variational principle for dynamical systems

NASA Astrophysics Data System (ADS)

Dixit, Purushottam D.; Wagoner, Jason; Weistuch, Corey; Pressé, Steve; Ghosh, Kingshuk; Dill, Ken A.

2018-01-01

We review here Maximum Caliber (Max Cal), a general variational principle for inferring distributions of paths in dynamical processes and networks. Max Cal is to dynamical trajectories what the principle of maximum entropy is to equilibrium states or stationary populations. In Max Cal, you maximize a path entropy over all possible pathways, subject to dynamical constraints, in order to predict relative path weights. Many well-known relationships of non-equilibrium statistical physics—such as the Green-Kubo fluctuation-dissipation relations, Onsager's reciprocal relations, and Prigogine's minimum entropy production—are limited to near-equilibrium processes. Max Cal is more general. While it can readily derive these results under those limits, Max Cal is also applicable far from equilibrium. We give examples of Max Cal as a method of inference about trajectory distributions from limited data, finding reaction coordinates in bio-molecular simulations, and modeling the complex dynamics of non-thermal systems such as gene regulatory networks or the collective firing of neurons. We also survey its basis in principle and some limitations.

Perspective: Maximum caliber is a general variational principle for dynamical systems.

PubMed

Dixit, Purushottam D; Wagoner, Jason; Weistuch, Corey; Pressé, Steve; Ghosh, Kingshuk; Dill, Ken A

2018-01-07

We review here Maximum Caliber (Max Cal), a general variational principle for inferring distributions of paths in dynamical processes and networks. Max Cal is to dynamical trajectories what the principle of maximum entropy is to equilibrium states or stationary populations. In Max Cal, you maximize a path entropy over all possible pathways, subject to dynamical constraints, in order to predict relative path weights. Many well-known relationships of non-equilibrium statistical physics-such as the Green-Kubo fluctuation-dissipation relations, Onsager's reciprocal relations, and Prigogine's minimum entropy production-are limited to near-equilibrium processes. Max Cal is more general. While it can readily derive these results under those limits, Max Cal is also applicable far from equilibrium. We give examples of Max Cal as a method of inference about trajectory distributions from limited data, finding reaction coordinates in bio-molecular simulations, and modeling the complex dynamics of non-thermal systems such as gene regulatory networks or the collective firing of neurons. We also survey its basis in principle and some limitations.

Solar corona electron density distribution

NASA Astrophysics Data System (ADS)

Esposito, P. B.; Edenhofer, P.; Lueneburg, E.

1980-07-01

The paper discusses the three and one-half months of single-frequency time delay data which were acquired from the Helios 2 spacecraft around the time of its solar occultation. The excess time delay due to integrated effect of free electrons along the signal's ray path could be separated and modeled following the determination of the spacecraft trajectory. An average solar corona and equatorial electron density profile during solar minimum were deduced from the time delay measurements acquired within 5-60 solar radii of the sun. As a point of reference at 10 solar radii from the sun, an average electron density was 4500 el/cu cm. However, an asymmetry was found in the electron density as the ray path moved from the west to east solar limb. This may be related to the fact that during entry into occultation the heliographic latitude of the ray path was about 6 deg, while during exit it was 7 deg. The Helios density model is compared with similar models deduced from different experimental techniques.

7 CFR 1710.205 - Minimum approval requirements for all load forecasts.

Code of Federal Regulations, 2014 CFR

2014-01-01

... computer software applications. RUS will evaluate borrower load forecasts for readability, understanding..., distribution costs, other systems costs, average revenue per kWh, and inflation. Also, a borrower's engineering...

Price of anarchy on heterogeneous traffic-flow networks

NASA Astrophysics Data System (ADS)

Rose, A.; O'Dea, R.; Hopcraft, K. I.

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability—parameterized by the proportion of variable-cost links in the network—changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

Price of anarchy on heterogeneous traffic-flow networks.

PubMed

Rose, A; O'Dea, R; Hopcraft, K I

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability-parameterized by the proportion of variable-cost links in the network-changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

Cost-of-illness study in a retrospective cohort of patients with dementia in Lima, Peru

PubMed Central

Custodio, Nilton; Lira, David; Herrera-Perez, Eder; del Prado, Liza Nuñez; Parodi, José; Guevara-Silva, Erik; Castro-Suarez, Sheila; Montesinos, Rosa

2015-01-01

Dementia is a major cause of dependency and disability among older persons, and imposes huge economic burdens. Only a few cost-of-illness studies for dementia have been carried out in middle and low-income countries. Objective The aim of this study was to analyze costs of dementia in demented patients of a private clinic in Lima, Peru. Methods. We performed a retrospective, cohort, 3-month study by extracting information from medical records of demented patients to assess the use of both healthcare and non-healthcare resources. The total costs of the disease were broken down into direct (medical and social care costs) and indirect costs (informal care costs). Results. In 136 outpatients, we observed that while half of non-demented patients had total care costs of less than US$ 23 over three months, demented patients had costs of US$ 1500 or over (and more than US$ 1860 for frontotemporal dementia). In our study, the monthly cost of a demented patient (US$ 570) was 2.5 times higher than the minimum wage (legal minimum monthly wage in Peru for 2011: US$ 222.22). Conclusion. Dementia constitutes a socioeconomic problem even in developing countries, since patients involve high healthcare and non-healthcare costs, with the costs being especially high for the patient's family. PMID:29213939

Cost-of-illness study in a retrospective cohort of patients with dementia in Lima, Peru.

PubMed

Custodio, Nilton; Lira, David; Herrera-Perez, Eder; Del Prado, Liza Nuñez; Parodi, José; Guevara-Silva, Erik; Castro-Suarez, Sheila; Montesinos, Rosa

2015-01-01

Dementia is a major cause of dependency and disability among older persons, and imposes huge economic burdens. Only a few cost-of-illness studies for dementia have been carried out in middle and low-income countries. The aim of this study was to analyze costs of dementia in demented patients of a private clinic in Lima, Peru. We performed a retrospective, cohort, 3-month study by extracting information from medical records of demented patients to assess the use of both healthcare and non-healthcare resources. The total costs of the disease were broken down into direct (medical and social care costs) and indirect costs (informal care costs). In 136 outpatients, we observed that while half of non-demented patients had total care costs of less than US$ 23 over three months, demented patients had costs of US$ 1500 or over (and more than US$ 1860 for frontotemporal dementia). In our study, the monthly cost of a demented patient (US$ 570) was 2.5 times higher than the minimum wage (legal minimum monthly wage in Peru for 2011: US$ 222.22). Dementia constitutes a socioeconomic problem even in developing countries, since patients involve high healthcare and non-healthcare costs, with the costs being especially high for the patient's family.

FACTOR - FACTOR II. Departmental Program and Model Documentation 71-3.

ERIC Educational Resources Information Center

Wilson, Stanley; Billingsley, Ray

This computer program is designed to optimize a Cobb-Douglas type of production function. The user of this program may choose isoquants and/or the expansion path for a Cobb-Douglas type of production function with up to nine resources. An expansion path is the combination of quantities of each resource that minimizes the cost at each production…

Do-It-Yourself Critical Path Method.

ERIC Educational Resources Information Center

Morris, Edward P., Jr.

This report describes the critical path method (CPM), a system for planning and scheduling work to get the best time-cost combination for any particular job. With the use of diagrams, the report describes how CPM works on a step-by-step basis. CPM uses a network to show which parts of a job must be done and how they would eventually fit together…

From diets to foods: using linear programming to formulate a nutritious, minimum-cost porridge mix for children aged 1 to 2 years.

PubMed

De Carvalho, Irene Stuart Torrié; Granfeldt, Yvonne; Dejmek, Petr; Håkansson, Andreas

2015-03-01

Linear programming has been used extensively as a tool for nutritional recommendations. Extending the methodology to food formulation presents new challenges, since not all combinations of nutritious ingredients will produce an acceptable food. Furthermore, it would help in implementation and in ensuring the feasibility of the suggested recommendations. To extend the previously used linear programming methodology from diet optimization to food formulation using consistency constraints. In addition, to exemplify usability using the case of a porridge mix formulation for emergency situations in rural Mozambique. The linear programming method was extended with a consistency constraint based on previously published empirical studies on swelling of starch in soft porridges. The new method was exemplified using the formulation of a nutritious, minimum-cost porridge mix for children aged 1 to 2 years for use as a complete relief food, based primarily on local ingredients, in rural Mozambique. A nutritious porridge fulfilling the consistency constraints was found; however, the minimum cost was unfeasible with local ingredients only. This illustrates the challenges in formulating nutritious yet economically feasible foods from local ingredients. The high cost was caused by the high cost of mineral-rich foods. A nutritious, low-cost porridge that fulfills the consistency constraints was obtained by including supplements of zinc and calcium salts as ingredients. The optimizations were successful in fulfilling all constraints and provided a feasible porridge, showing that the extended constrained linear programming methodology provides a systematic tool for designing nutritious foods.

Life-Cycle Cost/Benefit Assessment of Expedite Departure Path (EDP)

NASA Technical Reports Server (NTRS)

Wang, Jianzhong Jay; Chang, Paul; Datta, Koushik

2005-01-01

This report presents a life-cycle cost/benefit assessment (LCCBA) of Expedite Departure Path (EDP), an air traffic control Decision Support Tool (DST) currently under development at NASA. This assessment is an update of a previous study performed by bd Systems, Inc. (bd) during FY01, with the following revisions: The life-cycle cost assessment methodology developed by bd for the previous study was refined and calibrated using Free Flight Phase 1 (FFP1) cost information for Traffic Management Advisor (TMA, or TMA-SC in the FAA's terminology). Adjustments were also made to the site selection and deployment scheduling methodology to include airspace complexity as a factor. This technique was also applied to the benefit extrapolation methodology to better estimate potential benefits for other years, and at other sites. This study employed a new benefit estimating methodology because bd s previous single year potential benefit assessment of EDP used unrealistic assumptions that resulted in optimistic estimates. This methodology uses an air traffic simulation approach to reasonably predict the impacts from the implementation of EDP. The results of the costs and benefits analyses were then integrated into a life-cycle cost/benefit assessment.

The financial burden of surgical and endovascular treatment of diabetic foot wounds.

PubMed

Joret, Maximilian O; Dean, Anastasia; Cao, Colin; Stewart, Joanna; Bhamidipaty, Venu

2016-09-01

The cost of treating diabetes-related disease in New Zealand is increasing and is expected to reach New Zealand dollars (NZD) 1.8 billion in 2021. The financial burden attached to the treatment of diabetic foot wounds is difficult to quantify and reported costs of treatment vary greatly in the literature. As of yet, no study has captured the true total cost of treating a diabetic foot wound. In this study, we investigate the total minimum cost of treating a diabetic foot ulcer at a tertiary institution. A retrospective audit of hospital and interhospital records was performed to identify adult patients with diabetes who were treated operatively for a diabetic foot wound by the department of vascular surgery at Auckland Hospital between January 2009 and June 2014. Costs from the patients' admissions and outpatient clinics from their first meeting to the achievement of a final outcome were tallied to calculate the total cost of healing the wound. The hospital's expenses were calculated using a fully absorbed activity-based costing methodology and correlated with a variety of demographic and clinical factors extracted from patients' electronic records using a general linear mixed model. We identified 225 patients accounting for 265 wound episodes, 700 inpatient admissions, 815 outpatient consultations, 367 surgical procedures, and 248 endovascular procedures. The total minimum cost to the Auckland city hospital was NZD 10,217,115 (NZD 9,886,963 inpatient costs; NZD 330,152 outpatient costs). The median cost per wound episode was NZD 29,537 (NZD 28,491 inpatient costs; NZD 834 outpatient cost). Wound healing was achieved in 70% of wound episodes (average length of healing, 9 months); 19% of wounds had not healed before the patient's death. Of every 3.5 wound episodes, one required a major amputation. Wound treatment modality, particularly surgical management, was the strongest predictor of high resource utilization. Wounds treated with endovascular intervention and no surgical intervention cost less. Surgical management (indiscriminate of type) was associated with faster wound healing than wounds managed endovascularly (median duration, 140 vs 224 days). Clinical risk factors including smoking, ischemic heart disease, hypercholesterolemia, hypertension, and chronic kidney disease did not affect treatment cost significantly. We estimate the minimum median cost incurred by our department of vascular surgery in treating a diabetic foot wound to be NZD 30,000 and identify wound treatment modality to be a significant determinant of cost. While readily acknowledging our study's inherent limitations, we believe it provides a real-world representation of the minimum total cost involved in treating diabetic foot lesions in a tertiary center. Given the increasing rate of diabetes, we believe this high cost reinforces the need for the establishment of a multidisciplinary diabetic foot team in our region. Copyright © 2016 Society for Vascular Surgery. Published by Elsevier Inc. All rights reserved.

Balancing building and maintenance costs in growing transport networks

NASA Astrophysics Data System (ADS)

Bottinelli, Arianna; Louf, Rémi; Gherardi, Marco

2017-09-01

The costs associated to the length of links impose unavoidable constraints to the growth of natural and artificial transport networks. When future network developments cannot be predicted, the costs of building and maintaining connections cannot be minimized simultaneously, requiring competing optimization mechanisms. Here, we study a one-parameter nonequilibrium model driven by an optimization functional, defined as the convex combination of building cost and maintenance cost. By varying the coefficient of the combination, the model interpolates between global and local length minimization, i.e., between minimum spanning trees and a local version known as dynamical minimum spanning trees. We show that cost balance within this ensemble of dynamical networks is a sufficient ingredient for the emergence of tradeoffs between the network's total length and transport efficiency, and of optimal strategies of construction. At the transition between two qualitatively different regimes, the dynamics builds up power-law distributed waiting times between global rearrangements, indicating a point of nonoptimality. Finally, we use our model as a framework to analyze empirical ant trail networks, showing its relevance as a null model for cost-constrained network formation.

Distributed multiple path routing in complex networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

2016-12-01

Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

The long-term impact of employment on mental health service use and costs for persons with severe mental illness.

PubMed

Bush, Philip W; Drake, Robert E; Xie, Haiyi; McHugo, Gregory J; Haslett, William R

2009-08-01

Stable employment promotes recovery for persons with severe mental illness by enhancing income and quality of life, but its impact on mental health costs has been unclear. This study examined service cost over ten years among participants in a co-occurring disorders study. Latent-class growth analysis of competitive employment identified trajectory groups. The authors calculated annual costs of outpatient services and institutional stays for 187 participants and examined group differences in ten-year utilization and cost. A steady-work group (N=51) included individuals whose work hours increased rapidly and then stabilized to average 5,060 hours per person over ten years. A late-work group (N=57) and a no-work group (N=79) did not differ significantly in utilization or cost outcomes, so they were combined into a minimum-work group (N=136). More education, a bipolar disorder diagnosis (versus schizophrenia or schizoaffective disorder), work in the past year, and lower scores on the expanded Brief Psychiatric Rating Scale predicted membership in the steady-work group. These variables were controlled for in the outcomes analysis. Use of outpatient services for the steady-work group declined at a significantly greater rate than it did for the minimum-work group, while institutional (hospital, jail, or prison) stays declined for both groups without a significant difference. The average cost per participant for outpatient services and institutional stays for the minimum-work group exceeded that of the steady-work group by $166,350 over ten years. Highly significant reductions in service use were associated with steady employment. Given supported employment's well-established contributions to recovery, evidence of long-term reductions in the cost of mental health services should lead policy makers and insurers to promote wider implementation.

CIDR

Science.gov Websites

* Minimum # Experimental Samples DNA Volume (ul) Genomic DNA Concentration (ng/ul) Low Input DNA Volume (ul . **Please inquire about additional cost for low input option. Genotyping Minimum # Experimental Samples DNA sample quality. If you do submit WGA samples, you should anticipate a higher non-random missing data rate

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

NASA Astrophysics Data System (ADS)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

Rate based failure detection

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

Johnson, Brett Emery Trabun; Gamage, Thoshitha Thanushka; Bakken, David Edward

This disclosure describes, in part, a system management component and failure detection component for use in a power grid data network to identify anomalies within the network and systematically adjust the quality of service of data published by publishers and subscribed to by subscribers within the network. In one implementation, subscribers may identify a desired data rate, a minimum acceptable data rate, desired latency, minimum acceptable latency and a priority for each subscription. The failure detection component may identify an anomaly within the network and a source of the anomaly. Based on the identified anomaly, data rates and or datamore » paths may be adjusted in real-time to ensure that the power grid data network does not become overloaded and/or fail.« less

Analysis of electric vehicle's trip cost allowing late arrival

NASA Astrophysics Data System (ADS)

Leng, Jun-Qiang; Liu, Wei-Yi; Zhao, Lin

2017-05-01

In this paper, we use a car-following model to study each electric vehicle's trip cost and the total trip cost allowing late arrival. The numerical result show that the electricity cost has great effects on each commuter's trip cost and the total trip costs and that these effects are dependent on each commuter's time headway at the origin, but the electricity cost has no prominent impacts on the minimum value of total trip cost under each commuter's different time headway at the origin.

Analysis of electric vehicle's trip cost without late arrival

NASA Astrophysics Data System (ADS)

Leng, Jun-Qiang; Zhao, Lin

2017-03-01

In this paper, we use a car-following model to study each electric vehicle's trip cost and the corresponding total trip cost without late arrival. The numerical result show that the electricity cost has significant effects on each electric vehicle's trip cost and the corresponding total trip costs and that the effects are dependent on its time headway at the origin, but the electricity cost has no prominent effects on the minimum value of the system's total trip cost.

49 CFR 1152.27 - Financial assistance procedures.

Code of Federal Regulations, 2011 CFR

2011-10-01

... (including the cost of transporting removed materials to point of sale or point of storage for relay use... constitutional minimum value is computed without regard to labor protection costs. (7) Within 10 days of the...

49 CFR 1152.27 - Financial assistance procedures.

Code of Federal Regulations, 2010 CFR

2010-10-01

... (including the cost of transporting removed materials to point of sale or point of storage for relay use... constitutional minimum value is computed without regard to labor protection costs. (7) Within 10 days of the...

Validity and reliability of the Nintendo Wii Balance Board for assessment of standing balance.

PubMed

Clark, Ross A; Bryant, Adam L; Pua, Yonghao; McCrory, Paul; Bennell, Kim; Hunt, Michael

2010-03-01

Impaired standing balance has a detrimental effect on a person's functional ability and increases their risk of falling. There is currently no validated system which can precisely quantify center of pressure (COP), an important component of standing balance, while being inexpensive, portable and widely available. The Wii Balance Board (WBB) fits these criteria, and we examined its validity in comparison with the 'gold standard'-a laboratory-grade force platform (FP). Thirty subjects without lower limb pathology performed a combination of single and double leg standing balance tests with eyes open or closed on two separate occasions. Data from the WBB were acquired using a laptop computer. The test-retest reliability for COP path length for each of the testing devices, including a comparison of the WBB and FP data, was examined using intraclass correlation coefficients (ICC), Bland-Altman plots (BAP) and minimum detectable change (MDC). Both devices exhibited good to excellent COP path length test-retest reliability within-device (ICC=0.66-0.94) and between-device (ICC=0.77-0.89) on all testing protocols. Examination of the BAP revealed no relationship between the difference and the mean in any test, however the MDC values for the WBB did exceed those of the FP in three of the four tests. These findings suggest that the WBB is a valid tool for assessing standing balance. Given that the WBB is portable, widely available and a fraction of the cost of a FP, it could provide the average clinician with a standing balance assessment tool suitable for the clinical setting. Copyright 2009 Elsevier B.V. All rights reserved.

Improved multi-objective ant colony optimization algorithm and its application in complex reasoning

NASA Astrophysics Data System (ADS)

Wang, Xinqing; Zhao, Yang; Wang, Dong; Zhu, Huijie; Zhang, Qing

2013-09-01

The problem of fault reasoning has aroused great concern in scientific and engineering fields. However, fault investigation and reasoning of complex system is not a simple reasoning decision-making problem. It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints. So far, little research has been carried out in this field. This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes. Three optimization objectives are considered simultaneously: maximum probability of average fault, maximum average importance, and minimum average complexity of test. Under the constraints of both known symptoms and the causal relationship among different components, a multi-objective optimization mathematical model is set up, taking minimizing cost of fault reasoning as the target function. Since the problem is non-deterministic polynomial-hard(NP-hard), a modified multi-objective ant colony algorithm is proposed, in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives. At last, a Pareto optimal set is acquired. Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set, through which the final fault causes can be identified according to decision-making demands, thus realize fault reasoning of the multi-constraint and multi-objective complex system. Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model, which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.

A cellular glass substrate solar concentrator

NASA Technical Reports Server (NTRS)

Bedard, R.; Bell, D.

1980-01-01

The design of a second generation point focusing solar concentration is discussed. The design is based on reflective gores fabricated of thin glass mirror bonded continuously to a contoured substrate of cellular glass. The concentrator aperture and structural stiffness was optimized for minimum concentrator cost given the performance requirement of delivering 56 kWth to a 22 cm diameter receiver aperture with a direct normal insolation of 845 watts sq m and an operating wind of 50 kmph. The reflective panel, support structure, drives, foundation and instrumentation and control subsystem designs, optimized for minimum cost, are summarized. The use of cellular glass as a reflective panel substrate material is shown to offer significant weight and cost advantages compared to existing technology materials.

A novel cost-effective parallel narrowband ANC system with local secondary-path estimation

NASA Astrophysics Data System (ADS)

Delegà, Riccardo; Bernasconi, Giancarlo; Piroddi, Luigi

2017-08-01

Many noise reduction applications are targeted at multi-tonal disturbances. Active noise control (ANC) solutions for such problems are generally based on the combination of multiple adaptive notch filters. Both the performance and the computational cost are negatively affected by an increase in the number of controlled frequencies. In this work we study a different modeling approach for the secondary path, based on the estimation of various small local models in adjacent frequency subbands, that greatly reduces the impact of reference-filtering operations in the ANC algorithm. Furthermore, in combination with a frequency-specific step size tuning method it provides a balanced attenuation performance over the whole controlled frequency range (and particularly in the high end of the range). Finally, the use of small local models is greatly beneficial for the reactivity of the online secondary path modeling algorithm when the characteristics of the acoustic channels are time-varying. Several simulations are provided to illustrate the positive features of the proposed method compared to other well-known techniques.

Fast marching methods for the continuous traveling salesman problem.

PubMed

Andrews, June; Sethian, J A

2007-01-23

We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ("cities") in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the traveling salesman problem, in which an underlying known metric determines the cost of moving through each point of the domain, but in which the actual shortest path between cities is unknown at the outset. We describe algorithms for both a heuristic and an optimal solution to this problem. The complexity of the heuristic algorithm is at worst case M.N log N, where M is the number of cities, and N the size of the computational mesh used to approximate the solutions to the shortest paths problems. The average runtime of the heuristic algorithm is linear in the number of cities and O(N log N) in the size N of the mesh.

Revisiting the finite temperature string method for the calculation of reaction tubes and free energies

NASA Astrophysics Data System (ADS)

Vanden-Eijnden, Eric; Venturoli, Maddalena

2009-05-01

An improved and simplified version of the finite temperature string (FTS) method [W. E, W. Ren, and E. Vanden-Eijnden, J. Phys. Chem. B 109, 6688 (2005)] is proposed. Like the original approach, the new method is a scheme to calculate the principal curves associated with the Boltzmann-Gibbs probability distribution of the system, i.e., the curves which are such that their intersection with the hyperplanes perpendicular to themselves coincides with the expected position of the system in these planes (where perpendicular is understood with respect to the appropriate metric). Unlike more standard paths such as the minimum energy path or the minimum free energy path, the location of the principal curve depends on global features of the energy or the free energy landscapes and thereby may remain appropriate in situations where the landscape is rough on the thermal energy scale and/or entropic effects related to the width of the reaction channels matter. Instead of using constrained sampling in hyperplanes as in the original FTS, the new method calculates the principal curve via sampling in the Voronoi tessellation whose generating points are the discretization points along this curve. As shown here, this modification results in greater algorithmic simplicity. As a by-product, it also gives the free energy associated with the Voronoi tessellation. The new method can be applied both in the original Cartesian space of the system or in a set of collective variables. We illustrate FTS on test-case examples and apply it to the study of conformational transitions of the nitrogen regulatory protein C receiver domain using an elastic network model and to the isomerization of solvated alanine dipeptide.

Tunneling splitting in double-proton transfer: direct diagonalization results for porphycene.

PubMed

Smedarchina, Zorka; Siebrand, Willem; Fernández-Ramos, Antonio

2014-11-07

Zero-point and excited level splittings due to double-proton tunneling are calculated for porphycene and the results are compared with experiment. The calculation makes use of a multidimensional imaginary-mode Hamiltonian, diagonalized directly by an effective reduction of its dimensionality. Porphycene has a complex potential energy surface with nine stationary configurations that allow a variety of tunneling paths, many of which include classically accessible regions. A symmetry-based approach is used to show that the zero-point level, although located above the cis minimum, corresponds to concerted tunneling along a direct trans - trans path; a corresponding cis - cis path is predicted at higher energy. This supports the conclusion of a previous paper [Z. Smedarchina, W. Siebrand, and A. Fernández-Ramos, J. Chem. Phys. 127, 174513 (2007)] based on the instanton approach to a model Hamiltonian of correlated double-proton transfer. A multidimensional tunneling Hamiltonian is then generated, based on a double-minimum potential along the coordinate of concerted proton motion, which is newly evaluated at the RI-CC2/cc-pVTZ level of theory. To make it suitable for diagonalization, its dimensionality is reduced by treating fast weakly coupled modes in the adiabatic approximation. This results in a coordinate-dependent mass of tunneling, which is included in a unique Hermitian form into the kinetic energy operator. The reduced Hamiltonian contains three symmetric and one antisymmetric mode coupled to the tunneling mode and is diagonalized by a modified Jacobi-Davidson algorithm implemented in the Jadamilu software for sparse matrices. The results are in satisfactory agreement with the observed splitting of the zero-point level and several vibrational fundamentals after a partial reassignment, imposed by recently derived selection rules. They also agree well with instanton calculations based on the same Hamiltonian.

Pairing-induced speedup of nuclear spontaneous fission

NASA Astrophysics Data System (ADS)

Sadhukhan, Jhilam; Dobaczewski, J.; Nazarewicz, W.; Sheikh, J. A.; Baran, A.

2014-12-01

Background: Collective inertia is strongly influenced at the level crossing at which the quantum system changes its microscopic configuration diabatically. Pairing correlations tend to make the large-amplitude nuclear collective motion more adiabatic by reducing the effect of these configuration changes. Competition between pairing and level crossing is thus expected to have a profound impact on spontaneous fission lifetimes. Purpose: To elucidate the role of nucleonic pairing on spontaneous fission, we study the dynamic fission trajectories of 264Fm and 240Pu using the state-of-the-art self-consistent framework. Methods: We employ the superfluid nuclear density functional theory with the Skyrme energy density functional SkM* and a density-dependent pairing interaction. Along with shape variables, proton and neutron pairing correlations are taken as collective coordinates. The collective inertia tensor is calculated within the nonperturbative cranking approximation. The fission paths are obtained by using the least action principle in a four-dimensional collective space of shape and pairing coordinates. Results: Pairing correlations are enhanced along the minimum-action fission path. For the symmetric fission of 264Fm, where the effect of triaxiality on the fission barrier is large, the geometry of the fission pathway in the space of the shape degrees of freedom is weakly impacted by pairing. This is not the case for 240Pu, where pairing fluctuations restore the axial symmetry of the dynamic fission trajectory. Conclusions: The minimum-action fission path is strongly impacted by nucleonic pairing. In some cases, the dynamical coupling between shape and pairing degrees of freedom can lead to a dramatic departure from the static picture. Consequently, in the dynamical description of nuclear fission, particle-particle correlations should be considered on the same footing as those associated with shape degrees of freedom.

Pairing-induced speedup of nuclear spontaneous fission

DOE PAGES

Sadhukhan, Jhilam; Dobaczewski, J.; Nazarewicz, W.; ...

2014-12-22

Collective inertia is strongly influenced at the level crossing at which the quantum system changes its microscopic configuration diabatically. Pairing correlations tend to make the large-amplitude nuclear collective motion more adiabatic by reducing the effect of these configuration changes. Competition between pairing and level crossing is thus expected to have a profound impact on spontaneous fission lifetimes. To elucidate the role of nucleonic pairing on spontaneous fission, we study the dynamic fission trajectories of 264Fm and 240Pu using the state-of-the-art self-consistent framework. We employ the superfluid nuclear density functional theory with the Skyrme energy density functional SkM* and a density-dependentmore » pairing interaction. Along with shape variables, proton and neutron pairing correlations are taken as collective coordinates. The collective inertia tensor is calculated within the nonperturbative cranking approximation. The fission paths are obtained by using the least action principle in a four-dimensional collective space of shape and pairing coordinates. Pairing correlations are enhanced along the minimum-action fission path. For the symmetric fission of 264Fm, where the effect of triaxiality on the fission barrier is large, the geometry of the fission pathway in the space of the shape degrees of freedom is weakly impacted by pairing. This is not the case for 240Pu, where pairing fluctuations restore the axial symmetry of the dynamic fission trajectory. The minimum-action fission path is strongly impacted by nucleonic pairing. In some cases, the dynamical coupling between shape and pairing degrees of freedom can lead to a dramatic departure from the static picture. As a result, in the dynamical description of nuclear fission, particle-particle correlations should be considered on the same footing as those associated with shape degrees of freedom.« less

Fuel quality-processing study. Volume 1: Overview and results

NASA Technical Reports Server (NTRS)

Jones, G. E., Jr.

1982-01-01

The methods whereby the intermediate results were obtained are outlined, and the evaluation of the feasible paths from liquid fossil fuel sources to generated electricity is presented. The segments from which these paths were built are the results from the fuel upgrading schemes, on-site treatments, and exhaust gas treatments detailed in the subsequent volumes. The salient cost and quality parameters are included.

Variable Selection for Road Segmentation in Aerial Images

NASA Astrophysics Data System (ADS)

Warnke, S.; Bulatov, D.

2017-05-01

For extraction of road pixels from combined image and elevation data, Wegner et al. (2015) proposed classification of superpixels into road and non-road, after which a refinement of the classification results using minimum cost paths and non-local optimization methods took place. We believed that the variable set used for classification was to a certain extent suboptimal, because many variables were redundant while several features known as useful in Photogrammetry and Remote Sensing are missed. This motivated us to implement a variable selection approach which builds a model for classification using portions of training data and subsets of features, evaluates this model, updates the feature set, and terminates when a stopping criterion is satisfied. The choice of classifier is flexible; however, we tested the approach with Logistic Regression and Random Forests, and taylored the evaluation module to the chosen classifier. To guarantee a fair comparison, we kept the segment-based approach and most of the variables from the related work, but we extended them by additional, mostly higher-level features. Applying these superior features, removing the redundant ones, as well as using more accurately acquired 3D data allowed to keep stable or even to reduce the misclassification error in a challenging dataset.

Fast Transformation of Temporal Plans for Efficient Execution

NASA Technical Reports Server (NTRS)

Tsamardinos, Ioannis; Muscettola, Nicola; Morris, Paul

1998-01-01

Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of execution flexibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the flexible plan. To minimize execution latency, this propagation needs to be very efficient. Previous work showed that every temporal plan can be reformulated as a dispatchable plan, i.e., one for which propagation to immediate neighbors is sufficient. A simple algorithm was given that finds a dispatchable plan with a minimum number of edges in cubic time and quadratic space. In this paper, we focus on the efficiency of the reformulation process, and improve on that result. A new algorithm is presented that uses linear space and has time complexity equivalent to Johnson s algorithm for all-pairs shortest-path problems. Experimental evidence confirms the practical effectiveness of the new algorithm. For example, on a large commercial application, the performance is improved by at least two orders of magnitude. We further show that the dispatchable plan, already minimal in the total number of edges, can also be made minimal in the maximum number of edges incoming or outgoing at any node.

Structural modulation of nanowire interfaces grown over selectively disrupted single crystal surfaces

NASA Astrophysics Data System (ADS)

Garratt, E.; Nikoobakht, B.

2015-08-01

Recent breakthroughs in deterministic approaches to the fabrication of nanowire arrays have demonstrated the possibility of fabricating such networks using low-cost scalable methods. In this regard, we have developed a scalable growth platform for lateral fabrication of nanocrystals with high precision utilizing lattice match and symmetry. Using this planar architecture, a number of homo- and heterostructures have been demonstrated including ZnO nanowires grown over GaN. The latter combination produces horizontal, epitaxially formed crystals aligned in the plane of the substrate containing a very low number of intrinsic defects. We use such ordered structures as model systems in the interests of gauging the interfacial structural dynamics in relation to external stimuli. Nanosecond pulses of focused ion beams are used to slightly modify the substrate surface and selectively form lattice disorders in the path of nanowire growth to examine the nanocrystal, namely: its directionality and lattice defects. High resolution electron microscopies are used to reveal some interesting structural effects; for instance, a minimum threshold of surface defects that can divert nanowires. We also discuss data indicating formation of surface strains and show their mitigation during the growth process.

Electronic structure and molecular dynamics of Na2Li

NASA Astrophysics Data System (ADS)

Malcolm, Nathaniel O. J.; McDouall, Joseph J. W.

Following the first report (Mile, B., Sillman, P. D., Yacob, A. R. and Howard, J. A., 1996, J. chem. Soc. Dalton Trans , 653) of the EPR spectrum of the mixed alkali-metal trimer Na2Li a detailed study has been made of the electronic structure and structural dynamics of this species. Two isomeric forms have been found: one of the type, Na-Li-Na, of C , symmetry and another, Li-Na-Na, of C symmetry. Also, there are two linear saddle points which correspond to 'inversion' transition structures, and a saddle point of C symmetry which connects the two minima. A molecular dynamics investigation of these species shows that, at the temperature of the reported experiments (170 K), the C minimum is not 'static', but undergoes quite rapid inversion. At higher temperatures the C minimum converts to the C form, but by a mechanism very different from that suggested by minimum energy path considerations. 2 2v s s 2v 2v s

Shortest path problem on a grid network with unordered intermediate points

NASA Astrophysics Data System (ADS)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

Dynamic path planning for autonomous driving on various roads with avoidance of static and moving obstacles

NASA Astrophysics Data System (ADS)

Hu, Xuemin; Chen, Long; Tang, Bo; Cao, Dongpu; He, Haibo

2018-02-01

This paper presents a real-time dynamic path planning method for autonomous driving that avoids both static and moving obstacles. The proposed path planning method determines not only an optimal path, but also the appropriate acceleration and speed for a vehicle. In this method, we first construct a center line from a set of predefined waypoints, which are usually obtained from a lane-level map. A series of path candidates are generated by the arc length and offset to the center line in the s - ρ coordinate system. Then, all of these candidates are converted into Cartesian coordinates. The optimal path is selected considering the total cost of static safety, comfortability, and dynamic safety; meanwhile, the appropriate acceleration and speed for the optimal path are also identified. Various types of roads, including single-lane roads and multi-lane roads with static and moving obstacles, are designed to test the proposed method. The simulation results demonstrate the effectiveness of the proposed method, and indicate its wide practical application to autonomous driving.

The differential impact of low-carbon technologies on climate change mitigation cost under a range of socioeconomic and climate policy scenarios.

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

Barron, Robert W.; McJeon, Haewon C.

2015-05-01

This paper considers the effect of several key parameters of low carbon energy technologies on the cost of abatement. A methodology for determining the minimum level of performance required for a parameter to have a statistically significant impact on CO2 abatement cost is developed and used to evaluate the impact of eight key parameters of low carbon energy supply technologies on the cost of CO2 abatement. The capital cost of nuclear technology is found to have the greatest impact of the parameters studied. The cost of biomass and CCS technologies also have impacts, while their efficiencies have little, if any.more » Sensitivity analysis of the results with respect to population, GDP, and CO2 emission constraint show that the minimum performance level and impact of nuclear technologies is consistent across the socioeconomic scenarios studied, while the other technology parameters show different performance under higher population, lower GDP scenarios. Solar technology was found to have a small impact, and then only at very low costs. These results indicate that the cost of nuclear is the single most important driver of abatement cost, and that trading efficiency for cost may make biomass and CCS technologies more competitive.« less

Energetics of swimming by the ferret: consequences of forelimb paddling.

PubMed

Fish, Frank E; Baudinette, Russell V

2008-06-01

The domestic ferret (Mustela putorius furo) swims by alternate strokes of the forelimbs. This pectoral paddling is rare among semi-aquatic mammals. The energetic implications of swimming by pectoral paddling were examined by kinematic analysis and measurement of oxygen consumption. Ferrets maintained a constant stroke frequency, but increased swimming speed by increasing stroke amplitude. The ratio of swimming velocity to foot stroke velocity was low, indicating a low propulsive efficiency. Metabolic rate increased linearly with increasing speed. The cost of transport decreased with increasing swimming speed to a minimum of 3.59+/-0.28 J N(-1) m(-1) at U=0.44 m s(-1). The minimum cost of transport for the ferret was greater than values for semi-aquatic mammals using hind limb paddling, but lower than the minimum cost of transport for the closely related quadrupedally paddling mink. Differences in energetic performance may be due to the amount of muscle recruited for propulsion and the interrelationship hydrodynamic drag and interference between flow over the body surface and flow induced by propulsive appendages.

Cost-effectiveness analysis of oral anti-viral drugs used for treatment of chronic hepatitis B in Turkey.

PubMed

Kockaya, Guvenc; Kose, Akin; Yenilmez, Fatma Betul; Ozdemir, Oktay; Kucuksayrac, Ece

2015-01-01

All international guidelines suggested that Tenofovir and Entecavir are the primary drugs at the first line therapy for the treatment of chronic hepatitis B (CHB). However, in Turkey these medications reimbursed at the second line therapy according to the Healthcare Implementation Notification. The aim of this study is to compare the cost effectiveness of oral antiviral treatment strategies in CHB for Turkey using lamuvidine, telbuvidine, entecavir, and tenofovir as medications. The analysis was conducted using Markov models. The analysis scenarios based on first line treatment options with Lamuvidine, Telbuvidine, Entecavir, and Tenofovir as the medications. In the analysis, inadequate response or resistance after receiving 12 months of the treatment with Entecavir and Telbivudine were compared to the results found from switching from Entecavir to Tenofovir or from switching from Telbuvidine to Tenofovir. In additional, inadequate response or resistance after receiving 6 months of the treatment for Lamivudine was compared to the results found from switching from Lamivudine to Tenofovir. The study population included men and women, who were 40 years of age. The patients` compliance was estimated 100 % for all of the therapy options. The model duration was constructed to evaluate, treatment strategy duration of 40 years. The cost of medications, examinations/follow-ups and complications were included in the model. Years of Potential Life Lost was used as the health outcome. An incremental cost-effectiveness ratio analysis has been conducted. While the minimum years of life lost was found as 0.22 with tenofovir treatment in 5 years, treatment cost was calculated as 12,169 TL. These values were detected as 0.56 years and 7727 TL, 0.37 years and 12,770 TL, respectively for lamuvidine and telbuvidine treatments. The maximum years of life lost and treatment cost was with lamuvidine treatment were detected as 1.60 years and 18,813 TL and, secondly 0.89 years and 24,007 TL for lamuvidine-tenofovir treatment during 10 years. The minimum years of life lost and cost are 0.54 year and 35,821 TL for tenofovir treatment during 10 years. The minimum years of life lost and cost were determined as 1.21 years and 52,839 TL for tenofovir treatment strategy during 20 years. During 30 years period, tenofovir treatment was found to have the minimum years of life lost (1.73 years) and minimum cost (84,149 TL). When the results of 40 years period were analyzed, years of life lost and costs are 2.06 years and 119,604 TL, 2.13 years and 162,115 TL, 2.13 years and 161,642 TL, 6.52 years and 147,245 TL, 3.20 years and 132,157 TL, 4.10 years and 151,059 TL and 3.05 years and 138,182 TL for tenofovir, entecavir, entecavir-tenofovir, lamuvidine, lamuvidine-tenofovir, telbivudine and telbivudine-tenofovir. In the model presented in this study, in cost effectiveness analysis about CHB treatments, Tenofovir was found to be one of the cost effective methods in comparison with other treatment strategies different time intervals. Beyond this achievement Tenofovir has shown to reduce cumulative treatment cost in first line CHB treatment when compared with regard to 40 year cumulative treatment cost.

A Danish cost-effectiveness model of escitalopram in comparison with citalopram and venlafaxine as first-line treatments for major depressive disorder in primary care.

PubMed

Sørensen, Jan; Stage, Kurt B; Damsbo, Niels; Le Lay, Agathe; Hemels, Michiel E

2007-01-01

The objective of this study was to model the cost-effectiveness of escitalopram in comparison with generic citalopram and venlafaxine in primary care treatment of major depressive disorder (baseline scores 22-40 on the Montgomery-Asberg Depression Rating Scale, MADRS) in Denmark. A three-path decision analytic model with a 6-month horizon was used. All patients started at the primary care path and were referred to outpatient or inpatient secondary care in the case of insufficient response to treatment. Model inputs included drug-specific probabilities derived from systematic literature review, ad-hoc survey and expert opinion. Main outcome measures were remission defined as MADRS < or = 12 and treatment costs. Analyses were conducted from healthcare system and societal perspectives. The human capital approach was used to estimate societal cost of lost productivity. Costs were reported in 2004 DDK. The expected overall 6-month remission rate was higher for escitalopram (64.1%) than citalopram (58.9%). From both perspectives, the total expected cost per successfully treated patient was lower for escitalopram (DKK 22,323 healthcare, DKK 72,399 societal) than for citalopram (DKK 25,778 healthcare, DKK 87,786 societal). Remission rates and costs were similar for escitalopram and venlafaxine. Robustness of the findings was verified in multivariate sensitivity analyses. For patients in primary care, escitalopram appears to be a cost-effective alternative to (generic) citalopram, with greater clinical benefit and cost-savings, and similar in cost-effectiveness to venlafaxine.

The cost of noise reduction in commercial tilt rotor aircraft

NASA Technical Reports Server (NTRS)

Faulkner, H. B.

1974-01-01

The relationship between direct operating cost (DOC) and departure noise annoyance was developed for commercial tilt rotor aircraft. This was accomplished by generating a series of tilt rotor aircraft designs to meet various noise goals at minimum DOC. These vehicles were spaced across the spectrum of possible noise levels from completely unconstrained to the quietest vehicle that could be designed within the study ground rules. A group of optimization parameters were varied to find the minimum DOC while other inputs were held constant and some external constraints were met. This basic variation was then extended to different aircraft sizes and technology time frames. It was concluded that reducing noise annoyance by designing for lower rotor tip speeds is a very promising avenue for future research and development. It appears that the cost of halving the annoyance compared to an unconstrained design is insignificant and the cost of halving the annoyance again is small.

Techno-economic assessment of pellets produced from steam pretreated biomass feedstock

DOE PAGES

Shahrukh, Hassan; Oyedun, Adetoyese Olajire; Kumar, Amit; ...

2016-03-10

Minimum production cost and optimum plant size are determined for pellet plants for three types of biomass feedstock e forest residue, agricultural residue, and energy crops. The life cycle cost from harvesting to the delivery of the pellets to the co-firing facility is evaluated. The cost varies from 95 to 105 t -1 for regular pellets and 146–156 t -1 for steam pretreated pellets. The difference in the cost of producing regular and steam pretreated pellets per unit energy is in the range of 2e3 GJ -1. The economic optimum plant size (i.e., the size at which pellet production costmore » is minimum) is found to be 190 kt for regular pellet production and 250 kt for steam pretreated pellet. Furthermore, sensitivity and uncertainty analyses were carried out to identify sensitivity parameters and effects of model error.« less

Ranked solutions to a class of combinatorial optimizations—with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media

NASA Astrophysics Data System (ADS)

Doerr, Timothy P.; Alves, Gelio; Yu, Yi-Kuo

2005-08-01

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently find approximate solutions-find a transformation that makes the cost function as similar as possible to that of the solvable class. After keeping many high-ranking solutions using the approximate cost function, one may then re-assess these solutions with the full cost function to find the best approximate solution. Under this approach, it is important to be able to assess the quality of the solutions obtained, e.g., by finding the true ranking of the kth best approximate solution when all possible solutions are considered exhaustively. To tackle this statistical issue, we provide a systematic method starting with a scaling function generated from the finite number of high-ranking solutions followed by a convergent iterative mapping. This method, useful in a variant of the directed paths in random media problem proposed here, can also provide a statistical significance assessment for one of the most important proteomic tasks-peptide sequencing using tandem mass spectrometry data. For directed paths in random media, the scaling function depends on the particular realization of randomness; in the mass spectrometry case, the scaling function is spectrum-specific.

A hip joint simulator study using simplified loading and motion cycles generating physiological wear paths and rates.

PubMed

Barbour, P S; Stone, M H; Fisher, J

1999-01-01

In some designs of hip joint simulator the cost of building a highly complex machine has been offset with the requirement for a large number of test stations. The application of the wear results generated by these machines depends on their ability to reproduce physiological wear rates and processes. In this study a hip joint simulator has been shown to reproduce physiological wear using only one load vector and two degrees of motion with simplified input cycles. The actual path of points on the femoral head relative to the acetabular cup were calculated and compared for physiological and simplified input cycles. The in vitro wear rates were found to be highly dependent on the shape of these paths and similarities could be drawn between the shape of the physiological paths and the simplified elliptical paths.

Point and path performance of light aircraft: A review and analysis

NASA Technical Reports Server (NTRS)

Smetana, F. O.; Summey, D. C.; Johnson, W. D.

1973-01-01

The literature on methods for predicting the performance of light aircraft is reviewed. The methods discussed in the review extend from the classical instantaneous maximum or minimum technique to techniques for generating mathematically optimum flight paths. Classical point performance techniques are shown to be adequate in many cases but their accuracies are compromised by the need to use simple lift, drag, and thrust relations in order to get closed form solutions. Also the investigation of the effect of changes in weight, altitude, configuration, etc. involves many essentially repetitive calculations. Accordingly, computer programs are provided which can fit arbitrary drag polars and power curves with very high precision and which can then use the resulting fits to compute the performance under the assumption that the aircraft is not accelerating.

LCRD Update and Path to Optical Relay Operations

NASA Technical Reports Server (NTRS)

Israel, David

2017-01-01

Speaker and Presenter at the Lincoln Laboratory Communications Workshop on May 23, 2017 at the Massachusetts Institute of Technology Lincoln Laboratory in Lexington, MA. This presentation discusses a concept for an evolution of NASAs optical communications near-Earth relay architecture. NASA's Laser Communications Relay Demonstration (LCRD) is a joint project between NASAs Goddard Space Flight Center (GSFC), the Jet Propulsion Laboratory California Institute of Technology (JPL), and the Massachusetts Institute of Technology Lincoln Laboratory (MIT LL). LCRD will provide a minimum of two years of high data rate optical communications service experiments in geosynchronous orbit (GEO) following launch in 2019. This presentation will provide an update of the LCRD mission status and planned capabilities and experiments, followed by a discussion of the path from LCRD to operational network capabilities.

Optimizing the Compressive Strength of Strain-Hardenable Stretch-Formed Microtruss Architectures

NASA Astrophysics Data System (ADS)

Yu, Bosco; Abu Samk, Khaled; Hibbard, Glenn D.

2015-05-01

The mechanical performance of stretch-formed microtrusses is determined by both the internal strut architecture and the accumulated plastic strain during fabrication. The current study addresses the question of optimization, by taking into consideration the interdependency between fabrication path, material properties and architecture. Low carbon steel (AISI1006) and aluminum (AA3003) material systems were investigated experimentally, with good agreement between measured values and the analytical model. The compressive performance of the microtrusses was then optimized on a minimum weight basis under design constraints such as fixed starting sheet thickness and final microtruss height by satisfying the Karush-Kuhn-Tucker condition. The optimization results were summarized as carpet plots in order to meaningfully visualize the interdependency between architecture, microstructural state, and mechanical performance, enabling material and processing path selection.

When the 'soft-path' gets hard: demand management and financial instability for water utilities

NASA Astrophysics Data System (ADS)

Zeff, H. B.; Characklis, G. W.

2014-12-01

In the past, cost benefit analysis (CBA) has been viewed as an effective means of evaluating water utility strategies, particularly those that were dependent on the construction of new supply infrastructure. As water utilities have begun to embrace 'soft-path' approaches as a way to reduce the need for supply-centric development, CBA fails to recognize some important financial incentives affected by reduced water consumption. Demand management, both as a short-term response to drought and in longer-term actions to accommodate demand growth, can introduce revenue risks that adversely affect a utility's ability to repay debt, re-invest in aging infrastructure, or maintain reserve funds for use in a short-term emergency. A utility that does not generate sufficient revenue to support these functions may be subject to credit rating downgrades, which in turn affect the interest rate it pays on its debt. Interest rates are a critical consideration for utility managers in the capital-intensive water sector, where debt payments for infrastructure often account for a large portion of a utility's overall costs. Even a small increase in interest rates can add millions of dollars to the cost of new infrastructure. Recent studies have demonstrated that demand management techniques can lead to significant revenue variability, and credit rating agencies have begun to take notice of drought response plans when evaluating water utility credit ratings, providing utilities with a disincentive to fully embrace soft-path approaches. This analysis examines the impact of demand management schemes on key credit rating metrics for a water utility in Raleigh, North Carolina. The utility's consumer base is currently experiencing rapid population growth, and demand management has the potential to reduce the dependence on costly new supply infrastructure but could lead to financial instability that will significantly increase the costs of financing future projects. This work analyzes how 'soft-path' approaches might be more efficiently integrated with investment in supply-side infrastructure and suggests how financial hedging tools could be used to improve long-term utility planning objectives.

Balancing reliability and cost to choose the best power subsystem

NASA Technical Reports Server (NTRS)

Suich, Ronald C.; Patterson, Richard L.

1991-01-01

A mathematical model is presented for computing total (spacecraft) subsystem cost including both the basic subsystem cost and the expected cost due to the failure of the subsystem. This model is then used to determine power subsystem cost as a function of reliability and redundancy. Minimum cost and maximum reliability and/or redundancy are not generally equivalent. Two example cases are presented. One is a small satellite, and the other is an interplanetary spacecraft.

42 CFR 447.52 - Minimum and maximum income-related charges.

Code of Federal Regulations, 2013 CFR

2013-10-01

... agency imposes cost sharing under § 447.54, the process by which hospital emergency room services are... option, cost sharing imposed for any service (other than for drugs and non-emergency services furnished... group under § 447.56(a), and (iii) For cost sharing imposed for non-emergency services furnished in an...

Green Energy in New Construction: Maximize Energy Savings and Minimize Cost

ERIC Educational Resources Information Center

Ventresca, Joseph

2010-01-01

People often use the term "green energy" to refer to alternative energy technologies. But green energy doesn't guarantee maximum energy savings at a minimum cost--a common misconception. For school business officials, green energy means getting the lowest energy bills for the lowest construction cost, which translates into maximizing green energy…

A minimum income for healthy living

PubMed Central

Morris, J; Donkin, A; Wonderling, D; Wilkinson, P; Dowler, E

2000-01-01

BACKGROUND—Half a century of research has provided consensual evidence of major personal requisites of adult health in nutrition, physical activity and psychosocial relations. Their minimal money costs, together with those of a home and other basic necessities, indicate disposable income that is now essential for health.
METHODS—In a first application we identified such representative minimal costs for healthy, single, working men aged 18-30, in the UK. Costs were derived from ad hoc survey, relevant figures in the national Family Expenditure Survey, and by pragmatic decision for the few minor items where survey data were not available.
RESULTS—Minimum costs were assessed at £131.86 per week (UK April 1999 prices). Component costs, especially those of housing (which represents around 40% of this total), depend on region and on several assumptions. By varying these a range of totals from £106.47 to £163.86 per week was detailed. These figures compare, 1999, with the new UK national minimum wage, after statutory deductions, of £105.84 at 18-21 years and £121.12 at 22+ years for a 38 hour working week. Corresponding basic social security rates are £40.70-£51.40 per week.
INTERPRETATION—Accumulating science means that absolute standards of living, "poverty", minimal official incomes and the like, can now be assessed by objective measurement of the personal capacity to meet the costs of major requisites of healthy living. A realistic assessment of these costs is presented as an impetus to public discussion. It is a historical role of public health as social medicine to lead in public advocacy of such a national agenda.


Keywords: income; public health; lifestyle; nutrition; housing; exercise; social exclusion; inequalities PMID:11076983

Optimal Propellant Maneuver Flight Demonstrations on ISS

NASA Technical Reports Server (NTRS)

Bhatt, Sagar; Bedrossian, Nazareth; Longacre, Kenneth; Nguyen, Louis

2013-01-01

In this paper, first ever flight demonstrations of Optimal Propellant Maneuver (OPM), a method of propulsive rotational state transition for spacecraft controlled using thrusters, is presented for the International Space Station (ISS). On August 1, 2012, two ISS reorientations of about 180deg each were performed using OPMs. These maneuvers were in preparation for the same-day launch and rendezvous of a Progress vehicle, also a first for ISS visiting vehicles. The first maneuver used 9.7 kg of propellant, whereas the second used 10.2 kg. Identical maneuvers performed without using OPMs would have used approximately 151.1kg and 150.9kg respectively. The OPM method is to use a pre-planned attitude command trajectory to accomplish a rotational state transition. The trajectory is designed to take advantage of the complete nonlinear system dynamics. The trajectory choice directly influences the cost of the maneuver, in this case, propellant. For example, while an eigenaxis maneuver is kinematically the shortest path between two orientations, following that path requires overcoming the nonlinear system dynamics, thereby increasing the cost of the maneuver. The eigenaxis path is used for ISS maneuvers using thrusters. By considering a longer angular path, the path dependence of the system dynamics can be exploited to reduce the cost. The benefits of OPM for the ISS include not only reduced lifetime propellant use, but also reduced loads, erosion, and contamination from thrusters due to fewer firings. Another advantage of the OPM is that it does not require ISS flight software modifications since it is a set of commands tailored to the specific attitude control architecture. The OPM takes advantage of the existing ISS control system architecture for propulsive rotation called USTO control mode1. USTO was originally developed to provide ISS Orbiter stack attitude control capability for a contingency tile-repair scenario, where the Orbiter is maneuvered using its robotic manipulator relative to the ISS. Since 2005 USTO has been used for nominal ISS operations.

Minimum-sized ideal reactor for continuous alcohol fermentation using immobilized microorganism

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

Yamane, T.; Shimizu, S.

Recently, alcohol fermentation has gained considerable attention with the aim of lowering its production cost in the production processes of both fuel ethanol and alcoholic beverages. The over-all cost is a summation of costs of various subsystems such as raw material (sugar, starch, and cellulosic substances) treatment, fermentation process, and alcohol separation from water solutions; lowering the cost of the fermentation processes is very important in lowering the total cost. Several new techniques have been developed for economic continuous ethanol production, use of a continuous wine fermentor with no mechanical stirring, cell recycle combined with continuous removal of ethanol undermore » vaccum, a technique involving a bed of yeast admixed with an inert carrier, and use of immobilized yeast reactors in packed-bed column and in a three-stage double conical fluidized-bed bioreactor. All these techniques lead to increases more or less, in reactor productivity, which in turn result in the reduction of the reactor size for a given production rate and a particular conversion. Since an improvement in the fermentation process often leads to a reduction of fermentor size and hence, a lowering of the initial construction cost, it is important to theoretically arrive at a solution to what is the minimum-size setup of ideal reactors from the viewpoint of liquid backmixing. In this short communication, the minimum-sized ideal reactor for continuous alcohol fermentation using immobilized cells will be specifically discussed on the basis of a mathematical model. The solution will serve for designing an optimal bioreactor. (Refs. 26).« less

The cost of noise reduction for departure and arrival operations of commercial tilt rotor aircraft

NASA Technical Reports Server (NTRS)

Faulkner, H. B.; Swan, W. M.

1976-01-01

The relationship between direct operating cost (DOC) and noise annoyance due to a departure and an arrival operation was developed for commercial tilt rotor aircraft. This was accomplished by generating a series of tilt rotor aircraft designs to meet various noise goals at minimum DOC. These vehicles ranged across the spectrum of possible noise levels from completely unconstrained to the quietest vehicles that could be designed within the study ground rules. Optimization parameters were varied to find the minimum DOC. This basic variation was then extended to different aircraft sizes and technology time frames.

Confronting Regulatory Cost and Quality Expectations. An Exploration of Technical Change in Minimum Efficiency Performance Standards

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

Taylor, Margaret; Spurlock, C. Anna; Yang, Hung-Chia

The dual purpose of this project was to contribute to basic knowledge about the interaction between regulation and innovation and to inform the cost and benefit expectations related to technical change which are embedded in the rulemaking process of an important area of national regulation. The area of regulation focused on here is minimum efficiency performance standards (MEPS) for appliances and other energy-using products. Relevant both to U.S. climate policy and energy policy for buildings, MEPS remove certain product models from the market that do not meet specified efficiency thresholds.

Rationalizing spatial exploration patterns of wild animals and humans through a temporal discounting framework.

PubMed

Namboodiri, Vijay Mohan K; Levy, Joshua M; Mihalas, Stefan; Sims, David W; Hussain Shuler, Marshall G

2016-08-02

Understanding the exploration patterns of foragers in the wild provides fundamental insight into animal behavior. Recent experimental evidence has demonstrated that path lengths (distances between consecutive turns) taken by foragers are well fitted by a power law distribution. Numerous theoretical contributions have posited that "Lévy random walks"-which can produce power law path length distributions-are optimal for memoryless agents searching a sparse reward landscape. It is unclear, however, whether such a strategy is efficient for cognitively complex agents, from wild animals to humans. Here, we developed a model to explain the emergence of apparent power law path length distributions in animals that can learn about their environments. In our model, the agent's goal during search is to build an internal model of the distribution of rewards in space that takes into account the cost of time to reach distant locations (i.e., temporally discounting rewards). For an agent with such a goal, we find that an optimal model of exploration in fact produces hyperbolic path lengths, which are well approximated by power laws. We then provide support for our model by showing that humans in a laboratory spatial exploration task search space systematically and modify their search patterns under a cost of time. In addition, we find that path length distributions in a large dataset obtained from free-ranging marine vertebrates are well described by our hyperbolic model. Thus, we provide a general theoretical framework for understanding spatial exploration patterns of cognitively complex foragers.

Ascent trajectory optimization for stratospheric airship with thermal effects

NASA Astrophysics Data System (ADS)

Guo, Xiao; Zhu, Ming

2013-09-01

Ascent trajectory optimization with thermal effects is addressed for a stratospheric airship. Basic thermal characteristics of the stratospheric airship are introduced. Besides, the airship’s equations of motion are constructed by including the factors about aerodynamic force, added mass and wind profiles which are developed based on horizontal-wind model. For both minimum-time and minimum-energy flights during ascent, the trajectory optimization problem is described with the path and terminal constraints in different scenarios and then, is converted into a parameter optimization problem by a direct collocation method. Sparse Nonlinear OPTimizer(SNOPT) is employed as a nonlinear programming solver and two scenarios are adopted. The solutions obtained illustrate that the trajectories are greatly affected by the thermal behaviors which prolong the daytime minimum-time flights of about 20.8% compared with that of nighttime in scenario 1 and of about 10.5% in scenario 2. And there is the same trend for minimum-energy flights. For the energy consumption of minimum-time flights, 6% decrease is abstained in scenario 1 and 5% decrease in scenario 2. However, a few energy consumption reduction is achieved for minimum-energy flights. Solar radiation is the principal component and the natural wind also affects the thermal behaviors of stratospheric airship during ascent. The relationship between take-off time and performance of airship during ascent is discussed. it is found that the take-off time at dusk is best choice for stratospheric airship. And in addition, for saving energy, airship prefers to fly downwind.

The social cost of illegal drug consumption in Spain.

PubMed

García-Altés, Anna; Ollé, Josep Ma; Antoñanzas, Fernando; Colom, Joan

2002-09-01

The objective of this study was to estimate the social cost of the consumption of illegal drugs in Spain. We performed a cost-of-illness study, using a prevalence approximation and a societal perspective. The estimation of costs and consequences referred to 1997. As direct costs we included health-care costs, prevention, continuing education, research, administrative costs, non-governmental organizations and crime-related costs. As indirect costs we included lost productivity associated with mortality and the hospitalization of patients. Estimation of intangible costs was not included. The minimum cost of illegal drug consumption in Spain is 88,800 million pesetas (PTA) (467 million dollars). Seventy-seven per cent of the costs correspond to direct costs. Of those, crime-related costs represent 18%, while the largest part corresponds to the health-care costs (50% of direct costs). From the perspective of the health-care system, the minimum cost of illegal drug consumption is 44,000 million PTA (231 million dollars). The cost of illegal drug consumption represents 0.07% of the Spanish GDP. This gross figure compares with 2250 million PTA (12.5 million dollars) invested in prevention programmes during the same year, and with 12,300 million PTA (68.3 million dollars) spent on specific programmes and resources for the drug addict population. Although there are limitations intrinsic in this type of study and the estimations obtained in the present analysis are likely to be an underestimate of the real cost of this condition, we estimate that illegal drug consumption costs the Spanish economy at least 0.2% of GDP.

Adverse Climatic Conditions and Impact on Construction Scheduling and Cost

DTIC Science & Technology

1988-01-01

ABBREVIATIONS ABS MAX MAX TEMP ...... Absolute maximum maximum temperature ABS MIN MIN TEMP ...... Absolute minimum minimum temperature BTU...o Degrees Farenheit MEAN MAX TEMP o.................... Mean maximum temperature MEAN MIN TEMP...temperatures available, a determination had to be made as to whether forecasts were based on absolute , mean, or statistically derived temperatures